Pages that link to "Item:Q1722105"

The following pages link to Approximating the matrix sign function using a novel iterative method (Q1722105):

Displaying 11 items.

• Numerically stable improved Chebyshev-Halley type schemes for matrix sign function (Q507873) (← links)
• Construction of a convergent scheme for finding matrix sign function (Q1643060) (← links)
• 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)
• Constructing a high-order globally convergent iterative method for calculating the matrix sign function (Q1721601) (← links)
• A novel iterative method for polar decomposition and matrix sign function (Q1723445) (← links)
• An algorithm for computing geometric mean of two Hermitian positive definite matrices via matrix sign (Q1725441) (← links)
• Several numerical methods for computing unitary polar factor of a matrix (Q1795555) (← links)
• Efficient iterative methods with and without memory possessing high efficiency indices (Q2321541) (← links)
• New iterative methods for finding matrix sign function: derivation and application (Q2322441) (← links)
• A fourth-order method for computing the sign function of a matrix with application in the Yang-Baxter-like matrix equation (Q2322453) (← links)