A direct method for solving projected generalized continuous-time Sylvester equations
From MaRDI portal
Publication:4926033
DOI10.1007/s11768-012-0192-xzbMath1274.65123OpenAlexW2401034291MaRDI QIDQ4926033
Liping Zhou, Liang Bao, Yanhua Cao, Yi-Qin Lin
Publication date: 20 June 2013
Published in: Journal of Control Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11768-012-0192-x
numerical examplesspectral projectiondirect methodmatrix pencilgeneralized Schur factorizationprojected generalized Sylvester equation
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Computational Methods for Linear Matrix Equations ⋮ Iterative algorithm for solving a class of general Sylvester-conjugate matrix equation \(\sum_{i=1}^sA_iV+\sum_{j=1}^tB_jW=\sum_{l=1}^mE_l\overline VF_l+C\)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gramian-based model reduction for descriptor systems
- Low-rank iterative methods for projected generalized Lyapunov equations
- The autonomous linear quadratic control problem. Theory and numerical solution
- Numerical solution and perturbation theory for generalized Lyapunov equations
- Stability and inertia theorems for generalized Lyapunov equations
- Optimization and dynamical systems
- A modified matrix sign function method for projected Lyapunov equations
- Balanced truncation model reduction for semidiscretized Stokes equation
- Solving stable Sylvester equations via rational iterative schemes
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
- A Perturbation Analysis of the Generalized Sylvester Equation $( AR - LB,DR - LE ) = ( C,F )$
- 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
- Matrix Sign Function Methods for Solving Projected Generalized Continuous-Time Sylvester Equations
- Condition Numbers of the Generalized Sylvester Equation
- Recursive blocked algorithms for solving triangular systems—Part I
- Recursive blocked algorithms for solving triangular systems—Part II
This page was built for publication: A direct method for solving projected generalized continuous-time Sylvester equations