A Computational Method for Symmetric Stein Matrix Equations

DOI10.1007/978-94-007-0602-6_14zbMath1251.65059OpenAlexW2162562497MaRDI QIDQ2913168

Abderrahim Messaoudi, Khalide Jbilou

Publication date: 26 September 2012

Published in: Lecture Notes in Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-94-007-0602-6_14

zbMATH Keywords

numerical experimentsKrylov subspace methodglobal Arnoldi algorithmlow-rank approximate solutionssparse symmetric Stein matrix equation

Mathematics Subject Classification ID

Related Items (5)

Computational Methods for Linear Matrix Equations ⋮ Factorized squared Smith method for large-scale Stein equations with high-rank terms ⋮ Stein-based preconditioners for weak-constraint 4D-var ⋮ Numerical methods for differential linear matrix equations via Krylov subspace methods ⋮ Matrix Equations, Sparse Solvers: M-M.E.S.S.-2.0.1—Philosophy, Features, and Application for (Parametric) Model Order Reduction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Krylov-subspace methods for the Sylvester equation
• Iterative methods for \(X-AXB=C\)
• Global FOM and GMRES algorithms for matrix equations
• Projection methods for large Lyapunov matrix equations
• Analysis of the convergence of the minimal and the orthogonal residual methods
• A Hessenberg-Schur method for the problem AX + XB= C
• Principal component analysis in linear systems: Controllability, observability, and model reduction
• A numerical algorithm to solve<tex>A^{T}XA - X = Q</tex>
• Krylov Subspace Methods for Solving Large Lyapunov Equations
• A Cyclic Low-Rank Smith Method for Large Sparse Lyapunov Equations
• Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
• Matrix Equation $XA + BX = C$
• Inequalities between the Two Kinds of Eigenvalues of a Linear Transformation

This page was built for publication: A Computational Method for Symmetric Stein Matrix Equations