Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical solver”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 1,711 records · Page 95

Boltzmann-Electron Model in Aleph.

We apply the Boltzmann-electron model in the electrostatic, particle-in-cell, finite- element code Aleph to a plasma sheath. By assuming a Boltzmann energy distribution for the electrons, the model eliminates the need to resolve the electron plasma fre- quency, and avoids the numerical "grid instability" that can cause unphysical heating of electrons. This allows much larger timesteps to be used than with kinetic electrons. Ions are treated with the standard PIC algorithm. The Boltzmann-electron model re- quires solution of a nonlinear Poisson equation, for which we use an iterative Newton solver (NOX) from the Trilinos Project. Results for the spatial variation of density and voltage in the plasma sheath agree well with an analytic model

Hughes, Thomas Patrick↗

Petascale Computing Enabling Technologies Project Final Report

The Petascale Computing Enabling Technologies (PCET) project addressed challenges arising from current trends in computer architecture that will lead to large-scale systems with many more nodes, each of which uses multicore chips. These factors will soon lead to systems that have over one million processors. Also, the use of multicore chips will lead to less memory and less memory bandwidth per core. We need fundamentally new algorithmic approaches to cope with these memory constraints and the huge number of processors. Further, correct, efficient code development is difficult even with the number of processors in current systems; more processors will only make it harder. The goal of PCET was to overcome these challenges by developing the computer science and mathematical underpinnings needed to realize the full potential of our future large-scale systems. Our research results will significantly increase the scientific output obtained from LLNL large-scale computing resources by improving application scientist productivity and system utilization. Our successes include scalable mathematical algorithms that adapt to these emerging architecture trends and through code correctness and performance methodologies that automate critical aspects of application development as well as the foundations for application-level fault tolerance techniques. PCET's scope encompassed several research thrusts in computer science and mathematics: code correctness and performance methodologies, scalable mathematics algorithms appropriate for multicore systems, and application-level fault tolerance techniques. Due to funding limitations, we focused primarily on the first three thrusts although our work also lays the foundation for the needed advances in fault tolerance. In the area of scalable mathematics algorithms, our preliminary work established that OpenMP performance of the AMG linear solver benchmark and important individual kernels on Atlas did not match the predictions of our simple initial model. Our investigations demonstrated that a poor default memory allocation mechanism degraded performance. We developed a prototype NUMA library to provide generic mechanisms to overcome these issues, resulting in significantly improved OpenMP performance. After additional testing, we will make this library available to all users, providing a simple means to improve threading on LLNL's production Linux platforms. We also made progress on developing new scalable algorithms that target multicore nodes. We designed and implemented a new AMG interpolation operator with improved convergence properties for very low complexity coarsening schemes. This implementation will also soon be available to LLNL's application teams as part of the hypre library. We presented results for both topics in an invited plenary talk entitled 'Efficient Sparse Linear Solvers for Multi-Core Architectures' at the 2009 HPCMP Institutes Annual Meeting/CREATE Annual All-Hands Meeting. The interpolation work was summarized in a talk entitled 'Improving Interpolation for Aggressive Coarsening' at the 14th Copper Mountain Conference on Multigrid Methods and in a research paper that will appear in Numerical Linear Algebra with Applications. In the area of code correctness, we significantly extended our behavior equivalence class identification mechanism. Specifically, we not only demonstrated it works well at very large scales but we also added the ability to classify MPI tasks not only by function call traces, but also by specific call sites (source code line numbers) being executed by tasks. More importantly, we developed a new technique to determine relative logical execution progress of tasks in the equivalence classes by combining static analysis with our original dynamic approach. We applied this technique to a correctness issue that arose at 4096 tasks during the development of the new AMG interpolation operator discussed above. This scale isat the limit of effectiveness of production tools, but our technique quickly located the erroneous source code, demonstrating the power of understanding relationships between behavioral equivalence classes. This work is the subject of a paper recently accepted to SC09, as well as a presentation entitled 'Providing Order to Extreme Scale Debugging Chaos' given at the ParaDyn Week annual conference in College Park, MD. In addition to this theoretical extension, we have made significant progress in developing a front end for this tool set, and the front-end is now available on several of LLNL's largescale computing resources. In addition, we explored mechanisms to identify exact locations of erroneous MPI usage in application source code. In this work, we developed a new model that led to a highly efficient algorithm for detecting deadlock during dynamic software testing. This work was the subject of a well-received paper at ICS 2009 [4].

