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 451 records · Page 25

An AMR capable finite element diffusion solver for ALE hydrocodes [An AMR capable diffusion solver for ALE-AMR]

Here, we present a novel method for the solution of the diffusion equation on a composite AMR mesh. This approach is suitable for including diffusion based physics modules to hydrocodes that support ALE and AMR capabilities. To illustrate, we proffer our implementations of diffusion based radiation transport and heat conduction in a hydrocode called ALE-AMR. Numerical experiments conducted with the diffusion solver and associated physics packages yield 2nd order convergence in the L 2 norm.

42 ENGINEERING↗

Unstructured Unsteady Flow Solver Applicable to MSU TURBO and Computational Design

This paper presents numerical simulations for a high-speed transonic compressor rotor, NASA Rotor 35, using an unstructured grid flow solver U2NCLE. It solves Reynolds averaged Navier-Stokes equations using an arbitrary Mach number solution algorithm. Experiments were conducted at the NASA Glen Research Center to investigate compressor stability enhancement using steady and discrete tip injections. The mass injection upstream of the tip of a high- speed axial compressor rotor has shown effectiveness in suppressing stall in tip-critical rotors. This work presents numerical simulations of a high-speed compressor rotor with and without tip injections. Methods to model the flow injection are described. Numerical simulations are conducted at 80 and 100 percent of the design speed. Results show that numerical solutions are consistent with the experimental trends.

Newman, James C., III↗

A Performance Model for Allocating the Parallelism in a Multigrid-in-Time Solver

The traditional way to numerically solve time-dependent problems is to sequentially march through time, solving for one time step and then the next. The parallelism in this approach is limited to the spatial dimension, which is quickly exhausted, causing the gain from using more processors to solve a problem to diminish. One approach to overcome this barrier is to use methods that are parallel in time. These methods have the potential to achieve dramatically better performance compared to time-stepping approaches, but achieving this performance requires carefully choosing the amount of parallelism devoted to space versus the amount devoted to time. Here, we present a performance model that, for a multigrid-in-time solver, makes the decision on when to switch to parallel-in-time and on how much parallelism to devote to space vs. time. In our experiments, the model selects the best parallel configuration in most of our test cases and a configuration close to the best one in all other cases.

97 MATHEMATICS AND COMPUTING↗

Numerical simulation of compressible fluid-dynamics in the chamber of inertial fusion energy systems

Here, this paper aims to establish new and innovative modeling capabilities for analyzing chambers in Inertial Fusion Energy (IFE) systems. IFE is emerging as a promising method to achieve fusion power production, but several challenges must be overcome to develop an IFE pilot plant or deploy commercial IFE systems. These challenges are both theoretical and technical, encompassing a deeper understanding of the underlying physical phenomena and the development of new technologies and materials. One of the needs is to develop mathematical models to describe IFE systems and numerical tools to simulate them. This paper contributes to this endeavor by presenting a new OpenFOAM solver for IFE systems, focusing on gas dynamics in their chambers. The analysis and development of chamber designs will play a significant role in the transition from single-shot experiments to high-repetition rates, as there is a need to protect the chamber walls from the intense radiation fields produced by fusion reactions. A promising design option, normally referred to as thick wall chamber design, consists in using lithium or molten salt jet arrays within the chamber. A critical phenomenon is the venting of high-pressure gases from the center to the external part of the chamber, passing through the blanket array. This process involves the propagation and attenuation of strong pressure waves, requiring suitable modeling approaches for compressible fluid-dynamics. The solver proposed in this work implements a multi-material hydrodynamics model tailored to accurately describe the non-linear propagation of pressure waves while avoiding numerical oscillation issues typical of high-velocity compressible simulation. This solver is verified against numerical test cases, validated against experimental data, and applied to the analysis of the High-Yield Lithium-Injection Fusion-Energy (HYLIFE-I) concept. The relevance of this paper is threefold. Firstly, it contributes to developing and testing modeling approaches for compressible fluid-dynamics phenomena, with specific focus on the new and unexplored topic of IFE thick-liquid-wall blanket modeling. Secondly, it marks one of the first applications of the OpenFOAM library in the research field of IFE systems. Finally, the investigated problem is of practical interest for IFE developers, as it provides useful indications about relevant phenomena in pressure wave propagation in the chamber of these systems.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Vidyut3d: A GPU accelerated fluid solver for non-equilibrium plasmas on adaptive grids

