Automatic elliptic grid generation by an approximate factorisation

  • Ly E
  • Norrison D
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

A procedure for automatic numerical generation of a structured grid system with coordinate lines coinciding with all boundaries of a general two-dimensional region containing a body of arbitrary shape is presented. The solution procedure incorporated the method of false transients and the approximate factorisation algorithm, where a sequence of time steps is cycled in a geometric fashion with repeated endpoints, and has a capability for clustering grid lines close to the body. The procedure requires significantly much less computational effort to obtain a converged solution than a point or line successive over-relaxation iterative scheme. Although, the superiority of the presented algorithm has been demonstrated for the grid generation problem , it can be utilised for other problems requiring the solution of a set of elliptic partial differential equations of similar nature. See

Cite

CITATION STYLE

APA

Ly, E., & Norrison, D. (2007). Automatic elliptic grid generation by an approximate factorisation. ANZIAM Journal, 49, 203. https://doi.org/10.21914/anziamj.v48i0.48

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free