Search NASA⌕ Search

SEARCH · Search NASA

Results for “Approximate computing”

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,189 records · Page 66
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

DEM simulation of the compression of crushable sand: does the initial particle shape matter?

Advances in DEM modeling, combined with high-resolution X-ray tomography, opened the way for computer models based on virtual replicas of the particles which preserve nearly all facets of their geometry. This leads to simulation advantages, but also high computational costs. Here we tackle a question stemming from this trend: how accurate should particle models be to ensure accuracy? We address this question for the case of the compression of crushable sand. LS-DEM was used to generate three models of Ottawa sand (exact replicas, ellipsoids, and spheres) from digital images of its grains. Compression-induced crushing was simulated for all sets by tracking evolving size and shape distribution. The results confirm that exact replicas provide the closest match of the measurements. However, intermediate degrees of rendering (e.g. ellipsoids preserving volume and aspect ratio of the real grains) led to satisfactory results only marginally different from those of exact replicas. In conclusion, these findings provide an example of the protocols that may be followed to identify the optimal degree of particle approximation which should be regarded as mandatory to achieve a conscious, sustainable use of computational resources.

58 GEOSCIENCES↗
DOE OSTI2023

Challenging the Curse of Dimensionality in Multidimensional Numerical Integration by Using a Low-Rank Tensor-Train Format

Numerical integration is a basic step in the implementation of more complex numerical algorithms suitable, for example, to solve ordinary and partial differential equations. The straightforward extension of a one-dimensional integration rule to a multidimensional grid by the tensor product of the spatial directions is deemed to be practically infeasible beyond a relatively small number of dimensions, e.g., three or four. In fact, the computational burden in terms of storage and floating point operations scales exponentially with the number of dimensions. This phenomenon is known as the curse of dimensionality and motivated the development of alternative methods such as the Monte Carlo method. The tensor product approach can be very effective for high-dimensional numerical integration if we can resort to an accurate low-rank tensor-train representation of the integrand function. In this work, we discuss this approach and present numerical evidence showing that it is very competitive with the Monte Carlo method in terms of accuracy and computational costs up to several hundredths of dimensions if the integrand function is regular enough and a sufficiently accurate low-rank approximation is available.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Multistage Stochastic Transmission Expansion Algorithm for Wide-Area Planning under Uncertainty

The overall objective for this project was to develop and demonstrate a set of methods for solving the transmission investment problem for a large network considering many possible scenarios of future conditions and multiple decision points when investments can be made. Project sub-objectives achieved this goal through a succession of extending the methods to apply to problems with increasing complexity or additional features, including the number of decision points, whether generation and transmission are co-optimized, and whether AC or DC power flow is used. A transmission model was developed for the Western Electric Coordinating Council (WECC) region, the high-voltage transmission system that serves the western third of the continental U.S. Using a dataset provided by WECC and by researchers from John Hopkins University, we have validated and demonstrated the model and used it to compare the new method for solving multi-stage stochastic transmission planning to several state-of-the-art techniques. The project has resulted in several key outcomes and achievements: The covariance-based method for choosing a small set of hours to represent short-term variability has superior performance in terms of accuracy to existing methods, including K-means clustering and Importance Sampling; The combined partitioning method for long-term uncertainty with the nested clustering approach for choosing representative hours for each long-term group has superior accuracy for equivalent computational effort compared with existing methods; Using the partitioning/clustering method combined with Sample Average Approximation provides both statistical bounds on the quality of the solution and at the same time, a complete investment plan for all contingencies in the full uncertainty set; no existing methods can provide both at the same time; The method is demonstrated to work well for choosing both transmission and generation investments; A variant on the method allows for both scenario selection and simultaneous correction for the error from the DC power flow approximation to provide a tractable method for AC power flow-based transmission planning under uncertainty; The method applied to the WECC case study demonstrates the additional value to the system operator and the consumer of identifying flexible investment options in the near-term decisions. In particular, the case study exhibits significant option value in postponing some transmission additions that appear useful but in some long-term system states create new congestion problems.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations

Rank-revealing matrix decompositions provide an essential tool in spectral analysis of matrices, including the Singular Value Decomposition (SVD) and related low-rank approximation techniques. QR with Column Pivoting (QRCP) is usually suitable for these purposes, but it can be much slower than the unpivoted QR algorithm. For large matrices, the difference in performance is due to increased communication between the processor and slow memory, which QRCP needs in order to choose pivots during decomposition. Our main algorithm, Randomized QR with Column Pivoting (RQRCP), uses randomized projection to make pivot decisions from a much smaller sample matrix, which we can construct to reside in a faster level of memory than the original matrix. This technique may be understood as trading vastly reduced communication for a controlled increase in uncertainty during the decision process. Furthermore, for rank-revealing purposes, the selection mechanism in RQRCP produces results that are the same quality as the standard algorithm, but with performance near that of unpivoted QR (often an order of magnitude faster for large matrices). Additionally, we also propose two formulas that facilitate further performance improvements. The first efficiently updates sample matrices to avoid computing new randomized projections. The second avoids large trailing updates during the decomposition in truncated low-rank approximations. Our truncated version of RQRCP also provides a key initial step in our truncated SVD approximation, TUXV. These advances open up a new performance domain for large matrix factorizations that will support efficient problem-solving techniques for challenging applications in science, engineering, and data analysis.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Piecewise linear approximation with minimum number of linear segments and minimum error: A fast approach to tighten and warm start the hierarchical mixed integer formulation

In several areas of economics and engineering, it is often necessary to fit discrete data points or approximate nonlinear functions with continuous functions. Piecewise linear (PWL) functions are a convenient way to achieve this. PWL functions can be modeled in mathematical problems using only linear and integer variables. Moreover, there is a computational benefit in using PWL functions that have the least possible number of segments. This work proposes a novel hierarchical mixed integer linear programming (MILP) formulation that identifies a continuous PWL approximation with minimum number of linear segments for a given target maximum error. The proposed MILP formulation also identifies the solution with the least maximum error among the solutions with minimum number of segments. Then, this work proposes a fast iterative algorithm that identifies non necessarily continuous PWL approximations by solving O(S log N) linear programming (LP) problems, where N is the number of data points and S is the minimum number of segments in the non necessarily continuous case. This work demonstrates that tight bounds for the MILP problem can be derived from these approximations. Next, a fast algorithm is introduced to transform a non necessarily continuous PWL approximation into a continuous one. Finally, the tight bounds and the continuous PWL approximations are used to tighten and warm start the MILP problem. The tightened formulation is shown in experimental results to be more efficient, especially for large data sets, with a solution time that is up to two orders of magnitude less than the existing literature.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Properties of the water to boron nitride interaction: From zero to two dimensions with benchmark accuracy

Molecular adsorption on surfaces plays an important part in catalysis, corrosion, desalination, and various other processes that are relevant to industry and in nature. As a complement to experiments, accurate adsorption energies can be obtained using various sophisticated electronic structure methods that can now be applied to periodic systems. The adsorption energy of water on boron nitride substrates, going from zero to 2-dimensional periodicity, is particularly interesting as it calls for an accurate treatment of polarizable electrostatics and dispersion interactions, as well as posing a practical challenge to experiments and electronic structure methods. Here, we present reference adsorption energies, static polarizabilities, and dynamic polarizabilities, for water on BN substrates of varying size and dimension. Adsorption energies are computed with coupled cluster theory, fixed-node quantum Monte Carlo (FNQMC), the random phase approximation, and second order Møller-Plesset theory. These wavefunction based correlated methods are found to agree in molecular as well as periodic systems. The best estimate of the water/h-BN adsorption energy is -107 ± 7 meV from FNQMC. In addition, the water adsorption energy on the BN substrates could be expected to grow monotonically with the size of the substrate due to increased dispersion interactions, but interestingly, this is not the case here. This peculiar finding is explained using the static polarizabilities and molecular dispersion coefficients of the systems, as computed from time-dependent density functional theory (DFT). Dynamic as well as static polarizabilities are found to be highly anisotropic in these systems. Finally, the many-body dispersion method in DFT emerges as a particularly useful estimation of finite size effects for other expensive, many-body wavefunction based methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2019

Multi-rate time integration on overset meshes

