SEARCH · Engineering Papers

Results for “parallel methods”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,099 records · Page 61

All sources NASA NTRS DOE OSTI

DOE OSTI2022

Parallel Multigrid in Time and Space for Extreme-Scale Computational Science: Chaotic and Hyperbolic Problems

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallelin-time methods, with the most common method, parareal, diverging in many cases. The current stateof-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, we take inspiration from the Least Squares Shadowing (LSS by Wang) approach for solving chaotic problems. Here, an optimization approach is able to find “well-conditioned” shadow trajectories/solutions to the original “ill-conditioned” chaotic problem. Thus, the new multigrid methods researched here also arise in an optimization context.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2018

Alternating Anderson–Richardson method: An efficient alternative to preconditioned Krylov methods for large, sparse linear systems

Here, we present the Alternating Anderson–Richardson (AAR) method: an efficient and scalable alternative to preconditioned Krylov solvers for the solution of large, sparse linear systems on high performance computing platforms. Specifically, we generalize the recently proposed Alternating Anderson–Jacobi (AAJ) method (Pratapa et al., 2016) to include preconditioning, discuss efficient parallel implementation, and provide serial MATLAB and parallel C/C++ implementations. In serial applications to nonsymmetric systems, we find that AAR is comparably robust to GMRES, using the same preconditioning, while often outperforming it in time to solution; and find AAR to be more robust than Bi-CGSTAB for the problems considered. In parallel applications to the Helmholtz and Poisson equations, we find that AAR shows superior strong and weak scaling to GMRES, Bi-CGSTAB, and Conjugate Gradient (CG) methods, using the same preconditioning, with consistently shorter times to solution at larger processor counts. Finally, in massively parallel applications to the Poisson equation, on up to 110,592 processors, we find that AAR shows superior strong and weak scaling to CG, with shorter minimum time to solution. We thus find that AAR offers a robust and efficient alternative to current state-of-the-art solvers, with increasing advantages as the number of processors grows.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Distributed Reinforcement Learning with ADMM-RL

This paper presents a new algorithm for distributed Reinforcement Learning (RL). RL is an artificial intelligence (AI) control strategy such that controls for highly nonlinear systems over multi-step time horizons may be learned by experience, rather than directly computed on the fly by optimization. Here we introduce ADMM-RL, a combination of the Alternating Direction Method of Multipliers (ADMM) and reinforcement learning that allows for integrating learned controllers as subsystems in generally convergent distributed control applications. ADMM has become the workhorse algorithm for distributed control, combining the advantages of dual decomposition (namely, enabling decoupled, parallel, distributed solution) with the advantages of the method of multipliers (namely, convexification/stability). Our ADMM-RL algorithm replaces one or more of the subproblems in ADMM with several steps of RL. When the nested iterations converge, we are left with a pretrained subsolver that can potentially increase the efficiency of the deployed distributed controller by orders of magnitude. We illustrate ADMM-RL in both distributed wind farm yaw control and distributed grid-aware demand aggregation for water heaters.

ADMM↗

NASA NTRS1978

Stellar model chromospheres. VIII - 70 Ophiuchi A /K0 V/ and Epsilon Eridani /K2 V/

Model atmospheres for the late-type active-chromosphere dwarf stars 70 Oph A and Epsilon Eri are computed from high-resolution Ca II K line profiles as well as Mg II h and k line fluxes. A method is used which determines a plane-parallel homogeneous hydrostatic-equilibrium model of the upper photosphere and chromosphere which differs from theoretical models by lacking the constraint of radiative equilibrium (RE). The determinations of surface gravities, metallicities, and effective temperatures are discussed, and the computational methods, model atoms, atomic data, and observations are described. Temperature distributions for the two stars are plotted and compared with RE models for the adopted effective temperatures and gravities. The previously investigated T min/T eff vs. T eff relation is extended to Epsilon Eri and 70 Oph A, observed and computed Ca II K and Mg II h and k integrated emission fluxes are compared, and full tabulations are given for the proposed models. It is suggested that if less than half the observed Mg II flux for the two stars is lost in noise, the difference between an active-chromosphere star and a quiet-chromosphere star lies in the lower-chromospheric temperature gradient.

Kelch, W. L.↗

DOE OSTI2018

Python-based in situ analysis and visualization

This work focuses on enabling the use of Python-based methods for the purpose of performing in situ analysis and visualization. This approach facilitates access to and use of a rapidly growing collection of Python-based, third-party libraries for analysis and visualization, as well as lowering the barrier to entry for user-written Python analysis codes. Beginning with a simulation code that is instrumented to use the SENSEI in situ interface, we present how to couple it with a Python-based data consumer, which may be run in situ, and in parallel at the same concurrency as the simulation. We present two examples that demonstrate the new capability. One is an analysis of the reaction rate in a proxy simulation of a chemical reaction on a 2D substrate, while the other is a coupling of an AMR simulation to Yt, a parallel visualization and analysis library written in Python. In the examples, both the simulation and Python in situ method run in parallel on a large-scale HPC platform.

Loring, Burlen↗

DOE OSTI2015

SU-E-T-350: Effective Point of Measurement and Total Perturbation Correction P for Parallel-Plate Ion Chambers in High-Energy Photon Beams

Purpose: This paper aims to determine the effective point of measurement and the total perturbation correction p of parallel-plate chambers for clinical photon dosimetry. Methods: The effective point of measurement (EPOM) was calculated using the EGSnrc Monte Carlo code system with the EGSnrc user code egs- chamber. Depth dose curves of the ionization chambers were calculated in a water phantom for several high energy photon spectra (4, 6, 10, 15, 18 MV-X). Different normalization criterions (normalization to the maximum of the depth dose curve and normalization to the value in 10 cm depth) have been applied. The EPOM was determined by shifting the normalized depth dose curve of a small water voxel against the depth ionization curve until the disagreement (calculated by the root mean square deviation) reaches a minimum. In addition, the total perturbation correction p was calculated by the ratio of the dose to water and the product of the dose determined in the chamber and the water to air stopping power ratio. Results: The EPOM varied slightly depending on the chosen normalization criterion. For all chambers the necessary shift of the EPOM decreased linearly with increasing beam quality specifier TPR{sub 20/10}. For the Roos and NACP chamber, the results were positive suggesting that the chambers need to be shifted towards the focus. For the Markus chamber, the required shift was negative and for the Advanced Markus chamber partly negative and partly positive. The total perturbation correction p was almost independent of the depth. Only for regions below 1 cm the perturbation correction deviated significantly from unity. Conclusion: In the present study, the effective point of measurement and the total perturbation correction p was determined for four parallel-plate ionization chambers and five clinical relevant photon spectra. Applying the calculated EPOM, the residual perturbation correction p was mostly depth independent.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2021

Crystal plasticity model of residual stress in additive manufacturing using the element elimination and reactivation method

Selective laser melting is receiving increasing interest as an additive manufacturing technique. Residual stresses induced by the large temperature gradients and inhomogeneous cooling process can favour the generation of cracks. In this work, a crystal plasticity finite element model is developed to simulate the formation of residual stresses and to understand the correlation between plastic deformation, grain orientation and residual stresses in the additive manufacturing process. The temperature profile and grain structure from thermal-fluid flow and grain growth simulations are implemented into the crystal plasticity model. An element elimination and reactivation method is proposed to model the melting and solidification and to reinitialize state variables, such as the plastic deformation, in the reactivated elements. The accuracy of this method is judged against previous method based on the stiffness degradation of liquid regions by comparing the plastic deformation as a function of time induced by thermal stresses. The method is used to investigate residual stresses parallel and perpendicular to the laser scan direction, and the correlation with the maximum Schmid factor of the grains along those directions. The magnitude of the residual stress can be predicted as a function of the depth, grain orientation and position with respect to the molten pool. The simulation results are directly comparable to X-ray diffraction experiments and stress–strain curves.

316 stainless steel↗

DOE OSTI2015

A partially reflecting random walk on spheres algorithm for electrical impedance tomography

In this work, we develop a probabilistic estimator for the voltage-to-current map arising in electrical impedance tomography. This novel so-called partially reflecting random walk on spheres estimator enables Monte Carlo methods to compute the voltage-to-current map in an embarrassingly parallel manner, which is an important issue with regard to the corresponding inverse problem. Our method uses the well-known random walk on spheres algorithm inside subdomains where the diffusion coefficient is constant and employs replacement techniques motivated by finite difference discretization to deal with both mixed boundary conditions and interface transmission conditions. We analyze the global bias and the variance of the new estimator both theoretically and experimentally. Subsequently, the variance of the new estimator is considerably reduced via a novel control variate conditional sampling technique which yields a highly efficient hybrid forward solver coupling probabilistic and deterministic algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2014

Measuring coalignment of retroreflectors with large lateral incoming-outgoing beam offset

A method based on phase-shifting Fizeau interferometry is presented with which retroreflectors with large incoming-outgoing beam separations can be tested. The method relies on a flat Reference Bar that is used to align two auxiliary mirrors parallel to each other to extend the aperture of the interferometer. The method is applied to measure the beam coalignment of a prototype Triple Mirror Assembly of the GRACE Follow-On Laser Ranging Interferometer, a future satellite-to-satellite tracking device for Earth gravimetry. The Triple Mirror Assembly features a lateral beam offset of incoming and outgoing beam of 600 mm, whereas the acceptance angle for the incoming beam is only about ±2 mrad. With the developed method, the beam coalignment of the prototype Triple Mirror Assembly was measured to be 9 μrad with a repeatability of below 1 μrad.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

NASA NTRS2003

Aircraft Engine Noise Scattering By Fuselage and Wings: A Computational Approach

The paper presents a time-domain method for computation of sound radiation from aircraft engine sources to the far-field. The effects of nonuniform flow around the aircraft and scattering of sound by fuselage and wings are accounted for in the formulation. The approach is based on the discretization of the inviscid flow equations through a collocation form of the Discontinuous Galerkin spectral element method. An isoparametric representation of the underlying geometry is used in order to take full advantage of the spectral accuracy of the method. Large-scale computations are made possible by a parallel implementation based on message passing. Results obtained for radiation from an axisymmetric nacelle alone are compared with those obtained when the same nacelle is installed in a generic configuration, with and without a wing.

FUSELAGE-NACELLE CONFIGURATION↗

NASA NTRS1995

Optical Interconnection Via Computer-Generated Holograms

Method of free-space optical interconnection developed for data-processing applications like parallel optical computing, neural-network computing, and switching in optical communication networks. In method, multiple optical connections between multiple sources of light in one array and multiple photodetectors in another array made via computer-generated holograms in electrically addressed spatial light modulators (ESLMs). Offers potential advantages of massive parallelism, high space-bandwidth product, high time-bandwidth product, low power consumption, low cross talk, and low time skew. Also offers advantage of programmability with flexibility of reconfiguration, including variation of strengths of optical connections in real time.

Liu, Hua-Kuang↗

DOE OSTI2018

A superstructure optimization approach for process synthesis under complex reaction networks

Here in this work, we present mixed integer linear programming methods for the synthesis of processes that involve complex reaction networks. Specifically, we consider the modeling of reactors and interconnecting streams in systems where the composition of the reactor inlet streams can vary substantially, thereby making the determination of the limiting component as well as the calculation of the stream heating/cooling and power requirements challenging. First, towards the modeling of reactors, we develop an extent-based method which detects the limiting reactant of each reaction occurring in parallel with others, based on the inlet flows of the reactants. Second, we develop a computationally tractable method for the calculation of the work and heating/cooling duty needed to condition any stream of a process based on simple calculations that can be performed offline. Finally, we present how the two aforementioned components can be integrated in an optimization model generated based on a process superstructure. We demonstrate the application of the developed methods for the synthesis of a biorefinery.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2022

