Two-step inexact Newton-like method for solving generalized inverse eigenvalue problems

In this paper, based on two-step Newton iterative procedure, we propose a two-step inexact Newton-like method for generalized inverse eigenvalue problems. Under some mild assumptions, our results show that the two-step inexact Newton-like method is super quadratically convergent. Numerical implementations demonstrate the effectiveness of the new method.

Authors

Institutions

Publication Details

Journal
Results in Applied Mathematics
Published
2025-05-01
DOI
https://doi.org/10.1016/j.rinam.2025.100579
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Two-step inexact Newton-like method for solving generalized inverse eigenvalue problems

Wei Ma, Liuqing Hua
Results in Applied Mathematics
Matrix Theory and Algorithms
article

Two-step inexact Newton-like method for solving generalized inverse eigenvalue problems

Wei Ma, Liuqing Hua
article en

Abstract

In this paper, based on two-step Newton iterative procedure, we propose a two-step inexact Newton-like method for generalized inverse eigenvalue problems. Under some mild assumptions, our results show that the two-step inexact Newton-like method is super quadratically convergent. Numerical implementations demonstrate the effectiveness of the new method.

Results in Applied MathematicsVol. 26
Nanyang Normal University (CN)
National Natural Science Foundation of China, Nanyang Normal University
Openalex Percentile: Top 89%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.