Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational complexity”

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,099 records · Page 61

Accelerated Machine Learning as a Service for Particle Physics Computing

Accelerated Machine Learning as a Service for Particle Physics Computing: • Amount and complexity of high-energy physics data increases dramatically from 2025 onward • Traditional algorithms will require too much CPU time • Machine learning can solve combinatorially-scaling problems in constant time, but must be fast enough

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Facilitating better and faster simulations of aerosol-cloud interactions in Earth system models

Focal Area(s): 1. Predictive modeling through the use of AI techniques and AI-derived model components; the use of AI and other tools to design a prediction system comprising a hierarchy of models. 2. Insight gleaned from complex data (both observed and simulated) using AI, big data analytics, and other advanced methods, including explainable AI and physics- or knowledge-guided AI. Science Challenge: One major challenge that Earth system models (ESMs) face in providing credible prediction of the Earth system and its water cycle characteristics (e.g., mean state, variability, and extreme events) is to accurately simulate aerosol-cloud interactions (ACI). The physical, chemical, and dynamical processes affecting ACI are extremely complex and they range from nanoscale to planetary scale. In each model development cycle, scientists spend significant efforts investigating model deficiencies and uncertainties associated with aerosols (e.g., emissions, chemical processes, aerosol microphysics, and transport) and clouds (e.g., macrophysics, microphysics, turbulence, and large-scale circulation) in order to develop improved treatments. However, despite decades of active research, ACI is still a major source of uncertainty in climate projections, even though great progress has been made. Specific scientific challenges include: (i) Parameterizations are developed based on limited data; (ii) The complexity of a parameterization required for accurate predictions is not understood; (iii) Incomplete and unknown physics leads to errors in the fully coupled Earth system; and (iv) Complex physics is computationally too expensive to employ in ESMs.

54 ENVIRONMENTAL SCIENCES↗

High-Accuracy Module Emulators from Physically-Constrained AI Algorithms

Focal Area(s): How do we use AI tools to integrate observations, simulated data and physical and chemical fundamentals (Focal Area 3) into model components (Focal Area 2) that have high accuracy and stability and low computational burden to improve Earth System Predictability? Science Challenge: Earth system modeling of the hydrological cycle involves compute-intensive modules representing complex chemical and physical process. Recently, AI tools that are far less compute intensive have been developed that emulate these modules, but many of these efforts are not yet sufficiently accurate or even stable. We know a lot about the physics and chemistry of earth system processes. The Science Challenge is developing AI tools that not only incorporate observations and simulated data, but also incorporate the physics and chemistry of the process, while still maintaining the compute efficiency.

54 ENVIRONMENTAL SCIENCES↗

MCNP6.3 Unstructured Mesh Verification: GodivR and CANDU Models

A geometric cell of the Monte Carlo N-Particle (MCNP)1 transport code is traditionally created by using Boolean operators on defined surfaces. This constructive solid geometry (CSG) capability has been available in the MCNP code since its beginning. However, a CSG model approach is limited when it comes to constructing a representative geometry for a complex model in its ability to capture a correct model representation. Starting with the version 6.0, the MCNP code has the ability of embedding an unstructured mesh (UM) model into a CSG cell to create a hybrid geometry [1]. The MCNP UM feature provides the flexibility of defining very complex geometries because computer aided design (CAD) and mesh generation software packages can be utilized to construct UM models for MCNP simulations.

97 MATHEMATICS AND COMPUTING↗

Modeling Workloads of a Linear Electromagnetic Code for Load Balancing Matrix Assembly

This report presents our work to model the workloads of a linear electromagnetic application based on the method of moments in the frequency domain to effectively load balance the matrix assembly. This application is particularly challenging to load balance due to its lack of persistent iterative behavior, its operation under tight memory constraint (where the matrix may fill 80% of memory on each node), and the algorithmic complexity of the computational method. This report describes the first step in our work to apply an inspector-executor approach for load balancing workloads where key parameters are exposed during the inspector phase and a pre-trained model is applied to predict relative task weights for the load balancer.

97 MATHEMATICS AND COMPUTING↗

Wilkins: HPC in situ workflows made easy

In situ approaches can accelerate the pace of scientific discoveries by allowing scientists to perform data analysis at simulation time. Current in situ workflow systems, however, face challenges in handling the growing complexity and diverse computational requirements of scientific tasks. In this work, we present Wilkins, an in situ workflow system that is designed for ease-of-use while providing scalable and efficient execution of workflow tasks. Wilkins provides a flexible workflow description interface, employs a high-performance data transport layer based on HDF5, and supports tasks with disparate data rates by providing a flow control mechanism. Wilkins seamlessly couples scientific tasks that already use HDF5, without requiring task code modifications. We demonstrate the above features using both synthetic benchmarks and two science use cases in materials science and cosmology.

HPC↗

JOBRUNNER

SF-23-071 Jobrunner is a command line tool to manage and deploy computing jobs, organize complex workloads, and enforce a directory based hierarchy to enable reuse of files and bash scripts within a project. Organization details of a directory tree are encoded in Jobfiles which serve as an index of files/scripts, and indicate their purpose when deploying or setting up a job. It is a flexible tool that allows users to design 16 their own directory structure, perserve their design, and maintain 17 consistency with increase in complexity of the project.

DHRUV, AKASH VIJAYKUMAR↗

MSD CoP Webinar: Applied Science for Decision-Making at the Water-Energy Nexus

Context: This webinar was hosted by the MultiSector Dynamics Community of Practice (MSD CoP; https://multisectordynamics.org). Abstract: The energy transition is a game-changer across multiple sectors, requiring researchers and practitioners to re-evaluate the evolving connections between climate, water, and power systems, as well as the associated co-management of resources and decision-making. In anticipation of new technologies, policies, business models, and other solutions, applied science for decision-making at the climate-water-energy nexus is needed to support transitions with the expected climate resilience, maintained and enhanced energy security, thriving economies, and equity considerations. Through panelists' applied research and operational experience, the webinar will provide lesson-learnt in how to increase the readiness of water-energy research and become actionable in the context of energy transitions. A number of themes will be discussed, including the connection between growing computational resources and complexity of models, and the implications on the intended users, the actual actionable products, the availability of data for validation of the models, uncertainty characterization and decision-making under uncertainty, and the communication of the novelty to decision-makers and the public. Presenters : David McCollum (Oak Ridge National Laboratory; Co-Chair), and Gokul Iyer (Pacific Northwest National Laboratory; Co-Chair), Curt Jawdy (Tennessee Valley Authority), Nathalie Voisin (Pacific Northwest National Laboratory), and Andrew D. Jones (Lawrence Berkeley National Laboratory) Moderator: Pat M. Reed (MSD CoP Facilitation Team) This webinar was held on: April 30, 2024 from 1-2 PM ET

Energy↗

Hardware-in-the-Loop (HIL) Simulations for Smart Grid Impact Studies: Preprint

Hardware-in-the-loop (HIL) simulation is increasingly employed in power engineering as more inverter-based generation and smart appliances are connected to the electric grid. HIL techniques allow for co-simulation of analytical models with actual devices whose complex behavior is computationally inefficient or difficult to capture. It also allows for testing of the behavior of these devices under adverse conditions that only occur rarely in the field, but that are important to evaluate. An overview of how HIL simulation has been used to date is provided. This paper further proposes that HIL simulation should play an important role in evaluating new control strategies, especially at the distribution level, that are being proposed to allow for continued affordable and reliable operation of the electric grid with the introduction of these new technologies. It presents a new capability that was developed to enable evaluation of interactions between residential loads and the smart grid: smart home hardware-in-the-loop. The paper includes results from an HIL simulation that incorporates multiple technologies and controls.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Integration of Titan supercomputer at OLCF with ATLAS Production System

The PanDA (Production and Distributed Analysis) workload management system was developed to meet the scale and complexity of distributed computing for the ATLAS experiment. PanDA managed resources are distributed worldwide, on hundreds of computing sites, with thousands of physicists accessing hundreds of Petabytes of data and the rate of data processing already exceeds Exabyte per year. While PanDA currently uses more than 200,000 cores at well over 100 Grid sites, future LHC data taking runs will require more resources than Grid computing can possibly provide. Additional computing and storage resources are required. Therefore ATLAS is engaged in an ambitious program to expand the current computing model to include additional resources such as the opportunistic use of supercomputers. In this paper we will describe a project aimed at integration of ATLAS Production System with Titan supercomputer at Oak Ridge Leadership Computing Facility (OLCF). Current approach utilizes modified PanDA Pilot framework for job submission to Titan's batch queues and local data management, with lightweight MPI wrappers to run single node workloads in parallel on Titan's multi-core worker nodes. It provides for running of standard ATLAS production jobs on unused resources (backfill) on Titan. The system already allowed ATLAS to collect on Titan millions of core-hours per month, execute hundreds of thousands jobs, while simultaneously improving Titans utilization efficiency. We will discuss the details of the implementation, current experience with running the system, as well as future plans aimed at improvements in scalability and efficiency.

Megino, F. Barreiro↗

Broadly Applicable Dose Model for Radiotherapy Beams from 6-25 MV

The goal of modern external beam radiotherapy is to deliver a highly targeted radiation dose to a specified treatment volume while sparing the healthy surrounding tissue as much as possible. However, some healthy tissue radiation exposure is unavoidable. Healthy tissue in the margin of the treatment field will receive absorbed doses on the order of the prescribed dose, and tissue far out of field will receive stray dose from scattered and leakage radiation. These doses can lead to late effects such as secondary cancers both near the treatment field and far out of field in tissues only receiving stray radiation dose. Many researchers have investigated algorithms to model absorbed dose from external beam photon radiation therapy; however, none of these works have fully addressed the stray dose far from the treatment field. The AAPM Task Group Report No. 36 described three main sources of stray radiation from external beam radiation therapy delivered with electron linear accelerators. Radiation scattered from the treatment head, known as head scatter, is primarily important within about 10 cm from the field edge. Patient scatter is an important source up to around 30 cm from the field edge. Finally, leakage radiation emanates from the treatment enclosure and predominates the stray radiation dose beyond about 30 cm. Monte Carlo simulations have been a useful research tool for modeling stray dose, but these methods have not found use in clinical settings due to their complexity and long computational times. The feasibility of analytical models to predict stray dose from radiation therapy has been supported by several works, but few attempts have been made at developing models accurate for both in-field and out-of-field doses. Jagetic and Newhauser reported on one such model that predicts absorbed dose from therapeutic, scatter, and leakage radiation with promising results. This model was validated at 6 MV for Conformal Radiation Therapy (CRT) beams from an Elekta linac. Intensity Modulated Radiation Therapy (IMRT) was not considered, and the model has not been tested at beam energies greater than 6 MV. Additionally, this model relies on proprietary, machine specific parameters, and so adapting the model for use on treatment units from other manufacturers is not straightforward. In this study we aim to test whether a physics-based analytical modeling approach is broadly applicable and if sufficient accuracy can be achieved without the need for proprietary, machine specific parameters. In order to accomplish this, a new analytical model was developed that does not rely on machine specific parameters, so that it can easily be trained on measurements from whatever treatment machine is available at a given clinic. This model was tested using measured data from a variety of treatment machines and techniques in the 6 MV to 25 MV energy interval. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

Analytic Modeling of a Deep Shielding Problem

Previous generations of scientists would make tremendous efforts to simplify non-tractable problems and generate simpler models that preserved the fundamental physics. This process involved applying assumptions and simplifications to reduce the complexity of the problem until it reached a solvable form. Each assumption and simplification was chosen and applied with the intent to preserve the essential physics of the problem, since, if the core physics of the problem were eliminated, the simplified model served no purpose. Moreover, if done correctly, solutions to the reduced model would serve as useful approximations to the original problem. In a sense, solving the simple models laid the ground-work for and provided insight into the more complex problem. Today, however, the affordability of high performance computing has essentially replaced the process for analyzing complex problems. Rather than \building up" a problem by understanding smaller, simpler models, a user generally relies on powerful computational tools to directly arrive at solutions to complex problems. As computational resources grow, users continue trying to simulate new, more complex, or more detailed problems, resulting in continual stress on both the code and computational resources. When these resources are limited, the user will have to make concessions by simplifying the problem while trying to preserve important details. In the context of MCNP, simplifications typically come as reductions in geometry, or by using variance reduction techniques. Both approaches can influence the physics of the problem, leading to potentially inaccurate or non-physical results. Errors can also be introduced as a result of faulty input into a computational tool: something as simple as transposing numbers in a tally input can result in incorrect answers.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Sparse Cholesky factorization for solving nonlinear PDEs via Gaussian processes

In recent years, there has been widespread adoption of machine learning-based approaches to automate the solving of partial differential equations (PDEs). Among these approaches, Gaussian processes (GPs) and kernel methods have garnered considerable interest due to their flexibility, robust theoretical guarantees, and close ties to traditional methods. They can transform the solving of general nonlinear PDEs into solving quadratic optimization problems with nonlinear, PDE-induced constraints. However, the complexity bottleneck lies in computing with dense kernel matrices obtained from pointwise evaluations of the covariance kernel, and its partial derivatives, a result of the PDE constraint and for which fast algorithms are scarce. The primary goal of this paper is to provide a near-linear complexity algorithm for working with such kernel matrices. We present a sparse Cholesky factorization algorithm for these matrices based on the near-sparsity of the Cholesky factor under a novel ordering of pointwise and derivative measurements. The near-sparsity is rigorously justified by directly connecting the factor to GP regression and exponential decay of basis functions in numerical homogenization. We then employ the Vecchia approximation of GPs, which is optimal in the Kullback-Leibler divergence, to compute the approximate factor. This enables us to compute ϵ-approximate inverse Cholesky factors of the kernel matrices with complexity O(N log d (N/ϵ)) in space and O(N log 2d (N/ϵ)) in time. We integrate sparse Cholesky factorizations into optimization algorithms to obtain fast solvers of the nonlinear PDE. We numerically illustrate our algorithm’s near-linear space/time complexity for a broad class of nonlinear PDEs such as the nonlinear elliptic, Burgers, and Monge-Ampère equations. In summary, we provide a fast, scalable, and accurate method for solving general PDEs with GPs and kernel methods.

97 MATHEMATICS AND COMPUTING↗

Circuit complexity near critical points

Here, we consider the Bose–Hubbard model in two and three spatial dimensions and numerically compute the quantum circuit complexity of the ground state in the Mott insulator and superfluid phases using a mean field approximation with additional quadratic fluctuations. After mapping to a qubit system, the result is given by the complexity associated with a Bogoliubov transformation applied to the reference state taken to be the mean field ground state. In particular, the complexity has peaks at the O(2) critical points where the system can be described by a relativistic quantum field theory. Given that we use a Gaussian approximation, near criticality the numerical results agree with a free field theory calculation. To go beyond the Gaussian approximation we use general scaling arguments that imply that, as we approach the critical point t → t c , there is a non-analytic behavior in the complexity c 2 (t) of the form |c 2 (t) – c 2 (t c )| ~ |t – t c | νd , up to possible logarithmic corrections. Here d is the number of spatial dimensions and ν is the usual critical exponent for the correlation length ξ ~ |t – t c | –ν . As a check, for d = 2 this agrees with the numerical computation if we use the Gaussian critical exponent $v=\frac{1}{2}$. Finally, using AdS/CFT methods, we study higher dimensional examples and confirm this scaling argument with non-Gaussian exponent ν for strongly interacting theories that have a gravity dual.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Online Learning of Effective Turbine Wind Speed in Wind Farms

To develop better wind farm controllers that can meet more complex objectives, methods of modeling the wind turbine wakes at low computational expense are needed. Gaussian process (GP) regression offers a computationally inexpensive framework for learning complex functions from noisy measurements with very few datapoints. In this work, an online learning approach is presented to learn the rotor-averaged wind velocity at downstream wind turbines with GPs, using the available datastream of wind field measurements and wind turbine control set-points. This framework can readily be integrated into model-based controls methods because the model a) is updated online at low computational expense, b) assumes a mathematically favorable Gaussian form, and c) explicitly quantifies the stochastic nature of the wake field so that the trade-off between exploration and exploitation, and the uncertainty in the prediction, can be utilized. We show that a GP-learned model can match true values with errors within 0.5% on average, with as few as 5 training data points.

Gaussian process↗

Multiscale multiphysics and multidomain models—Flexibility and rigidity

The emerging complexity of large macromolecules has led to challenges in their full scale theoretical description and computer simulation. Multiscale multiphysics and multidomain models have been introduced to reduce the number of degrees of freedom while maintaining modeling accuracy and achieving computational efficiency. A total energy functional is constructed to put energies for polar and nonpolar solvation, chemical potential, fluid flow, molecular mechanics, and elastic dynamics on an equal footing. The variational principle is utilized to derive coupled governing equations for the above mentioned multiphysical descriptions. Among these governing equations is the Poisson-Boltzmann equation which describes continuum electrostatics with atomic charges. The present work introduces the theory of continuum elasticity with atomic rigidity (CEWAR). The essence of CEWAR is to formulate the shear modulus as a continuous function of atomic rigidity. As a result, the dynamics complexity of a macromolecular system is separated from its static complexity so that the more time-consuming dynamics is handled with continuum elasticity theory, while the less time-consuming static analysis is pursued with atomic approaches. We propose a simple method, flexibility-rigidity index (FRI), to analyze macromolecular flexibility and rigidity in atomic detail. The construction of FRI relies on the fundamental assumption that protein functions, such as flexibility, rigidity, and energy, are entirely determined by the structure of the protein and its environment, although the structure is in turn determined by all the interactions. As such, the FRI measures the topological connectivity of protein atoms or residues and characterizes the geometric compactness of the protein structure. As a consequence, the FRI does not resort to the interaction Hamiltonian and bypasses matrix diagonalization, which underpins most other flexibility analysis methods. FRI's computational complexity is of O(N{sup 2}) at most, where N is the number of atoms or residues, in contrast to O(N{sup 3}) for Hamiltonian based methods. We demonstrate that the proposed FRI gives rise to accurate prediction of protein B-Factor for a set of 263 proteins. We show that a parameter free FRI is able to achieve about 95% accuracy of the parameter optimized FRI. An interpolation algorithm is developed to construct continuous atomic flexibility functions for visualization and use with CEWAR.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Bayesian approach for parameter estimation and prediction using a computationally intensive model

