首页 | 本学科首页   官方微博 | 高级检索  
     


A recursive formulation of Galerkin''s method in terms of the tau method: Bounded and unbounded domains
Authors:M.K. El-Daou  E.L. Ortiz
Affiliation:

Mathematics Department, Imperial College, London, England

Mathematics Department, Massachusetts Institute of Technology, Cambridge, MA 02139, U.S.A.

Abstract:The recursive formulation of the Tau Method (see [1,2]) is used to simulate the method of Galerkin. As a result of this, a new recursive formulation of Galerkin's Method is deduced. Furthermore, it is shown that the Galerkin's Method is a special form of a Tau Method with a weighted polynomial basis. Examples of application to the numerical approximation of linear and nonlinear partial differential equations, defined on bounded and unbounded domains, are also given.
Keywords:Nonlinear ordinary differential equations   Nonlinear partial differential equations   Unbounded domains   Tau Method   Galerkin's Method   Recursive computations
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号