Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 86 tok/s
Gemini 2.5 Pro 45 tok/s Pro
GPT-5 Medium 23 tok/s Pro
GPT-5 High 25 tok/s Pro
GPT-4o 111 tok/s Pro
Kimi K2 178 tok/s Pro
GPT OSS 120B 452 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

A Ritz method for solution of parametric generalized EVPs (2503.08465v1)

Published 11 Mar 2025 in math.NA and cs.NA

Abstract: This work deals with approximate solution of generalized eigenvalue problem with coefficient matrix that is an affine function of d-parameters. The coefficient matrix is assumed to be symmetric positive definite and spectrally equivalent to an average matrix for all parameters in a given set. We develop a Ritz method for rapidly approximating the eigenvalues on the spectral interval of interest $(0,\Lambda)$ for given parameter value. The Ritz subspace is the same for all parameters and it is designed based on the observation that any eigenvector can be split into two components. The first component belongs to a subspace spanned by some eigenvectors of the average matrix. The second component is defined by a correction operator that is a d + 1 dimensional analytic function. We use this structure and build our Ritz subspace from eigenvectors of the average matrix and samples of the correction operator. The samples are evaluated at interpolation points related to a sparse polynomial interpolation method. We show that the resulting Ritz subspace can approximate eigenvectors of the original problem related to the spectral interval of interest with the same accuracy as the sparse polynomial interpolation approximates the correction operator. Bound for Ritz eigenvalue error follows from this and known results. Theoretical results are illustrated by numerical examples. The advantage of our approach is that the analysis treats multiple eigenvalues and eigenvalue crossings that typically have posed technical challenges in similar works.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

Summary

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

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

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

X Twitter Logo Streamline Icon: https://streamlinehq.com