Issue 
A&A
Volume 599, March 2017



Article Number  A118  
Number of page(s)  12  
Section  Numerical methods and codes  
DOI  https://doi.org/10.1051/00046361/201630237  
Published online  10 March 2017 
Numerical nonLTE 3D radiative transfer using a multigrid method
Institute for Solar Physics, Department of Astronomy, Stockholm University, AlbaNova University Centre, 106 91 Stockholm, Sweden
email: johan.bjorgen@astro.su.se
Received: 13 December 2016
Accepted: 4 January 2017
Context. 3D nonLTE radiative transfer problems are computationally demanding, and this sets limits on the size of the problems that can be solved. So far, multilevel accelerated lambda iteration (MALI) has been the method of choice to perform highresolution computations in multidimensional problems. The disadvantage of MALI is that its computing time scales as O(n^{2}), with n the number of grid points. When the grid becomes finer, the computational cost increases quadratically.
Aims. We aim to develop a 3D nonLTE radiative transfer code that is more efficient than MALI.
Methods. We implement a nonlinear multigrid, fast approximation storage scheme, into the existing Multi3D radiative transfer code. We verify our multigrid implementation by comparing with MALI computations. We show that multigrid can be employed in realistic problems with snapshots from 3D radiative magnetohydrodynamics (MHD) simulations as input atmospheres.
Results. With multigrid, we obtain a factor 3.3–4.5 speedup compared to MALI. With fullmultigrid, the speedup increases to a factor 6. The speedup is expected to increase for input atmospheres with more grid points and finer grid spacing.
Conclusions. Solving 3D nonLTE radiative transfer problems using nonlinear multigrid methods can be applied to realistic atmospheres with a substantial increase in speed.
Key words: radiative transfer / Sun: chromosphere / methods: numerical
© ESO, 2017
1. Introduction
Most of our understanding of astrophysical objects comes from analyzing their spectra. The comparison of models of those objects to observations therefore requires solving the radiative transfer (RT) problem with the model as input. In this paper, we investigate a nonlinear multigrid method for solving the threedimensional (3D) nonlocal thermodynamical equilibrium (LTE) RT problem in cool stellar atmospheres, and specifically, the solar atmosphere.
Onedimensional (1D) nonLTE radiative transfer has been possible for many decades. More recently, multidimensional radiative transfer has become possible. Now that 3D radiation magnetohydrodynamics (MHD) simulations of solar and stellar atmospheres are widely used (Asplund et al. 2003, 2004; Uitenbroek 2006; Trujillo Bueno & Shchukina 2007; Pereira et al. 2009; Holzreuter & Solanki 2013; de la Cruz Rodríguez et al. 2013; Pereira et al. 2015; Rathore & Carlsson 2015; Amarsi et al. 2016), it has become important to have efficient 3D nonLTE radiative transfer methods to compare these models with observations.
In the solar chromosphere, full 3D RT is important for strongly scattering lines (e.g. Leenaarts et al. 2009, 2012, 2013a; Štěpán et al. 2015; Sukhorukov & Leenaarts 2017). The next solar generation telescopes, such as the 4m DKIST, will obtain a diffraction limit of 0.03′′ at 500 nm, corresponding to 32 km on the Sun. To be able to compare these highresolution observations with MHD simulations, 3D radiative transfer is needed even for much weaker photospheric lines (Holzreuter & Solanki 2015; Judge et al. 2015). Some important chromospheric diagnostic lines are influenced by partial redistribution effects, such as Lymanα, Mg ii h&k, and Ca ii H&K. These effects have been included in a 3D RT code (Sukhorukov & Leenaarts 2017), but at the cost of an increase in computational time up to a factor 10. We therefore need a robust method that can solve the 3D nonLTE problem more efficiently than currently possible.
It is well known that Λiteration converges prohibitively slowly in optically thick nonLTE problems. Accelerated Λiteration (ALI, Cannon 1973) converges much faster when using an approximate Λoperator. For 3D, one typically uses the diagonal of Λoperator as the approximate operator (this choice is also known as Jacobi iteration), because it can easily be constructed without the need of computationally expensive matrix inversions. Other methods exists: GaussSeidel (GS) iteration (Trujillo Bueno & Fabiani Bendicho 1995; Trujillo Bueno & Manso Sainz 1999) converges four times as fast as the diagonal operator, but cannot be parallelized as efficiently as Jacobi iteration (Tsitsiklis et al. 1988), a serious disadvantage in parallel solvers that are used for 3D applications. Conjugate gradient methods are under development, but have not yet been implemented in a general 3D nonLTE RT code (Paletou & Anterrieu 2009).
Therefore, multilevel accelerated lambda iteration (MALI; Rybicki & Hummer 1991, 1992) with a diagonal approximate operator remains the current standard for 3D nonLTE radiative transfer problems for solar applications (Uitenbroek 2001; Leenaarts & Carlsson 2009; Štěpán & Trujillo Bueno 2013).
The disadvantage with MALI is that the convergence slows down as the grid spacing gets finer (Olson et al. 1986). A solution to this problem was proposed by Steiner (1991), who implemented a linear multigrid method for twolevel atoms with coherent scattering in 1D and twodimensional (2D) test atmospheres and found a speedup of a factor 4 to 40. The idea behind multigrid methods is that Jacobi and GaussSeidel iteration quickly smooth out the highspatialfrequency error in the solution, but decrease the lowfrequency error only slowly. After a few iterations, the error will therefore be smooth (i.e., contain only low frequencies). The problem can therefore be transferred to a coarser grid, where the lowspatialfrequency errors become higherfrequency errors. Iterations on the coarse grid quickly decrease these errors. A correction to the finegrid solution is computed on the coarse grid, and interpolated up onto the fine grid, which now has a much smaller lowfrequency error.
This method was expanded by Vath (1994), who applied it to a 3D problem with a smooth atmosphere. He showed that the method works, but does not provide a large speedup on small domains in parallel setup. Fabiani Bendicho et al. (1997) combined the nonlinear multigrid technique with a multilevel GaussSeidel iteration scheme (MUGA). The smoothing properties of MUGA do not deteriorate with increasing grid resolution, which makes it an excellent choice to use with multigrid. They found a speedup of a factor 3 to 32 with a fivelevel Ca ii atom and a 2D atmosphere that was isothermal in the vertical direction and contained a weak temperature inhomogeneity in the horizontal direction (see Auer et al. 1994, Eq. (18)). Léger et al. (2007) compared the performance of multigrid against GaussSeidel iteration with successive overrelaxation in smooth 2D prominence models. Štěpán & Trujillo Bueno (2013) proved that multigrid works in full 3D nonLTE with a MALI operator and parallel implementation using spatialdomain decomposition. They used a planeparallel semiempirical FAL model C atmosphere Fontenla et al. (1993) with a sinusoidal horizontal inhomogeneity in temperature with an amplitude of 500 K.
All previous studies used relatively smooth model atmospheres. So far, no one has applied nonlinear multigrid to “reallife” atmospheres produced by radiationMHD simulations, which are highly inhomogeneous in all atmospheric quantities. This paper presents a nonlinear multigrid method that can handle such atmospheres.
In Sects. 2 and 3, we describe the method and our computational setup. In Sect. 4, we present numerical considerations for the 3D radiative transfer with multigrid. In Sect. 5, we present the speedup we obtain compared to regular MALI iteration. Section 6 contains our conclusions.
2. Method
2.1. The nonLTE radiative transfer problem
The timeindependent nonLTE radiative transfer problem consists of solving the transport equation (1)with I_{ν} the intensity, τ_{ν} the optical path along a ray, S_{ν} the source function, and n_{i} the atomic level populations, together with the equations of statistical equilibrium for the level populations: (2)with P_{ij} the sum of the radiative and collisional rates. We wrote the dependencies of τ_{ν} and S_{ν} on the level populations and P_{ij} on the intensity explicitly to emphasize the nonlinearity of the problem. The radiation field couples various grid points together, making the problem also nonlocal. We assume, in this paper, that the collisional terms and the background opacity and emissivity are constant and fully determined by the input atmosphere.
To close the system, we replace one of the rate equations at each grid point with a particle conservation equation: (3)The statistical equilibrium equation must be solved at all grid points, and the transfer equation must be solved at all grid points for all frequencies and ray propagation directions. The combination of the equations can be written as a coupled system of nonlinear equations: (4)We note that these are n_{levels}n_{gridpoints} equations that, in principle, depend on all n_{levels}n_{gridpoints} level populations.
For a given grid point, if we replace the first rate equation with particle conservation, f looks like: (5)In the MALI scheme, these equations are preconditioned and solved by iteration (Rybicki & Hummer 1991, 1992).
2.2. The nonlinear multigrid method
In this subsection, we present how the nonlinear multigrid method is applied to the radiative transfer problem, that is, how it is used to solve Eq. (4).
The nonlinear multigrid, fast approximation storage (FAS) scheme as formulated by Brandt (1977), preserves the mathematical structure of at the coarser grids. For nonLTE codes, this means that one can reuse the formal solver, computation of collisional rates, and so on, and that the iterative MALI method can be used on the coarser grids with only minor modifications.
We restate the rate equation: (6)where k is an index that denotes the grid level: k = ℓ,ℓ−1,...,1 where ℓ is the number of grids, with k = ℓ the finest grid and k = 1 the coarsest grid. We provide an initial estimate for n and perform a number (ν_{1}) MALI iterations, which is called presmoothing. Because MALI iterations act as a smoothing operator, we have reduced the highfrequency error and obtained a smooth residual r^{k}: (7)The ∗, denotes that an extra formal solution has been performed to get the radiative rates consistent with the current population estimate.
The exact solution can be described by adding a correction to the approximation: . The exact fine grid equation is then: (8)Using the residual equation (Eq. (7)), the fine grid equation (Eq. (8)) may be written as (9)All these quantities can be mapped to a coarser grid k−1 using a restriction operator . We point out that we assume that only the residual is smooth and not the populations themselves. The populations from the fine grid are used as an initial approximation at the coarse grid. The coarse grid operator is obtained by performing a formal solution at the coarse grid. This results in the coarsegrid equation: (10)The righthand side tries to force the solution of the system to maintain the finegrid accuracy. The coarsegrid equation does not need to be solved exactly, since it is limited by the accuracy of the righthand side. Instead, we compute an approximate solution by applying a number ν_{3} MALI iterations, called coarsegrid iterations. The relative correction (see Sect. 4.6) is then computed by: (11)where the subscripts before and after denote the populations before and after the ν_{3} MALI iterations.
The correction is mapped onto the operator to the finer grid with an interpolation operator : (12)The interpolation introduces highfrequency errors on the fine grid. By applying ν_{2} MALI iterations on the fine grid (called postsmoothing), these highfrequency errors are removed, and we have obtained a better approximation to the true solution on the finest grid. To obtain a converged solution, multiple cycles have to be performed.
The method we just described is called twogrid FAS. The same procedure can be applied to Eq. (10) because it has the same structure as Eq. (4). Doing this leads to the general multigrid procedure. The successive coarsening starting from the finest grid and the interpolation steps from the coarsest to the finest grid together are called a Vcycle.
Fig. 1 Schematic representation of Vcycle and full multigrid with three grid levels. ⇒ means interpolating the full approximation, → means restricting the approximation and the residual, and ⇢ means interpolating the correction. The iteration parameters ν_{FMG} and ν_{1,2,3} are defined in Sect. 2, the parameter ν_{0} in Sect. 4.12. 

