Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical algorithm”

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 1,621 records · Page 90

Simulation tools for atom probe tomography: A path for diagnosis and treatment of image degradation

The ideal picture of a near-perfect 3D microscope often presented regarding Atom Probe Tomography faces several issues. These issues degrade the metrological performance of the instrument and find their roots in the phenomena acting at the atomic to the mesoscopic level in the vicinity of the surface of a field emitter. From the field evaporation process at the atomic scale, to the macroscopic scale of the instrument, the path to model the imaging process and to develop more accurate and reliable reconstruction algorithms is not a single lane road. This paper focused on the numerical methods used to understand, treat, and potentially heal imaging issues commonly affecting the data in atom probe experiments. A lot of room for improvement exists in solving accuracy problems observed in complex materials by means of purely electrostatic models describing the image formation in a classical approach. Looking at the sample at the atomic scale, the phenomena perturbing the imaging process are subtle. An examination of atomic scale modifications of the sample surface in the presence of a high surface electric field is therefore mandatory. Atomic scale molecular dynamic models integrating the influence of the high surface electric are being developed with this aim. It is also demonstrated that the complex behavior of atoms and molecules in high fields, and consequences on collected data, can be understood through the use of accurate ab-initio models modified to include the impact of the extreme surface electric field.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Feedback-based quantum algorithms for ground state preparation

The ground state properties of quantum many-body systems are a subject of interest across chemistry, materials science, and physics. Thus, algorithms for finding ground states can have broad impacts. Variational quantum algorithms are one class of ground state algorithms that has received significant attention in recent years. These algorithms utilize a hybrid quantum-classical computing framework to prepare ground states on quantum computers. However, this requires solving a classical optimization problem that can become prohibitively expensive in high dimensions. Here, we develop formulations of feedback-based quantum algorithms for ground state preparation that can be used to address this challenge for two broad classes of Hamiltonians: Fermi-Hubbard Hamiltonians, and molecular Hamiltonians represented in second quantization. Feedback-based quantum algorithms are optimization-free; in place of classical optimization, quantum circuit parameters are set according to a deterministic feedback law derived from quantum Lyapunov control principles. This feedback law guarantees a monotonic improvement in solution quality with respect to the depth of the quantum circuit. A variety of numerical illustrations are provided that analyze the convergence and robustness of feedback-based quantum algorithms for these problem classes. Published by the American Physical Society 2024

Larsen, James B. (ORCID:000000020777440X)↗

THE CONVERGENCE OF PARTICLE-IN-CELL SCHEMES FOR COSMOLOGICAL DARK MATTER SIMULATIONS

Particle methods are a ubiquitous tool for solving the Vlasov–Poisson equation in comoving coordinates, which is used to model the gravitational evolution of dark matter (DM) in an expanding universe. However, these methods are known to produce poor results on idealized test problems, particularly at late times, after the particle trajectories have crossed. To investigate this, we have performed a series of one- and two-dimensional “Zel’dovich pancake” calculations using the popular particle-in-cell (PIC) method. We find that PIC can indeed converge on these problems provided that the following modifications are made. The first modification is to regularize the singular initial distribution function by introducing a small but finite artificial velocity dispersion. This process is analogous to artificial viscosity in compressible gas dynamics, and, as with artificial viscosity, the amount of regularization can be tailored so that its effect outside of a well-defined region—in this case, the high-density caustics—is small. The second modification is the introduction of a particle remapping procedure that periodically reexpresses the DM distribution function using a new set of particles. We describe a remapping algorithm that is third-order accurate and adaptive in phase space. This procedure prevents the accumulation of numerical errors in integrating the particle trajectories from growing large enough to significantly degrade the solution. Once both of these changes are made, PIC converges at second order on the Zel’dovich pancake problem, even at late times, after many caustics have formed. Furthermore, the resulting scheme does not suffer from the unphysical, small-scale “clumping” phenomenon known to occur on the pancake problem when the perturbation wavevector is not aligned with one of the Cartesian coordinate axes.

79 ASTRONOMY AND ASTROPHYSICS↗

Pencil Beam Algorithms Are Unsuitable for Proton Dose Calculations in Lung

