Computing enclosures for the inverse square root and the sign function of a matrix
From MaRDI portal
Publication:2249733
Recommendations
- Verified computation of square roots of a matrix
- Fast enclosure for a matrix inverse square root
- On the computation of a matrix inverse square root
- Efficient algorithms for the inclusion of the inverse matrix using error- bounds for hyperpower methods
- An Iterative Method for the Computation of a Matrix Inverse Square Root
Cites work
- A Lanczos approach to the inverse square root of a large and sparse matrix
- A Schur–Newton Method for the Matrix \lowercase{\boldmathp}th Root and its Inverse
- An Algorithm for Computing Reducing Subspaces by Block Diagonalization
- An Iterative Method for the Computation of a Matrix Inverse Square Root
- Functions of Matrices
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 5775425 (Why is no real title available?)
- scientific article; zbMATH DE number 3963074 (Why is no real title available?)
- scientific article; zbMATH DE number 3682951 (Why is no real title available?)
- scientific article; zbMATH DE number 3723777 (Why is no real title available?)
- scientific article; zbMATH DE number 635657 (Why is no real title available?)
- scientific article; zbMATH DE number 714516 (Why is no real title available?)
- scientific article; zbMATH DE number 1440908 (Why is no real title available?)
- scientific article; zbMATH DE number 226866 (Why is no real title available?)
- Introduction to Interval Analysis
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- 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
- Numerical Software with Result Verification
- On the computation of a matrix inverse square root
- On the Iterative Solution of the Matrix Equation AX 2 - I = 0
- Separating eigenvalues using the matrix sign function
- Solving the algebraic Riccati equation with the matrix sign function
- The geometric mean of two matrices from a computational viewpoint.
- Using the Matrix Sign Function to Compute Invariant Subspaces
- Verified computation of square roots of a matrix
Cited in
(14)- 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
- Methods for verified stabilizing solutions to continuous-time algebraic Riccati equations
- Verified computation of square roots of a matrix
- scientific article; zbMATH DE number 3926078 (Why is no real title available?)
- Using the Matrix Sign Function to Compute Invariant Subspaces
- Fast enclosure for a matrix inverse square root
- Verified computation of matrix gamma function
- Bounding error of calculating the matrix functions
- Certification of numerical computation of the sign of the determinant of a matrix
- Fast verified computation for real powers of large matrices with Kronecker structure
- An interval extension of SMS method for computing weighted Moore-Penrose inverse
- Computing enclosures for the matrix Mittag-Leffler function
This page was built for publication: Computing enclosures for the inverse square root and the sign function of a matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249733)
