Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “implicit and explicit algorithms”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

A Scalable Semi-Implicit Barotropic Mode Solver for the MPAS-Ocean

A scalable semi-implicit barotropic mode solver for the ocean component of the model for prediction across scales has been implemented as a competitor to an existing explicit-subcycling scheme to allow faster and more stable simulations while not sacrificing accuracy. The semi-implicit solver adopts the pipelined preconditioned bi-conjugate gradient stabilization algorithm as an iterative solver in conjunction with the restricted additive Schwarz preconditioner that accelerates the convergence rate of the iterative solver. The preconditioner is constructed from a linearized barotropic system that also reorders the system for optimal performance, while the semi-implicit solver deals with the fully nonlinear barotropic system that requires reassembly of the coefficient matrix for every time step. Several numerical experiments, from simple one-dimensional tests to three-dimensional real-world tests, demonstrate that the semi-implicit solver has almost the same accuracy and better parallel scalability compared with the existing scheme while allowing faster and more stable simulations. Furthermore, the semi-implicit solver accelerates the barotropic mode up to 2.9 times faster than the existing scheme on 16,320 processors, leading to an overall runtime speedup of 1.9.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2011

Performance Characterization for Fusion Co-design Applications

Magnetic fusion is a long-term solution for producing electrical power for the world, and the large thermonuclear international device (ITER) being constructed will produce net energy and a path to fusion energy provided the computer modeling is accurate. To effectively address the requirements of the high-end fusion simulation community, application developers, algorithm designers, and hardware architects must have reliable simulation data gathered at scale for scientifically valid configurations. This paper presents detailed benchmarking results for a set of magnetic fusion applications with a wide variety of underlying mathematical models including both particle-in-cell and Eulerian codes using both implicit and explicit numerical solvers. Our evaluation on a petascale Cray XE6 platform focuses on profiling these simulations at scale identifying critical performance characteristics, including scalability, memory/network bandwidth limitations, and communication overhead. Overall results are a key in improving fusion code design, and are a critical first step towards exascale hardware-software co-design — a process that tightly couples applications, algorithms, imple- mentation, and computer architecture.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2014

AHF: Array-Based Half-Facet Data Structure for Mixed-Dimensional and Non-Manifold Meshes

We present an Array-based Half-Facet mesh data structure, or AHF, for efficient mesh query and modification operations. The AHF extends the compact array-based half-edge and half-face data structures (T.J. Alumbaugh and X. Jiao, Compact array-based mesh data structures, IMR, 2005) to support mixed-dimensional and non-manifold meshes. The design goals of our data structure include generality to support such meshes, efficiency of neighborhood queries and mesh modification, compactness of memory footprint, and facilitation of interoperability of mesh-based application codes. To accomplish these goals, our data structure uses sibling half-facets as a core abstraction, coupled with other explicit and implicit representations of entities. A unique feature of our data structure is a comprehensive implementation in MATLAB, which allows rapid prototyping, debugging, testing, and deployment of meshing algorithms and other mesh-based numerical methods. We have also developed C++ implementation built on top of MOAB (T.J. Tautges, R. Meyers, and K. Merkley, MOAB: A Mesh-Oriented Database, Sandia National Laboratories, 2004). We present some comparisons of the memory requirements and computational costs, and also demonstrate its effectiveness with a few sample applications.

Dyedov, Volodymyr↗
DOE OSTI2020

Development of Control System Functional Capabilities within the IES Plug-and-Play Simulation Environment

