On the convergence of Newton's method for computing the matrix p-th root
From MaRDI portal
Publication:3175838
DOI10.16218/J.ISSN.1001-5051.2017.04.002zbMATH Open1413.65144MaRDI QIDQ3175838FDOQ3175838
Authors: Yonghui Ling
Publication date: 18 July 2018
Recommendations
- Explicit \(p\)-dependent convergence regions of Newton's method for the matrix \(p\)th root
- Explicit convergence regions of Newton's method and Chebyshev's method for the matrix \(p\)th root
- On Newton's method and Halley's method for the principal \(p\)th root of a matrix
- Iterative methods for computing the matrix square root
- On the Newton Method for the Matrix Pth Root
Cited In (6)
- On Newton's method and Halley's method for the principal \(p\)th root of a matrix
- A residual recurrence for Halley's method for the matrix \(p\)th root
- Title not available (Why is that?)
- An analysis on the efficiency of Euler's method for computing the matrix pth root
- The influence of the position of the zeros in a non-negative matrix on the convergence of the algorithm for computing its Perron root
- Title not available (Why is that?)
This page was built for publication: On the convergence of Newton's method for computing the matrix \(p\)-th root
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3175838)