Search NASA⌕ Search

SEARCH · Search NASA

Results for “computer experiments”

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 181 records · Page 10

A posteriori superlinear convergence bounds for block conjugate gradient

In this paper, we extend to the block case the a posteriori bound showing superlinear convergence of the conjugate gradient method developed by van der Vorst and Vuik in [J. Comput. Applied Math., 48 (1993), pp. 327–341]. That is, we obtain similar bounds but now for the block conjugate gradient method. We also present a series of computational experiments, illustrating the validity of the bound developed here as well as the bound by Simoncini and Szyld from [SIAM Review, 47 (2005), pp. 247–272] using angles between subspaces. Using these bounds, we make some observations on the onset of superlinearity and how this onset depends on the eigenvalue distribution and the block size.

97 MATHEMATICS AND COMPUTING↗

Classical-Quantum Algorithm for Solving Stochastic Programs

Stochastic programming provides a rigorous mathematical framework for making decisions under uncertainty in a risk-aware manner. Two-stage stochastic programming is, perhaps, the simplest form of this framework. Here the first-stage variables represent decisions that must be made "here and now" in the face of uncertainty, while the second-stage variables are decisions made after uncertain events. However, the broad adoption of stochastic programming has been hindered by computational challenges caused by the two-stage stochastic programming formulation which requires solving an ensemble of optimization problems. Using quantum amplitude estimation (QAE), quantum computers have shown the theoretic ability to compute expectations with Monte-Carlo methods with quadratically fewer samples than classical methods. In this work, we present a quantum algorithm for computing the expectation term using QAE for given first-stage decisions. Further, we detail methods of computing gradient information from the quantum calculation enabling the application of classical gradient-based optimization techniques. The result is a classical-quantum hybrid method of solving two-stage stochastic programs. These techniques are demonstrated with computational experiments based an engineering optimization problem.

97 MATHEMATICS AND COMPUTING↗

Highlights of X-Stack ExM Deliverable Swift/T

Swift/T is a key success from the ExM: System support for extreme-scale, many-task applications1 X-Stack project, which proposed to use concurrent dataflow as an innovative programming model to exploit extreme parallelism in exascale computers. The Swift/T component of the project reimplemented the Swift language from scratch to allow applications that compose scientific modules together to be build and run on available petascale computers (Blue Gene, Cray). Swift/T does this via a new compiler and runtime that generates and executes the application as an MPI program. We assume that mission-critical emerging exascale applications will be composed as scalable applications using existing software components, connected by data dependencies. Developers wrap native code fragments using a higherlevel language, then build composite applications to form a computational experiment. This exemplifies hierarchical concurrency: lower-level messaging libraries are used for fine-grained parallelism; highlevel control is used for inter-task coordination. These patterns are best expressed with dataflow, but static DAGs (i.e., other workflow languages) limit the applications that can be built; they do not provide the expressiveness of Swift, such as conditional execution, iteration, and recursive functions.

97 MATHEMATICS AND COMPUTING↗

Efficiency of Uncertainty Propagation Methods for Estimating Output Moments

Uncertainty propagation methods are used to estimate the distribution of model outputs resulting from a set of uncertain model outputs. There are a number of uncertainty propagation methods available in literature. This paper compares six non-intrusive uncertainty propagation methods, Latin Hypercube Sampling, Full Factorial Integration, Univariate Dimension Reduction, Halton series, Sobol series, and Polynomial Chaos Expansion, in terms of their efficiency for estimating the first four moments of the output distribution using computational experiments. Here, the results suggest employing FFNI if there are few uncertain inputs, up to three. Uncertainty propagation methods that utilize Halton and Sobol series are found to be robust for estimating output moments as the number of uncertain inputs increases. In general, higher order polynomial chaos expansion approximations (3rd-5th order) obtained accurate estimates of model outputs with fewer model evaluations.

97 MATHEMATICS AND COMPUTING↗

On Mixed Integer Programming Formulations for the Unit Commitment Problem

