Search NASA⌕ Search

SEARCH · Search NASA

Results for “Iterative solvers”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 451 records · Page 25

New preconditioning strategy for Jacobian-free solvers for variably saturated flows with Richards’ equation

We develop a new approach for solving the nonlinear Richards’ equation arising in variably saturated flow modeling. The growing complexity of geometric models for simulation of subsurface flows leads to the necessity of using unstructured meshes and advanced discretization methods. Typically, a numerical solution is obtained by first discretizing PDEs and then solving the resulting system of nonlinear discrete equations with a Newton-Raphson-type method. Efficiency and robustness of the existing solvers rely on many factors, including an empiric quality control of intermediate iterates, complexity of the employed discretization method and a customized preconditioner. We propose and analyze a new preconditioning strategy that is based on a stable discretization of the continuum Jacobian. We will show with numerical experiments for challenging problems in subsurface hydrology that this new preconditioner improves convergence of the existing Jacobian-free solvers 3-20 times. Furthermore, we show that the Picard method with this preconditioner becomes a more efficient nonlinear solver than a few widely used Jacobian-free solvers.

58 GEOSCIENCES↗

Comparison of multigrid algorithms for high‐order continuous finite element discretizations

Summary We present a comparison of different multigrid approaches for the solution of systems arising from high‐order continuous finite element discretizations of elliptic partial differential equations on complex geometries. We consider the pointwise Jacobi, the Chebyshev‐accelerated Jacobi, and the symmetric successive over‐relaxation smoothers, as well as elementwise block Jacobi smoothing. Three approaches for the multigrid hierarchy are compared: (1) high‐order h ‐multigrid, which uses high‐order interpolation and restriction between geometrically coarsened meshes; (2) p ‐multigrid, in which the polynomial order is reduced while the mesh remains unchanged, and the interpolation and restriction incorporate the different‐order basis functions; and (3) a first‐order approximation multigrid preconditioner constructed using the nodes of the high‐order discretization. This latter approach is often combined with algebraic multigrid for the low‐order operator and is attractive for high‐order discretizations on unstructured meshes, where geometric coarsening is difficult. Based on a simple performance model, we compare the computational cost of the different approaches. Using scalar test problems in two and three dimensions with constant and varying coefficients, we compare the performance of the different multigrid approaches for polynomial orders up to 16. Overall, both h ‐multigrid and p ‐multigrid work well; the first‐order approximation is less efficient. For constant coefficients, all smoothers work well. For variable coefficients, Chebyshev and symmetric successive over‐relaxation smoothing outperform Jacobi smoothing. While all of the tested methods converge in a mesh‐independent number of iterations, none of them behaves completely independent of the polynomial order. When multigrid is used as a preconditioner in a Krylov method, the iteration number decreases significantly compared with using multigrid as a solver. Copyright © 2015 John Wiley & Sons, Ltd.

Sundar, Hari↗

A multigrid waveform relaxation method for solving the poroelasticity equations

In this work, a multigrid waveform relaxation method is proposed for solving a collocated finite difference discretization of the linear Biot’s model. This gives rise to the first space–time multigrid solver for poroelasticity equations in the literature. The waveform relaxation iteration is based on a point-wise Vanka smoother that couples the pressure variable at a grid-point with the displacements around it. A semi-algebraic mode analysis is proposed to theoretically analyze the convergence of the multigrid waveform relaxation algorithm. This analysis is novel since it combines the semi-algebraic analysis, suitable for parabolic problems, with the non-standard analysis for overlapping smoothers. The practical utility of the method is illustrated through several numerical experiments in one and two dimensions.

97 MATHEMATICS AND COMPUTING↗

An iterative dynamic chemical stiffness removal method for reacting flow simulations

