Search NASA⌕ Search

SEARCH · Search NASA

Results for “implicit 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.

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

At least 991 records · Page 55

Comparison of three explicit multigrid methods for the Euler and Navier-Stokes equations

Three explicit multigrid methods, Ni's method, Jameson's finite-volume method, and a finite-difference method based on Brandt's work, are described and compared for two model problems. All three methods use an explicit multistage Runge-Kutta scheme on the fine grid, and this scheme is also described. Convergence histories for inviscid flow over a bump in a channel for the fine-grid scheme alone show that convergence rate is proportional to Courant number and that implicit residual smoothing can significantly accelerate the scheme. Ni's method was slightly slower than the implicitly-smoothed scheme alone. Brandt's and Jameson's methods are shown to be equivalent in form but differ in their node versus cell-centered implementations. They are about 8.5 times faster than Ni's method in terms of CPU time. Results for an oblique shock/boundary layer interaction problem verify the accuracy of the finite-difference code. All methods slowed considerably on the stretched viscous grid but Brandt's method was still 2.1 times faster than Ni's method.

Chima, Rodrick V.↗

Comparison of three explicit multigrid methods for the Euler and Navier-Stokes equations

Three explicit multigrid methods, Ni's method, Jameson's finite-volume method, and a finite-difference method based on Brandt's work, are described and compared for two model problems. All three methods use an explicit multistage Runge-Kutta scheme on the fine grid, and this scheme is also described. Convergence histories for inviscid flow over a bump in a channel for the fine-grid scheme alone show that convergence rate is proportional to Courant number and that implicit residual smoothing can significantly accelerate the scheme. Ni's method was slightly slower than the implicitly-smoothed scheme alone. Brandt's and Jameson's methods are shown to be equivalent in form but differ in their node versus cell-centered implementations. They are about 8.5 times faster than Ni's method in terms of CPU time. Results for an oblique shock/boundary layer interaction problem verify the accuracy of the finite-difference code. All methods slowed considerably on the stretched viscous grid but Brandt's method was still 2.1 times faster than Ni's method.

Chima, Rodrick V.↗

Geometrically derived difference formulae for the numerical integration of trajectory problems

The term 'trajectory problem' is taken to include problems that can arise, for instance, in connection with contour plotting, or in the application of continuation methods, or during phase-plane analysis. Geometrical techniques are used to construct difference methods for these problems to produce in turn explicit and implicit circularly exact formulae. Based on these formulae, a predictor-corrector method is derived which, when compared with a closely related standard method, shows improved performance. It is found that this latter method produces spurious limit cycles, and this behavior is partly analyzed. Finally, a simple variable-step algorithm is constructed and tested.

Mcleod, R. J. Y.↗

Towards an IMEX Monolithic ALE Method with Integrated UQ for Multiphysics Shock-hydro

A number of critical science, engineering and advanced technology applications require predictive analysis of complex shock-hydrodynamics of fluid/solid materials with possible electromagnetic interaction. The physical mechanisms include wave-phenomena, material-transport, diffusion, chemical reactions, and electromagnetics. The highly nonlinear multiple-time and length-scale response of these mechanisms include discontinuities formed from shocks, contact surfaces, and complex tabular equations-of-state (EOS). Current dominant computational solution strategies use ad-hoc combinations of operator- splitting, semi-implicit, and explicit time-integration methods and decoupled nonlinear-solvers. While these approaches have enabled progress in forward simulation, the inherited mathematical structure has not provided stability, accuracy and efficiency to resolve all the dynamical time-scales of interest, nor has it enabled integrated fast sensitivity analysis and uncertainty quantification (UQ). This draft report describes initial progress towards developing a new multiphysics shock-hydro capability that is intended to be more robust, mathematically well-structured and can readily be combined with advanced higher-order implicit/explicit (IMEX) time integration and efficient adjoint-enhanced uncertainty quantification (UQ) techniques.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A scalable multidimensional fully implicit solver for Hall magnetohydrodynamics

We propose an optimally performant fully implicit algorithm for the Hall magnetohydrodynamics (HMHD) equations based on multigrid-preconditioned Jacobian-free Newton-Krylov methods. HMHD is a challenging system to solve numerically because it supports stiff fast dispersive waves. The preconditioner is formulated using an operator-split approximate block factorization (Schur complement), informed by physics insight. We use a vector-potential formulation (instead of a magnetic field one) to allow a clean segregation of the problematic $\nabla$ x $\nabla$ x operator in the electron Ohm's law subsystem. This segregation allows the formulation of an effective damped block-Jacobi smoother for multigrid. We demonstrate by analysis that our proposed block-Jacobi iteration is convergent and has the smoothing property. The resulting HMHD solver is verified linearly with wave propagation examples, and nonlinearly with the GEM challenge reconnection problem by comparison against another HMHD code. We demonstrate the excellent algorithmic and parallel performance of the algorithm up to 16384 MPI tasks in two dimensions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Explicit Discontinuous Galerkin Methods for Conservation Laws

