Pages that link to "Item:Q1179549"
From MaRDI portal
The following pages link to On the computation of a matrix inverse square root (Q1179549):
Displaying 15 items.
- Fast enclosure for a matrix inverse square root (Q477751) (← links)
- Low-complexity inverse square root approximation for baseband matrix operations (Q630824) (← links)
- Revisiting matrix squaring (Q1176519) (← links)
- Computing matrix-valued Nevanlinna-Pick interpolation (Q1329978) (← links)
- Successive matrix squaring algorithm for computing the Drazin inverse (Q1569158) (← links)
- A Lanczos approach to the inverse square root of a large and sparse matrix (Q1577026) (← links)
- Square roots of \(3\times 3\) matrices (Q1675419) (← links)
- A one parameter method for the matrix inverse square root (Q1978979) (← links)
- Computing enclosures for the inverse square root and the sign function of a matrix (Q2249733) (← links)
- Inversion free algorithms for computing the principal square root of a matrix (Q2260324) (← links)
- Symmetric approximation of frames and bases in Hilbert spaces (Q2759077) (← links)
- On the computation of the inverse square roots of circulant matrices (Q3017048) (← links)
- (Q4980497) (← links)
- A Schur–Newton Method for the Matrix \lowercase{\boldmath<i>p</i>}th Root and its Inverse (Q5296015) (← links)
- An Iterative Method for the Computation of a Matrix Inverse Square Root (Q5689876) (← links)