Abstract An iterative dynamic chemical stiffness removal method (IDCSR) based on quasi-steady-state approximation (QSSA) is proposed. The IDCSR method is built on a previously developed non-iterative method which has proved to work well for small timestep sizes. A novel iterative procedure is designed in IDCSR to enable explicit time integration of stiff chemistry at relatively large timestep sizes relevant to practical reacting flow simulations. The effectiveness of the iterative procedure is first demonstrated with a toy problem and homogeneous auto-ignition with fixed integration step sizes, showing that larger timestep sizes can be allowed for explicit time integration using IDCSR compared with the previous non-iterative method. IDCSR is then compared with existing explicit chemistry solvers for simulations of homogeneous auto-ignition and shows similar or lower computational cost but significantly higher accuracy across a wide range of timestep sizes. IDCSR is further combined with an automatic adaptive time-stepping scheme for simulations of 0-D homogeneous auto-ignition and a 2-D laminar lifted n -dodecane jet flame. For the 0-D auto-ignition simulations, IDCSR is shown to reduce both the error (by 43%–90%) and computational cost (by 6–15 times) compared with existing explicit solvers, while achieving speed-up factors of up to 400 compared with VODE for a wide range of timestep sizes and reaction mechanisms. For the 2-D jet flame simulations, speed-up factors of 15 and 31 for chemistry integration, and 5 and 9 for overall simulation, are achieved by IDCSR compared with CVODE with and without analytic Jacobian, respectively.

Xu, Chao (ORCID:0000000153074159)↗

Accelerating the solution of the S N equations with highly anisotropic scattering using the Fokker-Planck approximation

The discrete ordinates method can model forward-peaked transport problems accurately. However, convergence of discrete ordinates solution can become arbitrarily slow upon use of standard iterative procedures like source iteration. Standard zeroth and first moment-based acceleration methods like nonlinear diffusion acceleration and diffusion synthetic acceleration are ineffective in accelerating such problems because these methods do not correct higher order Legendre-moments of angular flux. In this paper, we explore the idea of using the Fokker-Planck approximation as a preconditioner to accelerate the convergence of solution of forward-peaked transport problems. Finally, we observe that such preconditioning can successfully reduce the iteration count by up to four orders of magnitude, and solver runtime by up to three orders of magnitude when compared to diffusion synthetic acceleration.

42 ENGINEERING↗

A high-order integral solver for scalar problems of diffraction by screens and apertures in three-dimensional space

We present a novel methodology for the numerical solution of problems of diffraction by infinitely thin screens in three-dimensional space. Our approach relies on new integral formulations as well as associated high-order quadrature rules. The new integral formulations involve weighted versions of the classical integral operators related to the thin-screen Dirichlet and Neumann problems as well as a generalization to the open-surface problem of the classical Calderón formulae. The high-order quadrature rules we introduce for these operators, in turn, resolve the multiple Green function and edge singularities (which occur at arbitrarily close distances from each other, and which include weakly singular as well as hypersingular kernels) and thus give rise to super-algebraically fast convergence as the discretization sizes are increased. When used in conjunction with Krylov-subspace linear algebra solvers such as GMRES, the resulting solvers produce results of high accuracy in small numbers of iterations for low and high frequencies alike. We demonstrate our methodology with a variety of numerical results for screen and aperture problems at high frequencies—including simulation of classical experiments such as the diffraction by a circular disc (featuring in particular the famous Poisson spot), evaluation of interference fringes resulting from diffraction across two nearby circular apertures, as well as solution of problems of scattering by more complex geometries consisting of multiple scatterers and cavities.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Joint Design of Multimodal Transit Networks and Shared Autonomous Mobility Fleets

