Parallel Multi-Step Spectral Indicator Methods for Nonlinear Eigenvalue Problems

We consider nonlinear eigenvalue problems to compute all eigenvalues in a specified region on the complex plane. Based on domain decomposition and contour integrals, two scalable parallel multi-step methods are proposed. The first method uses the spectral indicator method to find eigenvalues and calls a linear eigensolver to compute the associated eigenvectors. The second method divides the region into subregions and uses the spectral indicator method to decide candidate regions that contain eigenvalues, computes eigenvalues in each candidate subregion using Beyn’s method; and verifies each eigenvalue by substituting it back to the system and computes the smallest eigenvalue. Each step of the two methods is carried out in parallel. Both methods are robust, accurate, and do not require prior knowledge of the number and distribution of the eigenvalues in the region. Examples are presented to show the performance of the two methods.

Authors

Institutions

Publication Details

Journal
Communications in Mathematical Research
Published
2026-10-26
DOI
https://doi.org/10.4208/cmr.2026-0060
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

Parallel Multi-Step Spectral Indicator Methods for Nonlinear Eigenvalue Problems

Yingxia Xi, Jiguang Sun
Communications in Mathematical Research
Matrix Theory and Algorithms
article

Parallel Multi-Step Spectral Indicator Methods for Nonlinear Eigenvalue Problems

Yingxia Xi, Jiguang Sun
article en

Abstract

We consider nonlinear eigenvalue problems to compute all eigenvalues in a specified region on the complex plane. Based on domain decomposition and contour integrals, two scalable parallel multi-step methods are proposed. The first method uses the spectral indicator method to find eigenvalues and calls a linear eigensolver to compute the associated eigenvectors. The second method divides the region into subregions and uses the spectral indicator method to decide candidate regions that contain eigenvalues, computes eigenvalues in each candidate subregion using Beyn’s method; and verifies each eigenvalue by substituting it back to the system and computes the smallest eigenvalue. Each step of the two methods is carried out in parallel. Both methods are robust, accurate, and do not require prior knowledge of the number and distribution of the eigenvalues in the region. Examples are presented to show the performance of the two methods.

Communications in Mathematical Research
Michigan Technological University (US), Nanjing University of Science and Technology (CN)
Simons Foundation, National Natural Science Foundation of China, Fundamental Research Funds for the Central Universities
Openalex Percentile: Top 14%
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.

Laika access coming soon
Parallel Multi-Step Spectral Indicator Methods for Nonlinear Eigenvalue Problems — Yingxia Xi, Jiguang Sun · Communications in Mathematical Research (2026) | TGRS Research Map | TGRS