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,243 records · Page 69
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Low-latency quantum control using AI algorithms on cryogenic microelectronics platforms

Superconducting quantum computers are a particular technology that involve the realization of qubits by means of LC circuits with a Josephson junction. As shown in Fig. 1, this latter addition has the effect of introducing a nonlinearity (anharmonicity) that makes the frequency spacing between each energy level non-uniform. This is a desired effect for separating the two lowest levels, used for computation, from the higher ones, that are theoretically infinite and which are not desired to be used.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Properties of Electronic Materials

This final technical report summarizes the research conducted under DOE Grant DE-SC0002623, "Properties of Electronic Materials," led by Principal Investigator Shengbai Zhang at Rensselaer Polytechnic Institute. Over the 16-year period, the project employed first-principles computational methods to investigate the structural, electronic, and dynamic properties of a wide range of electronic materials, with applications in energy technologies, optoelectronics, and data storage. Key areas included topological insulators, phase-change materials, graphene and two-dimensional systems, perovskites for photovoltaics, defect engineering in semiconductors, kagome lattices, and ultrafast carrier dynamics. The research resulted in 115 peer-reviewed publications, advancing fundamental understanding of material behaviors at the atomic scale and contributing to innovations in renewable energy, memory devices, and quantum materials. Findings have implications for improving energy efficiency, developing lead-free solar cells, and enabling high-speed data processing. The work has trained numerous graduate students and postdocs, fostering the next generation of computational materials scientists. The original goals were to develop theoretical models and computational tools to predict and optimize electronic properties of materials for energy applications. All objectives were accomplished, with no major departures from planned methodologies. Challenges in computational scaling were addressed through access to high-performance computing resources.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Future Generation High Performance Computing Center (FG-HPCC): RFI Technical Considerations

Lawrence Livermore National Security, LLC (LLNS) is interested in receiving information about technologies that could be available in the 2029-2030 timeframe that may serve to enable the vision for a Future Generation High Performance Computing (HPC) Center (FG-HPCC) described in this document. The future HPC Center vision has been conceived to meet the future mission needs of the Advanced Simulation and Computing (ASC) Program within the National Nuclear Security Administration (NNSA). LLNS envisions a center composed not of many independent clusters, but of heterogeneous elements accessible to users as a single system. The capabilities will be integrated to create a scalable, flexible, yet tightly coupled computing center capable of integrated HPC, AI, and cloud-like workloads.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Sensitivity-Informed Bayesian Inference for Home PLC Network Models with Unknown Parameters

Bayesian inference is used to calibrate a bottom-up home PLC network model with unknown loads and wires at frequencies up to 30 MHz. A network topology with over 50 parameters is calibrated using global sensitivity analysis and transitional Markov Chain Monte Carlo (TMCMC). The sensitivity-informed Bayesian inference computes Sobol indices for each network parameter and applies TMCMC to calibrate the most sensitive parameters for a given network topology. A greedy random search with TMCMC is used to refine the discrete random variables of the network. This results in a model that can accurately compute the transfer function despite noisy training data and a high dimensional parameter space. The model is able to infer some parameters of the network used to produce the training data, and accurately computes the transfer function under extrapolative scenarios.

42 ENGINEERING↗
DOE OSTI2024

Liquid Crystal Orientation and Shape Optimization for the Active Response of Liquid Crystal Elastomers

Liquid crystal elastomers (LCEs) are responsive materials that can undergo large reversible deformations upon exposure to external stimuli, such as electrical and thermal fields. Controlling the alignment of their liquid crystals mesogens to achieve desired shape changes unlocks a new design paradigm that is unavailable when using traditional materials. While experimental measurements can provide valuable insights into their behavior, computational analysis is essential to exploit their full potential. Accurate simulation is not, however, the end goal; rather, it is the means to achieve their optimal design. Such design optimization problems are best solved with algorithms that require gradients, i.e., sensitivities, of the cost and constraint functions with respect to the design parameters, to efficiently traverse the design space. In this work, a nonlinear LCE model and adjoint sensitivity analysis are implemented in a scalable and flexible finite element-based open source framework and integrated into a gradient-based design optimization tool. To display the versatility of the computational framework, LCE design problems that optimize both the material, i.e., liquid crystal orientation, and structural shape to reach a target actuated shapes or maximize energy absorption are solved. Multiple parameterizations, customized to address fabrication limitations, are investigated in both 2D and 3D. The case studies are followed by a discussion on the simulation and design optimization hurdles, as well as potential avenues for improving the robustness of similar computational frameworks for applications of interest.

42 ENGINEERING↗
DOE OSTI2023

Large-Scale Inference of Multivariate Regression for Heavy-Tailed and Asymmetric Data

Large-scale multivariate regression is a fundamental statistical tool with a wide range of applications. Here, this study considers the problem of simultaneously testing a large number of general linear hypotheses, encompassing covariate-effect analysis, analysis of variance, and model comparisons. The challenge that accompanies a large number of tests is the ubiquitous presence of heavy-tailed and/or highly skewed measurement noise, which is the main reason for the failure of conventional least squares-based methods. For large-scale multivariate regression, we develop a set of robust inference methods to explore data features such as heavy tailedness and skewness, which are not visible to least squares methods. The new testing procedure is based on the data-adaptive Huber regression and a new covariance estimator of regression estimates. Under mild conditions, we show that our methods produce consistent estimates of the false discovery proportion. Extensive numerical experiments and an empirical study on quantitative linguistics demonstrate the advantage of the proposed method over many state-of-the-art methods when the data are generated from heavy-tailed and/or skewed distributions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A reduced-order shifted boundary method for parametrized incompressible Navier–Stokes equations

Here, we investigate a projection-based reduced order model of the steady incompressible Navier–Stokes equations for moderate Reynolds numbers. In particular, we construct an “embedded” reduced basis space, by applying proper orthogonal decomposition to the Shifted Boundary Method, a high-fidelity embedded method recently developed. We focus on the geometrical parametrization through level-set geometries, using a fixed Cartesian background geometry and the associated mesh. This approach avoids both remeshing and the development of a reference domain formulation, as typically done in fitted mesh finite element formulations. Two-dimensional computational examples for one and three parameter dimensions are presented to validate the convergence and the efficacy of the proposed approach.

"embedded" basis↗
DOE OSTI2023

Distributed out-of-memory NMF on CPU/GPU architectures

We propose an efficient distributed out-of-memory implementation of the non-negative matrix factorization (NMF) algorithm for heterogeneous high-performance-computing systems. The proposed implementation is based on prior work on NMFk, which can perform automatic model selection and extract latent variables and patterns from data. In this work, we extend NMFk by adding support for dense and sparse matrix operation on multi-node, multi-GPU systems. The resulting algorithm is optimized for out-of-memory problems where the memory required to factorize a given matrix is greater than the available GPU memory. Memory complexity is reduced by batching/tiling strategies, and sparse and dense matrix operations are significantly accelerated with GPU cores (or tensor cores when available). Input/output latency associated with batch copies between host and device is hidden using CUDA streams to overlap data transfers and compute asynchronously, and latency associated with collective communications (both intra-node and inter-node) is reduced using optimized NVIDIA Collective Communication Library (NCCL) based communicators. Benchmark results show significant improvement, from 32X to 76x speedup, with the new implementation using GPUs over the CPU-based NMFk. Good weak scaling was demonstrated on up to 4096 multi-GPU cluster nodes with approximately 25,000 GPUs when decomposing a dense 340 Terabyte-size matrix and an 11 Exabyte-size sparse matrix of density 10 -6 .

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Solution and sensitivity analysis of nonlinear equations using a hypercomplex-variable Newton-Raphson method

Here, the classical Newton-Raphson (NR) method for solving nonlinear equations is enhanced in two ways through the use of hypercomplex variables and algebra. In particular, i) the Jacobian is computed in a highly accurate and automated way, and ii) the derivative of the solution to the nonlinear equations is computed with respect to any parameter contained within the system of equations. These advances provide two significant enhancements in that it is straightforward to provide an accurate Jacobian and to construct a reduced order model (ROM) of arbitrary order with respect to any parameter of the system. The ROM can then be used to approximate the solution for other parameter values without requiring additional solutions of the nonlinear equations. Several case studies are presented including 1D and 2D academic examples with fully functioning Python code provided. Additionally, a case of study of the catenary of an elastic cable subject to its own weight and a vertical point load. Derivatives up to 10th order were computed with respect to material, loading, and geometrical parameters. The derivatives were used to generate reduced order models of the cable deformation and reaction forces at its ends with respect to multiple input parameters. Results show that from a single hypercomplex evaluation of the cable under a single vertical point load, it is possible to generate an accurate reduced order model capable of predicting the cable deformation with 1.5 times the load in the opposite direction and with 3.5 times the load in the same direction without resolving the system of equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A thermodynamically consistent finite strain phase field approach to ductile fracture considering multi-axial stress states

Phase field models for ductile fracture have gained significant attention in the last two decades due to their ability in implicitly tracking the nucleation and propagation of cracks. However, most crack phase field formulations for elastoplastic solids focus only on the effects of plastic deformation, and do not consider the different multi-axial stress states that may arise in practical designs. In this work, a thermodynamically consistent phase field approach coupled with finite strain plasticity, considering multi-axial stress states is presented. In order to account for the coupling between plasticity and stress states, the Stress-Weighted Ductile Fracture Model (SWDFM) is utilized. The SWDFM represents a criterion for predicting ductile crack initiation under both monotonic and cyclic loadings based on histories of an internal plastic variable, stress triaxiality, and the Lode angle parameter. The excellent performance of the SWDFM for predicting ductile crack initiation motivates for its incorporation into a phase field approach for predicting both crack initiation and propagation through degradation of the fracture toughness. Moreover, based on the second law of thermodynamics, exact requirements are imposed on the rate at which the fracture toughness can evolve. Here, a novel function for degrading the plastic yield surface during the evolution of damage is introduced. This function, in line with experimental observations, leads to an accumulation of plastic deformation in damaged regions of a solid, and avoids numerical instabilities arising from concentrations of large plastic deformations in severely damaged regions. For validating the proposed model, results of computational simulations are compared to data from selected tests considering different multi-axial stress states. Comparisons of the numerical results with data from laboratory experiments demonstrate the capabilities of the proposed framework.

42 ENGINEERING↗
DOE OSTI2022

Flood hazard model calibration using multiresolution model output

Riverine floods pose a considerable risk to many communities. Improving flood hazard projections has the potential to inform the design and implementation of flood risk management strategies. Current flood hazard projections are uncertain, especially due to uncertain model parameters. Calibration methods use observations to quantify model parameter uncertainty. With limited computational resources, researchers typically calibrate models using either relatively few expensive model runs at high spatial resolutions or many cheaper runs at lower spatial resolutions. This leads to an open question: is it possible to effectively combine information from the high and low resolution model runs? We propose a Bayesian emulation–calibration approach that assimilates model outputs and observations at multiple resolutions. As a case study for a riverine community in Pennsylvania, we demonstrate our approach using the LISFLOOD-FP flood hazard model. Here, the multiresolution approach results in improved parameter inference over the single resolution approach in multiple scenarios. Results vary based on the parameter values and the number of available models runs. Our method is general and can be used to calibrate other high dimensional computer models to improve projections.

multiresolution↗
DOE OSTI2023

Evaluation of pre-training large language models on leadership-class supercomputers

Large language models (LLMs) have arisen rapidly to the center stage of artificial intelligence as the foundation models applicable to many downstream learning tasks. However, how to effectively build, train, and serve such models for many high-stake and first-principle-based scientific use cases are both of great interests and of great challenges. Moreover, pre-training LLMs with billions or even trillions of parameters can be prohibitively expensive not just for academic institutions, but also for well-funded industrial and government labs. Furthermore, the energy cost and the environmental impact of developing LLMs must be kept in mind. Here, in this work, we conduct a first-of-its-kind performance analysis to understand the time and energy cost of pre-training LLMs on the Department of Energy (DOE)’s leadership-class supercomputers. Employing state-of-the-art distributed training techniques, we evaluate the computational performance of various parallelization approaches at scale for a range of model sizes, and establish a projection model for the cost of full training. Our findings provide baseline results, best practices, and heuristics for pre-training such large models that should be valuable to HPC community at large. We also offer insights and optimization strategies for using the first exascale computing system, Frontier, to train models of the size of GPT-3 and beyond.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Robust second-order approximation of the compressible Euler equations with an arbitrary equation of state

Here, this paper is concerned with the approximation of the compressible Euler equations supplemented with an arbitrary or tabulated equation of state. The proposed approximation technique is robust, formally second-order accurate in space, invariant-domain preserving, and works for every equation of state, tabulated or analytic, provided the pressure is nonnegative. An entropy surrogate functional that grows across shocks is proposed. The numerical method is verified with novel analytical solutions and then validated with several computational benchmarks seen in the literature including problems with composite waves.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Application of deep neural networks to improve diagnostic accuracy of rheumatoid arthritis using diffuse optical tomography

A set of deep neural network models for rheumatoid arthritis (RA) classification using a highway network, a convolutional neural network and a residual network is proposed based on the data of diffuse optical tomography (DOT) utilising near-infrared light, which ensures early diagnosis of pathophysiological changes resulting from inflammation. A numerical model of the finger is used to generate images to overcome the inherent problem of insufficient clinical DOT images available. The proposed deep neural network models are applied to automatically classify simulated DOT images of inflamed and non-inflamed joints and transfer learning is also used to improve the performance of the classification. The results demonstrate that all three deep neural network methods improve the diagnostic accuracy as compared to the widely applied support vector machine (SVM), especially for high inter-subject variability databases. In cases of distinct modelled severity of disease, residual network achieved the highest accuracy (> 99 %), and both of highway and convolutional neural networks reached 99 %, respectively. However, as the severity of the modelled disease is reduced, this accuracy is reduced to 75.2 % for residual networks. The results indicate that transfer learning can improve the performance of deep neural network methods on RA classification from DOT data and highlight their potential as a computer aided tool in DOT diagnostic systems. (paper)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

APACE: AlphaFold2 and advanced computing as a service for accelerated discovery in biophysics

The prediction of protein 3D structure from amino acid sequence is a computational grand challenge in biophysics and plays a key role in robust protein structure prediction algorithms, from drug discovery to genome interpretation. The advent of AI models, such as AlphaFold, is revolutionizing applications that depend on robust protein structure prediction algorithms. To maximize the impact, and ease the usability, of these AI tools we introduce APACE, AlphaFold2 and advanced computing as a service, a computational framework that effectively handles this AI model and its TB-size database to conduct accelerated protein structure prediction analyses in modern supercomputing environments. We deployed APACE in the Delta and Polaris supercomputers and quantified its performance for accurate protein structure predictions using four exemplar proteins: 6AWO, 6OAN, 7MEZ, and 6D6U. Using up to 300 ensembles, distributed across 200 NVIDIA A100 GPUs, we found that APACE is up to two orders of magnitude faster than off-the-self AlphaFold2 implementations, reducing time-to-solution from weeks to minutes. This computational approach may be readily linked with robotics laboratories to automate and accelerate scientific discovery.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Examination of Semi-Analytical Solution Methods in the Coarse Operator of Parareal Algorithm for Power System Simulation

With continuing advances in high-performance parallel computing platforms, parallel algorithms have become powerful tools for development of faster than real-time power system dynamic simulations. In particular, it has been demonstrated in recent years that parallel-in-time (Parareal) algorithms have the potential to achieve such an ambitious goal. Here, the selection of a fast and reasonably accurate coarse operator of the Parareal algorithm is crucial for its effective utilization and performance. This paper examines semi-analytical solution (SAS) methods as the coarse operators of the Parareal algorithm and explores performance of the SAS methods to the standard numerical time integration methods. Two promising time-power series-based SAS methods were considered; Adomian decomposition method and Homotopy analysis method with a windowing approach for improving the convergence. Numerical performance case studies on 10-generator 39-bus system and 327-generator 2383-bus system were performed for these coarse operators over different disturbances, evaluating the number of Parareal iterations, computational time, and stability of convergence. All the coarse operators tested with different scenarios have converged to the same corresponding true solution (if they are convergent) and the SAS methods provide comparable computational speed, while having more stable convergence to the true solution in many cases.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Stochastic Reduced-Order Model for Statistical Microstructure Descriptors Evolution

Integrated computational materials engineering (ICME) models have been a crucial building block for modern materials development, relieving heavy reliance on experiments and significantly accelerating the materials design process. However, ICME models are also computationally expensive, particularly with respect to time integration for dynamics, which hinders the ability to study statistical ensembles and thermodynamic properties of large systems for long time scales. To alleviate the computational bottleneck, we propose to model the evolution of statistical microstructure descriptors as a continuous-time stochastic process using a non-linear Langevin equation, where the probability density function (PDF) of the statistical microstructure descriptors, which are also the quantities of interests (QoIs), is modeled by the Fokker–Planck equation. In this work, we discuss how to calibrate the drift and diffusion terms of the Fokker–Planck equation from the theoretical and computational perspectives. The calibrated Fokker–Planck equation can be used as a stochastic reduced-order model to simulate the microstructure evolution of statistical microstructure descriptors PDF. Considering statistical microstructure descriptors in the microstructure evolution as QoIs, we demonstrate our proposed methodology in three integrated computational materials engineering (ICME) models: kinetic Monte Carlo, phase field, and molecular dynamics simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

GentenMPI: Distributed Memory Sparse Tensor Decomposition

GentenMPl is a toolkit of sparse canonical polyadic (CP) tensor decomposition algorithms that is designed to run effectively on distributed-memory high-performance computers. Its use of distributed-memory parallelism enables it to efficiently decompose tensors that are too large for a single compute node's memory. GentenMPl leverages Sandia's decades-long investment in the Trilinos solver framework for much of its parallel-computation capability. Trilinos contains numerical algorithms and linear algebra classes that have been optimized for parallel simulation of complex physical phenomena. This work applies these tools to the data science problem of sparse tensor decomposition. In this report, we describe the use of Trilinos in GentenMPl, extensions needed for sparse tensor decomposition, and implementations of the CP-ALS (CP via alternating least squares) and GCP-SGD (generalized CP via stochastic gradient descent) sparse tensor decomposition algorithms. We show that GentenMPl can decompose sparse tensors of extreme size, e.g., a 12.6-terabyte tensor on 8192 computer cores. We demonstrate that the Trilinos backbone provides good strong and weak scaling of the tensor decomposition algorithms.

97 MATHEMATICS AND COMPUTING↗