Globally convergent iterative scheme for computing matrix sign function with numerical stability

DOI10.1002/MMA.9212MaRDI QIDQ6947977zbMATH OpenFDO

Authors Munish Kansal

Publication date 5 August 2025

Published in Mathematical Methods in the Applied Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/MMA.9212

zbMATH Keywords

attraction basinseigenvalueshigher-ordermatrix iterationssign function

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Rate of convergence, degree of approximation (41A25)

Cites work

• A fast convergent numerical method for matrix sign function with application in SDEs
• A fourth-order method for computing the sign function of a matrix with application in the Yang-Baxter-like matrix equation
• A multiquadric RBF-FD scheme for simulating the financial HHW equation utilizing exponential integrator
• A Padé family of iterations for the matrix sign function and related problems.
• An Introduction to Programming with Mathematica®
• Computation of the structured stability radius via matrix sign function
• Computing the Polar Decomposition and the Matrix Sign Decomposition in Matrix Groups
• Functions of Matrices
• scientific article; zbMATH DE number 802915 (Why is no real title available?)
• Inverse multi-quadric RBF for computing the weights of FD method: application to American options
• Iterative Berechnung der reziproken Matrix.
• Linear model reduction and solution of the algebraic Riccati equation by use of the sign function†
• Matrix sector functions and their applications to systems theory
• Matrix sign function in the problems of analysis and design of the linear systems
• Multipoint methods for solving nonlinear equations
• Numerically stable improved Chebyshev-Halley type schemes for matrix sign function
• On Deriving the Inverse of a Sum of Matrices
• On Scaling Newton’s Method for Polar Decomposition and the Matrix Sign Function
• Rational Iterative Methods for the Matrix Sign Function
• Several numerical methods for computing unitary polar factor of a matrix
• The matrix sign decomposition and its relation to the polar decomposition
• The matrix sign function
• The sign matrix and the separation of matrix eigenvalues

Cited in

(1)

• An efficient numerical approach to approximate the tensor sign function with the Einstein product

This page was built for publication: Globally convergent iterative scheme for computing matrix sign function with numerical stability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6947977)