99 GENERAL AND MISCELLANEOUS↗

DNS of strong shock and turbulence interactions with thermochemical non-equilibrium effects

The underlying physics in shock and turbulence interaction is essential for a better understanding of many natural processes as well as scientific and engineering applications, such as volcanic eruption, supernova explosion, detonation, medical application of shock wave lithotripsy to break up kidney stones, and energy application of the implosion of a cryogenic fuel capsule for inertial confinement fusion. One of the fundamental building blocks in these complex processes and applications is the canonical problem of isotropic turbulence and a normal shock. Unfortunately, even this fundamental problem is not well understood for strong shocks. Recent direct numerical simulation (DNS) results of perfect gas flow showed some new trends in turbulent statistics as mean Mach number is increased. In this paper, we first conduct extensive DNS studies on canonical strong shock and turbulence interaction problem of perfect gas flow with mean Mach numbers ranging from 2 to 30. The results show that strong shock waves have a significant effect on turbulent statistics. However, gas temperature increases dramatically after strong shocks so that numerical simulations based on perfect gas flow may not be enough. The effects of thermochemical nonequilibrium flow including internal energy excitations, translation-vibration energy relaxation, and chemical reactions among different species need to be considered. Therefore, we have developed and tested a new high-order shock-fitting solver for non-equilibrium flow simulations based on the 5-species air chemistry and recently thermal non-equilibrium models.

Wang, Xiaowen↗

Algebraic turbulence models for the computation of two-dimensional high speed flows using unstructured grids

The incorporation of algebraic turbulence models in a solver for the 2-D compressible Navier-Stokes equations using triangular grids is described. A practical way to use the Cebeci Smith model, and to modify it in separated regions is proposed. The ability of the model to predict high speed, perfect gas boundary layers is investigated from a numerical point of view.

Rostand, Philippe↗

Algebraic turbulence models for the computation of two-dimensional high-speed flows using unstructured grids

The incorporation of algebraic turbulence models in a solver for the 2-D compressible Navier-Stokes equations using triangular grids is described. A practial way to use the Cebeci Smith model, and to modify it in separated regions is proposed. The ability of the model to predict high speed, perfect gas boundary layers is investigated from a numerical point of view.

Rostand, Philippe↗

Staggered solution procedures for multibody dynamics simulation

A computational procedure is presented for the direct integration of the multibody dynamical (MBD) equations with constraints. Numerical experiments conducted with this MBD procedure indicate that it yields robust solutions in cases where the step size furnishes more than 20 samples for the period of highest apparent response frequency in a given multibody system. The MBD solution procedure is implemented in two separate modules: the generalized coordinated solver, 'CINT', and the constraint Lagrange multiplier solver, 'LINT'.

Park, K. C.↗

Towards Optimal Multigrid Efficiency for the Navier-Stokes Equations

A fast multigrid solver for the steady incompressible Navier-Stokes equations is presented. Unlike time-marching schemes, this approach uses relaxation of the steady equations. Application of this method results in a discretization that correctly distinguishes between the advection and elliptic parts of the operator, allowing efficient smoothers to be constructed. Numerical solutions are shown for flow over a flat plate and a Karman-Trefftz airfoil. Using collective Gauss-Seidel line relaxation in both the vertical and horizontal directions, multigrid convergence behavior approaching that of O(N) methods is achieved. The computational efficiency of the numerical scheme is compared with that of a Runge-Kutta based multigrid method.

Swanson, R. C.↗

Iterated Discontinuity Factors Based on Reference Outgoing Currents for Discontinuous Finite Element Diffusion

