Sylvester's equation: Accuracy and computational stability

DOI10.1016/0377-0427(94)00053-4zbMath0840.65026OpenAlexW2025570567MaRDI QIDQ1903648

Yanyan Li

Publication date: 1 February 1996

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(94)00053-4

zbMATH Keywords

stabilitycontrolconvergenceLyapunov equationerror analysisconditioningscalingmatrix normsSylvester matrix equationlinear dynamic systemsiterative improvement

Mathematics Subject Classification ID

Related Items (5)

An error estimate for matrix equations ⋮ SENSITIVITY OF SOME TENSOR EQUATIONS WITH EINSTEIN PRODUCT ⋮ A note on the Davison-Man method for Sylvester matrix equations ⋮ A Lie transform approach to the construction of Lyapunov functions in autonomous and non-autonomous systems ⋮ Backward error and perturbation bounds for high order Sylvester tensor equation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New bound on the sensitivity of the solution of the Lyapunov equation
• Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
• A Hessenberg-Schur method for the problem AX + XB= C
• Scaling for Numerical Stability in Gaussian Elimination
• Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
• Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
• Error Bounds for Approximate Invariant Subspaces of Closed Linear Operators

This page was built for publication: Sylvester's equation: Accuracy and computational stability