Open with DEXTER 
Fig. 2 Behavior of the relative error in population at the finest grid during various steps in a Vcycle with three grids, for the FALC atmosphere (lefthand panels) and a column extracted from a 3D radiationMHD atmosphere (atmosphere Model 1, see Sect. 3). Both computations are done for a H i atom using 10 presmoothings, 32 coarsegrid iterations and 25 postsmoothings. Upper panel: temperature and electron density in the atmosphere. Lower panels: error for the H in = 2 level after the presmoothing (red), the error after application of the coarsegrid correction (blue), and the error after application of the postsmoothing (purple). For both atmospheres the coarse grid correction has decreased the low spatialfrequency error, but increased the highfrequency error. The latter is largely removed by the postsmoothing. 

Open with DEXTER 
2.3. Full multigrid
Full multigrid (FMG) can be seen as a method for obtaining a better initial approximation at the finest level. FMG is considered to be the optimal multigrid solver (Trottenberg et al. 2000). We explain FMG using a threegrid (ℓ = 3) example, as illustrated in Fig. 1. In FMG, Eq. (4) is solved at the coarsest grid: (13)The initial population and the righthand side can be obtained by restricting it from the finest grid or direct initialization at the k = 1 grid. After applying ν_{FMG} iterations, an initial approximation is acquired at the coarsest level. The full approximation is then interpolated up to the next finer grid k = 2: (14)The new approximation is used as the initial population for solving Eq. (4) at the k = 2 grid. Now, a Vcycle is applied at this level, instead of interpolating up to the finest grid k = 3. The reason for this is that the approximation at k = 2 will have both lowfrequency and highfrequency errors due to the interpolation and discretization errors. These errors are efficiently reduced by a Vcycle. When the Vcycle is completed, we interpolate the population at k = 2 to the finest grid k = 3. Now we have an initial approximation at k = 3 that is closer to the true solution than a straight initialization at grid k = 3.
We reiterate that we are not aiming to get the full solution for the radiative transfer problem, but rather a better initial approximation at the finest grid. After reaching the finest level, the FMG is followed by regular FAS Vcycles to obtain the solution.
In Fig. 1, we show a schematic representation of the FAS and fullmultigrid algorithms. Figure 2 shows an illustration of the behavior of the relative error in a smooth semiempirical atmosphere and a nonsmooth column from a radiationMHD simulation, but with otherwise identical setup. Comparing the two cases shows that the radiationMHD simulation column shows much more highfrequency error after the coarse grid correction than in FALC. These highfrequency errors stem from the inevitable inability to accurately represent a nonsmooth atmosphere on a much coarser grid. We show in this paper that multigrid can still handle such atmospheres, but at the cost of an increase in computational time and thus a smaller increase in computational speed compared to MALI than reported in earlier works for smooth atmospheres.
3. Computational setup
We implemented the FAS multigrid method including FMG into the existing radiative transfer code Multi3D (Leenaarts & Carlsson 2009). This code solves the statistical equilibrium equations for one atomic species with a background continuum using MALI with a diagonal approximate operator (Rybicki & Hummer 1991, 1992). The code used 3D atmospheres on a Cartesian grid as input. It is parallelized with Message Passing Interface (MPI) using spatial domain decomposition as well as decomposition over frequency. The atomic boundbound transitions can be treated in complete or partial redistribution (Sukhorukov & Leenaarts 2017). The transport equation is solved using shortcharacteristic (Kunasz & Auer 1988) with a linear or Hermitespline (Auer 2003; Ibgui et al. 2013) interpolation scheme. We use the 24angle quadrature (A4 set) from Carlson et al. (1963). All computations presented in this paper are done assuming complete redistribution and without frequency parallelization.
3.1. Model atmospheres
We use three different model atmospheres in this paper.
The first is a snapshot from the radiationMHD simulation by Carlsson et al. (2016) computed with the Bifrost code (Gudiksen et al. 2011) taken at t = 3850 s.
This model extends from the upper convection zone to the corona in a box with 504 × 504 × 496 grid points, with a horizontal grid spacing of 48 km, and a vertical grid spacing ranging from 19 to 100 km. The model contains strong gradients in temperature, velocity, and density and has been used before in several studies (e.g. de la Cruz Rodríguez et al. 2013; Leenaarts et al. 2013a,b; Štěpán et al. 2015; Pereira et al. 2015; Loukitcheva et al. 2015; Rathore & Carlsson 2015; Rathore et al. 2015). We used this model to see how multigrid behaves in a realisticuse case. To obtain an odd number of grid points in the vertical direction (see Sect. 4.3), we added one extra layer in the convection zone through linear extrapolation of all quantities, so we obtain 504 × 504 × 497 grid points. This MHD snapshot will be called atmosphere Model 1.
We also use a Bifrost simulation snapshot with 768 × 768 × 768 grid points (Carlsson & Hansteen, priv. comm.). In this snapshot, the x and yaxis are equidistant with a grid spacing of 32 km. The vertical axis is nonequidistant, with a grid spacing of 13 km in the photosphere and the chromosphere, and increasing to 60 km in the convection zone and the corona. The physical extent is the same as for Model 1: 24 Mm × 24 Mm × 16.9 Mm. We only used the part of the atmosphere between z_{min} = −0.5 Mm and z_{max} = 6 Mm to cover the formation height of the Ca ii lines. The grid size is therefore reduced to 768 × 768 × 473. This simulation has a similar magnetic field configuration as Model 1, but was computed with an LTE equation of state instead of the nonequilibrium equation of state of Model 1. This atmosphere will be called Model 2. Finally, we also use some computations using the planeparallel semiempirical FAL model C atmosphere (Fontenla et al. 1993), which we will refer to as FALC.
3.2. Model atoms
We use three different model atoms. Most test computations were done with a minimalistic threelevel Ca ii atom, containing the ground level, the upper level of the Ca ii K line, and the Ca iii ground state. We also use the sixlevel Ca ii atom and the sixlevel hydrogen atom from Carlsson & Leenaarts (2012). All boundbound transitions are treated in complete redistribution.
3.3. Convergence criteria and error estimates
To validate and compare our multigrid implementation with the standard onegrid MALI scheme, we compare with reference solutions computed using the onegrid MALI scheme. With the threelevel Ca ii atom, we converged the reference solution to maxδn/n ≤ 10^{5}. For the hydrogen atom, we converged to maxδn/n ≤ 10^{4}. The reason for the lower criterium for hydrogen was to limit computational expenses: to reach the limit for hydrogen, we needed approximately 300 000 CPU hours.
To characterize the absolute error after i iterations, we used the infinity norm: (15)where the n_{∞} populations are taken to be the reference solutions. Since one grid point can slow down or stall the convergence with multigrid, the infinitynorm is the best choice. Other norms, such as the 2norm, can give a false picture of the convergence of the multigrid method.
The maximum relative correction in population during each iteration is given by (16)For linear nonLTE radiative transfer problems, one can define the spectral radius as the largest eigenvalue of the amplification matrix of the iteration scheme. However, in the nonlinear case, this is not possible. Therefore we define the spectral radius operationally as (17)It measures how much the error is reduced for each iteration.
For normal use cases, there is no reference solution, so the error cannot be computed directly. For MALI iterations, it was shown (Auer et al. 1994; Fabiani Bendicho et al. 1997) that one can use the maximum relative correction to estimate the error. When the relative correction reaches the asymptotic linear regime, the relation between the error, the spectral radius, and the relative correction is: (18)Because there is no reference solution, the spectral radius is estimated using ρ_{sr} ≈ C_{i + 1}/C_{i}. We test whether this approximation is also valid for multigrid iteration in Sect. 4.13.
4. Numerical considerations
In the following subsections, we discuss a number of issues that are relevant for radiative transfer using multigrid methods.
4.1. Grid coarsening
We use a simple coarsening strategy for the grid coordinates, by removing every second grid point along the x, y, and z axes when coarsening from grid k to k−1.
4.2. Grid sizes
In the vertical direction, we use fixed nonperiodic boundaries. In the lower boundary, the incoming radiation is set to the Planck function at the local gas temperature. In the upper boundary, the incoming radiation is set to zero or to prespecified values. We chose to keep the vertical boundaries at fixed heights. To obtain this, we require an odd number of grid points in the vertical direction at all grid levels. Therefore, the number of vertical grid points N_{Z} at the finest level must fulfil the following relation: (19)where A is an integer and ℓ the number of grids.
In the horizontal plane, we use periodic boundary conditions. Because Multi3D requires constant grid spacing in the horizontal direction, we thus require that N_{x,y}, the number of grid points in the x or y direction, follows (20)with B an integer.
4.3. Subdomain sizes and number of grids
Fig. 3 Convergence behavior for MALI (red) and multigrid with three (blue) and four (purple) grids for the threelevel Ca ii atom within atmosphere Model 1. The computing time is expressed in units of the time it takes to perform one MALI iteration at the finest grid. The multigrid computations were performed with ν_{1} = 2, ν_{2} = 2, ν_{3} = 32, fullweighting restriction and trilinear interpolation. 

