City University of Hong Kong, CityU: 111012
Document
National Natural Science Foundation of China, NSFC: 61433011
Asymptotic zero behavior; eigenvalue perturbation; matrix pencil; polynomially-dependent systems; stability Asymptotic analysis; Computational efficiency; Convergence of numerical methods; System stability; Asymptotic behaviors; Asymptotic properties; Asymptotic zero behavior; Computationally efficient; Eigenvalue perturbation; Generalized eigenvalue problems; Matrix pencil; Matrix-valued functions; Eigenvalues and eigenfunctions
Stability Analysis of Polynomially Dependent Systems by Eigenvalue Perturbation
In this technical note we present a stability analysis approach for polynomially-dependent one-parameter systems. The approach, which appears to be conceptually appealing and computationally efficient and is referred to as an eigenvalue perturbation approach, seeks to characterize the analytical and asymptotic properties of eigenvalues of matrix-valued functions or operators. The essential problem dwells on the asymptotic behavior of the critical eigenvalues on the imaginary axis, that is, on how the imaginary eigenvalues may vary with respect to the varying parameter. This behavior determines whether the imaginary eigenvalues cross from one half plane into another, and hence plays a critical role in determining the stability of such systems. Our results reveal that the eigenvalue asymptotic behavior can be characterized by solving a simple generalized eigenvalue problem, leading to numerically efficient stability conditions. © 2012 IEEE.
Generically Dependent Continuant
RDF description of Stability Analysis of Polynomially Dependent Systems by Eigenvalue Perturbation - http://orbis.uaslp.mx/vivo/individual/scopus5133
Article
Information Content Entity