A study of Schröder's method for the matrix \(p\)th root using power series expansions
From MaRDI portal
Publication:2287864
DOI10.1007/s11075-019-00681-2zbMath1434.65056arXiv1807.04251OpenAlexW2963660587MaRDI QIDQ2287864
Publication date: 22 January 2020
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.04251
Series expansions (e.g., Taylor, Lidstone series, but not Fourier series) (41A58) Numerical computation of roots of polynomial equations (65H04) Numerical computation of matrix exponential and similar matrix functions (65F60)
Related Items (max. 100)
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
Uses Software
Cites Work
- On the convergence of Schröder iteration functions for pth roots of complex numbers
- Iteration functions for \(p\)th roots of complex numbers
- Recurrence relations for rational cubic methods. II: The Chebyshev method
- 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
- Inverse M-matrices
- Monotonicity and positivity of coefficients of power series expansions associated with Newton and Halley methods for the matrix \(p\)th root
- The dual Padé families of iterations for the matrix \(p\)th root and the matrix \(p\)-sector function
- Algorithms for the matrix \(p\)th root
- A Schur Logarithmic Algorithm for Fractional Powers of Matrices
- An Improved Schur--Padé Algorithm for Fractional Powers of a Matrix and Their Fréchet Derivatives
- Analytic functions ofM-matrices and generalizations
- A Schur–Padé Algorithm for Fractional Powers of a Matrix
- On the Newton Method for the Matrix Pth Root
- On a new family of high‐order iterative methods for the matrix pth root
- A Family of Rational Iterations and Its Application to the Computation of the Matrix pth Root
- Inequalities for M-matrices
- A Schur Algorithm for Computing Matrix pth Roots
- An analysis on the efficiency of Euler's method for computing the matrix pth root
- The Matrix Square Root from a New Functional Perspective: Theoretical Results and Computational Issues
- A Schur–Newton Method for the Matrix \lowercase{\boldmathp}th Root and its Inverse
- Partial Fraction Expansions for Newton's and Halley's Iterations for Square Roots
- Functions of Matrices
- A binary powering Schur algorithm for computing primary matrix roots
This page was built for publication: A study of Schröder's method for the matrix \(p\)th root using power series expansions