A non-conditional divergence criteria of Petrov-Galerkin method for bounded linear operator equation
Yidong Luo

TL;DR
This paper investigates the divergence behavior of Petrov-Galerkin methods for bounded linear operator equations when the right-hand side is outside the range of the operator, providing new theoretical insights and divergence criteria.
Contribution
It introduces a non-conditional divergence criterion for Petrov-Galerkin methods applicable to general bounded linear operators, including non-dense ranges.
Findings
Proves divergence of Petrov-Galerkin solutions when $b otin ext{Range}(A)$ for dense range operators.
Establishes a general divergence result for operators with non-dense range.
Demonstrates applications illustrating the divergence behavior in various scenarios.
Abstract
Petrov-Galerkin methods are always considered in numerical solutions of differential and integral equations . It is common to consider the convergence and error analysis when which make the equation solvable. However, the case when is always ignored. In this paper, we consider the numerical behavior of Petrov-Galerkin methods when . It is a natural guess that when , the corresponding approximate solution constructed by Petrov-Galerkin methods with arbitrary basis will diverge to infinity. We prove this conjecture for bounded linear operator equation with dense range and give a more general divergence result for bounded linear operator equation with not necessarily dense range . Several applications show its power.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical methods in inverse problems · Matrix Theory and Algorithms · Iterative Methods for Nonlinear Equations