Open with DEXTER 
Multi3D divides the computational domain into subdomains. The formal solver requires five ghost zones in the horizontal directions, and the number of internal points in the horizontal direction must be at least as large as the number of ghost zones. In the vertical direction, we have only one ghost zone. In singlegrid applications, the subdomains have typical sizes from 32^{3} to 64^{3}. In multigrid, we use the same domain decomposition as in the finest grid, and coarsen the grid local to each subdomain. This limits the number of coarsenings that we can do. For a 32^{3} subdomain, we can achieve two coarsenings to 16^{3} and 8^{3}. A 64^{3} subdomain can be coarsened three times. Through various tests we found that three grids gives us the best and stable performance. Using more than three grids can lead to nonconvergence or lower performance than when using three grids (see also Table 1 of Steiner 1991). In Fig. 3, we display the result of such a test for the threelevel Ca ii atom and atmosphere Model 1.
4.4. Restriction operator
Fig. 4 Convergence behavior for MALI (red) and multigrid with injection (purple) and fullweighting (blue) as restriction operators, using the threelevel Ca ii atom and atmosphere Model 1. The multigrid computation was performed with ν_{1} = 2, ν_{2} = 2, ν_{3} = 32, three grids and trilinear interpolation. 

Open with DEXTER 
We implemented three different restriction operators: injection, halfweighting, and fullweighting (e.g., Trottenberg et al. 2000). Injection is the most straightforward method, as it only removes grid points when moving a quantity from a fine to a coarse grid. Halfweighting is a smoothing operation, where a coarse grid point value is an average of the same point plus its six neighboring grid points located along the x, y, and z axes on the fine grid. Fullweighting is similar, but includes all 26 neighbor grid points. Fullweighting has the advantage that it conserves a quantity when it is integrated over the entire computational domain. Injection is computationally more efficient than the half and fullweighting methods, but the extra computing time is negligible compared to the time spent on the formal solution.
We performed various tests using both the FALC and Model 1 atmospheres. We found that injection performs well for the FALC atmosphere, but not for Model 1. Figure 4 shows a comparison between singlegrid MALI, threegrid injection, and threegrid fullweighting using the threelevel Ca ii atom in Model 1. The convergence of multigrid using injection stalls around E_{∞} = 0.03, while the fullweighting computation converges to the reference solution. We therefore chose to use fullweighting for the atomic level populations and residuals for all further computations.
4.5. Interpolation operator
We implemented two interpolation operators: linear and cubic Hermite (Auer 2003; Ibgui et al. 2013). The coefficients for linear interpolation depend only on the grid spacing and can be precomputed. A full 3D interpolation uses information from the eight surrounding grid points. Cubic Hermite interpolation needs a 4 × 4 × 4 stencil for a 3D interpolation and requires the computation of the derivatives of the quantity to be interpolated on the inner eight grid points. This makes cubic Hermite interpolation somewhat more involved to implement and more computationally expensive. We performed a number of 1D test calculations using columns from Model 1 and found that, on average, both interpolation methods perform equally well. We therefore chose to use the simpler and faster linear interpolation for our 3D computations.
4.6. Correction
The radiative transfer problem is highly nonlinear, and a level population can, in principle, change by orders of magnitude from one grid point to the next. This poses a problem for the interpolation of the correction from a coarser to a finer grid (Eqs. (11) and (12)) because the interpolation operation can introduce a large amount of interpolation noise and even lead to the unphysical prediction of negative populations at the fine grid. Both cases destroy the good convergence behavior of multigrid. We found that interpolating the relative correction (Eq. (11)) decreases the interpolation noise and largely eliminates the occurrence of negative populations as a consequence of interpolation.
4.7. The atmosphere at various grid levels
Multigrid requires solving the formal solution at all grid levels. We thus need a method to generate coarsegrid model atmospheres from the finegrid atmosphere. We tested both injection and full weighting to do so. Our tests indicate that injection can lead to the best convergence rate, especially in smooth atmospheres like FALC, but it might also cause stalls in convergence or even divergence. Fullweighting has a lower bestcase convergence, but does not lead to stalls or divergence. The reason for this difference is that injection more accurately represents the finegrid problem, and so has better bestcase performance. But it also enhances gradients on the coarser grid, leading to stronger nonlinearities and larger probability of stalling. Fullweighting on the other hand leads to coarsegrid atmospheres that are more different from the finegrid atmosphere, leading to lower performance, but also has smaller gradients leading to increased stability. Because stability is usually the greatest concern when using radiationMHD atmospheres, we use fullweighting for the atmosphere initialization in our computations.
4.8. Initializing the radiation field at various grid levels
Multi3D treats background processes using LTE opacities and a source function with a thermal part and a coherentscattering part. At each grid level, we thus need to perform a small number of Λiterations to ensure the background processes are initialized correctly. Because a Λiteration takes a similar amount of time as a MALI iteration, we want to minimize the number of Λiterations. Empirically, we found that one Λiteration is sufficient at the finest grid. At the coarser grids, we obtain an initial estimate for the radiation field by restricting it from the next finer grid and performing one or two Λiterations.
4.9. Computational cost
In this paper, we are mainly concerned with the theoretical performance of multigrid compared to MALI iteration. We therefore express computation time in units of one MALI iteration at the finest grid in our figures. The computing time of a formal solution at coarse grid k−1 is therefore one eight of the computing time at grid k.
However, Multi3D does not follow this theoretical perfect scaling. The reason is that the shortcharacteristic solver in Multi3D requires five ghost zones in the horizontal direction and one ghost zone in the vertical direction. As the number of grid points per subdomain gets smaller with increasing coarsening, the relative amount of time spent on updating the ghost zones increases. In Fig. 5, we compare the theoretical maximum speedup with the actual speedup measured on a HP Cluster Platform 3000 with Intel Xeon E5 2600 2.2 GHz cores using threegrids. At grid k = 2, the performance penalty is a factor 3 for the 32 × 32 × 31 subdomain, but interestingly the 96 × 96 × 48 subdomain shows a speedup better than the theoretical value. At the k = 1 grid, the performance penalty is visible for all subdomain sizes that we tested, but with the expected behavior that the larger the subdomain, the smaller the performance penalty.
4.10. Occurrence of negative populations
Fig. 5 Computational cost for one formal solution at each grid in multigrid with different subdomain sizes. We set the cost of a formal solution at the finest grid to 1. The theoretical value is calculated as (1/8)^{ℓ−k}, with k being the grid level. 

