Improved Newton's method with exact line searches to solve quadratic matrix equation (Q955086): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Numerical Solution of a Quadratic Matrix Equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Fréchet derivative of matrix functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Solution of Matrix Polynomial Equations by Newton's Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a Quadratic Matrix Equation by Newton's Method with Exact Line Searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical analysis of a quadratic matrix equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the Sylvester matrix equation AXB <sup> <i>T</i> </sup> + CXD <sup> <i>T</i> </sup> = E / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5523899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Solvents of Matrix Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quadratic Eigenvalue Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3939931 / rank
 
Normal rank

Latest revision as of 20:35, 28 June 2024

scientific article
Language Label Description Also known as
English
Improved Newton's method with exact line searches to solve quadratic matrix equation
scientific article

    Statements

    Improved Newton's method with exact line searches to solve quadratic matrix equation (English)
    0 references
    0 references
    0 references
    0 references
    18 November 2008
    0 references
    A method for solving the matrix equation \(AX^2 + BX + C=0\) is given. There are two main contributions: First, the incorporation of Newton's method with exact new line searches is to reduce the computational cost, and second, the use of the technique of \textit{V. E. Shamanskij} [Ukrain Math. Z. 19, No.~1, 133--138 (1967; Zbl 0176.13802)] to get a faster rate of convergence. Theoretical and computational results are presented to show the efficiency of the proposed method.
    0 references
    0 references
    quadratic matrix equation
    0 references
    Newton's method
    0 references
    exact line search
    0 references
    numerical examples
    0 references
    0 references