Temat: first order - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Discretization of singular systems and error estimation
Autorzy:: Karampetakis, N. P.
Karamichalis, R.
Powiązania:: https://bibliotekanauki.pl/articles/330393.pdf
Data publikacji:: 2014
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: descriptor system
discretization
truncation error
first order hold
zero order hold
układ deskrypcyjny
dyskretyzacja
błąd obcięcia
szacowanie błędu
Opis:: This paper proposes a discretization technique for a descriptor differential system. The methodology used is both triangular first order hold discretization and zero order hold for the input function. Upper bounds for the error between the continuous and the discrete time solution are produced for both discretization methods and are shown to be better than any other existing method in the literature.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2014, 24, 1; 65-73
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Optimal Shape Design for Elliptic Equations Via Bie-Methods
Autorzy:: Eppler, K.
Powiązania:: https://bibliotekanauki.pl/articles/911209.pdf
Data publikacji:: 2000
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: rozwiązanie podstawowe
równanie całkowe
optimal shape design
fundamental solution
boundary integral equation
first-order necessary condition
Opis:: A special description of the boundary variation in a shape optimization problem is investigated. This, together with the use of a potential theory for the state, result in natural embedding of the problem in a Banach space. Therefore, standard differential calculus can be applied in order to prove the Frechet-differentiability of the cost function for appropriately chosen data (sufficiently smooth). Moreover, necessary optimality conditions are obtained in a similar way as in other approaches, and are expressed in terms of an adjoint state for more regular data.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2000, 10, 3; 487-516
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Modeling of distributed objects computing pattern combinations using a formal specification language
Autorzy:: Taibi, T.
Ngo, D. C. L.
Powiązania:: https://bibliotekanauki.pl/articles/908185.pdf
Data publikacji:: 2003
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: informatyka
Balanced Pattern Specification Language (BPSL)
First-Order Logic (FOL)
Temporal Logic of Actions (TLA)
substitution
addition
elimination
Opis:: Design patterns help us to respond to the challenges faced while developing Distributed Object Computing (DOC) applications by shifting developers' focus to high-level design concerns, rather than platform specific details. However, due to the inherent ambiguity of the existing textual and graphical descriptions of the design patterns, users are faced with difficulties in understanding when and how to use them. Since design patterns are seldom used in isolation but are usually combined to solve complex problems, the above-mentioned difficulties have even worsened. The formal specification of design patterns and their combination is not meant to replace the existing means of describing patterns, but to complement them in order to achieve accuracy and to allow rigorous reasoning about them. The main problem of the existing formal specification languages for design patterns is the lack of completeness. This is mainly because they tend to focus on specifying either the structural or behavioral aspects of design patterns but not both of them. Moreover, none of them even ventured in specifying DOC patterns and pattern combinations. We propose a simple yet Balanced Pattern Specification Language (BPSL) aimed to achieve equilibrium by specifying both the aspects of design patterns. The language combines two subsets of logic: one from the First-Order Logic (FOL) and the other from the Temporal Logic of Actions (TLA).
Źródło:: International Journal of Applied Mathematics and Computer Science; 2003, 13, 2; 239-253
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "first order" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język