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

DOI10.1016/0024-3795(79)90176-9zbMath0407.65017OpenAlexW1968564862MaRDI 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 ExamplesGeneralization of Newton's MethodRoots of Positive Definite MatricesStable Method

Mathematics Subject Classification ID

Related Items (16)

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 ⋮ New algorithm for finding the solution of nonlinear matrix equations based on the weak condition with relation-theoretic \(F\)-contractions ⋮ A power method for computing square roots of complex matrices ⋮ Rectangular and polar representations of a complex matrix ⋮ Roots of real matrices ⋮ Spectral decomposition of a matrix using the generalized sign matrix ⋮ Unnamed Item ⋮ On the matrix equation \(f(x)=A\) ⋮ Numerical approximation of the product of the square root of a matrix with a vector ⋮ A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices ⋮ A parallel algorithm for principal \(n\)th roots of matrices ⋮ Algorithms for the matrix \(p\)th root ⋮ Unnamed Item ⋮ Rational minimax iterations for computing the matrix \(p\)th root ⋮ Computation of roots of real and complex matrices

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

This page was built for publication: A faster, more stable method for comuting the pth roots of positive definite matrices