Collocation methods: More efficient procedures for applying collocation

doi:10.1016/j.advengsoft.2006.10.010

Return

Collocation methods: More efficient procedures for applying collocation

2007-10-01

PRE

Ismael Herrera *

Robert Yates

E. Rubio

DOI：10.1016/j.advengsoft.2006.10.010

Original

Original request for help

Save

Abstract

En 中文

In recent years, new and more effective procedures for applying collocation have been published. This article is devoted to present a revision of this Subject and complement its developments. From the general theory two broad approaches are derived, which yield the direct and the indirect TH-collocation methods. The former approach had not been published before, and it is a dual of the indirect approach. In particular. second order differential equations of elliptic type are considered and several orthogonal collocation algorithms are developed for them. In TH-collocation, the approximations on the internal boundary and in the subdomain interiors are completely independent. This yields clear computational advantages that are illustrated through the construction of such algorithms. In the implementations presented, three dimensional problems are included. In passing, single-point-collocation methods that have been the subject of several recent publications are revised. (c) 2006 Published by Elsevier Ltd.

Keywords:

collocation

orthogonal collocation

discontinuous galerkin

matrix condensation

elliptic equations