A RECURSIVE FORMULATION OF GALERKINS METHOD IN TERMS OF THE TAU METHOD - BOUNDED AND UNBOUNDED-DOMAINS

Authors
ELDAOU MK ORTIZ EL
Citation
Mk. Eldaou et El. Ortiz, A RECURSIVE FORMULATION OF GALERKINS METHOD IN TERMS OF THE TAU METHOD - BOUNDED AND UNBOUNDED-DOMAINS, Computers & mathematics with applications, 35(12), 1998, pp. 83-94
Citations number
11
Categorie Soggetti
Mathematics,"Computer Science Interdisciplinary Applications",Mathematics,"Computer Science Interdisciplinary Applications
Journal title
Computers & mathematics with applications → ACNP
ISSN journal
08981221
Volume
35
Issue
12
Year of publication
1998
Pages
83 - 94
Database
ISI
SICI code
0898-1221(1998)35:12<83:ARFOGM>2.0.ZU;2-W
Abstract
The recursive formulation of the Tau Method (see [1,2]) is used to sim ulate the method of Galerkin. As a result of this, a new recursive for mulation of Galerkin's Method is deduced. Furthermore, it is shown tha t the Galerkin's Method is a special form of a Tau Method with a weigh ted polynomial basis. Examples of application to the numerical approxi mation of linear and nonlinear partial differential equations, defined on bounded and unbounded domains, are also given. (C) 1998 Elsevier S cience Ltd. All rights reserved.