Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical algorithms”

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

Terascale direct numerical simulations of turbulent combustion using S3D.

Computational science is paramount to the understanding of underlying processes in internal combustion engines of the future that will utilize non-petroleum-based alternative fuels, including carbon-neutral biofuels, and burn in new combustion regimes that will attain high efficiency while minimizing emissions of particulates and nitrogen oxides. Next-generation engines will likely operate at higher pressures, with greater amounts of dilution and utilize alternative fuels that exhibit a wide range of chemical and physical properties. Therefore, there is a significant role for high-fidelity simulations, direct numerical simulations (DNS), specifically designed to capture key turbulence-chemistry interactions in these relatively uncharted combustion regimes, and in particular, that can discriminate the effects of differences in fuel properties. In DNS, all of the relevant turbulence and flame scales are resolved numerically using high-order accurate numerical algorithms. As a consequence terascale DNS are computationally intensive, require massive amounts of computing power and generate tens of terabytes of data. Recent results from terascale DNS of turbulent flames are presented here, illustrating its role in elucidating flame stabilization mechanisms in a lifted turbulent hydrogen/air jet flame in a hot air co-flow, and the flame structure of a fuel-lean turbulent premixed jet flame. Computing at this scale requires close collaborations between computer and combustion scientists to provide optimized scaleable algorithms and software for terascale simulations, efficient collective parallel I/O, tools for volume visualization of multiscale, multivariate data and automating the combustion workflow. The enabling computer science, applied to combustion science, is also required in many other terascale physics and engineering simulations. In particular, performance monitoring is used to identify the performance of key kernels in the DNS code, S3D and especially memory intensive loops in the code. Through the careful application of loop transformations, data reuse in cache is exploited thereby reducing memory bandwidth needs, and hence, improving S3D's nodal performance. To enhance collective parallel I/O in S3D, an MPI-I/O caching design is used to construct a two-stage write-behind method for improving the performance of write-only operations. The simulations generate tens of terabytes of data requiring analysis. Interactive exploration of the simulation data is enabled by multivariate time-varying volume visualization. The visualization highlights spatial and temporal correlations between multiple reactive scalar fields using an intuitive user interface based on parallel coordinates and time histogram. Finally, an automated combustion workflow is designed using Kepler to manage large-scale data movement, data morphing, and archival and to provide a graphical display of run-time diagnostics.

33 ADVANCED PROPULSION SYSTEMS↗

Digital Electronics and Their Application to Beta Decay Spectroscopy

Significant advantages can be obtained through the application of digital electronics to nuclear physics experiments by replacing the traditional timing and shaping circuits by numerical algorithms implemented in real time. One example demonstrating the power of digital techniques is the achievement of a low-energy threshold, <50 keV, for the detection of beta-decay electrons in a thick Si detector. Such a low beta detection threshold would dramatically improve the detection efficiency in standard beta decay correlation experiments.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Optimization of Sparse Matrix-Vector Multiplication on Emerging Multicore Platforms

We are witnessing a dramatic change in computer architecture due to the multicore paradigm shift, as every electronic device from cell phones to supercomputers confronts parallelism of unprecedented scale. To fully unleash the potential of these systems, the HPC community must develop multicore specific-optimization methodologies for important scientific computations. In this work, we examine sparse matrix-vector multiply (SpMV) - one of the most heavily used kernels in scientific computing - across a broad spectrum of multicore designs. Our experimental platform includes the homogeneous AMD quad-core, AMD dual-core, and Intel quad-core designs, the heterogeneous STI Cell, as well as one of the first scientific studies of the highly multithreaded Sun Victoria Falls (a Niagara2 SMP). We present several optimization strategies especially effective for the multicore environment, and demonstrate significant performance improvements compared to existing state-of-the-art serial and parallel SpMV implementations. Additionally, we present key insights into the architectural trade-offs of leading multicore design strategies, in the context of demanding memory-bound numerical algorithms.

97 MATHEMATICS AND COMPUTING↗

Simulation Studies of the X-Ray Free-Electron Laser Oscillator