The concept of an Integrated Energy System (IES) is meant to combine different energy technologies in synergistic ways to achieve a more secure and economical energy supply. The RAVEN-based HYBRID framework is used to find the optimal installed capacity and the optimal economical dispatch of each component of the IES. A new RAVEN (Risk Analysis Virtual ENvironment) plugin for grid and capacity optimization (HERON) has been developed for optimizing the production variables of the IES given the demand profile. Currently, only the limits that affect the production variables and their corresponding time rates of change are considered (explicit constraints). However, other variables are additionally subject to constraints, but the associated limits are not accounted for (implicit constraints). In particular, for the power dispatch problem, the optimization algorithm takes into account the limits on the electrical power output and the corresponding hourly power variations but does not consider other constraints on process variables whose response effects the service life of the IES. This report describes a scheme that allows accounting for implicit constraints without increasing the size of the optimization problem. The Reference Governor (RG) algorithm is traditionally used for enforcing state and control constraints by modifying the set-point trajectories supplied to the feedback regulators. In our application, the RG is coupled within an iterative loop with the HERON-power dispatcher to generate optimal trajectories that ensure the operational constraints are met. A data-driven procedure to derive a representation of the dynamics of the controlled system was developed. First, the variables that represented the state of the system are selected (PCA-based approach), and then state-space representation matrices are derived from the collected measurements (DMDc algorithm). A preliminary version of the developed workflow based on Linear Time Invariant matrices was assessed by adopting a two-unit test case. More sophisticated versions of this workflow foreseeing the on-line derivation of system matrices will be deployed in FY 2021. Finally, a “plug-and-play” library of controllers and state observers was developed in Dymola. Some aspects of the current configuration of the IES unit components, e.g., the encapsulation of the control schemes into dedicated blocks, are consistent with the “plug-and-play” philosophy. Other features, e.g., the system buses collecting the input and the output variables, are not. For this reason, once listed and described the limits of the current configuration, necessary modifications to the plant model interface are presented. As a test-case, the interfaces of the SES model in the RAVEN-based HYBRID framework were reworked accordingly, and two different control schemes were applied to the same plant model.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1988

Convergence speeding up in the calculation of the viscous flow about an airfoil

A finite volume method to solve the three dimensional Navier-Stokes equations was developed. It is based on a cell-vertex scheme with central differences and explicit Runge-Kutta time steps. A good convergence for a stationary solution was obtained by the use of local time steps, implicit smoothing of the residues, a multigrid algorithm, and a carefully controlled artificial dissipative term. The method is illustrated by results for transonic profiles and airfoils. The method allows a routine solution of the Navier-Stokes equations.

Radespiel, R.↗
NASA NTRS1998

Multigrid Strategies for Viscous Flow Solvers on Anisotropic Unstructured Meshes

Unstructured multigrid techniques for relieving the stiffness associated with high-Reynolds number viscous flow simulations on extremely stretched grids are investigated. One approach consists of employing a semi-coarsening or directional-coarsening technique, based on the directions of strong coupling within the mesh, in order to construct more optimal coarse grid levels. An alternate approach is developed which employs directional implicit smoothing with regular fully coarsened multigrid levels. The directional implicit smoothing is obtained by constructing implicit lines in the unstructured mesh based on the directions of strong coupling. Both approaches yield large increases in convergence rates over the traditional explicit full-coarsening multigrid algorithm. However, maximum benefits are achieved by combining the two approaches in a coupled manner into a single algorithm. An order of magnitude increase in convergence rate over the traditional explicit full-coarsening algorithm is demonstrated, and convergence rates for high-Reynolds number viscous flows which are independent of the grid aspect ratio are obtained. Further acceleration is provided by incorporating low-Mach-number preconditioning techniques, and a Newton-GMRES strategy which employs the multigrid scheme as a preconditioner. The compounding effects of these various techniques on speed of convergence is documented through several example test cases.

Movriplis, Dimitri J.↗
DOE OSTI2017

Extreme Scale Unstructured Adaptive CFD: From Multiphase Flow to Aerodynamic Flow Control

