2001
DOI: 10.1137/s0895479899350976
|View full text |Cite
|
Sign up to set email alerts
|

Solving a Quadratic Matrix Equation by Newton's Method with Exact Line Searches

Abstract: Abstract. We show how to incorporate exact line searches into Newton's method for solving the quadratic matrix equation AX 2 + BX + C = 0, where A, B and C are square matrices. The line searches are relatively inexpensive and improve the global convergence properties of Newton's method in theory and in practice. We also derive a condition number for the problem and show how to compute the backward error of an approximate solution.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
96
0
11

Year Published

2006
2006
2022
2022

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 114 publications
(107 citation statements)
references
References 28 publications
(47 reference statements)
0
96
0
11
Order By: Relevance
“…Several works address the problem of computing a numerical approximation for the solution of the quadratic matrix equation: an approach to compute, when possible, the dominant solvent is proposed in [12]. Newton's method and some variations are also used to approximate solvents numerically: see for example [11], [22], [21], [27]. The work in [19] uses interval arithmetic to compute an interval matrix containing the exact solution to the quadratic matrix equation.…”
Section: P (S) := J=0mentioning
confidence: 99%
See 3 more Smart Citations
“…Several works address the problem of computing a numerical approximation for the solution of the quadratic matrix equation: an approach to compute, when possible, the dominant solvent is proposed in [12]. Newton's method and some variations are also used to approximate solvents numerically: see for example [11], [22], [21], [27]. The work in [19] uses interval arithmetic to compute an interval matrix containing the exact solution to the quadratic matrix equation.…”
Section: P (S) := J=0mentioning
confidence: 99%
“…We follow the ideas presented in the articles [36] and [21], which give expressions for backward errors and condition numbers for the polynomial eigenvalue problem and for a solvent of the quadratic matrix equation.…”
Section: Condition Number and Backward Error Of The Invariant Pair Prmentioning
confidence: 99%
See 2 more Smart Citations
“…Also, the mixed perturbation analysis was suggested by Skeel [6] and he obtained the mixed analysis for Gaussian elimination. Higham and Kim [3] considered the componentwise perturbation theory for the equation Q(X). Gohberg and Koltracht [2] obtained explicit expressions for both mixed and componentwise condition numbers.…”
Section: Introductionmentioning
confidence: 99%