Search NASA⌕ Search

SEARCH · Search NASA

Results for “complex computing”

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 1,495 records · Page 83

Off-Gas Adsorption Model Capabilities and Recommendations

Off-gas treatment is required to reduce emissions from aqueous fuel reprocessing. Evaluating the products of innovative gas adsorption research requires increased computational simulation capability to more effectively transition from fundamental research to operational design. Early modeling efforts produced the Off-Gas SeParation and REcoverY (OSPREY) model that, while efficient in terms of computation time, was of limited value for complex systems. However, the computational and programming lessons learned in development of the initial model were used to develop Discontinuous Galerkin OSPREY (DGOSPREY), a more effective model. Initial comparisons between OSPREY and DGOSPREY show that, while OSPREY does reasonably well to capture the initial breakthrough time, it displays far too much numerical dispersion to accurately capture the real shape of the breakthrough curves. DGOSPREY is a much better tool as it utilizes a more stable set of numerical methods. In addition, DGOSPREY has shown the capability to capture complex, multispecies adsorption behavior, while OSPREY currently only works for a single adsorbing species. This capability makes DGOSPREY ultimately a more practical tool for real world simulations involving many different gas species. While DGOSPREY has initially performed very well, there is still need for improvement. The current state of DGOSPREY does not include any micro-scale adsorption kinetics and therefore assumes instantaneous adsorption. This is a major source of error in predicting water vapor breakthrough because the kinetics of that adsorption mechanism is particularly slow. However, this deficiency can be remedied by building kinetic kernels into DGOSPREY. Another source of error in DGOSPREY stems from data gaps in single species, such as Kr and Xe, isotherms. Since isotherm data for each gas is currently available at a single temperature, the model is unable to predict adsorption at temperatures outside of the set of data currently available. Thus, in order to improve the predictive capabilities of the model, there is a need for more single-species adsorption isotherms at different temperatures, in addition to extending the model to include adsorption kinetics. This report provides background information about the modeling process and a path forward for further model improvement in terms of accuracy and user interface.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Spectral transformation in the SOFI complex for processing photographic images on the ES computer, part 1

A description is given of three programs catalogued in the form of object modules in the library of a system for processing photographic images computer. PFT is the subprogram of the multi-dimensional BPF of real-valued information, in the operative computer memory. INRECO is a subprogram-interface between the real and complex formats for representing two-dimensional spectra and images. FFT2 is a subprogram for calculating the correlation functions of the image using the previous subprograms.

Debabov, A. S.↗

Downfolding Complex Materials Problems Onto Model Hamiltonians for Quantum Computers

Simulating the properties of quantum materials is expected to be one of the exciting applications for quantum computers and where we hope to see advantages over classical hardware. The complexity of ab initio Hamiltonians describing the physics of application-relevant materials places them beyond the realm of possibility for solution on near-term hardware with a limited number of qubits. Various Hamiltonian approximations, including Hamiltonian downfolding, offers a possibility towards simulating complex materials on near-term hardware. This is accomplished by approximating the relevant physics of a given material through their representation by simpler model Hamiltonians, such as the Hubbard Hamiltonian or extensions of it. Here we employ a well-defined first-principles methodology for deriving downfolded multi-band extended Hubbard Hamiltonians of materials, capturing strong electronic correlation and electron-phonon coupling, based on the formalism of Wannier functions and the calculation of the screened Coulomb interaction. We demonstrate for a variety of systems that quantum simulation of these downfolded Hamiltonians reproduces key properties, thus establishing downfolding as a promising route to achieve near-term simulation of application-relevant systems on quantum hardware.

Antonios Markos Alvertis↗

Downfolding complex materials problems onto model Hamiltonians for quantum computers

Simulating the properties of quantum materials is expected to be one of the exciting applications for quantum computers and where we hope to see advantages over classical hardware. The complexity of ab initio Hamiltonians describing the physics of application-relevant materials places them beyond the realm of possibility for solution on near-term hardware with a limited number of qubits. Various Hamiltonian approximations, including Hamiltonian downfolding, offers a possibility towards simulating complex materials on near-term hardware. This is accomplished by approximating the relevant physics of a given material through their representation by simpler model Hamiltonians, such as the Hubbard Hamiltonian or extensions of it. Here we employ a well-defined first-principles methodology for deriving downfolded multi-band extended Hubbard Hamiltonians of materials, capturing strong electronic correlation and electron-phonon coupling, based on the formalism of Wannier functions and the calculation of the screened Coulomb interaction. We demonstrate for a variety of systems that quantum simulation of these downfolded Hamiltonians reproduces key properties, thus establishing downfolding as a promising route to achieve near-term simulation of application-relevant systems on quantum hardware.

