Least squares collocation solution of elliptic problems in general regions

V. Pereyra and G. Scherer

Mathematics and Computers in Simulation (MATCOM), 2006, vol. 73, issue 1, 226-230

Abstract: We consider the solution of elliptic problems in general regions by embedding and least squares approximation of overdetermined collocated tensor product of basis functions. The resulting least squares problem will generally be ill-conditioned or even singular, and thus, regularization techniques are required. Large scale problems are solved by either conjugate gradient type methods or by a block Gauss–Seidel approach. Numerical results are presented that show the viability of the new method.

Keywords: Least squares; Collocation; Elliptic (search for similar items in EconPapers)
Date: 2006
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037847540600173X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:73:y:2006:i:1:p:226-230

DOI: 10.1016/j.matcom.2006.06.022

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().