Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Stability" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 60
Tytuł:
Schur stability of the convex combination of complex polynomials
Autorzy:
Białas, S.
Białas, M.
Powiązania:
https://bibliotekanauki.pl/articles/969833.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
Schur stability
robust stability
convex combination of the polynomials
Opis:
This paper gives a necessary and sufficient condition for Schur stability of the convex combination of complex polynomials. It is a generalization of the work by Ackerman and Barmish (1988).
Źródło:
Control and Cybernetics; 2010, 39, 2; 551-558
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On stability of some lexicographic integer optimization problem
Autorzy:
Emelichev, V. A.
Gurevsky, E. E.
Kuzmin, K. G.
Powiązania:
https://bibliotekanauki.pl/articles/969909.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
multicriteria optimization
lexicographic integer optimization problem
absolute values of linear functions
lexicographic optima
stability
strong stability
quasi-stability
strong quasi-stability
unalterability
Opis:
A lexicographic integer optimization problem with criteria represented by absolute values of linear functions is considered. Five types of stability for the set of lexicographic optima under small changes of the parameters of the vector criterion are investigated.
Źródło:
Control and Cybernetics; 2010, 39, 3; 811-826
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Qualitative stability analysis of multicriteria combinatorial minimin problems
Autorzy:
Emelichev, V. A.
Karelkina, O. V.
Kuzmin, K. G.
Powiązania:
https://bibliotekanauki.pl/articles/206273.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
combinatorial optimization
Pareto set
lexicographic set
stability analysis
stability types
Opis:
A multicriteria combinatorial problem with minimin partial criteria is considered. Necessary and sufficient conditions for the five known stability types of the problem are obtained. These stability types describe in different ways the behavior of the Pareto and lexicographic sets of the problem under initial data perturba- tions of the vector criteria.
Źródło:
Control and Cybernetics; 2012, 41, 1; 57-79
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Simple conditions for robust stability of positive discrete-time linear systems with delays
Autorzy:
Busłowicz, M.
Powiązania:
https://bibliotekanauki.pl/articles/970235.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
stability
robust stability
linear system
delays
linear uncertainty
interval system
Opis:
The paper is devoted to the problem of robust stability of positive linear discrete-time systems with delays in the case of structured perturbations of state matrices. Simple new necessary and sufficient conditions for robust stability in the general case and in the case of system with linear uncertainty structure are established for two sub-cases: 1) unity rank uncertainty structure, 2) non-negative perturbation matrices. It is shown that robust stability of the positive discrete-time linear system with delays is equivalent to: 1) robust stability of the corresponding positive system without delays of the same order as time-delay system - in the general case, 2) asymptotic stability of finite family of the positive vertex systems without delays - in the case of a linear unity rank uncertainty structure, 3) asymptotic stability of only one positive vertex system without delays - in the case of a linear uncertainty structure with non-negative perturbation matrices.
Źródło:
Control and Cybernetics; 2010, 39, 4; 1159-1171
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Stability of the convex combination of polynomials
Autorzy:
Góra, M.
Powiązania:
https://bibliotekanauki.pl/articles/970377.pdf
Data publikacji:
2007
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
Hurwitz stability
Schur stability
roots of polynomials
convex combination of polynomials
Opis:
In this paper, we consider the convex combination of polynomials. We provide a necessary and sufficient condition for Hurwitz stability of the convex combination of m real polynomials (m ≥ 3) whose degrees may be different and both necessary, and necessary and sufficient conditions for Hurwitz and Schur stability of the convex combination of two complex polynomials. We show also that the convex combination of two polynomials whose degrees are respectively odd and even, is never Schur stable. We give a few examples completing the results.
Źródło:
Control and Cybernetics; 2007, 36, 2; 425-442
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Stability and chaotic properties of multidimensional Lasota equation
Autorzy:
Dawidowicz, A. L.
Poskrobko, A.
Powiązania:
https://bibliotekanauki.pl/articles/205622.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
Lasota equation
chaos
stability
Opis:
In this paper we study asymptotic properties of multidimensional Lasota equation. We give the conditions of its stability and chaos in the sense of Devaney in Orlicz spaces Lp for any p > 0. We also give criteria when the semigroup generated by the equation has not asymptotic behaviour.
Źródło:
Control and Cybernetics; 2013, 42, 2; 387-397
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A sufficient condition for Hurwitz stability of the convex combination of two matrices
Autorzy:
Białas, S.
Powiązania:
https://bibliotekanauki.pl/articles/970417.pdf
Data publikacji:
2004
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
stabilność Hurwitza
convex sets of matrices
stability of matrix sets
Hurwitz stability
Opis:
The paper provides a simple sufficient condition for Hurwitz stability of the convex combination of two real matrices.
Źródło:
Control and Cybernetics; 2004, 33, 1; 109-112
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A necessary and sufficient condition for stability of the convex combination of polynomials
Autorzy:
Białas, S.
Powiązania:
https://bibliotekanauki.pl/articles/970456.pdf
Data publikacji:
2004
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
stabilność Hurwitza
stabilność Schura
kombinacja wypukła wielomianów
Hurwitz stability
Schur stability
convex combination of polynomials
Opis:
This paper gives a necessary and sufficient condition for the Hurwitz (Schur) stability of the convex combination of the complex polynomials f1(x),f2(x),...,fm(x). It provides a generalization of the Ackermann, Barmish (1988). Barlett, Hollot, Huang (1988) and Bialas (1985).
Źródło:
Control and Cybernetics; 2004, 33, 4; 589-597
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On weak sharp minima in vector optimization with applications to parametric problems
Autorzy:
Bednarczuk, E.
Powiązania:
https://bibliotekanauki.pl/articles/970284.pdf
Data publikacji:
2007
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
vector optimization
weak sharp solutions
stability
Opis:
In the paper we discuss the concepts of weak sharp solutions to vector optimization problems. As an application we provide sufficient conditions for stability of solutions in perturbed vector optimization problems.
Źródło:
Control and Cybernetics; 2007, 36, 3; 563-570
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Limits of stabilization of a networked hyperbolic system with a circle
Autorzy:
Gugat, Martin
Huang, Xu
Wang, Zhiqiang
Powiązania:
https://bibliotekanauki.pl/articles/31342765.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
hyperbolic system
exponential stability
circle
network
Opis:
This paper is devoted to the discussion of the exponential stability of a networked hyperbolic system with a circle. Our analysis extends an example by Bastin and Coron about the limits of boundary stabilizability of hyperbolic systems to the case of a networked system that is defined on a graph which contains a cycle. By spectral analysis, we prove that the system is stabilizable while the length of the arcs is sufficiently small. However, if the length of the arcs is too large, the system is not stabilizable. Our results are robust with respect to small perturbations of the arc lengths. Complementing our analysis, we provide numerical simulations that illustrate our findings.
Źródło:
Control and Cybernetics; 2023, 52, 1; 79-121
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Quality of solutions for perturbed combinatorial optimization problems
Autorzy:
Libura, M.
Powiązania:
https://bibliotekanauki.pl/articles/205967.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
kombinatoryka
optymalizacja
teoria zbioru
accuracy function
accuracy radius
combinatorial optimization
sensitivity analysis
stability function
stability radius
Opis:
We consider a general combinatorial optimization problem in which the set of feasible solutions is defined as a given and fixed family of subsets for some finite ground set. To any element of the ground set the so-called weight is associated. The problem consists in finding a feasible subset for which the sum of weights of its elements is the minimum. When the weights of elements vary or are estimated with some accuracy, then the solution of the problem obtained for some initial weights may appear non-optimal. In this paper we consider the quality of a given solution in the case of weights perturbation or inaccuracy. Namely, we study the relative error of a given solution as a function of particular weights perturbation. We also calculate the maximum perturbation or estimation errors of weights which preserve the optimality of a given solution of the problem.
Źródło:
Control and Cybernetics; 2000, 29, 1; 199-219
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Adherence of minimizers for dual convergences
Autorzy:
Dolecki, S.
Powiązania:
https://bibliotekanauki.pl/articles/970255.pdf
Data publikacji:
2007
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
stability of minimizers
continuous convergence
dual topologies
Opis:
It is proved that many known convergences (e.g., continuous convergence, Isbell topology, compact-open topology, point-wise convergence) on the space of continuous maps (valued in a topological space) can be represented as the dual convergences with respect to collections of families of sets, and that they can be characterized in terms of the corresponding hyperspace convergences of the inverse images of closed sets. As a result, the convergence of real-valued functions for a dual convergence implies the convergence of their sets of minima on the corresponding hyperspace.
Źródło:
Control and Cybernetics; 2007, 36, 3; 647-658
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Positivity and stability of fractional discrete-time linear systems. The model without a time shift in the difference
Autorzy:
Kaczorek, T.
Ostalczyk, P.
Powiązania:
https://bibliotekanauki.pl/articles/206611.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
positivity
stability
fractional discrete-time linear systems
Opis:
The positivity and stability of fractional discretetime linear systems described by a new model are addressed. Necessary and sufficient conditions for the positivity and asymptotic stability of the systems are established. New tests for checking of the stability are proposed.
Źródło:
Control and Cybernetics; 2017, 46, 1; 27-36
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the global asymptotic stability problem and the Jacobian conjecture
Autorzy:
Drużkowski, L. M.
Powiązania:
https://bibliotekanauki.pl/articles/1839158.pdf
Data publikacji:
2005
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
hipoteza jakobianu
global stability problem
Jacobian Conjecture
Opis:
In this survey, we recall the formulation of the problems and give a review of some nontrivial results in the area. Let F = (F1,...,Fn] : R^n - --> R^n be a C^1 map and let F'(x) and Jac F(x) = det F'(x) denote the Jacobian matrix and the jacobian of F at a point x belongs to R^n, respectively. The Global Asymptotic Stability Problem (GASP) reads as follows: Assume that F(0] = 0 and at any point x belongs to R^n all eigenvalues of F'(x) have negative real parts. Then consider the associated system of differential equations x'j(t] = Fj(x1(t), ...,Xn(t)), j = 1,...,n. The question is whether the solution x[t] = 0 is globally asymptotically stable. If n > 2, then the answer is negative (even if F is a a polynomial automorphism), so from now on (GASP) denotes (GASP) restricted to R^2. In 1963, Olech showed that under the (GASP) assumption (i. e., Jac F[x) > 0 and Trace F'(x) = [...] < 0 for any x belong to R^2) the conclusion of (GASP) is equivalent to the injectivity of F. In 1994, Fessler, and independently Gutierrez, proved the injectivity of F and, due to the above mentioned Olech's equivalence, gave the affirmative answer to the two-dimensional (GASP). Let K denote R or C, n > 1. The Jacobian Conjecture can be formulated as follows: If F = (F1, ... ,Fn) : K^n --> K^n is a polynomial map with a constant nonzero jacobian, then F is a polynomial automorphism (i.e. there exists F^-1 and F^-1 is also a polynomial map). Although the Jacobian Conjecture is still unsolved even in the case of n = 2, it is convenient, to consider the so called Generalized Jacobian Conjecture (for short (GJC)): the Jacobian Conjecture holds for every n > 1. We give a review of some interesting conditions equivalent to the Jacobian Conjecture, including Meisters and Olech's result on the existence of a poly-flow solution of the associated Ważewski equation x'(t) = [F'(x(t))]^-1 (a). We also present, a reduction of (GJC) to the case of F of degree 3 and of special forms, then some partial results, and (JC)'s relations with other problems.
Źródło:
Control and Cybernetics; 2005, 34, 3; 747-762
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On parametric Hurwitz stability margin of real polynomials
Autorzy:
Husek, P.
Powiązania:
https://bibliotekanauki.pl/articles/1839184.pdf
Data publikacji:
2008
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
robust stability
parametric uncertainty
continuous-time systems
Opis:
The paper deals with the problem of determining Hurwitz stability of a ball of polynomials defined by a weighted lp norm in the coefficient space where p is an arbitrary positive integer including infinity. The solution of the case when the weights are supposed to be the same for coefficient being above and below its nominal value corresponding to symmetric ball has been given by Tsypkin and Polyak. However, sometimes it seems to be useful to have a possibility to consider these weights as different, resulting in the asymmetric ball. This is, for example, the situation where the weights express our level of confidence that the real value of a coefficient lies in some interval. Such approach is used if the value of a coefficient is estimated by an expert. Solution of the problem is based on frequency domain plot in the complex plane and on applying the Zero Exclusion Theorem. The main idea consists in separation of the original problem into four subproblems and using an appropriate coordinate transformation which makes the value set independent of frequency. This transformation makes it possible to move the relative value set into the origin of the complex plane and to easily formulate the necessary and sufficient condition of Hurwitz stability of asymmetric ball of polynomials with prescribed radius or determine the maximum radius preserving stability. The whole graphical procedure consists of four plots instead of one, needed in the symmetric case.
Źródło:
Control and Cybernetics; 2008, 37, 3; 549-563
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 60

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