Search NASA⌕ Search

SEARCH · Search NASA

Results for “iterative solver”

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 415 records · Page 23

Face- and Cell-Averaged Nodal-Gradient Approach to Cell-Centered Finite-Volume Method on Mixed Grids

In this paper, the averaged nodal-gradient approach previously developed for triangular grids is extended to mixed triangular-quadrilateral grids. It is shown that the face- averaged approach leads to deteriorated iterative convergence on quadrilateral grids. To develop a convergent solver, we consider cell-averaging instead of face-averaging for quadri- lateral cells. We show that the cell-averaged approach leads to a convergent solver and can be efficiently combined with the face-averaged approach on mixed grids. The method is demonstrated for various inviscid and viscous problems from low to high Mach numbers on two-dimensional mixed grids.

Nishikawa, Hiroaki↗

Diffusion Synthetic Acceleration for Heterogeneous Domains, Compatible with Voids

A standard approach to solving the S N transport equations is to use source iteration with diffusion synthetic acceleration (DSA). Although this approach is widely used and effective on many problems, there remain some practical issues with DSA preconditioning, particularly on highly heterogeneous domains. For large-scale parallel simulation, it is critical that both (a) preconditioned source iteration converges rapidly and (b) the action of the DSA preconditioner can be applied using fast, scalable solvers, such as algebraic multigrid (AMG). For heterogeneous domains, these two interests can be at odds. In particular, there exist DSA diffusion discretizations that can be solved rapidly using AMG, but they do not always yield robust/fast convergence of the larger source iteration. Conversely, there exist robust DSA discretizations where source iteration converges rapidly on difficult heterogeneous problems, but fast parallel solvers like AMG tend to struggle applying the action of such operators. Moreover, very few current methods for the solution of deterministic transport are compatible with voids. This paper develops a new heterogeneous DSA preconditioner based on only preconditioning the optically thick subdomains. The resulting method proves robust on a variety of heterogeneous transport problems, including a linearized hohlraum mesh related to inertial confinement fusion. Moreover, the action of the preconditioner is easily computed using O(1) AMG iterations, convergence of the transport iteration typically requires 2 to 5× fewer iterations than current state-of-the-art “full” DSA, and the proposed method is trivially compatible with voids. On the hohlraum problem, rapid convergence is obtained by preconditioning less than 3% of the mesh elements with five to ten AMG iterations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Solving linear equations with messenger-field and conjugate gradient techniques: An application to CMB data analysis

We discuss linear system solvers invoking a messenger-field and compare them with (preconditioned) conjugate gradient approaches. We show that the messenger-field techniques correspond to fixed point iterations of an appropriately preconditioned initial system of linear equations. We then argue that a conjugate gradient solver applied to the same preconditioned system, or equivalently a preconditioned conjugate gradient solver using the same preconditioner and applied to the original system, will in general ensure at least a comparable and typically better performance in terms of the number of iterations to convergence and time-to-solution. We illustrate our conclusions with two common examples drawn from the cosmic microwave background (CMB) data analysis: Wiener filtering and map-making. In addition, and contrary to the standard lore in the CMB field, we show that the performance of the preconditioned conjugate gradient solver can depend significantly on the starting vector. In conclusion, this observation seems of particular importance in the cases of map-making of high signal-to-noise ratio sky maps and therefore should be of relevance for the next generation of CMB experiments.

79 ASTRONOMY AND ASTROPHYSICS↗

Parallel 3D Multi-Stage Simulation of a Turbofan Engine

A 3D multistage simulation of each component of a modern GE Turbofan engine has been made. An axisymmetric view of this engine is presented in the document. This includes a fan, booster rig, high pressure compressor rig, high pressure turbine rig and a low pressure turbine rig. In the near future, all components will be run in a single calculation for a solution of 49 blade rows. The simulation exploits the use of parallel computations by using two levels of parallelism. Each blade row is run in parallel and each blade row grid is decomposed into several domains and run in parallel. 20 processors are used for the 4 blade row analysis. The average passage approach developed by John Adamczyk at NASA Lewis Research Center has been further developed and parallelized. This is APNASA Version A. It is a Navier-Stokes solver using a 4-stage explicit Runge-Kutta time marching scheme with variable time steps and residual smoothing for convergence acceleration. It has an implicit K-E turbulence model which uses an ADI solver to factor the matrix. Between 50 and 100 explicit time steps are solved before a blade row body force is calculated and exchanged with the other blade rows. This outer iteration has been coined a "flip." Efforts have been made to make the solver linearly scaleable with the number of blade rows. Enough flips are run (between 50 and 200) so the solution in the entire machine is not changing. The K-E equations are generally solved every other explicit time step. One of the key requirements in the development of the parallel code was to make the parallel solution exactly (bit for bit) match the serial solution. This has helped isolate many small parallel bugs and guarantee the parallelization was done correctly. The domain decomposition is done only in the axial direction since the number of points axially is much larger than the other two directions. This code uses MPI for message passing. The parallel speed up of the solver portion (no 1/0 or body force calculation) for a grid which has 227 points axially.

