๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The generalized boundary element approach to Burgers' equation

โœ Scribed by Kazuhiko Kakuda; Nobuyoshi Tosaka


Publisher
John Wiley and Sons
Year
1990
Tongue
English
Weight
644 KB
Volume
29
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

โœฆ Synopsis


The generalized boundary element method is presented for the numerical solution of Burgers' equation. The new method is based on the set of boundary integral equations derived for each subdomain by using the fundamental solution for the linearized differential operator of the equation. The resulting system of quasinon-linear equations is solved implicitly with use of a simple iterative procedure. The adaptability and the accuracy of the proposed method are demonstrated by three examples and a comparison of the numerical results with the exact solution or other existing solutions is shown for the first example.


๐Ÿ“œ SIMILAR VOLUMES


A novel approach to Burgers' equation
โœ Xu, Mingtian ;Duan, Qi ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 79 KB
A new approach to Burger's equation
โœ G. Adomian ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 280 KB
Classification of Self Similar Solutions
โœ E. Soewono; L. Debnath ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 315 KB

A complete classification for the self-similar solutions to the generalized Burgers equation \[ u_{t}+u^{\beta} u_{x}=t^{N} u_{x x} \] of the form \(u(t, \eta)=A_{1} t^{-(1-N) / 2 \beta} F(\eta)\), where \(\eta=A_{2} x t^{-(1+N / 2}, A_{2}=1 / \sqrt{2 A}\), and \(A_{1}=\left(2 A_{2}\right)^{-1 / 6

Hermitian green element solutions of the
โœ Taigbenu, Akpofure E. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 108 KB ๐Ÿ‘ 2 views

Our earlier paper incorporated linear basis functions for the representation of the distribution of the primary variable (velocity) into a model of the Green element method (GEM) for the solution of Burgers' equation. GEM is an element-by-element numerical procedure of implementing the singular boun