Fast enclosure for a matrix inverse square root

DOI10.1016/J.LAA.2014.11.007MaRDI QIDQ477751zbMATH OpenOpenAlexFDO

Authors Shinya Miyajima

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

zbMATH Keywords

algorithmnumerical resultspectral decompositionmatrix functioninterval matrixverified computationnumerical enclosurematrix inverse square root

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Interval and finite arithmetic (65G30) Algorithms with automatic result verification (65G20)

Recommendations

• Computing enclosures for the inverse square root and the sign function of a matrix
• Publication:4896329
• On the computation of a matrix inverse square root
• A one parameter method for the matrix inverse square root
• An Iterative Method for the Computation of a Matrix Inverse Square Root

Cites work

• scientific article; zbMATH DE number 635657 (Why is no real title available?)
• scientific article; zbMATH DE number 1440908 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• 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
• A one parameter method for the matrix inverse square root
• An Algorithm for Computing Reducing Subspaces by Block Diagonalization
• 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
• Fast enclosure for solutions of Sylvester equations
• Functions of Matrices
• Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
• On interval systems \([x] = [A][x] + [b]\) and the powers of interval matrices in complex interval arithmetics
• On the Iterative Solution of the Matrix Equation AX 2 - I = 0
• On the computation of a matrix inverse square root
• Palindromic matrix polynomials, matrix functions and integral representations

Cited in

(10)

• Verified computation for the geometric mean of two matrices
• Low-complexity inverse square root approximation for baseband matrix operations
• Verified computation of real powers of matrices
• Computing enclosures for the matrix Mittag-Leffler function
• 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
• Computing enclosures for the inverse square root and the sign function of a matrix
• Fast verified computation for the matrix principal \(p\)th root
• A one parameter method for the matrix inverse square root
• scientific article; zbMATH DE number 3926078 (Why is no real title available?)

Describes a project that uses

Uses Software

• INTLAB
• mftoolbox

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)