Search NASA⌕ Search

SEARCH · Search NASA

Results for “applied 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 199 records · Page 11

Toward exascale computing through neuromorphic approaches.

While individual neurons function at relatively low firing rates, naturally-occurring nervous systems not only surpass manmade systems in computing power, but accomplish this feat using relatively little energy. It is asserted that the next major breakthrough in computing power will be achieved through application of neuromorphic approaches that mimic the mechanisms by which neural systems integrate and store massive quantities of data for real-time decision making. The proposed LDRD provides a conceptual foundation for SNL to make unique advances toward exascale computing. First, a team consisting of experts from the HPC, MESA, cognitive and biological sciences and nanotechnology domains will be coordinated to conduct an exercise with the outcome being a concept for applying neuromorphic computing to achieve exascale computing. It is anticipated that this concept will involve innovative extension and integration of SNL capabilities in MicroFab, material sciences, high-performance computing, and modeling and simulation of neural processes/systems.

99 GENERAL AND MISCELLANEOUS↗

A unified algorithm for predicting partition coefficients for PBPK modeling of drugs and environmental chemicals

The algorithms in the literature focusing to predict tissue:blood PC (P{sub tb}) for environmental chemicals and tissue:plasma PC based on total (K{sub p}) or unbound concentration (K{sub pu}) for drugs differ in their consideration of binding to hemoglobin, plasma proteins and charged phospholipids. The objective of the present study was to develop a unified algorithm such that P{sub tb}, K{sub p} and K{sub pu} for both drugs and environmental chemicals could be predicted. The development of the unified algorithm was accomplished by integrating all mechanistic algorithms previously published to compute the PCs. Furthermore, the algorithm was structured in such a way as to facilitate predictions of the distribution of organic compounds at the macro (i.e. whole tissue) and micro (i.e. cells and fluids) levels. The resulting unified algorithm was applied to compute the rat P{sub tb}, K{sub p} or K{sub pu} of muscle (n = 174), liver (n = 139) and adipose tissue (n = 141) for acidic, neutral, zwitterionic and basic drugs as well as ketones, acetate esters, alcohols, aliphatic hydrocarbons, aromatic hydrocarbons and ethers. The unified algorithm reproduced adequately the values predicted previously by the published algorithms for a total of 142 drugs and chemicals. The sensitivity analysis demonstrated the relative importance of the various compound properties reflective of specific mechanistic determinants relevant to prediction of PC values of drugs and environmental chemicals. Overall, the present unified algorithm uniquely facilitates the computation of macro and micro level PCs for developing organ and cellular-level PBPK models for both chemicals and drugs.

60 APPLIED LIFE SCIENCES↗

Quantum computing approach for building surface sunlit in urban-scale energy modeling

Solar shadow calculations are needed in building energy modeling and performance simulation of PV systems installed on roofs or facades of buildings. We present a quantum computing approach for calculation of building surface sunlit fractions by recasting solar visibility as a binary optimization problem solved by quantum annealing. Each triangulated surface centroid is encoded as a binary qubit indicating sunlit or shaded status. Geometric visibility constraints are derived from the Möller-Trumbore intersection algorithm and converted into a constrained quadratic binary model compatible with contemporary quantum annealers. The coefficients were embedded to D-Wave quantum computer. To demonstrate feasibility, we conducted a case study in San Francisco for a target building with 52 triangles and roughly 2700 nearby triangles within 50 m evaluated at representative winter and summer solar positions. The results demonstrated that quantum annealing can reliably calculate and distinguish sunlit from shaded surfaces. Quantum samples achieved average accuracy exceeding 92.4 %, with the aggregate surface-level agreement approaching 99.9 %. The outputs of quantum computers agreed closely with classical algorithms, indicating practical feasibility and promising scalability. Finally, the hourly sunlit fractions of building surfaces can be obtained for urban energy modelling. This is the first study to apply quantum computing to the solar shadow and building surface sunlit calculation. It introduces a new paradigm that differs fundamentally from traditional approaches.