We provide a comprehensive overview of mixed integer programming formulations for the unit commitment problem (UC). UC formulations have been an especially active area of research over the past twelve years, due to their practical importance in power grid operations, and this paper serves as a capstone for this line of work. We additionally provide publicly available reference implementations of all formulations examined. We computationally test existing and novel UC formulations on a suite of instances drawn from both academic and real-world data sources. Driven by our computational experience from this and previous work, we contribute some additional formulations for both production upper bound and piecewise linear produc- tion costs. By composing new UC formulations using existing components found in the literature and new components introduced in this paper, we demonstrate that performance can be significantly improved – and in the process, we identify a new state-of-the-art UC formulation.

97 MATHEMATICS AND COMPUTING↗

Faster solutions to the interdiction defense problem using suboptimal solutions

The interdiction defense (ID) problem solves a defender-attacker-defender model where the defender and attacker share the same set of components to harden and target. Here, we build upon the best response intersection (BRI) algorithm by developing the BRI with suboptimal solutions (BRI-SS) algorithm to solve the ID problem. The BRI-SS algorithm utilizes off-the-shelf optimization solvers that return suboptimal solutions at no additional computation cost. We derive novel cuts from suboptimal solutions, reducing the number of iterations required for the algorithm to converge while maintaining optimality guarantees. We also present a heuristic that utilizes all obtained suboptimal solutions to select the next defense to evaluate at each iteration. We perform computational experiments applied to power grid interdiction on standard test cases. Our results demonstrate that the BRI-SS algorithm consistently outperforms the BRI algorithm across all test cases.

Computer science↗

Systemwide Planning with a Branch-and-Price Algorithm for Pavement-Marking Assessment Data Collection via the Mobile Retroreflectivity Unit Routing Model

The visibility of pavement markings is one of the most critical factors for traffic safety, and a periodical assessment plan is crucial for maintaining this function. Traditional assessment methods, such as visual windshield surveys or manual testing using handheld devices, are unsafe, time-consuming, and labor-intensive. In recent years, transportation agencies have begun to adopt the use of mobile retroreflectivity units (MRUs) for condition assessment of pavement markings. MRUs, different from other manual methods, can be utilized to collect large-scale retroreflectivity data in an efficient manner. However, no relevant research has yet proposed a mathematical optimization model for arranging the evaluation schedule and paths of MRUs. This study aims to propose a MRU routing model, and an efficient solution methodology. A branch-and-price algorithm, including column generation and branch-and-bound, was implemented. Computational experiments have been conducted based on actual tasks from the Florida MRU program for validation. In conclusion, results show that the proposed solution methodology with a set partitioning model in this study not only finds the optimal solution for problems with tasks less than 60, but also effectively narrows the solution gap to be within 1.0% for problems with tasks less than 131.

42 ENGINEERING↗

On Mixed-Integer Programming Formulations for the Unit Commitment Problem

We provide a comprehensive overview of mixed-integer programming formulations for the unit commitment (UC) problem. UC formulations have been an especially active area of research over the past 12 years due to their practical importance in power grid operations, and this paper serves as a capstone for this line of work. We additionally provide publicly available reference implementations of all formulations examined. We computationally test existing and novel UC formulations on a suite of instances drawn from both academic and real-world data sources. Driven by our computational experience from this and previous work, we contribute some additional formulations for both generator production upper bounds and piecewise linear production costs. By composing new UC formulations using existing components found in the literature and new components introduced in this paper, we demonstrate that performance can be significantly improved—and in the process, we identify a new state-of-the-art UC formulation.

97 MATHEMATICS AND COMPUTING↗

Foundational Science to Accelerate Nuclear Energy Innovation [Brochure]