Open with DEXTER 
Standard MALI iteration keeps atomic level populations positive as long as the iteration is started with positive populations. This is, however, not true for multigrid iterations. The reason is that coarse grid iterations have a modified righthand side in the rate equations: (21)The equation for k<ℓ can, in principle, have a negative population as a solution, or produce negative estimates of the solution during iteration. Negative populations on the coarse grids will propagate to the finest grid and destroy the convergence.
By experimentation, we found that negative populations at the coarse grid typically occur when the error (n_{i}−n_{∞}) /n_{∞} is not smooth enough, but we did not manage to get an unambiguous definition of what is “smooth enough”. The error is sometimes not smooth at the location of strong gradients in the atmospheric parameters, but sometimes large error fluctuations also occur in smooth parts of the atmosphere models. The error is typically less smooth in our H i atom than in the Ca ii atoms. This is caused by the larger spectral radius for hydrogen (see Sect. 4.13), which lowers the smoothing capability of Jacobi iterations.
Figure 6 illustrates this in an ℓ = 3 test computation using a nonsmooth 1D atmosphere and the H i atom. The lefthand columns show the error for the first two energy levels of the atom after two Vcycles but with a different number of postsmoothing iterations. The error for the n = 2 level exhibits a strong spike at a height of 1000 km for ν_{2} = 2, but this spike is much smaller for ν_{2} = 10 and ν_{2} = 20. In contrast, the error in the n = 1 population is relatively smooth, and at 1000 km in height, it is very small.
The black dot in the lefthand panels indicates the grid point that we investigate in more detail in the righthand panels. The righthand panels show the relative change in the n = 1 and n = 2 populations as a function of iteration at the coarsest grid (k = 1). The corrections are small for n = 1, and the n = 1 population remains positive for all coarsegrid iterations, as expected from the small error seen in the lefthand panels.
The n = 2 population behaves remarkably differently. For ν_{2} = 2, the first coarsegrid iteration predicts a relative change of –1.7 and thus produces a negative population. Successive corrections are smaller, but the population remains negative. When ν_{2} = 10 (second row), the population is positive for the first 3 iterations, but then turns negative until iteration 22, after which it is positive again. For ν_{2} = 20, the behavior is similar, but the number of iterations where the populations are negative is shorter.
For comparison, in the fourth row, we show the relative change at the coarsest grid with ν_{2} = 2 but where we perform standard MALI iterations (Eq. (4)) instead of coarsegrid iterations (Eq. (10)). Here the populations are always positive, demonstrating again that MALI iterations keeps a positive solution positive.
If negative populations occur after application of the correction (Eq. (11)), we simply replace it with 10% of the uncorrected population and continue as usual with postsmoothing iterations. If this happens at isolated points in the atmosphere, then the convergence of the multigrid iteration is not affected, because a single outlying gridpoint represents highfrequency noise, which is damped away efficiently. However, if there are too many negative populations in the same area of the atmosphere then convergence will be slower or the iteration might even diverge.
4.11. Initial population
Fig. 6 Dependence on the number of postsmoothing iterations of the occurrence of negative populations at the coarsest grid. The lefthand columns show the relative error at the finest grid after two full Vcycles. The righthand columns show the relative change of the population at the coarsest grid in a single grid point in the atmosphere. Red dots indicate positive populations; blue dots negative populations. The chosen grid point is indicated by the black dot in the lefthand columns. For each row of panels, a different number of postsmoothing iterations is applied. First row: ν_{2} = 2; second row: ν_{2} = 10; third row: ν_{2} = 20. In the fourth row, we show the relative change of the population at the coarsest grid with ν_{2} = 2, but we solve Eq. (4) instead of Eq. (10), that is, we perform standard MALI iterations instead of coarsegrid iterations. The computation was performed in a 1D planeparallel atmosphere constructed from column x = 0, y = 244 of Model 1, with the H i atom. The other multigrid parameters are ν_{1} = 2, ν_{3} = 32, fullweighting restriction and linear interpolation. 