Understanding the flow of fluid, either liquid or gas, through and around solid bodies has challenged man since the dawn of scientific inquiry. Many of the great minds of science and math have progressively built up a hierarchy of fluid models. This report is concerned with the computational modeling of turbulent flow around aerodynamic bodies such as planes and wind turbines. In this case, viscous effects near the solid bodies create very thin boundary layers that yield highly anisotropic (gradients normal to the surface may be 10^6 times larger than gradients along the surface) solutions to the governing non-linear partial differential equations (PDE); the Navier-Stokes equations. Furthermore, turbulent flows develop extremely broad ranges of length and time scales.This disparity motivates the use of discretization methods capable of employing adaptivity and implicit time integration. The combination of these features (non-linear, anisotropy, adaptivity, andimplicit) dramatically raise the complexity of the discretization, posing large challenges to efficient scalable parallel implementation. However, through careful design, the more complex algorithms can provide great reductions in computational cost relative to simpler methods (e.g., Cartesian grids with explicit time integration) that are easier to mate efficiently to hardware. In this report, we not only describe our approach but we also address the fact that while complex algorithms may never be as efficient flop-for-flop as simple methods, in the important measure of science-per-core-hour, they can still win big by making complex features like adaptivity and implicit methods as efficient and scalable as possible.

42 ENGINEERING↗
DOE OSTI2014

Geometric multigrid for an implicit-time immersed boundary method

The immersed boundary (IB) method is an approach to fluid-structure interaction that uses Lagrangian variables to describe the deformations and resulting forces of the structure and Eulerian variables to describe the motion and forces of the fluid. Explicit time stepping schemes for the IB method require solvers only for Eulerian equations, for which fast Cartesian grid solution methods are available. Such methods are relatively straightforward to develop and are widely used in practice but often require very small time steps to maintain stability. Implicit-time IB methods permit the stable use of large time steps, but efficient implementations of such methods require significantly more complex solvers that effectively treat both Lagrangian and Eulerian variables simultaneously. Moreover, several different approaches to solving the coupled Lagrangian-Eulerian equations have been proposed, but a complete understanding of this problem is still emerging. This paper presents a geometric multigrid method for an implicit-time discretization of the IB equations. This multigrid scheme uses a generalization of box relaxation that is shown to handle problems in which the physical stiffness of the structure is very large. Numerical examples are provided to illustrate the effectiveness and efficiency of the algorithms described herein. Finally, these tests show that using multigrid as a preconditioner for a Krylov method yields improvements in both robustness and efficiency as compared to using multigrid as a solver. They also demonstrate that with a time step 100–1000 times larger than that permitted by an explicit IB method, the multigrid-preconditioned implicit IB method is approximately 50–200 times more efficient than the explicit method.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1985

Generalized formulation of a class of explicit and implicit TVD schemes

A one parameter family of second order explicit and implicit total variation diminishing (TVD) schemes is reformulated so that a simpler and wider group of limiters is included. The resulting scheme can be viewed as a symmetrical algorithm with a variety of numerical dissipation terms that are designed for weak solutions of hyperbolic problems. This is a generalization of Roe and Davis's recent works to a wider class of symmetric schemes other than Lax-Wendroff. The main properties of the present class of schemes are that they can be implicit, and when steady state calculations are sought, the numerical solution is independent of the time step.

Yee, H. C.↗
NASA NTRS1992

Adaptive explicit and implicit finite element methods for transient thermal analysis

The application of adaptive finite element methods to the solution of transient heat conduction problems in two dimensions is investigated. The computational domain is represented by an unstructured assembly of linear triangular elements and the mesh adaptation is achieved by local regeneration of the grid, using an error estimation procedure coupled to an automatic triangular mesh generator. Two alternative solution procedures are considered. In the first procedure, the solution is advanced by explicit timestepping, with domain decomposition being used to improve the computational efficiency of the method. In the second procedure, an algorithm for constructing continuous lines which pass only once through each node of the mesh is employed. The lines are used as the basis of a fully implicit method, in which the equation system is solved by line relaxation using a block tridiagonal equation solver. The numerical performance of the two procedures is compared for the analysis of a problem involving a moving heat source applied to a convectively cooled cylindrical leading edge.

Probert, E. J.↗
NASA NTRS1989

