Verified error bounds for solutions of Sylvester matrix equations
DOI10.1016/J.LAA.2010.12.002zbMATH Open1236.65045OpenAlexW2020280435MaRDI QIDQ651215FDOQ651215
Authors: Andreas Frommer, Behnam Hashemi 
Publication date: 8 December 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.12.002
Recommendations
interval arithmeticLyapunov equationBrouwer's fixed point theoremKrawczyk's methodverified computationSylvester matrix equationverified error bounds
Direct numerical methods for linear systems and matrix inversion (65F05) Matrix equations and identities (15A24) Interval and finite arithmetic (65G30) Algorithms with automatic result verification (65G20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- Title not available (Why is that?)
- Title not available (Why is that?)
- Introduction to Interval Analysis
- A Hessenberg-Schur method for the problem AX + XB= C
- How and Why to Solve the Operator Equation AX −XB = Y
- Approximation of Large-Scale Dynamical Systems
- A note on epsilon-inflation
- Title not available (Why is that?)
- Efficient matrix-valued algorithms for solving stiff Riccati differential equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Methods for the solution ofAXD−BXC=E and its application in the numerical solution of implicit ordinary differential equations
- Application of ADI Iterative Methods to the Restoration of Noisy Images
- The interval Sylvester equation
- The Sylvester equation and approximate balanced reduction
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- Title not available (Why is that?)
- Accurate Sum and Dot Product
- Title not available (Why is that?)
- Verified computation of square roots of a matrix
- Title not available (Why is that?)
- Verification of positive definiteness
- Robust assignment of poles in large-scale interval systems
- Tight and efficient enclosure of matrix multiplication by using optimized BLAS.
- An Algorithm for Computing Reducing Subspaces by Block Diagonalization
- A Test for Existence of Solutions to Nonlinear Systems
- Evaluation of the linear matrix equation solvers in SLICOT
Cited In (11)
- Fast enclosure for solutions of generalized Sylvester equations
- Bounds on the transformed errors of solutions to SLAEs with ill-conditioned matrices
- Improvement of error-free splitting for accurate matrix multiplication
- Efficient approaches for enclosing the united solution set of the interval generalized Sylvester matrix equations
- Fast verified computation for the solution of the T-congruence Sylvester equation
- Enclosing the solution set of the parametric generalised Sylvester matrix equation A(p)XB(p) + C(p)XD(p) = F(p)
- Methods for verified stabilizing solutions to continuous-time algebraic Riccati equations
- Accurate solutions of \(M\)-matrix Sylvester equations
- Efficient computation of enclosures for the exact solvents of a quadratic matrix equation
- Verified computation of matrix gamma function
- Fast enclosure for solutions of Sylvester equations
Uses Software
This page was built for publication: Verified error bounds for solutions of Sylvester matrix equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q651215)