The foundational science gaps inhibiting the advancement of nuclear energy technologies are identified and tackled in five priority research opportunities. These opportunities pave the way to accelerate the development and ultimately the adoption of new nuclear energy systems. They include the fundamental aspects of ion-electron interactions; novel properties of next-generation coolants and solvents; interfacial dynamics, not only in solids, but in other aspects of nuclear reactors; novel operando and in-situ monitoring and sensing; and artificial intelligence to accelerate condensed phases discovery. Building on the foundation established by previous BES workshops, these opportunities encompass recent advances in fundamental knowledge and focus on the experimental and computational methods needed to resolve major technical challenges for nuclear energy technologies. Through developing fundamental scientific insight as well as pushing the frontiers of modeling complex systems and probing the operation of materials and chemical systems in extreme environments, research motivated by the priorities identified here will further develop the promise, potential, and utilization of nuclear energy for a clean energy future. The PROs are as follows: (1) Master complex electronic structures to tailor thermochemical reactivity, transport, and microstructural evolution; (2) Interrogate and direct the physics and chemistry underpinning next-generation coolants and solvents; (3) Elucidate and control the underlying physics and chemistry of interfaces in complex nuclear environments; (4) Bridge multi-fidelity multi-resolution experiments, computational modeling, and data science to control dynamic behavior; and (5) Harness artificial intelligence to design inherently resilient condensed phases.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Divide and Conquer (DC) BLAST: fast and easy BLAST execution within HPC environments

Bioinformatics is currently faced with very large-scale data sets that lead to computational jobs, especially sequence similarity searches, that can take absurdly long times to run. For example, the National Center for Biotechnology Information (NCBI) Basic Local Alignment Search Tool (BLAST and BLAST+) suite, which is by far the most widely used tool for rapid similarity searching among nucleic acid or amino acid sequences, is highly central processing unit (CPU) intensive. While the BLAST suite of programs perform searches very rapidly, they have the potential to be accelerated. In recent years, distributed computing environments have become more widely accessible and used due to the increasing availability of high-performance computing (HPC) systems. Therefore, simple solutions for data parallelization are needed to expedite BLAST and other sequence analysis tools. However, existing software for parallel sequence similarity searches often requires extensive computational experience and skill on the part of the user. In order to accelerate BLAST and other sequence analysis tools, Divide and Conquer BLAST (DCBLAST) was developed to perform NCBI BLAST searches within a cluster, grid, or HPC environment by using a query sequence distribution approach. Scaling from one (1) to 256 CPU cores resulted in significant improvements in processing speed. Thus, DCBLAST dramatically accelerates the execution of BLAST searches using a simple, accessible, robust, and parallel approach. DCBLAST works across multiple nodes automatically and it overcomes the speed limitation of single-node BLAST programs. DCBLAST can be used on any HPC system, can take advantage of hundreds of nodes, and has no output limitations. Thus, this freely available tool simplifies distributed computation pipelines to facilitate the rapid discovery of sequence similarities between very large data sets.

59 BASIC BIOLOGICAL SCIENCES↗

Simulation and Estimation of Extreme Quantiles and Extreme Probabilities

Let X be a random vector with distribution {mu} on Double-Struck-Capital-R {sup d} and {Phi} be a mapping from Double-Struck-Capital-R {sup d} to Double-Struck-Capital-R . That mapping acts as a black box, e.g., the result from some computer experiments for which no analytical expression is available. This paper presents an efficient algorithm to estimate a tail probability given a quantile or a quantile given a tail probability. The algorithm improves upon existing multilevel splitting methods and can be analyzed using Poisson process tools that lead to exact description of the distribution of the estimated probabilities and quantiles. The performance of the algorithm is demonstrated in a problem related to digital watermarking.

97 MATHEMATICS AND COMPUTING↗

An end-to-end deep learning method for solving nonlocal Allen–Cahn and Cahn–Hilliard phase-field models