We present a novel formulation for iteratively computing Discontinuity Factors (DF) designed to reproduce reference partial outgoing currents at the interface between macro-regions using Discontinuous Galerkin Finite Elements to solve the multigroup neutron diffusion equation. Similarly, an expression for the boundary coefficients (BCf) is proposed to match the partial outgoing current at vacuum boundaries. Upon convergence, macro-region averaged reaction and leakage rates are preserved. In addition, we consider a source-free steady-state problem depending on the DFs. The existence of a non-trivial solution is due to the non-linearity of the problem. This form greatly simplifies the implementation within Rattlesnake and efficiently converges by updating the DFs and BCfs at every linear iteration of the Preconditioned Jacobian-Free Newton-Krylov solver. The main challenge then lies in determining an appropriate scaling factor to ensure that the initial values for the DFs and BCfs are not too far from their converged value. While this factor does not change the final solution, it has the potential to significantly affect convergence, for purely numerical reasons. An expression based on the reference fission source integral is proposed and satisfying results are presented for problems and compared to Superhomogénéisation (SPH) results with both reflecting and vacuum boundary conditions.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Iterated Discontinuity Factors Based on Reference Outgoing Currents for Discontinuous Finite Element Diffusion

We present a novel formulation for iteratively computing Discontinuity Factors (DF) designed to reproduce reference partial outgoing currents at the interface between macro-regions using Discontinuous Galerkin Finite Elements to solve the multigroup neutron diffusion equation. Similarly, an expression for the boundary coefficients (BCf) is proposed to match the partial outgoing current at vacuum boundaries. Upon convergence, macro-region averaged reaction and leakage rates are preserved. In addition, we consider a source-free steady-state problem depending on the DFs. The existence of a non-trivial solution is due to the non-linearity of the problem. This form greatly simplifies the implementation within Rattlesnake and efficiently converges by updating the DFs and BCfs at every linear iteration of the Preconditioned Jacobian-Free Newton-Krylov solver. The main challenge then lies in determining an appropriate scaling factor to ensure that the initial values for the DFs and BCfs are not too far from their converged value. While this factor does not change the final solution, it has the potential to significantly affect convergence, for purely numerical reasons. An expression based on the reference fission source integral is proposed and satisfying results are presented for problems and compared to Superhomogénéisation (SPH) results with both reflecting and vacuum boundary conditions.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Status and Ongoing Developments for the GeN-Foam Multi-Physics Solver

An open-source multi-physics solver for nuclear reactor analysis, named GeN-Foam (Generalized Nuclear Foam), is being developed by the Laboratory for Reactor Physics and System Behavior at the PSI and at the EPFL. The objective is to supplement available legacy codes with a modern, flexible tool making use of the most recent numerical methodologies. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A multi-dimensional Vlasov-Fokker-Planck code for arbitrarily anisotropic high-energy-density plasmas

To study the kinetic physics of High-Energy-Density Laboratory Plasmas, we have developed the parallel relativistic 2D3P Vlasov-Fokker-Planck code Oshun. The numerical scheme uses a Cartesian mesh in configuration-space and incorporates a spherical harmonic expansion of the electron distribution function in momentum-space. The expansion is truncated such that the necessary angular resolution of the distribution function is retained for a given problem. Finite collisionality causes rapid decay of the high-order harmonics, thereby providing a natural truncation mechanism for the expansion. The code has both fully explicit and implicit field-solvers and employs a linearized Fokker-Planck collision operator. Oshun has been benchmarked against well-known problems, in the highly kinetic limit to model collisionless relativistic instabilities, and in the hydrodynamic limit to recover transport coefficients. The performance of the code, its applicability, and its limitations are discussed in the context of simple problems with relevance to inertial fusion energy.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

New correlated numerical methods for attosecond molecular single and double ionization

This project resulted in the development of ASTRA, a new molecular ionization code capable of describing single and double ionization processes in polyatomic molecules with correlated electrons and time-dependent fields. Key achievements include: (i) the development of the PRISM hybrid-integral library enabling core-ionization and high-angular-momentum convergence; (ii) implementation of time-dependent Schrödinger equation solvers for pump–probe spectroscopies; (iii) validation against experimental and theoretical benchmarks for atoms and molecules; and (iv) extension to two-photon double ionization using the finite-pulse virtual-sequential model. These developments establish ASTRA as a versatile platform for attosecond molecular dynamics.

74 ATOMIC AND MOLECULAR PHYSICS↗