We present the numerical methods, programming methodology, verification, and performance assessment of a non-equilibrium plasma fluid solver that can effectively utilize current and upcoming central processing and graphics processing unit (CPU+GPU) architectures, in this work. Our plasma fluid model solves the coupled conservation equations for species transport, electrostatic Poisson and electron temperature on adaptive Cartesian grids. Our solver is written using performance portable adaptive-grid/particle management library, AMReX, and is portable over widely available vendor specific GPU architectures. We present verification of our solver using method of manufactured solutions that indicate formal second order accuracy with central diffusion and fifth-order weighted-essentially-non-oscillatory (WENO) advection scheme. We also verify our solver with published literature on capacitive discharges and atmospheric pressure streamer propagation. We demonstrate the use of our solver on two 3D simulation cases: an atmospheric streamer propagation in Ar-H2 mixtures and a low pressure three-electrode radio frequency reactor. Our performance studies on three different CPU+GPU architectures indicate ~ 150-400X speed-up using AMD and NVIDIA GPUs per time step compared to a single CPU core for a 4 million cell simulation with 15 species.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Vidyut3d: A Gpu Accelerated Fluid Solver for Non-Equilibrium Plasmas on Adaptive Grids

We present the numerical methods, programming methodology, verification, and performance assessment of a non-equilibrium plasma fluid solver that can effectively utilize current and upcoming central processing and graphics processing unit (CPU+GPU) architectures, in this work. Our plasma fluid model solves the coupled conservation equations for species transport, electrostatic Poisson and electron temperature on adaptive Cartesian grids. Our solver is written using performance portable adaptive-grid/particle management library, AMReX, and is portable over widely available vendor specific GPU architectures. We present verification of our solver using method of manufactured solutions that indicate formal second order accuracy with central diffusion and fifth-order weighted-essentially-non-oscillatory (WENO) advection scheme. We also verify our solver with published literature on capacitive discharges and atmospheric pressure streamer propagation. We demonstrate the use of our solver on two 3D simulation cases: an atmospheric streamer propagation in Ar-H2 mixtures and a low pressure twin electrode radio frequency reactor. Our performance studies on three different CPU+GPU architectures indicate approximately 150-400X speed-up using AMD and NVIDIA GPUs per time step compared to a single CPU core for a 4 million cell simulation with 15 species.

Sitaraman, Hariswaran↗

On numerical errors to the fields surrounding a relativistically moving particle in PIC codes

The particle-in-cell (PIC) method is widely used to model the self-consistent interaction between discrete particles and electromagnetic fields. It has been successfully applied to problems across plasma physics including plasma based acceleration, inertial confinement fusion, magnetically confined fusion, space physics, astrophysics, high energy density plasmas. In many cases the physics involves how relativistic particles (those with high relativistic γ factors) are generated and interact with plasmas. However, when relativistic particles stream across the grid, both in “vacuum” and in plasma, many numerical issues may arise which can lead to unphysical results. We present a detailed analysis of how discretized Maxwell solvers used in PIC codes can lead to numerical errors to the fields that surround particles that move at relativistic speeds across the grid. Expressions for the axial electric field as integrals in k space are presented that reveal two types of errors. The first arises from errors to the numerator of the integrand and leads to unphysical fields that are antisymmetric about the particle. Furthermore, the second arises from errors to the denominator of the integrand and lead to Cherenkov like radiation in “vacuum”. These fields are not anti-symmetric, extend behind the particle, and cause the particle to accelerate or decelerate depending on the solver and parameters. The unphysical fields are studied in detail for two representative solvers - the Yee solver and the FFT based solver. Although the Cherenkov fields are absent, the space charge fields are still present in the fundamental Brillouin zone for the FFT based solvers. In addition, the Cherenkov fields are present in higher order zones for the FFT based solvers. Comparison between the analytical solutions and PIC simulation results are presented. A solution for eliminating these unphysical fields by modifying the k operator in the axial direction is also presented. Using a customized finite difference solver, this solution was successfully implemented into OSIRIS [1]. Results from the customized solver are also presented. Additionally, this solution will be useful for a beam of particles that all move in one direction with a small angular divergence.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A robust and efficient finite volume method for compressible inviscid and viscous two-phase flows [A robust and efficient finite volume method for compressible viscous two-phase flows]

