AI & ML
Scaled Companion Linearizations for Coefficientwise Backward Stability
arXiv cs.NA0 views
arXiv:2610.20285v1 Announce Type: new Abstract: A central goal in solving a polynomial eigenvalue problem is to compute eigenpairs that are exact for a nearby polynomial, with each coefficient perturbation bounded by a modest multiple of unit roundoff times that coefficient's norm. A backward stable eigensolver for a linearization does not automatically provide this coefficientwise relative guarantee. Scaling can improve accuracy, but a single scaling may not work across a widely spread spectrum. We construct a family of scaled companion linearizations that covers the nonzero complex plane. Each linearization is paired with a region and an eigenvector recovery rule for which the backward-error amplification factor is bounded at exact pencil eigenvectors, independently of coefficient norm disparities. Tropical roots guide the construction, and their multiplicities reduce the number of required solves. These results provide a basis for coefficientwise relative backward stability across the spectrum.
Source:https://arxiv.org/abs/2610.20285PreviousWavelet compression for sampling deep Gaussian processesNextGeneralization of Strang-Fix remark for discrete maximum principles on tetrahedral meshes
Related posts

Behavioral Design Unpacked: Nudges, Funnels & Persuasion | UX Unpacked #3
0dev.to UX
National Grid buys Teesside land for UK largest substation to power AI data center
0dev.to News

Leonardo AI Alternative in 2026
0dev.to Discuss

This is my first HacktoberFest, and I don't know what to feel.
0dev.to Discuss

12% of the Economy: The Benchmark That Grades AI Agents Like Employees
0dev.to Machine Learning
A headline said the CMB killed huge black holes. I read the two papers.
0dev.to Career