Providing quality transit service to travelers in low-density areas, particularly travelers without personal vehicles, is a constant challenge for transit agencies. The advent of fully-autonomous vehicles (AVs) and their inclusion in mobility service fleets may allow transit agencies to offer better service and/or reduce their own capital and operational costs. This study focuses on the problem of allocating resources between transit patterns and operating (or subsidizing) shared-use AV mobility services (SAMSs) in a large metropolitan area. To address this question, a joint transit network redesign and SAMS fleet size determination problem (JTNR-SFSDP) is introduced, and a bi-level mathematical programming formulation and solution approach are presented. The upper-level problem modifies a transit network frequency setting problem (TNFSP) formulation via incorporating SAMS fleet size as a decision variable and allowing the removal of bus routes. The lower-level problem consists of a dynamic combined mode choice-traveler assignment problem (DCMC-TAP) formulation. The heuristic solution procedure involves solving the upper-level problem using a nonlinear programming solver and solving the lower-level problem using an iterative agent-based assignment-simulation approach. To illustrate the effectiveness of the modeling framework, this study uses traveler demand from Chicago along with the regions existing multimodal transit network. The computational results indicate significant traveler benefits, in terms of improved average traveler wait times, associated with optimizing the joint design of multimodal transit networks and SAMS fleets compared with the initial transit network design.

bi-level programming↗

A self-consistent field formulation of excited state mean field theory

In this work, we show that, as in Hartree-Fock theory, the orbitals for excited state mean field theory can be optimized via a self-consistent one-electron equation in which electron-electron repulsion is accounted for through mean field operators. In addition to showing that this excited state ansatz is sufficiently close to a mean field product state to admit a one-electron formulation, this approach brings the orbital optimization speed to within roughly a factor of two of ground state mean field theory. The approach parallels Hartree Fock theory in multiple ways, including the presence of a commutator condition, a one-electron mean-field working equation, and acceleration via direct inversion in the iterative subspace. When combined with a configuration interaction singles Davidson solver for the excitation coefficients, the self-consistent field formulation dramatically reduces the cost of the theory compared to previous approaches based on quasi-Newton descent.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

PVRD-FASP: A Unified Solver for Modeling Carrier and Defect Transport in Photovoltaic Devices

In our paper, we present a simulator for modeling transport of charge carriers and electrically active defect centers in solar cells by treating them on an equal footing, which allows us to address metastability and reliability issues. The exact nonlinear differential equations set solved by our solver is presented. The formulation of such differential equations, namely the continuity equations, drift-diffusion equation, and Poisson equation, for studying charge and defect transport is explained. The parameters needed for forming the differential equations are taken from first principle calculations. The solver is verified with test cases built on PN heterojunctions, Cu diffusion in single crystal CdTe and comparing Silvaco simulations with our numerical results.

14 SOLAR ENERGY↗

An adaptive discontinuous Petrov-Galerkin method for the Grad-Shafranov equation

In this work, we propose and develop an arbitrary-order adaptive discontinuous Petrov--Galerkin (DPG) method for the nonlinear Grad--Shafranov equation. An ultraweak formulation of the DPG scheme for the equation is given based on a minimal residual method. The DPG scheme has the advantage of providing more accurate gradients compared to conventional finite element methods, which is desired for numerical solutions to the Grad--Shafranov equation. The numerical scheme is augmented with an adaptive mesh refinement approach, and a criterion based on the residual norm in the minimal residual method is developed to achieve dynamic refinement. Nonlinear solvers for the resulting system are explored and a Picard iteration with Anderson acceleration is found to be efficient to solve the system. Finally, the proposed algorithm is implemented in parallel on MFEM using a domain-decomposition approach, and our implementation is general, supporting arbitrary order of accuracy and general meshes. Furthermore, numerical results are presented to demonstrate the efficiency and accuracy of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗

Accelerated iterative calculation of transonic nacelle flowfields

A method is presented for the calculation of inviscid, supercritical flowfields about axisymmetric inlet cowls. A finite-difference calculation is performed in a simple, rectangular domain obtained from the nacelle geometry by a nearly-conformal mapping procedure. Type-dependent finite-differences are constructed using a coordinate-independent, 'rotated' differencing scheme. Methods of accelerating convergence of the iterative solution are demonstrated including a hybrid fast-Poisson-solver/relaxation scheme and an extrapolated relaxation procedure. Calculated pressure distributions are compared with experimental data for a variety of Mach numbers and mass-flow ratios, and show generally good agreement.