Application and implementation of transient algorithms in computer programs

A brief introduction is given to the nonlinear finite element programs developed at Lawrence Livermore National Laboratory. The four programs are DYNA3D and DYNA2D, which are explicit hydrocodes, and NIKE3D and NIKE2D, which are implicit programs. The main emphasis is on DYNA3D with asides about the other programs. During the past year several new features were added to DYNA3D, and major improvements were made in the computational efficiency of the shell and beam elements. Most of these new features and improvements will eventually make their way into the other programs. The emphasis in the computational mechanics effort was always, and continues to be, efficiency. To get the most out of the supercomputers, all Crays, the programs were vectorized where possible. Several of the more interesting capabilities of DYNA3D will be described and the impact on efficiency will be discussed. Some of the recent work on NIKE3D and NIKE2D will also be presented. In the belief that a single example is worth a thousand equations, the theory is skipped entirely and the examples presented.

Benson, David J.↗
NASA NTRS1989

Parabolized Navier-Stokes algorithm for chemically reacting flows

A second-order parabolized Navier-Stokes algorithm based on the MacCormack (1969) explicit scheme is used to study three-dimensional chemically reacting flows with finite-rate chemistry. The method can treat the chemical source term implicitly, and it accounts for the multicomponent diffusion and convection of the chemical species. The method is demonstrated with the nonreacting case of a Mach-3 flow over a double-wedge compression corner and the case of streamwise hydrogen injection at sonic velocity in a Mach-2.44 vitiated air stream.

Kamath, H.↗
NASA NTRS1991

An implicit method for the nonlinear modelling and simulation of piezoceramic actuators displaying hysteresis

Experiments have shown that piezoceramic materials display a nonlinear relationship between the applied electric field and the actuation strain. This relationship also displays a substantial hysteresis upon reversal of the applied field. In this paper, piezoceramic actuator models are incorporated into the structural equations of motion to arrive at a set of nonlinear actively controlled structural equations of motion. A new implicit algorithm for determining the time history of the actively controlled structure is presented. The algorithm employs the trapezoidal rule for stepping the equations forward in time. The algorithm is compared to an explicit algorithm and is shown to provide greater numerical accuracy. In addition, the numerical stability and convergence characteristics are presented via example. The new algorithm displays convergence and stability properties that are comparable to the standard trapezoidal rule used for dynamic systems without hysteresis.

Leigh, Timothy D.↗
NASA NTRS1993

Flexible language constructs for large parallel programs

The goal of the research described is to develop flexible language constructs for writing large data parallel numerical programs for distributed memory (MIMD) multiprocessors. Previously, several models have been developed to support synchronization and communication. Models for global synchronization include SIMD (Single Instruction Multiple Data), SPMD (Single Program Multiple Data), and sequential programs annotated with data distribution statements. The two primary models for communication include implicit communication based on shared memory and explicit communication based on messages. None of these models by themselves seem sufficient to permit the natural and efficient expression of the variety of algorithms that occur in large scientific computations. An overview of a new language that combines many of these programming models in a clean manner is given. This is done in a modular fashion such that different models can be combined to support large programs. Within a module, the selection of a model depends on the algorithm and its efficiency requirements. An overview of the language and discussion of some of the critical implementation details is given.

Rosing, Matthew↗
DOE OSTI2020

thornado-transport: Anderson- and GPU-accelerated nonlinear solvers for neutrino-matter coupling

Algorithms for neutrino-matter coupling in core-collapse supernovae (CCSNe) are investigated in the context of a spectral two-moment model, which is discretized in space with the discontinuous Galerkin method, integrated in time with implicit-explicit (IMEX) methods, and implemented in the toolkit for high-order neutrino-radiation hydrodynamics (thornado). The model considers electron neutrinos and antineutrinos and tabulated opacities from Bruenn (1985), which includes neutrino-electron scattering and pair processes. The nonlinear system arising from implicit time discretization of the equations governing neutrino-matter coupling is iterated to convergence using Anderson-accelerated fixed-point methods, which avoid formation of Jacobians and inversion of dense linear systems. Numerical experiments show that, for a given tolerance, a nested iteration scheme which aims to reduce opacity evaluations can lower the computational cost. Our initial port to GPUs, using both OpenMP and OpenACC, shows an overall speedup of up to ~ 100× when compared to results using a single CPU core. These results indicate that the algorithms implemented in thornado are well-suited to GPU acceleration.

