Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational physics applications”

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 55 records · Page 3

Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark

The LINPACK benchmark reports the performance of a computer for solving a system of linear equations with dense random matrices. Although this task was not designed with a real application directly in mind, the LINPACK benchmark has been used to define the list of TOP500 supercomputers since the debut of the list in 1993. We propose that a similar benchmark, called the quantum LINPACK benchmark, could be used to measure the whole machine performance of quantum computers. The success of the quantum LINPACK benchmark should be viewed as the minimal requirement for a quantum computer to perform a useful task of solving linear algebra problems, such as linear systems of equations. We propose an input model called the Random Circuit Block-Encoded Matrix (RACBEM), which is a proper generalization of a dense random matrix in the quantum setting. The RACBEM model is efficient to be implemented on a quantum computer and can be designed to optimally adapt to any given quantum architecture, with relying on a black-box quantum compiler. Besides solving linear systems, the RACBEM model can be used to perform a variety of linear algebra tasks relevant to many physical applications, such as computing spectral measures, time series generated by a Hamiltonian simulation, and thermal averages of the energy. We implement these linear algebra operations on IBM Q quantum devices as well as quantum virtual machines, and demonstrate their performance in solving scientific computing problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

WE-D-303-01: Development and Application of Digital Human Phantoms

Modern medical physics deals with complex problems such as 4D radiation therapy and imaging quality optimization. Such problems involve a large number of radiological parameters, and anatomical and physiological breathing patterns. A major challenge is how to develop, test, evaluate and compare various new imaging and treatment techniques, which often involves testing over a large range of radiological parameters as well as varying patient anatomies and motions. It would be extremely challenging, if not impossible, both ethically and practically, to test every combination of parameters and every task on every type of patient under clinical conditions. Computer-based simulation using computational phantoms offers a practical technique with which to evaluate, optimize, and compare imaging technologies and methods. Within simulation, the computerized phantom provides a virtual model of the patient’s anatomy and physiology. Imaging data can be generated from it as if it was a live patient using accurate models of the physics of the imaging and treatment process. With sophisticated simulation algorithms, it is possible to perform virtual experiments entirely on the computer. By serving as virtual patients, computational phantoms hold great promise in solving some of the most complex problems in modern medical physics. In this proposed symposium, we will present the history and recent developments of computational phantom models, share experiences in their application to advanced imaging and radiation applications, and discuss their promises and limitations. Learning Objectives: Understand the need and requirements of computational phantoms in medical physics research Discuss the developments and applications of computational phantoms Know the promises and limitations of computational phantoms in solving complex problems.

60 APPLIED LIFE SCIENCES↗

Oppenheimer Science and Energy Leadership Program (OSELP) Software and Computing Strategy for the Future of Weapons Physics Applications [Slides]

Mission drivers at the national level are evolving to accommodate a broadening landscape. The U.S. faces a rapidly evolving, threat-based environment with an associated expansion of national-level priorities. Priorities continue to include all aspects of sustaining the existing, aging stockpile. Now, however, we must also include consideration of options for a future deterrent, including efficacy of the deterrent against new threats (threat assessment and response), capability needs associated with new materials and modern manufacturing and production processes, and efficiency requirements for a modern workflow for weapons design. Executing this complex strategy will come with challenges. We must execute our current mission, while we prepare for future missions and an increasingly uncertain future.

42 ENGINEERING↗

WE-D-303-00: Computational Phantoms

Modern medical physics deals with complex problems such as 4D radiation therapy and imaging quality optimization. Such problems involve a large number of radiological parameters, and anatomical and physiological breathing patterns. A major challenge is how to develop, test, evaluate and compare various new imaging and treatment techniques, which often involves testing over a large range of radiological parameters as well as varying patient anatomies and motions. It would be extremely challenging, if not impossible, both ethically and practically, to test every combination of parameters and every task on every type of patient under clinical conditions. Computer-based simulation using computational phantoms offers a practical technique with which to evaluate, optimize, and compare imaging technologies and methods. Within simulation, the computerized phantom provides a virtual model of the patient’s anatomy and physiology. Imaging data can be generated from it as if it was a live patient using accurate models of the physics of the imaging and treatment process. With sophisticated simulation algorithms, it is possible to perform virtual experiments entirely on the computer. By serving as virtual patients, computational phantoms hold great promise in solving some of the most complex problems in modern medical physics. In this proposed symposium, we will present the history and recent developments of computational phantom models, share experiences in their application to advanced imaging and radiation applications, and discuss their promises and limitations. Learning Objectives: Understand the need and requirements of computational phantoms in medical physics research Discuss the developments and applications of computational phantoms Know the promises and limitations of computational phantoms in solving complex problems.