Bayesian methods have been successful in quantifying uncertainty in physics-based problems in parameter estimation and prediction. In these cases, physical measurements y are modeled as the best fit of a physics-based model eta(theta), where theta denotes the uncertain, best input setting. Hence the statistical model is of the form y = eta(theta) + c, where epsilon accounts for measurement, and possibly other, error sources. When nonlinearity is present in eta(center dot), the resulting posterior distribution for the unknown parameters in the Bayesian formulation is typically complex and nonstandard, requiring computationally demanding computational approaches such as Markov chain Monte Carlo (MCMC) to produce multivariate draws from the posterior. Although generally applicable, MCMC requires thousands (or even millions) of evaluations of the physics model eta(center dot). This requirement is problematic if the model takes hours or days to evaluate. To overcome this computational bottleneck, we present an approach adapted from Bayesian model calibration. This approach combines output from an ensemble of computational model runs with physical measurements, within a statistical formulation, to carry out inference. A key component of this approach is a statistical response surface, or emulator, estimated from the ensemble of model runs. We demonstrate this approach with a case study in estimating parameters for a density functional theory model, using experimental mass/binding energy measurements from a collection of atomic nuclei. We also demonstrate how this approach produces uncertainties in predictions for recent mass measurements obtained at Argonne National Laboratory.

Higdon, Dave↗