Search NASA⌕ Search

SEARCH · Search NASA

Results for “COMPUTING PROBLEMS”

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 649 records · Page 36

A Hybrid MPI/OpenMP Approach for Parallel Groundwater Model Calibration on Multicore Computers

Groundwater model calibration is becoming increasingly computationally time intensive. We describe a hybrid MPI/OpenMP approach to exploit two levels of parallelism in software and hardware to reduce calibration time on multicore computers with minimal parallelization effort. At first, HydroGeoChem 5.0 (HGC5) is parallelized using OpenMP for a uranium transport model with over a hundred species involving nearly a hundred reactions, and a field scale coupled flow and transport model. In the first application, a single parallelizable loop is identified to consume over 97% of the total computational time. With a few lines of OpenMP compiler directives inserted into the code, the computational time reduces about ten times on a compute node with 16 cores. The performance is further improved by selectively parallelizing a few more loops. For the field scale application, parallelizable loops in 15 of the 174 subroutines in HGC5 are identified to take more than 99% of the execution time. By adding the preconditioned conjugate gradient solver and BICGSTAB, and using a coloring scheme to separate the elements, nodes, and boundary sides, the subroutines for finite element assembly, soil property update, and boundary condition application are parallelized, resulting in a speedup of about 10 on a 16-core compute node. The Levenberg-Marquardt (LM) algorithm is added into HGC5 with the Jacobian calculation and lambda search parallelized using MPI. With this hybrid approach, compute nodes at the number of adjustable parameters (when the forward difference is used for Jacobian approximation), or twice that number (if the center difference is used), are used to reduce the calibration time from days and weeks to a few hours for the two applications. This approach can be extended to global optimization scheme and Monte Carol analysis where thousands of compute nodes can be efficiently utilized.

54 ENVIRONMENTAL SCIENCES↗

TOUGH3: A new efficient version of the TOUGH suite of multiphase flow and transport simulators

The TOUGH suite of nonisothermal multiphase flow and transport simulators has been updated by various developers over many years to address a vast range of challenging subsurface problems. The increasing complexity of the simulated processes as well as the growing size of model domains that need to be handled call for an improvement in the simulator's computational robustness and efficiency. Moreover, modifications have been frequently introduced independently, resulting in multiple versions of TOUGH that (1) led to inconsistencies in feature implementation and usage, (2) made code maintenance and development inefficient, and (3) caused confusion to users and developers. TOUGH3—a new base version of TOUGH—addresses these issues. It consolidates both the serial (TOUGH2 V2.1) and parallel (TOUGH2-MP V2.0) implementations, enabling simulations to be performed on desktop computers and supercomputers using a single code. New PETSc parallel linear solvers are added to the existing serial solvers of TOUGH2 and the Aztec solver used in TOUGH2-MP. The PETSc solvers generally perform better than the Aztec solvers in parallel and the internal TOUGH3 linear solver in serial. TOUGH3 also incorporates many new features, addresses bugs, and improves the flexibility of data handling. So due to the improved capabilities and usability, TOUGH3 is more robust and efficient for solving tough and computationally demanding problems in diverse scientific and practical applications related to subsurface flow modeling.

97 MATHEMATICS AND COMPUTING↗

Expansion and orthogonalization of measured modes for structure identification

The purpose was to investigate a new simultaneous expansion/orthogonalization method in comparison with two previously published expansion methods and a widely used orthogonalization technique. Each expansion method uses data from an analytical model of the structure to complete the estimate of the mode shape vectors. Berman and Nagy used Guyan expansion in their work with improving analytical models. In this method, modes are expanded one at a time, producing a set not orthogonal with respect to the mass matrix. Baruch and Bar Itzhack's optimal orthogonalization procedure was used to subsequently adjust the expanded modes. A second expansion technique was presented by O'Callahan, Avitabile, and Reimer and separately by Kammer. Again, modes are expanded individually and orthogonalized after expansion with the same optimal technique as above. Finally, a simultaneous expansion/orthogonalization method was developed from the orthogonal Procrustes problem of computational mathematics. In this method modes are optimally expanded as a set and orthogonal with respect to the mass matrix as a result. Two demonstation problems were selected for the comparison of the methods described. The first problem is an 8 degree of freedom spring-mass problem first presented by Kabe. Several conditions were examined for expansion method including the presence of errors in the measured data and in the analysis models. As a second demonstration problem, data from tests of laboratory scale model truss structures was expanded for system identification. Tests with a complete structure produced a correlated analysis model and the stiffness and mass matrices. Tests of various damaged configurations produced measured data for 6 modes at 14 dof locations.

