Explicit convergence regions of Newton's method and Chebyshev's method for the matrix pth root
DOI10.1016/J.LAA.2019.08.020zbMATH Open1437.65043OpenAlexW2969295755WikidataQ127335703 ScholiaQ127335703MaRDI QIDQ2332402FDOQ2332402
Authors: Chun-Hua Guo 
Publication date: 4 November 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2019.08.020
Recommendations
- Explicit \(p\)-dependent convergence regions of Newton's method for the matrix \(p\)th root
- On the convergence of Newton's method for computing the matrix \(p\)-th root
- On the Newton Method for the Matrix Pth Root
- On Newton's method and Halley's method for the principal \(p\)th root of a matrix
- scientific article
Iterative numerical methods for linear systems (65F10) Numerical computation of solutions to systems of equations (65H10)
Cites Work
- Functions of Matrices
- A Schur Algorithm for Computing Matrix pth Roots
- An improved Schur-Padé algorithm for fractional powers of a matrix and their Fréchet derivatives
- On the Newton Method for the Matrix Pth Root
- Algorithms for the matrix \(p\)th root
- A Schur-Padé algorithm for fractional powers of a matrix
- A Family of Rational Iterations and Its Application to the Computation of the Matrix pth Root
- A Schur–Newton Method for the Matrix \lowercase{\boldmathp}th Root and its Inverse
- On eigenvalues of sums of normal matrices
- A binary powering Schur algorithm for computing primary matrix roots
- Iteration functions for \(p\)th roots of complex numbers
- On Newton's method and Halley's method for the principal \(p\)th root of a matrix
- On the convergence of Schröder iteration functions for pth roots of complex numbers
- The dual Padé families of iterations for the matrix \(p\)th root and the matrix \(p\)-sector function
- A Schur logarithmic algorithm for fractional powers of matrices
- Monotonicity and positivity of coefficients of power series expansions associated with Newton and Halley methods for the matrix \(p\)th root
- An analysis on the efficiency of Euler's method for computing the matrix pth root
- A study of Schröder's method for the matrix \(p\)th root using power series expansions
Cited In (5)
- On the convergence of Newton's method for computing the matrix \(p\)-th root
- On Newton's method and Halley's method for the principal \(p\)th root of a matrix
- Explicit \(p\)-dependent convergence regions of Newton's method for the matrix \(p\)th root
- Title not available (Why is that?)
- A new class of root-finding methods in \({\mathbb {R}}^n\): the inexact tensor-free Chebyshev-Halley class
Uses Software
This page was built for publication: Explicit convergence regions of Newton's method and Chebyshev's method for the matrix \(p\)th root
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2332402)
