Computational Investigations of Least - Squares Type Methods for the Approximate Solution of Boundary Value Problems * By Steven

Abstract

Several Galerkin schemes for approximate solution of linear elliptic boundary value problems are studied for such computational aspects as obtainable accuracy, sensitivity to parameters and conditioning of linear systems. Methods studied involve computing subspaces (e.g., splines) whose elements need not satisfy boundary conditions. A Poisson problem study… (More)

Topics

3 Figures and Tables

Cite this paper

@inproceedings{Serbin2010ComputationalIO, title={Computational Investigations of Least - Squares Type Methods for the Approximate Solution of Boundary Value Problems * By Steven}, author={Steven M. Serbin}, year={2010} }