When the s-stage fully implicit Runge}Kutta (RK) method is used to solve a system of n ordinary di!erential equations (ODE) the resulting algebraic system has a dimension ns. Its solution by Gauss elimination is expensive and requires 2sn/3 operations. In this paper we present an e$cient algorithm,
Explicit and implicit meshless methods for linear advection–diffusion-type partial differential equations
✍ Scribed by M. Zerroukat; K. Djidjeli; A. Charafi
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 293 KB
- Volume
- 48
- Category
- Article
- ISSN
- 0029-5981
No coin nor oath required. For personal study only.
✦ Synopsis
Simple, mesh=grid free, explicit and implicit numerical schemes for the solution of linear advection-di usion problems is developed and validated herein. Unlike the mesh or grid-based methods, these schemes use well distributed quasi-random points and approximate the solution using global radial basis functions. The schemes can be seen as generalized ÿnite di erences with random points instead of a regular grid system. This allows the computation of problems with complex-shaped boundaries in higher dimensions with no need for complex mesh=grid structure and with no extra implementation di culties.
📜 SIMILAR VOLUMES
Approximations where the derivatives are corrected so as to satisfy linear completeness on the derivatives are investigated. These techniques are used in particle methods and other mesh-free methods. The basic approximation is a Shepard interpolant which possesses only constant completeness. The der