Purpose: To compare analytic and Monte Carlo–based algorithms for proton dose calculations in the lung, benchmarked against anthropomorphic lung phantom measurements. Methods and Materials: A heterogeneous anthropomorphic moving lung phantom has been irradiated at numerous proton therapy centers. At 5 centers the treatment plan could be calculated with both an analytic and Monte Carlo algorithm. The doses calculated in the treatment plans were compared with the doses delivered to the phantoms, which were measured using thermoluminescent dosimeters and film. Point doses were compared, as were planar doses using a gamma analysis. Results: The analytic algorithms overestimated the dose to the center of the target by an average of 7.2%, whereas the Monte Carlo algorithms were within 1.6% of the physical measurements on average. In some regions of the target volume, the analytic algorithm calculations differed from the measurement by up to 31% in the internal gross target volume (iGTV) (46% in the planning target volume), over-predicting the dose. All comparisons showed a region of at least 15% dose discrepancy within the iGTV between the analytic calculation and the measured dose. The Monte Carlo algorithm recalculations showed dramatically improved agreement with the measured doses, showing mean agreement within 4% for all cases and a maximum difference of 12% within the iGTV. Conclusions: Analytic algorithms often do a poor job predicting proton dose in lung tumors, over-predicting the dose to the target by up to 46%, and should not be used unless extensive validation counters the consistent results of the present study. Monte Carlo algorithms showed dramatically improved agreement with physical measurements and should be implemented to better reflect actual delivered dose distributions.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A mass-transfer particle-tracking method for simulating transport with discontinuous diffusion coefficients

The problem of a spatially discontinuous diffusion coefficient (D(x)) is one that may be encountered in hydrogeologic systems due to natural geological features or as a consequence of numerical discretization of flow properties. To date, mass-transfer particle-tracking (MTPT) methods, a family of Lagrangian methods in which diffusion is jointly simulated by random walk and diffusive mass transfers, have been unable to solve this problem. This manuscript presents a new mass-transfer (MT) algorithm that enables MTPT methods to accurately solve the problem of discontinuous D(x). To achieve this, we derive a semi-analytical solution to the discontinuous D(x) problem by employing a predictor-corrector approach, and we use this semi-analytical solution as the weighting function in a reformulated MT algorithm. Furthermore, this semi-analytical solution is generalized for cases with multiple 1D interfaces as well as for 2D cases, including a 2 × 2 tiling of 4 subdomains that corresponds to a numerically-generated diffusion field. The solutions generated by this new mass-transfer algorithm closely agree with an analytical 1D solution or, in more complicated cases, trusted numerical results, demonstrating the success of our proposed approach.

42 ENGINEERING↗

Midlatitude Continental Convective Clouds Experiment (MC3E)

Convective processes play a critical role in the Earth’s energy balance through the redistribution of heat and moisture in the atmosphere and subsequent impacts on the hydrologic cycle. Global observation and accurate representation of these processes in numerical models is vital to improving our current understanding and future simulations of Earth’s climate system. Despite improvements in computing power, current operational weather and global climate models are unable to resolve the natural temporal and spatial scales that are associated with convective and stratiform precipitation processes; therefore, they must turn to parameterization schemes to represent these processes. In turn, the physical basis for these parameterization schemes needs to be evaluated for general application under a variety of atmospheric conditions. Analogously, space-based remote sensing algorithms designed to retrieve related cloud and precipitation information for use in hydrological, climate, and numerical weather prediction applications often rely on physical “parameterizations” that reliably translate indirectly related instrument measurements to the physical quantity of interest (e.g., precipitation rate). Importantly, both spaceborne retrieval algorithms and model convective parameterization schemes traditionally rely on field campaign data sets as a basis for evaluating and improving the physics of their respective approaches. The Midlatitude Continental Convective Clouds Experiment (MC3E) will take place in central Oklahoma during the April–May 2011 period. The experiment is a collaborative effort between the U.S. Department of Energy (DOE) Atmospheric Radiation Measurement (ARM) Climate Research Facility and the National Aeronautics and Space Administration’s (NASA) Global Precipitation Measurement (GPM) mission Ground Validation (GV) program. The field campaign leverages the unprecedented observing infrastructure currently available in the central United States, combined with an extensive sounding array, remote sensing and in situ aircraft observations, NASA GPM ground validation remote sensors, and new ARM instrumentation purchased with American Recovery and Reinvestment Act funding. The overarching goal is to provide the most complete characterization of convective cloud systems, precipitation, and the environment that has ever been obtained, providing constraints for model cumulus parameterizations and space-based rainfall retrieval algorithms over land that have never before been available. Several different components of convective cloud and precipitation processes tangible to both the convective parameterization and precipitation retrieval algorithm problem are targeted, such as preconvective environment and convective initiation, updraft/downdraft dynamics, condensate transport and detrainment, precipitation and cloud microphysics, spatial and temporal variability of precipitation, influence on the environment and radiation, and a detailed description of the large-scale forcing.