The two explicit DG methods in this study are based on a ‘predictor-corrector’ formulation, the first introduced by Lörcher, Gassner, and Munz (2007, 2008) called space–time expansion discontinuous Galerkin or STE-DG scheme, and the second, introduced independently by the author (Huynh 2006, 2013) called the upwind moment scheme. The predictor step of the two methods is essentially identical using a Cauchy-Kovalevsky (CK) procedure, which involves no interaction of the data among neighboring cells. The corrector step also shares the same space-time integration formulation and is where interaction of the data among neighboring cells takes place; the difference, however, is in how the resulting space-time volume integral is estimated. As a consequence of the different estimates, for the case of advection in one spatial dimension (1D), the moment scheme has a CFL (Courant-Friedrichs-Lewy) condition of 1 for all p and is accurate to order 2p+1, i.e., it possesses the super accuracy property, whereas the STE-DG method has a more restrictive CFL condition and is accurate to the expected order of p+1. For 1D advection, compared with the CFL conditions of 1/(2p+1) of standard RK-DG (Runge-Kutta) scheme where space and time discretization are of the same order, the moment scheme allows a significantly larger time step size. It also turns out that the scheme yields a result identical to Van Leer’s scheme III (1977), which amounts to shifting the data a distance of advection corresponding to the time step and projecting the result onto the space of polynomial solutions. Contrary to Van Leer’s approach, however, the space-time ‘predictor-corrector’ formulation facilitates extensions to the case of systems of equations. Concerning 2D extensions, in the case of advection, when the flow is along the diagonal direction, the CFL conditions for the moment schemes become restrictive as will be shown by Fourier (Von Neumann) stability and accuracy analyses. Since the moment scheme employs the right Radau points as collocation points in time, the method is closely related to the implicit Radau IIA scheme, which is stable for any time step size. The role of Radau IIA in relieving stability restriction for these explicit DG schemes remains to be explored

Discontinuous Galerkin↗

A spectral element method for the simulation of unsteady incompressible flows with heat transfer

The spectral element method is a high-order finite element technique for solution of the Navier-Stokes and energy equations. In the isoparametric spectral element discretization, the domain is broken up into general brick elements, and the dependent and independent variables represented as high-order tensor-product Lagrangian interpolants through Chebyshev collocation points. The nonlinear and convective terms in the governing equations are treated with explicit collocation, while the pressure and diffusive contributions are handled implicitly using variational projection operators. The method is applied to flow past a cylinder, flow in grooved channels, and natural convection in an enclosure.

Karniadakis, George E.↗

Efficient discontinuous Galerkin implementations and preconditioners for implicit unsteady compressible flow simulations

This work presents and compares efficient implementations of high-order discontinuous Galerkin methods: a modal matrix-free discontinuous Galerkin (DG) method, a hybridizable discontinuous Galerkin (HDG) method, and a primal formulation of HDG, applied to the implicit solution of unsteady compressible flows. The matrix-free implementation allows for a reduction of the memory footprint of the solver when dealing with implicit time-accurate discretizations. HDG reduces the number of globally-coupled degrees of freedom relative to DG, at high order, by statically condensing element-interior degrees of freedom from the system in favor of face unknowns. The primal formulation further reduces the element-interior degrees of freedom by eliminating the gradient as a separate unknown. This paper introduces a p-multigrid preconditioner implementation for these discretizations and presents results for various flow problems. Benefits of the p-multigrid strategy relative to simpler, less expensive, preconditioners are observed for stiff systems, such as those arising from low-Mach number flows at high-order approximation. The p-multigrid preconditioner also shows excellent scalability for parallel computations. Finally, additional savings in both speed and memory occur with a matrix-free/reduced version of the preconditioner.

97 MATHEMATICS AND COMPUTING↗

Wing flutter boundary prediction using an unsteady Euler aerodynamic method