Smith, Suzanne Weaver↗

Impact of graph structures for QAOA on MaxCut

The quantum approximate optimization algorithm (QAOA) is a promising method of solving combinatorial optimization problems using quantum computing. QAOA on the MaxCut problem has been studied extensively on graphs with specific structure; however, little is known about the general performance of the algorithm on arbitrary graphs. Here, we investigate how different graph characteristics correlate with QAOA performance at depths at most three on the MaxCut problem for all connected non-isomorphic graphs with at most eight vertices. Some good predictors of QAOA success relate to graph symmetries, odd cycles, and density. For example, on eight vertex graphs, the average probability for selecting an optimal solution for graphs that contain no odd cycles after three iterations of QAOA is 60.6% compared to 48.2% for those that do. The data generated from these studies are shared in a publicly accessible database to serve as a benchmark for QAOA calculations and experiments. Knowing the relationship between structure and performance can be used to identify classes of combinatorial problems that are likely to exhibit a quantum advantage.

97 MATHEMATICS AND COMPUTING↗

Low thrust space vehicle trajectory optimization using regularized variables

Optimizing the trajectory of a low thrust space vehicle usually means solving a nonlinear two point boundary value problem. In general, accuracy requirements necessitate extensive computation times. In celestial mechanics, regularizing transformations of the equations of motion are used to eliminate computational and analytical problems that occur during close approaches to gravitational force centers. It was shown in previous investigations that regularization in the formulation of the trajectory optimization problem may reduce the computation time. In this study, a set of regularized equations describing the optimal trajectory of a continuously thrusting space vehicle is derived. The computational characteristics of the set are investigated and compared to the classical Newtonian unregularized set of equations. The comparison is made for low thrust, minimum time, escape trajectories and numerical calculations of Keplerian orbits. The comparison indicates that in the cases investigated for bad initial guesses of the known boundary values a remarkable reduction in the computation time was achieved. Furthermore, the investigated set of regularized equations shows high numerical stability even for long duration flights and is less sensitive to errors in the guesses of the unknown boundary values.

Schwenzfeger, K. J.↗

Costa - Introduction to 2015 Annual Report

In parallel with Sandia National Laboratories having two major locations (NM and CA), along with a number of smaller facilities across the nation, so too is the distribution of scientific, engineering and computing resources. As a part of Sandia’s Institutional Computing Program, CA site-based Sandia computer scientists and engineers have been providing mission and research staff with local CA resident expertise on computing options while also focusing on two growing high performance computing research problems. The first is how to increase system resilience to failure, as machines grow larger, more complex and heterogeneous. The second is how to ensure that computer hardware and configurations are optimized for specialized data analytical mission needs within the overall Sandia computing environment, including the HPC subenvironment. All of these activities support the larger Sandia effort in accelerating development and integration of high performance computing into national security missions. Sandia continues to both promote national R&D objectives, including the recent Presidential Executive Order establishing the National Strategic Computing Initiative and work to ensure that the full range of computing services and capabilities are available for all mission responsibilities, from national security to energy to homeland defense.

97 MATHEMATICS AND COMPUTING↗

Nested hierarchical controller with partial autonomy

The problem of computer architecture for intelligent robots with partial autonomy is addressed. A robot with partial autonomy is considered a degenerated case of a fully autonomous robot. Thus, the problem of man-machine communication is formulated, and the conditions are determined for generating a language for such a communication. The duties of the master are determined.

Meystel, A.↗

A new “gold standard”: Perturbative triples corrections in unitary coupled cluster theory and prospects for quantum computing

