Pages that link to "Item:Q2336419"
From MaRDI portal
The following pages link to Some matrix iterations for computing matrix sign function (Q2336419):
Displaying 12 items.
- A generalized Steffensen's method for matrix sign function (Q1643061) (← links)
- A globally convergent variant of mid-point method for finding the matrix sign (Q1715647) (← links)
- Approximating the matrix sign function using a novel iterative method (Q1722105) (← links)
- A numerical method for computing the principal square root of a matrix (Q1724326) (← links)
- New mono- and biaccelerator iterative methods with memory for nonlinear equations (Q1724774) (← links)
- An algorithm for computing geometric mean of two Hermitian positive definite matrices via matrix sign (Q1725441) (← links)
- Efficient iterative methods with and without memory possessing high efficiency indices (Q2321541) (← links)
- Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions (Q3186101) (← links)
- Using the Matrix Sign Function to Compute Invariant Subspaces (Q4389070) (← links)
- Certification of numerical computation of the sign of the determinant of a matrix (Q5940606) (← links)
- Numerically stable iterative methods for computing matrix sign function (Q6139268) (← links)
- Extraction of deflating subspaces using disk function of a matrix pencil via matrix sign function with application in generalized eigenvalue problem (Q6489247) (← links)