Caughey, D. A.↗

Towards an Enhanced Droplet Activation Scheme for Multi-Moment Bulk Microphysics Schemes

Initial droplet spectra produced upon activation impact the ensuing chain of microphysical processes andtherefore play a crucial role in cloud evolution. This work re-examines dependencies of newly formed clouddroplet size distribution (CDSD) characteristics on environmental and aerosol properties via parcel model simulationsthat serve as the basis for a multi-moment bulk microphysics droplet activation scheme suitable for acloud-resolving model (CRM). It is found that applying a fixed size threshold to define activated droplets versusemploying physical considerations can lead to erroneous activation and overly broad CDSDs for high aerosolconcentration and weak updraft conditions. Aerosol distributions characterized by larger median sizes and/orincreased solubility can result in greater activated droplet numbers, whereas impacts of these parameters onCDSD spectral width depend on both aerosol number concentration and updraft velocity. An expansion of theactivation scheme to include CDSD spectral width is proposed to aid efforts to extend high-order momentprediction to cloud droplet categories in CRMs as well as better represent variability in the activation process onthe cloud scale.simulations to investigate the regime dependence of the relative dispersion(d)1 of newly activated CDSDs, where d is the ratio of dropletradius standard deviation (σ) to the mean radius (r ). C16 demonstratedthat increasing Na resulted in increasing (decreasing) d values via reducedcondensational narrowing (spectral broadening) rates within theAL (UL) regime, with d values peaking in the TR regime. Their findingssuggest a similar regime dependence for d as R09 noted for Nc and helpexplain reportedly conflicting relationships between Na and CDSDspectral characteristics (cf. Hudson and Noble, 2014; Liu et al., 2014),although the applicability of these results within bulk microphysicalschemes was not addressed.Simulating aerosol-cloud interactions with CRMs employing bulkmicrophysics requires that the scheme minimally predict two CDSDparameters, namely mass and number concentrations, and represent thedroplet activation process. Various activation schemes aim to determineNc from aerosol and environmental properties and include analyticalexpressions (e.g., Abdul-Razzak et al., 1998; Morrison et al., 2005) aswell as lookup tables (LUTs) based on detailed parcel model calculations(e.g., Saleeby and Cotton, 2004, hereafter SC04; Segal and Khain,2006; Thompson and Eidhammer, 2014). Expressions to diagnose CDSDspectral width from Nc (Grabowski, 1998; Liu et al., 2006; Morrison andGrabowski, 2007) or cloud water content (Geoffroy et al., 2010) havealso been developed, although more robust methods to obtain CDSDspectral width upon activation are presently lacking. This latter point isrelevant for triple-moment (3 M) bulk microphysics that aim to predictdistribution spectral width alongside number and mass concentrations(e.g., Loftus et al., 2014; Milbrandt and Yau, 2005).The current work extends the findings of C16 to the current LUTbasedaerosol activation scheme used in the Regional AtmosphericModeling System (RAMS) (Cotton et al., 2003; SC04; Saleeby and vanden Heever, 2013, hereafter SvdH13) and additionally examinesaerosol size and solubility impacts on newly activated CDSD properties.Because early cloud development processes such as condensationalgrowth, evaporation, and droplet self-collection depend on and impactCDSD spectral width (Hudson and Yum, 1997; Seifert and Beheng 2001;Lu and Seinfeld, 2006; Igel and van den Heever, 2017), an expansion ofthe activation LUTs to include CDSD spectral width is proposed as apreliminary step for extending 3M prediction to CDSDs in CRMs forimproved simulations of aerosol-cloud interactions.2. MethodologyThe current RAMS two-moment microphysics module determinesthe fractional number of aerosol particles that activate to cloud dropletsfrom five-dimensional LUTs based on model predicted air temperature(T), w, Na, and the geometric median radius (rg) and soluble fraction (ε)of the aerosol size distribution (SvdH13). These LUTs are created offlineusing a one-dimensional Lagrangian adiabatic parcel model (Feingoldand Heymsfield, 1992; Heymsfield and Sabin, 1989; SC04) to simulateexplicit droplet activation and initial CDSD growth for a range of ambientatmospheric conditions [T, w] and binned lognormal aerosol sizedistributions given by= ⎡⎣ ⎢− ⎤⎦ ⎥N r Nr π σr rσ( )2 lnexp[ln( / )]2(ln )aggg22 (1)where r is the dry aerosol particle bin radius and σg is the geometricstandard deviation of the distribution. As the parcel model simulationsfocus on the activation process, other processes such as coalescence,sedimentation, and mixing are not considered. Details of the parcelmodel can be found in SC04 and SvdH13, and only a brief description isprovided here. At the onset of parcel model calculations, the initiallydry aerosol particles in all bins first deliquesce and reach theirequilibrium diameters in a sub-saturated environment based on theKöhler equation for solution droplets. The parcel is then lifted at a fixedupward velocity w, and particle growth by vapor diffusion, along withconcurrent changes in the ambient environment, are iteratively computedusing the Variable-coefficient Ordinary Differential Equation(VODE) solver (Brown et al., 1989). The time resolution of these calculationsis determined within the VODE solver, and the frequency atwhich the solver is called is controlled by a longer model time stepbased on fixed upward parcel displacement increments (Δz) at thespecified w (Δt=Δz/w). Model calculations proceed until the parcelreaches a height 50m beyond the level of maximum saturation ratio(Smax) or total parcel displacement exceeds 2 km. Upon model termination,Smax and the fractional number of aerosols (factv) resulting innewly formed cloud droplets, defined as particles having diameters of atleast 2 μm, are cataloged in the LUTs according to the specified T, w, Na,rg, and ε parameter values.A critical point regarding the creation of these LUTs is the use of afixed minimum diameter (Dmin) to define cloud droplets in the parcelmodel, which can produce erroneous CDSD characteristics, particularlywithin the UL regime. For aerosol distributions with large rg valuesunder low SS conditions, for example, deliquesced aerosols within thelarge tail of the distribution can exceed 2 μm in diameter yet remainunactivated as ‘haze’ particles (Levin and Cotton, 2009; McFigganset al., 2006). For this study, aerosol particles activate to cloud dropletsbased on the critical diameter Dcrit as a function of parcel supersaturationratio (Sr) as in R09:D = σ MS RTρ83 ln( ) critsol wr w (2)where σsol is the surface tension of a solution droplet, Mw and ρw are themolar mass and density of liquid water, respectively, and R is theuniversal gas constant. Additionally, at relatively large w values withinthe AL regime, Nc stabilizes shortly after reaching supersaturation.However, parcel ascent and condensational growth continue beyondthe level of Smax, potentially causing additional narrowing of the CDSD.In the current work, model calculations terminate upon reaching Smaxas changes in Nc are negligible with continued ascent (Peng et al., 2007;R09).Parcel model simulations are performed to examine the sensitivitiesof CDSD characteristics to w, Na, rg, and ε, with the ranges for theseparameters listed in Table 1. Aerosols are assumed to be a mix of solubleand insoluble material of equal density, specified by ε, where fullysoluble aerosols correspond to ammonium sulfate with hygroscopicityparameter κ=0.61 (Petters and Kreidenweis, 2007). FollowingSvdH13, aerosol geometric standard deviation is fixed at σg=1.8, andaerosol distributions (Eq. 1) are partitioned into 100 logarithmicallyspacedbins spanning a size range specific to each rg value. For all simulations,Δz=1 m, and initial values of relative humidity, air temperatureand pressure are set to RH=0.99, T=10 °C and p=900 hPa,respectively.

