Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical solution”

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 37 records · Page 2

Probability of Initiation in Neutron Transport

We discuss the numerical solution of the nonlinear integro-differential equation for the probability of a divergent neutron chain in a stationary system (i.e., the probability of initiation (POI)). We follow the development described in Bell’s classic paper on the stochastic theory of neutron transport. As noted by Bell, the linearized form of this equation resembles the linear adjoint neutron transport equation. A matrix formalism for the discretized steady state (or forward) neutron equation in slab geometry is first developed and is then used to derive the discrete adjoint equation. A main advantage of this discrete development is that the resulting discrete adjoint equation does not depend upon how the multigroup cross sections for the forward problem are obtained. That is, we derive the discrete adjoint directly from the discrete forward equations rather than discretizing directly the adjoint equation. This also guarantees that the discrete adjoint operator is consistent with the inner product used to define the adjoint operator. We discuss three approaches for the numerical solution of the POI equations, and present numerical results on several test problems. The three solution methods are a simple fixed-point iteration, a second approach that is akin to a nonlinear Power iteration, and a third approach which uses a Newton-Krylov nonlinear solver. We also give sufficient conditions to guarantee the existence and uniqueness of nontrivial solutions to our discrete POI equations when the discrete system is supercritical, and that only the trivial solution exists when the discrete system is subcritical. Our approach is modeled after the analysis presented for the continuous POI equations by Mokhtar-Kharroubi and Jarmouni-Idrissi, and by Pazy and Rabinowitz.

42 ENGINEERING↗

Tensor Network Space-Time Spectral Collocation Method for Time-Dependent Convection-Diffusion-Reaction Equations

Emerging tensor network techniques for solutions of partial differential equations (PDEs), known for their ability to break the curse of dimensionality, deliver new mathematical methods for ultra-fast numerical solutions of high-dimensional problems. Here, we introduce a Tensor Train (TT) Chebyshev spectral collocation method, in both space and time, for the solution of the time-dependent convection-diffusion-reaction (CDR) equation with inhomogeneous boundary conditions, in Cartesian geometry. Previous methods for numerical solution of time-dependent PDEs often used finite difference for time, and a spectral scheme for the spatial dimensions, which led to a slow linear convergence. Spectral collocation space-time methods show exponential convergence; however, for realistic problems they need to solve large four-dimensional systems. We overcome this difficulty by using a TT approach, as its complexity only grows linearly with the number of dimensions. We show that our TT space-time Chebyshev spectral collocation method converges exponentially, when the solution of the CDR is smooth, and demonstrate that it leads to a very high compression of linear operators from terabytes to kilobytes in TT-format, and a speedup of tens of thousands of times when compared to a full-grid space-time spectral method. These advantages allow us to obtain the solutions at much higher resolutions.

97 MATHEMATICS AND COMPUTING↗

Solution Irregularity Remediation for Spatial Discretization Error Estimation for S N Transport Solutions

The discrete ordinates linear Boltzmann transport equation is typically solved in its spatially discretized form, incurring spatial discretization error. Quantification of this error for purposes such as adaptive mesh refinement or error analysis requires an a posteriori estimator, which utilizes the numerical solution to the spatially discretized equation to compute an estimate. Because the quality of the numerical solution informs the error estimate, irregularities, present in the true solution for any realistic problem configuration, tend to cause the largest deviation in the error estimate vis-a-vis the true error. In this paper, an analytical partial singular characteristic tracking (pSCT) procedure for reducing the estimator’s error is implemented within our novel residual source estimator for a zeroth-order discontinuous Galerkin scheme, at the additional cost of a single inner iteration. Here, a metric-based evaluation of the pSCT scheme versus the standard residual source estimator is performed over the parameter range of a Method of Manufactured Solutions test suite. The pSCT scheme generates near-ideal accuracy in the estimate in problems where the dominant source of the estimator’s error is the solution irregularity, namely, problems where the true solution is discontinuous and problems where the true solution’s first derivative is discontinuous and the scattering ratio is low. In problems where the scattering ratio is high and the true solution is discontinuous in the first derivative, the error in the scattering source, which is not converged by the pSCT scheme, is greater than the error incurred due to the irregularity. Ultimately, a pSCT scheme is judged to be useful for error estimation in problems where the computational cost of the scheme is justified. In the presence of many irregularities, such a scheme may be intractable for general use, but in benchmarks, as an analytical tool, or in problems that have nondissipative discontinuities, the scheme may prove invaluable.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Fast multiscale contrast independent preconditioners for linear elastic topology optimization problems

