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,009 records · Page 56

Theory and numerics of subspace approximation of eigenvalue problems

Large-scale eigenvalue problems arise in various fields of science and engineering and demand computationally efficient solutions. In this study, we investigate the subspace approximation for parametric linear eigenvalue problems, aiming to mitigate the computational burden associated with high-fidelity systems. Furthermore, we provide general error estimates under non-simple eigenvalue conditions, establishing some theoretical foundations for understanding the convergence behavior of subspace approximations. Numerical examples, including problems with one-dimensional to three-dimensional spatial domain and one-dimensional to two-dimensional parameter domain, are presented to demonstrate the efficacy of reduced basis method in handling parametric variations in boundary conditions and coefficient fields to achieve significant computational savings while maintaining high accuracy, making them promising tools for practical applications in large-scale eigenvalue computations.

Eigenvalue problems↗

A localized ensemble of approximate Gaussian processes for fast sequential emulation

More attention has been given to the computational cost associated with the fitting of an emulator. Substantially less attention is given to the computational cost of using that emulator for prediction. This is primarily because the cost of fitting an emulator is usually far greater than that of obtaining a single prediction, and predictions can often be obtained in parallel. In many settings, especially those requiring Markov Chain Monte Carlo, predictions may arrive sequentially and parallelization is not possible. In this case, using an emulator procedure which can produce accurate predictions efficiently can lead to substantial time savings in practice. In this paper, we propose a global model approximate Gaussian process framework via extension of a popular local approximate Gaussian process (laGP) framework. Our proposed emulator can be viewed as a treed Gaussian process where the leaf nodes are laGP models, and the tree structure is learned greedily as a function of the prediction stream. The suggested method (called leapGP) has interpretable tuning parameters which control the time‐memory trade‐off. One reasonable choice of settings leads to an emulator with a training cost and makes predictions rapidly with an asymptotic amortized cost of .

97 MATHEMATICS AND COMPUTING↗

Chasing the limits of the one electron approximation

Rapid progress in the development of computational methods for quantum chemistry is not properly balanced by the development of basis sets. Even in the case of few-electron systems it is hard to find basis set which are able to reproduce the ECG benchmarks with the mhartree accuracy. In this paper we show early work on improvements of the basis sets for small atomic and molecular systems. As a starting point the ground state of lithium atom and the lowest states of lithium dimer will be investigated. The exploratory optimization of the exponents of primitive gaussians will be based on even tempered scheme combined with CISD method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An analytical and numerical study of the nonlinear reflection at a stress-free surface

Implementation of the ultrasonic second harmonic generation has typically been restricted to simple setups such as through-transmission or Rayleigh surface waves. Recent research has evaluated the second harmonic waves generation in P- and SV- waves reflected from a stress-free surface to enable the single-sided interrogation of a specimen. This research considers the second harmonic generation in an aluminum specimen, which is analytically evaluated using an approach based on a perturbation method. Here, the model is chosen to mimic an experimental setup where the longitudinal wave is generated at oblique angle using a wedge transducer. Due to the mode conversion at the interface of the wedge and the specimen, it is necessary to evaluate longitudinal and shear waves, determining all second harmonic waves generated in the bulk and at the stress-free boundary. The theoretically developed model is then implemented in a commercial finite element code, COMSOL, using increasing fundamental wave amplitudes for different values of third order elastic constants. The results of this computational model verify the analytical approach and the proposed measurement setup, taking into account assumptions and approximations of the solution procedure. Furthermore, the computational model is used to draw important conclusions relevant to the experimental setup, including the need to avoid interaction with diffracted waves.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Green's function for the time-dependent scattering problem in the fractional quantum mechanics

We study the Green's function of the time-dependent 3D space-fractional Schroedinger equation for the scattering problem in the fractional quantum mechanics. The Green's function is expressed in terms of Fox's H-function and in a computable series form. We get the asymptotic formula of the Green's function, and apply it to obtain the approximate wave function for the fractional quantum scattering problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computing resonant modes of accelerator cavities by solving nonlinear eigenvalue problems via rational approximation

