Pages that link to "Item:Q5296015"
From MaRDI portal
The following pages link to A Schur–Newton Method for the Matrix \lowercase{\boldmath<i>p</i>}th Root and its Inverse (Q5296015):
Displaying 30 items.
- On the iterative method for the system of nonlinear matrix equations (Q370131) (← links)
- Regions of convergence of a Padé family of iterations for the matrix sector function and the matrix \(p\)th root (Q442727) (← links)
- Fast enclosure for a matrix inverse square root (Q477751) (← links)
- On \(p\)th roots of stochastic matrices (Q541909) (← links)
- On the convergence of Schröder iteration functions for pth roots of complex numbers (Q546063) (← links)
- Iteration functions for \(p\)th roots of complex numbers (Q634180) (← links)
- On Newton's method and Halley's method for the principal \(p\)th root of a matrix (Q848572) (← links)
- The complex step approximation to the Fréchet derivative of a matrix function (Q849151) (← links)
- A residual recurrence for Halley's method for the matrix \(p\)th root (Q967508) (← links)
- Positive definite solutions of the matrix equation \(X^r - \sum_{i = 1}^m A_i^{\ast} X^{- \delta_i} A_i = I\) (Q1668898) (← links)
- Monotonicity and positivity of coefficients of power series expansions associated with Newton and Halley methods for the matrix \(p\)th root (Q1668991) (← links)
- Fast verified computation for the matrix principal \(p\)th root (Q1675959) (← links)
- A numerical method for computing the principal square root of a matrix (Q1724326) (← links)
- Conditioning of the matrix-matrix exponentiation (Q1785539) (← links)
- A numerical study of fractional linear algebraic systems (Q1998393) (← links)
- Rational minimax iterations for computing the matrix \(p\)th root (Q2049603) (← links)
- Generalized fractional algebraic linear system solvers (Q2113672) (← links)
- Explicit \(p\)-dependent convergence regions of Newton's method for the matrix \(p\)th root (Q2236732) (← links)
- Solving the discrete Euler-Arnold equations for the generalized rigid body motion (Q2237926) (← links)
- Computing enclosures for the inverse square root and the sign function of a matrix (Q2249733) (← links)
- The dual Padé families of iterations for the matrix \(p\)th root and the matrix \(p\)-sector function (Q2253089) (← links)
- Inversion free algorithms for computing the principal square root of a matrix (Q2260324) (← links)
- A study of Schröder's method for the matrix \(p\)th root using power series expansions (Q2287864) (← links)
- Explicit convergence regions of Newton's method and Chebyshev's method for the matrix \(p\)th root (Q2332402) (← links)
- Testing Matrix Function Algorithms Using Identities (Q2828165) (← links)
- On a new family of high‐order iterative methods for the matrix <i>p</i>th root (Q3466256) (← links)
- (Q4616929) (← links)
- A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices (Q5161375) (← links)
- Computing the Square Root of a Low-Rank Perturbation of the Scaled Identity Matrix (Q5885808) (← links)
- A binary powering Schur algorithm for computing primary matrix roots (Q5962185) (← links)