pith. sign in

arxiv: 1201.4188 · v2 · pith:RB5LFGGMnew · submitted 2012-01-19 · 🧮 math.NA

Reduced Collocation Methods: Reduced Basis Methods in the Collocation Framework

classification 🧮 math.NA
keywords reducedcollocationmethodbasisframeworkgalerkinmethodsapproach
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.