Simulations of the x-ray free-electron laser (FEL) oscillator are presented that include transverse effects and realistic Bragg crystal properties with the two-dimensional code GINGER. In the present cases considered the radiation divergence is much narrower than the crystal acceptance, and the numerical algorithm can be simplified by ignoring the finite angular bandwidth of the crystal. In this regime GINGER shows that the saturated x-ray pulses have 109 photons and are nearly Fourier-limited with peak powers in excess of 1 MW. Wealso include preliminary results for a four-mirror cavity that can be tuned in wavelength over a few percent, with future plans to incorporate the full transverse response of the Bragg crystals into GINGER to more accurately model this tunable source.

43 PARTICLE ACCELERATORS↗

Future Response of Coastal Wetlands to Environmental Stresses: Algorithm Comparison of Numerical Models

Coastal wetlands are a critical component of the earth system that strongly influence the global water and biogeochemical cycles. They are also likely important sentinel of climate change. Because eco-geomorphological processes have long been recognized to be important for coastal wetland survival under accelerated sea-level rise (SLR), many eco-geomorphology models have been developed to assess the impact of climate change on coastal wetlands. Although these models differ substantially in complexity and numerical methods, few studies have investigated the algorithm-level uncertainties in these models. In this study, we developed a multiple-algorithm model framework of coastal wetlands that represents coastal hydrodynamics (such as water level, significant wave height and bottom shear stress) and four eco-geomorphological processes: mineral accretion, organic matter accretion, storm surge erosion and landward migration. We validated the model at three representative coastal wetland sites (Venice Lagoon, Plum Island Estuary and Hunter Estuary) for hydrodynamics, mineral accretion and organic matter accretion. Through model-data comparison, we showed that the model can well capture the dynamics of hydrodynamical and eco-geomorphological conditions in the study sites. Importantly, analysis of the multiple-algorithm simulations suggests that differences in the process representation of mineral and organic matter accretion may contribute to the recent contradicting predictions of coastal wetland evolution under accelerated SLR.

54 ENVIRONMENTAL SCIENCES↗

A variant nonmonotone smoothing algorithm with improved numerical results for large-scale LWCPs

This paper considers the linear weighted complementarity problem (denoted by LWCP) introduced by Potra (SIAM J Optim 22:1634–1654, 2012). Based on two weighted smoothing functions, we propose a new nonmonotone smoothing algorithm for solving the LWCP and establish its global and local quadratic convergence without the strict complementarity assumption. Compared to existing nonmonotone smoothing algorithms, the proposed algorithm solves the linear system only approximately which can save the computation work when one solves large-scale LWCPs. Moreover, the nonmonotone line search technique adopted in this paper includes the usual monotone line search and some existing nonmonotone line searches as special cases. Numerical results show that our algorithm is considerably efficient for solving large-scale LWCPs.

97 MATHEMATICS AND COMPUTING↗

A new numerically stable sequential algorithm for coupled finite-strain elastoplastic geomechanics and flow

In this work, we propose a new numerically stable sequential implicit method for coupled flow and finite-strain multiplicative elastoplastic geomechanics. We find from stability analysis that the sequential method that solves the flow problem first by fixing the first Piola-Kirchhoff total stress, solving the geomechanics (solid deformation) problem at the next step, is unconditionally stable (contractive and B-stable). In this sense, this method named the fixed first Piola-Kirchhoff stress method is an extension of the fixed stress method in coupled flow and infinitesimal geomechanics. We also study the fixed second Piola-Kirchhoff stress method, comparing it with the fixed first Piola-Kirchhoff stress method, because the constitutive relations are formulated by the second Piola-Kirchhoff total stress, although fixing the second Piola-Kirchhoff total stress field does not provide theoretical unconditional stability. In space discretization, we use the finite element method for the geomechanics problem with the total Lagrangian approach, while employing the finite volume method for the flow problem. Geometrical nonlinearity from the total Lagrangian approach results in full-tensor permeability even if the initial permeability is isotropic. To consider the full-tensor permeability accurately, we employ the multipoint flux approximation in solving the flow problem. In time discretization, the backward Euler method is used. Then, we perform numerical experiments of the two fixed-stress sequential methods with various scenarios, and find superiority of their numerical stability. Specifically, the two fixed-stress sequential methods provide almost identical results for elasticity. For J2 plasticity, the two sequential methods yield slightly different numerical results although the trends of the results are similar. For the Drucker-Prager plasticity, we find that the results from the two methods are almost identical. For all the test cases, the two sequential methods are numerically stable.

