Constructing a high-order globally convergent iterative method for calculating the matrix sign function (Q1721601): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q129653061, #quickstatements; #temporary_batch_1724703925167
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Linear model reduction and solution of the algebraic Riccati equation by use of the sign function† / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving stable generalized Lyapunov equations with the matrix sign function / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sign matrix and the separation of matrix eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: The matrix sign function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for generating realistic correlation matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functions of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the Matrix Sign Function to Compute Invariant Subspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Matrix Sign Function Method and the Computation of Invariant Subspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on mode decoupling of linear time-invariant systems using the generalized sign matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the matrix \(p\)th root / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the matrix sector function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the matrix sign function using a novel iterative method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational Iterative Methods for the Matrix Sign Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Padé family of iterations for the matrix sign function and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerical method for computing the principal square root of a matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing two-step iterative methods with and without memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Scaling Newton’s Method for Polar Decomposition and the Matrix Sign Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2965839 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129653061 / rank
 
Normal rank

Latest revision as of 22:26, 26 August 2024

scientific article
Language Label Description Also known as
English
Constructing a high-order globally convergent iterative method for calculating the matrix sign function
scientific article

    Statements

    Constructing a high-order globally convergent iterative method for calculating the matrix sign function (English)
    0 references
    0 references
    0 references
    8 February 2019
    0 references
    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.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references