Image Gradient Decomposition for Parallel and Memory-Efficient Ptychographic Reconstruction

Ptychography is a popular microscopic imaging modality for many scientific discoveries and sets the record for highest image resolution. Unfortunately, the high image resolution for ptychographic reconstruction requires significant amount of memory and computations, forcing many applications to compromise their image resolution in exchange for a smaller memory footprint and a shorter reconstruction time. In this paper, we propose a novel image gradient decomposition method that significantly reduces the memory footprint for ptychographic reconstruction by tessellating image gradients and diffraction measurements into tiles. In addition, we propose a parallel image gradient decomposition method that enables asynchronous point-to-point communications and parallel pipelining with minimal overhead on a large number of GPUs. Our experiments on a Titanate material dataset (PbTiO3) with 16632 probe locations show that our Gradient Decomposition algorithm reduces memory footprint by 51 times. In addition, it achieves time-to-solution within 2.2 minutes by scaling to 4158 GPUs with a super-linear strong scaling efficiency at 364% compared to runtimes at 6 GPUs. This performance is 2.7 times more memory efficient, 9 times more scalable and 86 times faster than the state-of-the-art algorithm.

Wang, Xiao↗

DOE OSTI2013

Embedding global barrier and collective in torus network with each node combining input from receivers according to class map for output to senders

Embodiments of the invention provide a method, system and computer program product for embedding a global barrier and global interrupt network in a parallel computer system organized as a torus network. The computer system includes a multitude of nodes. In one embodiment, the method comprises taking inputs from a set of receivers of the nodes, dividing the inputs from the receivers into a plurality of classes, combining the inputs of each of the classes to obtain a result, and sending said result to a set of senders of the nodes. Embodiments of the invention provide a method, system and computer program product for embedding a collective network in a parallel computer system organized as a torus network. In one embodiment, the method comprises adding to a torus network a central collective logic to route messages among at least a group of nodes in a tree structure.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

Embedding global and collective in a torus network with message class map based tree path selection

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Embedding global barrier and collective in a torus network

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Parallel-in-Time Solution of Scalar Nonlinear Conservation Laws

Here, we consider the parallel-in-time solution of scalar nonlinear conservation laws in one spatial dimension. The equations are discretized in space with a conservative finite-volume method using weighted essentially nonoscillatory (WENO) reconstructions, and in time with high-order explicit Runge–Kutta methods. The solution of the global, discretized space-time problem is sought via a nonlinear iteration that uses a novel linearization strategy in cases of nondifferentiable equations. Under certain choices of discretization and algorithmic parameters, the nonlinear iteration coincides with Newton’s method, although, more generally, it is a preconditioned residual correction scheme. At each nonlinear iteration, the linearized problem takes the form of a certain discretization of a linear conservation law over the space-time domain in question. An approximate parallel-in-time solution of the linearized problem is computed with a single multigrid reduction-in-time (MGRIT) iteration; however, any other effective parallel-in-time method could be used in its place. The MGRIT iteration employs a novel coarse-grid operator that is a modified conservative semi-Lagrangian discretization and generalizes those we have developed previously for nonconservative scalar linear hyperbolic problems. Numerical tests are performed for the inviscid Burgers and Buckley–Leverett equations. For many test problems, the solver converges in just a handful of iterations with a convergence rate independent of mesh resolution, including problems with (interacting) shocks and rarefactions.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1990

Graphics applications utilizing parallel processing

The results are presented of research conducted to develop a parallel graphic application algorithm to depict the numerical solution of the 1-D wave equation, the vibrating string. The research was conducted on a Flexible Flex/32 multiprocessor and a Sequent Balance 21000 multiprocessor. The wave equation is implemented using the finite difference method. The synchronization issues that arose from the parallel implementation and the strategies used to alleviate the effects of the synchronization overhead are discussed.

Rice, John R.↗