A new numerical scheme is proposed for generating an orthogonal grid in a simply-connected \(2 D\) domain. The scheme is based on the idea of decomposition of a global orthogonal transform into consecutive mappings of a conformal mapping and an auxiliary orthogonal mapping. which was suggested by Ka
β¦ LIBER β¦
Iterative schemes and algorithms for adaptive grid generation in one dimension
β Scribed by Prabir Daripa
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 917 KB
- Volume
- 100
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A Non-iterative Scheme for Orthogonal Gr
β
H.J. Oh; I.S. Kang
π
Article
π
1994
π
Elsevier Science
π
English
β 596 KB
Finite Difference Schemes and Block Rayl
β
Jean-Luc Fattebert
π
Article
π
1999
π
Elsevier Science
π
English
β 148 KB
Multiresolution schemes for strongly deg
β
Raimund BΓΌrger; Alice Kozakevicius; Mauricio SepΓΊlveda
π
Article
π
2007
π
John Wiley and Sons
π
English
β 743 KB
A General-Purpose Finite-Volume Advectio
β
E.D. Dendy; N.T. Padial-Collins; W.B. VanderHeyden
π
Article
π
2002
π
Elsevier Science
π
English
β 428 KB
We present a new general-purpose advection scheme for unstructured meshes based on the use of a variation of the interface-tracking flux formulation recently put forward by O. Ubbink and R. I. Issa (J. Comput. Phys. 153, 26 (1999)), in combination with an extended version of the flux-limited advecti
A scheme for automatic generation of bou
β
Per Nielsen; Ove Skovgaard
π
Article
π
1990
π
John Wiley and Sons
π
English
β 632 KB
An implicit scheme for calculating time-
β
Timothy S Axelrod; Paul F Dubois; Clifford E Rhoades Jr.
π
Article
π
1984
π
Elsevier Science
π
English
β 862 KB