Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "interval system" wg kryterium: Temat


Wyświetlanie 1-6 z 6
Tytuł:
Robust stability of positive continuous-time linear systems with delays
Autorzy:
Busłowicz, M.
Powiązania:
https://bibliotekanauki.pl/articles/908143.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
czas ciągły
system liniowy
opóźnienie
stabilność odporna
niepewność liniowa
positive continuous-time linear system
delay
robust stability
linear uncertainty
interval system
Opis:
The paper is devoted to the problem of robust stability of positive continuous-time linear systems with delays with structured perturbations of state matrices. Simple necessary and sufficient conditions for robust stability in the general case and in the case of systems with a linear uncertainty structure in two sub-cases: (i) a unity rank uncertainty structure and (ii) nonnegative perturbation matrices are established. The problems are illustrated with numerical examples.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2010, 20, 4; 665-670
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Stability of interval positive fractional discrete-time linear systems
Autorzy:
Kaczorek, T.
Powiązania:
https://bibliotekanauki.pl/articles/331118.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
interval system
positive system
fractional system
linear discrete-time system
stability
system przedziałowy
układ dodatni
układ ułamkowy
układ liniowy
układ dyskretno-czasowy
Opis:
The aim of this work is to show that interval positive fractional discrete-time linear systems are asymptotically stable if and only if the respective lower and upper bound systems are asymptotically stable. The classical Kharitonov theorem is extended to interval positive fractional linear systems.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2018, 28, 3; 451-456
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Enclosures for the solution set of parametric interval linear systems
Autorzy:
Hladík, M.
Powiązania:
https://bibliotekanauki.pl/articles/330122.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
system liniowy
system przedziałowy
rozwiązywanie zbioru
macierz przedziałowa
linear interval systems
solution set
interval matrix
Opis:
We investigate parametric interval linear systems of equations. The main result is a generalization of the Bauer-Skeel and the Hansen-Bliek-Rohn bounds for this case, comparing and refinement of both. We show that the latter bounds are not provable better, and that they are also sometimes too pessimistic. The presented form of both methods is suitable for combining them into one to get a more efficient algorithm. Some numerical experiments are carried out to illustrate performances of the methods.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 3; 561-574
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A verified method for solving piecewise smooth initial value problems
Autorzy:
Auer, E.
Kiel, S.
Rauh, A.
Powiązania:
https://bibliotekanauki.pl/articles/331354.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
interval method
non smooth system
initial value problem
metoda przedziałowa
metoda nie gładka
zagadnienie początkowe
Opis:
In many applications, there is a need to choose mathematical models that depend on non-smooth functions. The task of simulation becomes especially difficult if such functions appear on the right-hand side of an initial value problem. Moreover, solution processes from usual numerics are sensitive to roundoff errors so that verified analysis might be more useful if a guarantee of correctness is required or if the system model is influenced by uncertainty. In this paper, we provide a short overview of possibilities to formulate non-smooth problems and point out connections between the traditional non-smooth theory and interval analysis. Moreover, we summarize already existing verified methods for solving initial value problems with non-smooth (in fact, even not absolutely continuous) right-hand sides and propose a way of handling a certain practically relevant subclass of such systems. We implement the approach for the solver VALENCIA-IVP by introducing into it a specialized template for enclosing the first-order derivatives of non-smooth functions. We demonstrate the applicability of our technique using a mechanical system model with friction and hysteresis. We conclude the paper by giving a perspective on future research directions in this area.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2013, 23, 4; 731-747
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The interval Shapley value of an M/M/1 service system
Autorzy:
E, C. G.
Li, Q. L.
Li, S.
Powiązania:
https://bibliotekanauki.pl/articles/330815.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
M/M/1 service system
cooperative interval game
cost allocation
Shapley value
gra przedziałowa kooperatywna
alokacja kosztów
wartość Shapley'a
Opis:
Service systems and their cooperation are one of the most important and hot topics in management and information sciences. To design a reasonable allocation mechanism of service systems is the key issue in the cooperation of service systems. In this paper, we systematically introduce the interval Shapley value as cost allocation of cooperative interval games ,[...] arising from cooperation in a multi-server service system, and provide an explicit expression for the interval Shapley value of cooperative interval games [...]. We construct an interval game [...] of a service system which shares the same value for the grand coalition with the original interval game, by using the characteristic function which is dominated by the function of the original interval game. Finally, we prove that the interval game [...] is concave, which means that the interval Shapley value of the interval game [...] is in the interval core of this interval game, and illustrate this conclusion by using numerical examples.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2017, 27, 3; 549-562
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A computationally inexpensive algorithm for determining outer and inner enclosures of nonlinear mappings of ellipsoidal domains
Autorzy:
Rauh, Andreas
Jaulin, Luc
Powiązania:
https://bibliotekanauki.pl/articles/2055165.pdf
Data publikacji:
2021
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
bounded uncertainty
guaranteed enclosures
ellipsoidal enclosures
inner approximations
outer approximations
nonlinear system
confidence interval
niepewność ograniczona
układ nieliniowy
przedział ufności
Opis:
A wide variety of approaches for set-valued simulation, parameter identification, state estimation as well as reachability, observability and stability analysis for nonlinear discrete-time systems involve the propagation of ellipsoids via nonlinear functions. It is well known that the corresponding image sets usually possess a complex shape and may even be nonconvex despite the convexity of the input data. For that reason, domain splitting procedures are often employed which help to reduce the phenomenon of overestimation that can be traced back to the well-known dependency and wrapping effects of interval analysis. In this paper, we propose a simple, yet efficient scheme for simultaneously determining outer and inner ellipsoidal range enclosures of the solution for the evaluation of multi-dimensional functions if the input domains are themselves described by ellipsoids. The Hausdorff distance between the computed enclosure and the exact solution set reduces at least linearly when decreasing the size of the input domains. In addition to algebraic function evaluations, the proposed technique is-for the first time, to our knowledge-employed for quantifying worst-case errors when extended Kalman filter-like, linearization-based techniques are used for forecasting confidence ellipsoids in a stochastic setting.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2021, 31, 3; 399--415
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-6 z 6

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies