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 433 records · Page 24

A Hierarchical Gibbs Sampler for Spatially Varying Multi-Regularization Image Reconstructions

This is a presentation for SIAM's (Society for Industrial and Applied Mathematics) conference on computational science and engineering. This presentation describes research on novel techniques to deblur images under a Bayesian framework. The title of the conference is SIAM Conference on Computational Science and Engineering (CSE21). This is a VIRTUAL conference; it was originally scheduled in Fort Worth, TX. The conference dates are March 1-5, 2021. The link to the conference's website is https://www.siam.org/conferences/cm/conference/cse21

97 MATHEMATICS AND COMPUTING↗

Communication-Avoiding and Memory-Constrained Sparse Matrix-Matrix Multiplication at Extreme Scale

Sparse matrix-matrix multiplication (SpGEMM) is a widely used kernel in various graph, scientific computing and machine learning algorithms. In this paper, we consider SpGEMMs performed on hundreds of thousands of processors generating trillions of nonzeros in the output matrix. Distributed SpGEMM at this extreme scale faces two key challenges: (1) high communication cost and (2) inadequate memory to generate the output. Furthermore, we address these challenges with an integrated communication-avoiding and memory-constrained SpGEMM algorithm that scales to 262,144 cores (more than 1 million hardware threads) and can multiply sparse matrices of any size as long as inputs and a fraction of output fit in the aggregated memory. As we go from 16,384 cores to 262,144 cores on a Cray XC40 supercomputer, the new SpGEMM algorithm runs 10x faster when multiplying large-scale protein-similarity matrices.

97 MATHEMATICS AND COMPUTING↗

G4Boost: a machine learning-based tool for quadruplex identification and stability prediction

Background: G-quadruplexes (G4s), formed within guanine-rich nucleic acids, are secondary structures involved in important biological processes. Although every G4 motif has the potential to form a stable G4 structure, not every G4 motif would, and accurate energy-based methods are needed to assess their structural stability. Here, we present a decision tree-based prediction tool, G4Boost, to identify G4 motifs and predict their secondary structure folding probability and thermodynamic stability based on their sequences, nucleotide compositions, and estimated structural topologies. Results: G4Boost predicted the quadruplex folding state with an accuracy greater then 93% and an F1-score of 0.96, and the folding energy with an RMSE of 4.28 and R 2 of 0.95 only by the means of sequence intrinsic feature. G4Boost was successfully applied and validated to predict the stability of experimentally-determined G4 structures, including for plants and humans. Conclusion: G4Boost outperformed the three machine-learning based prediction tools, DeepG4, Quadron, and G4RNA Screener, in terms of both accuracy and F1-score, and can be highly useful for G4 prediction to understand gene regulation across species including plants and humans.

59 BASIC BIOLOGICAL SCIENCES↗

Expanded Capabilities and Opportunities for Virtual Beamline Code

In the 25 years since LLNL broke ground on the National Ignition Facility (NIF) - a cornerstone of the National Nuclear Security Administration’s Stockpile Stewardship Program - the NIF and Photon Science (NIF&PS) Directorate has steadily pushed the boundaries of laser physics, nonlinear optics, and photonics in service of inertial confinement fusion experiments, and advanced photon sources development. Beyond the 192 beamlines of the primary laser facility with its world-record energy and fusion yields, NIF&PS capabilities have expanded to include chirped-pulse amplification, kilojoule petawatt-class short-pulse systems to generate hard x-ray radiographic probes, high-average power lasers as secondary sources for generation or wake field particle acceleration along directed energy applications, and other scientific pursuits. The Computing Directorate partners with NIF&PS on numerous projects and technologies from diagnostic measurements and high performance control systems to data analysis, information technology infrastructure, and scientific simulation code development. “This strong collaboration enables cutting-edge science, particularly with regard to physics-based modeling and simulation,” says physicist Jean-Michel Di Nicola. One crucial capability for NIF&PS is the Virtual Beamline (VBL) laser simulation code. It can model all the major laser physics and technology involved in the design optimization, commissioning, and operations of advanced laser architectures from tabletop to NIF-scale. VBL provides researchers with high-fidelity models and high-resolution calculations of laser performance predictions—including for the entire NIF laser system, the Advanced Radiographic Capability, parts of the High Repetition-Rate Advanced Petawatt Laser System laser delivered to the Czech Republic, and the Optical Science Laser. After more than two decades of experimentally verified physics and computing enhancements, this unique workhorse code is wrapping up another major milestone: migration from Java to C++ with a flurry of user interface and optimization features, as well as laser physics and high-resolution enhancements thanks to parallel execution on Livermore Computing platforms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Practical and Optimal Sequential Bayesian Experimental Design for Complex Systems Incorporating Human Experimenter Preferences (Final Scientific/Technical Report)

Experiments are indispensable for developing models of complex systems. Carefully designed experiments can provide substantial savings for these expensive data-acquisition opportunities. However, designs based on heuristics are often suboptimal for systems with multiphysics, nonlinear dynamics, and uncertain and noisy environments. Optimal experimental design, while leveraging predictive models, seeks to systematically quantify and maximize the value of experiments. In this project, we focused on the design of multiple experiments, where current approaches are largely suboptimal: batch-design does not adapt to new data acquired during the experiment campaign (no feedback), and greedy/myopic design ignores future dynamics and consequences (no lookahead). We developed the mathematical framework and computational methods for sequential optimal experimental design (sOED) for complex systems. We enabled tractable model-based sOED in a rigorous manner through novel algorithms based on reinforcement learning, and investigated the effects of human experimenters on the design process. Our methods are fully Bayesian, able to quantify and update uncertainty in a principled manner. The traits aimed by our approach—mathematical rigor and optimality, human effects and uncertainty quantification, computational practicality—are crucial for elevating the standards of artificial intelligence (AI) to support decision-making in scientific domains, and contribute toward trust and realistic adoption of AI in experimental design practice.

97 MATHEMATICS AND COMPUTING↗

Data-Conforming Data-Driven Control: Avoiding Premature Generalizations Beyond Data

Data-driven and adaptive control approaches face the problem of introducing sudden distributional shifts beyond the distribution of data encountered during learning. Therefore, they are prone to invalidating the very assumptions used in their own construction. This is due to the linearity of the underlying system, inherently assumed and formulated in most data-driven control approaches, which may falsely generalize the behavior of the system beyond the behavior experienced in the data. This article seeks to mitigate these problems by enforcing consistency of the newly designed closed-loop systems with data and slowing down any distributional shifts in the joint state-input space. This is achieved through incorporating affine regularization terms and linear matrix inequality constraints to data-driven approaches, resulting in convex semi-definite programs that can be efficiently solved by standard software packages. We discuss the optimality conditions of these programs and then conclude this article with a numerical example that further highlights the problem of premature generalization beyond data and shows the effectiveness of our proposed approaches in enhancing the safety of data-driven control methods.

97 MATHEMATICS AND COMPUTING↗

Spectral Mesh-Free Quadrature for Planar Regions Bounded by Rational Parametric Curves

This article presents spectral, mesh-free, Green’s theorem-based numerical quadrature schemes for integrating functions over planar regions bounded by rational parametric curves. Our algorithm proceeds in two steps: (1) We first find intermediate quadrature rules for line integrals along the region’s boundary curves corresponding to Green’s theorem. (2) We then use a high-order quadrature rule to compute the numerical antiderivative of the integrand along a coordinate axis, which is used to evaluate the Green’s theorem line integral. We present two methods to compute the intermediate quadrature rule. The first is spectrally accurate (it converges faster than any algebraic order with respect to number of quadrature points) and is relatively easy to implement, but has no guarantee of polynomial exactness. The second guarantees exactness for polynomial integrands up to a pre-specified degree with an a priori-known number of quadrature points and retains the convergence properties of the first, but is slightly more complicated. The quadrature schemes have applications to computation of geometric moments, immersogeometric analysis, conservative field transfer between high-order meshes, and initialization of multi-material simulations with rational geometry. We compare the quadrature schemes produced using our method to other methods in the literature and show that they are much more efficient both in terms of number of quadrature points and computational time. We provide an open-source implementation of the algorithm in MATLAB.

97 MATHEMATICS AND COMPUTING↗

A new approach for simulating inhomogeneous chemical kinetics