Overset meshes are an effective tool for the computational fluid dynamic simulation of problems with complex geometries or multiscale spatio-temporal features. When the maximum allowable timestep on one or more meshes is significantly smaller than on the remaining meshes, standard explicit time integrators impose inefficiencies for time-accurate calculations by requiring that all meshes advance with the smallest timestep. With the targeted use of multi-rate time integrators, separate meshes can be time-marched at independent rates to avoid wasteful computation while maintaining accuracy and stability. This work applies time-explicit multi-rate integrators to the simulation of the compressible Navier-Stokes equations discretized on overset meshes using summation-by-parts (SBP) operators and simultaneous approximation term (SAT) boundary conditions. We introduce a class of multi-rate Adams-Bashforth (MRAB) schemes that offer significant stability improvements and computational efficiencies for SBP-SAT methods. We present numerical results that confirm the efficacy of MRAB integrators, outline a number of implementation challenges, and demonstrate a reduction in computational cost enabled by MRAB. We also look at the use of our method in the setting of a large-scale distributed-memory parallel implementation where we discuss concerns involving load balancing and communication efficiency.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Ab initio calculations of monopole sum rules: From finite nuclei to infinite nuclear matter

We compute moments of the isoscalar monopole response of 𝑁 = 𝑍 closed-shell nuclei based on chiral nucleon-nucleon plus three-nucleon interactions. We employ the random-phase approximation (RPA) and two ab initio many-body approaches, the in-medium similarity renormalization group (IMSRG) and coupled-cluster theory (CC). In the IMSRG framework, the moments are obtained as ground-state expectation values, whereas in the CC approach, they are evaluated through excited-state calculations. We find good agreement between the IMSRG and CC results across all nuclei studied. RPA provides a reasonable approximation to the correlated methods if the interaction is soft. From the calculated moments, we extract average energies of the monopole response, compute finite-nucleus incompressibilities, and estimate the incompressibility of symmetric nuclear matter by a fit to a leptodermous expansion. Our extrapolated values are lower than those obtained in nuclear-matter calculations with the same interactions, but the values are consistent with phenomenological ranges.

