Papers
Topics
Authors
Recent
2000 character limit reached

A parametric Keldysh decomposition

Published 4 Jan 2026 in math.NA and math.CV | (2601.01553v1)

Abstract: Contour integral algorithms seek to compute a small number of eigenvalues located within a bounded region of the complex plane. These methods can be applied to both linear and nonlinear matrix eigenvalue problems. In the latter case, the foundation of these methods comes from the Keldysh decomposition, which breaks the nonlinear matrix-valued function into two parts: a rational function whose poles match the desired eigenvalues, and a remainder term that is analytic within the target region. Under contour integration this analytic part vanishes (via Cauchy's theorem), leaving only the component containing the desired eigenvalues. We propose an extension of the Keldysh decomposition for matrix-valued functions that depend analytically on an additional parameter. We establish key properties of this parametric Keldysh decomposition, and introduce an algorithm for solving parametric nonlinear eigenvalue problems that is based upon it.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Paper to Video (Beta)

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.