A fast algorithm for solving the tensor product collocation equations
β Scribed by Weiwei Sun; N.G. Zamani
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 509 KB
- Volume
- 326
- Category
- Article
- ISSN
- 0016-0032
No coin nor oath required. For personal study only.
β¦ Synopsis
A fast algorithm is presentedfor solving the tensor product collocation equations (A, @ B,+B, @ A,)u = b, obtained from the discretization of the Poisson equation in a rectangular region by the collocation method. The Fast Fourier Transformation (FFT) algorithm is employed to achieve the above objective. The operation count is shown to be O(N* log, N) which makes the overall calculations very economical.
π SIMILAR VOLUMES
This paper presents efficient hypercube algorithms for solving triangular systems of linear equations by using various matrix partitioning and mapping schemes. Recently, several parallel algorithms have been developed for this problem. In these algorithms, the triangular solver is treated as the sec
The present paper reports on a modified pressure implicit predictor-corrector type scheme for solving the flow governing equations, in which a consistent formulation is combined with a multi-grid solver for the pressure correction. In addition a parabolic sublayer (PSL) approach for the treatment of
The solution of the unsteady incompressible Navier-Stokes on a collocated grid is investigated. A consistent formulation to construct the Laplacian in the pressure equation is developed. It is shown that within this framework, Laplacians with different characteristics can be constructed, which can b