Pages that link to "Item:Q4157881"
From MaRDI portal
The following pages link to A faster method of computing the square root of a matrix (Q4157881):
Displaying 14 items.
- Computing real square roots of a real matrix (Q579846) (← links)
- A Schur method for the square root of a matrix (Q1052045) (← 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)
- A faster, more stable method for comuting the pth roots of positive definite matrices (Q1258164) (← links)
- An iterative algorithm for the solution of the discrete-time algebraic Riccati equation (Q1260796) (← links)
- A power method for computing square roots of complex matrices (Q1378703) (← links)
- On the roots of coquaternions (Q1635063) (← links)
- A study on square root control-systems (Q2074878) (← links)
- Newton's method for the matrix nonsingular square root (Q2336276) (← links)
- The weighted Moore-Penrose generalized inverse and the force analysis of overconstrained parallel mechanisms (Q2627908) (← links)
- Systolic computation of the matrix exponential and other matrix functions (Q3806680) (← links)
- (Q5220215) (← links)