Open with DEXTER 
A good initial approximation for the level populations is critical for good convergence. There are two popular methods to initialize the populations: LTE and the zeroradiationfield approximation. The latter means solving the statistical equilibrium equations with the radiation field set to zero everywhere in the atmosphere. We found that LTEpopulations as an initial approximation typically lead to negative populations at the coarse grid.
We suspect that the reason is that the residual and the error are less smooth using LTE initialization than using the zeroradiation approximation. To obtain a smooth residual and error, many more iterations are required. We demonstrate our conjecture by comparing the smoothing number (Hackbush 1985; Fabiani Bendicho et al. 1997) as a function of MALI iterations at the fine grid for both initializations. The smoothing number is defined as (22)where the operator is the secondorder derivate and i is the number of MALI iterations. In Fig. 7, we show that the zeroradiation initialization leads to a much smoother error than LTE initialization. A similar result is obtained for the residual. We therefore use zeroradiation initialization for all our computations.
4.12. Selection of pre and postsmoothing parameters
The convergence and stability of the multigrid method depends on the selection of the multigrid parameters ν_{1}, ν_{2} and ν_{3} (see Sect. 2.2). To ensure a good initial smoothing before the first Vcycle, we define an additional parameter, ν_{0}, which is the number of MALI iterations performed after initialization. This means that, at the finest grid level, we perform ν_{0} iterations during the first Vcycle, but use ν_{1} during all later Vcycles.
In order to analyze the multigrid behavior as a function of the ν parameters, we use two metrics. The first is the spectral radius. The other metric is the speedup S_{i}, which we define as the ratio (23)where is the computing time required to perform i Vcycles (with an associated error E_{i,∞}), and t_{MALI} the computing time to reach the same error. A small spectral radius means one needs fewer Vcycles to reach convergence, but this does not necessarily mean that S_{i} also increases because one might need many iterations (as defined by the value of ν_{1},ν_{2} and ν_{3}) within a Vcycle to obtain the small spectral radius.
We found that every atmosphere and model atom behaves differently, and it is impossible to give a set of parameters that always provides the fastest stable multigrid iteration. Empirically, we found that two to four presmoothings (ν_{1} = 2–4) worked well in all our test cases, but for Models 1 and 2, with the hydrogen atom we required extra initial smoothing for the first cycle (ν_{0} ≥ 15). At the coarsest grid, we found that ν_{3} ≈ 32 is a good number, independent of the problem. Iterating further did not significantly influence the convergence speed or stability.
The most sensitive parameter is the postsmoothing number. Our tests with the Ca ii atoms in Model 1 and FALC showed stable and fast convergence with ν_{2} = 2, but for Model 2, we used ν_{2} = 8 to avoid excessive occurrence of negative populations. In Fig. 8, we show the speedup and spectral radius in a 1D calculation where we used a column from Model 1 as a planeparallel 1D atmosphere. The spectral radius decreases with increasing ν_{2}, but the speedup gets smaller owing to the increase in computational cost per Vcycle.
For hydrogen, we found that one needs many more postsmoothing iterations (ν_{2} = 25). If a smaller number is chosen, then the iteration at the coarsest grid tends to produce large areas with negative populations. We found that this is related to the smoothness of the error at the finest grid. We illustrate this in Fig. 6. The two lefthand columns show the error for the first two levels of our hydrogen atom at the start of the third Vcycle for computations with a different number of postsmoothings (ν_{2} = 2, 10 and 20). The error becomes smoother with increasing ν_{2}. The righthand columns show the sign of the level populations and the maximum correction as function of the iteration number at the coarsest grid during the third Vcycle. For ν_{2} = 2, a negative population occurs already during the first coarsegrid iteration and this remains so for all other iterations. For ν_{2} = 10, negative populations occur between iterations 3 and 23, after which all populations become positive. For ν_{2} = 20, negative populations only occur during iterations 4 through 17. For comparison, in the fourth row, we show iterations at the coarsest grid for ν_{2} = 2, where we solve Eq. (4) instead of Eq. (10), that is, we perform standard MALI iterations instead of coarsegrid iterations. Here, no negative populations occur, demonstrating that negative populations occur owing to the righthandside of Eq. (10) and not owing to the coarse grid spacing.
4.13. Spectral radius and convergence criteria
The spectral radius for the threelevel Ca ii with MALI onegrid iteration in Model 1 is ρ_{sr} = 0.971, for and H i atoms, it is ρ_{sr} = 0.9923. An optimal multigrid method should achieve a spectral radius of 0.1–0.2 (Trottenberg et al. 2000). We obtained a spectral radius in the range of 0.3–0.4 with the pre and postsmoothing parameters as discussed in Sect. 4.12 using Eq. (17).
The spectral radius of onegrid MALI iterations increases with decreasing grid spacing (Olson et al. 1986). Combined with Eq. (18), this means that one needs to iterate longer and longer to reach the same level of accuracy as the grid spacing gets finer. In contrast, the spectral radius of multigrid remains constant irrespective of the grid spacing (Steiner 1991; Fabiani Bendicho et al. 1997; Trottenberg et al. 2000), so that the speedup of multigrid is expected to increase with decreasing grid spacing.
Fig. 7 Dependence of the smoothing number ρ_{L}(ν_{1}) (see Eq. (22)), on the initial condition of the populations. The results were computed using column x = 0,y = 271 from Model 1 as a 1D atmosphere and the hydrogen model atom. 