Turner, Mark G.↗

DS-TIDE: Harnessing Dynamical Systems for Efficient Time-Independent Differential Equation Solving

Time-Independent Differential Equations (TIDEs) are central to modeling equilibrium behavior across a wide range of scientific and engineering domains, from electrostatics to porous media flow. Conventional numerical solvers offer reliable solutions but incur significant computational costs due to fine-grained discretization and iterative procedures. Machine learning-based approaches address this by replacing iterative solving processes with one-time inference; however, their sophisticated models require extensive training resources that often exceed those of traditional solvers. Consequently, designing a TIDE solver that achieves high accuracy, broad applicability, and exceptional computational efficiency remains a fundamental challenge. In this paper, we propose DS-TIDE, a novel hardware solver that is inspired by, and subsequently leverages, the intrinsic connection between Dynamical Systems (DS) and Differential Equations (DEs) to efficiently and accurately solve TIDEs. DS-TIDE employs a CMOS-compatible DS-based processor, whose physical states evolve under carefully designed DE-driven dynamics and naturally converge to equilibrium -- the solution of the target TIDE -- within ~1µs on a ~1-watt DS-TIDE processor. To enhance expressivity, DS-TIDE incorporates Heterogeneous Dynamics with Temporal Layering (HDTL), which solves TIDEs through a three-stage DS evolution -- conditioning, solving, and decoding -- each governed by specialized dynamics. The entire evolution process is analogous to an infinitely deep neural network temporally unrolled, offering the system the capability of representing complex equations. Furthermore, DS-TIDE is equipped with an on-device DS-DE Auto-Alignment mechanism that dynamically adapts intrinsic hardware dynamics within milliseconds, effectively aligning the system’s dynamics to diverse target DEs. Experimental results across TIDEs from a wide range of scientific and engineering domains demonstrate that DS-TIDE achieves ~10^3× speedup, ~10^5× energy savings, and competitive or superior accuracy compared to state-of-the-art numerical and ML-based solvers.

Liu, Chuan↗

Combining Sparse Approximate Factorizations with Mixed-precision Iterative Refinement

The standard LU factorization-based solution process for linear systems can be enhanced in speed or accuracy by employing mixed-precision iterative refinement. Most recent work has focused on dense systems. We investigate the potential of mixed-precision iterative refinement to enhance methods for sparse systems based on approximate sparse factorizations. In doing so, we first develop a new error analysis for LU- and GMRES-based iterative refinement under a general model of LU factorization that accounts for the approximation methods typically used by modern sparse solvers, such as low-rank approximations or relaxed pivoting strategies. We then provide a detailed performance analysis of both the execution time and memory consumption of different algorithms, based on a selected set of iterative refinement variants and approximate sparse factorizations. Our performance study uses the multifrontal solver MUMPS, which can exploit block low-rank factorization and static pivoting. We evaluate the performance of the algorithms on large, sparse problems coming from a variety of real-life and industrial applications showing that mixed-precision iterative refinement combined with approximate sparse factorization can lead to considerable reductions of both the time and memory consumption.

97 MATHEMATICS AND COMPUTING↗

A scalable multidimensional fully implicit solver for Hall magnetohydrodynamics

We propose an optimally performant fully implicit algorithm for the Hall magnetohydrodynamics (HMHD) equations based on multigrid-preconditioned Jacobian-free Newton-Krylov methods. HMHD is a challenging system to solve numerically because it supports stiff fast dispersive waves. The preconditioner is formulated using an operator-split approximate block factorization (Schur complement), informed by physics insight. We use a vector-potential formulation (instead of a magnetic field one) to allow a clean segregation of the problematic $\nabla$ x $\nabla$ x operator in the electron Ohm's law subsystem. This segregation allows the formulation of an effective damped block-Jacobi smoother for multigrid. We demonstrate by analysis that our proposed block-Jacobi iteration is convergent and has the smoothing property. The resulting HMHD solver is verified linearly with wave propagation examples, and nonlinearly with the GEM challenge reconnection problem by comparison against another HMHD code. We demonstrate the excellent algorithmic and parallel performance of the algorithm up to 16384 MPI tasks in two dimensions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

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.↗