Projection methods for large-scale T-Sylvester equations

DOI10.1090/mcom/3081zbMath1352.65127OpenAlexW2433801021MaRDI QIDQ2814446

No author found.

Publication date: 22 June 2016

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10016/22092

zbMATH Keywords

algorithmnumerical resultKrylov subspace iterative methodslarge-scale equationsSylvester matrix equationspalindromic eigenvalue problemsSylvester equation for congruenceT-Sylvester equations

Mathematics Subject Classification ID

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

Related Items

Backward errors and small-sample condition estimation for ⋆-Sylveter equations ⋮ Computational Methods for Linear Matrix Equations ⋮ Biconjugate residual algorithm for solving general Sylvester-transpose matrix equations ⋮ Iterative optimal solutions of linear matrix equations for hyperspectral and multispectral image fusing ⋮ On the solution of the nonsymmetric T-Riccati equation ⋮ On the convergence of conjugate direction algorithm for solving coupled Sylvester matrix equations ⋮ Palindromic linearization and numerical solution of nonsymmetric algebraic \(T\)-Riccati equations

Uses Software

• mctoolbox
• Algorithm 432

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the \(\star\)-Sylvester equation \(AX\pm X^{\star} B^{\star} = C\)
• Conditions for unique solvability of the matrix equation \(AX + X^TB = C\)
• The solution of the equation \(XA+AX^T=0\) and its application to the theory of orbits
• On the matrix function \(AX + X'A'\)
• Implicit QR algorithms for palindromic and even eigenvalue problems
• On the ADI method for Sylvester equations
• Three methods for refining estimates of invariant subspaces
• On the generalized algebraic Riccati equation for continuous-time descriptor systems
• Krylov-subspace methods for the Sylvester equation
• Roth's theorems for matrix equations with symmetry constraints
• Eigenvalue decay bounds for solutions of Lyapunov equations: the symmetric case
• The semi-stabilizing solution of generalized algebraic Riccati equation for descriptor systems
• On the matrix equation \(XA+AX^T=0\)
• The solution of the equation \(AX + X^{\star}B =0\)
• A note on the \(\top\)-Stein matrix equation
• The direct updating of damping and gyroscopic matrices
• A computational framework of gradient flows for general linear matrix equations
• On the numerical solution of \(AX-XB=C\)
• A numerical algorithm for solving the matrix equation AX + X T B = C 1
• Numerical Methods for Large Eigenvalue Problems
• An Error Analysis for Rational Galerkin Projection Applied to the Sylvester Equation
• Computational Methods for Linear Matrix Equations
• Structured Condition Numbers for Invariant Subspaces
• A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
• Numerical solution of large‐scale Lyapunov equations, Riccati equations, and linear‐quadratic optimal control problems
• Approximation of Large-Scale Dynamical Systems
• Matrix Analysis
• The Equations A^TX\pm X^TA=B
• Krylov Subspace Methods for Solving Large Lyapunov Equations
• A Cyclic Low-Rank Smith Method for Large Sparse Lyapunov Equations
• Accuracy and Stability of Numerical Algorithms
• A Numerical Method for a Generalized Algebraic Riccati Equation
• Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
• Existence of a low rank or ℋ︁‐matrix approximant to the solution of a Sylvester equation
• Block Krylov subspace methods for solving large Sylvester equations