Open with DEXTER 
Fig. 8 Speedup (lefthand panel) and spectral radius (righthand panel) of multigrid as a function of the number of Vcycles. The computations were performed using column x = 0,y = 271 from Model 1 as a 1D atmosphere and the threelevel Ca ii model atom. The different colors indicate a different number of postsmoothing iterations ν_{2}. The other multigrid parameters are: three grids, ν_{1} = 2, ν_{3} = 32, linear interpolation, and fullweighting restriction. 

Open with DEXTER 
The relation between the maximum relative correction and the error (Eq. (18)) is valid for onegrid MALI iteration (Auer et al. 1994). Fabiani Bendicho et al. (1997) showed that it holds for multigrid in a smooth 2D atmosphere too. The 3D multigrid computations presented in Štěpán & Trujillo Bueno (2013) did not test the validity of the relation in 3D. Therefore we tested the validity in atmosphere Model 1. The results are shown in Fig. 9, where we compare the true error, the error estimate from Eq. (18), and the maximum relative correction. For Ca ii we find that the formula still holds. We also find that the maximum relative correction is equal to the error. This is accidental, because the spectral radius is close to 0.5. For different preand postsmoothing parameters, a different result would be obtained. We also note that the maximum relative correction in Eq. (18) must be for the whole Vcycle, and not for the individual MALI iterations in the postsmoothing at the finest grid. In the hydrogen case, the approximation underestimates the true error by a factor 2. Again, the maximum relative correction is only similar to the error because of the spectral radius being close to 0.5. The Ca ii computation reaches the linear regime after five Vcycles. For H i it requires only one cycle. This is owing to the much higher number of postsmoothing iterations for hydrogen: ν_{2,HI} = 25 and ν_{2,CaII} = 2.
Fig. 9 Convergence behavior of multigrid, showing the maximum relative error and the maximum relative error estimated by Eq. (18) for each Vcycle, as well as the maximum relative change in population per Vcycle. Upper panels: threelevel Ca ii atom; lower panels: H i, both for atmosphere Model 1. For threelevel Ca ii we used ν_{1} = 2, ν_{2} = 2, ν_{3} = 32 and for H i, we used ν_{0} = 15, ν_{1} = 2, ν_{2} = 25, ν_{3} = 32. 

Open with DEXTER 
5. Results
Fig. 10 Intensity of the Ca ii K line core computed from atmosphere Model 1 (left) and Model 2 (right) at μ_{z} = 1. The intensity is shown as the brightness temperature T_{rad} computed from B_{ν}(T_{rad}) = I_{ν}. 

Open with DEXTER 
Summary of 3D nonLTE multigrid runs.
Fig. 11 Convergence behavior for MALI and multigrid for threelevel Ca ii (lefthand panel) and hydrogen atom (righthand panel) for atmosphere Model 1. The computation was performed with three grids, fullweighting restriction, and trilinear interpolation. For threelevel Ca ii we used ν_{1} = 2, ν_{2} = 2, ν_{3} = 32 and for H i we used ν_{0} = 15,ν_{1} = 2, ν_{2} = 25, ν_{3} = 32. 

Open with DEXTER 
In Table 1, we show a summary of our 3D nonLTE multigrid computations. We obtained a speedup of 3.3 for Ca ii and 4.5 for H i with atmosphere Model 1 and standard multigrid. Using full multigrid, we obtain a speedup of 6 for Ca ii, an improvement of a factor 1.8 compared to ordinary multigrid. A similar result for a smooth atmosphere was found by Fabiani Bendicho et al. (1997). In the hydrogen case, we needed 25 postsmoothing iterations to avoid too many occurrences of negative populations. This considerably reduced the speedup. The convergence behavior of these three runs is shown in Fig. 11.
We also performed multigrid computation in atmosphere Model 2 to test whether multigrid can handle a finer grid spacing (Δ_{x,y} = 32 km, Δ_{z} = 13 km) and a different atmosphere. Obtaining a reference solution for this model was too computationally expensive. Therefore, we estimate the convergence based on Eq. (18), which we showed to be accurate for Ca ii in Model 1 (see Fig. 9). The computation with Model 2 proves that 3D nonLTE radiative transfer using multigrid can handle different atmospheres and grid spacings.
Figure 10 shows the brightness temperature in the Ca ii K line core for Models 1 and 2. The image computed from Model 2 shows substantially more finestructure. This highlights the need for higherresolution radiationMHD simulations and the capacity to efficiently compute synthetic diagnostics using 3D nonLTE radiative transfer from them.
6. Summary and conclusions
In this article, we investigated whether or not a nonlinear multigrid method can be applied to 3D nonLTE radiative transfer problems using snapshots from radiationMHD simulations as input. We showed that this is indeed the case: we obtain a speedup factor of between 4.5 and 6 for a 504 × 504 × 496 atmosphere (48 km horizontal and 19 km vertical resolution) computed with the radiationMHD code Bifrost for Ca ii and H i atoms. We also solve the 3D nonLTE radiative transfer problem using multigrid for a 768 × 768 × 768 (32 km horizontal and 13 km vertical resolution) Bifrost snapshot. We conclude that the multigrid method can handle model atmospheres with very strong gradients in atmospheric parameters as well as strongly scattering lines such as hydrogen Lymanα and Ca ii H&K.
The implementation of multigrid requires choosing suitable numerical methods for the subtasks. We investigated several of those choices using 1D and 3D test computations. Our findings are summarized as follows:

we suggest using fullweighting as restriction operator;

linear interpolation works well. Thirdorder Hermite interpolations appear to give higher convergence in 1D problems and should be investigated in 3D problems;

one should interpolate the relative correction to the populations, and not the absolute correction;

we suggest using fullmultigrid if possible;

initializing with the zeroradiation approximation is substantially better than initializing with LTE;

threegrid iteration converges faster than fourgrid iteration;

the coarsegrid iterations can converge to a negative solution. This is not a problem for isolated grid points, but if extended regions have negative populations, one should increase the number of postsmoothing iterations;

each atom and atmosphere requires some testing to find the optimal number of presmoothings and postsmoothings. Our findings in Table 1 can be used as a starting point.
Since each problem is unique, other atmospheres and atoms could require different approaches. Therefore, the multigrid method should be implemented into radiative transfer codes in a modular way so that methods can be easily changed.
Fig. 12 Convergence properties for atmosphere Model 2 with sixlevel Ca ii as a function of Vcycle. The E_{approx} is calculated based on the relation between the spectral radius and maximum relative population change (Eq. (18)). The computation was performed with three grids, fullweighting, and linear interpolation using ν_{0} = 20, ν_{1} = 4, ν_{2} = 8, ν_{3} = 32. 