Bonaiti, Francesca [Michigan State Univ., East Lan↗
DOE OSTI2019

Multi-scale computational modeling of residual stress in selective laser melting with uncertainty quantification

Selective laser melting (SLM) is a powder-based additive manufacturing technique which creates parts by fusing together successive layers of powder with a laser. The quality of produced parts is highly dependent on the proper selection of processing parameters, requiring significant testing and experimentation to determine parameters for a given machine and material. Computational modeling could potentially be used to shorten this process by identifying parameters through simulation. However, simulating complete SLM builds is challenging due to the difference in scale between the size of the particles and laser used in the build and the size of the part produced. Often, continuum models are employed which approximate the powder as a continuous medium to avoid the need to model powder particles individually. While computationally expedient, continuum models require as inputs effective material properties for the powder which are often difficult to obtain experimentally. Building on previous works which have developed methods for estimating these effective properties along with their uncertainties through the use of detailed models, this work presents a part scale continuum model capable of predicting residual thermal stresses in an SLM build with uncertainty estimates. Model predictions are compared to experimental measurements from the literature.

42 ENGINEERING↗
DOE OSTI2026

Neural Scaling Laws of Deep ReLU and Deep Operator Network: A Theoretical Study

Neural scaling laws play a pivotal role in the performance of deep neural networks and have been observed in a wide range of tasks. However, a complete theoretical framework for understanding these scaling laws remains underdeveloped. In this paper, we explore the neural scaling laws for deep operator networks, which involve learning mappings between function spaces, with a focus on the Chen and Chen style architecture. These approaches, which include the popular Deep Operator Network (DeepONet), approximate the output functions using a linear combination of learnable basis functions and coefficients that depend on the input functions. We establish a theoretical framework to quantify the neural scaling laws by analyzing its approximation and generalization errors. We articulate the relationship between the approximation and generalization errors of deep operator networks and key factors such as network model size and training data size. Moreover, we address cases where input functions exhibit low-dimensional structures, allowing us to derive tighter error bounds. These results also hold for deep ReLU networks and other similar structures. Our results offer a partial explanation of the neural scaling laws in operator learning and provide a theoretical foundation for their applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Random Forests and Networks Analysis

Wilson (Proceedings of the twenty-eight annual acm symposium on the theory of computing, pp. 296–303, 1996) in the 1990s described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a powerful tool in analyzing structures on networks and along this line of thinking, in recent works (Avena and Gaudillière in A proof of the transfer-current theorem in absence of reversibility, in Stat. Probab. Lett. 142, 17–22 (2018); Avena and Gaudillière in J Theor Probab, 2017. https://doi.org/10.1007/s10959-017-0771-3 ; Avena et al. in Approximate and exact solutions of intertwining equations though random spanning forests, 2017. arXiv:1702.05992v1 ; Avena et al. in Intertwining wavelets or multiresolution analysis on graphs through random forests, 2017. arXiv:1707.04616 , to appear in ACHA (2018)) we focused on applications of spanning rooted forests on finite graphs. The resulting main conclusions are reviewed in this paper by collecting related theorems, algorithms, heuristics and numerical experiments. A first foundational part on determinantal structures and efficient sampling procedures is followed by four main applications: (1) a random-walk-based notion of well-distributed points in a graph, (2) a framework to describe metastable-like dynamics in finite settings by means of Markov intertwining dualities, (3) coarse graining schemes for networks and associated processes, (4) wavelets-like pyramidal algorithms for graph signals.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Polyhedral approximation in mixed-integer convex optimization

Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. Here, we intend to provide a broadly accessible introduction to our recent work in developing algorithms and software for this problem class. Our approach is based on constructing polyhedral outer approximations of the convex constraints, resulting in a global solution by solving a finite number of mixed-integer linear and continuous convex subproblems. The key advance we present is to strengthen the polyhedral approximations by constructing them in a higher-dimensional space. In order to automate this extended formulation we rely on the algebraic modeling technique of disciplined convex programming (DCP), and for generality and ease of implementation we use conic representations of the convex constraints. Although our framework requires a manual translation of existing models into DCP form, after performing this transformation on the MINLPLIB2 benchmark library we were able to solve a number of unsolved instances and on many other instances achieve superior performance compared with state-of-the-art solvers like Bonmin, SCIP, and Artelys Knitro.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Deep Hierarchical Super Resolution for Scientific Data

We present a novel technique for hierarchical super resolution (SR) with neural networks (NNs), which upscales volumetric data represented with an octree data structure to a high-resolution uniform gridwith minimal seam artifacts on octree node boundaries. Our method uses existing state-of-the-art SR models and adds flexibility to upscale input data with varying levels of detail across the domain, instead of only uniform grid data that are supported in previous approaches.The key is to use a hierarchy of SR NNs, each trained to perform 2x SR between two levels of detail, with a hierarchical SR algorithm that minimizes seam artifacts by starting from the coarsest level of detail and working up.We show that our hierarchical approach outperforms baseline interpolation and hierarchical upscaling methods, and demonstrate the usefulness of our proposed approach across three use cases including data reduction using hierarchical downsampling+SR instead of uniform downsampling+SR, computation savings for hierarchical finite-time Lyapunov exponent field calculation, and super-resolving low-resolution simulation results for a high-resolution approximation visualization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

The holar wind

String theory in AdS 3 with purely NS-NS fluxes and vanishing RR moduli has a continuum of winding string excitations in radial plane wave states. BTZ black holes can emit such strings, which then flow out toward the AdS 3 boundary as a stream of massive quanta, and form a black hole analogue of the solar wind. The winding string sector thus provides a decay channel for the black hole to evaporate without having either to couple the system to an external reservoir or to match the AdS 3 throat onto an asymptotically flat region. We compute the emission amplitude of this “holar wind” in the semi-classical approximation, and consider the associated version of the black hole information paradox.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2019

Optical lithography

Optical lithography is a photon-based technique comprised of projecting an image into a photosensitive emulsion (photoresist) coated onto a substrate such as a silicon wafer. It is the most widely used lithography process in the high volume manufacturing of nano-electronics by the semiconductor industry. Optical lithography’s ubiquitous use is a direct result of its highly parallel nature allowing vast amounts of information to be transferred very rapidly. For example, a modern leading edge lithography tool produces 150-300-mm patterned wafers per hour with 40-nm two-dimensional pattern resolution, yielding a pixel throughput of approximately 1.8T pixels/s. Continual advances in optical lithography capabilities have enabled the computing revolution over the past 50 years.

Naulleau, P↗
DOE OSTI2026

Speeding Up Hartree–Fock in JuliaChem with Density Fitting

In this work, the density fitting (DF) approximation is added to the restricted Hartree–Fock (RHF) implementation in the JuliaChem computational chemistry code. Utilizing a DF algorithm that uses symmetry and integral screening, a significant reduction in time to compute the Fock matrix is achieved. The symmetry and screening DF-RHF techniques were adapted to be performed on graphics processing units (GPUs), which are well suited to perform the matrix multiplications that comprise the bulk of the Fock build time in DF-RHF. The JuliaChem DF-RHF GPU algorithm employs a novel approach that automatically switches between two DF-RHF algorithms depending on the number of basis functions in the calculation. The JuliaChem GPU DF-RHF implementation demonstrates up to 2× speedup for Fock build times compared to the existing best-in-class GPU DF-RHF implementation by operating directly on screened intermediate matrices. Due to the high portability of the Julia language code, the JuliaChem CPU and GPU DF-RHF implementations could be benchmarked on a variety of CPU and GPU architectures from multiple hardware vendors.

Hayes, John J. [Ames Laboratory, and Iowa State Un↗
DOE OSTI2025

Chemical Imaging of Atmospheric Biomass Burning Particles from North American Wildfires

The effects of biomass burning aerosols (BBA) on radiative forcing and cloud formation depend on chemical composition and the internal structures of individual particles within smoke plumes. To improve our understanding of the chemical and physical properties of BBA emitted at different times of the day and their evolution during atmospheric aging, we conducted a study as a part of the Fire Influence on Regional to Global Environments and Air Quality field campaign. Particle samples were collected onboard a research aircraft from smoke plumes from a wildfire in eastern Oregon during late afternoon and nighttime flights on August 28, 2019. A time-resolved aerosol collector was used to collect samples on substrates for offline spectromicroscopic imaging to investigate the single-particle characteristics of BBA particles. Approximately 20,400 individual particles from 10 selected samples were analyzed using computer-controlled scanning electron microscopy coupled with energy-dispersive X-ray microanalysis, revealing their elemental composition, morphology, and viscosity. Elemental microanalysis indicated that aged potassium is likely found in the form of K 2 SO 4 , KNO 3 , and possible K-organic salts. Further chemical speciation and carbon bonding mapping within individual particles were conducted using synchrotron-based scanning transmission X-ray microscopy (STXM) coupled with near edge X-ray absorption fine structure (NEXAFS) spectroscopy. Real-time, water-soluble light absorption measurements were acquired using a particle-into-liquid sampler instrument coupled to a liquid waveguide capillary cell and total organic analyzer. In the late afternoon samples, 65% of the total particle number population consisted entirely of organic components, compared to 46% in the nighttime particles. These differences were attributed to discrepancies in composition at the time of emission and to the daytime condensation and accumulation of photochemically formed secondary organic material on existing BBA particles, a process that halts at night. Microscopy images indicated that particle viscosity was lower in the nighttime particles (<10 1 Pa·s), likely due to increased relative humidity and a higher contribution from hygroscopic inorganic components. The chemical heterogeneity of individual particles was quantified using STXM-derived mixing state parameters. The nature of carbon bonding within individual particles was inferred from the extent of carbon sp 2 hybridization derived from NEXAFS spectra. Average percentages of sp 2 hybridization range between 40% and 60%, with no noticeable differences between late afternoon and nighttime flights. These findings were compared with the online optical properties of both late afternoon and nighttime smoke plumes, providing valuable insights into the complex relationship between chemical composition and optical properties of BBA particles at different times of the day.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2018

Effect of hydrogenation on the structure and magnetic properties of an iron oxide cluster

The structure and properties of the Fe8O12Hn clusters (n = 0–18) are computed using the all-electron density functional theory with the generalized gradient approximation for the exchange–correlation potential. The ground state of Fe8O12 is found to be a singlet state having a bi-capped octahedron geometry. Upon hydrogenation, the octahedral framework of Fe is retained in Fe8O12Hn up to n < 7, beyond which point the iron octahedron transforms into a cube. Hydrogen atoms are bound to oxygen atoms up to n = 12, but they bind to the faces of the Fe8 cube when n > 12. The total spin magnetic moment of a Fe8O12Hn cluster is larger than 6 μB for 1 ≤ n ≤ 18, except for n = 8 and 10, where the lowest total energy states are antiferromagnetic singlets. The reason for this deviation from the general behavior in the Fe8O12Hn series is attributed to the collective superexchange phenomenon. Surprisingly, the total spin magnetic moment of a Fe8O12Hn cluster is found to be substantially larger than the total spin magnetic moment of the bare Fe8 cluster when n = 12–18. All of the Fe8O12Hn clusters are stable with respect to an abstraction of a single hydrogen atom but are unstable toward the abstraction of an H2 dimer when n =10 and n = 14–18.

Gutsev, G. L.↗