Verified error bounds for solutions of Sylvester matrix equations
From MaRDI portal
Publication:651215
DOI10.1016/j.laa.2010.12.002zbMath1236.65045OpenAlexW2020280435MaRDI QIDQ651215
Behnam Hashemi, Andreas Frommer
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
Lyapunov equationinterval arithmeticBrouwer's fixed point theoremSylvester matrix equationKrawczyk's methodverified computationverified error bounds
Matrix equations and identities (15A24) Interval and finite arithmetic (65G30) Direct numerical methods for linear systems and matrix inversion (65F05) Algorithms with automatic result verification (65G20)
Related Items
Methods for verified stabilizing solutions to continuous-time algebraic Riccati equations, Verified computation of matrix gamma function, Fast enclosure for solutions of Sylvester equations, Fast enclosure for solutions of generalized Sylvester equations, 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, Improvement of error-free splitting for accurate matrix multiplication, Enclosing the solution set of the parametric generalised Sylvester matrix equation A(p)XB(p) + C(p)XD(p) = F(p)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on epsilon-inflation
- The interval Sylvester equation
- The Sylvester equation and approximate balanced reduction
- Robust assignment of poles in large-scale interval systems
- Verification of positive definiteness
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- Tight and efficient enclosure of matrix multiplication by using optimized BLAS
- An Algorithm for Computing Reducing Subspaces by Block Diagonalization
- Efficient matrix-valued algorithms for solving stiff Riccati differential equations
- Verified Computation of Square Roots of a Matrix
- Introduction to Interval Analysis
- A Hessenberg-Schur method for the problem AX + XB= C
- Methods for the solution ofAXD−BXC=E and its application in the numerical solution of implicit ordinary differential equations
- A Test for Existence of Solutions to Nonlinear Systems
- How and Why to Solve the Operator Equation AX −XB = Y
- Application of ADI Iterative Methods to the Restoration of Noisy Images
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
- Accurate Sum and Dot Product
- Approximation of Large-Scale Dynamical Systems