A robust and efficient density-based finite volume method is developed for solving the six-equation single pressure system of two-phase flows at all speeds on hybrid unstructured grids. Unlike conventional approaches where an expensive exact Riemann solver is normally required for computing numerical fluxes at the two-phase interfaces in addition to AUSM-type fluxes for single-phase interfaces in order to maintain stability and robustness in cases involving interactions of strong pressure and void-fraction discontinuities, a volume-fraction coupling term for the AUSM + -up fluxes is introduced in this work to impart the required robustness without the need of the exact Riemann solver. The resulting method is significantly less expensive in regions where otherwise the Riemann solver would be invoked. A transformation from conservative variables to primitive variables is presented and the primitive variables are then solved in the implicit method in order for the current finite volume method to be able to solve, effectively and efficiently, low Mach number flows in traditional multiphase applications, which otherwise is a great challenge for the standard density-based algorithms. Here, a number of benchmark test cases are presented to assess the performance and robustness of the developed finite volume method for both inviscid and viscous two-phase flow problems. The numerical results indicate that the current density-based method provides an attractive and viable alternative to its pressure-based counterpart for compressible two-phase flows at all speeds.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Incorporating the Min-Max Mesh Optimization Method within the Target-Matrix Paradigm

The Target-Matrix Optimization Paradigm (TMOP) is a method for improving mesh quality via node movement. Through the use of appropriate pre-defined quality metrics and Target-matrices, TMOP provides the ability to define mesh quality in terms of element shape, volume, and edge orientation as a function of position within the mesh, thus facilitating high-level goals such as size-adapted meshing. The Paradigm is developed further in this paper by showing how it can be applied to the problem of improving the mesh in locations where the quality is the worst. Improving the worst quality portions of a mesh was investigated by Freitag, Amenta, and others, who showed that the problem can be formulated as a min-max optimization problem. The Target-paradigm is used to extend the previous work in two important respects. First, by using quality metrics from the Target-paradigm, quality can be user-specified via Target-matrices instead of the quality definition being hard-wired into the quality metric. Second, by making use of the sample point concept in TMOP, one can extend min-max mesh optimization to non-simplicial element types such as quadrilaterals. Numerical experiments were performed to illustrate these extensions and to investigate their utility. A non-gradient solver known as the amoeba was used to numerically compute the optimal solutions. This derivative-free method, in conjunction with the use of barrier metrics from TMOP, enables the solution of the min-max problem without the use of explicit constraints to guarantee that the optimal mesh is non-inverted. The experiments showed that the use of Target-metrics in min-max with triangle (or tetrahedral) element meshes is able to effectively improve the worst quality elements in terms of shape or in terms of size+shape. The experiments also showed that the mesh min-max extension to quadrilateral element meshes can lead to acceptable meshes using barrier metrics from the Target-paradigm, provided that inter-element mesh smoothness is not important. Poor behavior was observed when using non-barrier Target-metrics in min-max with quadrilateral element meshes. For both simplicial and quadrilateral meshes, the min-sum method can be competitive with min-max, however.

97 MATHEMATICS AND COMPUTING↗

Compressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions

Here, compressive sensing is a powerful technique for recovering sparse solutions of underdetermined linear systems, which is often encountered in uncertainty quantification analysis of expensive and high-dimensional physical models. We perform numerical investigations employing several compressive sensing solvers that target the unconstrained LASSO formulation, with a focus on linear systems that arise in the construction of polynomial chaos expansions. With core solvers l1_ls, SpaRSA, CGIST, FPC_AS, and ADMM, we develop techniques to mitigate overfitting through an automated selection of regularization constant based on cross-validation, and a heuristic strategy to guide the stop-sampling decision. Practical recommendations on parameter settings for these techniques are provided and discussed. The overall method is applied to a series of numerical examples of increasing complexity, including large eddy simulations of supersonic turbulent jet-in-crossflow involving a 24-dimensional input. Through empirical phase-transition diagrams and convergence plots, we illustrate sparse recovery performance under structures induced by polynomial chaos, accuracy, and computational trade-offs between polynomial bases of different degrees, and practicability of conducting compressive sensing for a realistic, high-dimensional physical application. Across test cases studied in this paper, we find ADMM to have demonstrated empirical advantages through consistent lower errors and faster computational times.

