A computational method for symmetric Stein matrix equations

DOI10.1007/978-94-007-0602-6_14MaRDI QIDQ2913168zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Matrix equations and identities (15A24)

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

Cites work

• scientific article; zbMATH DE number 1487965 (Why is no real title available?)
• scientific article; zbMATH DE number 802915 (Why is no real title available?)
• scientific article; zbMATH DE number 932665 (Why is no real title available?)
• scientific article; zbMATH DE number 4187010 (Why is no real title available?)
• A Cyclic Low-Rank Smith Method for Large Sparse Lyapunov Equations
• A Hessenberg-Schur method for the problem AX + XB= C
• A numerical algorithm to solve<tex>A^{T}XA - X = Q</tex>
• Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
• Analysis and numerical solution of generalized Lyapunov equations.
• Analysis of the convergence of the minimal and the orthogonal residual methods
• Global FOM and GMRES algorithms for matrix equations
• Inequalities between the Two Kinds of Eigenvalues of a Linear Transformation
• Iterative methods for \(X-AXB=C\)
• Krylov Subspace Methods for Solving Large Lyapunov Equations
• Krylov-subspace methods for the Sylvester equation
• Matrix Equation $XA + BX = C$
• Parallel iterative methods for sparse linear systems
• Principal component analysis in linear systems: Controllability, observability, and model reduction
• Projection methods for large Lyapunov matrix equations

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
• 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\)
• Matrix equations, sparse solvers: \texttt{M-M.E.S.S.}-2.0.1 -- philosophy, features, and application for (parametric) model order reduction
• Stein-based preconditioners for weak-constraint 4D-var
• scientific article; zbMATH DE number 5011077 (Why is no real title available?)

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)