54 ENVIRONMENTAL SCIENCES↗

Modeling of wave processes in blocky media with porous and fluid-saturated interlayers

The wave processes in blocky media are analyzed by applying different mathematical models, wherein the elastic blocks interact with each other via pliant interlayers with the complex mechanical properties. Four versions of constitutive equations are considered. In the first version, an elastic interaction between the blocks is simulated within the framework of linear elasticity theory, and the model of elastic–plastic interlayers is constructed to take into account the appearance of irreversible deformation of interlayers at short time intervals. In the second one, the effects of viscoelastic shear in the interblock interlayers are taken into the consideration using the Poynting–Thomson rheological scheme. In the third option, the model of an elastic porous material is used in the interlayers, where the pores collapse if an abrupt compressive stress is applied. In the fourth case, the model of a fluid-saturated material with open pores is examined based on Biot's equations. The collapse of pores is modeled by the generalized rheological approach, wherein the mechanical properties of a material are simulated using four rheological elements. Three of them are the traditional elastic, viscous and plastic elements, the fourth element is the so-called rigid contact, which is used to describe the behavior of materials with the different resistance to tension and compression. It was shown that the thermodynamically consistent model is provided, which means that the energy balance equation is fulfilled for an entire blocky structure, where the kinetic and potential energy of the system is the sum of the kinetic and potential energies of the blocks and interlayers. Under numerical implementation of the interlayers models, the dissipationless finite difference Ivanov's method was used. The splitting method by spatial variables in the combination with the Godunov gap decay scheme was applied in the blocks. As a result, robust and stable computational algorithms are built and tested. Using MPI technology, the parallel software was designed for the modeling of wave processes in 2D setting. The numerical results are presented, discussed and future studies are outlined. - Highlights: • We model the propagation of waves in a blocky medium with compliant interlayers. • Models of porous and fluid saturated interlayers are proposed using Biot's approach. • A parallel computational algorithm is developed for supercomputers of cluster type. • Problems of instant rotation of central and boundary blocks are solved numerically. • Wave motions are compared in the cases of elastic and fluid-saturated interlayers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Enumerating a Diverse Set of Building Designs Using Discrete Optimization: Preprint

Numerical optimization is a powerful method for identifying energy-efficient building designs. Automating the search process facilitates the evaluation of many more options than is possible with one-off parametric simulation runs. However, input data uncertainties and qualitative aspects of building design work against standard optimization formulations that return a single, so-called optimaldesign. This paper presents a method for harnessing a discrete optimization algorithm to obtain significantly different, economically viable building designs that satisfy an energy efficiency goal. The method is demonstrated using NREL's first-generation building analysis platform, Opt- E-Plus, and two example problems. We discuss the information content of the results, and the computationaleffort required by the algorithm.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Tuning successive linear programming to solve AC optimal power flow problem for large networks

Successive linear programming (SLP) is a practical approach for solving large-scale nonlinear optimization problems. Alternating current optimal power flow (ACOPF) is no exception, particularly the large size of real-world networks. However, in order to achieve tractability, it is essential to tune the SLP algorithm presented in the literature. This paper presents a modified SLP algorithm to solve the ACOPF problem, specified by the U.S. Department of Energy’s (DOE) Grid Optimization (GO) Competition Challenge 1, within strict time limits. The algorithm first finds a near-optimal solution for the relaxed problem (i.e., Stage 1). Then, it finds a feasible solution in the proximity of the near-optimal solution (i.e., Stage 2 and Stage 3). The numerical experiments on test cases ranging from 500-bus to 30,000-bus systems show that the algorithm is tractable. Here the results show that our proposed algorithm is tractable and can solve more than 80% of test cases faster than the well-known Interior Point Method while significantly reduce the number of iterations required to solve ACOPF. The number of iterations is considered an important factor in the examination of tractability which can drastically reduce the computational time required within each iteration.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Neutronics Modeling of the High Flux Isotope Reactor using COMSOL