The goal of this work is to present a fast and viable approach for the numerical solution of the high-contrast state problems arising in topology optimization. The optimization process is iterative, and the gradients are obtained by an adjoint analysis, which requires the numerical solution of large high-contrast linear elastic problems with features spanning several length scales. The size of the discretized problems forces the utilization of iterative linear solvers with solution time dependent on the quality of the preconditioner. The lack of clear separation between the scales, as well as the high-contrast, imposes severe challenges on the standard preconditioning techniques. Thus, here we propose new methods for the high-contrast elasticity equation with performance independent of the high-contrast and the multi-scale structure of the elasticity problem. The solvers are based on two-levels domain decomposition techniques with a carefully constructed coarse level to deal with the high-contrast and multi-scale nature of the problem. The construction utilizes spectral equivalence between scalar diffusion and each displacement block of the elasticity problems and, in contrast to previous solutions proposed in the literature, is able to select the appropriate dimension of the coarse space automatically. The new methods inherit the advantages of domain decomposition techniques, such as easy parallelization and scalability. Finally, the presented numerical experiments demonstrate the excellent performance of the proposed methods.

97 MATHEMATICS AND COMPUTING↗

Optimal Droop Setting for Congestion Reduction in a 100% Grid-Forming Inverter-based Power System

he high penetration of inverter-based resources (IBRs) introduces new challenges to power systems due to the complex inverter control. However, IBRs can be configured to maximize their benefits to improve system resilience and reliability. This paper proposes a steady-state optimization model that aims to mitigate transmission congestion in a 100% grid- forming (GFM) IBR-based power system. This goal is achieved by determining the optimal droop settings for the GFM IBRs under different congestion conditions due to renewable energy and load variations. The numerical solution is rigorously verified by a high-fidelity model of the IEEE 39-bus test system with detailed GFM IBR control in the time-domain electromagnetic transient (EMT) simulation tool PSCAD. The numerical solution and simulation results show a significant congestion reduction while meeting all other operating requirements. It is also observed that the numerical solving time is substantially less compared to the EMT simulation time.

Nguyen, Quan H.↗

A fast Fourier transform-based solver for elastic micropolar composites

This work presents a spectral micromechanical formulation for obtaining the full-field and homogenized response of elastic micropolar composites. The algorithm relies on a coupled set of convolution integral equations for the micropolar strains, where periodic Green’s operators associated with a linear homogeneous reference medium are convolved with functions of the Cauchy and couple stress fields that encode the material’s heterogeneity, as well as any potential material nonlinearity. Such convolution integral equations take an algebraic form in the reciprocal Fourier space that can be solved iteratively. In this vein, the fast Fourier transform (FFT) algorithm is leveraged to accelerate the numerical solution, resulting in a mesh-free formulation in which the periodic unit cell representing the heterogeneous material can be discretized by a regular grid of pixels in two dimensions (or voxels in three dimensions). For verification, the numerical solutions obtained with the micropolar FFT solver are compared with analytical solutions for a matrix with a dilute circular inclusion subjected to plane strain loading. The developed computational framework is then used to study length-scale effects and effective (micropolar) moduli of composites with various topological configurations.

97 MATHEMATICS AND COMPUTING↗

