Gradients of quotients and eigenvalue problems
Abstract Intertwining analysis, optimization, numerical analysis and algebra, computing conjugate co-gradients of real-valued quotients gives rise to eigenvalue problems. In the linear Hermitian case, by inspecting optimal quotients in terms of taking the conjugate co-gradient for their critical points, a generalized folded spectrum eigenvalue problem arises. Replacing the Euclidean norm in optimal quotients with the p -norm, a matrix version of the so-called p -Laplacian eigenvalue problem arises. Such nonlinear eigenvalue problems seem to be naturally classified as being a special case of homogeneous problems. Being a quite general class, tools are developed for recovering whether a given homogeneous eigenvalue problem is a gradient eigenvalue problem. It turns out to be a delicate issue to come up with a valid quotient. A notion of nonlinear Hermitian eigenvalue problem is suggested. Cauchy–Schwarz quotients are introduced to a have a way to approach non-gradient eigenvalue problems.
Authors
- Olavi Nevanlinna (ORCID: https://orcid.org/0000-0003-3602-0153)
- Marko Huhtanen (ORCID: https://orcid.org/0000-0001-7219-5896)
Institutions
- University of Oulu (FI)
- Aalto University (FI)
Publication Details
- Journal
- BIT Numerical Mathematics
- Published
- 2025-04-23
- DOI
- https://doi.org/10.1007/s10543-025-01064-x
- Citations
- 1
- Primary Topic
- Matrix Theory and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 1.50
Funders
- Oulun Yliopisto