The High Flux Isotope Reactor located at the Oak Ridge National Laboratory is a versatile 85 MWth research reactor with cold and thermal neutron scattering, materials irradiation, isotope production, and neutron activation analysis capabilities. HFIR staff members are currently in the process of updating the thermal hydraulic and reactor transient modeling methodologies. COMSOL Multiphysics has been adopted for the thermal hydraulic analyses and has proven to be a powerful finite-element-based simulation tool for solving multiple physics-based systems of partial and ordinary differential equations. Modeling reactor transients is a challenging task because of the coupling of neutronics, heat transfer, and hydrodynamics. This paper presents a preliminary COMSOL-based neutronics study performed by creating a two-dimensional, two-group, diffusion neutronics model of HFIR to study the spatially-dependent, beginning-of-cycle fast and thermal neutron fluxes. The 238-group ENDF/B-VII neutron cross section library and NEWT, a two-dimensional, discrete-ordinates neutron transport code within the SCALE 6 code package, were used to calculate the two-group neutron cross sections required to solve the diffusion equations. The two-group diffusion equations were implemented in the COMSOL coefficient form PDE application mode and were solved via eigenvalue analysis using a direct (PARDISO) linear system solver. A COMSOL-provided adaptive mesh refinement algorithm was used to increase the number of elements in areas of largest numerical error to increase the accuracy of the solution. The flux distributions calculated by means of COMSOL/SCALE compare well with those calculated with benchmarked three-dimensional MCNP and KENO models, a necessary first step along the path to implementing two- and three-dimensional models of HFIR in COMSOL for the purpose of studying the spatial dependence of transient-induced behavior in the reactor core.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Nonlinear Fourier analysis for discontinuous conductivities: Computational results

Two reconstruction methods of Electrical Impedance Tomography (EIT) are numerically compared for nonsmooth conductivities in the plane based on the use of complex geometrical optics (CGO) solutions to D-bar equations involving the global uniqueness proofs for Calderón problem exposed in Nachman (1996) [43] and Astala and Päivärinta (2006) [6]: the Astala–Päivärinta theory-based low-pass transport matrix method implemented in Astala et al. (2011) [3] and the shortcut method which considers ingredients of both theories. The latter method is formally similar to the Nachman theory-based regularized EIT reconstruction algorithm studied in Knudsen et al. (2009) [34] and several references from there. New numerical results are presented using parallel computation with size parameters larger than ever, leading mainly to two conclusions as follows. First, both methods can approximate piecewise constant conductivities better and better as the cutoff frequency increases, and there seems to be a Gibbs-like phenomenon producing ringing artifacts. Second, the transport matrix method loses accuracy away from a (freely chosen) pivot point located outside of the object to be studied, whereas the shortcut method produces reconstructions with more uniform quality.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cost-efficient finite-volume high-order schemes for compressible magnetohydrodynamics

We present an efficient dimension-by-dimension finite-volume method which solves the adiabatic magnetohydrodynamics equations at high discretization order, using the constrained-transport approach on Cartesian grids. Results are presented up to tenth order of accuracy. The algorithmic architecture of this method is very close to that of commonly employed second-order schemes: it requires only one reconstructed value per face for each computational cell, independently of the scheme's order. This property is highly beneficial for the numerical efficiency. It results from reusing the required values already available in neighboring grid cells, in contrast to standard algorithms that require a number of reconstructions and evaluations which increases with the scheme's order of accuracy. At a given resolution, these high-order schemes present significantly less numerical dissipation than commonly employed lower-order approaches. Thus, results of comparable accuracy are achievable at a substantially coarser resolution, yielding overall performance gains. We also present a way to include physical dissipative terms: viscosity, magnetic diffusivity and cooling functions, respecting the finite-volume and constrained-transport frameworks. Benefits of this method are shown through applications in turbulent flows.