58 GEOSCIENCES↗

Bringing randomized algorithms to mainstream numerical linear algebra

Numerical linear algebra (NLA) underpins huge swaths of computational science and engineering. For scientists and engineers to make the most of the DOE’s computing resources, it is essential that they have access to high-performance implementations of algorithms with best-in-class scalability and reliability. Despite this, prevailing NLA libraries have little to no support for breakthrough algorithms from the field of randomized numerical linear algebra (RandNLA) that have been developed over the past twenty years. The goal of this LDRD was to break a log-jam that had prevented broad adoption of RandNLA. Our work had two thrusts. The first was to develop RandBLAS: a trustworthy and high-performance C++ library for randomized dimension reduction (an operation widely known as sketching). The second was the development of a novel randomized algorithm for computing a challenging type of matrix decomposition known as Householder QR with column pivoting (Householder QRCP). In this one-year late-start LDRD we successfully delivered RandBLAS 1.0 and new CPU and GPU codes for Householder QRCP. RandBLAS has extensive documentation at https://randblas.readthedocs.io/en/stable/. Papers on RandBLAS and and our high-performance QRCP codes are forthcoming.

97 MATHEMATICS AND COMPUTING↗

Comparative Study of Algorithms for the Numerical Simulation of Lattice QCD

Large-scale numerical simulations are the prime method for a nonperturbative study of QCD from first principles. Although the lattice simulation of the pure-gauge (or quenched-QCD) case may be performed very efficiently on parallel machines, there are several additional difficulties in the simulation of the full-QCD case, i.e. when dynamical quark effects are taken into account. We discuss the main aspects of full-QCD simulations, describing the most common algorithms. We present a comparative analysis of performance for two versions of the hybrid Monte Carlo method (the so-called R and RHMC algorithms), as provided in the MILC software package. We consider two degenerate flavors of light quarks in the staggered formulation, having in mind the case of finite-temperature QCD.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Fundamental form of the electrostatic δf-PIC algorithm and discovery of a converged numerical instability

The δf particle-in-cell algorithm has been a useful tool in studying the physics of plasmas, particularly turbulent magnetized plasmas in the context of gyrokinetics. The reduction in noise due to not having to resolve the full distribution function indicates an efficiency advantage over the standard (“full-f”) particle-in-cell. Despite its successes, the algorithm behaves strangely in some circumstances. In this work, we document a fully resolved numerical instability that occurs in the simplest of multiple-species test cases: the electrostatic Ω{sub H} mode. There is also a poorly understood numerical instability that occurs when one is under-resolved in particle number, which may require a prohibitively large number of particles to stabilize. Both of these are independent of the time-stepping scheme, and we conclude that they exist if the time advancement were exact. The exact analytic form of the algorithm is presented, and several schemes for mitigating these instabilities are also presented.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Numerical Analysis of Fixed Point Algorithms in the Presence of Hardware Faults

The exponential growth of computational power of the extreme scale machines over the past few decades has led to a corresponding decrease in reliability and a sharp increase of the frequency of hardware faults. Our research focuses on the mathematical challenges presented by the silent hardware faults. i.e., faults that can perturb the result of computations in an inconspicuous way. Using the approach of selective reliability we present an analytic fault mode that can be used to study the resilience properties of a numerical algorithm. We apply our approach to the classical fixed point iteration and demonstrate that in the presence of hardware faults, the classical method fails to converge in expectation. We preset a modified resilient algorithm that detects and rejects faults resulting in error with large magnitude, while small faults are negated by the natural self-correcting properties of the algorithm. We show that our method is convergent (in first and second statistical moments) even in the presence of silent hardware faults.

algorithmic resilience↗

Neutron transport in Eulerian coordinates with bulk material motion

