Numerical Solution of Matrix Polynomial Equations by Newton's Method
The paper presents an algorithm, corresponding to the general Newton- Kantorovich method, for the numerical solution of matrix polynomial equations of the form \(P(X)=\sum^{n}_{r=1}A_ rX^ r=B\) in the unknown \(m\times m\) matrix X, with \(A_ 1,...,A_ n\), B \(m\times m\) complex matrices. In the case of simple solutions (solvents), i.e. where the Fréchet derivative of P(X) is regular, this method converges quadratically in a neighbourhood of any solvent. Each step of the iterative method requires the solution of a linear equation of the form \(\sum^{n}_{r=1}\hat A_ rH\hat B_ r=C\) in the unknown matrix H. Such equations are solved by a transformation into an \(m^ 2\times m^ 2\) linear system of type \(Gx=b.\) Numerical examples and the numerical behaviour of the method are discussed. The proof of the convergence of the method is based on explicit estimates for the Fréchet derivative; these bounds also yield a new existence result for the equation \(P(X)=B\), proved by means of a modified algorithm which involves only the derivative of P at a fixed point. Finally, the method is applied to scalar matrix equations \((A_ r=a_ rI)\), to quadratic equations, and to the problem of finding the square root of B; in comparison with known methods, it is shown that the proposed method is self-correcting.
- Remarks on polynomial methods for solving systems of linear algebraic equations
- Methods and algorithms of solving spectral problems for polynomial and rational matrices
- Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
- Condition numbers and backward error of a matrix polynomial equation arising in stochastic models
- An efficient predictor-corrector iterative scheme for solving Wiener-Hopf problems
- An explicit polynomial to globalize algorithms for solving matrix polynomial equations
- On the local convergence of a quasi-Newton method for solving matrix polynomial equations
- A structure-preserving doubling algorithm for solving a class of quadratic matrix equation with \(M\)-matrix
- A contour integral approach to the computation of invariant pairs
- Convergence of pure and relaxed Newton methods for solving a matrix polynomial equation arising in stochastic models
- On the numerical solution of matrix polynomial equations
- Solving a quadratic matrix equation by newton's method with exact line searches
- Solving a matrix polynomial by Newton's method
- A fixed point method to compute solvents of matrix polynomials
- scientific article; zbMATH DE number 3874509 (Why is no real title available?)
- Solving quadratic matrix equations and factoring polynomials: new fixed point iterations based on Schur complements of Toeplitz matrices
- scientific article; zbMATH DE number 5519810 (Why is no real title available?)
- scientific article; zbMATH DE number 4045889 (Why is no real title available?)
- On iterative methods for the quadratic matrix equation with M-matrix
- scientific article; zbMATH DE number 1079156 (Why is no real title available?)
- A Matrix Approach to the Newton Formula and Divided Differences
- Convergence of a modified Newton method for a matrix polynomial equation arising in stochastic problem
- On solutions of second-order matrix polynomial equation of high degree
- scientific article; zbMATH DE number 7546040 (Why is no real title available?)
- Two global quasi-Newton algorithms for solving matrix polynomial equations
- About a fixed‐point‐type transformation to solve quadratic matrix equations using the Krasnoselskij method
- A modified fixed-point iteration method for a class of polynomial matrix equations
- Stochastic theta methods for free stochastic differential equations
- Improved Newton's method with exact line searches to solve quadratic matrix equation
This page was built for publication: Numerical Solution of Matrix Polynomial Equations by Newton's Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3768267)