Modifications to an existing three-dimensional, implicit, upwind Euler/Navier-Stokes code (CFL3D Version 2.1) for the aeroelastic analysis of wings are described. These modifications, which were previously added to CFL3D Version 1.0, include the incorporation of a deforming mesh algorithm and the addition of the structural equations of motion for their simultaneous time-integration with the government flow equations. The paper gives a brief description of these modifications and presents unsteady calculations which check the modifications to the code. Euler flutter results for an isolated 45 degree swept-back wing are compared with experimental data for seven freestream Mach numbers which define the flutter boundary over a range of Mach number from 0.499 to 1.14. These comparisons show good agreement in flutter characteristics for freestream Mach numbers below unity. For freestream Mach numbers above unity, the computed aeroelastic results predict a premature rise in the flutter boundary as compared with the experimental boundary. Steady and unsteady contours of surface Mach number and pressure are included to illustrate the basic flow characteristics of the time-marching flutter calculations and to aid in identifying possible causes for the premature rise in the computational flutter boundary.

Lee-Rausch, Elizabeth M.↗

Distributed Minimal Residual (DMR) method for acceleration of iterative algorithms

A new method for enhancing the convergence rate of iterative algorithms for the numerical integration of systems of partial differential equations was developed. It is termed the Distributed Minimal Residual (DMR) method and it is based on general Krylov subspace methods. The DMR method differs from the Krylov subspace methods by the fact that the iterative acceleration factors are different from equation to equation in the system. At the same time, the DMR method can be viewed as an incomplete Newton iteration method. The DMR method was applied to Euler equations of gas dynamics and incompressible Navier-Stokes equations. All numerical test cases were obtained using either explicit four stage Runge-Kutta or Euler implicit time integration. The formulation for the DMR method is general in nature and can be applied to explicit and implicit iterative algorithms for arbitrary systems of partial differential equations.

Lee, Seungsoo↗

Viscous flow past a nacelle isolated and in proximity of a flat plate

Linearized-theory design procedures have proven to be useful in preliminary design stages of supersonic aircraft configurations. These procedures are impaired, however, by their inability to account for certain nonlinear effects inherent in complicated flows. The present computations are aimed at providing necessary information for correction and improvement of a particular linearized design method. Three-dimensional, viscous, supersonic flows past nacelle and nacelle-flat plate configurations are investigated. The thin-layer Navier-Stokes equations are solved using an implicit, upwind-biased, finite-volume method. A hybrid domain decomposition technique is utilized to ease the grid generation task. Computations were made for an unit Reynolds number of 2.0 million per foot and Freestream Mach numbers of 1.6, 2.0, and 2.3.

Fouladi, Kamran↗

Fully-Implicit Orthogonal Reconstructed Discontinuous Galerkin for Fluid Dynamics with Phase Change

A new reconstructed Discontinuous Galerkin (rDG) method, based on orthogonal basis/test functions, is developed for fluid flows on unstructured meshes. Orthogonality of basis functions is essential for enabling robust and efficient fully-implicit Newton-Krylov based time integration. The method is designed for generic partial differential equations, including transient, hyperbolic, parabolic or elliptic operators, which are attributed to many multiphysics problems. We demonstrate the method’s capabilities for solving compressible fluid-solid systems (in the low Mach number limit), with phase change (melting/solidification), as motivated by applications in Additive Manufacturing (AM). We focus on the method’s accuracy (in both space and time), as well as robustness and solvability of the system of linear equations involved in the linearization steps of Newton-based methods. The performance of the developed method is investigated for highly-stiff problems with melting/solidification, emphasizing the advantages from tight coupling of mass, momentum and energy conservation equations, as well as orthogonality of basis functions, which leads to better conditioning of the underlying (approximate) Jacobian matrices, and rapid convergence of the Krylov-based linear solver.

97 MATHEMATICS AND COMPUTING↗

Development of iterative techniques for the solution of unsteady compressible viscous flows

During the past two decades, there has been significant progress in the field of numerical simulation of unsteady compressible viscous flows. At present, a variety of solution techniques exist such as the transonic small disturbance analyses (TSD), transonic full potential equation-based methods, unsteady Euler solvers, and unsteady Navier-Stokes solvers. These advances have been made possible by developments in three areas: (1) improved numerical algorithms; (2) automation of body-fitted grid generation schemes; and (3) advanced computer architectures with vector processing and massively parallel processing features. In this work, the GMRES scheme has been considered as a candidate for acceleration of a Newton iteration time marching scheme for unsteady 2-D and 3-D compressible viscous flow calculation; from preliminary calculations, this will provide up to a 65 percent reduction in the computer time requirements over the existing class of explicit and implicit time marching schemes. The proposed method has ben tested on structured grids, but is flexible enough for extension to unstructured grids. The described scheme has been tested only on the current generation of vector processor architecture of the Cray Y/MP class, but should be suitable for adaptation to massively parallel machines.

Hixon, Duane↗