97 MATHEMATICS AND COMPUTING↗

Numerical Study of Multigrid Methods with Various Smoothers for the Elliptical Grid Generation Equations

A robust solver for the elliptic grid generation equations is sought via a numerical study. The system of PDEs is discretized with finite differences, and multigrid methods are applied to the resulting nonlinear algebraic equations. Multigrid iterations are compared with respect to the robustness and efficiency. Different smoothers are tried to improve the convergence of iterations. The methods are applied to four 2D grid generation problems over a wide range of grid distortions. The results of the study help to select smoothing schemes and the overall multigrid procedures for elliptic grid generation.

Golik, W. L.↗

A Proposed Global Optimum Algebraic Iterative Solver for Modeling of Lattice Element Errors

Model-based electron accelerator control is the maintenance of optimal parameters of an electron beam such as its orbit, size, and shape, as well as machine parameters such as tunes. It works well when the model reflects reality. SLAC pioneered this technique in SPEAR about thirty decades ago. Similar techniques are now employed in particle accelerator and synchrotron laboratories around the world. There is still an inherently complex problem related to the employment of such techniques to manage the operation and analysis of accelerators and storage rings. The problem arises from the use by those techniques of complex numerical algorithms commonly known as nonlinear solvers that are difficult to control and operate. Lessons learned at SLAC have led to the development of a new, simple-to-use, and iterative nonlinear solver that holds much promise not only in advancing the derivation of errors in accelerators and storage rings at SLAC, but also in its ability to tackle a range of complex engineering problems. We intend to further develop and validate this nonlinear solver for robust SLAC accelerator and other applications.

ACCSYS↗

Multilevel well modeling in aggregation-based nonlinear multigrid for multiphase flow in porous media

A full approximation scheme (FAS) nonlinear multigrid solver for two-phase flow and transport problems driven by wells with multiple perforations is developed here. It is an extension to our previous work on FAS solvers for diffusion and transport problems. The solver is applicable to discrete problems defined on unstructured grids as the coarsening algorithm is aggregation-based and algebraic. To construct coarse basis that can better capture the radial flow near wells, coarse grids in which perforated well cells are not near the coarse-element interface are desired. This is achieved by an aggregation algorithm proposed in this paper that makes use of the location of well cells in the cell-connectivity graph. Numerical examples in which the FAS solver is compared against Newton's method on benchmark problems are given. In particular, for a refined version of the SAIGUP model, the FAS solver is at least 35% faster than Newton's method for time steps with a CFL number greater than 10.

58 GEOSCIENCES↗

Systematically improvable multiscale solver for correlated electron systems

The development of numerical methods capable of simulating realistic materials with strongly correlated electrons, with controllable errors, is a central challenge in quantum many-body physics. Here we describe a framework for a general multiscale method based on embedding a self-energy of a strongly correlated subsystem into a self-energy generated by a method able to treat large weakly correlated systems approximately. As an example, we present the embedding of an exact diagonalization self-energy into a self-energy generated from self-consistent second-order perturbation theory. Using a quantum impurity model, generated from a cluster dynamical mean field approximation to the two-dimensional Hubbard model, as a benchmark, we illustrate that our method allows us to obtain accurate results at a fraction of the cost of typical Monte Carlo calculations. We test the method in multiple regimes of interaction strengths and dopings of the model. Here, the general embedding framework we present avoids difficulties such as double counting corrections, frequency-dependent interactions, or vertex functions. As it is solely formulated at the level of the single-particle Green's function, it provides a promising route for the simulation of realistic materials that are currently difficult to study with other methods.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

An implicit three-dimensional Navier-Stokes solver for compressible flow

