2008
DOI: 10.1137/060664094
|View full text |Cite
|
Sign up to set email alerts
|

Logically Rectangular Grids and Finite Volume Methods for PDEs in Circular and Spherical Domains

Abstract: Abstract. We describe a class of logically rectangular quadrilateral and hexahedral grids for solving PDEs in circular and spherical domains, including grid mappings for the circle, the surface of the sphere and the three-dimensional ball. The grids are logically rectangular and the computational domain is a single Cartesian grid. Compared to alternative approaches based on a multiblock data structure or unstructured triangulations, this approach simplifies the implementation of numerical methods and the use o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
122
0

Year Published

2009
2009
2018
2018

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 92 publications
(123 citation statements)
references
References 46 publications
1
122
0
Order By: Relevance
“…These days many algorithms can be written in languages such as matlab in a way that is both easy for the reader to comprehend and also executable, with all details intact. For example, we make heavy use of this in the recent paper [15]. We present various grid mappings that define logically rectangular grids in smooth domains without corners, such as those shown later in Figure 1, and all of the matlab codes needed to describe the various mappings are short enough to fit naturally in the paper.…”
Section: Reproducible Researchmentioning
confidence: 99%
“…These days many algorithms can be written in languages such as matlab in a way that is both easy for the reader to comprehend and also executable, with all details intact. For example, we make heavy use of this in the recent paper [15]. We present various grid mappings that define logically rectangular grids in smooth domains without corners, such as those shown later in Figure 1, and all of the matlab codes needed to describe the various mappings are short enough to fit naturally in the paper.…”
Section: Reproducible Researchmentioning
confidence: 99%
“…In particular strongly differing cell sizes impose hard CFL conditions on the timestep (cf. [3]). The grids proposed in [3] also do not satisfy this condition.…”
Section: Triangulationmentioning
confidence: 99%
“…For the convergence analysis we need grids with the property that the curvature of the faces is uniformly bounded under mesh refinement and such that every point on the manifold lies only in a certain number of convex hulls of elements. In [3] different approaches to construct grids on spheres are treated and we refer to [10,18] for geodesic grids on a sphere, which are an important class of examples where these results hold.…”
Section: Introductionmentioning
confidence: 99%
“…bats-r-us, de . Logically rectangular grids (Calhoun, Helzel, and LeVeque, 2008), which permit the smooth inclusion of curved boundaries into an otherwise Cartesian grid geometry, harbor the potential to combine the advantages of Cartesian and spherical coordinate grids, but have until now not been used in any large-scale 3-D simulation with relevance to space physics. Another interesting approach is the use of multi-scale models (e.g.…”
Section: Numerical Mhd Propagation Modelsmentioning
confidence: 99%