Two global quasi-Newton algorithms for solving matrix polynomial equations

DOI10.1007/s40314-023-02450-3OpenAlexW4386882791MaRDI QIDQ6080431

Héctor Martínez, Mauricio MacÍas, Rosana Pérez

Publication date: 2 October 2023

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-023-02450-3

zbMATH Keywords

convergenceexact line searchmatrix polynomial equationsglobal quasi-Newton algorithm

Mathematics Subject Classification ID

Cites Work

• Polynomial eigenvalue problems with Hamiltonian structure
• 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
• Convergence of pure and relaxed Newton methods for solving a matrix polynomial equation arising in stochastic models
• Numerical Solution of Matrix Polynomial Equations by Newton's Method
• An exact line search method for solving generalized continuous-time algebraic Riccati equations
• Finite Element Analysis of a Quadratic Eigenvalue Problem Arising in Dissipative Acoustics
• Numerical analysis of a quadratic matrix equation
• Formulation and solution of the non‐linear, damped eigenvalue problem for skeletal systems
• Variational Formulation for Guided and Leaky Modes in Multilayer Dielectric Waveguides
• Pseudospectra of the Orr–Sommerfeld Operator
• Functions of Matrices
• Deflation for block eigenvalues of block partitioned matrices with an application to matrix polynomials of commuting matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two global quasi-Newton algorithms for solving matrix polynomial equations