Computing enclosures for the inverse square root and the sign function of a matrix
From MaRDI portal
Publication:2249733
DOI10.1016/j.laa.2013.11.047zbMath1293.65071MaRDI QIDQ2249733
Thomas Sablik, Behnam Hashemi, Andreas Frommer
Publication date: 3 July 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.2013.11.047
complexity; interval arithmetic; computational efficiency; interval matrix; matrix sign function; Krawczyk's method; verified computation; matrix inverse square root; a posteriori error bounds
15A24: Matrix equations and identities
65G30: Interval and finite arithmetic
65G20: Algorithms with automatic result verification
Related Items
Verified computation of matrix gamma function, Fast verified computation for real powers of large matrices with Kronecker structure, Methods for verified stabilizing solutions to continuous-time algebraic Riccati equations, Fast enclosure for a matrix inverse square root, An interval extension of SMS method for computing weighted Moore-Penrose inverse, Computing enclosures for the matrix Mittag-Leffler function, Verified computation for the geometric mean of two matrices, The weighted Moore-Penrose generalized inverse and the force analysis of overconstrained parallel mechanisms, Verified computation of real powers of matrices
Uses Software
Cites Work
- Solving the algebraic Riccati equation with the matrix sign function
- On the computation of a matrix inverse square root
- A Lanczos approach to the inverse square root of a large and sparse matrix
- Numerical challenges in lattice quantum chromodynamics. Joint interdisciplinary workshop of John von Neumann Institute for Computing, Jülich, and Institute of Applied Computer Science, Wuppertal Univ., Germany, August 1999
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- Separating eigenvalues using the matrix sign function
- An Algorithm for Computing Reducing Subspaces by Block Diagonalization
- On the Iterative Solution of the Matrix Equation AX 2 - I = 0
- Verified Computation of Square Roots of a Matrix
- Introduction to Interval Analysis
- Using the Matrix Sign Function to Compute Invariant Subspaces
- A Schur–Newton Method for the Matrix \lowercase{\boldmathp}th Root and its Inverse
- Numerical Software with Result Verification
- Functions of Matrices
- An Iterative Method for the Computation of a Matrix Inverse Square Root
- The geometric mean of two matrices from a computational viewpoint
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