97 MATHEMATICS AND COMPUTING↗

Simulation of Magnetic Systems in the Domain with a Corner

Numerical simulation of magnetic systems having corner points is considered. The literature on this topic is reviewed. A method of encapsulating the function behavior near corner points in the difference scheme is proposed for numerical solution of the 2D magnetostatic problem in the iron domain. For the 3D magnetostatic problem in the iron/vacuum domain, the increase in the magnetic field near the corner point is estimated, and a method for construction of an adaptive mesh is proposed. A parallel algorithm is implemented on the graphics-processing unit (GPU) architecture for faster search for the numerical solution of the magnetostatic problem. Numerical simulation is performed for the magnetic system of the SPD detector to be used at the NICA complex (JINR, Dubna).

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Communication: Four-component density matrix renormalization group

We present the first implementation of the relativistic quantum chemical two- and four-component density matrix renormalization group algorithm that includes a variational description of scalar-relativistic effects and spin–orbit coupling. Numerical results based on the four-component Dirac–Coulomb Hamiltonian are presented for the standard reference molecule for correlated relativistic benchmarks: thallium hydride.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Bringing discrete-time Langevin splitting methods into agreement with thermodynamics

In light of the recently published complete set of statistically correct Grønbech–Jensen (GJ) methods for discrete-time thermodynamics, we revise a differential operator splitting method for the Langevin equation in order to comply with the basic GJ thermodynamic sampling features, namely, the Boltzmann distribution and Einstein diffusion, in linear systems. This revision, which is based on the introduction of time scaling along with flexibility of a discrete-time velocity attenuation parameter, provides a direct link between the ABO splitting formalism and the GJ methods. This link brings about the conclusion that any GJ method has at least weak second order accuracy in the applied time step. It further helps identify a novel half-step velocity, which simultaneously produces both correct kinetic statistics and correct transport measures for any of the statistically sound GJ methods. Explicit algorithmic expressions are given for the integration of the new half-step velocity into the GJ set of methods. Finally, numerical simulations, including quantum-based molecular dynamics (QMD) using the QMD suite Los Alamos Transferable Tight-Binding for Energetics, highlight the discussed properties of the algorithms as well as exhibit the direct application of robust, time-step-independent stochastic integrators to QMD.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Mixed-precision iterative refinement using tensor cores on GPUs to accelerate solution of linear systems

Double-precision floating-point arithmetic (FP64) has been the de facto standard for engineering and scientific simulations for several decades. Problem complexity and the sheer volume of data coming from various instruments and sensors motivate researchers to mix and match various approaches to optimize compute resources, including different levels of floating-point precision. In recent years, machine learning has motivated hardware support for half-precision floating-point arithmetic. A primary challenge in high-performance computing is to leverage reduced-precision and mixed-precision hardware. We show how the FP16/FP32 Tensor Cores on NVIDIA GPUs can be exploited to accelerate the solution of linear systems of equations Ax = b without sacrificing numerical stability. The techniques we employ include multiprecision LU factorization, the preconditioned generalized minimal residual algorithm (GMRES), and scaling and auto-adaptive rounding to avoid overflow. We also show how to efficiently handle systems with multiple right-hand sides. On the NVIDIA Quadro GV100 (Volta) GPU, we achieve a 4×-5× performance increase and 5× better energy efficiency versus the standard FP64 implementation while maintaining an FP64 level of numerical stability.

GMRES↗

Hybrid real- and reciprocal-space full-field imaging with coherent illumination

In this work, we present a novel diffractive imaging method that harnesses a low-resolution real-space image to guide the phase retrieval. A computational algorithm is developed to utilise such prior knowledge as a real-space constraint in the iterative phase retrieval procedure. Numerical simulations and proof-of-concept experiments are carried out, demonstrating our method's capability of reconstructing high-resolution details that are otherwise inaccessible with traditional phasing algorithms. With the present method, we formulate a conceptual design for the coherent imaging experiments at a next-generation x-ray light source.

42 ENGINEERING↗