Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mathematics 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,387 records · Page 77
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

LANL ASC Vision for Computer Science R&D: "Business-as-usual will not be adequate" [Slides]

Key Messages: ASC has a strong legacy of mission contribution. Looking ahead, strategic drivers continuously push us to be faster, better, and smarter; Evolving mission drivers and technology markets mean that business-as-usual will not be adequate for the ASC Program; Call to action: How will our computer science R&D portfolio evolve to meet these challenges and opportunities?

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Revolutionizing Neuromorphic Computing for Science (Brochure on the 2024 ASCR Workshop on Neuromorphic Computing for Science)

The ASCR basic research needs for Neuromorphic Computing for Science workshop was held in September 2024. The workshop brochure and report aim to inform and draft a set of grand challenges for advancing the field of neuromorphic computing and developing proof of principle neuromorphic circuits applicable for High Performance Computer (HPC) acceleration for scientific discovery, and brainstorm ideas needed for a successful, robust, and world leading basic research program. The resulting priority research directions are: (1) Neuromorphic computing circuit primitives; (2) Connectivity, communication, and hardware integration; (3) Neuroscience-derived dynamics and algorithms; and (4) Ecosystem for scalable neuromorphic co-design. Breakthroughs in understanding, designing, and prototyping the circuitry and simulation capabilities for a truly neuromorphic computer are essential to enable progress in the field.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Revolutionizing Neuromorphic Computing for Science (Report for the 2024 ASCR Workshop on Neuromorphic Computing for Science)

The ASCR basic research needs for Neuromorphic Computing for Science workshop was held in September 2024. The workshop brochure and report aim to inform and draft a set of grand challenges for advancing the field of neuromorphic computing and developing proof of principle neuromorphic circuits applicable for High Performance Computer (HPC) acceleration for scientific discovery, and brainstorm ideas needed for a successful, robust, and world leading basic research program. The resulting priority research directions are: (1) Neuromorphic computing circuit primitives; (2) Connectivity, communication, and hardware integration; (3) Neuroscience-derived dynamics and algorithms; and (4) Ecosystem for scalable neuromorphic co-design. Breakthroughs in understanding, designing, and prototyping the circuitry and simulation capabilities for a truly neuromorphic computer are essential to enable progress in the field.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Scattering wave packets of hadrons in gauge theories: Preparation on a quantum computer

Quantum simulation holds promise of enabling a complete description of high-energy scattering processes rooted in gauge theories of the Standard Model. A first step in such simulations is preparation of interacting hadronic wave packets. To create the wave packets, one typically resorts to adiabatic evolution to bridge between wave packets in the free theory and those in the interacting theory, rendering the simulation resource intensive. In this work, we construct a wave-packet creation operator directly in the interacting theory to circumvent adiabatic evolution, taking advantage of resource-efficient schemes for ground-state preparation, such as variational quantum eigensolvers. By means of an ansatz for bound mesonic excitations in confining gauge theories, which is subsequently optimized using classical or quantum methods, we show that interacting mesonic wave packets can be created efficiently and accurately using digital quantum algorithms that we develop. Specifically, we obtain high-fidelity mesonic wave packets in the Z 2 and U(1) lattice gauge theories coupled to fermionic matter in 1+1 dimensions. Our method is applicable to both perturbative and non-perturbative regimes of couplings. The wave-packet creation circuit for the case of the Z 2 lattice gauge theory is built and implemented on the Quantinuum H1-1 trapped-ion quantum computer using 13 qubits and up to 308 entangling gates. The fidelities agree well with classical benchmark calculations after employing a simple symmetry-based noise-mitigation technique. This work serves as a step toward quantum computing scattering processes in quantum chromodynamics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Multi-Fidelity Active Subspaces for Wind Farm Uncertainty Quantification

Wind plants operate in stochastic environments characterized by complex turbulent flow dynamics and high-dimensional random variables. A key step in uncertainty quantification studies is sensitivity analysis and dimension reduction that can facilitate the development of surrogate models to be used for forward and inverse propagation or optimization under uncertainty. Prior work has shown active subspaces are an effective tool for identifying important directions in the space of stochastic inputs; however, they have only been applied to single-fidelity wind plant models. In this study, we investigate the efficacy of a multi-fidelity active subspace method for analyzing the uncertainty in wind plant power output. The multi-fidelity active subspace estimator offers the promise of increased accuracy in identifying active subspaces as compared to a single-fidelity estimator for the same computational cost, or a reduction in cost for the same accuracy. This makes the study of uncertainty in larger wind plants and with higher fidelity physics tractable. The multi-fidelity active subspace method is applied to gridded and existing wind plant layouts with single and multiple inflow conditions and its performance for surrogate modeling and uncertainty propagation is compared against a single-fidelity active subspace method. This multi-fidelity approach yields substantial computational speedups of 2x - 3.4x across the test cases along with acceptable accuracy in surrogate modeling and computing statistical moments.