Antonios M. Alvertis↗

Two-loop mixed QCD-electroweak amplitudes for Z+jet production at the LHC: bosonic corrections

Abstract We present a calculation of the bosonic contribution to the two-loop mixed QCD-electroweak scattering amplitudes forZ-boson production in association with one hard jet at hadron colliders. We employ a method to calculate amplitudes in the ’t Hooft-Veltman scheme that reduces the amount of spurious non-physical information needed at intermediate stages of the computation, to keep the complexity of the calculation under control. We compute all the relevant Feynman integrals numerically using the Auxiliary Mass Flow method. We evaluate the two-loop scattering amplitudes on a two-dimensional grid in the rapidity and transverse momentum of theZboson, which has been designed to yield a reliable numerical sampling of the boosted-Zregion. This result provides an important building block for improving the theoretical modelling of a key background for monojet searches at the LHC.

Physics↗

Non-Hermitian Quantum Mechanics Approach for Extracting and Emulating Continuum Physics Based on Bound-State-like Calculations

Here, this Letter introduces a unified emulation framework for studying continuum physics in finite quantum systems. Using a reduced basis method, we construct powerful emulators for the inhomogeneous Schrödinger equation that operate in a combined parameter space of complex energy (𝐸) and other inputs (𝜽). Within the space, the emulators simultaneously perform analytical continuation in 𝐸—extracting continuum physics from numerically simpler bound-state-like calculations—and interpolate this entire process across 𝜽. This yields a small, non-Hermitian system whose properties (e.g., resonances and scattering observables) can be rapidly predicted for any 𝜽. Crucially, the complex-𝐸 emulation provides a pathway to compute continuum observables for complex systems where advanced bound-state methods exist but direct continuum calculations are yet to be developed, while the 𝜽 emulation enables rapid parameter-space exploration and can be adapted to accelerate other existing continuum calculations. Demonstrations with two- and three-body systems highlight the method’s effectiveness and suggest its connection to (near-)optimal rational approximation. This Letter presents the key results, with further details reserved for a companion paper.

ab initio calculations↗

Building the I (Interoperability) of FAIR for performance reproducibility of large-scale composable workflows in RECUP

Abstract-Scientific computing communities increasingly run their experiments using complex data- and compute-intensive workflows that utilize distributed and heterogeneous architectures targeting numerical simulations and machine learning, often executed on the Department of Energy Leadership Computing Facilities (LCFs). We argue that a principled, systematic approach to implementing FAIR principles at scale, including fine-grained metadata extraction and organization, can help with the numerous challenges to performance reproducibility posed by such workflows. We extract workflow patterns, propose a set of tools to manage the entire life cycle of performance metadata, and aggregate them in an HPC-ready framework for reproducibility (RECUP). We describe the challenges in making these tools interoperable, preliminary work, and lessons learned from this experiment.

97 MATHEMATICS AND COMPUTING↗

Testing of reliability - Analysis tools

An outline is presented of issues raised in verifying the accuracy of reliability analysis tools. State-of-the-art reliability analysis tools implement various decomposition, aggregation, and estimation techniques to compute the reliability of a diversity of complex fault-tolerant computer systems. However, no formal methodology has been formulated for validating the reliability estimates produced by these tools. The author presents three states of testing that can be performed on most reliability analysis tools to effectively increase confidence in a tool. These testing stages were applied to the SURE (semi-Markov Unreliability Range Evaluator) reliability analysis tool, and the results of the testing are discussed.

Hayhurst, Kelly J.↗

Optical Correlator With Complex Holographic Filter

Experimental real-time optical correlator includes complex-valued holographic filter computed from one of two input scenes. Made more tolerant of errors in patterns to be recognized. Filter function essentially coded hologram computed by Burchhardt's method, in which complex value of each pixel of fast Fourier transform of image represented by three real, nonnegative numbers. In generating optical correlator according to method, phasor of each pixel in Fourier transform represented by intensities in three adjacent pixels.

