A remark about Galerkin method
Nurlan Temirgaliyev

TL;DR
This paper proves that for any linear equation solved via Galerkin methods, there are at least as many unresolved right-hand sides as the dimension of certain finite-dimensional subspaces, highlighting limitations in the method.
Contribution
It establishes a fundamental lower bound on the number of unresolved right-hand sides in Galerkin methods for linear equations.
Findings
Existence of at least as many unresolved right-hand sides as five times the basis functions.
The lower bound applies to all linear versions of the Galerkin method.
Highlights limitations in the solvability of linear equations using Galerkin approaches.
Abstract
In this article was proved, that any linear equation in the case of any linear versions of the Galerkin method, has at least as many unsolved right-hand sides in the form of linear combinations , as there are finite-dimensional linear subspaces with dimensionality as much than five times as the number of basis functions .
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
TopicsMatrix Theory and Algorithms · Numerical methods for differential equations · Electromagnetic Scattering and Analysis
