Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational Physics”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS2005

Verification, Validation, and Solution Quality in Computational Physics: CFD Methods Applied to Ice Sheet Physics

Procedures and methods for veri.cation of coding algebra and for validations of models and calculations used in the aerospace computational fluid dynamics (CFD) community would be ef.cacious if used by the glacier dynamics modeling community. This paper presents some of those methods, and how they might be applied to uncertainty management supporting code veri.cation and model validation for glacier dynamics. The similarities and differences between their use in CFD analysis and the proposed application of these methods to glacier modeling are discussed. After establishing sources of uncertainty and methods for code veri.cation, the paper looks at a representative sampling of veri.cation and validation efforts that are underway in the glacier modeling community, and establishes a context for these within an overall solution quality assessment. Finally, a vision of a new information architecture and interactive scienti.c interface is introduced and advocated.

Thompson, David E.↗
NASA NTRS1972

An integrated radiation physics computer code system.

An integrated computer code system for the semi-automatic and rapid analysis of experimental and analytic problems in gamma photon and fast neutron radiation physics is presented. Such problems as the design of optimum radiation shields and radioisotope power source configurations may be studied. The system codes allow for the unfolding of complex neutron and gamma photon experimental spectra. Monte Carlo and analytic techniques are used for the theoretical prediction of radiation transport. The system includes a multichannel pulse-height analyzer scintillation and semiconductor spectrometer coupled to an on-line digital computer with appropriate peripheral equipment. The system is geometry generalized as well as self-contained with respect to material nuclear cross sections and the determination of the spectrometer response functions. Input data may be either analytic or experimental.

Steyn, J. J.↗
DOE OSTI2022

Cosmic Reionization on Computers: Physical Origin of Long Dark Gaps in Quasar Absorption Spectra

I explore the properties of “dark gaps” - regions in quasar absorption spectra without significant transmission - with several simulations from the Cosmic Reionization On Computers (CROC) project. The CROC simulations in the largest available boxes (120 cMpc) come close to matching both the distribution of mean opacities and the frequency of dark gaps, but alas not in the same model: the run that matches the mean opacities fails to contain enough dark gaps and vice versa. Nevertheless, the run that matches the dark gap distributions serves as a counterexample to claims in the literature that the dark gap statistics requires a late end to reionization - in that run reionization ends at z = 6.7 (likely too early). While multiple factors contribute to the frequency of large dark gaps in the simulations, the primary factor that controls the overall shape of the dark gap distribution is the ionization level in voids—the lowest-density regions produce the highest transmission spikes that terminate long gaps. As the result, the dark gap distribution correlates strongly with the fraction of the spectrum above the gap detection threshold and the observed distribution is matched by the simulation in which this fraction is 2%. Hence, the gap distribution by itself does not constrain the timing of reionization, although it may do so in combination with the distribution of mean opacities.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Methods for Computing Physically Realistic Estimates of Electric Water Heater Demand Response Resource Suitable for Bulk Power System Planning Models

Demand response is commonly called on to reduce load during system peak times or to respond to contingency events. In future power systems with higher shares of wind and solar generation (which we describe together as variable generation [VG]), demand response could have more opportunities to provide energy shifting or operating reserve services. This report evaluates the ability of residential electric water heaters, both electric resistance water heaters (ERWHs) and heat pump water heaters (HPWHs), to provide such services starting from detailed whole-building energy models that realistically represent New England single family home stock. We use a parsimonious surrogate model to represent operational flexibility in a form suitable for linear and mixed integer programming. This enables relatively fast determination of aggregate contingency reserve resource, price-taking energy shifting outcomes, and in some cases the determination of aggregate models at the megawatt (MW) scale that can be directly included in large-scale grid models. After selecting modeling methods and parameters through various computational experiments, we find interquartile ranges of contingency reserve resource in ISO-NE for about 603,400 ERWHs of 45 MW - 69 MW for Claim10 (50 minute responses provided with 10 minutes of advanced notification) and 65 MW - 102 MW for Claim30 (30 minute responses provided with 30 minutes of advanced notification), and for about 619,000 HPWHs of 48 MW - 88 MW for Claim10 and 52 MW - 90 MW for Claim30. The overall reserve resource is up to 32% of total load for ERWHs providing Claim10 service, 47% for ERWHs providing Claim30 service, 93% for HPWHs providing Claim10 service, and 97% for HPWHs providing Claim30 service. More work is required to determine if HPWHs are inherently more suitable than ERWHs for providing contingency reserve or if these results reflect idiosyncrasies of the single family home stock model used in this study. The value of this contingency resource in a Near-term VG model of ISO-NE is $\$ 0.40$ to $\$1.20$ per water heater-year, and significantly larger, $\$ 3.80$ to $\$ 5.30$ per water heater-year in a Mid-term VG model of ISONE. Aggregating surrogate models to the MW-scale for energy shifting service is more challenging than for contingency service and we only present such results for ERWHs, because we were unable to determine satisfactory ways to deal with HPWHs' time-varying and path dependent operational characteristics. Individual surrogate models suitable for evaluating the energy shifting resource from both ERWHs and HPWHs are created, however, and dispatched against day-ahead prices from the Near-Term VG and Mid-Term VG models of ISO-NE. The individual surrogate models are able to access and potentially shift all 640 GWh of HPWH load and 1,547 GWh of ERWH load we modeled in two different single family home stock models. In contrast, the most effective model of aggregate ERWH shifting resource we created only captured 34.7% of the total ERWH load. Energy shifting affected by price-taking dispatch against modeled day-ahead energy prices produces per water heater year profits of $\$19.44$ - $\$22.93$ for individual HPWHs, $\$39.11$ - $\$40.54$ for individual ERWHs, and up to $\$4.00$ - $\$4.24$ for aggregated ERWHs, with the variations mainly due to grid conditions (more or less VG). When the supply-side response to these changes is accounted for, the per water heater year production cost savings for ISO-NE are $\$7.50$ to $\$17.70$ for the most effective set of endogenously dispatched aggregate ERWHs, $\$15.60$ to $\$15.70$ for individual ERWHs dispatched against the DA prices, and $\$10.70$ to $\$11.20$ for individual HPWHs dispatched against DA prices. Those ranges primarily represent the difference between Near-Term VG and Mid-Term VG grid conditions.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2021

A Tailored Convolutional Neural Network for Nonlinear Manifold Learning of Computational Physics Data Using Unstructured Spatial Discretizations

In this work, we propose a nonlinear manifold learning technique based on deep convolutional autoencoders that is appropriate for model order reduction of physical systems in complex geometries. Convolutional neural networks have proven to be highly advantageous for compressing data arising from systems demonstrating a slow-decaying Kolmogorov n-width. However, these networks are restricted to data on structured meshes. Unstructured meshes are often required for performing analyses of real systems with complex geometry. Our custom graph convolution operators based on the available differential operators for a given spatial discretization effectively extend the application space of deep convolutional autoencoders to systems with arbitrarily complex geometry that are typically discretized using unstructured meshes. We propose sets of convolution operators based on the spatial derivative operators for the underlying spatial discretization, making the method particularly well suited to data arising from the solution of partial differential equations. We demonstrate the method using examples from heat transfer and fluid mechanics and show better than an order of magnitude improvement in accuracy over linear methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Special Topic on High Performance Computing in Chemical Physics

Computational modeling and simulation have become indispensable scientific tools in virtually all areas of chemical, biomolecular, and materials systems research. Computation can provide unique and detailed atomic level information that is difficult or impossible to obtain through analytical theories and experimental investigations. In addition, recent advances in micro-electronics have resulted in computer architectures with unprecedented computational capabilities, from the largest supercomputers to common desktop computers. In conclusion, combined with the development of new computational domain science methodologies and novel programming models and techniques, this has resulted in modeling and simulation resources capable of providing results at or better than experimental chemical accuracy and for systems in increasingly realistic chemical environments.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Developing Capabilities in Physical and Computational Sciences

The Physical and Computational Sciences Directorate (PCSD) performs fundamental research in support of the science missions of Offices of Basic Energy Sciences (BES), Advanced Scientific Computing Research (ASCR), High Energy Physics (HEP), Nuclear Physics (NP), and Fusion Energy Sciences (FES), and others within the domains of the chemical, materials, computational sciences, mathematics, and physics. This LDRD project aims to provide funding to develop/demonstrate research capabilities for proposals and publications to support these science missions. Staff will propose small research tasks/projects to be performed under this overall project.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS2000

On The Computational Capabilities of Physical Systems: Relationship With Conventional Computer Science - Part 2

In the first of this pair of papers, it was proven that there cannot be a physical computer to which one can properly pose any and all computational tasks concerning the physical universe. It was then further proven that no physical computer C can correctly carry out all computational tasks that can be posed to C. As a particular example, this result means that no 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". 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 - "physical computation" - is needed to address the issues considered in these papers, which concern real physical computers. While this novel 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. This second paper of the pair presents a preliminary exploration of some of this mathematical structure. Analogues of Chomskian results concerning universal Turing Machines and the Halting theorem are derived, as are results concerning the (im)possibility of certain kinds of error-correcting codes. In addition, an analogue of algorithmic information complexity, "prediction complexity", is elaborated. A task-independent bound is derived on how much the prediction complexity of a computational task can differ for two different reference universal physical computers used to solve that task, a bound similar to the "encoding" bound governing how much the algorithm information complexity of a Turing machine calculation can differ for two reference universal Turing machines. Finally, it is proven 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 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 NTRS1967

Plasma physics

Computer programmed basic data of plasma physics, and far infrared plasma diagnostics

FAR INFRARED↗
NASA NTRS1982

Idealized dynamic grid computation of physical systems

The construction and utility of an idealized computational space for finite-difference computation of physical systems are considered. All computations are performed in tau space, which at any instant represents the dynamic grid of a subject physical system appropriately stretched into a uniform, orthogonal grid. A strain field model of physical system is described, including the sample computation of strain density fields. Dynamic grid generation using invariant-mapping is addressed, and the tau computational space is considered, including a grid dynamism constraint, a grid orthogonality constraint, and a grid smoothness constraint. The detailed tau computational space method is presented and illustrated with two sample problems.

Anyiwo, J. C.↗