Numerical solution and perturbation theory for generalized Lyapunov equations
From MaRDI portal
Publication:1611862
DOI10.1016/S0024-3795(02)00255-0zbMath1003.65042MaRDI QIDQ1611862
Publication date: 28 August 2002
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
numerical examplesspectral condition numberperturbation boundsBertels-Stewart methodgeneralized continuous-time Lyapunov equationHammarling methods
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (15)
A note on POD model reduction methods for DAEs ⋮ Reduced basis approximation of large scale parametric algebraic Riccati equations ⋮ A modified matrix sign function method for projected Lyapunov equations ⋮ Computational Methods for Linear Matrix Equations ⋮ Model Order Reduction for Differential-Algebraic Equations: A Survey ⋮ Partial realization of descriptor systems ⋮ On the perturbation bounds of projected generalized continuous-time Sylvester equations ⋮ Krylov subspace methods for projected Lyapunov equations ⋮ Rigorous and effective a-posteriori error bounds for nonlinear problems -- application to RB methods ⋮ A direct method for solving projected generalized continuous-time Sylvester equations ⋮ Sensitivity analysis of random linear differential-algebraic equations using system norms ⋮ A quadratic inverse eigenvalue problem in damped structural model updating ⋮ Structured perturbation analysis for an infinite size quasi-Toeplitz matrix equation with applications ⋮ On the Sensitivity of Singular and Ill-Conditioned Linear Systems ⋮ Gradient-based maximal convergence rate iterative method for solving linear matrix equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The computation of Kronecker's canonical form of a singular pencil
- Inertia characteristics of self-adjoint matrix polynomials
- Computing stable eigendecompositions of matrix pencils
- The solution of the matrix equations \(AXB-CXD=E\) and \((YA-DZ,YC- BZ)=(E,F)\)
- An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
- The autonomous linear quadratic control problem. Theory and numerical solution
- On the stability radius of a generalized state-space system
- Solving stable generalized Lyapunov equations with the matrix sign function
- Numerical solution of generalized Lyapunov equations
- On properties of Sylvester and Lyapunov operators
- Computing eigenspaces with specified eigenvalues of a regular matrix pair \((A,B)\) and condition estimation: Theory, algorithms and software
- Performance of the QZ Algorithm in the Presence of Infinite Eigenvalues
- Computation of system balancing transformations and other applications of simultaneous diagonalization algorithms
- Lyapunov-like equations and reachability/observabiliy Gramians for descriptor systems
- The Sensitivity of the Stable Lyapunov Equation
- LAPACK Users' Guide
- A Hessenberg-Schur method for the problem AX + XB= C
- Numerical Solution of the Stable, Non-negative Definite Lyapunov Equation Lyapunov Equation
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
- Generalized Schur methods with condition estimators for solving the generalized Sylvester equation
- A Perturbation Analysis of the Generalized Sylvester Equation $( AR - LB,DR - LE ) = ( C,F )$
- LAPACK-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II
- Solution of the Sylvester matrix equation AXB T + CXD T = E
- Algorithm 705; a FORTRAN-77 software package for solving the Sylvester matrix equation AXB T + CXD T = E
- On Criteria for Asymptotic Stability of Differential-Algebraic Equations
- The matrix sign function
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
This page was built for publication: Numerical solution and perturbation theory for generalized Lyapunov equations