active subspace↗
NASA NTRS1984

Vectorized Monte Carlo methods for reactor lattice analysis

Some of the new computational methods and equivalent mathematical representations of physics models used in the MCV code, a vectorized continuous-enery Monte Carlo code for use on the CYBER-205 computer are discussed. While the principal application of MCV is the neutronics analysis of repeating reactor lattices, the new methods used in MCV should be generally useful for vectorizing Monte Carlo for other applications. For background, a brief overview of the vector processing features of the CYBER-205 is included, followed by a discussion of the fundamentals of Monte Carlo vectorization. The physics models used in the MCV vectorized Monte Carlo code are then summarized. The new methods used in scattering analysis are presented along with details of several key, highly specialized computational routines. Finally, speedups relative to CDC-7600 scalar Monte Carlo are discussed.

Brown, F. B.↗
DOE OSTI2022

ARPIST: Provably accurate and stable numerical integration over spherical triangles

Numerical integration on spherical triangles, including the computation of their areas, is a core computation in geomathematics. The commonly used techniques sometimes suffer from instabilities and significant loss of accuracy. We describe a new algorithm, called ARPIST, for accurate and stable integration of functions on spherical triangles. ARPIST is based on an easy-to-implement transformation to the spherical triangle from its corresponding linear triangle via radial projection to achieve high accuracy and efficiency. More importantly, ARPIST overcomes potential instabilities in computing the Jacobian of the transformation, even for poorly shaped triangles that may occur at poles in regular longitude-latitude meshes, by avoiding potential catastrophic rounding errors. We compare our proposed technique with L’Huilier’s Theorem for computing the area of spherical triangles, and also compare it with the recently developed LSQST method (Beckmann et al., 2014) and a radial-basis-function-based technique (Reeger and Fornberg, 2016) for integration of smooth functions on spherical triangulations. In conclusion, our results show that ARPIST enables better or comparable accuracy over previous methods while being easier to implement, significantly faster, and more tolerant of poor element shapes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Accurate Prediction of pKb in Amines: Validation of the CAM-B3LYP/6-311+G(d,p)/SMD Model

Amines play several key roles in chemistry and biology and are involved in numerous industrial processes, often with significant economic impacts. Recently, amines are also garnering interest as catalysts for polymer synthesis and for CO 2 fixation, incentivizing the need to rapidly design and screen new amino compounds. Hence, developing reliable methods to predict their physicochemical properties, e.g., the base dissociation constant (pKb), is pivotal. Here, a density functional theory (DFT)-based approach was employed to compute the pKb of substituted amines, exploring the impact of several key parameters, including (i) the number of explicit water molecules at the reaction center, (ii) the van der Waals (vdW) surface, and (iii) solvent polarizability. In previous work, it was determined that including two explicit water molecules at the reaction center resulted in highly accurate pKb estimates for primary amines. Here, we find that including a third water molecule at the reaction center is essential for accurate pKb for secondary and tertiary amines. The revised methodology was then applied to a wider selection of amines, obtaining a minimum average error (MAE) < 0.4. In conclusion, this result represents an extension of our “easy-to-use method,” a simple and direct DFT approach exploiting CAM-B3LYP/SMD/6-311G+(d,p) to compute pKb without post facto modifications.

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

A 1D–0D–3D coupled model for simulating blood flow and transport processes in breast tissue

In this work, we present mixed dimensional models for simulating blood flow and transport processes in breast tissue and the vascular tree supplying it. These processes are considered, to start from the aortic inlet to the capillaries and tissue of the breast. Large variations in biophysical properties and flow conditions exist in this system necessitating the use of different flow models for different geometries and flow regimes. In total, we consider four different model types. First, a system of 1D nonlinear hyperbolic partial differential equations (PDEs) is considered to simulate blood flow in larger arteries with highly elastic vessel walls. Second, we assign 1D linearized hyperbolic PDEs to model the smaller arteries with stiffer vessel walls. The third model type consists of ODE systems (0D models). It is used to model the arterioles and peripheral circulation. Finally, homogenized 3D porous media models are considered to simulate flow and transport in capillaries and tissue within the breast volume. Sink terms are used to account for the influence of the venous and lymphatic systems. Combining the four model types, we obtain two different 1D–0D–3D coupled models for simulating blood flow and transport processes: The first model results in a fully coupled 1D–0D–3D model covering the complete path from the aorta to the breast combining a generic arterial network with a patient specific breast network and geometry. The second model is a reduced one based on the separation of the generic and patient specific parts. The information from a calibrated fully coupled model is used as inflow condition for the patient specific sub-model allowing a significant computational cost reduction. Several numerical experiments are conducted to calibrate the generic model parameters and to demonstrate realistic flow simulations compared to existing data on blood flow in the human breast and vascular system. Moreover, we use two different breast vasculature and tissue data sets to illustrate the robustness of our reduced sub-model approach.