A unified gas-kinetic scheme for continuum and rarefied flows IV: Full Boltzmann and model equations

Fluid dynamic equations are valid in their respective modeling scales, such as the particle mean free path scale of the Boltzmann equation and the hydrodynamic scale of the Navier–Stokes (NS) equations. With a variation of the modeling scales, theoretically there should have a continuous spectrum of fluid dynamic equations. Even though the Boltzmann equation is claimed to be valid in all scales, many Boltzmann solvers, including direct simulation Monte Carlo method, require the cell resolution to the order of particle mean free path scale. Therefore, they are still single scale methods. In order to study multiscale flow evolution efficiently, the dynamics in the computational fluid has to be changed with the scales. A direct modeling of flow physics with a changeable scale may become an appropriate approach. The unified gas-kinetic scheme (UGKS) is a direct modeling method in the mesh size scale, and its underlying flow physics depends on the resolution of the cell size relative to the particle mean free path. The cell size of UGKS is not limited by the particle mean free path. With the variation of the ratio between the numerical cell size and local particle mean free path, the UGKS recovers the flow dynamics from the particle transport and collision in the kinetic scale to the wave propagation in the hydrodynamic scale. The previous UGKS is mostly constructed from the evolution solution of kinetic model equations. Even though the UGKS is very accurate and effective in the low transition and continuum flow regimes with the time step being much larger than the particle mean free time, it still has space to develop more accurate flow solver in the region, where the time step is comparable with the local particle mean free time. In such a scale, there is dynamic difference from the full Boltzmann collision term and the model equations. This work is about the further development of the UGKS with the implementation of the full Boltzmann collision term in the region where it is needed. The central ingredient of the UGKS is the coupled treatment of particle transport and collision in the flux evaluation across a cell interface, where a continuous flow dynamics from kinetic to hydrodynamic scales is modeled. The newly developed UGKS has the asymptotic preserving (AP) property of recovering the NS solutions in the continuum flow regime, and the full Boltzmann solution in the rarefied regime. In the mostly unexplored transition regime, the UGKS itself provides a valuable tool for the non-equilibrium flow study. The mathematical properties of the scheme, such as stability, accuracy, and the asymptotic preserving, will be analyzed in this paper as well.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Scalable Interior‐Point Gauss–Newton Method for PDE‐Constrained Optimization With Bound Constraints

Here, we present a scalable approach to solve a class of partial differential equation (PDE)‐constrained optimization problems with bound constraints. This approach utilizes a robust full‐space interior‐point (IP)‐Gauss–Newton optimization method. To cope with the poorly‐conditioned IP‐Gauss–Newton saddle‐point linear systems that need to be solved approximately, once per optimization step, we propose two spectrally related preconditioners. These preconditioners leverage the limited informativeness of data in regularized PDE‐constrained optimization problems. A block Gauss–Seidel preconditioner is proposed for the GMRES‐based solution of the IP‐Gauss–Newton linear systems. It is shown, for a large‐class of PDE‐ and bound‐constrained optimization problems, that the spectrum of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix is asymptotically independent of discretization and is not impacted by the ill‐conditioning that notoriously plagues interior‐point methods. We exploit symmetry of the IP‐Gauss–Newton linear systems and propose a regularization and log‐barrier Hessian preconditioner for the preconditioned conjugate gradient (PCG)‐based solution of the equivalent IP‐Gauss–Newton–Schur complement linear systems. The eigenvalues of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix, that are not equal to one, are identical to the eigenvalues of the regularization and log‐barrier Hessian preconditioned Schur complement matrix. The scalability of the approach is demonstrated on two example problems. The numerical solution of these optimization problems is shown to require a discretization independent number of IP‐Gauss–Newton linear solves. Furthermore, the linear systems are solved in a discretization and IP ill‐conditioning independent number of preconditioned Krylov subspace iterations. The parallel scalability of the preconditioner, achieved via algebraic multigrid component solvers when applicable, and the aforementioned algorithmic scalability permits a parallel scalable means to compute solutions of a large class of PDE‐ and bound‐constrained problems.

PDE-constrained optimization↗

Sylvester-preconditioned adaptive-rank implicit time integrators for advection-diffusion equations with variable coefficients

