Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 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

Krylov solvability of unbounded inverse linear problems (2001.08127v2)

Published 22 Jan 2020 in math.NA, cs.NA, and math.FA

Abstract: The abstract issue of 'Krylov solvability' is extensively discussed for the inverse problem $Af = g$ where $A$ is a (possibly unbounded) linear operator on an infinite-dimensional Hilbert space, and $g$ is a datum in the range of $A$. The question consists of whether the solution $f$ can be approximated in the Hilbert norm by finite linear combinations of $g, Ag, A2 g, \dots$ , and whether solutions of this sort exist and are unique. After revisiting the known picture when $A$ is bounded, we study the general case of a densely defined and closed $A$. Intrinsic operator-theoretic mechanisms are identified that guarantee or prevent Krylov solvability, with new features arising due to the unboundedness. Such mechanisms are checked in the self-adjoint case, where Krylov solvability is also proved by conjugate-gradient-based techniques.

Citations (10)

Summary

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