A consistent, numerically stable algorithm for the solution of the neutron transport equation in the presence of a moving material background is presented for one-dimensional spherical geometry. Manufactured solutions are used to demonstrate the correctness and stability of our numerical algorithm. The importance of including moving material corrections is shown for the r-process in proto-neutron stars. (authors)

97 MATHEMATICS AND COMPUTING↗

Stochastic weighted particle methods for population balance equations with coagulation, fragmentation and spatial inhomogeneity

Graphical abstract: -- Highlights: •Problems concerning multi-compartment population balance equations are studied. •A class of fragmentation weight transfer functions is presented. •Three stochastic weighted algorithms are compared against the direct simulation algorithm. •The numerical errors of the stochastic solutions are assessed as a function of fragmentation rate. •The algorithms are applied to a multi-dimensional granulation model. -- Abstract: This paper introduces stochastic weighted particle algorithms for the solution of multi-compartment population balance equations. In particular, it presents a class of fragmentation weight transfer functions which are constructed such that the number of computational particles stays constant during fragmentation events. The weight transfer functions are constructed based on systems of weighted computational particles and each of it leads to a stochastic particle algorithm for the numerical treatment of population balance equations. Besides fragmentation, the algorithms also consider physical processes such as coagulation and the exchange of mass with the surroundings. The numerical properties of the algorithms are compared to the direct simulation algorithm and an existing method for the fragmentation of weighted particles. It is found that the new algorithms show better numerical performance over the two existing methods especially for systems with significant amount of large particles and high fragmentation rates.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Technical Report: Scalable Parallel Algorithms for High Dimensional Numerical Integration

We implemented a scalable parallel quasi-Monte Carlo numerical high-dimensional integration for tera-scale data points. The implemented algorithm uses the Sobol s quasi-sequences to generate random samples. Sobol s sequence was used to avoid clustering effects in the generated random samples and to produce low-discrepancy random samples which cover the entire integration domain. The performance of the algorithm was tested. Obtained results prove the scalability and accuracy of the implemented algorithms. The implemented algorithm could be used in different applications where a huge data volume is generated and numerical integration is required. We suggest using the hyprid MPI and OpenMP programming model to improve the performance of the algorithms. If the mixed model is used, attention should be paid to the scalability and accuracy.

97 MATHEMATICS AND COMPUTING↗

An Efficient Deterministic Parallel Algorithm for Adaptive Multidimensional Numerical Integration on GPUs

Recent development in Graphics Processing Units (GPUs) has enabled a new possibility for highly efficient parallel computing in science and engineering. Their massively parallel architecture makes GPUs very effective for algorithms where processing of large blocks of data can be executed in parallel. Multidimensional integration has important applications in areas like computational physics, plasma physics, computational fluid dynamics, quantum chemistry, molecular dynamics and signal processing. The computationally intensive nature of multidimensional integration requires a high-performance implementation. In this study, we present an efficient deterministic parallel algorithm for adaptive multidimensional numerical integration on GPUs. Various optimization techniques are applied to maximize the utilization of the GPU. GPU-based implementation outperforms the best known sequential methods and achieves a speed-up of up to 100. It also shows good scalability with the increase in dimensionality.

Arumugam, Kamesh↗

Numerical stability of relativistic beam multidimensional PIC simulations employing the Esirkepov algorithm

Rapidly growing numerical instabilities routinely occur in multidimensional particle-in-cell computer simulations of plasma-based particle accelerators, astrophysical phenomena, and relativistic charged particle beams. Reducing instability growth to acceptable levels has necessitated higher resolution grids, high-order field solvers, current filtering, etc. except for certain ratios of the time step to the axial cell size, for which numerical growth rates and saturation levels are reduced substantially. This paper derives and solves the cold beam dispersion relation for numerical instabilities in multidimensional, relativistic, electromagnetic particle-in-cell programs employing either the standard or the Cole–Karkkainnen finite difference field solver on a staggered mesh and the common Esirkepov current-gathering algorithm. Good overall agreement is achieved with previously reported results of the WARP code. In particular, the existence of select time steps for which instabilities are minimized is explained. Additionally, an alternative field interpolation algorithm is proposed for which instabilities are almost completely eliminated for a particular time step in ultra-relativistic simulations.

43 PARTICLE ACCELERATORS↗