Laiu, Paul↗
NASA NTRS1993

Stability of mixing layers

The research program for the first year of this project (see the original research proposal) consists of developing an explicit marching scheme for solving the parabolized stability equations (PSE). Performing mathematical analysis of the computational algorithm including numerical stability analysis and the determination of the proper boundary conditions needed at the boundary of the computation domain are implicit in the task. Before one can solve the parabolized stability equations for high-speed mixing layers, the mean flow must first be found. In the past, instability analysis of high-speed mixing layer has mostly been performed on mean flow profiles calculated by the boundary layer equations. In carrying out this project, it is believed that the boundary layer equations might not give an accurate enough nonparallel, nonlinear mean flow needed for parabolized stability analysis. A more accurate mean flow can, however, be found by solving the parabolized Navier-Stokes equations. The advantage of the parabolized Navier-Stokes equations is that its accuracy is consistent with the PSE method. Furthermore, the method of solution is similar. Hence, the major part of the effort of the work of this year has been devoted to the development of an explicit numerical marching scheme for the solution of the Parabolized Navier-Stokes equation as applied to the high-seed mixing layer problem.

Tam, Christopher↗
DOE OSTI2018

Generalized, Energy-conserving Numerical Simulations of Particles in General Relativity. I. Time-like and Null Geodesics

The numerical integration of particle trajectories in curved spacetimes is fundamental for obtaining realistic models of the particle dynamics around massive compact objects such as black holes and neutron stars. Generalized algorithms capable of handling generic metrics are needed for studies of both standard (Schwarzschild and Kerr metrics) and nonstandard (e.g., Schwarzschild metric plus nonclassical perturbations or multiple black hole metrics) spacetimes. The most commonly employed explicit numerical schemes (e.g., Runge–Kutta) are incapable of producing highly accurate results at critical points, e.g., in the regions close to the event horizon where gravity causes extreme curvature of the spacetime, at an acceptable computational cost. In this work we describe a generalized algorithm for the numerical integration of time-like (massive particles) and null (photons) geodesics in any given 3 + 1 split spacetime. We introduce a new, exactly energy-conserving implicit integration scheme based on the preservation of the underlying Hamiltonian, and we compare its properties with a standard fourth-order Runge–Kutta explicit scheme and an implicit midpoint scheme. We test the numerical performance of the three schemes against analytic solutions of particle and photon orbits in Schwarzschild and Kerr spacetimes. We additionally prove the versatility of our framework in handling more exotic metrics, such as Morris–Thorne wormholes and quantum-perturbed Schwarzschild black holes. The generalized method is also discussed in the perspective of future extensions to more complex particle dynamics, e.g., the addition of the Lorentz force acting on charged particles, which allows for test particle diagnostics in GRMHD simulations.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1986

Numerical study of supersonic combustion using a finite rate chemistry model

The governing equations of two-dimensional chemically reacting flows are presented together with a global two-step chemistry model for H2-air combustion. The explicit unsplit MacCormack finite difference algorithm is used to advance the discrete system of the governing equations in time until convergence is attained. The source terms in the species equations are evaluated implicitly to alleviate stiffness associated with fast reactions. With implicit source terms, the species equations give rise to a block-diagonal system which can be solved very efficiently on vector-processing computers. A supersonic reacting flow in an inlet-combustor configuration is calculated for the case where H2 is injected into the flow from the side walls and the strut. Results of the calculation are compared against the results obtained by using a complete reaction model.

Chitsomboon, T.↗