Computing enclosures for the inverse square root and the sign function of a matrix

DOI10.1016/j.laa.2013.11.047zbMath1293.65071OpenAlexW2020277083MaRDI 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

zbMATH Keywords

complexityinterval arithmeticcomputational efficiencyinterval matrixmatrix sign functionKrawczyk's methodverified computationmatrix inverse square roota posteriori error bounds

Mathematics Subject Classification ID

Related Items (9)

Computing enclosures for the matrix Mittag-Leffler function ⋮ The weighted Moore-Penrose generalized inverse and the force analysis of overconstrained parallel mechanisms ⋮ Methods for verified stabilizing solutions to continuous-time algebraic Riccati equations ⋮ Verified computation of matrix gamma function ⋮ Verified computation of real powers of matrices ⋮ Fast verified computation for real powers of large matrices with Kronecker structure ⋮ Fast enclosure for a matrix inverse square root ⋮ Verified computation for the geometric mean of two matrices ⋮ An interval extension of SMS method for computing weighted Moore-Penrose inverse

Uses Software

• C-XSC
• C-XSC 2.0
• INTLAB
• mftoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Computing enclosures for the inverse square root and the sign function of a matrix