A major difficulty in quantum simulation is the adequate treatment of a large collection of entangled particles, synonymous with electron correlation in electronic structure theory, with coupled cluster (CC) theory being the leading framework for dealing with this problem. Augmenting computationally affordable low-rank approximations in CC theory with a perturbative account of higher-rank excitations is a tractable and effective way of accounting for the missing electron correlation in those approximations. This is perhaps best exemplified by the “gold standard” CCSD(T) method, which bolsters the baseline CCSD with the effects of triple excitations using considerations from many-body perturbation theory (MBPT). Despite this established success, such a synergy between MBPT and the unitary analog of CC theory (UCC) has not been explored. In this work, we propose a similar approach wherein converged UCCSD amplitudes are leveraged to evaluate energy corrections associated with triple excitations, leading to the UCCSD[T] method. In terms of quantum computing, this correction represents an entirely classical post-processing step that improves the energy estimate by accounting for triple excitation effects without necessitating new quantum algorithm developments or increasing demand for quantum resources. The rationale behind this choice is shown to be rigorous by studying the properties of finite-order UCC energy functionals, and our efforts do not support the addition of the fifth-order contributions as in the (T) correction. We assess the performance of these approaches on a collection of small molecules and demonstrate the benefits of harnessing the inherent synergy between MBPT and UCC theories.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

COYOTE : a finite element computer program for nonlinear heat conduction problems. Part I, theoretical background.

The need for the engineering analysis of systems in which the transport of thermal energy occurs primarily through a conduction process is a common situation. For all but the simplest geometries and boundary conditions, analytic solutions to heat conduction problems are unavailable, thus forcing the analyst to call upon some type of approximate numerical procedure. A wide variety of numerical packages currently exist for such applications, ranging in sophistication from the large, general purpose, commercial codes, such as COMSOL, COSMOSWorks, ABAQUS and TSS to codes written by individuals for specific problem applications. The original purpose for developing the finite element code described here, COYOTE, was to bridge the gap between the complex commercial codes and the more simplistic, individual application programs. COYOTE was designed to treat most of the standard conduction problems of interest with a user-oriented input structure and format that was easily learned and remembered. Because of its architecture, the code has also proved useful for research in numerical algorithms and development of thermal analysis capabilities. This general philosophy has been retained in the current version of the program, COYOTE, Version 5.0, though the capabilities of the code have been significantly expanded. A major change in the code is its availability on parallel computer architectures and the increase in problem complexity and size that this implies. The present document describes the theoretical and numerical background for the COYOTE program. This volume is intended as a background document for the user's manual. Potential users of COYOTE are encouraged to become familiar with the present report and the simple example analyses reported in before using the program. The theoretical and numerical background for the finite element computer program, COYOTE, is presented in detail. COYOTE is designed for the multi-dimensional analysis of nonlinear heat conduction problems. A general description of the boundary value problems treated by the program is presented. The finite element formulation and the associated numerical methods used in COYOTE are also outlined. Instructions for use of the code are documented in SAND2010-0714.

99 GENERAL AND MISCELLANEOUS↗

A novel energy balance approach for a verifiable and accurate solution of radiation extinction in purely absorbing particle clouds

Here we consider the problem of radiation transport through purely absorbing particle clouds. The gold-standard solution of particle-resolved Monte Carlo ray-tracing method to this problem is computationally expensive and therefore solving the radiation transport equation (specifically, the Beer-Bouguer law (BB-law)) on a Eulerian mesh is often preferred. While the absorption coefficient in the real problem is infinite, the BB-law approximates it to be a finite number in the form of number density through a set of assumptions. For particle clouds that do not obey these assumptions, the BB-law predicts an incorrect exponential decay. Also, when the number density is computed using the nearest-neighbor approach, the BB-law solution diverges when the Eulerian mesh size becomes closer to or smaller than the particle size. This numerical divergence is due to the homogenization error. Although the filtering strategy for number density minimizes the homogenization error, it still converges to an incorrect exponential decay for particle clouds that break the BB-law constraints and the cost of the filtering is equivalent to that of the gold-standard solution. In this study, we develop a novel, highly accurate, verifiable and cost-effective solution to the radiation transport equation on a Eulerian domain using an energy balance approach where we derive an expression for the absorption coefficient as a function of particle and Eulerian mesh sizes. We apply our new method to Poisson and turbulent particle clouds that violate all the BB-law constraints and show that the solution is converging upon the mesh refinement, and eventually, we recover the same gold-standard solution for a much cheaper computational cost.

