Papers › Backward errors for multiple eigenpairs in structured and unstructured nonlinear...
Backward errors for multiple eigenpairs in structured and unstructured nonlinear eigenvalue problems
Miryam Gnazzo, Leonardo Robol
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Given a nonlinear matrix-valued function F(λ) and approximate eigenpairs (λᵢ, vᵢ), we discuss how to determine the smallest perturbation δF such that [F + δF](λᵢ) vᵢ = 0; we call the distance between the F and F + δF the backward error for this set of approximate eigenpairs. We focus on the case where F(λ) is given as a linear combination of scalar functions multiplying matrix coefficients Fᵢ, and the perturbation is done on the matrix coefficients. We provide inexpensive upper bounds, and a way to accurately compute the backward error by means of direct computations or through Riemannian optimization. We also discuss how the backward error can be determined when the Fᵢ have particular structures (such as symmetry, sparsity, or low-rank), and the perturbations are required to preserve them. For special cases (such as for symmetric coefficients), explicit and inexpensive formulas to compute the δFᵢ are also given.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections