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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,171 records · Page 65

All sources NASA NTRS DOE OSTI

DOE OSTI2022

Impact of Increased Latent Generations on Sensitivity Calculations with SCALE

Analyses of cross section sensitivity data from systems with fissile material allow analysts to associate an importance for each material, nuclide, reaction, and neutron energy by simulating real world criticality scenarios. Although criticality safety validation efforts can be guided by the cross-section sensitivity and uncertainty data generated for a particular system, these calculations can often be computationally expensive and sometimes cumbersome without proper guidance. The TSUNAMI suite within the SCALE code package has several methods for generating sensitivity data, including multigroup and continuous energy (CE) capabilities. The release of SCALE 6.3 has three different CE methods for generating cross section sensitivity data: (1) the Iterated Fission Probability (IFP) method with the KENO Monte Carlo transport solver, (2) the IFP method with the Shift Monte Carlo transport solver, and (3) the Contributon-Linked eigenvalue sensitivity/Uncertainty estimation via Tracklength importance CHaracterization (CLUTCH) method with the KENO Monte Carlo transport solver. Although the CLUTCH method has additional parameters for generating sensitivity data files relative to the IFP method, all three methods use latent generations, which are the generations between an event (i.e., fission) and the assessment of importance based on the asymptotic population of progeny neutrons. Increasing the number of latent generations in a calculation leads to increased discrimination of the sensitivity coefficients but at the cost of the increased uncertainty associated with those generated values. Analysts must balance the accuracy of the sensitivity calculations and its uncertainty with the associated computational cost involved in generating the values. This paper discusses the impact of adjusting the latent generation parameter for a range of sensitivity values and how these changes compare with the direct perturbation values obtained from a change of ±0.5% Δ k in both benchmark and safety application models. Two benchmarks from the International Handbook of Evaluated Criticality Safety Benchmark Experiments and the MPC-32 dual purpose canister for spent nuclear fuel are used for analysis.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2021

Quantum Alternating Operator Ansatz (QAOA) Phase Diagrams and Applications for Quantum Chemistry

Determining Hamiltonian ground states and energies is a challenging task with many possible approaches on quantum computers. While variational quantum eigensolvers are popular approaches for near term hardware, adiabatic state preparation is an alternative that does not require noisy optimization of parameters. Beyond adiabatic schedules, QAOA is an important method for optimization problems. In this work we modify QAOA to apply to finding ground states of molecules and empirically evaluate the modified algorithm on several molecules. This modification applies physical insights used in classical approximations to construct suitable QAOA operators and initial state. We find robust qualitative behavior for QAOA as a function of the number of steps and size of the parameters, and demonstrate this behavior also occurs in standard QAOA applied to combinatorial search. To this end we introduce QAOA phase diagrams that capture its performance and properties in various limits. In particular we show a region in which non-adiabatic schedules perform better than the adiabatic limit while employing lower quantum circuit depth. We further provide evidence our results and insights also apply to QAOA applications beyond chemistry.

Kremenetski, Vladimir↗

DOE OSTI2025

From PINNs to PIKANs: recent advances in physics-informed machine learning

Physics-Informed Neural Networks (PINNs) have emerged as a key tool in Scientific Machine Learning since their introduction in 2017, enabling the efficient solution of ordinary and partial differential equations using sparse measurements. Over the past few years, significant advancements have been made in the training and optimization of PINNs, covering aspects such as network architectures, adaptive refinement, domain decomposition, and the use of adaptive weights and activation functions. A notable recent development is the Physics-Informed Kolmogorov-Arnold Networks (PIKANS), which leverage a representation model originally proposed by Kolmogorov in 1957, offering a promising alternative to traditional PINNs. In this review, we provide a comprehensive overview of the latest advancements in PINNs, focusing on improvements in network design, feature expansion, optimization techniques, uncertainty quantification, and theoretical insights. We also survey key applications across a range of fields, including biomedicine, fluid and solid mechanics, geophysics, dynamical systems, heat transfer, chemical engineering, and beyond. Lastly, we review computational frameworks and software tools developed by both academia and industry to support PINN research and applications.

Kolmogorov-Arnold networks↗

DOE OSTI2021

Quantum Sensing and its Potential for Nuclear Safeguards

Quantum sensing has the potential to provide ultrasensitive measurements of physical phenomenon. Unlike quantum computing, quantum sensing is available now, though in general at research laboratories. A notable commercially-available quantum sensing device is the ubiquitous Superconducting Quantum Interference Device (SQUID), which can measure faint magnetic fields such as found in the human brain. Quantum sensing is used for direct measurement of environmental phenomenon, such as electromagnetic fields and accelerations, which then are used for certain applications. For example, quantum sensing of accelerations is useful for Position, Navigation, and Timing (PNT) applications. It is not clear, however, how quantum sensing can be useful for nuclear safeguards. This report provides first a background in quantum sensing, followed by a survey of potential safeguards utilizations of quantum sensing. Several potential safeguards applications are identified and explored.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2020

Variable Precision Computing (VPC) (Final Report)

The overall goal of the Variable Precision Computing project is exploring and identifying ways to reduce internodal communication cost in production physics simulation experiments running on a distributed-memory systems by compressing data, either in a lossy or lossless way, thus resulting in a significant computational performance increase. Among the several approaches proposed, the one discussed here has been proposed, designed and implemented by me. It concerns the application of information theory-derived metrics to classical molecular dynamics and computational fluid dynamics simulation experiments.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1975

Application of multivariate autoregressive spectrum estimation to ULF waves

The estimation of the power spectrum of a time series by fitting a finite autoregressive model to the data has recently found widespread application in the physical sciences. The extension of this method to the analysis of vector time series is presented here through its application to ULF waves observed in the magnetosphere by the ATS 6 synchronous satellite. Autoregressive spectral estimates of the power and cross-power spectra of these waves are computed with computer programs developed by the author and are compared with the corresponding Blackman-Tukey spectral estimates. The resulting spectral density matrices are then analyzed to determine the direction of propagation and polarization of the observed waves.

Ioannidis, G. A.↗

NASA NTRS1989

Development of a Navier-Stokes algorithm for parallel-processing supercomputers

An explicit flow solver, applicable to the hierarchy of model equations ranging from Euler to full Navier-Stokes, is combined with several techniques designed to reduce computational expense. The computational domain consists of local grid refinements embedded in a global coarse mesh, where the locations of these refinements are defined by the physics of the flow. Flow characteristics are also used to determine which set of model equations is appropriate for solution in each region, thereby reducing not only the number of grid points at which the solution must be obtained, but also the computational effort required to get that solution. Acceleration to steady-state is achieved by applying multigrid on each of the subgrids, regardless of the particular model equations being solved. Since each of these components is explicit, advantage can readily be taken of the vector- and parallel-processing capabilities of machines such as the Cray X-MP and Cray-2.

Swisshelm, Julie M.↗

NASA NTRS1988

Development of an aerodynamics algorithm for parallel-processing supercomputers

Swisshelm, Julie M.↗

NASA NTRS1992

Multidisciplinary computational aerosciences

By combining CFD with the computational state-of-the-art in structural mechanics, propulsion, aeroacoustics, electromagnetics, etc., multidisciplinary computational aerosciences (MCAS) poses a formidable computational challenge requiring the use of massively parallel machines. Research efforts must accordingly be directed to three areas: (1) parallel architectures, (2) systems software, and (3) applications software; attention is presently given to the last of these, in view of developments at NASA-Ames in solution methodology, physical modeling, and multidisciplinary validation experiments.

Kutler, P.↗

NASA NTRS1997

Global Pattern of Potential Evaporation Calculated from the Penman-Monteith Equation Using Satellite and Assimilated Data

Potential evaporation (E(0)) has been found to be useful in many practical applications and in research for setting a reference level for actual evaporation. All previous estimates of regional or global E(0) are based upon empirical formulae using climatologic meteorologic measurements at isolated stations (i.e., point data). However, the Penman-Monteith equation provides a physically based approach for computing E(0), and by comparing 20 different methods of estimating E(0), Jensen et al. (1990) showed that the Penman-Monteith equation provides the most accurate estimate of monthly E(0) from well-watered grass or alfalfa. In the present study, monthly total E(0) for 24 months (January 1987 to December 1988) was calculated from the Penman-Monteith equation, with prescribed albedo of 0.23 and surface resistance of 70 s/m, which are considered to be representative of actively growing well-watered grass covering the ground. These calculations have been done using spatially representative data derived from satellite observations and data assimilation results. Satellite observations were used to obtain solar radiation, fractional cloud cover, air temperature, and vapor pressure, while four-dimensional data assimilation results were used to calculate the aerodynamic resistance. Meteorologic data derived from satellite observations were compared with the surface measurements to provide a measure of accuracy. The accuracy of the calculated E(0) values was assessed by comparing with lysimeter observations for evaporation from well-watered grass at 35 widely distributed locations, while recognizing that the period of present calculations was not concurrent with the lysimeter measurements and the spatial scales of these measurements and calculations are vastly different. These comparisons suggest that the error in the calculated E(0) values may not be exceeded, on average, 20% for any month or location, but are more likely to be about 15%. These uncertainties are difficult to quantify for mountainous areas or locations close to extensive water bodies. The difference between the calculated and observed E(0) is about 5% when all month and locations were considered. Errors are expected to be less than 15% for averages of E(0) over large areas or several months. Further comparisons with lysimeter observations could provide a better appraisal of the calculated values. Global pattern of E(0) was presented, together with zonal average values.

Choudhury, Bhaskar J.↗

NASA NTRS2000

On the Computational Capabilities of Physical Systems: The Impossibility of Infallible Computation - Part 1

In this first of two papers, strong limits on the accuracy of physical computation are established. First it is proven that there cannot be a physical computer C to which one can pose any and all computational tasks concerning the physical universe. Next it is proven that no physical computer C can correctly carry out any computational task in the subset of such tasks that can be posed to C. This result holds whether the computational tasks concern a system that is physically isolated from C, or instead concern a system that is coupled to C. As a particular example, this result means that there cannot be a physical computer that can, for any physical system external to that computer, take the specification of that external system's state as input and then correctly predict its future state before that future state actually occurs; one cannot build a physical computer that can be assured of correctly 'processing information faster than the universe does'. The results also mean that there cannot exist an infallible, general-purpose observation apparatus, and that there cannot be an infallible, general-purpose control apparatus. These results do not rely on systems that are infinite, and/or non-classical, and/or obey chaotic dynamics. They also hold even if one uses an infinitely fast, infinitely dense computer, with computational powers greater than that of a Turing Machine. This generality is a direct consequence of the fact that a novel definition of computation - a definition of 'physical computation' - is needed to address the issues considered in these papers. While this definition does not fit into the traditional Chomsky hierarchy, the mathematical structure and impossibility results associated with it have parallels in the mathematics of the Chomsky hierarchy. The second in this pair of papers presents a preliminary exploration of some of this mathematical structure, including in particular that of prediction complexity, which is a 'physical computation analogue' of algorithmic information complexity. It is proven in that second paper that either the Hamiltonian of our universe proscribes a certain type of computation, or prediction complexity is unique (unlike algorithmic information complexity), in that there is one and only version of it that can be applicable throughout our universe.

Wolpert, David H.↗

NASA NTRS2002

MERBoard User's Guide

An important goal of MERBoard is to allow users to quickly and easily share information. The front-end interface is physically a large plasma computer display with a touch screen, allowing multiple people to interact shoulder-to-shoulder or in a small meeting area. The software system allows people to interactively create digital whiteboards, browse the web, give presentations and connect to personal computers (for example, to run applications not on the MERBoard computer itself). There are four major integrated applications: a browser; a remote connection to another computer (VNC); a digital whiteboard; and a digital space (MERSpace), which is a digital repository for each individual user.

Trimble, Jay↗

NASA NTRS2011

Graph Theory Roots of Spatial Operators for Kinematics and Dynamics

Spatial operators have been used to analyze the dynamics of robotic multibody systems and to develop novel computational dynamics algorithms. Mass matrix factorization, inversion, diagonalization, and linearization are among several new insights obtained using such operators. While initially developed for serial rigid body manipulators, the spatial operators and the related mathematical analysis have been shown to extend very broadly including to tree and closed topology systems, to systems with flexible joints, links, etc. This work uses concepts from graph theory to explore the mathematical foundations of spatial operators. The goal is to study and characterize the properties of the spatial operators at an abstract level so that they can be applied to a broader range of dynamics problems. The rich mathematical properties of the kinematics and dynamics of robotic multibody systems has been an area of strong research interest for several decades. These properties are important to understand the inherent physical behavior of systems, for stability and control analysis, for the development of computational algorithms, and for model development of faithful models. Recurring patterns in spatial operators leads one to ask the more abstract question about the properties and characteristics of spatial operators that make them so broadly applicable. The idea is to step back from the specific application systems, and understand more deeply the generic requirements and properties of spatial operators, so that the insights and techniques are readily available across different kinematics and dynamics problems. In this work, techniques from graph theory were used to explore the abstract basis for the spatial operators. The close relationship between the mathematical properties of adjacency matrices for graphs and those of spatial operators and their kernels were established. The connections hold across very basic requirements on the system topology, the nature of the component bodies, the indexing schemes, etc. The relationship of the underlying structure is intimately connected with efficient, recursive computational algorithms. The results provide the foundational groundwork for a much broader look at the key problems in kinematics and dynamics. The properties of general graphs and trees of nodes and edge were examined, as well as the properties of adjacency matrices that are used to describe graph connectivity. The nilpotency property of such matrices for directed trees was reviewed, and the adjacency matrices were generalized to the notion of block weighted adjacency matrices that support block matrix elements. This leads us to the development of the notion of Spatial Kernel Operator SKO kernels. These kernels provide the basis for the development of SKO resolvent operators.

Jain, Abhinandan↗

DOE OSTI2021

bnl/pub-Maffettone_2020_08

The application of the XCA package as first demonstrated in aXiv:2008.00283. ABSTRACT: The discovery of new structural and functional materials is driven by phase identification, often using X-ray diffraction (XRD). Automation has accelerated the rate of XRD measurements, greatly outpacing XRD analysis techniques that remain manual, time consuming, error prone, and impossible to scale. With the advent of autonomous robotic scientists or self-driving labs, contemporary techniques prohibit the integration of XRD. Here, we describe a computer program for the autonomous characterization of XRD data, driven by artificial intelligence (AI), for the discovery of new materials. Starting from structural databases, we train an ensemble model using a physically accurate synthetic dataset, which output probabilistic classifications --- rather than absolutes --- to overcome the overconfidence in traditional neural networks. This AI agent behaves as a companion to the researcher, improving accuracy and offering unprecedented time savings, and is demonstrated on a diverse set of organic and inorganic materials challenges. This innovation is directly applicable to inverse design approaches, robotic discovery systems, and can be immediately considered for other forms of characterization such as spectroscopy and the pair distribution function.

