On the computation of a matrix inverse square root
From MaRDI portal
Publication:1179549
DOI10.1007/BF02257775zbMath0741.65039OpenAlexW144217808MaRDI QIDQ1179549
Publication date: 26 June 1992
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02257775
numerical examplesNewton-Raphson methoditerative methodsperformancesSchur methodinverse square rootmatrix continued-fraction methodmatrix sign function methodoptimal symmetric orthogonalization
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Computing matrix-valued Nevanlinna-Pick interpolation ⋮ An Iterative Method for the Computation of a Matrix Inverse Square Root ⋮ Fast enclosure for a matrix inverse square root ⋮ A one parameter method for the matrix inverse square root ⋮ Computing enclosures for the inverse square root and the sign function of a matrix ⋮ Symmetric approximation of frames and bases in Hilbert spaces
Cites Work
- Computing real square roots of a real matrix
- A Schur method for the square root of a matrix
- A fast method for computing the principal \(n\)-th roots of complex matrices
- Roots of real matrices
- An Algorithm to Improve Nearly Orthonormal Sets of Vectors on a Vector Processor
- A Hessenberg-Schur method for the problem AX + XB= C
- The Convergence of Multipoint Iterations to Multiple Zeros
- Newton's Method for the Matrix Square Root
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the computation of a matrix inverse square root