Assessment of the hydromechanical higher-order MPM for the simulation of geotechnical problems

The Material Point Method (MPM) has been increasingly used to simulate large strain deformations. Linear interpolation functions are commonly used to perform the spatial integration. It is well-known that the discontinuities in the interpolation function derivatives induce shock-like artifacts known as ‘cell-crossing’ error. These errors compound with volumetric locking errors when used with hydromechanical formulations for porous media, where different velocity fields are used for each phase. The capabilities of higher-order MPM frameworks have not been explored for real-scale geotechnical problems. As such, this paper aims to assess, validate, and further discuss a higher-order B-spline MPM (BS-MPM) framework. First, the BS-MPM framework is verified against the large-strain oedometer consolidation problem. Second, the framework is validated against a real-scale slope failure experiment triggered by pore water pressure recharge. Landslide features that are captured using the higher-order framework are specifically highlighted, and results (e.g., pore water pressure and deformation) are validated with field measurements. A generally convergent numerical solution is observed when using cubic interpolation functions. Third, a footing penetration problem is simulated using the multi-patch BS-MPM. Trends are examined with respect to penetration velocity and variation in hydraulic conductivity. The BS-MPM framework ultimately presents a stabilized numerical solution that captures plausible hydromechanical interaction trends important in geotechnical engineering applications.

36 MATERIALS SCIENCE↗

Closed Loop Geothermal Working Group: GeoCLUSTER App, Subsurface Simulation Results, and Publications

To better understand the heat production, electricity generation performance, and economic viability of closed-loop geothermal systems in hot-dry rock, the Closed-Loop Geothermal Working Group -- a consortium of several national labs and academic institutions has tabulated time-dependent numerical solutions and levelized cost results of two popular closed-loop heat exchanger designs (u-tube and co-axial). The heat exchanger designs were evaluated for two working fluids (water and supercritical CO2) while varying seven continuous independent parameters of interest (mass flow rate, vertical depth, horizontal extent, borehole diameter, formation gradient, formation conductivity, and injection temperature). The corresponding numerical solutions (approximately 1.2 million per heat exchanger design) are stored as multi-dimensional HDF5 datasets and can be queried at off-grid points using multi-dimensional linear interpolation. A Python script was developed to query this database and estimate time-dependent electricity generation using an organic Rankine cycle (for water) or direct turbine expansion cycle (for CO2) and perform a cost assessment. This document aims to give an overview of the HDF5 database file and highlights how to read, visualize, and query quantities of interest (e.g., levelized cost of electricity, levelized cost of heat) using the accompanying Python scripts. Details regarding the capital, operation, and maintenance and levelized cost calculation using the techno-economic analysis script are provided. This data submission will contain results from the Closed Loop Geothermal Working Group study that are within the public domain, including publications, simulation results, databases, and computer codes. GeoCLUSTER is a Python-based web application created using Dash, an open-source framework built on top of Flask that streamlines the building of data dashboards. GeoCLUSTER provides users with a collection of interactive methods for streamlining the exploration and visualization of an HDF5 dataset. The GeoCluster app and database are contained in the compressed file geocluster_vx.zip, where the "x" refers to the version number. For example, geocluster_v1.zip is Version 1 of the app. This zip file also contains installation instructions. **To use the GeoCLUSTER app in the cloud, click the link to "GeoCLUSTER on AWS" in the Resources section below. To use the GeoCLUSTER app locally, download the geocluster_vx.zip to your computer and uncompress this file. When uncompressed this file comprises two directories and the geocluster_installation.pdf file. The geo-data app contains the HDF5 database in condensed format, and the GeoCLUSTER directory contains the GeoCLUSTER app in the subdirectory dash_app, as app.py. The geocluster_installation.pdf file provides instructions on installing Python, the needed Python modules, and then executing the app.

15 GEOTHERMAL ENERGY↗