Loftus, Adrian M.↗

Iterated Discontinuity Factors Based on Reference Outgoing Currents for Discontinuous Finite Element Diffusion

We present a novel formulation for iteratively computing Discontinuity Factors (DF) designed to reproduce reference partial outgoing currents at the interface between macro-regions using Discontinuous Galerkin Finite Elements to solve the multigroup neutron diffusion equation. Similarly, an expression for the boundary coefficients (BCf) is proposed to match the partial outgoing current at vacuum boundaries. Upon convergence, macro-region averaged reaction and leakage rates are preserved. In addition, we consider a source-free steady-state problem depending on the DFs. The existence of a non-trivial solution is due to the non-linearity of the problem. This form greatly simplifies the implementation within Rattlesnake and efficiently converges by updating the DFs and BCfs at every linear iteration of the Preconditioned Jacobian-Free Newton-Krylov solver. The main challenge then lies in determining an appropriate scaling factor to ensure that the initial values for the DFs and BCfs are not too far from their converged value. While this factor does not change the final solution, it has the potential to significantly affect convergence, for purely numerical reasons. An expression based on the reference fission source integral is proposed and satisfying results are presented for problems and compared to Superhomogénéisation (SPH) results with both reflecting and vacuum boundary conditions.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Iterated Discontinuity Factors Based on Reference Outgoing Currents for Discontinuous Finite Element Diffusion