A three-dimensional numerical method based on the lower-upper symmetric-Gauss-Seidel implicit scheme in conjunction with the flux-limited dissipation model is developed for solving the compressible Navier-Stokes equations. A new computer code which is based on this method requires only 9 microsec per grid-point per iteration on a single processor of a Cray YMP computer and executes at the sustained rate of 170 MFLOPS. A reduction of 4 orders of magnitude in the residual for a high Reynolds number flow using 230 K grid points is obtained in 24 minutes. The computational results compare well with available experimental data.

Yoon, Seokkwan↗

A multiscale two-point flux-approximation method

A large number of multiscale finite-volume methods have been developed over the past decade to compute conservative approximations to multiphase flow problems in heterogeneous porous media. In particular, several iterative and algebraic multiscale frameworks that seek to reduce the fine-scale residual towards machine precision have been presented. Common for all such methods is that they rely on a compatible primal–dual coarse partition, which makes it challenging to extend them to stratigraphic and unstructured grids. Herein, we propose a general idea for how one can formulate multiscale finite-volume methods using only a primal coarse partition. To this end, we use two key ingredients that are computed numerically: (i) elementary functions that correspond to flow solutions used in transmissibility upscaling, and (ii) partition-of-unity functions used to combine elementary functions into basis functions. We exemplify the idea by deriving a multiscale two-point flux-approximation (MsTPFA) method, which is robust with regards to strong heterogeneities in the permeability field and can easily handle general grids with unstructured fine- and coarse-scale connections. The method can easily be adapted to arbitrary levels of coarsening, and can be used both as a standalone solver and as a preconditioner. Several numerical experiments are presented to demonstrate that the MsTPFA method can be used to solve elliptic pressure problems on a wide variety of geological models in a robust and efficient manner.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Schur-decomposition for 3D matrix equations and its application in solving radiative discrete ordinates equations discretized by Chebyshev collocation spectral method

The Schur-decomposition for three-dimensional matrix equations is developed and used to directly solve the radiative discrete ordinates equations which are discretized by Chebyshev collocation spectral method. Three methods, say, the spectral methods based on 2D and 3D matrix equation solvers individually, and the standard discrete ordinates method, are presented. The numerical results show the good accuracy of spectral method based on direct solvers. The CPU time cost comparisons against the resolutions between these three methods are made using MATLAB and FORTRAN 95 computer languages separately. The results show that the CPU time cost of Chebyshev collocation spectral method with 3D Schur-decomposition solver is the least, and almost only one thirtieth to one fiftieth CPU time is needed when using the spectral method with 3D Schur-decomposition solver compared with the standard discrete ordinates method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Where did the tumor start? An inverse solver with sparse localization for tumor growth models

In this work, we present a numerical scheme for solving an inverse problem for parameter estimation in tumor growth models for glioblastomas, a form of aggressive primary brain tumor. The growth model is a reaction–diffusion partial differential equation (PDE) for the tumor concentration. We use a PDE-constrained optimization formulation for the inverse problem. The unknown parameters are the reaction coefficient (proliferation), the diffusion coefficient (infiltration), and the initial condition field for the tumor PDE. Segmentation of magnetic resonance imaging (MRI) scans drive the inverse problem where segmented tumor regions serve as partial observations of the tumor concentration. Like most cases in clinical practice, we use data from a single time snapshot. Moreover, the precise time relative to the initiation of the tumor is unknown, which poses an additional difficulty for inversion. We perform a frozen-coefficient spectral analysis and show that the inverse problem is severely ill-posed. We introduce a biophysically motivated regularization on the structure and magnitude of the tumor initial condition. In particular, we assume that the tumor starts at a few locations (enforced with a sparsity constraint on the initial condition of the tumor) and that the initial condition magnitude in the maximum norm is equal to one. We solve the resulting optimization problem using an inexact quasi-Newton method combined with a compressive sampling algorithm for the sparsity constraint. Our implementation uses PETSc and AccFFT libraries. We conduct numerical experiments on synthetic and clinical images to highlight the improved performance of our solver over a previously existing solver that uses standard two-norm regularization for the calibration parameters. The existing solver is unable to localize the initial condition. Our new solver can localize the initial condition and recover infiltration and proliferation. In clinical datasets (for which the ground truth is unknown), our solver results in qualitatively different solutions compared to the two-norm regularized solver.

97 MATHEMATICS AND COMPUTING↗