Pages that link to "Item:Q1258164"
From MaRDI portal
The following pages link to A faster, more stable method for comuting the pth roots of positive definite matrices (Q1258164):
Displayed 16 items.
- Computation of roots of real and complex matrices (Q1067358) (← links)
- A fast method for computing the principal \(n\)-th roots of complex matrices (Q1085563) (← links)
- Fast and stable algorithms for computing the principal \(n\)th root of a complex matrix and the matrix sector function (Q1107951) (← links)
- Roots of real matrices (Q1150250) (← links)
- Spectral decomposition of a matrix using the generalized sign matrix (Q1152200) (← links)
- On the matrix equation \(f(x)=A\) (Q1183203) (← links)
- A power method for computing square roots of complex matrices (Q1378703) (← links)
- Numerical approximation of the product of the square root of a matrix with a vector (Q1978127) (← links)
- Rational minimax iterations for computing the matrix \(p\)th root (Q2049603) (← links)
- A parallel algorithm for principal \(n\)th roots of matrices (Q2275046) (← links)
- Algorithms for the matrix \(p\)th root (Q2501233) (← links)
- New algorithm for finding the solution of nonlinear matrix equations based on the weak condition with relation-theoretic \(F\)-contractions (Q2659615) (← links)
- Rectangular and polar representations of a complex matrix (Q3773179) (← links)
- (Q4561679) (← links)
- A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices (Q5161375) (← links)
- (Q6141617) (← links)