Maffettone, PhillipM [Brookhaven National Lab. (BN↗

DOE OSTI2022

GLUE Code: A framework handling communication and interfaces between scales

Many scientific applications are inherently multiscale in nature. Such complex physical phenomena often require simultaneous execution and coordination of simulations spanning multiple time and length scales. This is possible by combining expensive small-scale simulations (such as molecular dynamics simulations) with larger scale simulations (such continuum limit/hydro solvers) to allow for considerably larger systems using task and data parallelism. However, the granularity of the tasks can be very large and often leads to load imbalance. Traditionally, we use approximations to streamline the computation of the more costly interactions and this introduces trade-offs between simulation cost and accuracy. In recent years, the available computational power and the advances in machine learning have made computing these scale-bridging interactions and multiscale simulations more feasible. One driving application has been plasma modeling in inertial confinement fusion (ICF), which is fundamentally multiscale in nature. This requires deep understanding of how to extrapolate microscopic information into macroscopically relevant scales. For example, in ICF one needs an accurate understanding of the connection between experimental observables and the underlying microphysics. The properties of the larger scales are often affected by the microscale behavior incorporated usually into the equations of state and ionic and electronic transport coefficients (Liboff, 1959; Rinderknecht et al., 2014; Rosenberg et al., 2015; Ross et al., 2017). Instead of incorporating this information using reliable molecular dynamics (MD) simulations, one often needs to use theoretical models, due to the inability of MD to reach engineering scales (Glosli et al., 2007; Marinak et al., 1998). One approach to resolve this issue is by coupling two MD simulations of different scales via force interpolation, e.g., the AdResS method (Krekeler et al., 2018; Nagarajan et al., 2013). Another approach, which we will pursue in the scope of this work, is by enabling scale bridging between MD simulations and meso/macro-scale models through the development and support of application programming interfaces that these different applications can interact through.

54 ENVIRONMENTAL SCIENCES↗

NASA NTRS1994

Prediction modeling of physiological responses and human performance in the heat with application to space operations

This institute has developed a comprehensive USARIEM heat strain model for predicting physiological responses and soldier performance in the heat which has been programmed for use by hand-held calculators, personal computers, and incorporated into the development of a heat strain decision aid. This model deals directly with five major inputs: the clothing worn, the physical work intensity, the state of heat acclimation, the ambient environment (air temperature, relative humidity, wind speed, and solar load), and the accepted heat casualty level. In addition to predicting rectal temperature, heart rate, and sweat loss given the above inputs, our model predicts the expected physical work/rest cycle, the maximum safe physical work time, the estimated recovery time from maximal physical work, and the drinking water requirements associated with each of these situations. This model provides heat injury risk management guidance based on thermal strain predictions from the user specified environmental conditions, soldier characteristics, clothing worn, and the physical work intensity. If heat transfer values for space operations' clothing are known, NASA can use this prediction model to help avoid undue heat strain in astronauts during space flight.

Pandolf, Kent B.↗

DOE OSTI2021

Physics-informed machine learning

Despite great progress in simulating multiphysics problems using the numerical discretization of partial differential equations (PDEs), one still cannot seamlessly incorporate noisy data into existing algorithms, mesh generation remains complex, and high-dimensional problems governed by parameterized PDEs cannot be tackled. Moreover, solving inverse problems with hidden physics is often prohibitively expensive and requires different formulations and elaborate computer codes. Machine learning has emerged as a promising alternative, but training deep neural networks requires big data, not always available for scientific problems. Instead, such networks can be trained from additional information obtained by enforcing the physical laws (for example, at random points in the continuous space-time domain). Such physics-informed learning integrates (noisy) data and mathematical models, and implements them through neural networks or other kernel-based regression networks. Moreover, it may be possible to design specialized network architectures that automatically satisfy some of the physical invariants for better accuracy, faster training and improved generalization. Furthermore, we review some of the prevailing trends in embedding physics into machine learning, present some of the current capabilities and limitations and discuss diverse applications of physics-informed learning both for forward and inverse problems, including discovering hidden physics and tackling high-dimensional problems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Gaussian Process Optimization of Sensitivity-Based Similarity Metrics between New Nuclear Applications and New/Existing Benchmarks [Slides]

This presentation discusses Nuclear Criticality Safety (NCS) and how designing safe, new nuclear criticality experiments requires expert judgement, which could take years of experience. Sensitivity/uncertainty (S/U) analysis can be utilized by less experienced individuals to conservatively estimate uncertainties in important parameters, such as k eff , in newly proposed nuclear experiments. The presentation poses the question of how this analysis can be performed and states that the answer lies in matching new nuclear experiments with existing benchmark experiments using similarity metrics. By increasing the criticality safety of the application in this work, higher mass limits could be used in PF-4 operations. Additionally, the presentation discusses MCNP6.2®, Whisper-1.1, the software that can be used in this analysis. Also discussed is the fact that International Criticality Safety Benchmark Evaluation Project (ICSBEP) benchmarks rarely match new nuclear applications and that there are significant differences in given set of materials and/or geometry. If there are no benchmarks that match the application, the presentation discusses the possibility of creating new benchmarks. In conclusion, this work presents a Gaussian process (GP) optimization scheme that was used to generate new benchmarks with the highest sensitivity-based similarity metrics to user-defined nuclear applications. The Gaussian process optimization successfully designed 3 new experimental benchmarks that were highly correlated to the application of interest and had k eff values near critical. Optimization over c k,i-r has shown that investigating specific isotope reactions for different applications is crucial to designing benchmark experiments. Partial contribution from Pu dominates c k similarity metric. Future work includes testing new stand-alone similarity metrics or new combinations of similarity metrics as the design criterion of this optimization – design criterion is application dependent.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