Abstract In this paper, inhomogeneous chemical kinetics are simulated by describing the concentrations of interacting chemical species by a linear expansion of basis functions in such a manner that the coupled reaction and diffusion processes are propagated through time efficiently by tailor-made numerical methods. The approach is illustrated through modelling $$\alpha$$ α - and $$\gamma$$ γ -radiolysis in thin layers of water and at their solid interfaces from the start of the chemical phase until equilibrium was established. The method’s efficiency is such that hundreds of such systems can be modelled in a few hours using a single core of a typical laptop, allowing the investigation of the effects of the underlying parameter space. Illustrative calculations showing the effects of changing dose-rate and water-layer thickness are presented. Other simulations are presented which show the approach’s capability to solve problems with spherical symmetry (an approximation to an isolated radiolytic spur), where the hollowing out of an initial Gaussian distribution is observed, in line with previous calculations. These illustrative simulations show the generality and the computational efficiency of this approach to solving reaction-diffusion problems. Furthermore, these example simulations illustrate the method’s suitability for simulating solid-fluid interfaces, which have received a lot of experimental attention in contrast to the lack of computational studies.

97 MATHEMATICS AND COMPUTING↗

Transforming Energy Through Computational Excellence: Artificial Intelligence and Machine Learning

The National Renewable Energy Laboratory's (NREL's) expertise accelerates a decarbonized energy economy through the most advanced computational techniques, including artificial intelligence (AI) and Machine Learning (ML). AI is the simulation of human intelligence processes by machines, while ML encompasses the study of computer algorithms to imitate the way humans learn.

97 MATHEMATICS AND COMPUTING↗

Bayesian sequential optimal experimental design for nonlinear models using policy gradient reinforcement learning

We present a mathematical framework and computational methods for optimally designing a finite sequence of experiments. This sequential optimal experimental design (sOED) problem is formulated as a finite-horizon partially observable Markov decision process (POMDP) under a Bayesian setting and with information-theoretic utilities. The formulation is general and may accommodate continuous random variables, non-Gaussian posteriors, and nonlinear forward models. The sOED design policy incorporates elements of feedback and lookahead simultaneously, and we show it to generalize the commonly-used batch and greedy design strategies. We solve for the sOED policy using the policy gradient (PG) method from reinforcement learning, and provide a derivation for the PG expression in the sOED context. Adopting an actor-critic approach, the policy and value functions are parameterized using deep neural networks and improved via PG estimates produced from simulated episodes of designs and observations. The new PG-sOED algorithm is first validated on a linear-Gaussian benchmark, and then compared against other design baselines on a sensor movement problem for contaminant source inversion in a convection-diffusion field. As a result, we provide explanation for the policy behaviors using knowledge of the underlying physical process.

97 MATHEMATICS AND COMPUTING↗

Basic Research Needs for Inverse Methods for Complex Systems under Uncertainty [Brochure]

The four priority research directions outlined in this brochure represent a cohesive vision for advancing the science of inverse problems for complex systems under uncertainty. Together, they address the critical challenges of: discovering, exploiting, and preserving physical and problem structure; overcoming model limitations; integrating disparate, multimodal, and/or dynamic data; and tailoring the solution of inverse problems to downstream tasks. While each PRD focuses on a distinct aspect of inverse-problem research, their interconnected nature highlights the importance of a holistic approach that leverages progress across all areas to achieve transformative solutions. This agenda calls for research across mathematics, statistics, and computer science disciplines, which are guided and complemented by rapid advances in artificial intelligence, high-performance computing, and experimental facilities, to unlock new capabilities, maximize scientific impact, and meet the growing demands of inverse problems that arise across applications that are critical to DOE's mission.

97 MATHEMATICS AND COMPUTING↗

MULTISTEP AND CONTINUOUS PHYSICS-INFORMED NEURAL NETWORK METHODS FOR LEARNING GOVERNING EQUATIONS AND CONSTITUTIVE RELATIONS

In this work, we investigate the applicability and relative merit of discrete and continuous versions of physics-informed neural network (PINN) methods for learning unknown governing equations or constitutive relations in a nonlinear dynamical system. In the case of unknown dynamics, entire right-hand-side (RHS) equations of the ordinary differential equations are unknown. In the case of unknown constitutive relations, however, the RHS equations are known up to the specification of constitutive relations (that may depend on the state of the system). We use a deep neural network to model unknown governing equations or constitutive relations. The discrete PINN approach combines classical multistep discretization methods for dynamical systems with neural-network-based machine learning methods. On the other hand, the continuous versions utilize deep neural networks to minimize the residual function for the continuous governing equations. We use the case of a fedbatch bioreactor system to study the effectiveness of these approaches and discuss conditions for their applicability. Our results indicate that the accuracy of the trained neural network models is much higher for the cases where we only have to learn a constitutive relation instead of all dynamics. This finding corroborates the well-known fact from scientific computing that building as much structural information as is available into an algorithm can enhance its efficiency and/or accuracy.