Chao, Tien-Hsin↗

Hotspot Coevolution Is a Key Identifier of Near-Native Protein Complexes

Protein–protein interactions play a key role in mediating numerous biological functions, with more than half the proteins in living organisms existing as either homo- or hetero-oligomeric assemblies. Protein subunits that form oligomers minimize the free energy of the complex, but exhaustive computational search-based docking methods have not comprehensively addressed the challenge of distinguishing a natively bound complex from non-native forms. Current protein docking approaches address this problem by sampling multiple binding modes in proteins and scoring each mode, with the lowest-energy (or highest scoring) binding mode being regarded as a near-native complex. However, high-scoring modes often match poorly with the true bound form, suggesting a need for improvement of the scoring function. Here in this study, we propose a scoring function, KFC-E, that accounts for both conservation and coevolution of putative binding hotspot residues at protein–protein interfaces. We tested KFC-E on four benchmark sets of unbound examples and two benchmark sets of bound examples, with the results demonstrating a clear improvement over scores that examine conservation and coevolution across the entire interface.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Dissociative Recombination of Cold HeH + Ions

The HeH + cation is the simplest molecular prototype of the indirect dissociative recombination (DR) process that proceeds through electron capture into Rydberg states of the corresponding neutral molecule. This Letter develops the first application of our recently developed energy-dependent frame transformation theory to the indirect DR processes. The theoretical model is based on the multichannel quantum-defect theory with the vibrational basis states computed using exterior complex scaling of the nuclear Hamiltonian. The ab initio electronic R-matrix theory is adopted to compute quantum defects as functions of the collision energy and of the internuclear distance. The resulting DR rates are convolved over the beam energy distributions relevant to a recent experiment at the Cryogenic Storage Ring, giving good agreement between the experiment and the theory.

74 ATOMIC AND MOLECULAR PHYSICS↗

Efficient Memory Access with NumPy Global Arrays using Local Memory Access

This paper discusses the work completed working with Global Arrays of data on distributed multi-computer systems and improving their performance. The tasks completed were done at Pacific Northwest National Laboratory in the Science Undergrad Laboratory Internship program in the summer of 2013 for the Data Intensive Computing Group in the Fundamental and Computational Sciences DIrectorate. This work was done on the Global Arrays Toolkit developed by this group. This toolkit is an interface for programmers to more easily create arrays of data on networks of computers. This is useful because scientific computation is often done on large amounts of data sometimes so large that individual computers cannot hold all of it. This data is held in array form and can best be processed on supercomputers which often consist of a network of individual computers doing their computation in parallel. One major challenge for this sort of programming is that operations on arrays on multiple computers is very complex and an interface is needed so that these arrays seem like they are on a single computer. This is what global arrays does. The work done here is to use more efficient operations on that data that requires less copying of data to be completed. This saves a lot of time because copying data on many different computers is time intensive. The way this challenge was solved is when data to be operated on with binary operations are on the same computer, they are not copied when they are accessed. When they are on separate computers, only one set is copied when accessed. This saves time because of less copying done although more data access operations were done.

Daily, Jeffrey A.↗

Efficient eigensolution reanalysis of nonclassically damped structures

Effective methods of approximate eigensolution reanalysis of modified nonclassically damped structures are developed. For structures with passive or active discrete damping devices or with damping treatment, the system becomes nonproportionally damped and the computation of its dynamic responses may require the use of complex modes. For larger systems, the computation of complex modes is very expensive. Thus it is desirable to have approximate reanalysis techniques for the efficient evaluation of the effect of design changes. In recent years, the assumed mode reanalysis method was successfully applied to minimum weight design of undamped structures with natural frequency constraints. The accuracy of the assumed mode reanalysis method can be improved dramatically if the global approximation function includes the normal modes of the original system and their derivatives. This approach was demonstrated to be effective even for a system with shape changes. The approach used by Noor et al. for eigensolution reanalysis of undamped structures is extended to treat a nonclassically damped system.

Wang, Bo Ping↗

An efficient hybrid technique in RCS predictions of complex targets at high frequencies

