Numerical Solution of Matrix Polynomial Equations by Newton's Method

DOI10.1093/imanum/7.3.355zbMath0631.65040OpenAlexW2054557544MaRDI QIDQ3768267

Werner Kratz, Eberhard U. Stickel

Publication date: 1987

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imanum/7.3.355

zbMATH Keywords

quadratic convergenceNewton-Kantorovich methodsquare rootsolventsquadratic equationsNumerical examplesmatrix polynomial equationsscalar matrix equations

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10)

Related Items

A structure-preserving doubling algorithm for solving a class of quadratic matrix equation with \(M\)-matrix ⋮ On solutions of second-order matrix polynomial equation of high degree ⋮ Condition numbers and backward error of a matrix polynomial equation arising in stochastic models ⋮ Methods and algorithms of solving spectral problems for polynomial and rational matrices ⋮ 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 ⋮ On iterative methods for the quadratic matrix equation with \(M\)-matrix ⋮ Convergence of pure and relaxed Newton methods for solving a matrix polynomial equation arising in stochastic models ⋮ Improved Newton's method with exact line searches to solve quadratic matrix equation ⋮ Unnamed Item ⋮ An efficient predictor-corrector iterative scheme for solving Wiener-Hopf problems ⋮ An explicit polynomial to globalize algorithms for solving matrix polynomial equations ⋮ Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian ⋮ On the local convergence of a quasi-Newton method for solving matrix polynomial equations ⋮ A contour integral approach to the computation of invariant pairs