We present a novel formulation for iteratively computing Discontinuity Factors (DF) designed to reproduce reference partial outgoing currents at the interface between macro-regions using Discontinuous Galerkin Finite Elements to solve the multigroup neutron diffusion equation. Similarly, an expression for the boundary coefficients (BCf) is proposed to match the partial outgoing current at vacuum boundaries. Upon convergence, macro-region averaged reaction and leakage rates are preserved. In addition, we consider a source-free steady-state problem depending on the DFs. The existence of a non-trivial solution is due to the non-linearity of the problem. This form greatly simplifies the implementation within Rattlesnake and efficiently converges by updating the DFs and BCfs at every linear iteration of the Preconditioned Jacobian-Free Newton-Krylov solver. The main challenge then lies in determining an appropriate scaling factor to ensure that the initial values for the DFs and BCfs are not too far from their converged value. While this factor does not change the final solution, it has the potential to significantly affect convergence, for purely numerical reasons. An expression based on the reference fission source integral is proposed and satisfying results are presented for problems and compared to Superhomogénéisation (SPH) results with both reflecting and vacuum boundary conditions.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Efficient Gradient-Based Shape Optimization Methodology Using Inviscid/Viscous CFD

The formerly developed preconditioned-biconjugate-gradient (PBCG) solvers for the analysis and the sensitivity equations had resulted in very large error reductions per iteration; quadratic convergence was achieved whenever the solution entered the domain of attraction to the root. Its memory requirement was also lower as compared to a direct inversion solver. However, this memory requirement was high enough to preclude the realistic, high grid-density design of a practical 3D geometry. This limitation served as the impetus to the first-year activity (March 9, 1995 to March 8, 1996). Therefore, the major activity for this period was the development of the low-memory methodology for the discrete-sensitivity-based shape optimization. This was accomplished by solving all the resulting sets of equations using an alternating-direction-implicit (ADI) approach. The results indicated that shape optimization problems which required large numbers of grid points could be resolved with a gradient-based approach. Therefore, to better utilize the computational resources, it was recommended that a number of coarse grid cases, using the PBCG method, should initially be conducted to better define the optimization problem and the design space, and obtain an improved initial shape. Subsequently, a fine grid shape optimization, which necessitates using the ADI method, should be conducted to accurately obtain the final optimized shape. The other activity during this period was the interaction with the members of the Aerodynamic and Aeroacoustic Methods Branch of Langley Research Center during one stage of their investigation to develop an adjoint-variable sensitivity method using the viscous flow equations. This method had algorithmic similarities to the variational sensitivity methods and the control-theory approach. However, unlike the prior studies, it was considered for the three-dimensional, viscous flow equations. The major accomplishment in the second period of this project (March 9, 1996 to March 8, 1997) was the extension of the shape optimization methodology for the Thin-Layer Navier-Stokes equations. Both the Euler-based and the TLNS-based analyses compared with the analyses obtained using the CFL3D code. The sensitivities, again from both levels of the flow equations, also compared very well with the finite-differenced sensitivities. A fairly large set of shape optimization cases were conducted to study a number of issues previously not well understood. The testbed for these cases was the shaping of an arrow wing in Mach 2.4 flow. All the final shapes, obtained either from a coarse-grid-based or a fine-grid-based optimization, using either a Euler-based or a TLNS-based analysis, were all re-analyzed using a fine-grid, TLNS solution for their function evaluations. This allowed for a more fair comparison of their relative merits. From the aerodynamic performance standpoint, the fine-grid TLNS-based optimization produced the best shape, and the fine-grid Euler-based optimization produced the lowest cruise efficiency.