Tabulated Database of Closed-Loop Geothermal Systems Performance for Cloud-Based Technical and Economic Modeling of Heat Production and Electricity Generation: Preprint

To better understand the heat production, electricity generation performance and economic viability of closed loop geothermal systems in hot-dry-rock, the Closed Loop Geothermal Group, a consortium of several national labs and academic institutions has tabulated time-dependent numerical solutions and levelized cost results of two popular closed loop heat exchanger designs (u-tube and co-axial). The heat exchanger designs were evaluated for two working fluids (water and super-critical CO2) while varying seven continuous independent parameters of interest (i.e., mass flow rate, vertical depth, horizontal extent, borehole diameter, formation gradient, formation conductivity, and injection temperature). The corresponding numerical solutions (approximately 1.2 million per heat exchanger design) are stored as multi-dimensional HDF5 datasets and can be queried at off-grid points using multi-dimensional linear interpolation. A Python script was developed to query this database and estimate time-dependent electricity generation using an Organic Rankine cycle (for water) or direct turbine expansion cycle (for CO2) and perform a cost assessment. This document aims to give an overview of the HDF5 database file and highlights how to read, visualize, and query quantities of interest (e.g., levelized cost of electricity, levelized cost of heat) using the accompanying python scripts. Details regarding the capital, operation, and maintenance and levelized cost calculation using the TEA (techno-economic analysis) script are provided.

co-axial↗

Using dynamic mode decomposition to predict the dynamics of a two-time non-equilibrium Green’s function

Computing the numerical solution of the Kadanoff–Baym equations, a set of nonlinear integral differential equations satisfied by the two-time Green's functions derived from many-body perturbation theory for a quantum many-body system away from equilibrium, is a challenging task. Recently, we have successfully applied dynamic mode decomposition (DMD) to construct a data driven reduced order model that can be used to extrapolate the time-diagonal of a two-time Green's function from numerical solutions of the KBE within a small time window. In this paper, we extend the previous work and use DMD to predict off-diagonal elements of the two-time Green's function. We partition the two-time Green's function into a number of one-time functions along the diagonal and subdiagonals of the two-time window as well as in horizontal and vertical directions. We use DMD to construct separate reduced order models to predict the dynamics of these one-time functions in a two-step procedure. We extrapolate along diagonal and several subdiagonals within a subdiagonal band of a two-time window in the first step. In the second step, we use DMD to extrapolate the Green's function outside of the sub-diagonal band. In conclusion, we demonstrate the efficiency and accuracy of this approach by applying it to a two-band Hubbard model problem.

97 MATHEMATICS AND COMPUTING↗

A Block-Structured Adaptive Mesh Framework to Solve Radiation Transfer Equation in Irregular Embedded Geometries

Radiation transport arises in various scientific, industrial, and medical fields, and understanding its effect in applications is needed to make accurate predictions, safety assessments and performance optimizations. Solving the Radiation Transport Equation (RTE) is challenging due to its integro-differential nature, which involves both differential and integral terms. The differential term describes the change in radiation intensity due to absorption and emission, while the integral term accounts for scattering. The accurate modeling of radiation is further complicated in many applications due to the complex, irregular geometries. Various methods exist for solving the RTE, including the zonal, Monte Carlo, spherical harmonics, discrete ordinates, and finite volume methods. Traditional mesh-based approaches, which rely on structured or unstructured meshes, struggle with irregular geometries due to: a) the difficulty of conforming structured grids to irregular domains, b) challenges in enforcing boundary conditions correctly, and c) the additional computational cost of unstructured mesh methods. This work presents a second-order accurate method for solving the RTE in irregular geometries. The radiation intensity is discretized using the finite-volume method in both spatial and angular directions on regular Cartesian grid blocks. Leveraging the block-structured adaptive mesh refinement (AMR) framework provided by AMReX, our method refines the grid locally to reduce spatial discretization error, ensuring a converged numerical solution while minimizing computational costs elsewhere. A two-stage deferred correction approach is employed: First, a first-order discretization on grid blocks is solved using an algebraic multigrid method in HYPRE. Second, a correction term is applied explicitly to achieve second-order accuracy. The correction term is calculated by approximating the radiation flux on cell faces using a Total Variation Diminishing (TVD) scheme. This approach ensures quick convergence of the multigrid method while preserving higher-order accuracy of the numerical solution. Irregular geometries are resolved as embedded boundaries (EB), resulting in both cut cells and regular cells. In cut cells, we modify the fluxes using face fractions and incorporate additional contributions from EB boundary conditions. To ensure higher-order convergence near the EB interface, the correction term is modified by interpolating the radiation intensity to fictitious ghost points. The implementation takes advantage of modern supercomputers by leveraging AMReX’sMPI/X parallelization strategy where X can be MPI or a GPU accelerator including CUDA, HIP and DPC++. We validate our solver using classical test cases, both with and without EB, demonstrating accuracy and efficiency. Additionally, we analyze the impact of adaptive mesh refinement on solution accuracy and computational cost, highlighting the advantages of our approach for high-resolution radiation transport simulations.

