Fast enclosure for a matrix inverse square root
DOI10.1016/J.LAA.2014.11.007zbMATH Open1305.65133OpenAlexW1991105373MaRDI QIDQ477751FDOQ477751
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
Recommendations
algorithmnumerical resultspectral decompositionmatrix functioninterval matrixverified computationnumerical enclosurematrix inverse square root
Direct numerical methods for linear systems and matrix inversion (65F05) Interval and finite arithmetic (65G30) Algorithms with automatic result verification (65G20)
Cites Work
- Title not available (Why is that?)
- Functions of Matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- On interval systems \([x] = [A][x] + [b]\) and the powers of interval matrices in complex interval arithmetics
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- Computing enclosures for the inverse square root and the sign function of a matrix
- Fast Enclosure for All Eigenvalues and Invariant Subspaces in Generalized Eigenvalue Problems
- A Schur–Newton Method for the Matrix \lowercase{\boldmathp}th Root and its Inverse
- An Algorithm for Computing Reducing Subspaces by Block Diagonalization
- Fast enclosure for solutions of Sylvester equations
- 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
- On the Iterative Solution of the Matrix Equation AX 2 - I = 0
- Palindromic matrix polynomials, matrix functions and integral representations
Cited In (8)
- Computing enclosures for the matrix Mittag-Leffler function
- Fast verified computation for the minimal nonnegative solution of the nonsymmetric algebraic Riccati equation
- Fast verified computation for real powers of large matrices with Kronecker structure
- Verified computation for the geometric mean of two matrices
- Verified computation of real powers of matrices
- Low-complexity inverse square root approximation for baseband matrix operations
- Title not available (Why is that?)
- A one parameter method for the matrix inverse square root
Uses Software
This page was built for publication: Fast enclosure for a matrix inverse square root
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477751)
