A non-conditional divergence criteria of Petrov-Galerkin method for bounded linear operator equation
Abstract
Petrov-Galerkin methods are always considered in numerical solutions of differential and integral equations Ax=b . It is common to consider the convergence and error analysis when b ∈ R(A) which make the equation solvable. However, the case when b R(A) is always ignored. In this paper, we consider the numerical behavior of Petrov-Galerkin methods when b R(A) . It is a natural guess that when b ∈ R(A) , 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 R(A) and give a more general divergence result for bounded linear operator equation with not necessarily dense range R(A) . Several applications show its power.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.