Baysal, Oktay↗

On the Degradation of the Effectiveness of Nonlinear Diffusion Acceleration with Parallel Block Jacobi Splitting

MOOSE's radiation transport module Rattlesnake comprises a first order S N solver that can be accelerated with a flexible Nonlinear Diffusion Acceleration. At each NDA iteration, the streaming and collision operator of the S{sub N} equations are (approximately) inverted using a transport sweep. When executed on multiple processors parallel block Jacobi (PBJ) splitting is utilized lagging the processor sub-domain's incoming angular fluxes making the implemented method asynchronous, i.e. the convergence properties of NDA become dependent on the number of concurrent tasks and details of the partitioning. Within this work, we study the NDA convergence properties for the two-dimensional C5G7 benchmark problem PBJ with p = 1, 2, 4, 8, 12, 16, 24, 32, 48, 60, 72, 96 and 144 concurrent tasks. Rosa studied the convergence properties of PBJ splitting methods with and without transport synthetic acceleration (TSA) in slab geometry and two-dimensional Cartesian geometry, respectively. Rosa's iteration scheme lags both the incoming angular fluxes and the scattering source making it very similar to the method described here. Rosa found by means of Fourier analysis that convergence of unaccelerated PBJ can degrade for optically thin subdomains, i.e. for a large number of processors given a fixed domain size. Depending on the choice of parameters application of TSA can lead to an effective algorithm. In contrast to Rosa's work, this work focuses on PBJ splitting for NDA accelerated solution of the multigroup eigenvalue problem. Later, Zerr and Anistratov used their integral transport matrix method in conjunction with PBJ. This iteration scheme is different as it does not lag the scattering source. Nevertheless, Fourier analysis with Diamond Difference spatial discretization showed that the method degrades with increasing the overall size of the spatial domain while keeping the sub-domain size constant. In the case of an infinite medium, the observed spectral radius becomes unity. These references establish the iterative performance of PBJ for one-group fixed source problems discretized on rectangular cells, but for the Rattlesnake first order NDA method, an emphasis lies on multigroup eigenvalue problems. In this setting, the additional complication arises that the low order equations are not exactly inverted, but only to some iterative criterion. Further, as the low order problem is solved using Jacobian-Free Newton Krylov methods, a suitable preconditioner for the GMRES iterations is required. As the effectiveness of the preconditioners may decrease when more concurrent processes are used, we expect the low order solve to impact the overall effectiveness of the NDA method in parallel execution as well. Therefore, this work focuses on the question of how detrimental the asynchronicity of the high and low order iterative solutions is for the effectiveness of NDA solutions of realistic, unstructured grid, multigroup eigenvalue problems. The iterative convergence properties of Rattlesnake's NDA method for multigroup eigenvalue problems are studied for varying number of concurrent processes. Rattlesnake's NDA method is asynchronous because the high order transport sweep uses PBJ splitting and because the low order solve's preconditioners, algebraic multigrid and additive Schwarz, are asynchronous. We found that up to 144 processes the number of Picard iterations increases by a factor of 2-3 affecting but not destroying NDA's parallel performance for the C5G7 benchmark problem, a representative LWR (light water reactor) configuration. The solution of the NDA low order eigenvalue problem posed greater problems than expected for the solvers currently available in Rattlesnake mainly because of problems to effectively precondition the modified low-order problem. As a matter of fact, the low order problem becomes an advection-diffusion problem. Non-robustness was observed for the AMG preconditioned coarse mesh acceleration for more than 60 concurrent processes, which was fixed by increasing the number of permissible V-cycles per AMG call. For fine mesh acceleration AMG proved to be ineffective and we resorted to ASM. For both AMG and ASM, increasing number of linear iterations per nonlinear are observed when increasing the number of processes, but for ASM this problem appears to be worse. The results from this work also indicate that initial development efforts should be diverted from implementation of a high-order parallel sweeping algorithm to the effective and robust iterative solution of the low order NDA multigroup eigenvalue problem. (authors)

