On the Newton Method for the Matrix Pth Root

DOI10.1137/050624790zbMath1113.65054OpenAlexW2037881170MaRDI QIDQ3435009

Bruno Iannazzo

Publication date: 3 May 2007

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050624790

zbMATH Keywords

Newton's methodnumerical experimentsJulia setnumerical stabilityrational iterationsmatrix iterations

Mathematics Subject Classification ID

Related Items (38)

On explicit formulas of the principal matrix \(p\)th root by polynomial decompositions ⋮ Further inequalities involving the weighted geometric operator mean and the Heinz operator mean ⋮ Roots in operator and Banach algebras ⋮ Finding \(n\)-th roots of a \(2\times 2\) real matrix using de Moivre's formula ⋮ Volume constrained 2-phase segmentation method utilizing a linear system solver based on the best uniform polynomial approximation of \(x^{- 1/2}\) ⋮ Third-degree anomalies of Traub's method ⋮ On Newton's method and Halley's method for the principal \(p\)th root of a matrix ⋮ On a new family of high‐order iterative methods for the matrix pth root ⋮ Monotonicity and positivity of coefficients of power series expansions associated with Newton and Halley methods for the matrix \(p\)th root ⋮ Fast verified computation for the matrix principal \(p\)th root ⋮ After notes on Chebyshev’s iterative method ⋮ Iteration functions for \(p\)th roots of complex numbers ⋮ Regions of convergence of a Padé family of iterations for the matrix sector function and the matrix \(p\)th root ⋮ Unnamed Item ⋮ A numerical method for computing the principal square root of a matrix ⋮ Unnamed Item ⋮ A note on cycling LP examples with permutation structure ⋮ On stochasticity preserving methods for the computation of the matrix \(p\)th root ⋮ Explicit \(p\)-dependent convergence regions of Newton's method for the matrix \(p\)th root ⋮ Least-squares collocation with covariance-matching constraints ⋮ A Padé family of iterations for the matrix sector function and the matrix p th root ⋮ A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices ⋮ A numerical study of fractional linear algebraic systems ⋮ The dual Padé families of iterations for the matrix \(p\)th root and the matrix \(p\)-sector function ⋮ On \(p\)th roots of stochastic matrices ⋮ The geometric mean of two matrices from a computational viewpoint ⋮ On the convergence of Schröder iteration functions for pth roots of complex numbers ⋮ Residual methods for the large-scale matrix \(p\)th root and some related problems ⋮ Unnamed Item ⋮ Conditioning of the matrix-matrix exponentiation ⋮ A binary powering Schur algorithm for computing primary matrix roots ⋮ A study of Schröder's method for the matrix \(p\)th root using power series expansions ⋮ Rational minimax iterations for computing the matrix \(p\)th root ⋮ Rational approximations to fractional powers of self-adjoint positive operators ⋮ Unnamed Item ⋮ Explicit convergence regions of Newton's method and Chebyshev's method for the matrix \(p\)th root ⋮ An Algorithm for the Matrix Lambert $W$ Function ⋮ Generalized fractional algebraic linear system solvers

This page was built for publication: On the Newton Method for the Matrix Pth Root