Here, we propose an efficient end-to-end deep learning method for solving nonlocal Allen–Cahn (AC) and Cahn–Hilliard (CH) phase-field models. One motivation for this effort emanates from the fact that discretized partial differential equation-based AC or CH phase-field models result in diffuse interfaces between phases, with the only recourse for remediation is to severely refine the spatial grids in the vicinity of the true moving sharp interface whose width is determined by a grid-independent parameter that is substantially larger than the local grid size. In this work, we introduce non-mass conserving nonlocal AC or CH phase-field models with regular, logarithmic, or obstacle double-well potentials. Because of non-locality, some of these models feature totally sharp interfaces separating phases. The discretization of such models can lead to a transition between phases whose width is only a single grid cell wide. Another motivation is to use deep learning approaches to ameliorate the otherwise high cost of solving discretized nonlocal phase-field models. To this end, loss functions of the customized neural networks are defined using the residual of the fully discrete approximations of the AC or CH models, which results from applying a Fourier collocation method and a temporal semi-implicit approximation. To address the long-range interactions in the models, we tailor the architecture of the neural network by incorporating a nonlocal kernel as an input channel to the neural network model. We then provide the results of extensive computational experiments to illustrate the accuracy, predictive capabilities, and cost reductions of the proposed method.

42 ENGINEERING↗

Accelerating Atomic Orbital-based Electronic Structure Calculation via Pole Expansion plus Selected Inversion

We describe how to apply the recently developed pole expansion plus selected inversion (PEpSI) technique to Kohn-Sham density function theory (DFT) electronic structure calculations that are based on atomic orbital discretization. We give analytic expressions for evaluating charge density, total energy, Helmholtz free energy and atomic forces without using the eigenvalues and eigenvectors of the Kohn-Sham Hamiltonian. We also show how to update the chemical potential without using Kohn-Sham eigenvalues. The advantage of using PEpSI is that it has a much lower computational complexity than that associated with the matrix diagonalization procedure. We demonstrate the performance gain by comparing the timing of PEpSI with that of diagonalization on insulating and metallic nanotubes. For these quasi-1D systems, the complexity of PEpSI is linear with respect to the number of atoms. This linear scaling can be observed in our computational experiments when the number of atoms in a nanotube is larger than a few hundreds. Both the wall clock time and the memory requirement of PEpSI is modest. This makes it even possible to perform Kohn-Sham DFT calculations for 10,000-atom nanotubes on a single processor. We also show that the use of PEpSI does not lead to loss of accuracy required in a practical DFT calculation.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Uncertainty quantification for molecular property predictions with graph neural architecture search

Graph Neural Networks (GNNs) have emerged as a prominent class of data-driven methods for molecular property prediction. However, a key limitation of typical GNN models is their inability to quantify uncertainties in the predictions. This capability is crucial for ensuring the trustworthy use and deployment of models in downstream tasks. To that end, we introduce AutoGNNUQ, an automated uncertainty quantification (UQ) approach for molecular property prediction. AutoGNNUQ leverages architecture search to generate an ensemble of high-performing GNNs, enabling the estimation of predictive uncertainties. Our approach employs variance decomposition to separate data (aleatoric) and model (epistemic) uncertainties, providing valuable insights for reducing them. In our computational experiments, we demonstrate that AutoGNNUQ outperforms existing UQ methods in terms of both prediction accuracy and UQ performance on multiple benchmark datasets, and generalizes well to out-of-distribution datasets. Additionally, we utilize t-SNE visualization to explore correlations between molecular features and uncertainty, offering insight for dataset improvement. AutoGNNUQ has broad applicability in domains such as drug discovery and materials science, where accurate uncertainty quantification is crucial for decision-making.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Using Computationally-Determined Properties for Machine Learning Prediction of Self-Diffusion Coefficients in Pure Liquids