Deng, Zhipeng↗

Multilevel Combinatorial Optimization across Quantum Architectures

Emerging quantum processors provide an opportunity to explore new approaches for solving traditional problems in the post Moore’s law supercomputing era. However, the limited number of qubits makes it infeasible to tackle massive real-world datasets directly in the near future, leading to new challenges in utilizing these quantum processors for practical purposes. Furthermore, hybrid quantum-classical algorithms that leverage both quantum and classical types of devices are considered as one of the main strategies to apply quantum computing to large-scale problems. In this article, we advocate the use of multilevel frameworks for combinatorial optimization as a promising general paradigm for designing hybrid quantum-classical algorithms. To demonstrate this approach, we apply this method to two well-known combinatorial optimization problems, namely, the Graph Partitioning Problem, and the Community Detection Problem. We develop hybrid multilevel solvers with quantum local search on D-Wave’s quantum annealer and IBM’s gate-model based quantum processor. We carry out experiments on graphs that are orders of magnitude larger than the current quantum hardware size, and we observe results comparable to state-of-the-art solvers in terms of quality of the solution.

97 MATHEMATICS AND COMPUTING↗

Experimental equation of state of 11 lanthanide nitrides (NdN to LuN) and pressure induced phase transitions in NdN, SmN, EuN, and GdN

Through an extensive data analysis of powder X-ray diffraction data obtained at pressures up to at least 78 GPa, we report the experimental equations of state for all lanthanide nitrides between NdN and LuN, excluding the radioactive Pm. By fitting the obtained unit cell volumes as a function of pressure with the third order Birch–Murnaghan equation of state, we find that the bulk modulus increases with an increasing lanthanide number from K 0 = 146(12) GPa for NdN to 182(7) GPa in EuN. Hereafter, the bulk modulus reaches a plateau for the rest of the series except for TmN which has a lower bulk modulus. We find that the first derivative of the bulk modulus is around 4 for all compounds except TbN, which displays a significantly different compression behavior. In addition, we find a B1 to B10 pressure-induced phase transition in NdN, SmN, EuN, and GdN at increasingly higher pressures. In fact, we observe that the onset pressure of the phase transition increases linearly with Ln atomic number. From TbN and onwards, we do not observe any sign of a B1 to B10 transition indicating that the transition pressure exceeds the studied pressure range. Therefore, we believe that, for the heavier lanthanides, the linear relationship between the onset pressure and the lanthanide number does not hold and even higher pressures are needed to observe the transition. This coherent study of the series of lanthanide nitrides offers a unique opportunity for benchmark studies of computational methods applied to compounds with 4f electrons.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Multiphysics Computational-Fluid-Dynamics (CFD) for Design and Scale-Up of Gas Bioreactors that Utilize CO2

Gas fermentation technology offers sustainable and high carbon-efficiency routes to fuels and chemicals. However, efficiently delivering low-solubility substrate gases to production-scale bioreactors is a significant technical challenge that could limit productivity. We perform fundamental and applied multiphysics computational fluid dynamics (CFD) research targeting specific challenges of gas delivery in fermentation systems that utilize varied gas-compositions, for e.g. CO2/CO/CH4/H2 substrates: bubble dynamics, coupled mass-transfer and reaction, that can lead to optimal reactor designs at scale. This work will support BETO goals towards greenhouse gas reduction, derisking technologies toward commercialization/deployment and sustainable-aviation-fuel synthesis targets.

BIOMASS FUELS↗

Advances in rapid compression machine studies of low- and intermediate-temperature autoignition phenomena

