Fast enclosure for solutions of Sylvester equations
From MaRDI portal
Publication:389546
DOI10.1016/j.laa.2012.07.001zbMath1281.65069OpenAlexW2026915581WikidataQ112882200 ScholiaQ112882200MaRDI QIDQ389546
Publication date: 21 January 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2012.07.001
algorithmLyapunov equationerror boundSylvester equationnumerical resultrounding errornumerical enclosure
Related Items
Fast enclosure for the minimum norm least squares solution of the matrix equation AXB = C ⋮ Fast enclosure for solutions of generalized Sylvester equations ⋮ Fast enclosure for a matrix inverse square root ⋮ Fast verified computation for solutions of continuous-time algebraic Riccati equations ⋮ Fast verified computation for the solution of the T-congruence Sylvester equation ⋮ Unnamed Item ⋮ Improvement of error-free splitting for accurate matrix multiplication
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Verified error bounds for solutions of Sylvester matrix equations
- Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications
- Fast enclosure for all eigenvalues in generalized eigenvalue problems
- The interval Sylvester equation
- Fast verification of solutions of matrix equations
- The Sylvester equation and approximate balanced reduction
- Robust assignment of poles in large-scale interval systems
- 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
- Ultimately Fast Accurate Summation
- Efficient matrix-valued algorithms for solving stiff Riccati differential equations
- Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest
- Error bounds for approximate solutions of systems of equations
- A Hessenberg-Schur method for the problem AX + XB= C
- Accuracy and Stability of Numerical Algorithms
- Application of ADI Iterative Methods to the Restoration of Noisy Images
- Accurate Floating-Point Summation Part I: Faithful Rounding
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
- Accurate Sum and Dot Product
- Approximation of Large-Scale Dynamical Systems
