Fast enclosure for a matrix inverse square root
From MaRDI portal
Publication:477751
DOI10.1016/j.laa.2014.11.007zbMath1305.65133OpenAlexW1991105373MaRDI QIDQ477751
Publication date: 9 December 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.2014.11.007
algorithmspectral decompositioninterval matrixnumerical resultmatrix functionverified computationnumerical enclosurematrix inverse square root
Interval and finite arithmetic (65G30) Direct numerical methods for linear systems and matrix inversion (65F05) Algorithms with automatic result verification (65G20)
Related Items
Computing enclosures for the matrix Mittag-Leffler function, Verified computation of real powers of matrices, Fast verified computation for real powers of large matrices with Kronecker structure, Fast verified computation for the minimal nonnegative solution of the nonsymmetric algebraic Riccati equation, Verified computation for the geometric mean of two matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast enclosure for solutions of Sylvester equations
- Palindromic matrix polynomials, matrix functions and integral representations
- On interval systems \([x = [A][x] + [b]\) and the powers of interval matrices in complex interval arithmetics]
- On the computation of a matrix inverse square root
- A Lanczos approach to the inverse square root of a large and sparse matrix
- A one parameter method for the matrix inverse square root
- Computing enclosures for the inverse square root and the sign function of a matrix
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- Fast Enclosure for All Eigenvalues and Invariant Subspaces in Generalized Eigenvalue Problems
- An Algorithm for Computing Reducing Subspaces by Block Diagonalization
- On the Iterative Solution of the Matrix Equation AX 2 - I = 0
- A Schur–Newton Method for the Matrix \lowercase{\boldmathp}th Root and its Inverse
- Functions of Matrices
