A faster, more stable method for comuting the pth roots of positive definite matrices

DOI10.1016/0024-3795(79)90176-9zbMath0407.65017MaRDI QIDQ1258164

D. J. Walton, William D. Hoskins

Publication date: 1979

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(79)90176-9

zbMATH Keywords

Numerical Examples; Generalization of Newton's Method; Roots of Positive Definite Matrices; Stable Method

Mathematics Subject Classification ID

15B57: Hermitian, skew-Hermitian, and related matrices

Related Items

Computation of roots of real and complex matrices, 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, Spectral decomposition of a matrix using the generalized sign matrix, On the matrix equation \(f(x)=A\), A power method for computing square roots of complex matrices, Numerical approximation of the product of the square root of a matrix with a vector, Algorithms for the matrix \(p\)th root, Rectangular and polar representations of a complex matrix

Cites Work

• The matrix sign function and computations in systems
• A faster method of computing the square root of a matrix
• A high-order method of solution for the Lyapunov matrix equation
• Unnamed Item
• Unnamed Item
• Unnamed Item