Here, we consider the adaptive-rank integration of multi-dimensional time-dependent advection-diffusion partial differential equations (PDEs) with variable coefficients. We employ a standard finite-difference method for spatial discretization coupled with high-order diagonally implicit Runge-Kutta temporal schemes. The discrete equation is a generalized Sylvester equation (GSE), which we solve with a projection-based adaptive-rank algorithm structured around two key strategies: (i) constructing dimension-wise subspaces using a novel atypical extended Krylov strategy, and (ii) efficiently solving the basis coefficient matrix with a preconditioned GMRES solver. The low-rank decomposition is performed in 2D using SVD and with high-order SVD (HOSVD) in 3D to represent the tensor in a compressed Tucker format. For d-dimensional problems (here, d = 2 or 3), the computational complexity and memory storage of the approach are found numerically to scale as and $\mathscr{O}(Nr^2) + \mathscr{O} (r^{d+1})$ and $\mathscr{O}(Nr) + \mathscr{O} (r^{d})$, respectively, with the one-dimensional resolution and the maximal rank during the Krylov iteration (which we find to be largely independent of on our numerical examples). We present numerical examples that illustrate the advertised properties of the algorithm.

97 MATHEMATICS AND COMPUTING↗

Summer Proceedings 2016: The Center for Computing Research at Sandia National Laboratories

Solving sparse linear systems from the discretization of elliptic partial differential equations (PDEs) is an important building block in many engineering applications. Sparse direct solvers can solve general linear systems, but are usually slower and use much more memory than effective iterative solvers. To overcome these two disadvantages, a hierarchical solver (LoRaSp) based on H2-matrices was introduced in [22]. Here, we have developed a parallel version of the algorithm in LoRaSp to solve large sparse matrices on distributed memory machines. On a single processor, the factorization time of our parallel solver scales almost linearly with the problem size for three-dimensional problems, as opposed to the quadratic scalability of many existing sparse direct solvers. Moreover, our solver leads to almost constant numbers of iterations, when used as a preconditioner for Poisson problems. On more than one processor, our algorithm has significant speedups compared to sequential runs. With this parallel algorithm, we are able to solve large problems much faster than many existing packages as demonstrated by the numerical experiments.

97 MATHEMATICS AND COMPUTING↗

A Contextually-Aware Sensitivity Analysis to Guide the Design of Randomized Least Squares Solvers in Applications

Our work on the DOE-sponsored project “A Contextually-Aware Sensitivity Analysis to Guide the Design of Randomized Least Squares Solvers in Applications,” was an effort to address critical challenges in nu merical computing and its applications to optimization. The increasing demand for robust and scalable solutions to large-scale linear algebra problems has highlighted the limitations of traditional approaches, particularly in heterogeneous and extreme-scale computing environments. Randomized Numerical Linear Algebra (RandNLA) offers a promising framework to address these challenges, and this proposal builds on this foundation by introducing innovations in sensitivity analysis and computational adaptability.

97 MATHEMATICS AND COMPUTING↗

Time-domain finite elements in optimal control with application to launch-vehicle guidance

A time-domain finite element method is developed for optimal control problems. The theory derived is general enough to handle a large class of problems including optimal control problems that are continuous in the states and controls, problems with discontinuities in the states and/or system equations, problems with control inequality constraints, problems with state inequality constraints, or problems involving any combination of the above. The theory is developed in such a way that no numerical quadrature is necessary regardless of the degree of nonlinearity in the equations. Also, the same shape functions may be employed for every problem because all strong boundary conditions are transformed into natural or weak boundary conditions. In addition, the resulting nonlinear algebraic equations are very sparse. Use of sparse matrix solvers allows for the rapid and accurate solution of very difficult optimization problems. The formulation is applied to launch-vehicle trajectory optimization problems, and results show that real-time optimal guidance is realizable with this method. Finally, a general problem solving environment is created for solving a large class of optimal control problems. The algorithm uses both FORTRAN and a symbolic computation program to solve problems with a minimum of user interaction. The use of symbolic computation eliminates the need for user-written subroutines which greatly reduces the setup time for solving problems.

Bless, Robert R.↗