computational fluid dynamics (CFD)↗

Physics-based adaptivity of a spectral method for the Vlasov–Poisson equations based on the asymmetrically-weighted Hermite expansion in velocity space

We propose a spectral method for the 1D-1V Vlasov–Poisson system where the discretization in velocity space is based on asymmetrically-weighted Hermite functions, dynamically adapted via a scaling α and shifting u of the velocity variable. Specifically, at each time instant an adaptivity criterion selects new values of α and u based on the numerical solution of the discrete Vlasov–Poisson system obtained at that time step. Once the new values of the Hermite parameters α and u are fixed, the Hermite expansion is updated and the discrete system is further evolved for the next time step. The procedure is applied iteratively over the desired temporal interval. The key aspects of the adaptive algorithm are: the map between approximation spaces associated with different values of the Hermite parameters that preserves total mass, momentum and energy; and the adaptivity criterion to update α and u based on physics considerations relating the Hermite parameters to the average velocity and temperature of each plasma species. For the discretization of the spatial coordinate, we rely on Fourier functions and use the implicit midpoint rule for time stepping. The resulting numerical method possesses intrinsically the property of fluid-kinetic coupling, where the low-order terms of the expansion are akin to the fluid moments of a macroscopic description of the plasma, while kinetic physics is retained by adding more spectral terms. Moreover, the scheme features conservation of total mass, momentum and energy associated in the discrete, for periodic boundary conditions. A set of numerical experiments confirms that the adaptive method outperforms the non-adaptive one in terms of accuracy and stability of the numerical solution.

97 MATHEMATICS AND COMPUTING↗

Deep Learning Approaches to Surrogates for Solving the Diffusion Equation for Mechanistic Real-World Simulations