Most computer codes in Radar Cross Section (RCS) prediction use Physical Optics (PO) and Physical theory of Diffraction (PTD) combined with Geometrical Optics (GO) and Geometrical Theory of Diffraction (GTD). The latter approaches are computationally cheaper and much more accurate for curved surfaces, but not applicable for the computation of the RCS of all surfaces of a complex object due to the presence of caustic problems in the analysis of concave surfaces or flat surfaces in the far field. The main contribution of this paper is the development of a hybrid method based on a new combination of two asymptotic techniques: GTD and PO, considering the advantages and avoiding the disadvantages of each of them. A very efficient and accurate method to analyze the RCS of complex structures at high frequencies is obtained with the new combination. The proposed new method has been validated comparing RCS results obtained for some simple cases using the proposed approach and RCS using the rigorous technique of Method of Moments (MoM). Some complex cases have been examined at high frequencies contrasting the results with PO. This study shows the accuracy and the efficiency of the hybrid method and its suitability for the computation of the RCS at really large and complex targets at high frequencies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analytic Modeling of a Deep Shielding Problem

Previous generations of scientists would make tremendous efforts to simplify non-tractable problems and generate simpler models that preserved the fundamental physics. This process involved applying assumptions and simplifications to reduce the complexity of the problem until it reached a solvable form. Each assumption and simplification was chosen and applied with the intent to preserve the essential physics of the problem, since, if the core physics of the problem were eliminated, the simplified model served no purpose. Moreover, if done correctly, solutions to the reduced model would serve as useful approximations to the original problem. In a sense, solving the simple models laid the ground-work for and provided insight into the more complex problem. Today, however, the affordability of high performance computing has essentially replaced the process for analyzing complex problems. Rather than "building up" a problem by understanding smaller, simpler models, a user generally relies on powerful computational tools to directly arrive at solutions to complex problems. As computational resources grow, users continue trying to simulate new, more complex, or more detailed problems, resulting in continual stress on both the code and computational resources. When these resources are limited, the user will have to make concessions by simplifying the problem while trying to preserve important details. In the context of the Monte Carlo N-Particle radiation transport simulation tool, simplifications typically come as reductions in geometry, or by using variance reduction techniques. Both approaches can influence the physics of the problem, leading to potentially inaccurate or non-physical results. Errors can also be introduced as a result of faulty input into a computational tool: something as simple as transposing numbers in a tally input can result in incorrect answers. In this paradigm, reduced complexity computational and analytical models still have an important purpose. The explicit form of an analytic solution is arguably the best way to understand the qualitative properties of simple models. In contrast to "building up" a complex problem through understanding simpler problems, results from detailed computational scenarios can be better explained by "building down" the complex model through simple models rooted in the fundamental or essential phenomenology. Simplified analytic and computational models can be used to 1) increase a user's confidence in the computational solution of a complex model, 2) confirm there are no user input errors, and 3) ensure essential assumptions of the simulation tool are preserved. This process of using analytic models to develop a more valuable analysis of simulation results is named the results assessment methodology. The utility of the results assessment methodology and a complimentary sensitivity analysis is exemplified through the analysis of the neutron flux in a dry used fuel storage cask. This application was chosen due to current scientific interest in used nuclear fuel storage.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Analytic Modeling of a Deep Shielding Problem

Previous generations of scientists would make tremendous efforts to simplify non-tractable problems and generate simpler models that preserved the fundamental physics. This process involved applying assumptions and simplifications to reduce the complexity of the problem until it reached a solvable form. Each assumption and simplification was chosen and applied with the intent to preserve the essential physics of the problem, since, if the core physics of the problem were eliminated, the simplified model served no purpose. Moreover, if done correctly, solutions to the reduced model would serve as useful approximations to the original problem. In a sense, solving the simple models laid the ground-work for and provided insight into the more complex problem. Today, however, the affordability of high performance computing has essentially replaced the process for analyzing complex problems. Rather than "building up" a problem by understanding smaller, simpler models, a user generally relies on powerful computational tools to directly arrive at solutions to complex problems. As computational resources grow, users continue trying to simulate new, more complex, or more detailed problems, resulting in continual stress on both the code and computational resources. When these resources are limited, the user will have to make concessions by simplifying the problem while trying to preserve important details. In the context of MCNP, simplifications typically come as reductions in geometry, or by using variance reduction techniques. Both approaches can influence the physics of the problem, leading to potentially inaccurate or non-physical results. Errors can also be introduced as a result of faulty input into a computational tool: something as simple as transposing numbers in a tally input can result in incorrect answers. In this paradigm, reduced complexity computational and analytical models still have an important purpose. The explicit form of an analytic solution is arguably the best way to understand the qualitative properties of simple models. In contrast to "building up" a complex problem through understanding simpler problems, results from detailed computational scenarios can be better explained by "building down" the complex model through simple models rooted in the fundamental or essential phenomenology. Simplified analytic and computational models can be used to 1) increase a user's confidence in the computational solution of a complex model, 2) confirm there are no user input errors, and 3) ensure essential assumptions of the simulation tool are preserved. This process of using analytic models to develop a more valuable analysis of simulation results is named the results analysis methodology. The utility of the results assessment methodology and a complimentary sensitivity analysis is exemplified through the analysis of the neutron flux in a dry used fuel storage cask. This application was chosen due to current scientific interest in used nuclear fuel storage.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analytic Modeling of a Deep Shielding Problem

