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 73 records · Page 4

Advanced Methods for Immersed Domain Multi-physics Computations

This is the final report on the project, and describes the main accomplishments in the development of the Shifted Boundary Method (SBM), a new computational framework for embedded/immersed computational mechanics applications.

97 MATHEMATICS AND COMPUTING↗

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↗

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↗

An Efficient Deterministic Parallel Algorithm for Adaptive Multidimensional Numerical Integration on GPUs

Recent development in Graphics Processing Units (GPUs) has enabled a new possibility for highly efficient parallel computing in science and engineering. Their massively parallel architecture makes GPUs very effective for algorithms where processing of large blocks of data can be executed in parallel. Multidimensional integration has important applications in areas like computational physics, plasma physics, computational fluid dynamics, quantum chemistry, molecular dynamics and signal processing. The computationally intensive nature of multidimensional integration requires a high-performance implementation. In this study, we present an efficient deterministic parallel algorithm for adaptive multidimensional numerical integration on GPUs. Various optimization techniques are applied to maximize the utilization of the GPU. GPU-based implementation outperforms the best known sequential methods and achieves a speed-up of up to 100. It also shows good scalability with the increase in dimensionality.

Arumugam, Kamesh↗

HFBTHO

HFBRHO is a physics computer code that is used to model the structure of the nucleus. It is an implementation of the nuclear energy Density Functional Theory (DFT), where the energy of the nucleus is obtained by integration over space of some phenomenological energy density, which is itself a functional of the neutron and proton densities. In HFBTHO, the energy density derives from the Skyrme effective two-body interaction between nucleons, nuclear superfluidity is treated at the Hartree-Fock-Bogoliubov (HFB) approximation, and axial-symmetry of the nuclear shape is assumed This version is the 2nd release of the program; the previous version has been published in Computer Physics Communications (1). It is the first version that has been partly developed at Lawrence Livermore National Laboratory.

Source record↗

HFBTHO

HFBRHO is a physics computer code that is used to model the structure of the nucleus. It is an implementation of the nuclear energy Density Functional Theory (DFT), where the energy of the nucleus is obtained by integration over space of some phenomenological energy density, which is itself a functional of the neutron and proton densities. In HFBTHO, the energy density derives from the Skyrme effective two-body interaction between nucleons, nuclear superfluidity is treated at the Hartree-Fock-Bogoliubov (HFB) approximation, and axial-symmetry of the nuclear shape is assumed This version is the 2nd release of the program; the previous version has been published in Computer Physics Communications (1). It is the first version that has been partly developed at Lawrence Livermore National Laboratory.

Source record↗

Solution of the Self-consistent Skyrme Hartree-Fock-Bogoliubov Equations in the Cartesian Deformed Harmonic Oscillator Bssis (VII_HFODD (v.2.73y): a new version of the jprogram

HFODD is a physics computer code that is used to model the structure of the nucleus. It is an implimentation of the nuclear energy Density Functional Theory (DFT), where the energy of the nucleus is obtained by intergration over space of some phenomenological energy density, which is itself a functional of the neutron and proton densities. In HFODD, the energy density derives from either the Skyre or the Gogny effective two-body interaction between nucleons. Nuclear super-fluidity is treated a the Hartree-Fock-Boboliubov (HFB) approximation. This version is the 8th release of the code; the 7 previous versions have been published in Computer Physics Communications (see references). Version 2.49p was partly developed at LLNL and was released under a GPL License and IM number LLNL-CODE-470611. The currect version 2.73y is the second version that has been partly developed a LLNL.

Schunck, N.↗

Axial deformed solution of the Skyrme-Hartree-Fock-Bogolyubov equations using the transformed harmonic oscillator Basis

HFBTHO is a physics computer code that is used to model the structure of the nucleus. It is an implementation of the nuclear energy Density Functional Theory (DFT), where the energy of the nucleus is obtained by integration over space of some phenomenological energy density, which is itself a functional of the neutron and proton densities. In HFBTHO, the energy density derives either from the zero-range Dkyrme or the finite-range Gogny effective two-body interaction between nucleons. Nuclear superfluidity is treated at the Hartree-Fock-Bogoliubov (HFB) approximation, and axial-symmetry of the nuclear shape is assumed. This version is the 3rd release of the program; the two previous versions were published in Computer Physics Communications [1,2]. The previous version was released at LLNL under GPL 3 Open Source License and was given release code LLNL-CODE-573953.

Perez, R. Navarro↗

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↗

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.↗

Advancing Understanding and Design of Functional Materials Through Theoretical and Computational Chemical Physics. In: Practical Aspects of Computational Chemistry II

Theoretical and computational chemical physics and materials science offers great opportunity toward helping solve some of the grand challenges in science and engineering, because structure and properties of molecules, solids, and liquids are direct reflections of the underlying quantum motion of their electrons. With the advent of semilocal and especially nonlocal descriptions of exchange and correlation effects, density functional theory (DFT) can now describe bonding in molecules and solids with an accuracy which, for many classes of systems, is sufficient to compare quantitatively to experiments. It is therefore becoming possible to develop a semiquantitative description of a large number of systems and processes. In this chapter, we briefly review DFT and its various extensions to include nonlocal terms that are important for long-range dispersion interactions that dominate many self-assembly processes, molecular surface adsorption processes, solution processes, and biological and polymeric materials. Applications of DFT toward problems relevant to energy systems, including energy storage materials, functional nanoelectronics/optoelectronics, and energy conversion, are highlighted.

Chemical reactions↗