A computational method for symmetric Stein matrix equations
From MaRDI portal
Publication:2913168
DOI10.1007/978-94-007-0602-6_14zbMATH Open1251.65059OpenAlexW2162562497MaRDI QIDQ2913168FDOQ2913168
Authors: Khalide Jbilou, A. Messaoudi 
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
Recommendations
- A computational method for large-scale differential symmetric Stein equation
- Restarted global FOM and GMRES algorithms for the Stein-like matrix equation \(X + \mathcal{M}(X) = C\)
- Block Krylov subspace methods for large Stein equations
- NUMERICAL SOLUTION OF DISCRETE STABLE LINEAR MATRIX EQUATIONS ON MULTICOMPUTERS
- Projection methods for large Lyapunov matrix equations
numerical experimentsKrylov subspace methodglobal Arnoldi algorithmlow-rank approximate solutionssparse symmetric Stein matrix equation
Cites Work
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- Title not available (Why is that?)
- Parallel iterative methods for sparse linear systems
- Inequalities between the Two Kinds of Eigenvalues of a Linear Transformation
- A Hessenberg-Schur method for the problem AX + XB= C
- Principal component analysis in linear systems: Controllability, observability, and model reduction
- Projection methods for large Lyapunov matrix equations
- Krylov Subspace Methods for Solving Large Lyapunov Equations
- Title not available (Why is that?)
- A Cyclic Low-Rank Smith Method for Large Sparse Lyapunov Equations
- Title not available (Why is that?)
- Global FOM and GMRES algorithms for matrix equations
- Krylov-subspace methods for the Sylvester equation
- Matrix Equation $XA + BX = C$
- Iterative methods for \(X-AXB=C\)
- Analysis of the convergence of the minimal and the orthogonal residual methods
- Title not available (Why is that?)
- Analysis and numerical solution of generalized Lyapunov equations.
- A numerical algorithm to solve<tex>A^{T}XA - X = Q</tex>
Cited In (11)
- Numerical methods for differential linear matrix equations via Krylov subspace methods
- Restarted global FOM and GMRES algorithms for the Stein-like matrix equation \(X + \mathcal{M}(X) = C\)
- Factorized squared Smith method for large-scale Stein equations with high-rank terms
- A systolic algorithm for the triangular stein equation
- Matrix Equations, Sparse Solvers: M-M.E.S.S.-2.0.1—Philosophy, Features, and Application for (Parametric) Model Order Reduction
- Numerical solution of matrix equations of the Stein type in the self-adjoint case
- A computational method for large-scale differential symmetric Stein equation
- Computational Methods for Linear Matrix Equations
- A shifted complex global Lanczos method and the quasi-minimal residual variant for the Stein-conjugate matrix equation \(X + A \overline{X} B = C\)
- Stein-based preconditioners for weak-constraint 4D-var
- Title not available (Why is that?)
This page was built for publication: A computational method for symmetric Stein matrix equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2913168)