Previous generations of scientists would make tremendous efforts to simplify non-tractable problems and generate simpler models that preserved the fundamental physics. This process involved applying assumptions and simplifications to reduce the complexity of the problem until it reached a solvable form. Each assumption and simplification was chosen and applied with the intent to preserve the essential physics of the problem, since, if the core physics of the problem were eliminated, the simplified model served no purpose. Moreover, if done correctly, solutions to the reduced model would serve as useful approximations to the original problem. In a sense, solving the simple models laid the ground-work for and provided insight into the more complex problem. Today, however, the affordability of high performance computing has essentially replaced the process for analyzing complex problems. Rather than "building up" a problem by understanding smaller, simpler models, a user generally relies on powerful computational tools to directly arrive at solutions to complex problems. As computational resources grow, users continue trying to simulate new, more complex, or more detailed problems, resulting in continual stress on both the code and computational resources. When these resources are limited, the user will have to make concessions by simplifying the problem while trying to preserve important details. In the context of the Monte Carlo N-Particle radiation transport simulation tool, simplifications typically come as reductions in geometry, or by using variance reduction techniques. Both approaches can influence the physics of the problem, leading to potentially inaccurate or non-physical results. Errors can also be introduced as a result of faulty input into a computational tool: something as simple as transposing numbers in a tally input can result in incorrect answers. In this paradigm, reduced complexity computational and analytical models still have an important purpose. The explicit form of an analytic solution is arguably the best way to understand the qualitative properties of simple models. In contrast to "building up" a complex problem through understanding simpler problems, results from detailed computational scenarios can be better explained by "building down" the complex model through simple models rooted in the fundamental or essential phenomenology. Simplified analytic and computational models can be used to 1) increase a user's confidence in the computational solution of a complex model, 2) con firm there are no user input errors, and 3) ensure essential assumptions of the simulation tool are preserved. This process of using analytic models to develop a more valuable analysis of simulation results is named the results assessment methodology. The utility of the results assessment methodology and a complimentary sensitivity analysis is exempli fied through the analysis of the neutron flux in a dry used fuel storage cask. This application was chosen due to current scientific interest in used nuclear fuel storage.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Experimental Structures of Antibody/MHC-I Complexes Reveal Details of Epitopes Overlooked by Computational Prediction

Abstract mAbs to MHC class I (MHC-I) molecules have proved to be crucial reagents for tissue typing and fundamental studies of immune recognition. To augment our understanding of epitopic sites seen by a set of anti–MHC-I mAb, we determined X-ray crystal structures of four complexes of anti–MHC-I Fabs bound to peptide/MHC-I/β2-microglobulin (pMHC-I). An anti–H2-Dd mAb, two anti–MHC-I α3 domain mAbs, and an anti–β2-microglobulin mAb bind pMHC-I at sites consistent with earlier mutational and functional experiments, and the structures explain allelomorph specificity. Comparison of the experimentally determined structures with computationally derived models using AlphaFold Multimer showed that although predictions of the individual pMHC-I heterodimers were quite acceptable, the computational models failed to properly identify the docking sites of the mAb on pMHC-I. The experimental and predicted structures provide insight into strengths and weaknesses of purely computational approaches and suggest areas that merit additional attention.

Immunology↗