Search NASA⌕ Search

SEARCH · Search NASA

Results for “Physics of computation”

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
All sourcesNASA NTRSDOE OSTI
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.↗
DOE OSTI2023

Integrating Learning and Physics based Computation for Fast Online Transient Analysis

In this work, a novel method that integrates learning and physics based computation is developed for greatly accelerating the simulation of full power system transient trajectories. To solve the dynamic algebraic equations, the method replaces the time-consuming dynamic computation for generator dynamics with trained predictors, while retaining the time-efficient algebraic computation of solving AC-power flow (PF) for power systems. In particular, a predictor is trained for each generator, and the system trajectories are computed by alternating steps of calling the predictors and solving AC-PF. The proposed method also allows fully parallelizable training strategies and a flexible trade-off between training time and testing accuracy. Comprehensive evaluations of the proposed method for transient/dynamic contingency analysis of the New York/New England 16-machine 68-bus power systems demonstrate excellent performance and significant acceleration of computation.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Raytracing

The raytracing (spectrally specific radiative transfer that does not couple back to the hydrodynamic evolution) code was developed because it helps improve our understanding of the physics of explosive events, validates computational physics codes, and estimates optical signals that are cheaper and safer than experiments involving high explosives. The raytracing code can also produce simulations that are useful to analyze what we can understand with sensors, such as determining what we can discriminate with sensors, like the presence of certain metals or the amount of soot. In addition, simulations can provide extra validations to computational physics to help us better understand discrepancies.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗
DOE OSTI2024

Feasibility of Formulating Ecosystem Biogeochemical Models From Established Physical Rules

Abstract To improve the predictive capability of ecosystem biogeochemical models (EBMs), we discuss the feasibility of formulating biogeochemical processes using physical rules that have underpinned the many successes in computational physics and chemistry. We argue that the currently popular empirically based approaches, such as multiplicative empirical response functions and the law of the minimum, will not lead to EBM formulations that can be continuously refined to incorporate improved mechanistic understanding and empirical observations of biogeochemical processes. Instead, we propose that EBM parameterizations, as a lossy data compression problem, can be better formulated using established physical rules widely used in computational physics and chemistry, and different biogeochemical processes can be more robustly integrated within a reactive‐transport framework. Through several examples, we demonstrate how mathematical representations derived from physical rules can improve understanding of relevant biogeochemical processes and enable more effective communication between modelers, observationalists, and experimentalists regarding essential questions, such as what measurements are needed to meaningfully inform models and how can models generate new process‐level hypotheses to test in empirical studies. Finally, while empirical models with more parameters are often less robust, physical rules‐based models can be more robust and show lower predictive equifinality, stemming from their enhanced consistency in representations of processes, interactions and spatial scaling.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Hybrid Particle Method for Computational Shock Physics

A long-standing area of research for Eulerian shock wave physics codes has been the treatment of strength and damage for materials. Here we present a method that will aid in the analysis of strength and failure in shock physics applications where excessive diffusion of critical variables can occur and control the solution outcome. Eulerian methods excel for large deformation simulations in general but are inaccurate in capturing structural behavior. Lagrangian methods provide better structural response, but finite element meshes can become tangled. Therefore, a technique for merging Lagrangian and Eulerian treatments of material response, within a single numerical framework, was implemented in the Multiple Component computational shock physics hydrocode. The capability is a Lagrangian/Eulerian Particle Method (LEPM) that uses particles to interface a Lagrangian treatment of material strength with a more traditional Eulerian treatment of the Equation of State (EOS). Lagrangian numerical methods avoid the advection diffusion found in Eulerian methods, which typically strongly affects strength constitutive law internal variables, such as equivalent plastic strain, porosity and/or damage. The Lagrangian capability enhances existing capabilities and permits accurate predictions of high rate, large deformation and/or shock of mechanical structures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Quantum computing for nuclear physics

Future quantum computers are anticipated to be able to perform simulations of quantum many-body systems and quantum field theories that lie beyond the capabilities of classical computation. This will lead to new insights and predictions for systems ranging from dense non-equilibrium matter, to low-energy nuclear structure and reactions, to high-energy collisions. I present an overview of digital quantum simulations in nuclear physics, with select examples relevant for studies of quark matter.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1990

Hypersonic flow - Physical issues and computational simulation

Computational results are presented on hypersonic flows, with emphasis on thermal and chemical nonequilibrium effects and the role played by grids. The continuum equations and their boundary conditions are presented, and the direct simulation Monte Carlo method is described. The importance of using the correct computational and physical models in describing hypersonic nonequilibrium flows is demonstrated.

Hassan, H. A.↗
NASA NTRS1992

Multidisciplinary computational aerosciences

As the challenges of single disciplinary computational physics are met, such as computational fluid dynamics, computational structural mechanics, computational propulsion, computational aeroacoustics, computational electromagnetics, etc., scientists have begun investigating the combination of these single disciplines into what is being called multidisciplinary computational aerosciences (MCAS). The combination of several disciplines not only offers simulation realism but also formidable computational challenges. The solution of such problems will require computers orders of magnitude larger than those currently available. Such computer power can only be supplied by massively parallel machines because of the current speed-of-light limitation of conventional serial systems. Even with such machines, MCAS problems will require hundreds of hours for their solution. To efficiently utilize such a machine, research is required in three areas that include parallel architectures, systems software, and applications software. The main emphasis of this paper is the applications software element. Examples that demonstrate application software for multidisciplinary problems currently being solved at NASA Ames Research Center are presented. Pacing items for MCAS are discussed such as solution methodology, physical modeling, computer power, and multidisciplinary validation experiments.

Kutler, Paul↗