Search NASA⌕ Search

SEARCH · Search NASA

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Equations of State in Computational Physics: What, Why, and How

Summary: 1. Equations of state furnish thermodynamic properties of a material. 2. Usually involve P, p (or V), and T, or P, r, and E 3. Necessary ingredient to solve compressible flow problems. 4. Varieties: i. Analytical expressions (ideal gas, Grüneisen) – fast, convenient for verification and test problems ii. Graphs and charts – good for hand calculations iii. Tables and databases – generally most accurate, require interpolation i. Steam tables ii. NIST database iii. SESAME EOS Library 5. Constructed by using semi-empirical models from Statistical Mechanics and fitting to available data

36 MATERIALS SCIENCE↗
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.↗
DOE OSTI2019

Perspectives on Research in Computational Plasma Physics With Applications to Experiments

Computational plasma physics was born some 50 years ago with the development of high-speed computers. Computer simulation is well suited to the challenging nature of fundamental and applied plasma science, which exhibits enormous ranges of time and space scales, and whose underlying mathematical framework is comprised of nonlinear partial differential equations and nonlinear kinetic equations. Computational plasma physics has advanced from relatively simple calculations with limited dimensionality and scope to sophisticated and comprehensive simulation models. Moreover, computational plasma physics has matured as a significant scientific discipline with a rigorous mathematical foundation and voluminous literature. While computational plasma physics has greatly benefitted from the growth in computing capability by many orders of magnitude, the contributions from innovation in methods and algorithms have been no less important. This talk presents a personal perspective on the development and application of computational plasma physics to plasmas in nature and in the laboratory. The examples described will be based on experience over the course of a career in computational plasma physics and illustrate both the fundamental plasma phenomena and the behavior of laboratory plasmas. Some of the specific examples include simulations of microinstabilities in the magnetic mirror, tokamak and spheromak plasmas, laser-plasma interactions, and the Knudsen-layer phenomena, as it affects fusion performance. The examples also illustrate the development of appropriate models and algorithms that are well suited to simulating the phenomena of interest efficiently. Finally, a particular interest of the author has been the development of multiple time-scale algorithms.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2018

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↗
DOE OSTI2018

Applied Quantum Physics for Novel Quantum Computation Approaches: an Update

Quantum information processing is a critical part of the development of future computers, quantum computers, and quantum algorithms, where elementary particles such as photons and electrons can be applied in optomagnetic or optoelectronic devices. The computational physics behind these emerging approaches is also experiencing dramatic developments. In this paper I report on the most recent mathematical basics for quantum algorithms and quantum computing approaches. Some of these described approaches show intriguing methods for determining the states and wavefunction properties for anyons, bosons, and fermions in quantum wells that have been developed in the last years. The study also shows approaches based on N-quantum states and the reduced 1- and 2-fermion picture, which can be used for developing models for anyons and multi-fermionic states in quantum algorithms. Also, antisymmetry and generalized Pauli constraints have been given particular emphasis and include establishing a basis for pinning and quasipinning for exploring the symmetric states of many-fermionic subsets, as a foundation for quantum information processing, and are here briefly revisited. This study summarizes the developments in recent years of an advanced and important field for future computational techniques.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
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↗