A faster method of computing the square root of a matrix

DOI10.1109/TAC.1978.1101761MaRDI QIDQ4157881zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Matrix equations and identities (15A24)

Cited in

(15)

• A Schur method for the square root of a matrix
• A fast method for computing the principal \(n\)-th roots of complex matrices
• Fast and stable algorithms for computing the principal \(n\)th root of a complex matrix and the matrix sector function
• Roots of real matrices
• 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 power method for computing square roots of complex matrices
• On the roots of coquaternions
• A study on square root control-systems
• Newton's method for the matrix nonsingular square root
• The weighted Moore-Penrose generalized inverse and the force analysis of overconstrained parallel mechanisms
• Systolic computation of the matrix exponential and other matrix functions
• On the square root of quadratic matrices
• Computing real square roots of a real matrix
• A new stable and inversion-free iteration for computing the matrix square root of large and sparse matrices

This page was built for publication: A faster method of computing the square root of a matrix

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