Reduced Collocation Methods: Reduced Basis Methods in the Collocation Framework

Guardado en:

Detalles Bibliográficos
Publicado en:	arXiv.org (Aug 24, 2012), p. n/a
Autor principal:	Chen, Yanlai
Otros Autores:	Gottlieb, Sigal
Publicado:	Cornell University Library, arXiv.org
Materias:	Methods Algorithms Galerkin method Collocation methods
Acceso en línea:	Citation/Abstract Full text outside of ProQuest
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Descripción
Resumen:	In this paper, we present the first reduced basis method well-suited for the collocation framework. Two fundamentally different algorithms are presented: the so-called Least Squares Reduced Collocation Method (LSRCM) and Empirical Reduced Collocation Method (ERCM). This work provides a reduced basis strategy to practitioners who {prefer} a collocation, rather than Galerkin, approach. Furthermore, the empirical reduced collocation method eliminates a potentially costly online procedure that is needed for non-affine problems with Galerkin approach. Numerical results demonstrate the high efficiency and accuracy of the reduced collocation methods, which match or exceed that of the traditional reduced basis method in the Galerkin framework.
ISSN:	2331-8422
Fuente:	Engineering Database