Numerical solution of singular Sylvester equations
From MaRDI portal
Publication:6049348
DOI10.1016/j.cam.2023.115426zbMath1522.65059MaRDI QIDQ6049348
Jieyong Zhou, Liangshao Hou, E. K.-W. Chu, Daniel B. Szyld
Publication date: 15 September 2023
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Lyapunov equationprojection methodSylvester equationleast squares solutionKrylov subspacesingular equation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient low-rank solution of generalized Lyapunov equations
- Solving large-scale continuous-time algebraic Riccati equations by doubling
- Minimal residual methods for large scale Lyapunov equations
- Convergence analysis of the extended Krylov subspace method for the Lyapunov equation
- The quaternionic equation \(ax + xb = c\)
- Preconditioned Galerkin and minimal residual methods for solving Sylvester equations
- On the ADI method for Sylvester equations
- The solution of the matrix equations \(AXB-CXD=E\) and \((YA-DZ,YC- BZ)=(E,F)\)
- The generalized Cayley-Hamilton theorem for standard pencils
- On the stability radius of a generalized state-space system
- Numerical range of linear pencils
- A preconditioned iteration method for solving Sylvester equations
- Global FOM and GMRES algorithms for matrix equations
- Approximation of stability radii for large-scale dissipative Hamiltonian systems
- Singular Sylvester equation in Banach spaces and its applications: Fredholm theory approach
- Approximated least-squares solutions of a generalized Sylvester-transpose matrix equation via gradient-descent iterative algorithm
- Inheritance properties of Krylov subspace methods for continuous-time algebraic Riccati equations
- Krylov subspace methods for discrete-time algebraic Riccati equations
- Self-generating and efficient shift parameters in ADI methods for large Lyapunov and Sylvester equations
- Robust control of linear descriptor systems
- Perturbation theory and backward error for \(AX - XB = C\)
- Low rank methods for a class of generalized Lyapunov equations and related issues
- A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
- Computing real low-rank solutions of Sylvester equations by the factored ADI method
- Fields of values and inclusion regions for matrix pencils
- Refining estimates of invariant and deflating subspaces for large and sparse matrices and pencils
- Solving stable Sylvester equations via rational iterative schemes
- Iterative least-squares solutions of coupled sylvester matrix equations
- Approximate inverse preconditioner by computing approximate solution of Sylvester equation
- Matrix Algorithms
- Analysis of the Rational Krylov Subspace Projection Method for Large-Scale Algebraic Riccati Equations
- A Framework for Deflated and Augmented Krylov Subspace Methods
- Computational Methods for Linear Matrix Equations
- Low-Rank Tensor Krylov Subspace Methods for Parametrized Linear Systems
- Recent computational developments in Krylov subspace methods for linear systems
- Truncated low‐rank methods for solving general linear matrix equations
- A Multigrid Method to Solve Large Scale Sylvester Equations
- On the Computation of Null Spaces of Sparse Rectangular Matrices
- On the generalized Cayley-Hamilton theorem
- Further remarks on the Cayley-Hamilton theorem and Leverrier's method for the matrix pencil<tex>(sE - A)</tex>
- A Hessenberg-Schur method for the problem AX + XB= C
- Numerical Range of Matrix Polynomials
- Least-Squares Approximate Solution of Overdetermined Sylvester Equations
- Basis-free solution to general linear quaternionic equation
- Gradient based iterative algorithms for solving a class of matrix equations
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
- Solving the Sylvester Equation AX-XB=C when $\sigma(A)\cap\sigma(B)\neq\emptyset$
- A projection method to solve linear systems in tensor format
- Existence of a low rank or ℋ︁‐matrix approximant to the solution of a Sylvester equation
- Explicit Solutions of Linear Matrix Equations
- Classification and approximation of solutions to Sylvester matrix equation