Open with DEXTER 
We did not obtain the high convergence rate (as measured in spectral radius of the multigrid iteration) as reported in Fabiani Bendicho et al. (1997). There are two reasons for this. First, these authors used a static smooth 2D with a weak horizontal temperature inhomogeneity and no vertical temperature gradient, while we are using moving atmospheres with very large gradients in all atmospheric parameters. Second, they use GaussSeidel (GS) iterations, while we use Jacobi iteration in Multi3D. The smoothing properties and the convergence speed of GS iterations are superior to Jacobi iteration. Unfortunately, no MPIparallelization scheme exists for GS iteration that scales well to thousands of computing cores, and we are forced to use Jacobi iteration. The lower convergence speed per iteration for Jacobi iteration can fortunately be offset by increasing the number of computing cores, but, ideally, one should develop an efficient parallel GS iteration scheme. A similar conclusion was reached by Štěpán & Trujillo Bueno (2013).
So far, we have only tested our multigrid method using complete frequency redistribution. Because partial frequency redistribution (PRD) can increase the computing time in nonLTE problems by more than an order of magnitude, the obvious next step will be to test the combination of 3D PRD (Sukhorukov & Leenaarts 2017) and multigrid in realisticuse cases. In this paper, we have used small model atoms with up to six levels. Multigrid method should also be tested with more complex atoms, such as Fe i, which are important for stellar photospheric abundance determinations (e.g., Nordlander et al. 2016).
The speedup factor of multigrid increases with decreasing grid spacing. With the everincreasing grid sizes and decreasing grid spacing of solar and stellar radiationMHD models will make the use of multigrid methods in 3D nonLTE radiative transfer more and more desirable to keep computing costs manageable.
Acknowledgments
Computations were performed on resources provided by the Swedish National Infrastructure for Computing (SNIC) at the National Supercomputer Centre at Linköping University, at the High Performance Computing Center North at Umeå University, and at the PDC Centre for High Performance Computing (PDCHPC) at the Royal Institute of Technology in Stockholm. J.P.B. and J.L. thank Mats Carlsson and Viggo Hansteen for providing a 768^{3} Bifrost snapshot. J.P.B. thanks Andrii Sukhorukov for answering questions regarding radiative transfer.
References
 Amarsi, A. M., Asplund, M., Collet, R., & Leenaarts, J. 2016, MNRAS, 455, 3735 [NASA ADS] [CrossRef] [Google Scholar]
 Asplund, M., Carlsson, M., & Botnen, A. V. 2003, A&A, 399, L31 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Asplund, M., Grevesse, N., Sauval, A. J., Allen de Prieto, C., & Kiselman, D. 2004, A&A, 417, 751 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Auer, L. 2003, in Stellar Atmosphere Modeling, eds. I. Hubeny, D. Mihalas, & K. Werner, ASP Conf. Ser., 288, 3 [Google Scholar]
 Auer, L., Bendicho, P. F., & Trujillo Bueno, J. 1994, A&A, 292, 599 [NASA ADS] [Google Scholar]
 Brandt, A. 1977, Math. Comput., 31, 333 [CrossRef] [MathSciNet] [Google Scholar]
 Cannon, C. J. 1973, ApJ, 185, 621 [NASA ADS] [CrossRef] [Google Scholar]
 Carlsson, M., & Leenaarts, J. 2012, A&A, 539, A39 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Carlson, B., Adler, B., Fernbach, S., & Rotenberg, M. 1963, in Statistical Physics, eds. B. Alder, S. Fernbach, & M. Rotenberg (New York: Academic), 1 [Google Scholar]
 Carlsson, M., Hansteen, V. H., Gudiksen, B. V., Leenaarts, J., & De Pontieu, B. 2016, A&A, 585, A4 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 de la Cruz Rodríguez, J., De Pontieu, B., Carlsson, M., & Rouppe van der Voort, L. H. M. 2013, ApJ, 764, L11 [NASA ADS] [CrossRef] [Google Scholar]
 Fabiani Bendicho, P., Trujillo Bueno, J., & Auer, L. 1997, A&A, 324, 161 [Google Scholar]
 Fontenla, J. M., Avrett, E. H., & Loeser, R. 1993, ApJ, 406, 319 [NASA ADS] [CrossRef] [Google Scholar]
 Gudiksen, B. V., Carlsson, M., Hansteen, V. H., et al. 2011, A&A, 531, A154 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Hackbush, W. 1985, in MultiGrid Methods and Applications (Berlin Heidelberg: Springer) [Google Scholar]
 Holzreuter, R., & Solanki, S. K. 2013, A&A, 558, A20 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Holzreuter, R., & Solanki, S. K. 2015, A&A, 582, A101 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Ibgui, L., Hubeny, I., Lanz, T., & Stehlé, C. 2013, A&A, 549, A126 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Judge, P. G., Kleint, L., Uitenbroek, H., et al. 2015, Sol. Phys., 290, 979 [NASA ADS] [CrossRef] [Google Scholar]
 Kunasz, P., & Auer, L. H. 1988, J. Quant. Spec. Radiat. Transf., 39, 67 [NASA ADS] [CrossRef] [Google Scholar]
 Leenaarts, J., & Carlsson, M. 2009, in The Second Hinode Science Meeting: Beyond DiscoveryToward Understanding, eds. B. Lites, M. Cheung, T. Magara, J. Mariska, & K. Reeves, ASP Conf. Ser., 415, 87 [Google Scholar]
 Leenaarts, J., Carlsson, M., Hansteen, V., & Rouppe van der Voort, L. 2009, ApJ, 694, L128 [NASA ADS] [CrossRef] [Google Scholar]
 Leenaarts, J., Carlsson, M., & Rouppe van der Voort, L. 2012, ApJ, 749, 136 [NASA ADS] [CrossRef] [Google Scholar]
 Leenaarts, J., Pereira, T. M. D., Carlsson, M., Uitenbroek, H., & De Pontieu, B. 2013a, ApJ, 772, 89 [NASA ADS] [CrossRef] [Google Scholar]
 Leenaarts, J., Pereira, T. M. D., Carlsson, M., Uitenbroek, H., & De Pontieu, B. 2013b, ApJ, 772, 90 [NASA ADS] [CrossRef] [Google Scholar]
 Léger, L., Chevallier, L., & Paletou, F. 2007, A&A, 470, 1 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Loukitcheva, M., Solanki, S. K., Carlsson, M., & White, S. M. 2015, A&A, 575, A15 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Nordlander, T., Amarsi, A. M., Lind, K., et al. 2016, A&A, 597, A6 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Olson, G. L., Auer, L. H., & Buchler, J. R. 1986, J. Quant. Spec. Radiat. Transf., 35, 431 [NASA ADS] [CrossRef] [Google Scholar]
 Paletou, F., & Anterrieu, E. 2009, A&A, 507, 1815 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Pereira, T. M. D., Asplund, M., & Kiselman, D. 2009, A&A, 508, 1403 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Pereira, T. M. D., Carlsson, M., De Pontieu, B., & Hansteen, V. 2015, ApJ, 806, 14 [NASA ADS] [CrossRef] [Google Scholar]
 Rathore, B., & Carlsson, M. 2015, ApJ, 811, 80 [NASA ADS] [CrossRef] [Google Scholar]
 Rathore, B., Carlsson, M., Leenaarts, J., & De Pontieu, B. 2015, ApJ, 811, 81 [NASA ADS] [CrossRef] [Google Scholar]
 Rybicki, G. B., & Hummer, D. G. 1991, A&A, 245, 171 [NASA ADS] [Google Scholar]
 Rybicki, G. B., & Hummer, D. G. 1992, A&A, 262, 209 [NASA ADS] [Google Scholar]
 Steiner, O. 1991, A&A, 242, 290 [NASA ADS] [Google Scholar]
 Sukhorukov, A. V., & Leenaarts, J. 2017, A&A, 597, A46 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Trottenberg, U., Oosterlee, C. W., & Schuller, A. 2000, in Multigrid (Orlando: Academic Press) [Google Scholar]
 Trujillo Bueno, J., & Fabiani Bendicho, P. 1995, ApJ, 455, 646 [NASA ADS] [CrossRef] [Google Scholar]
 Trujillo Bueno, J., & Manso Sainz, R. 1999, ApJ, 516, 436 [NASA ADS] [CrossRef] [Google Scholar]
 Trujillo Bueno, J., & Shchukina, N. 2007, ApJ, 664, L135 [NASA ADS] [CrossRef] [Google Scholar]
 Tsitsiklis, J. N. et al. 1988, A comparison of Jacobi and GaussSeidel parallel iterations (Massachusetts Institute of Technology, Laboratory for Information and Decision Systems) [Google Scholar]
 Uitenbroek, H. 2001, ApJ, 557, 389 [NASA ADS] [CrossRef] [Google Scholar]
 Uitenbroek, H. 2006, ApJ, 639, 516 [NASA ADS] [CrossRef] [Google Scholar]
 Štěpán, J., & Trujillo Bueno, J. 2013, A&A, 557, A143 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Štěpán, J., Trujillo Bueno, J., Leenaarts, J., & Carlsson, M. 2015, ApJ, 803, 65 [NASA ADS] [CrossRef] [Google Scholar]
 Vath, H. M. 1994, A&A, 284, 319 [NASA ADS] [Google Scholar]