Here, we present an efficient and reliable algorithm for solving a class of nonlinear eigenvalue problems arising from the modeling of particle accelerator cavities. The eigenvalue nonlinearity in these problems results from the use of waveguides to couple external power sources or to allow certain excited electromagnetic modes to exit the cavity. We use a rational approximation to reduce the nonlinear eigenvalue problem first to a rational eigenvalue problem. We then apply a special linearization procedure to turn the rational eigenvalue problem into a larger linear eigenvalue problem with the same eigenvalues, which can be solved by existing iterative methods. By using a compact scheme to represent both the linearized operator and the eigenvectors to be computed, we obtain a numerical method that only involves solving linear systems of equations of the same dimension as the original nonlinear eigenvalue problem. We refer to this method as a compact rational Krylov (CORK) method. We implemented the CORK method in the Omega3P module of the Advanced Computational Electromagnetic 3D Parallel (ACE3P) simulation suite and validated it by comparing the computed cavity resonant frequencies and damping Q factors of a small model problem to those obtained from a fitting procedure that uses frequency responses computed by another ACE3P module called S3P. We also used the CORK method to compute trapped modes damped in an ideal eight 9-cell SRF cavity cryomodule. This was the first time it was possible to compute these modes directly. The damping Q factors of the computed modes match well with those measured in experiments and the difference in resonant frequencies is within the range introduced by cavity imperfection. Therefore, the CORK method is an extremely valuable tool for computational cavity design.

43 PARTICLE ACCELERATORS↗

Learning nonlinear operators in latent spaces for real-time predictions of complex dynamics in physical systems

Abstract Predicting complex dynamics in physical applications governed by partial differential equations in real-time is nearly impossible with traditional numerical simulations due to high computational cost. Neural operators offer a solution by approximating mappings between infinite-dimensional Banach spaces, yet their performance degrades with system size and complexity. We propose an approach for learning neural operators in latent spaces, facilitating real-time predictions for highly nonlinear and multiscale systems on high-dimensional domains. Our method utilizes the deep operator network architecture on a low-dimensional latent space to efficiently approximate underlying operators. Demonstrations on material fracture, fluid flow prediction, and climate modeling highlight superior prediction accuracy and computational efficiency compared to existing methods. Notably, our approach enables approximating large-scale atmospheric flows with millions of degrees, enhancing weather and climate forecasts. Here we show that the proposed approach enables real-time predictions that can facilitate decision-making for a wide range of applications in science and engineering.

97 MATHEMATICS AND COMPUTING↗

Matrix interdiction problem

In the matrix interdiction problem, a real-valued matrix and an integer k is given. The objective is to remove k columns such that the sum over all rows of the maximum entry in each row is minimized. This combinatorial problem is closely related to bipartite network interdiction problem which can be applied to prioritize the border checkpoints in order to minimize the probability that an adversary can successfully cross the border. After introducing the matrix interdiction problem, we will prove the problem is NP-hard, and even NP-hard to approximate with an additive n{gamma} factor for a fixed constant {gamma}. We also present an algorithm for this problem that achieves a factor of (n-k) mUltiplicative approximation ratio.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Initial-State Dependent Optimization of Controlled Gate Operations with Quantum Computer

There is no unique way to encode a quantum algorithm into a quantum circuit. With limited qubit counts, connectivity, and coherence times, a quantum circuit optimization is essential to make the best use of near-term quantum devices. We introduce a new circuit optimizer called AQCEL, which aims to remove redundant controlled operations from controlled gates, depending on initial states of the circuit. Especially, the AQCEL can remove unnecessary qubit controls from multi-controlled gates in polynomial computational resources, even when all the relevant qubits are entangled, by identifying zero-amplitude computational basis states using a quantum computer. As a benchmark, the AQCEL is deployed on a quantum algorithm designed to model final state radiation in high energy physics. For this benchmark, we have demonstrated that the AQCEL-optimized circuit can produce equivalent final states with much smaller number of gates. Moreover, when deploying AQCEL with a noisy intermediate scale quantum computer, it efficiently produces a quantum circuit that approximates the original circuit with high fidelity by truncating low-amplitude computational basis states below certain thresholds. Our technique is useful for a wide variety of quantum algorithms, opening up new possibilities to further simplify quantum circuits to be more effective for real devices.

