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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Gradients of quotients and eigenvalue problems

Olavi Nevanlinna, Marko Huhtanen
1 citations
BIT Numerical Mathematics
Matrix Theory and Algorithms
1.50
article

Gradients of quotients and eigenvalue problems

Olavi Nevanlinna, Marko Huhtanen
article en
1 citations

Abstract

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.

BIT Numerical MathematicsVol. 65(2)
University of Oulu (FI), Aalto University (FI)
Oulun Yliopisto
Openalex Percentile: Top 17%
Matrix Theory and Algorithms
1.50
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.