Constructing a high-order globally convergent iterative method for calculating the matrix sign function
type: Item
instance of: scholarly article
title: Constructing a high-order globally convergent iterative method for calculating the matrix sign function
zbMATH Open document ID: 1427.65077
DOI: 10.1155/2018/8973867
author: Haifa Bin Jebreen
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: This work is concerned with the construction of a new matrix iteration in the form of an iterative method which is globally convergent for finding the sign of a square matrix having no eigenvalues on the axis of imaginary. Toward this goal, a new method is built via an application of a new four-step nonlinear equation solver on a particulate matrix equation. It is discussed that the proposed scheme has global convergence with eighth order of convergence. To illustrate the effectiveness of the theoretical results, several computational experiments are worked out.
Mathematics Subject Classification ID: 65H10
Mathematics Subject Classification ID: 65F99
Mathematics Subject Classification ID: 15A24
zbMATH DE Number: 7019686
describes a project that uses: mftoolbox
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2018/8973867
OpenAlex ID: W2809605039
cites work: Linear model reduction and solution of the algebraic Riccati equation by use of the sign function†
cites work: Solving stable generalized Lyapunov equations with the matrix sign function
cites work: The sign matrix and the separation of matrix eigenvalues
cites work: The matrix sign function
cites work: A method for generating realistic correlation matrices
cites work: Functions of Matrices
cites work: Using the Matrix Sign Function to Compute Invariant Subspaces
cites work: The Matrix Sign Function Method and the Computation of Invariant Subspaces
cites work: A note on mode decoupling of linear time-invariant systems using the generalized sign matrix
cites work: Algorithms for the matrix \(p\)th root
cites work: Algorithms for the matrix sector function
cites work: Approximating the matrix sign function using a novel iterative method
cites work: Rational Iterative Methods for the Matrix Sign Function
cites work: A Padé family of iterations for the matrix sign function and related problems
cites work: A numerical method for computing the principal square root of a matrix
cites work: Constructing two-step iterative methods with and without memory
cites work: On Scaling Newton’s Method for Polar Decomposition and the Matrix Sign Function
cites work: Q2965839
Wikidata QID: Q129653061
Recommended article: Construction of stable and globally convergent schemes for the matrix sign function
Recommended article: Approximating the matrix sign function using a novel iterative method
Recommended article: Numerically stable iterative methods for computing matrix sign function
Recommended article: Construction of a convergent scheme for finding matrix sign function
Recommended article: A family of high order iterations for calculating the sign of a matrix
Recommended article: New iterative methods for finding matrix sign function: derivation and application
Recommended article: A globally convergent variant of mid-point method for finding the matrix sign
Recommended article: Rational Iterative Methods for the Matrix Sign Function
Recommended article: A fast convergent numerical method for matrix sign function with application in SDEs
Recommended article: Numerically stable improved Chebyshev-Halley type schemes for matrix sign function
description: scientific article; zbMATH DE number 7019686