97 MATHEMATICS AND COMPUTING↗

Goal-oriented real-time Bayesian inference for linear autonomous dynamical systems with application to digital twins for tsunami early warning

We present a goal-oriented framework for constructing digital twins with the following properties: (1) they employ discretizations of high-fidelity partial differential equation (PDE) models governed by autonomous dynamical systems, leading to large-scale forward problems; (2) they solve a linear inverse problem to assimilate observational data to infer uncertain model components followed by a forward prediction of the evolving dynamics; and (3) the entire end-to-end, data-to-inference-to-prediction computation is carried out without approximation and in real time through a Bayesian framework that rigorously accounts for uncertainties. Several challenges must be overcome to realize this framework, including the large scale of the forward problem, the high dimensionality of the parameter space, and for a class of problems including those we target, the slow decay of the singular values of the parameter-to-observable map. Here we introduce a methodology to overcome these challenges by exploiting the autonomous structure of the forward model to decompose the solution of the inverse problem into a one-time-only offline phase in which the PDE model is solved a limited number of times (equal to the number of sensors), and an online phase that maps well onto GPUs and computes the parameter inference and prediction of quantities of interest in real time, given observational data. Our ultimate goal is to apply this framework to construct digital twins for subduction zones, including Cascadia, to provide early warning for tsunamis generated by megathrust earthquakes. To this end, we demonstrate how our methodology can be used to employ seafloor pressure observations, along with the coupled acoustic–gravity wave equations, to infer the earthquake-induced spatiotemporal seafloor motion (discretized with $\mathscr{O}$ (10 9 ) parameters) and forward predict the tsunami propagation. We present results of an end-to-end inference, prediction, and uncertainty quantification for a representative test problem with $\mathscr{O}$ (10 8 ) inversion parameters for which goal-oriented Bayesian inference is accomplished exactly and in real time, that is, in a matter of seconds.

97 MATHEMATICS AND COMPUTING↗

Efficient electronic structure theory via hierarchical scale-adaptive coupled-cluster formalism: I. Theory and computational complexity analysis

In this work, a novel reduced-scaling, general-order coupled-cluster approach is formulated by exploiting hierarchical representations of many-body tensors, combined with the recently suggested formalism of scale-adaptive tensor algebra. Inspired by the hierarchical techniques from the renormalization group approach, H/H 2 -matrix algebra and fast multipole method, the computational scaling reduction in our formalism is achieved via coarsening of quantum many-body interactions at larger interaction scales, thus imposing a hierarchical structure on many-body tensors of coupled-cluster theory. In our approach, the interaction scale can be defined on any appropriate Euclidean domain (spatial domain, momentum-space domain, energy domain, etc.). Additionally, we show that the hierarchically resolved many-body tensors reduce the storage requirements to O(N), where N is the number of simulated quantum particles. Subsequently, we prove that any connected many-body diagram with arbitrary-order tensors, e.g., an arbitrary coupled-cluster diagram, can be evaluated in O(NlogN) floating-point operations. On top of that, we elaborate an additional approximation to further reduce the computational complexity of higher-order coupled-cluster equations, i.e., equations involving higher than double excitations, which otherwise would introduce a large prefactor into formal O(NlogN) scaling.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum transitions through cosmological singularities