multiscale blood flow models↗
DOE OSTI2020

Resource-Efficient Chemistry on Quantum Computers with the Variational Quantum Eigensolver and The Double Unitary Coupled-Cluster approach

Applications of quantum simulation algorithms to obtain electronic energies of molecules on noisy intermediate-scale quantum (NISQ) devices require careful consideration of resources describing the complex electron correlation effects. In modeling second-quantized problems, the biggest challenge confronted is that the number of qubits scales linearly with the size of molecular basis. This poses a significant limitation on the size of the basis sets and the number of correlated electrons included in quantum simulations of chemical processes. To address this issue and to enable more realistic simulations on NISQ computers, we employ the double unitary coupled-cluster (DUCC) method to effectively downfold correlation effects into the reduced-size orbital space, commonly referred to as the active space. Using downfolding techniques, we demonstrate that properly constructed effective Hamiltonians can capture the effect of the whole orbital space in small-size active spaces. Combining the downfolding pre-processing technique with the Variational Quantum Eigensolver, we solve for the ground-state energy of H2 and Li2 in the cc-pVTZ basis using the DUCC-reduced active spaces. We compare these results to full configuration-interaction and high-level coupled-cluster reference calculations.

quantum computing, variational quantum solver, cou↗
DOE OSTI2023

Deep Koopman learning of nonlinear time-varying systems

Here this paper presents a data-driven approach to approximate the dynamics of a nonlinear time-varying system (NTVS) by a linear time-varying system (LTVS), which results from the Koopman operator and deep neural networks. Analysis of the approximation error between states of the NTVS and the resulting LTVS is presented. Simulations on a representative NTVS show that the proposed method achieves small approximation errors, even when the system changes rapidly. Furthermore, simulations in an example of quadcopters demonstrate the computational efficiency of the proposed approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Boundaries of quantum supremacy via random circuit sampling

Abstract Google’s quantum supremacy experiment heralded a transition point where quantum computers can evaluate a computational task, random circuit sampling, faster than classical supercomputers. We examine the constraints on the region of quantum advantage for quantum circuits with a larger number of qubits and gates than experimentally implemented. At near-term gate fidelities, we demonstrate that quantum supremacy is limited to circuits with a qubit count and circuit depth of a few hundred. Larger circuits encounter two distinct boundaries: a return of a classical advantage and practically infeasible quantum runtimes. Decreasing error rates cause the region of a quantum advantage to grow rapidly. At error rates required for early implementations of the surface code, the largest circuit size within the quantum supremacy regime coincides approximately with the smallest circuit size needed to implement error correction. Thus, the boundaries of quantum supremacy may fortuitously coincide with the advent of scalable, error-corrected quantum computing.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Neural units with time-dependent functionality

We show that the time-resolved dynamics of an underdamped harmonic oscillator can be used to do multifunctional computation, performing distinct computations at distinct times within a single dynamical trajectory. We consider the amplitude of an oscillator whose inputs influence its frequency. The activity of the oscillator at fixed times is a nonmonotonic function of its inputs, so it can solve problems such as XOR that are not linearly separable. The activity of the oscillator at fixed input is a nonmonotonic function of time, so it is multifunctional in a temporal sense, and able to carry out distinct nonlinear computations at distinct times within the same dynamical trajectory. We show that a single oscillator, observed at different times, can act as all of the elementary logic gates and perform binary addition, the latter usually implemented in hardware using five logic gates. We show that a set of n oscillators, observed at different times, can perform an arbitrary number of analog-to-n-bit digital conversions. We also show that oscillators can be trained by gradient descent to perform distinct classification tasks at distinct times. Computing with time-dependent functionality can be done in or out of equilibrium, and suggests a way of reducing the number of parameters or devices required to do nonlinear computations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Mode-multiplexed photonic integrated vector dot-product core from inverse design

Photonic computing has the potential to harness the full degrees of freedom (DOFs) of the light field, including the wavelength, spatial mode, spatial location, phase quadrature, and polarization, to achieve a higher level of computing parallelism and scalability than digital electronic processors. While multiplexing using the wavelength and other DOFs can be readily integrated on silicon photonics platforms with compact footprints, conventional mode-division multiplexed (MDM) photonic designs occupy areas exceeding tens to hundreds of microns for a few spatial modes, significantly limiting their scalability. Here, we utilize inverse design to demonstrate an ultracompact photonic computing core that calculates vector dot products based on MDM coherent mixing. Our dot-product core integrates the functionalities of two-mode multiplexers and one multimode coherent mixer within a nominal footprint of 5 μm x 3 μm . We have experimentally demonstrated computing examples on the fabricated dot-product core, including complex number multiplication and motion estimation using optical flow. The compact dot-product core design enables large-scale on-chip integration in a parallel photonic computing primitive cluster for high-throughput scientific computing and computer vision tasks.

97 MATHEMATICS AND COMPUTING↗