Region-oriented CT image representation for reducing computing time of Monte Carlo simulations

Purpose. We propose a new method for efficient particle transportation in voxelized geometry for Monte Carlo simulations. We describe its use for calculating dose distribution in CT images for radiation therapy. Material and methods. The proposed approach, based on an implicit volume representation named segmented volume, coupled with an adapted segmentation procedure and a distance map, allows us to minimize the number of boundary crossings, which slows down simulation. The method was implemented with the GEANT4 toolkit and compared to four other methods: One box per voxel, parameterized volumes, octree-based volumes, and nested parameterized volumes. For each representation, we compared dose distribution, time, and memory consumption. Results. The proposed method allows us to decrease computational time by up to a factor of 15, while keeping memory consumption low, and without any modification of the transportation engine. Speeding up is related to the geometry complexity and the number of different materials used. We obtained an optimal number of steps with removal of all unnecessary steps between adjacent voxels sharing a similar material. However, the cost of each step is increased. When the number of steps cannot be decreased enough, due for example, to the large number of material boundaries, such a method is not considered suitable. Conclusion. This feasibility study shows that optimizing the representation of an image in memory potentially increases computing efficiency. We used the GEANT4 toolkit, but we could potentially use other Monte Carlo simulation codes. The method introduces a tradeoff between speed and geometry accuracy, allowing computational time gain. However, simulations with GEANT4 remain slow and further work is needed to speed up the procedure while preserving the desired accuracy.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

An implicit particle code with exact energy and charge conservation for electromagnetic studies of dense plasmas

A collisional particle code based on implicit energy- and charge-conserving methods is presented. A modified version of the particle-suppressed Jacobian-Free Newton-Krylov method that can enhance the solver efficiency is introduced. Mathematically, it is shown that this new approach can be viewed as a fixed-point iteration method for the particle positions. The model can exactly conserve global energy and local charge and can efficiently use time steps larger than the plasma period. In conclusion, the algorithm's ability to simulate dense plasmas accurately and efficiently is quantified by simulating the dynamic compression of a plasma slab via a magnetic piston in 1D planar geometry.

97 MATHEMATICS AND COMPUTING↗

Incompressible viscous flow computations for the pump components and the artificial heart

A finite difference, three dimensional incompressible Navier-Stokes formulation to calculate the flow through turbopump components is utilized. The solution method is based on the pseudo compressibility approach and uses an implicit upwind differencing scheme together with the Gauss-Seidel line relaxation method. Both steady and unsteady flow calculations can be performed using the current algorithm. Here, equations are solved in steadily rotating reference frames by using the steady state formulation in order to simulate the flow through a turbopump inducer. Eddy viscosity is computed by using an algebraic mixing-length turbulence model. Numerical results are compared with experimental measurements and a good agreement is found between the two.

Kiris, Cetin↗

Incompressible viscous flow computations for the pump components and the artificial heart

A finite-difference, three-dimensional incompressible Navier-Stokes formulation to calculate the flow through turbopump components is utilized. The solution method is based on the pseudocompressibility approach and uses an implicit-upwind differencing scheme together with the Gauss-Seidel line relaxation method. Both steady and unsteady flow calculations can be performed using the current algorithm. In this work, the equations are solved in steadily rotating reference frames by using the steady-state formulation in order to simulate the flow through a turbopump inducer. Eddy viscosity is computed by using an algebraic mixing-length turbulence model. Numerical results are compared with experimental measurements and a good agreement is found between the two. Included in the appendix is a paper on incompressible viscous flow through artificial heart devices with moving boundaries. Time-accurate calculations, such as impeller and diffusor interaction, will be reported in future work.

Kiris, Cetin↗

Computation of incompressible viscous flows through artificial heart devices with moving boundaries

The extension of computational fluid dynamics techniques to artificial heart flow simulations is illustrated. Unsteady incompressible Navier-Stokes equations written in 3-D generalized curvilinear coordinates are solved iteratively at each physical time step until the incompressibility condition is satisfied. The solution method is based on the pseudo compressibility approach and uses an implicit upwind differencing scheme together with the Gauss-Seidel line relaxation method. The efficiency and robustness of the time accurate formulation of the algorithm are tested by computing the flow through model geometries. A channel flow with a moving indentation is computed and validated with experimental measurements and other numerical solutions. In order to handle the geometric complexity and the moving boundary problems, a zonal method and an overlapping grid embedding scheme are used, respectively. Steady state solutions for the flow through a tilting disk heart valve was compared against experimental measurements. Good agreement was obtained. The flow computation during the valve opening and closing is carried out to illustrate the moving boundary capability.

Kiris, Cetin↗