Pages that link to "Item:Q5962185"
From MaRDI portal
The following pages link to A binary powering Schur algorithm for computing primary matrix roots (Q5962185):
Displaying 9 items.
- Approximation of the \(p\)th roots of a matrix by using trapezoid rule (Q417264) (← links)
- On \(p\)th roots of stochastic matrices (Q541909) (← links)
- Computing primary solutions of equations involving primary matrix functions (Q1625478) (← links)
- Monotonicity and positivity of coefficients of power series expansions associated with Newton and Halley methods for the matrix \(p\)th root (Q1668991) (← links)
- Substitution algorithms for rational matrix equations (Q2203384) (← 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)
- Computing the Square Root of a Low-Rank Perturbation of the Scaled Identity Matrix (Q5885808) (← links)
