Verified error bounds for solutions of Sylvester matrix equations
Authors:
- Andreas FrommerAFAndreas Frommer
- Behnam HashemiBHBehnam Hashemi
- 15 January 2012
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 436 (2) , 405-420
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Tight and efficient enclosure of matrix multiplication by using optimized BLASNumerical Linear Algebra with Applications, 2011
- Verification of Positive DefinitenessBIT Numerical Mathematics, 2006
- Robust stabilization of linear interval systemsJournal of Applied Mathematics and Mechanics, 2002
- The Sylvester equation and approximate balanced reductionLinear Algebra and its Applications, 2002
- How and Why to Solve the Operator Equation AX −XB = YBulletin of the London Mathematical Society, 1997
- Efficient matrix-valued algorithms for solving stiff Riccati differential equationsIEEE Transactions on Automatic Control, 1990
- Methods for the solution ofAXD−BXC=E and its application in the numerical solution of implicit ordinary differential equationsBIT Numerical Mathematics, 1980
- A Hessenberg-Schur method for the problem AX + XB= CIEEE Transactions on Automatic Control, 1979
- A Test for Existence of Solutions to Nonlinear SystemsSIAM Journal on Numerical Analysis, 1977
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]Communications of the ACM, 1972