Rational Iterative Methods for the Matrix Sign Function

From MaRDI portal
Publication:5203576

DOI10.1137/0612020zbMath0725.65048OpenAlexW2015001720MaRDI QIDQ5203576

Charles S. Kenney, Alan J. Laub

Publication date: 1991

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ec3ef8a358144076cd67fd0cd47d5b26cde29206



Related Items

Fast random field generation with \(H\)-matrices, Analysis of numerical methods for spectral fractional elliptic equations based on the best uniform rational approximation, A hyperbolic tangent identity and the geometry of Padé sign function iterations, A local convergence theorem for the super-Halley method in a Banach space, Implicit purification for temperature-dependent density matrices, The matrix sign decomposition and its relation to the polar decomposition, Parallel algorithms for algebraic Riccati equations, Construction of a convergent scheme for finding matrix sign function, Finite-Dimensional Indefinite Inner Product Spaces and Applications in Numerical Analysis, Spectral division methods for block generalized Schur decompositions, Parallel solution of Riccati matrix equations with the matrix sign function, Stable and Efficient Computation of Generalized Polar Decompositions, A general approach for improving the Padé iterations for the matrix sign function, A Structure-Preserving Divide-and-Conquer Method for Pseudosymmetric Matrices, Numerically stable iterative methods for computing matrix sign function, Iterative Computation of the Fréchet Derivative of the Polar Decomposition, Regions of convergence of a Padé family of iterations for the matrix sector function and the matrix \(p\)th root, A globally convergent variant of mid-point method for finding the matrix sign, The Padé iterations for the matrix sign function and their reciprocals are optimal, On a class of two-dimensional incomplete Riemann solvers, Constructing a high-order globally convergent iterative method for calculating the matrix sign function, Approximating the matrix sign function using a novel iterative method, A novel iterative method for polar decomposition and matrix sign function, A numerical method for computing the principal square root of a matrix, An algorithm for computing geometric mean of two Hermitian positive definite matrices via matrix sign, On iterative algorithms for the polar decomposition of a matrix and the matrix sign function, An iterative method for solving the stable subspace of a matrix pencil and its application, A Padé family of iterations for the matrix sector function and the matrix p th root, Numerically stable improved Chebyshev-Halley type schemes for matrix sign function, A numerical study of fractional linear algebraic systems, The dual Padé families of iterations for the matrix \(p\)th root and the matrix \(p\)-sector function, A fast convergent numerical method for matrix sign function with application in SDEs, A Padé family of iterations for the matrix sign function and related problems, A third-order Newton-type method for finding polar decomposition, An iterative method to compute the sign function of a non-Hermitian matrix and its application to the overlap Dirac operator at nonzero chemical potential, Construction of stable and globally convergent schemes for the matrix sign function, A parallel algorithm for principal \(n\)th roots of matrices, Solving stable Sylvester equations via rational iterative schemes, Several numerical methods for computing unitary polar factor of a matrix, New iterative methods for finding matrix sign function: derivation and application, A fourth-order method for computing the sign function of a matrix with application in the Yang-Baxter-like matrix equation, Error analysis of Padé iterations for computing matrix invariant subspaces, Some matrix iterations for computing matrix sign function, Generalized fractional algebraic linear system solvers, Computation of the structured stability radius via matrix sign function