Rapid compression machines (RCMs) are widely-used to acquire experimental insights into fuel autoignition and pollutant formation chemistry, especially at conditions relevant to current and future combustion technologies. RCM studies emphasize important experimental regimes, characterized by low- to intermediate-temperatures (600–1200 K) and moderate to high pressures (5–80 bar). At these conditions, which are directly relevant to modern combustion schemes including low temperature combustion (LTC) for internal combustion engines and dry low emissions (DLE) for gas turbine engines, combustion chemistry exhibits complex and experimentally challenging behaviors such as the chemistry attributed to cool flame behavior and the negative temperature coefficient regime. Challenges for studying this regime include that experimental observations can be more sensitive to coupled physical-chemical processes leading to phenomena such as mixed deflagrative/autoignitive combustion. Experimental strategies which leverage the strengths of RCMs have been developed in recent years to make RCMs particularly well suited for elucidating LTC and DLE chemistry, as well as convolved physical-chemical processes. Specifically, this work presents a review of experimental and computational efforts applying RCMs to study autoignition phenomena, and the insights gained through these efforts. A brief history of RCM development is presented towards the steady improvement in design, characterization, instrumentation and data analysis. Novel experimental approaches and measurement techniques, coordinated with computational methods are described which have expanded the utility of RCMs beyond empirical studies of explosion limits to increasingly detailed understanding of autoignition chemistry and the role of physical-chemical interactions. Fundamental insight into the autoignition chemistry of specific fuels is described, demonstrating the extent of knowledge of low-temperature chemistry derived from RCM studies, from simple hydrocarbons to multi-component blends and full-boiling range fuels. In conclusion, emerging needs and further opportunities are suggested, including investigations of under-explored fuels and the implementation of increasingly higher fidelity diagnostics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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↗

A Dependency-Driven Formulation of Parareal: Parallel-in-Time Solution of PDEs as a Many-Task Application

Parareal is a novel algorithm that allows the solution of time-dependent systems of differential or partial differential equations (PDE) to be parallelized in the temporal domain. Parareal-based implementations of PDE problems can take advantage of this parallelism to significantly reduce the time to solution for a simulation (though at an increased total cost) while making effective use of the much larger processor counts available on current high-end systems. In this paper, we present a dynamic, dependency-driven version of the parareal algorithm which breaks the final sequential bottleneck remaining in the original formulation, making it amenable to a "many-task" treatment. We further improve the cost and execution time of the algorithm by introducing a moving window for time slices, which avoids the execution of tasks which contribute little to the final global solution. We describe how this approach has been realized in the Integrated Plasma Simulator (IPS), a framework for coupled multiphysics simulations, and examine the trade-offs among time-to-solution, total cost, and resource utilization efficiency as a function of the compute resources applied to the problem.

99 GENERAL AND MISCELLANEOUS↗

Cylindricity Error Evaluation Based on an Improved Harmony Search Algorithm

The cylindricity error is one of the basic form errors in mechanical parts, which greatly influences the assembly accuracy and service life of relevant parts. For the minimum zone method (MZM) in international standards, there is no specific formula to calculate the cylindricity error. Therefore, the evaluation methods of the cylindricity error under the MZM have been widely concerned by international scholars. To improve the evaluation accuracy and accelerate the iteration speed of the cylindricity, an improved harmony search (IHS) algorithm is proposed and applied to compute the cylindricity. On the basis of the standard harmony search algorithm, the logistic chaotic initialization is introduced into the generation of initial solution to improve the quality of solutions. During the iterative process, the global and local search capabilities are balanced by adopting the par and b w operators adaptively. After each iteration, the Cauchy mutation strategy is adopted to the best solution to further improve the calculation precision of the IHS algorithm. Finally, four test functions and three groups of cylindricity error examples were applied to validity verification of the IHS algorithm, the simulation test results show that the IHS algorithm has advantages of the computing accuracy and iteration speed compared with other traditional algorithms, and it is very effective for the application in the evaluation of the cylindricity error.

Yang, Yang↗

Implementation of the D1S Methodology for Shutdown Dose Rate Calculations in the OpenMC Monte Carlo Particle Transport Code

We present an implementation of the direct one-step (D1S) methodology for shutdown dose rate (SDR) calculations in the OpenMC Monte Carlo particle transport code. In addition to being the first fully open-source D1S implementation, it is also the first to require no ad hoc source code or nuclear data library modifications. The code can seamlessly switch between production of prompt and decay photons based on a user input parameter, and the decay data needed for decay photon generation are made available through a depletion chain file, which is already used for OpenMC’s built-in depletion/activation solver. A set of Python functions significantly eases the burden of computing and applying time correction factors needed to properly account for the time dependence of radionuclide activity. To assess the accuracy of the D1S implementation, SDR calculations have been carried out for three problems: a prism of iron irradiated by 14-MeV neutrons, the ITER port plug computational benchmark, and the Frascati Neutron Generator (FNG) ITER dose rate benchmark problem from the Shielding INtegral Benchmark Archive and Database (SINBAD). For each of these problems, comparisons were made to calculations using the rigorous two-step (R2S) method. The results on the iron prism problem illustrate how the D1S method achieves superior spatial resolution compared to the R2S method without the need for spatial discretization of the activation regions. The D1S and R2S results for the ITER port plug benchmark agree well with previously reported results in the literature. While the D1S results are 10% to 15% lower than the R2S results, this may be due to stochastic uncertainty and/or spatial discretization in the R2S calculations. On the FNG dose rate benchmark problem, the D1S method produces dose rate estimates that are within 4% of the dose rates predicted using a cell-based R2S workflow. The D1S estimates of the SDR are also in reasonable agreement with the experimental measurements and show the same basic trends that have been observed in previous works. A qualitative analysis of the execution time and uncertainty for the R2S and D1S workflows suggests that the D1S method would attain a higher figure of merit.

D1S method↗

Many-fermion simulation from the contracted quantum eigensolver without fermionic encoding of the wave function

Quantum computers potentially have an exponential advantage over classical computers for the quantum simulation of many-fermion quantum systems. Nonetheless, fermions are more expensive to simulate than bosons due to the fermionic encoding—a mapping by which the qubits are encoded with fermion statistics. Here we generalize the contracted quantum eigensolver (CQE) to avoid fermionic encoding of the wave function. In contrast to the variational quantum eigensolver, the CQE solves for a many-fermion stationary state by minimizing the contraction (projection) of the Schrödinger equation onto two fermions. We avoid fermionic encoding of the wave function by contracting the Schrödinger equation onto an unencoded pair of particles. Solution of the resulting contracted equation by a series of unencoded two-body exponential transformations generates an unencoded wave function from which the energy and two-fermion reduced density matrix (2-RDM) can be computed. We apply the unencoded and the encoded CQE algorithms to the hydrogen fluoride molecule, the dissociation of oxygen O 2 , and a series of hydrogen chains. Both algorithms show comparable convergence towards the exact ground-state energies and 2-RDMs, but the unencoded algorithm has computational advantages in terms of state preparation and tomography.

74 ATOMIC AND MOLECULAR PHYSICS↗

Viscoelastic material inversion using Sierra-SD and ROL

In this report we derive frequency-domain methods for inverse characterization of the constitutive parameters of viscoelastic materials. The inverse problem is cast in a PDE-constrained optimization framework with efficient computation of gradients and Hessian vector products through matrix free operations. The abstract optimization operators for first and second derivatives are derived from first principles. Various methods from the Rapid Optimization Library (ROL) are tested on the viscoelastic inversion problem. The methods described herein are applied to compute the viscoelastic bulk and shear moduli of a foam block model, which was recently used in experimental testing for viscoelastic property characterization.

36 MATERIALS SCIENCE↗

Quantum approximate multi-objective optimization

The goal of multi-objective optimization is to understand optimal trade-offs between competing objective functions by finding the Pareto front, that is, the set of all Pareto-optimal solutions, where no objective can be improved without degrading another one. Multi-objective optimization can be challenging classically, even if the corresponding single-objective optimization problems are efficiently solvable. Thus, multi-objective optimization represents a compelling problem class to analyze with quantum computers. Here we use a low-depth quantum approximate optimization algorithm to approximate the optimal Pareto front of certain multi-objective weighted maximum-cut problems. We demonstrate its performance on an IBM Quantum computer, as well as with matrix product state numerical simulation, and show its potential to outperform classical approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Isotropic in-plane quenched disorder and dilution induce a robust nematic state in electron-doped pnictides

