A Family of Rational Iterations and Its Application to the Computation of the Matrix pth Root
From MaRDI portal
Publication:3642842
DOI10.1137/070694351zbMATH Open1176.65054OpenAlexW1963502665MaRDI QIDQ3642842FDOQ3642842
Publication date: 6 November 2009
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070694351
Newton's methodmatrix functionmatrix rootHalley's methodstructure-preservingmatrix iterationrational iterations
Cited In (35)
- A study of Schröder's method for the matrix \(p\)th root using power series expansions
- The Padé iterations for the matrix sign function and their reciprocals are optimal
- On a new family of high‐order iterative methods for the matrix pth root
- The dual Padé families of iterations for the matrix \(p\)th root and the matrix \(p\)-sector function
- Title not available (Why is that?)
- A novel iterative method for polar decomposition and matrix sign function
- Approximating the matrix sign function using a novel iterative method
- On stochasticity preserving methods for the computation of the matrix \(p\)th root
- On \(p\)th roots of stochastic matrices
- Fast verified computation for the matrix principal \(p\)th root
- A fast convergent numerical method for matrix sign function with application in SDEs
- A Padé family of iterations for the matrix sign function and related problems
- A binary powering Schur algorithm for computing primary matrix roots
- On the convergence of Schröder iteration functions for pth roots of complex numbers
- On semilocal convergence analysis for two-step Newton method under generalized Lipschitz conditions in Banach spaces
- Iteration functions for \(p\)th roots of complex numbers
- Rational minimax iterations 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}\)
- The palindromic cyclic reduction and related algorithms
- 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
- 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 monotone Markov chains and properties of monotone matrix roots
- Rational approximations to fractional powers of self-adjoint positive operators
- Some matrix iterations for computing matrix sign function
- 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
- 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 sixth-order iterative method for approximating the polar decomposition of an arbitrary matrix
- On iterative algorithms for the polar decomposition of a matrix and the matrix sign function
- Iterative methods for finding commuting solutions of the Yang-Baxter-like matrix equation
- Roots in operator and Banach algebras
- An Algorithm for the Matrix Lambert $W$ Function
This page was built for publication: A Family of Rational Iterations and Its Application to the Computation of the Matrix pth Root
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3642842)