42 ENGINEERING↗

Least-squares finite element solution of 3D incompressible Navier-Stokes problems

Although significant progress has been made in the finite element solution of incompressible viscous flow problems. Development of more efficient methods is still needed before large-scale computation of 3D problems becomes feasible. This paper presents such a development. The most popular finite element method for the solution of incompressible Navier-Stokes equations is the classic Galerkin mixed method based on the velocity-pressure formulation. The mixed method requires the use of different elements to interpolate the velocity and the pressure in order to satisfy the Ladyzhenskaya-Babuska-Brezzi (LBB) condition for the existence of the solution. On the other hand, due to the lack of symmetry and positive definiteness of the linear equations arising from the mixed method, iterative methods for the solution of linear systems have been hard to come by. Therefore, direct Gaussian elimination has been considered the only viable method for solving the systems. But, for three-dimensional problems, the computer resources required by a direct method become prohibitively large. In order to overcome these difficulties, a least-squares finite element method (LSFEM) has been developed. This method is based on the first-order velocity-pressure-vorticity formulation. In this paper the LSFEM is extended for the solution of three-dimensional incompressible Navier-Stokes equations written in the following first-order quasi-linear velocity-pressure-vorticity formulation.

Jiang, Bo-Nan↗

Finite Element Modeling of a Cylindrical Contact Using Hertzian Assumptions

The turbine blades in the high-pressure fuel turbopump/alternate turbopump (HPFTP/AT) are subjected to hot gases rapidly flowing around them. This flow excites vibrations in the blades. Naturally, one has to worry about resonance, so a damping device was added to dissipate some energy from the system. The foundation is now laid for a very complex problem. The damper is in contact with the blade, so now there are contact stresses (both normal and tangential) to contend with. Since these stresses can be very high, it is not all that difficult to yield the material. Friction is another non-linearity and the blade is made out of a Nickel-based single-crystal superalloy that is orthotropic. A few approaches exist to solve such a problem and computer models, using contact elements, have been built with friction, plasticity, etc. These models are quite cumbersome and require many hours to solve just one load case and material orientation. A simpler approach is required. Ideally, the model should be simplified so the analysis can be conducted faster. When working with contact problems determining the contact patch and the stresses in the material are the main concerns. Closed-form solutions for non-conforming bodies, developed by Hertz, made out of isotropic materials are readily available. More involved solutions for 3-D cases using different materials are also available. The question is this: can Hertzian1 solutions be applied, or superimposed, to more complicated problems-like those involving anisotropic materials? That is the point of the investigation here. If these results agree with the more complicated computer models, then the analytical solutions can be used in lieu of the numerical solutions that take a very long time to process. As time goes on, the analytical solution will eventually have to include things like friction and plasticity. The models in this report use no contact elements and are essentially an applied load problem using Hertzian assumptions to determine the contact patch dimensions.

Knudsen, Erik↗

Diffuse-Interface Methods in Fluid Mechanics

The authors review the development of diffuse-interface models of hydrodynamics and their application to a wide variety of interfacial phenomena. The authors discuss the issues involved in formulating diffuse-interface models for single-component and binary fluids. Recent applications and computations using these models are discussed in each case. Further, the authors address issues including sharp-interface analyses that relate these models to the classical free-boundary problem, related computational approaches to describe interfacial phenomena, and related approaches describing fully-miscible fluids.

SURFACE DIFFUSION↗

Dissipative ground state preparation in ab initio electronic structure theory