97 MATHEMATICS AND COMPUTING↗

Domain decomposition methods for the parallel computation of reacting flows

Domain decomposition is a natural route to parallel computing for partial differential equation solvers. Subdomains of which the original domain of definition is comprised are assigned to independent processors at the price of periodic coordination between processors to compute global parameters and maintain the requisite degree of continuity of the solution at the subdomain interfaces. In the domain-decomposed solution of steady multidimensional systems of PDEs by finite difference methods using a pseudo-transient version of Newton iteration, the only portion of the computation which generally stands in the way of efficient parallelization is the solution of the large, sparse linear systems arising at each Newton step. For some Jacobian matrices drawn from an actual two-dimensional reacting flow problem, comparisons are made between relaxation-based linear solvers and also preconditioned iterative methods of Conjugate Gradient and Chebyshev type, focusing attention on both iteration count and global inner product count. The generalized minimum residual method with block-ILU preconditioning is judged the best serial method among those considered, and parallel numerical experiments on the Encore Multimax demonstrate for it approximately 10-fold speedup on 16 processors.

Keyes, David E.↗

QCAD Simulation and Optimization of Semiconductor Double Quantum Dots

We present the Quantum Computer Aided Design (QCAD) simulator that targets modeling quantum devices, particularly silicon double quantum dots (DQDs) developed for quantum qubits. The simulator has three differentiating features: (i) its core contains nonlinear Poisson, effective mass Schrodinger, and Configuration Interaction solvers that have massively parallel capability for high simulation throughput, and can be run individually or combined self-consistently for 1D/2D/3D quantum devices; (ii) the core solvers show superior convergence even at near-zero-Kelvin temperatures, which is critical for modeling quantum computing devices; (iii) it couples with an optimization engine Dakota that enables optimization of gate voltages in DQDs for multiple desired targets. The Poisson solver includes MaxwellBoltzmann and Fermi-Dirac statistics, supports Dirichlet, Neumann, interface charge, and Robin boundary conditions, and includes the effect of dopant incomplete ionization. The solver has shown robust nonlinear convergence even in the milli-Kelvin temperature range, and has been extensively used to quickly obtain the semiclassical electrostatic potential in DQD devices. The self-consistent Schrodinger-Poisson solver has achieved robust and monotonic convergence behavior for 1D/2D/3D quantum devices at very low temperatures by using a predictor-correct iteration scheme. The QCAD simulator enables the calculation of dot-to-gate capacitances, and comparison with experiment and between solvers. It is observed that computed capacitances are in the right ballpark when compared to experiment, and quantum confinement increases capacitance when the number of electrons is fixed in a quantum dot. In addition, the coupling of QCAD with Dakota allows to rapidly identify which device layouts are more likely leading to few-electron quantum dots. Very efficient QCAD simulations on a large number of fabricated and proposed Si DQDs have made it possible to provide fast feedback for design comparison and optimization.

77 NANOSCIENCE AND NANOTECHNOLOGY↗