A faster method of computing the square root of a matrix
From MaRDI portal
Publication:4157881
DOI10.1109/TAC.1978.1101761zbMath0378.65028OpenAlexW2011126584MaRDI QIDQ4157881
D. J. Walton, William D. Hoskins
Publication date: 1978
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tac.1978.1101761
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (14)
A fast method for computing the principal \(n\)-th roots of complex matrices ⋮ The weighted Moore-Penrose generalized inverse and the force analysis of overconstrained parallel mechanisms ⋮ On the roots of coquaternions ⋮ Fast and stable algorithms for computing the principal \(n\)th root of a complex matrix and the matrix sector function ⋮ Unnamed Item ⋮ A power method for computing square roots of complex matrices ⋮ Roots of real matrices ⋮ Systolic computation of the matrix exponential and other matrix functions ⋮ Computing real square roots of a real matrix ⋮ A faster, more stable method for comuting the pth roots of positive definite matrices ⋮ An iterative algorithm for the solution of the discrete-time algebraic Riccati equation ⋮ A study on square root control-systems ⋮ A Schur method for the square root of a matrix ⋮ Newton's method for the matrix nonsingular square root
This page was built for publication: A faster method of computing the square root of a matrix