The phase diagram of electron-doped pnictides is studied varying the temperature, electronic density, and isotropic in-plane quenched disorder strength and dilution by means of computational techniques applied to a three-orbital (xz,yz,xy) spin-fermion model with lattice degrees of freedom. In experiments, chemical doping introduces disorder but in theoretical studies the relationship between electronic doping and the randomly located dopants, with their associated quenched disorder, is difficult to address. Moreover, in this publication, the use of computational techniques allows us to study independently the effects of electronic doping, regulated by a global chemical potential, and impurity disorder at randomly selected sites. Surprisingly, our Monte Carlo simulations reveal that the fast reduction with doping of the N eel T N and the structural T S transition temperatures, and the concomitant stabilization of a robust nematic state, is primarily controlled in our model by the magnetic dilution associated with the in-plane isotropic disorder introduced by Fe substitution. In the doping range studied, changes in the Fermi surface produced by electron doping affect only slightly both critical temperatures. Our results also suggest that the specific material-dependent phase diagrams experimentally observed could be explained as a consequence of the variation in disorder profiles introduced by the different dopants. Finally, our findings are also compatible with neutron scattering and scanning tunneling microscopy, unveiling a patchy network of locally magnetically ordered clusters with anisotropic shapes, even though the quenched disorder is locally isotropic. Our study reveals a remarkable and unexpected degree of complexity in pnictides: the fragile tendency to nematicity intrinsic of translational invariant electronic systems needs to be supplemented by quenched disorder and dilution to stabilize the robust nematic phase experimentally found in electron-doped 122 compounds.

97 MATHEMATICS AND COMPUTING↗

The Weak Form Is Stronger Than You Think

The weak form is a ubiquitous, well-studied, and widely-utilized mathematical tool in modern computational and applied mathematics. In this work we provide a survey of both the history and recent developments for several fields in which the weak form can play a critical role. In particular, we highlight several recent advances in weak form versions of equation learning, parameter estimation, and coarse graining, which offer surprising noise robustness, accuracy, and computational efficiency. We note that this manuscript is a companion piece to our October 2024 SIAM News article of the same name. Here we provide more detailed explanations of mathematical developments as well as a more complete list of references. Lastly, we note that the software with which to reproduce the results in this manuscript is also available on our group's GitHub website https://github.com/MathBioCU .

26A33, 35D30, 62FXX, 62JXX, 65L09, 65M32, 68Q32,↗

Identifying local structural states in atomic imaging by computer vision

Abstract The availability of atomically resolved imaging modalities enables an unprecedented view into the local structural states of materials, which manifest themselves by deviations from the fundamental assumptions of periodicity and symmetry. Consequently, approaches that aim to extract these local structural states from atomic imaging data with minimal assumptions regarding the average crystallographic configuration of a material are indispensable to advances in structural and chemical investigations of materials. Here, we present an approach to identify and classify local structural states that is rooted in computer vision. This approach introduces a definition of a structural state that is composed of both local and nonlocal information extracted from atomically resolved images, and is wholly untethered from the familiar concepts of symmetry and periodicity. Instead, this approach relies on computer vision techniques such as feature detection, and concepts such as scale invariance. We present the fundamental aspects of local structural state extraction and classification by application to simulated scanning transmission electron microscopy images, and analyze the robustness of this approach in the presence of common instrumental factors such as noise, limited spatial resolution, and weak contrast. Finally, we apply this computer vision-based approach for the unsupervised detection and classification of local structural states in an experimental electron micrograph of a complex oxides interface, and a scanning tunneling micrograph of a defect-engineered multilayer graphene surface.

74 ATOMIC AND MOLECULAR PHYSICS↗