In many mechanistic medical, biological, physical, and engineered spatiotemporal dynamic models the numerical solution of partial differential equations (PDEs), especially for diffusion, fluid flow and mechanical relaxation, can make simulations impractically slow. Biological models of tissues and organs often require the simultaneous calculation of the spatial variation of concentration of dozens of diffusing chemical species. One clinical example where rapid calculation of a diffusing field is of use is the estimation of oxygen gradients in the retina, based on imaging of the retinal vasculature, to guide surgical interventions in diabetic retinopathy. Furthermore, the ability to predict blood perfusion and oxygenation may one day guide clinical interventions in diverse settings, i.e., from stent placement in treating heart disease to BOLD fMRI interpretation in evaluating cognitive function (Xie et al., 2019; Lee et al., 2020). Since the quasi-steady-state solutions required for fast-diffusing chemical species like oxygen are particularly computationally costly, we consider the use of a neural network to provide an approximate solution to the steady-state diffusion equation. Machine learning surrogates, neural networks trained to provide approximate solutions to such complicated numerical problems, can often provide speed-ups of several orders of magnitude compared to direct calculation. Surrogates of PDEs could enable use of larger and more detailed models than are possible with direct calculation and can make including such simulations in real-time or near-real time workflows practical. Creating a surrogate requires running the direct calculation tens of thousands of times to generate training data and then training the neural network, both of which are computationally expensive. Often the practical applications of such models require thousands to millions of replica simulations, for example for parameter identification and uncertainty quantification, each of which gains speed from surrogate use and rapidly recovers the up-front costs of surrogate generation. We use a Convolutional Neural Network to approximate the stationary solution to the diffusion equation in the case of two equal-diameter, circular, constant-value sources located at random positions in a two-dimensional square domain with absorbing boundary conditions. Such a configuration caricatures the chemical concentration field of a fast-diffusing species like oxygen in a tissue with two parallel blood vessels in a cross section perpendicular to the two blood vessels. To improve convergence during training, we apply a training approach that uses roll-back to reject stochastic changes to the network that increase the loss function. The trained neural network approximation is about 1000 times faster than the direct calculation for individual replicas. Because different applications will have different criteria for acceptable approximation accuracy, we discuss a variety of loss functions and accuracy estimators that can help select the best network for a particular application. We briefly discuss some of the issues we encountered with overfitting, mismapping of the field values and the geometrical conditions that lead to large absolute and relative errors in the approximate solution.

60 APPLIED LIFE SCIENCES↗

Physics-Informed Neural Network Solution of Point Kinetics Equations for a Nuclear Reactor Digital Twin

A digital twin (DT) for nuclear reactor monitoring can be implemented using either a differential equations-based physics model or a data-driven machine learning model. The challenge of a physics-model-based DT consists of achieving sufficient model fidelity to represent a complex experimental system, whereas the challenge of a data-driven DT consists of extensive training requirements and a potential lack of predictive ability. We investigate the performance of a hybrid approach, which is based on physics-informed neural networks (PINNs) that encode fundamental physical laws into the loss function of the neural network. We develop a PINN model to solve the point kinetic equations (PKEs), which are time-dependent, stiff, nonlinear, ordinary differential equations that constitute a nuclear reactor reduced-order model under the approximation of ignoring spatial dependence of the neutron flux. The PINN model solution of PKEs is developed to monitor the start-up transient of Purdue University Reactor Number One (PUR-1) using experimental parameters for the reactivity feedback schedule and the neutron source. The results demonstrate strong agreement between the PINN solution and finite difference numerical solution of PKEs. We investigate PINNs performance in both data interpolation and extrapolation. For the test cases considered, the extrapolation errors are comparable to those of interpolation predictions. Extrapolation accuracy decreases with increasing time interval.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Sparse adaptive basis set methods for solution of the time dependent Schrodinger equation

Scalable numerical solutions to the time dependent Schrodinger equation remain an outstanding goal in theoretical chemistry. Here we present a method which utilises recent breakthroughs in signal processing to consistently adapt a dictionary of basis functions to the dynamics of the system. Further, we show that for two low-dimensional model problems the size of the basis set does not grow quickly with time and appears only weakly dependent on dimensionality. The generality of this finding remains to be seen. The method primarily uses energies and gradients of the potential, opening the possibility for its use in on-the-fly ab initio quantum wavepacket dynamics.

74 ATOMIC AND MOLECULAR PHYSICS↗

High Order Implicit Residual-Based Spatial Discretization Error Estimation for S N Neutron Transport