All Tables
All Figures
Fig. 1 Schematic representation of Vcycle and full multigrid with three grid levels. ⇒ means interpolating the full approximation, → means restricting the approximation and the residual, and ⇢ means interpolating the correction. The iteration parameters ν_{FMG} and ν_{1,2,3} are defined in Sect. 2, the parameter ν_{0} in Sect. 4.12. 

Open with DEXTER  
In the text 
Fig. 2 Behavior of the relative error in population at the finest grid during various steps in a Vcycle with three grids, for the FALC atmosphere (lefthand panels) and a column extracted from a 3D radiationMHD atmosphere (atmosphere Model 1, see Sect. 3). Both computations are done for a H i atom using 10 presmoothings, 32 coarsegrid iterations and 25 postsmoothings. Upper panel: temperature and electron density in the atmosphere. Lower panels: error for the H in = 2 level after the presmoothing (red), the error after application of the coarsegrid correction (blue), and the error after application of the postsmoothing (purple). For both atmospheres the coarse grid correction has decreased the low spatialfrequency error, but increased the highfrequency error. The latter is largely removed by the postsmoothing. 

Open with DEXTER  
In the text 
Fig. 3 Convergence behavior for MALI (red) and multigrid with three (blue) and four (purple) grids for the threelevel Ca ii atom within atmosphere Model 1. The computing time is expressed in units of the time it takes to perform one MALI iteration at the finest grid. The multigrid computations were performed with ν_{1} = 2, ν_{2} = 2, ν_{3} = 32, fullweighting restriction and trilinear interpolation. 

Open with DEXTER  
In the text 
Fig. 4 Convergence behavior for MALI (red) and multigrid with injection (purple) and fullweighting (blue) as restriction operators, using the threelevel Ca ii atom and atmosphere Model 1. The multigrid computation was performed with ν_{1} = 2, ν_{2} = 2, ν_{3} = 32, three grids and trilinear interpolation. 

Open with DEXTER  
In the text 
Fig. 5 Computational cost for one formal solution at each grid in multigrid with different subdomain sizes. We set the cost of a formal solution at the finest grid to 1. The theoretical value is calculated as (1/8)^{ℓ−k}, with k being the grid level. 

Open with DEXTER  
In the text 
Fig. 6 Dependence on the number of postsmoothing iterations of the occurrence of negative populations at the coarsest grid. The lefthand columns show the relative error at the finest grid after two full Vcycles. The righthand columns show the relative change of the population at the coarsest grid in a single grid point in the atmosphere. Red dots indicate positive populations; blue dots negative populations. The chosen grid point is indicated by the black dot in the lefthand columns. For each row of panels, a different number of postsmoothing iterations is applied. First row: ν_{2} = 2; second row: ν_{2} = 10; third row: ν_{2} = 20. In the fourth row, we show the relative change of the population at the coarsest grid with ν_{2} = 2, but we solve Eq. (4) instead of Eq. (10), that is, we perform standard MALI iterations instead of coarsegrid iterations. The computation was performed in a 1D planeparallel atmosphere constructed from column x = 0, y = 244 of Model 1, with the H i atom. The other multigrid parameters are ν_{1} = 2, ν_{3} = 32, fullweighting restriction and linear interpolation. 

Open with DEXTER  
In the text 
Fig. 7 Dependence of the smoothing number ρ_{L}(ν_{1}) (see Eq. (22)), on the initial condition of the populations. The results were computed using column x = 0,y = 271 from Model 1 as a 1D atmosphere and the hydrogen model atom. 

Open with DEXTER  
In the text 
Fig. 8 Speedup (lefthand panel) and spectral radius (righthand panel) of multigrid as a function of the number of Vcycles. The computations were performed using column x = 0,y = 271 from Model 1 as a 1D atmosphere and the threelevel Ca ii model atom. The different colors indicate a different number of postsmoothing iterations ν_{2}. The other multigrid parameters are: three grids, ν_{1} = 2, ν_{3} = 32, linear interpolation, and fullweighting restriction. 

Open with DEXTER  
In the text 
Fig. 9 Convergence behavior of multigrid, showing the maximum relative error and the maximum relative error estimated by Eq. (18) for each Vcycle, as well as the maximum relative change in population per Vcycle. Upper panels: threelevel Ca ii atom; lower panels: H i, both for atmosphere Model 1. For threelevel Ca ii we used ν_{1} = 2, ν_{2} = 2, ν_{3} = 32 and for H i, we used ν_{0} = 15, ν_{1} = 2, ν_{2} = 25, ν_{3} = 32. 

Open with DEXTER  
In the text 
Fig. 10 Intensity of the Ca ii K line core computed from atmosphere Model 1 (left) and Model 2 (right) at μ_{z} = 1. The intensity is shown as the brightness temperature T_{rad} computed from B_{ν}(T_{rad}) = I_{ν}. 

Open with DEXTER  
In the text 
Fig. 11 Convergence behavior for MALI and multigrid for threelevel Ca ii (lefthand panel) and hydrogen atom (righthand panel) for atmosphere Model 1. The computation was performed with three grids, fullweighting restriction, and trilinear interpolation. For threelevel Ca ii we used ν_{1} = 2, ν_{2} = 2, ν_{3} = 32 and for H i we used ν_{0} = 15,ν_{1} = 2, ν_{2} = 25, ν_{3} = 32. 

Open with DEXTER  
In the text 
Fig. 12 Convergence properties for atmosphere Model 2 with sixlevel Ca ii as a function of Vcycle. The E_{approx} is calculated based on the relation between the spectral radius and maximum relative population change (Eq. (18)). The computation was performed with three grids, fullweighting, and linear interpolation using ν_{0} = 20, ν_{1} = 4, ν_{2} = 8, ν_{3} = 32. 

Open with DEXTER  
In the text 
Current usage metrics show cumulative count of Article Views (fulltext article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 4896 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.