The ability to predict transport properties of liquids quickly and accurately will greatly improve our understanding of fluid properties both in bulk and complex mixtures, as well as in confined environments. Such information could then be used in the design of materials and processes for applications ranging from energy production and storage to manufacturing processes. As a first step, we consider the use of machine learning (ML) methods to predict the diffusion properties of pure liquids. Recent results have shown that Artificial Neural Networks (ANNs) can effectively predict the diffusion of pure compounds based on the use of experimental properties as the model inputs. In the current study, a similar ANN approach is applied to modeling diffusion of pure liquids using fluid properties obtained exclusively from molecular simulations. A diverse set of 102 pure liquids is considered, ranging from small polar molecules (e.g., water) to large nonpolar molecules (e.g., octane). Self-diffusion coefficients were obtained from classical molecular dynamics (MD) simulations. Since nearly all the molecules are organic compounds, a general set of force field parameters for organic molecules was used. The MD methods are validated by comparing physical and thermodynamic properties with experiment. Computational input features for the ANN include physical properties obtained from the MD simulations as well as molecular properties from quantum calculations of individual molecules. Furthermore, fluid properties describing the local liquid structure were obtained from center of mass radial distribution functions (COM-RDFs). Feature sensitivity analysis revealed that isothermal compressibility, heat of vaporization, and the thermal expansion coefficient were the most impactful properties used as input for the ANN model to predict the MD simulated self-diffusion coefficients. The MD-based ANN successfully predicts the MD self-diffusion coefficients with only a subset (2 to 3) of the available computationally determined input features required. A separate ANN model was developed using literature experimental self-diffusion coefficients as model targets. Although this second ML model was not as successful due to a limited number of data points, a good correlation is still observed between experimental and ML predicted self-diffusion coefficients.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Mesoscale Interfacial Dynamics in Magnetoelectric Nanocomposites (Three Years’ Report)

Theory and modeling of chessboard-like self-assembling of vertically aligned columnar nanostructures in films has been developed. By means of modeling and three-dimensional computational simulations, we proposed a novel self-assembly process that can produce good chessboard nanostructure architectures through a pseudo-spinodal decomposition of an epitaxial film under optimal thermodynamic and crystallographic conditions (appropriate choice of the temperature, composition of the film, and crystal lattice parameters of the film and substrate). These conditions are formulated. The obtained results have been published on Nano Letters. Based on the principles of the formation of chessboard nanostructured films, we are currently trying to find good decomposing material systems that satisfy the optimal conditions to produce the chessboard nanostructure architecture. In addition we are under way doing 'computer experiments' to look for the appropriate materials with the chessboard columnar nanostructures, as a potential candidate for engineering of optical devices, high-efficiency multiferroics, and high-density magnetic perpendicular recording media. We are also currently to investigate the magnetoelectric response of multiferroic chessboard nanostructures under applied electric/magnetic fields. A unified 3-dimensional phase field theory of the strain-mediated magnetoelectric effect in magnetoelectric composites is developed. The theory is based on the established equivalency paradigm: we proved that by using a variational priciple the exact values of the electric, magnetic and strain fields in a magnetoelectric composite of arbitrary morphology and their coupled magneto-electric-mechanical response can be evaluated by considering an equivalent homogeneous system with the specially chosen effective eigenstrain, polarization and magnetization. These equivalency parameters are spatially inhomogeneous fields, which are obtained by solving the time-dependent Ginzburg-Landau equations. The paper summarizing these results is to be submitted to JAP. We are currently using the computational model based on the unified phase field theory to predict the local and overall response of the magnetoelectric composites with arbitrary configuration under applied fields, and to find the optimal composite microstructure that produces the strongest ME coupling. We have developed modeling and simulations to support Dr. S. Pryia efforts to produce the strongest ME coupling by searching the optimal configuration of applied electric/magnetic fields, and microstructure of polycrystalline multiferroics. An analytical model demonstrates that the optimization of a magnetoelectric (ME) coupling of a laminar magnetic/piezoelectric polycrystalline composite could be obtained by a proper choice of the magnetic and electric poling directions and the directions of the applied a.c. fields. The results have been published on JAP. Our next step is to determine the domain of optimal parameters and configurations by using our optimization theory and computational modeling.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Mechanisms of Degradation of Toxic Nerve Agents: Quantum-chemical Insight into Interactions of Sarin and Soman with Molybdenum Dioxide

