Constructing a high-order globally convergent iterative method for calculating the matrix sign function

DOI10.1155/2018/8973867zbMath1427.65077OpenAlexW2809605039WikidataQ129653061 ScholiaQ129653061MaRDI QIDQ1721601

Haifa Bin Jebreen

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2018/8973867

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Matrix equations and identities (15A24) Numerical linear algebra (65F99)

Related Items (1)

Numerically stable iterative methods for computing matrix sign function

Uses Software

• mftoolbox

Cites Work

• Unnamed Item
• A method for generating realistic correlation matrices
• A note on mode decoupling of linear time-invariant systems using the generalized sign matrix
• Algorithms for the matrix sector function
• Solving stable generalized Lyapunov equations with the matrix sign function
• Approximating the matrix sign function using a novel iterative method
• A numerical method for computing the principal square root of a matrix
• The sign matrix and the separation of matrix eigenvalues
• Constructing two-step iterative methods with and without memory
• Algorithms for the matrix \(p\)th root
• Linear model reduction and solution of the algebraic Riccati equation by use of the sign function†
• On Scaling Newton’s Method for Polar Decomposition and the Matrix Sign Function
• The Matrix Sign Function Method and the Computation of Invariant Subspaces
• Using the Matrix Sign Function to Compute Invariant Subspaces
• The matrix sign function
• A Padé family of iterations for the matrix sign function and related problems
• Rational Iterative Methods for the Matrix Sign Function
• Functions of Matrices

This page was built for publication: Constructing a high-order globally convergent iterative method for calculating the matrix sign function