Dissipative engineering is a powerful tool for quantum state preparation, and has drawn significant attention in quantum algorithms and quantum many-body physics in recent years. In this work, we introduce a novel approach using the Lindblad dynamics to efficiently prepare the ground state for general ab initio electronic structure problems on quantum computers, without variational parameters. These problems often involve Hamiltonians that lack geometric locality or sparsity structures, which we address by proposing two generic types of jump operators for the Lindblad dynamics. Type-I jump operators break the particle number symmetry and should be simulated in the Fock space. Type-II jump operators preserves the particle number symmetry and can be simulated more efficiently in the full configuration interaction space. For both types of jump operators, we prove that in a simplified Hartree-Fock framework, the spectral gap of our Lindbladian is lower bounded by a universal constant. For physical observables such as energy and reduced density matrices, the convergence rate of our Lindblad dynamics with Type-I jump operators remains universal, while the convergence rate with Type-II jump operators only depends on coarse grained information such as the number of orbitals and the number of electrons. To validate our approach, we employ a Monte Carlo trajectory-based algorithm for simulating the Lindblad dynamics for full ab initio Hamiltonians, demonstrating its effectiveness on molecular systems amenable to exact wavefunction treatment.

Quantum chemistry↗

Scalable Asynchronous Domain Decomposition Solvers

We discuss how parallel implementations of linear iterative solvers generally alternate between phases of data exchange and phases of local computation. Increasingly large problem sizes and more heterogeneous compute architectures make load balancing and the design of low latency network interconnects that are able to satisfy the communication requirements of linear solvers very challenging tasks. In particular, global communication patterns such as inner products become increasingly limiting at scale. We explore the use of asynchronous communication based on one-sided Message Passing Interface primitives in the context of domain decomposition solvers. In particular, a scalable asynchronous two-level Schwarz method is presented. We discuss practical issues encountered in the development of a scalable solver and show experimental results obtained on a state-of-the-art supercomputer system that illustrate the benefits of asynchronous solvers in load balanced as well as load imbalanced scenarios. Using the novel method, we can observe speedups of up to four times over its classical synchronous equivalent.

97 MATHEMATICS AND COMPUTING↗

Engineering topologically protected superconducting states

Efforts to develop systems which support non-Abelian excitations are motivated by both scientific curiosity and a practical desire to built a fault tolerant quantum computer to solve problems fundamentally intractable for classical computations. Experimentally, signatures of simplest non-Abelian excitations have been seen in spectroscopic measurements, yet current experiments fall shot of demonstrating non-Abelian exchange statistics. With DOE support we explore several systems where non-Abelian excitations are expected to appear, with special attention paid to the ability to demonstrate braiding. In nanowire semiconductor/superconductor hybrid system we are developing devices where position of Majorana particles, the simplest non-Abelian excitations, can be varied by magnetic field. The system will allow braiding of Majorana fermions and study non-Abelian statistics. In another system we focus on the development of a new platform where higher order non-Abelian excitations - parafermions - can be realized. Recently we demonstrated formation of heliacal channels in the fractional quantum Hall regime, precursors of topological superconductors that support parafermion excitations. Investigation of these channels and induced superconductivity will be an important part of the proposed research. Finally, investigation of induced superconductivity in topological insulators and discovery of highly unharmonic current-phase relation in Josephson junctions is the basis for the proposed realization of a topologically protected qubits with abelian anions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Computational Science at Los Alamos National Laboratory (Rev. 1) [Slides]

High Performance Computing (HPC) enables problem solving at the grandest scales, on the most complex challenges that face humanity. The problems often tackled by scientific computing are: Very complex; Cool; Using the fastest, most powerful supercomputers on the planet; Often important, impactful, effecting real lives.

97 MATHEMATICS AND COMPUTING↗

An algebraic approach to image de-smearing: Symmetries of polynomials and their zeros

Frequently a photograph received from a spacecraft will be smeared by some process, e.g., by camera motion. Algebraically such smearing can be represented as p = sigma f, where sigma is the true picture, p is the received picture, and f is the smearing function. (p, sigma, and f are polynomials in two variables x and y.) Thus, in principle, sigma can be recovered by multiplying p by 1/f. However, there are problems involved in computing 1/f. Some of these problems are investigated.

Johnson, D. L.↗