Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
131 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Backward errors for multiple eigenpairs in structured and unstructured nonlinear eigenvalue problems (2405.06327v2)

Published 10 May 2024 in math.NA and cs.NA

Abstract: Given a nonlinear matrix-valued function $F(\lambda)$ and approximate eigenpairs $(\lambda_i, v_i)$, we discuss how to determine the smallest perturbation $\delta F$ such that $F + \delta F v_i = 0$; we call the distance between the $F$ and $F + \delta F$ the backward error for this set of approximate eigenpairs. We focus on the case where $F(\lambda)$ is given as a linear combination of scalar functions multiplying matrix coefficients $F_i$, and the perturbation is done on the matrix coefficients. We provide inexpensive upper bounds, and a way to accurately compute the backward error by means of direct computations or through Riemannian optimization. We also discuss how the backward error can be determined when the $F_i$ have particular structures (such as symmetry, sparsity, or low-rank), and the perturbations are required to preserve them. For special cases (such as for symmetric coefficients), explicit and inexpensive formulas to compute the $\delta F_i$ are also given.

Summary

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

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