In a quantum theory of cosmology spacetime behaves classically only in limited patches of the configuration space on which the wave function of the universe is defined. Quantum transitions can connect classical evolution in different patches. Working in the saddle point approximation and in minisuperspace we compute quantum transitions connecting inflationary histories across a de Sitter like throat or a singularity. This supplies probabilities for how an inflating universe, when evolved backwards, transitions and branches into an ensemble of histories on the opposite side of a quantum bounce. Generalising our analysis to scalar potentials with negative regions we identify saddle points describing a quantum transition between a classically contracting, crunching ekpyrotic phase and an inflationary universe.

79 ASTRONOMY AND ASTROPHYSICS↗

Generative diffusion model surrogates for mechanistic agent-based biological models

Mechanistic, multicellular, agent-based models are commonly used to investigate tissue, organ, and organism-scale biology at single-cell resolution. The Cellular-Potts Model (CPM) is a powerful and popular framework for developing and interrogating these models. CPMs become computationally expensive at large space- and time- scales making application and investigation of developed models difficult. Surrogate models may allow for the accelerated evaluation of CPMs of complex biological systems. However, the stochastic nature of these models means each set of parameters may give rise to different model configurations, complicating surrogate model development. In this work, we leverage denoising diffusion probabilistic models (DDPMs) to train a generative AI surrogate of a CPM used to investigate in vitro vasculogenesis. We describe the use of an image classifier to learn the characteristics that define unique areas of a 2-dimensional parameter space. We then apply this classifier to aid in surrogate model selection and verification. Our CPM model surrogate generates model configurations 20,000 timesteps ahead of a reference configuration and demonstrates approximately a 22x reduction in computational time as compared to native code execution. Our work represents a step towards the implementation of DDPMs to develop digital twins of stochastic biological systems.

97 MATHEMATICS AND COMPUTING↗

Interface PINNs (I-PINNs): A physics-informed neural networks framework for interface problems

Here, we present a novel physics-informed neural networks (PINNs) framework for modeling interface problems, termed Interface PINNs (I-PINNs). I-PINNs uses different neural networks for any two subdomains separated by a sharp interface such that the neural networks differ only through their activation functions while the other parameters remain identical. The performance of I-PINNs, conventional PINNs, and other existing domain-decomposition PINNs methods such as extended PINNs (XPINNs) and multi-domain PINN (M-PINN) is compared through several one-dimensional, two-dimensional, and three-dimensional benchmark elliptic interface problems. The results demonstrate that I-PINNs provides a root-mean-square-error accuracy, at least two orders of magnitude better than conventional PINNs and XPINNs at approximately one-tenth of the computational cost of conventional PINNs and half the cost of XPINNs. Additionally, while I-PINNs and M-PINN provide comparable accuracies, M-PINN is found to be approximately 50% more expensive.

42 ENGINEERING↗

Excited State Phenomena in Correlated Nanostructures: Transition Metal Oxide Clusters and Nanocrystals

The primary goal of our research program was to apply advanced computational techniques to predict electronic properties of molecular species. These include transition metal monoxide and dioxide clusters and negatively charged copper oxide clusters which are important systems for their utilization in a variety of technological applications. The enhanced electron-electron interactions inherent in these systems make it challenging to model their excited state properties within a parameter-free approach. The excited state properties in question include the interaction of light with these molecules which results in ejection of electrons from the system, or the absorption of light by the molecular system resulting in a molecule in a higher-energy state. Our overall goal was to investigate the impact of various computational and theoretical approaches on such electronic and optical excitations in these systems. Comparing several variants of theoretical approaches with available experimental data, and high-level quantum chemistry computations helped us identify the level of theory and approximations that are needed to achieve a reasonable balance between accuracy and computational demand.

74 ATOMIC AND MOLECULAR PHYSICS↗

Planck intermediate results: XLIV. Structure of the Galactic magnetic field from dust polarization maps of the southern Galactic cap