This work demonstrates our novel residual source spatial discretization error estimator (LeR/TEAD) for a DGFEM-1 discretization and assesses it along with two contemporary estimators, Ragusa and Wang's h -refinement estimator (RW) and Duo, Azmy, and Zikatanov's explicit residual-based estimator (DAZ), on a suite of Method of Manufactured Solutions (MMS) 2D problems and three realistic problem geometries. LeR/TE-AD is attractive because it directly estimates the local error in the angular flux, as opposed to a mere indicator of the error's behavior, on the same mesh and method order as the original numerical solution, thus typically being less computationally intensive than a refinement-based method. On the MMS suite, LeR/TE-AD consistently displayed a reduced performance versus its DGFEM-0 results in terms of accuracy and precision metrics, though it was not typically grossly inaccurate. This is attributed to the irregularities in the true solution across singular characteristics limiting the local accuracy of the numerical flux solution, leading to poor derivative approximations used in the residual approximations. The error transport problem then spreads the error in the residual to nearby cells, causing a greater degree of imprecision that did not afflict DAZ or RW. In testing the estimators on realistic problem geometries, however, LeR/TE-AD fared better. In practice, the true error is much larger in non-idealized geometries like in MMS, and a superlinear true solution means that RW and DAZ are not beneficially biased for DGFEM-1 error estimation. LeR/TE-AD was typically first or second in accuracy, primarily competing with RW, but the latter usually consumed 2-4 times the computational time as LeR/TE-AD, and requires a solution with four times as many unknowns. Furthermore, RW and LeR/TE-AD can be used to compute direct estimates of the error in any quantity of interest that is based on the angular ux solution, such as the fission rate density in a fuel pin, whereas DAZ requires a heuristic extension due to its norm-based nature.

97 MATHEMATICS AND COMPUTING↗

An adaptive Hessian approximated stochastic gradient MCMC method

Bayesian approaches have been successfully integrated into training deep neural networks. One popular family is stochastic gradient Markov chain Monte Carlo methods (SG-MCMC), which have gained increasing interest due to their ability to handle large datasets and the potential to avoid overfitting. Although standard SG-MCMC methods have shown great performance in a variety of problems, they may be inefficient when the random variables in the target posterior densities have scale differences or are highly correlated. Here, we present an adaptive Hessian approximated stochastic gradient MCMC method to incorporate local geometric information while sampling from the posterior. The idea is to apply stochastic approximation (SA) to sequentially update a preconditioning matrix at each iteration. The preconditioner possesses second-order information and can guide the random walk of a sampler efficiently. Instead of computing and saving the full Hessian of the log posterior, we use limited memory of the samples and their stochastic gradients to approximate the inverse Hessian-vector multiplication in the updating formula. Moreover, by smoothly optimizing the preconditioning matrix via SA, our proposed algorithm can asymptotically converge to the target distribution with a controllable bias under mild conditions. To reduce the training and testing computational burden, we adopt a magnitude-based weight pruning method to enforce the sparsity of the network. Our method is user-friendly and demonstrates better learning results compared to standard SG-MCMC updating rules. The approximation of inverse Hessian alleviates storage and computational complexities for large dimensional models. Numerical experiments are performed on several problems, including sampling from 2D correlated distribution, synthetic regression problems, and learning the numerical solutions of heterogeneous elliptic PDE. The numerical results demonstrate great improvement in both the convergence rate and accuracy.

97 MATHEMATICS AND COMPUTING↗

Average-atom model with Siegert states

In plasmas, electronic states can be well-localized bound states or itinerant free states, or something in between. In self-consistent treatments of plasma electronic structure such as the average-atom model, all states must be accurately resolved in order to achieve a converged numerical solution. Furthermore, this is a challenging numerical and algorithmic problem in large part due to the continuum of free states which is relatively expensive and difficult to resolve accurately. Siegert states are an appealing alternative. They form a complete eigenbasis with a purely discrete spectrum while still being equivalent to a representation in terms of the usual bound states and free states. However, many of their properties are unintuitive, and it is not obvious that they are suitable for self-consistent plasma electronic structure calculations. Here it is demonstrated that Siegert states can be used to accurately solve an average-atom model and offer advantages over the traditional finite-difference approach, including a concrete physical picture of pressure ionization and continuum resonances.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