97 MATHEMATICS AND COMPUTING↗

Provable bounds for noise-free expectation values computed from noisy samples

Quantum computing has emerged as a powerful computational paradigm capable of solving problems beyond the reach of classical computers. However, today’s quantum computers are noisy, posing challenges to obtaining accurate results. Here, we explore the impact of noise on quantum computing, focusing on the challenges in sampling bit strings from noisy quantum computers and the implications for optimization and machine learning. We formally quantify the sampling overhead to extract good samples from noisy quantum computers and relate it to the layer fidelity, a metric to determine the performance of noisy quantum processors. Further, we show how this allows us to use the conditional value at risk of noisy samples to determine provable bounds on noise-free expectation values. We discuss how to leverage these bounds for different algorithms and demonstrate our findings through experiments on real quantum computers involving up to 127 qubits. The results show strong alignment with theoretical predictions.

97 MATHEMATICS AND COMPUTING↗

Viability of Additively Manufactured Electrodes for Lithium-Ion Batteries

As the global economy becomes increasingly electrified, the demand for batteries and energy storage is expected to rise significantly, particularly in the transportation and electricity sectors. Lithium-ion batteries (LIBs) are currently the most advanced and widely used technology in this field. Traditionally, LIBs are manufactured using simple 2D planar geometries to maximize production efficiency and minimize costs. However, this approach limits energy density due to the restricted design flexibility of the electrodes. Additive manufacturing (AM) offers a promising solution to enhance the energy density and efficiency of LIBs by enabling the design of architectures that reduce diffusive losses and allow for a greater amount of active material to be incorporated within the same device footprint, thereby minimizing the use of inactive materials. Different AM techniques come with their own set of limitations, including printing speed, material compatibility, and scale, which must be considered when designing electrodes. Scalable and cost-effective methods are particularly important for electric vehicle batteries, while achieving higher energy densities in microbatteries is crucial for the miniaturization of wearable electronics and medical devices. Here, in this study, we simulate various 3D porous electrode designs for LIBs using graphite and nickel manganese cobalt oxide (NMC) electrodes. These designs are selected to represent structures that could be produced using different AM techniques, such as direct ink writing, fused deposition modeling, and stereolithography. Our results indicate that at higher charging rates and increased areal mass loading, 3D structures can outperform traditional 2D electrodes, although the benefits may diminish with more complex designs that are harder to manufacture. The observed gains in energy density are attributed to improved electrode utilization and reduced diffusive energy losses. This comprehensive analysis of structure–performance relationships will provide valuable insights to guide future research on 3D designs, material selection, and AM techniques for additively manufactured battery electrodes.

25 ENERGY STORAGE↗

Reinforcement Learning via Gaussian Processes with Neural Network Dual Kernels

While deep neural networks (DNNs) and Gaussian Processes (GPs) are both popularly utilized to solve problems in reinforcement learning, both approaches feature undesirable drawbacks for challenging problems. DNNs learn complex non-linear embeddings, but do not naturally quantify uncertainty and are often data-inefficient to train. GPs infer posterior distributions over functions, but popular kernels exhibit limited expressivity on complex and high-dimensional data. Fortunately, recently discovered conjugate and neural tangent kernel functions encode the behavior of overparameterized neural networks in the kernel domain. We demonstrate that these kernels can be efficiently applied to regression and reinforcement learning problems by analyzing a baseline case study.We apply GPs with neural network dual kernels to solve reinforcement learning tasks for the first time. We demonstrate, using the well understood mountain-car problem, that GPs empowered with dual kernels perform at least as well as those using the conventional radial basis function kernel. Finally, we conjecture that by inheriting the probabilistic rigor of GPs and the powerful embedding properties of DNNs, GPs using NN dual kernels will empower future reinforcement learning models on difficult domains.

97 MATHEMATICS AND COMPUTING↗

Science & Technology Review December 2025 - Optimizing Future Design

At Lawrence Livermore National Laboratory, we focus on science and technology research to ensure our nation’s security. We also apply that expertise to solve other important national problems in energy, bioscience, and the environment. Science & Technology Review is published eight times a year to communicate, to a broad audience, the Laboratory’s scientific and technological accomplishments in fulfilling its primary missions. The publication’s goal is to help readers understand these accomplishments and appreciate their value to the individual citizen, the nation, and the world.

36 MATERIALS SCIENCE↗