On the Iterative Solution of the Matrix Equation AX 2 - I = 0

DOI10.2307/2002785MaRDI QIDQ3255676zbMATH OpenOpenAlexFDO

Authors P. Laasonen

Publication date 1958

Published in Mathematical Tables and Other Aids to Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2002785

zbMATH Keywords

numerical analysis

Cited in

(11)

• Computing enclosures for the inverse square root and the sign function of a matrix
• Computing real square roots of a real matrix
• A binary powering Schur algorithm for computing primary matrix roots
• An iterative method for solving the stable subspace of a matrix pencil and its application
• Newton's method for the matrix nonsingular square root
• The numerical solution of an elliptic P.D.E. with periodic boundary conditions in a rectangular region by the spectral resolution method
• Newton's method for solving the tensor square root problem
• Fast enclosure for a matrix inverse square root
• An Algorithm to Improve Nearly Orthonormal Sets of Vectors on a Vector Processor
• Infinite product expansions for matrix n-th roots
• Inversion free algorithms for computing the principal square root of a matrix

This page was built for publication: On the Iterative Solution of the Matrix Equation AX 2 - I = 0

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3255676)