Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 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

Galerkin approximation of holomorphic eigenvalue problems: weak T-coercivity and T-compatibility (1908.05029v1)

Published 14 Aug 2019 in math.NA, cs.NA, and math.SP

Abstract: We consider Galerkin approximations of holomorphic Fredholm operator eigenvalue problems for which the operator values don't have the structure "coercive+compact". In this case the regularity (in sense of [O. Karma, Numer. Funct. Anal. Optim. 17 (1996)]) of Galerkin approximations is not unconditionally satisfied and the question of convergence is delicate. We report a technique to prove regularity of approximations which is applicable to a wide range of eigenvalue problems. In particular, we introduce the concepts of weak T-coercivity and T-compatibility and prove that for weakly T-coercive operators, T-compatibility of Galerkin approximations implies their regularity. Our framework immediately improves the results of [T. Hohage, L. Nannen, BIT 55(1) (2015)], is immediately applicable to analyze approximations of eigenvalue problems related to [A.-S. Bonnet-Ben Dhia, C. Carvalho, P. Ciarlet, Num. Math. 138(4) (2018)] and is already applied in [G. Unger, preprint (2017)].

Citations (14)

Summary

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