1. Introduction
Spherical icosahedral grid is often used as the basic framework of atmospheric models, such as the ICosahedral Nonhydrostatic model (ICON) [
1,
2,
3], Models for Predication Across Scales (MPAS) [
4], the Non-hydrostatic ICosahedral Atmospheric Model (NICAM) [
5], DYNAMICO [
6], Ocean–Land–Atmosphere Model (OLAM) [
7,
8], etc. These models are wieldy used for polar lows simulation [
9], monsoon simulation [
10], ocean tides dissipation [
11], etc. Recently, the Spectral Radiation Transport Model for Aerosol Species coupled with NICAM (NICAM-SPRINTARS) [
12] has been developed for studying and simulating atmosphere-aerosols interactions and their effects on atmospheric pollution and climate change. Related studies include simulating the annual aerosol characteristics over China [
13], capturing the horizontal distribution of aerosol optical thickness fields [
14], studying the resolution dependency of the transport process of black carbon from Siberia to Japan [
15], and assimilating global aerosol vertical observations [
16], among others.
The accuracy of numerical simulations is affected by the quality of the spherical icosahedral grid [
17,
18,
19]. Low-quality grids may cause large numerical approximation errors. Some noises are leaded by slight irregularities of the grid, which the long-term simulation will become unstable [
20]. This is because nonuniform grids may bring grid imprinting in the numerical solutions and speed up their spread in meteorological models [
21,
22]. In this way, the nonuniformity of the control volume becomes the main source of numerical simulation error [
23]. For example, the non-orthogonality of the grid edge and its dual edge, and the non-coincidence of the midpoints of the two edges increases the truncation error of the spherical differential operators [
22,
23]. Grid misalignment also leads to errors in some low-order algorithms of the spherical surface [
19,
24], resulting in discretization of differential operators to only meet first-order convergence [
17]. The grid with good quality can reduce the truncation error of these operators on the sphere [
25].
At present, some grid optimization methods have been proposed to improve grid quality and to reduce the simulation errors [
26]. The spring dynamics method (i.e., the SPRing dynamics Grid optimization (SPRG) method) [
27,
28] is utilized to improve grid interval uniformity and to reduce geometric variations [
19]. Iga [
29] found that the interval distributions of grids near the icosahedron vertices, optimized by the SPRG method with a zero natural spring length (SPR0), are inversely proportional to the map factor of the Lambert conformal conic projection. An analytical transformation was proposed to stretch the grids near the icosahedral vertices to decrease grid aggregations [
30]. Heikes and Randall [
31,
32] (HR) have minimized the distances between the midpoints of hexagonal/pentagonal grids edges and their dual (triangles) edges to optimize grid. Then, they have re-optimized the grid (named tweaked grid [
33]) based on previous result to avoid the hemispheric twisting, where the grid quality and the convergence of PDE operators have been further improved. Spherical Centroidal Voronoi Tessellations (SCVT) [
34,
35,
36] has been put forward, in which grids’ centers were iteratively moved by Llyod’s method [
37] to their mass centroids to minimize the distances between these two points. Xu [
25] has updated iteratively grids based on the Laplace-Beltrami solution, and the optimization grid and SCVT grid are very close to each other.
Comparations have been done with the main optimization grids, such as HR grid, SCVT grid, SPRG grid, etc. for grid quality [
23,
33]. Some indicators, for instance the ratios between minimum and maximum grid area, the ratios between minimum and maximum grid intervals, the grid area ranges, grid interval ranges, area relative deviations, length relative deviations, etc. are used to evaluate grid quality. The grid interval ratio of SPRG grid is bigger than HR grid, that means SPRG grid’s interval uniformity is better than that of HR grid. However, its grid area ratio and grid interval ratio are all less than the non-optimized grid (NOPT grid). Its grid quality is limited by the spring constant. When the spring constant is large, some grids near the icosahedral vertices may collapse at high resolutions. When the constant is small, grids do not collapse, but some grids near the icosahedral vertices may aggregate, such that grid intervals are shortened and the amount of calculation is increased [
29]. The grid intervals by Iga [
29] only be increased along the stretch paths, decreasing the regularity of the grids near the icosahedral vertices. Although area uniformity of HR gird has been enhanced to the most extent, its grid interval ratio is slightly smaller than SPRG grid and NOPT grid. Among these grids, the quality of SCVT grid is the worst, its two ratios are divergent with the increasing grid resolution, and discretization accuracy of basic operator is also lowest. There is none of them being clearly better than the others [
19].
Tomita [
27] has implied that simulation error appears in regions with high gradient of grid area and interval deviations, and the smoothness is important for high-accuracy and stable simulation [
29]. The node interpolation can follow a second-order convergence on a uniform spherical grid, but if there is any deformation, it has only a first-order convergence [
38]. The grid uniformity is also important to determine the maximum time step for numerical integration [
20] and to maintain the consistency of physical parameterization in atmospheric simulations [
23]. Meanwhile, improvement of the uniformity is helpful for wavelet transform to improve the compression technique for weather and climate data [
39,
40]. The grid uniformity has been quantified from grid area and grid interval deviations in some reviews [
20,
23,
33]. The grid area uniformity and interval uniformity are not independent of each other. As the spherical surface is non-Euclidean, a well-defined grid with more than 12 points, meting the two attributes simultaneously, cannot be constructed on a sphere [
20]. However, the area uniformity and the interval uniformity of the spherical grid can be trade off to enhance extremely the overall grid uniformity and smoothness of the spherical distribution of the grid area and interval deviation.
The present study is devoted to the investigation of a novel grid overall uniformity and smoothness optimization approach rooted in the optimal transportation theory. The spherical cell decomposition method was introduced to iteratively update the grid to minimize the spherical transportation cost, achieving an optimization grid. We discuss the details of the proposed method and its effectiveness from the grid geometry quality and numerical accuracy. Unlike existing optimization approaches, the proposed method is optimal in that it does not only improve the grid overall uniformity but also reduce the grid deformation, enhancing the smoothness of grid deformation. Both the smoothness of deformation and uniformity of grid interval have been greatly improved. The smoothness of grid area deformation has also been heightened even the grid area uniformity is comparable to those obtained by the Heikes and Randall grid.
The rest of this paper is organized as follows: the optimal transportation theory, grid uniformity optimization method and the core algorithm are introduced in the Theory and Methods section. The Results and Discussions section presents the comparative results and discussions from the grid quality and numerical accuracy. The conclusions are shown in the last section.
2. Theory and Methods
Optimal transportation theory is used for the measure-preserving mapping between two probability measure spaces, such that the target probability measure is infinitely close to the source (or true) probability measure. In all measure-preserving mappings, a mapping minimizing the transportation cost is an optimal transportation mapping [
41]. Gu [
41] proposed a discrete spherical optimal transportation mapping based on a purely geometric method and defined the measures as areas to achieve an area-preserving mapping from the topological sphere to the unit sphere [
42,
43]. The mapping is global and has been applied in biomedicine [
44,
45], face recognition [
46], generative adversarial networks [
47], and other fields.
Given a continuous space
Rn, two subspaces with measures, (
X,
ψ) ∈
Rn and (
Y,
φ) ∈
Rn, having the same total measures, that is
, there is a measure-preserving mapping
T:
X →
Y to make
φ(
B) =
ψ(T
−1(
B)), where
B ⊂
Y, T
−1(B) ⊂
X. Then the transportation cost can be formalized as in Equation (1):
where
C:
X ×
Y →
R is a cost function of
T;
Topt = argmin{
C(
T)} is the optimal transportation mapping.
Spherical optimal transportation mapping realizes the area-preserving mapping from the topological sphere to the unit sphere. There is a probability measure
ψ in the continuous space defined on the unit sphere and a Dirac measure
φ = {
φ1,
φ2, …,
φnv} corresponding to the point set {
pi} ⊂ S
2, which cannot be covered by any hemisphere, such that
. A set of cells,
W = {
wi}, decomposing the unit sphere, that is
, can be found to make
φ(
wi) =
ψi. Then a mapping
T:
wi →
pi is the optimal transportation mapping minimizing the transportation cost. The existence and uniqueness of the complete solutions in the continuous space have been proved by Gu (2013). Surfaces can be discretized by triangular meshes. The discrete spherical optimal transportation mapping is an approximate preserved area mapping from a topological spherical triangular mesh to a spherical triangular mesh. A topological spherical triangular mesh is
M {
V,
E,
F}, with point set
V = {
v1,
v2, …,
vnv}, edge set
E = {
e1,
e2, …,
ene} and face set
F = {
f1,
f2, …,
fnf}. ∀
vi ∈
V, there is a set of first-order adjacent vertices
vadj = {
,
, …,
},
Ns is the number of first-order adjacent vertices. ∀
ψi ∈
ψ, it can be defined as one-third of total area of triangles formed by
vi and
vadj, its construction is illustrated in
Figure 1 and its formulization is defined in Equation (2),
where
S is the spherical area of ∆
vivjvj+1.
There is an optimal transportation mapping
T: (
M,
ψ) → (
N,
φ), such that
φi =
ψi and
C(
T) in Equation (3) is minimal, in which
N {
V*,
E,
F} is the image of
M,
φ is a measure set of
N.
Based on the point set V, a cell decomposition set W = {wi} can be constructed, where wi’s area is φi. When φi equals ψi, the transportation cost is minimal equal to zero. Updating the center of cell wi as obtains the image of the approximate preserved area mapping.
Cell decomposition on a sphere is a spherical power diagram generation. There is a point set
V = {
v1,
v2, …,
vnv} ∈ S
2 and its weight set
r = {
r1,
r2, …,
rnv} ∈ R,
ci(
vi,
ri) is a circle on a sphere with center
vi and radius
ri. Spherical power distance between any point
p ∉
V and
ci is defined in Equation (4):
where
d(∙) means the spherical great circle, pow(
p,
vi) is a geodesic distance between
p and tangent point, intersection of a line through
p tangent to circle and the circle, as shown in
Figure 2.
The spherical power diagram of {(
pi,
ri)} is a cell decomposition of sphere, that is
, where
wi = {
vi ∈
V | pow(
p,
vi) < pow(
p,
vj), ∀
vj ∈
V−{
vi}}. A spherical power diagram of a random point set is shown in
Figure 3.
Where the green circle is spherical circle of each point with center vi and radius ri, the red spherical polygon is spherical power cell of each point, and the blue spherical triangle is cell’s dual triangle.
It has been proved that the optimal transportation mapping can be achieved by adjusting the weight of the spherical power diagram. When the area of each power cell is equal the predefined weight, defined by the area measure, the optimal transportation mapping can be obtained. According to the spherical power diagram, the transportation cost can be defined as follows:
where
h is a function of radius,
h = −ln(cos(
r)),
φ is the power cell area.
The power cell area is an analytic function of radius [
42]. Let
q is a center point of line between
vi and
vj, there is pow (
q,
vi) = pow (
q,
vj) (
Figure 4), then:
Where Rl and Rk are triangle power radius of ∆vivjvk and ∆vivjvl.. dl and dk are vertical distances from the triangle center ol and ok to edge [vi, vj], respectively. γi and γj are the distances between vi and q, vj and q, respectively.
Let γ
i =
d(
q,
vi), γ
j =
d(
q,
vj), and γ
i + γ
j = γ
ij, there is:
According to the partial derivative of tanγ
j with respect to
hi, there is:
According to area of infinitesimal spherical quadrilateral,
= area(
wi ∩ ∆
vivjvl),
= area(
wi ∩ ∆
vivjvk),
φ is the power cell area. There is:
The convexity of the transportation cost has been proved by Gu (2013) and it can be minimized by means of Newton’s method. The gradient of cost can be defined as ∇C = (
φ(
w1) −
ψ1,
φ(
w2) −
ψ2, …,
φ(
wnv) −
ψnv), and the Hessian matrix can be expressed as follows:
For the spherical icosahedral grid, the measure-preserving mapping becomes a self-mapping. The measure is replaced by a virtual measure
ψvirtual, where
ψi_virtual = 4π
R2/
nv for any spherical icosahedral grid point;
R is the earth radius. There is a mapping
T: (
Ico-Grid,
ψvirtual) → (
AREA-Ico-Grid,
φ), where
Ico-Grid is composed of a grid point set
V = {
vi}, a grid edge set
E, a grid set
F and a grid point set of
AREA-Ico-Grid,
V* = {
} is the image of
V under the mapping
T, its grid edge set and grid set are the same as
Ico-Grid’s. When the areas of the grids by cell decomposition are equal to each other, that is
φ(
v*) =
ψvirtual(T
−1(
v*)),
v* ⸦
AREA-Ico-Grid,
T−1(
v*) ⸦
Ico-Grid,
T is the approximate area-preserved mapping. The Algorithm 1 of area quasi-uniformity optimization for the spherical icosahedral grid is described as follows.
Algorithm 1: Area Uniformity Optimization for the Spherical Icosahedral Grid |
Input: a spherical icosahedral grid Ico-Grid {V, E, F}, step λ, initial height vector h0, threshold δC |
Output: a spherical icosahedral grid with area quasi-uniformity AREA-Ico-Grid {V*, E, F} |
(1) Compute the virtual measure ψvirtual = {ψi_virtual}; |
(2) According to h0 and V, decompose the sphere into a cell set W = {wi}, and calculate each power cell area to get the original measure φ of Ico-Grid by, φ0 ← φ; |
(3) Calculate the transportation cost C between φ0 and ψvirtual by Equation (3). If C < δC, V* ← V and move to step 5. If not, move to the next step; |
(4) Update cell decomposition of S2 |
(4.1) Calculate gradient ∇C = (φ(w1) − ψ1, φ(w2) − ψ2, …, φ(wnv) − ψnv)T; |
(4.2) Compute the transportation cost C via ∇C. If C<δC, move to step 5. If not, move to step 4.3; |
(4.3) According to Equations (10)–(13), calculate a Hessian matrix H; |
(4.4) Establish the relationship between hessian matrix and gradient, that is Hδh = ∇C; |
(4.5) Update height vector, h = h + λδh; |
(4.6) Decompose the sphere into a new cell set W = {wi} based on h; compute cells’ area φW = {φwi}; |
(5) Compute the centers of cells in W, and obtain CW = {cwi}; |
(6) V* ← CW, and output result; |
(7) End. |
3. Results and Discussions
To verify the effectiveness of this algorithm, tests were performed to compare the grid quality and numerical accuracy among the proposed algorithm optimized grid (OURS grid), the non-optimized grid (NOPT grid), the spring dynamic method optimized grid (SPRG grid), tweaked grid optimized by Heikes and Randall grid (HR grid) Spherical Centroidal Voronoi Tessellations grid (SCVT grid) and grid optimized by Xu (XU grid). Here, the construction of the NOPT grid was through recursive division, and the parameter
β in the SPRG grid was set to 1.1 according to [
33]. All experiments were implemented in C++ and executed on a PC with Intel Core i5-6400
[email protected] GHz, 8 GB RAM.
3.1. The Grid Quality Evaluation
3.1.1. The Grid Area Uniformity
The relative area deviation
Darea was used to measure the grid area uniformity, which can be calculated with Equation (14):
where
A is the area of a grid;
Aavg is the average area of the spherical icosahedral grid; earth radius was set to 6, 371.007 km.
Maximum grid area
Amax and minimum grid area
Amin and average area
Aavg of NOPT grid and OURS grid at certain resolutions are listed in
Table 1.
The grid area was normalized according to Equation (15) to compare the differences at various resolutions.
The normalized minimum area
and maximum area
of different spherical icosahedral grids are listed in
Table 2, and their curves are illustrated in
Figure 5. Ratios between the minimum and maximum area,
rA =
Amin/
Amax, of different spherical icosahedral grids at different resolutions are presented in
Figure 6.
The maximum grid area, minimum grid area and their ratios indicate the ranges of grid area. The closer the ratio is to one, the smaller the area range is, which indicates a more uniform grid area. The normalized minimum and maximum areas of all grids except the SCVT grid and XU grid gradually have converged as the resolution increases (
Figure 5 and
Figure 6 and
Table 1 and
Table 2). The area range of SCVT grid and XU grid are the same and the biggest among all grids at level 9. The one of NOPT grid is followed and that of HR grid is the smallest. The range of OURS grid is only expanded by 1.20% compared with HR grid. Same as the range, ratios of SCVT grid and XU grid are non-convergence as resolution increases and have decreased to 0.554 and 0.555 at level 9, respectively. The ratios of SPRG grid and NOPT grid have converged slowly to 0.711 and 0.734, respectively. On the contrary, the ones of HR grid and OURS grid have increased as resolution increases and converged to 0.950 and 0.937, respectively at the same resolution.
To further emphasize the spherical distribution characteristic of grid area uniformity, taking the grid at level 9 as an example, the number of grids in different intervals of grid area relative deviation calculated by Equation (15) are counted in
Table 3.
Refine these intervals to further demonstrate the area features of OURS grid (
Table 4). Where,
N is the number of grids in different intervals, and
p is grid proportions.
The cumulative grid proportions of |
Darea| are depicted in
Table 5, and
Figure 7 (|
Darea| < 0.08%).
The
Darea of all grids are in [−38.0%, 22.0%] (
Table 3). The ones of HR grid and OURS grid are mainly in (−2.0%, 2.0%), which is smaller than other four grids. There are more than 90% grids with
Darea in (−0.06%, 0.06%) in OURS grid. The cumulative proportions have increased logarithmically as |
Darea| increases, in which the increasing rate of OURS grid is the fastest and that of NOPT grid is the slowest (
Figure 7). The cumulative proportions of OURS grid with |
Darea| of less than 0.044% is more than 90.00%, and the ones of other five grids are only 0.02% (NOPT grid), 0.62% (SPRG grid), 13.24% (HR grid), 0.37% (SCVT grid), and 1.25% (XU grid). Although the area ratio of HR grid is bigger than OURS grid, the proportion of grid with smaller is far less than that of OURS grid.
Meanwhile, the spherical distributions of the area relative deviations at level 9 are shown in
Figure 8, where the lighter the color is, the closer the grid area deviation is to zero.
From
Figure 8, the grids with maximum area deviation are the pentagons, and spherical distributions patterns of
Darea are symmetry. The distribution of NOPT grid has fractal characteristics and is not continuous. Because of the larger number of grids with larger
Darea, its distribution is shown by darker color. The distributions of the SPRG grid, SCVT grid and XU grid are similar. As the larger number of grids with smaller
Darea (−0.06%, 0.06%) in OURS grid, its distribution is shown by the lightest color and some grids with larger
Darea are mainly located along the triangular boundaries. Grids with larger
Darea are also located around these boundaries, however, these regions are far larger than that of OURS grid.
3.1.2. The Grid Interval Uniformity
The geodesic distance,
d, between grid points, the minimum distance,
dmin and the maximum distance
dmax (
Table 6), the ratios between them (
Table 7) and the grid length relative deviation (as Equation (16)) are calculated to describe the grid interval uniformity.
The grid distance was normalized according to Equation (17) to compare the differences at various resolutions (
Table 7 and
Figure 9).
Ratios between the minimum and maximum distances,
rd =
dmin/
dmax, of different grids at different resolutions are calculated in
Table 7 and presented in
Figure 10.
Same as the normalized area,
,
and ratios indicate the ranges of grid interval. The closer the ratio is to one, the smaller the interval range is, which indicates a more uniform grid interval. The
,
of the all grids except the SCVT grid and XU grid have gradually converged as the resolution increases (
Figure 9 and
Figure 10 and
Table 6 and
Table 7). The ratios of SCVT grid and XU grid are non-convergence as resolution increases, and ones of SPRG grid and HR grid have converged to 0.781 and 0.778 at level 9, respectively, the ratio of OURS grid is larger than them.
The number of grids in different intervals of grid length relative deviation have been counted (
Table 8) to emphasize the spherical distribution characteristic of grid interval uniformity.
There are the similar characteristics of HR and OURS grid from
Table 8, so the intervals is refined to further reveal their differences in
Table 9. Where,
N is the number of grids in different intervals, and
p is grid proportions.
The cumulative proportions of grid with |
Dlength| are depicted in
Table 10 and
Figure 11. Because of higher cumulative proportion in OURS grid in a smaller interval, only a part of results with |
Dlength| < 1.00% are demonstrated.
The
Dlength of all grids are in [−15%, 21%] (
Table 8), and the ones of HR grid and OURS grid are mainly in (−1%, 1%). The proportion of grid in this range of OURS grid is about 7 times that of NOPT grid, although the interval ratio of NOPT grid is bigger than that of OURS grid. The cumulative proportions also increase logarithmically as |
Dlength| increases, in which the increasing rate in OURS grid is the fastest and that of NOPT grid is the slowest. The cumulative proportions of OURS grid is more than 99.00% with |
Dlength| less than 0.50%. Ones of other grids are only 3.86% (NOPT grid) 17.36% (SPRG grid), 75.17% (HR grid), 21.64% (SCVT grid), and 20.47% (XU grid) in the same range.
Meanwhile, the spherical distributions of
Dlength are shown in
Figure 12 at level 9.
Same as spherical distribution of grid area, the grids with maximum Dlength are these pentagons, and distributions of all grids are symmetry. Near these pentagons, the lengths of grids are less than the average length and shown by darker color in all grids. The distribution of NOPT grid has fractal characteristics and is not continuous, too. The Dlength in the remaining grids are reduced from the pentagons to triangular centers. The grids with larger Dlength are mainly located along the triangular boundaries in OURS grid, and those grids are spread like pentagon or star from these pentagons.
3.2. The Numerical Accuracy Evaluation
Spherical Laplacian operators of scalar field (as Equation (18)) is discretized to evaluate numerical accuracy on different grids.
where
λ and
φ are the longitude and latitude of point on the sphere, respectively.
The
L2-norm error (as Equation (19)),
L∞-norm error (as Equation (20)) of discretization have been calculated (
Table 11 and
Table 12 and
Figure 13 and
Figure 14).
where
fana and
fnum are the analytical and numerical solutions of Laplacian operator, respectively.
The L2-norm errors and L∞-norm errors of all grids have been reduced as resolution increase, ones of OURS grid and HR grid are smaller than the others. The L∞-norm error (meaning the maximal error) of OURS grid has been reduced from 9.15 × 10−2 (NOPT grid), 2.57 × 10−2 (SPRG grid), 1.66 × 10−2 (HR grid), 3.87 × 10−2 (SCVT and XU grid) to 1.59 × 10−2 at level 8. The L2-norm error (meaning the RMS error) of OURS grid has been reduced from 4.52 × 10−4 (NOPT grid), 2.03 × 10−4 (SPRG grid), 6.05 × 10−5 (HR grid), 2.33 × 10−4 (SCVT and XU grid) to 5.86 × 10−4 at the same grid resolution, in which the enhancement of average accuracy is nearly 8 times that of NOPT grid and has more than 11.62% compared to the HR grid.
Meanwhile, the spherical distributions of the Laplacian operator error on different grids are shown in
Figure 15 at level 5.
Grids in NOPT grid with larger errors are mainly located the boundaries of refined icosahedral triangular cells, and that of all optimization grids are mainly located on the icosahedral triangular boundaries. In OURS grid, there are some fluctuations near icosahedral vertices and the middle part of boundaries, grids’ error in these regions are smaller than that of HR grid. In addition, the error range of OURS grid is the smallest among all grids, and it has been narrowed to 84.81% of NOPT grid and 12.00% of HR grid.
3.3. Discussion
The raw grid (non-optimized grid) has been optimized by the proposed method. The area quasi-uniformity can be achieved by minimizing the grid area deviation cost, which improve the smoothness of grid area deviation to some extent. Although the grid area range of OURS grid is comparable to those of Heikes and Randall grid, the deformations of grid area and intervals of OURS grid are smoother, which is conducive to error control in simulation. In addition, the maximum error and RMS error of discritization of Laplacian operator have been decreased and converged as the resolution increases.
The grid quality is one of the aspects affecting the simulation accuracy. There is no high gradient of grid area and interval deformation in the optimized grid by our method, which can be helpful to improve the accuracy of discritization of Laplacian operator. A more extensive analysis of Laplace operator in a diffusion problem and some numerical experiments in terms of the accuracy and the numerical efficiency will be carried out in the future.