On the Newton Method for the Matrix Pth Root
From MaRDI portal
Publication:3435009
DOI10.1137/050624790zbMATH Open1113.65054OpenAlexW2037881170MaRDI QIDQ3435009FDOQ3435009
Authors: 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
Recommendations
- A Schur Algorithm for Computing Matrix pth Roots
- Algorithms for the matrix \(p\)th root
- On Newton's method and Halley's method for the principal \(p\)th root of a matrix
- A Schur–Newton Method for the Matrix \lowercase{\boldmathp}th Root and its Inverse
- Specialized hybrid Newton schemes for matrix \(p\)th roots
numerical experimentsJulia setnumerical stabilityNewton's methodrational iterationsmatrix iterations
Numerical computation of solutions to systems of equations (65H10) Matrix equations and identities (15A24)
Cited In (62)
- A numerical method for computing the principal square root of a matrix
- A study of Schröder's method for the matrix \(p\)th root using power series expansions
- Title not available (Why is that?)
- Newton's Method for the Matrix Square Root
- The dual Padé families of iterations for the matrix \(p\)th root and the matrix \(p\)-sector function
- A Family of Rational Iterations and Its Application to the Computation of the Matrix pth Root
- The geometric mean of two matrices from a computational viewpoint.
- Further inequalities involving the weighted geometric operator mean and the Heinz operator mean
- Generalized fractional algebraic linear system solvers
- Approximation of the \(p\)th roots of a matrix by using trapezoid rule
- On stochasticity preserving methods for the computation of the matrix \(p\)th root
- On \(p\)th roots of stochastic matrices
- On explicit formulas of the principal matrix \(p\)th root by polynomial decompositions
- A note on cycling LP examples with permutation structure
- Computation of the matrix \(p\)th root and its Fréchet derivative by integrals
- After notes on Chebyshev's iterative method
- Fast verified computation for the matrix principal \(p\)th root
- Residual methods for the large-scale matrix \(p\)th root and some related problems
- A binary powering Schur algorithm for computing primary matrix roots
- Finding \(n\)-th roots of a \(2\times 2\) real matrix using de Moivre's formula
- On the convergence of Schröder iteration functions for pth roots of complex numbers
- A fast method for computing the principal \(n\)-th roots of complex matrices
- Iteration functions for \(p\)th roots of complex numbers
- Newton's method for computing the fifth roots of \(p\)-adic numbers
- Rational minimax iterations for computing the matrix \(p\)th root
- On the convergence of Newton's method for computing the matrix \(p\)-th root
- 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
- Specialized hybrid Newton schemes for matrix \(p\)th roots
- Newton-Schulz method for solving nonlinear matrix equation \(X^p + A^\ast XA=Q\)
- Operator means of lower triangular matrices
- Explicit \(p\)-dependent convergence regions of Newton's method for the matrix \(p\)th root
- Conditioning of the matrix-matrix exponentiation
- A Matrix Approach to the Newton Formula and Divided Differences
- Explicit convergence regions of Newton's method and Chebyshev's method for the matrix \(p\)th root
- Rational approximations to fractional powers of self-adjoint positive operators
- Title not available (Why is that?)
- Monotonicity and positivity of coefficients of power series expansions associated with Newton and Halley methods for the matrix \(p\)th root
- Regions of convergence of a Padé family of iterations for the matrix sector function and the matrix \(p\)th root
- Title not available (Why is that?)
- Computation of roots of real and complex matrices
- Computing the \(p\)th roots of a matrix with repeated eigenvalues
- A Padé family of iterations for the matrix sector function and the matrix \(p\)th root
- A note on computing the matrix square root
- On a new family of high-order iterative methods for the matrix \(p\)th root.
- An analysis on the efficiency of Euler's method for computing the matrix pth root
- A numerical study of fractional linear algebraic systems
- A Schur–Newton Method for the Matrix \lowercase{\boldmathp}th Root and its Inverse
- A cost-efficient variant of the incremental Newton iteration for the matrix \(p\)th root
- Newton's method and high-order algorithms for the \(n\)th root computation
- Title not available (Why is that?)
- Roots in operator and Banach algebras
- Algorithms for the matrix \(p\)th root
- Least-squares collocation with covariance-matching constraints
- An Algorithm for the Matrix Lambert $W$ Function
- A Schur Algorithm for Computing Matrix pth Roots
- Computation of matrix \(p\)th roots using moments
- On a high order algorithm converging to the \(m\)th root of a positive matrix and application for computing the matrix logarithm
- Computation of the \(q\)-th roots of circulant matrices
- Title not available (Why is that?)
- A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices
This page was built for publication: On the Newton Method for the Matrix Pth Root
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3435009)