60 APPLIED LIFE SCIENCES↗

Plug-and-Play Methods for Integrating Physical and Learned Models in Computational Imaging: Theory, algorithms, and applications

Plug-and-play (PnP) priors constitute one of the most widely used frameworks for solving computational imaging problems through the integration of physical models and learned models. PnP leverages high-fidelity physical sensor models and powerful machine learning methods for prior modeling of data to provide state-of-the-art reconstruction algorithms. PnP algorithms alternate between minimizing a data fidelity term to promote data consistency and imposing a learned regularizer in the form of an image denoiser. Recent highly successful applications of PnP algorithms include biomicroscopy, computerized tomography (CT), magnetic resonance imaging (MRI), and joint ptychotomography. This article presents a unified and principled review of PnP by tracing its roots, describing its major variations, summarizing main results, and discussing applications in computational imaging. Additionally, we also point the way toward further developments by discussing recent results on equilibrium equations that formulate the problem associated with PnP algorithms.

97 MATHEMATICS AND COMPUTING↗

Cold, dilute spinless particles interacting via a weak, finite-range potential: an application of asymptotic approximation of integrals in computational physics

The properties of many-particle quantum systems can change drastically if the particles are attractive overall (e.g. a Fermi gas of atoms can become a Bose gas of dimers). It is therefore important to know if pairing can occur, particularly in the dilute strong coupling limit. We focus on cold helium atoms, which interact weakly via a finite-range potential. This problem can, of course, be approached numerically. However, with the extremely delicate balance of kinetic and potential energy, how do we know we can trust the number (e.g. the binding energy) that the computer produces? We could try several numerical schemes implemented with utmost care, and if they agree, we might feel confident in the answer. However, this does not constitute a proof: each scheme could be making the same mistake. We implement, instead, an analytical approach with guaranteed error bounds, which exploits an accident of Nature; namely, a small parameter in the pair wave function that invites the use of asymptotic theory. Leveraging the true long-range form of the wave function, a variational approach for bounds on the binding energy and dimer size produces integrals of a form that is well-known in the theory of asymptotic approximation of integrals. Despite being 'merely' a variational method, the upper bound obtained for the binding energy of the {sup 4}He{sub 2} dimer in three dimensions is remarkably close to a recent experimental value of 1.7 mK. Moreover, the calculated variational dimer size is also good. We have demonstrated the analytical framework by simulating the search for {sup 3}He{sub 2}, {sup 4}He{sub 2} and {sup 3}He-{sup 4}He dimers in one, two and three dimensions. The details will be published elsewhere.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Computing for Neutrino-Nucleus Scattering

Neutrino-nucleus cross section uncertainties are expected to be a dominant systematic in future accelerator neutrino experiments. The cross sections are determined by the linear response of the nucleus to the weak interactions of the neutrino, and are dominated by energy and distance scales of the order of the separation between nucleons in the nucleus. These response functions are potentially an important early physics application of quantum computers. Here we present an analysis of the resources required and their expected scaling for scattering cross section calculations. The current estimates of Trotter steps needed to achieve an energy resolution of 10 MeV and the number of CNOT gates for analyzing Ar40 highlights the need for significant improvements in algorithms. We also examine simple small-scale neutrino-nucleus models on modern quantum hardware. In this paper, we use variational methods to obtain the ground state of a three nucleon system (the triton) and then implement the relevant time evolution. To tame the errors in present-day NISQ devices, we explore the use of different error-mitigation techniques to increase the fidelity of the calculations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Multi-level Monte Carlo methods in chemical applications with Lennard-Jones potentials and other landscapes with isolated singularities

We describe and compare outcomes of various Multi-Level Monte Carlo (MLMC) method variants, motivated by the potential of improved computational efficiency over rejection based Monte Carlo, which scales poorly with problem dimension. With an eye toward its application to computational chemical physics, we test MLMC's ability to sample trajectories on two problems — a familiar double-well potential, with known stationary distributions, and a Lennard-Jones solid potential (a Galton Board). By sampling Brownian motion trajectories, we are able to compute expectations of observable averages. These multi-basin potential energy problems capture the essence of the challenges with using MLMC, namely, maintaining correspondence of sample paths as time-resolution is varied. Addressing this challenge properly can lead to MLMC significantly outperforming standard Monte Carlo path sampling. We describe the essence of this problem and suggest strategies that circumvent diverging multilevel sample paths for an important class of problems. In the tests we also compare the computational cost of several, “adaptive,” variants of MLMC. Our results demonstrate that MLMC overcomes the collision, time scale limitation of the more familiar Brownian path MC samplers, and our implementation provides tunable error thresholds, making MLMC a promising candidate for application to larger and more complex molecular systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

High-performance finite elements with MFEM

The MFEM (Modular Finite Element Methods) library is a high-performance C++ library for finite element discretizations. MFEM supports numerous types of finite element methods and is the discretization engine powering many computational physics and engineering applications across a number of domains. Furthermore, this paper describes some of the recent research and development in MFEM, focusing on performance portability across leadership-class supercomputing facilities, including exascale supercomputers, as well as new capabilities and functionality, enabling a wider range of applications. Much of this work was undertaken as part of the Department of Energy’s Exascale Computing Project (ECP) in collaboration with the Center for Efficient Exascale Discretizations (CEED).

97 MATHEMATICS AND COMPUTING↗

Reduced-Order Modeling: New Approaches for Computational Physics

In this paper, we review the development of new reduced-order modeling techniques and discuss their applicability to various problems in computational physics. Emphasis is given to methods ba'sed on Volterra series representations and the proper orthogonal decomposition. Results are reported for different nonlinear systems to provide clear examples of the construction and use of reduced-order models, particularly in the multi-disciplinary field of computational aeroelasticity. Unsteady aerodynamic and aeroelastic behaviors of two- dimensional and three-dimensional geometries are described. Large increases in computational efficiency are obtained through the use of reduced-order models, thereby justifying the initial computational expense of constructing these models and inotivatim,- their use for multi-disciplinary design analysis.

Beran, Philip S.↗

Hypercubes for critical spacecraft command verification

Interplanetary spacecraft are controlled with sets of onboard commands called 'sequences' that control the spacecraft for hours, days, or weeks depending upon the craft and its current activity phase. The sequence-checking problem, with some examples from practical experience, and the technical challenges of implementing sequence checking on a parallel computer are presented. Hypercube applications including computational-physics problems, 'optimistic' and 'conservative' categories are discussed. Finally, future development and prototype ways of balancing the checking network across the hypercube nodes, handling time dependencies among the checks, and minimizing communication are described.

Horvath, Joan C.↗

CFD 2030 Grand Challenge: CFD-in-the-Loop Monte Carlo Flight Simulation for Space Vehicle Design

Flight qualification of space vehicles is markedly different from those typically employed for aircraft. The concept of an extensive flight test campaign for a space vehicle does not exist, and vehicle designers must look to alternative techniques for demonstrating robust and reliable performance of their vehicles prior to operational flight. A space vehicle may undergo only a handful of flight tests in its development cycle, with each flight representing a drastically different flight phase or flight configuration. For instance, NASA’s Space Launch System (SLS) launch vehicle and Orion spacecraft will only see a total of four flight demonstrations before flying a crew on its first operational mission, and each flight demonstrates a unique vehicle configuration and/or set of flight conditions. The SLS will be flown only one time before it becomes operational (Artemis 1). The Orion spacecraft Crew Module (CM) will have been tested twice, once on a Delta IV launch vehicle (Exploration Flight Test 1) and once as a fully integrated system with the SLS launch vehicle (Artemis 1). The Orion Launch abort system will have been tested twice, once in a pad abort scenario (Pad Abort 1) and once in an inflight abort scenario (Ascent Abort 2) on a modified Peacekeeper booster. Both of these latter tests involve only a boiler plate CM, not a functional Orion spacecraft. Thus, unlike aircraft, there is very little opportunity for engineers to assess and evaluate their preflight predictions. Instead, space vehicle designers rely on Monte Carlo flight simulations with detailed dispersions of predicted nominal flight behavior to determine how robust their design is to errors and uncertainties in the flight conditions their vehicle may encounter. These Monte Carlo analyses entail thousands of trajectory simulations to demonstrate that the vehicle can meet design requirements at a specified level of reliability. From an aerodynamics and aerothermodynamics perspective, these trajectory simulations are fueled by an extensive aerodynamic database that covers the complete range of expected flight conditions, vehicle configurations, and flight attitudes expected in a given mission. Today, these databases amount to a table of engineering parameters that can be quickly interrogated by the trajectory simulator. The aerodynamic and aerothermodynamic databases are assembled via a series of ground tests, empirical and analytical analysis, physics-based computational analysis, applicable past flight performance data, and in some cases, engineering judgment. These databases generally take years to assemble for a new space vehicle system and in the case of SLS/Orion, over a decade of test and analysis have been expended to develop the extensive databases required to cover the myriad of configurations and potential flight conditions required for the system. Recently, it has been proposed that Computational Fluid Dynamic (CFD) and computing capability may be reaching a point where it is foreseeable that CFD could be integrated directly into the production trajectory simulation tools used to design NASA’s space vehicles. To demonstrate this, NASA has embarked on two demonstrations of this type of capability, one where six degree of freedom flight trajectory simulation equations are embedded in an existing CFD solver and another where a production CFD solver is loosely coupled with a production trajectory simulation tool. These efforts represent an initial demonstration of a future approach to flight trajectory simulation, but they are a far cry from the capability required to perform a full-up CFD-in-the-loop Monte Carlo trajectory simulation. Therefore, this represents a viable grand challenge for computational methods addressing space vehicle design and development. The final paper/presentation will discuss the many hurdles, beyond simply raw computational power, to realizing this grand challenge and how they map directly to the CFD Vision 2030 ojectives. Among these are the wide range of flight conditions, including accelerating/decelerating flight, encountered by a space vehicle during launch and/or entry. The vehicle can also encounter numerous configuration changes, some of which can be quite drastic, during the course of its flight, so robust, automated geometry modeling, grid generation, and adaptation will play a huge role in reaching this goal. Multiply this by 1000’s of trajectory simulations occurring simultaneously in a given Monte Carlo analysis, and the problem readily scales to absorb virtually any size of supercomputer envisioned today. The concept of CFD-in-the-loop Monte Carlo trajectory simulation poses a formidable challenge for emerging and future computing systems, and it has the potential to shave years off the development cycle for aerodynamic and aerothermodynamic performance predictions as compared to today’s space vehicle design approach.

CFD 2030↗

Rapid Aero Modeling for Urban Air Mobility Aircraft in Wind-Tunnel Tests

Rapid Aero Modeling (RAM) applied to wind tunnel testing, RAM-T, is an approach to efficiently and automatically obtain aerodynamic models during testing. The approach saves time and resources by responding to the demand for experimental efficiency and model fidelity. Motivation for this demand is more acute when investigating a class of vehicles categorized as Urban Air Mobility (UAM) aircraft where many features from both aircraft and rotorcraft are present. RAM-T provides a feedback loop around the test facility to guide the test toward high-fidelity, statistically rigorous aircraft models. The general RAM approach is applicable to computational or physical experiments. It combines concepts from design of experiment theory and aircraft system identification theory that allow the user the freedom to choose, in advance of the test, a specific level of fidelity in terms of prediction error. RAM only collects data required to meet the user-specified fidelity and fidelity is only limited by the facility and test article capabilities. This paper presents results from tests conducted for development of an automated RAM-T technology. The results highlight some of the unique features of RAM applied to eVTOL configurations.

Aerodynamics↗

An Update on the Colossus mK platform at Fermilab

As part of the efforts of the Superconducting Quantum Materials and Systems National Quantum Center at Fermilab, we will construct a large millikelvin refrigeration platform known as Colossus. The Colossus platform will be used for quantum computing applications, along with physics and sensing experiments. At the preceding CEC/ICMC meeting in 2021, we reported on the conceptual design of the platform. In the intervening time, the design of the system has been completed and passed through review, with construction now underway. This paper provides an update on the overall design of the system, and the status of and timeline for construction.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Π4U: A high performance computing framework for Bayesian uncertainty quantification of complex models

We present Π4U,{sup 1} an extensible framework, for non-intrusive Bayesian Uncertainty Quantification and Propagation (UQ+P) of complex and computationally demanding physical models, that can exploit massively parallel computer architectures. The framework incorporates Laplace asymptotic approximations as well as stochastic algorithms, along with distributed numerical differentiation and task-based parallelism for heterogeneous clusters. Sampling is based on the Transitional Markov Chain Monte Carlo (TMCMC) algorithm and its variants. The optimization tasks associated with the asymptotic approximations are treated via the Covariance Matrix Adaptation Evolution Strategy (CMA-ES). A modified subset simulation method is used for posterior reliability measurements of rare events. The framework accommodates scheduling of multiple physical model evaluations based on an adaptive load balancing library and shows excellent scalability. In addition to the software framework, we also provide guidelines as to the applicability and efficiency of Bayesian tools when applied to computationally demanding physical models. Theoretical and computational developments are demonstrated with applications drawn from molecular dynamics, structural dynamics and granular flow.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Architecture for the Performance of Nuclear Fuel Depletion Calculations

Computational analysis of the depletion of nuclear fuel is crucial to the accurate modeling of the time-dependent behavior of nuclear reactors. The reactor physics application MAMMOTH is modified to compute radioactive decay and neutron transmutation in order to model physical processes which occur within nuclear reactors as reactor fuel is burned. The ability to read decay and cross-section data files of other codes are also added and the addition of a standardized decay and transmutation XML file format for MAMMOTH, known as ISOXML. Comparisons between MAMMOTH and the Oak Ridge Isotope Generation (ORIGEN) code are performed to demonstrate the improved precision possible with MAMMOTH. In addition, several tests are run to demonstrate the ability of MAMMOTH to model decay and transmutation processes involving hundreds of isotopes. Future work will focus on solving depletion problems with multiple neutron energy groups and the implementation of predictor-corrector methods, several of which are described in this work.

07 ISOTOPE AND RADIATION SOURCES↗

Proceedings of the 1998 International Computational Accelerator Physics Conference

The 1998 International Computational Accelerator Physics Conference, ICAP’98, was held September 14-18, 1998, at the Monterey Convention Center in Monterey, California. The meeting continued the tradition of four earlier Computational Accelerator Physics conferences, held in La Jolla, California (1988), Los Alamos, New Mexico (1990), Pleasanton, California (1993), and Williamsburg, Virginia (1996). ICAP’98 was organized by the Stanford Linear Accelerator Center (SLAC), Los Alamos National Laboratory (LANL), and the National Energy Research Scientific Computing Center (NERSC), and received support from the U.S. Department of Energy. The aim of this conference series is to discuss recent advances in Computational Accelerator Physics and their applications to solving important problems related to present and future accelerators. The ICAP’98 program included plenary sessions on modeling challenges in next-generation accelerators, state-of-the art methods in computational accelerator physics, and a view of what high-end computing would be like in the 21st century. There were also focused sessions on accelerator design and control, modeling high intensity beam phenomena, electromagnetic modeling, advanced algorithms, software environments and libraries, visualization and graphic interfaces, modeling advanced accelerator concepts, modeling the beam-beam interaction, computing wakefields, and combined particle/field simulations. In addition to these oral sessions there was a poster session and a vendor display. Prior to the start of the technical program, a half-day tutorial on High Performance Computing was hosted by NERSC. The ICAP series recognizes that computing and, in particular, advanced computing, is playing an increasingly important role in the successful design and development of major accelerator facilities, and in research and development leading to advances in accelerator technology. We expect that this new emphasis on high-end computing will continue in future ICAP conferences.

Ko, Kwok↗

An automatic performance model-based scheduling tool for coupled climate system models

The prediction of the climate system is highly depended on the efficient integration of observations and simulations of the Earth. This is regarded as a canonical example of the cyber-physical system. The climate system model, the simulation engine in this cyber-physical system, is one of most challenging applications in scientific computing. It utilizes the multi-physics simulation that couples multiple components, conducts decadal to millennium simulations, and has long been an important application on supercomputers. However, current climate system models suffer from the inefficient task scheduling methods resulting in an intolerable simulation time. Take the Community Earth System Model (CESM), the most widely used climate system model, as an example, one major reason that CESM suffers from bad performances is the huge overhead to rationally distribute processes among the coupled heterogeneous components. According to the report of NCAR, every percent improvement in CESM performance frees up to the equivalent of $250,000 in computing resources in their scientific experiments. To address such challenge, our paper firstly constructs a lightweight and accurate performance model for effectively capturing and predicting the heterogeneous time-to-solution performance of end-to-end CESM components with a given simulation configuration. Then, based on the performance model, we further propose an efficient scheduling strategy based on rectangular packing method to determine the best process layout among different components, and the process numbers assigned to each component. Our evaluations show that we can achieve 58% average run time reductions on CESM comparing to the widely used sequential process layout for a scale of 144 to 480 cores on typical CPU clusters. And we can save 4 million CPU hours when we conduct one standard scientific experiment (a 2870-year simulation), which equals to save $40,089 with a charge of $0.01 per CPU hour. Meanwhile, 26% extra performance improvements could also be gained in our methods comparing to the heuristic branch and bound algorithm with the guidance of the known curve-fitting performance model.

58 GEOSCIENCES↗