Abstract

Abstract In this paper we study the conforming Galerkin approximation of the problem: find $u\in{{\mathcal{U}}}$ such that $a(u,v) = \langle L, v \rangle $ for all $v\in{{\mathcal{V}}}$, where ${{\mathcal{U}}}$ and ${{\mathcal{V}}}$ are Hilbert or Banach spaces, $a$ is a continuous bilinear or sesquilinear form and $L\in{{\mathcal{V}}}^{\prime}$ a given data. The approximate solution is sought in a finite-dimensional subspace of ${{\mathcal{U}}}$, and test functions are taken in a finite-dimensional subspace of ${{\mathcal{V}}}$. We provide a necessary and sufficient condition on the form $a$ for convergence of the Galerkin approximation, which is also equivalent to convergence of the Galerkin approximation for the adjoint problem. We also characterize the fact that ${{\mathcal{U}}}$ has a finite-dimensional Schauder decomposition in terms of properties related to the Galerkin approximation. In the case of Hilbert spaces we prove that the only bilinear or sesquilinear forms for which any Galerkin approximation converges (this property is called the universal Galerkin property) are the essentially coercive forms. In this case a generalization of the Aubin–Nitsche Theorem leads to optimal a priori estimates in terms of regularity properties of the right-hand side $L$, as shown by several applications. Finally, a section entitled ‘Supplement’ provides some consequences of our results for the approximation of saddle point problems.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.