With the urgent need to provide an efficient and reliable protection for people from fatal chemical and biological weapons, our fundamental understanding of how toxins interact with filters is far from complete. The situation is further complicated by natural difficulties of performing experimental measurements with lethal toxins. Unlike experiments, computational modeling offers an attractive and safe yet reliable way of studying behavior of toxic agents on a variety of substrates at a great level of detail. Here, we report DFT-based quantum-chemical calculations of adsorption and decomposition of DMMP, sarin and soman on MoO 2 (011) surface. Our calculations show that MoO 2 strongly adsorbs toxic nerve agents and quickly decomposes them. Decomposition of DMMP on the MoO 2 (011) surface proceeds via the PO-CH 3 bond breaking and a formation of a surface methoxy group. The calculated activation barrier for this reaction is 131.5 kJ mol -1 . Unlike DMMP, decomposition of sarin and soman proceeds via the dealkylation reaction yielding propene and 3,3-dimethyl-1-butene, respectively. Decomposition of sarin requires a remarkably low energy (53.7 kJ mol- 1 ), whereas the similar reaction in soman requires 50 kJ mol -1 more energy. We also make specific predictions to guide Ambient-Pressure X-ray Photoelectron Spectroscopy (APXPS) experiments on sarin interaction with MoO 2 samples. We conclude that MoO 2 serves as an efficient substrate able of degrading toxins.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Active Subspace Methods for Data-Intensive Inverse Problems

Fostered by advances in computing, simulation and data science have emerged as the third and fourth paradigms enabling scientific discovery. Many mathematical challenges arise when integrating these paradigms to produce new knowledge. One of the most important challenges is the inverse or calibration problem: find the inputs of a simulation such that its outputs agree with a given set of measurements. As both the cost of the complex simulations and the volume of measurement data sets increase, intuition-driven trial-and-error methods for calibration quickly become untenable; modern scientists need more computationally efficient and mathematically rigorous methods. When measurements and simulated predictions contain uncertainty, the Bayesian perspective on statistical inference provides a popular mathematical framework for developing computational methods to solve inverse problems. Markov chain Monte Carlo (MCMC) methods are a mainstay of this framework; they characterize a probability distribution on the space of model inputs that is conditioned on the given measurements. However, despite recent advances, MCMC methods remain impractical for expensive simulations with more than a handful of inputs. At its heart, MCMC searches the space of inputs for corresponding outputs that match measurements, and so it is afflicted with the curse of dimensionality. Additionally, MCMC methods become less efficient as the volume of the measurement data increases, particularly if the measurements are redundant. To make MCMC—and Bayesian methods, in general—amenable to today’s computer models with millions of inputs and terabytes of measurement data, one must devise methods to reduce the dimension of both the simulation inputs and the measurements. For many models used in practice, the outputs vary primarily on a low-dimensional manifold of the nominally high-dimensional input space. Recently developed active subspace methods discover this low-dimensional manifold and exploit it to enable analyses typically suited for low-dimensional settings (e.g., statistical inversion of complex systems). We hypothesize that active subspace methods can provide the necessary dimension reduction, enabling existing Bayesian methods to find solutions for a large class of otherwise intractable statistical inverse problems. We will test the hypothesis with a series of mathematical analyses and computational experiments that will proceed along three research veins: (i) integrating active subspace methods into methods for statistical inversion, (ii) addressing current challenges in active subspace methods, and (iii) incorporating methods for nonlinear dimensionality reduction into active subspace methods. We will apply the methods we develop to real inverse problems in chemical kinetics and turbulent flame modeling. Our team combines expertise in methods for inverse problems, dimension reduction, and reduced order modeling. With a history of active collaboration and thoughtful engagement, we bring enthusiasm and fresh perspectives to a well studied subject. We are excited by the potential opportunity to work together to extend and apply active subspace methods to data-intensive inverse problems.

97 MATHEMATICS AND COMPUTING↗