Using data from the Planck satellite, we study in this paper the statistical properties of interstellar dust polarization at high Galactic latitudes around the south pole (b < -60°). Our aim is to advance the understanding of the magnetized interstellar medium (ISM), and to provide a modelling framework of the polarized dust foreground for use in cosmic microwave background (CMB) component-separation procedures. We examine the Stokes I, Q, and U maps at 353 GHz, and particularly the statistical distribution of the polarization fraction (p) and angle (ψ), in order to characterize the ordered and turbulent components of the Galactic magnetic field (GMF) in the solar neighbourhood. The Q and U maps show patterns at large angular scales, which we relate to the mean orientation of the GMF towards Galactic coordinates (l 0 ,b 0 ) = (70° ± 5°,24° ± 5°). The histogram of the observed p values shows a wide dispersion up to 25%. The histogram of ψ has a standard deviation of 12° about the regular pattern expected from the ordered GMF. We build a phenomenological model that connects the distributions of p and ψ to a statistical description of the turbulent component of the GMF, assuming a uniform effective polarization fraction (p 0 ) of dust emission. To compute the Stokes parameters, we approximate the integration along the line of sight (LOS) as a sum over a set of N independent polarization layers, in each of which the turbulent component of the GMF is obtained from Gaussian realizations of a power-law power spectrum. We are able to reproduce the observed p and ψ distributions using a p 0 value of 26%, a ratio of 0.9 between the strengths of the turbulent and mean components of the GMF, and a small value of N. The mean value of p (inferred from the fit of the large-scale patterns in the Stokes maps) is 12 ± 1%. We relate the polarization layers to the density structure and to the correlation length of the GMF along the LOS. We emphasize the simplicity of our model (involving only a few parameters), which can be easily computed on the celestial sphere to produce simulated maps of dust polarization. Finally, our work is an important step towards a model that can be used to assess the accuracy of component-separation methods in present and future CMB experiments designed to search the B mode CMB polarization from primordial gravity waves.

79 ASTRONOMY AND ASTROPHYSICS↗

An Investigation into the Approximations Used in Wave Packet Molecular Dynamics for the Study of Warm Dense Matter

Wave packet molecular dynamics (WPMD) has recently received a lot of attention as a computationally fast tool with which to study dynamical processes in warm dense matter beyond the Born–Oppenheimer approximation. These techniques, typically, employ many approximations to achieve computational efficiency while implementing semi-empirical scaling parameters to retain accuracy. We investigated three of the main approximations ubiquitous to WPMD: a restricted basis set, approximations to exchange, and the lack of correlation. We examined each of these approximations in regard to atomic and molecular hydrogen in addition to a dense hydrogen plasma. We found that the biggest improvement to WPMD comes from combining a two-Gaussian basis with a semi-empirical correction based on the valence-bond wave function. A single parameter scales this correction to match experimental pressures of dense hydrogen. Ultimately, we found that semi-empirical scaling parameters are necessary to correct for the main approximations in WPMD. However, reducing the scaling parameters for more ab-initio terms gives more accurate results and displays the underlying physics more readily.

Angermeier, William A. (ORCID:0000000177161564)↗

Fast and Scalable Implementations of Influence Maximization Algorithms

The Influence Maximization problem has been extensively studied in the past decade because of its practical applications in finding the key influencers in social networks. Due to the hardness of the underlying problem, existing algorithms have tried to trade off practical efficiency with approximation guarantees. However, even such approximate solutions take several hours of compute time on modest sized real world inputs. On the other hand, there is a lack of effective parallel and distributed algorithms to solve this problem. In this paper, we present efficient parallel algorithms for multithreaded and distributed systems to solve the influence maximization with approximation guarantee. Our algorithms extend state-of-the-art sequential approach based on computing reverse reachability sets. We present a detailed experimental evaluation, and analyze their performance and their sensitivity to input parameters, using real world inputs. Our experimental results demonstrate significant speedup on parallel architectures. We further show a speedup of up to 586X relative to the state-of-the-art sequential baseline using 1024 nodes of a supercomputer at far greater accuracy and twice the seed set size. To the best of our knowledge, this is the first effort in parallelizing the influence maximization operation at scale.

Minutoli, Marco↗