Search NASA⌕ Search

SEARCH · Search NASA

Results for “Implicit method”

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 721 records · Page 40

A unified formulation of splitting-based implicit time integration schemes

Splitting-based time integration approaches such as fractional step, alternating direction implicit, operator splitting, and locally one dimensional methods partition the system of interest into components, and solve individual components implicitly in a cost-effective way. Here this work proposes a unified formulation of splitting time integration schemes in the framework of general-structure additive Runge–Kutta (GARK) methods. Specifically, we develop implicit-implicit (IMIM) GARK schemes, provide the order conditions for this class, and explain their application to partitioned systems of ordinary differential equations. We show that classical splitting methods belong to the IMIM GARK family, and therefore can be studied in this unified framework. New IMIM-GARK splitting methods are developed and tested using parabolic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Towards a Scalable Fully-Implicit Fully-coupled Resistive MHD Formulation with Stabilized FE Methods

This paper presents an initial study that is intended to explore the development of a scalable fully-implicit stabilized unstructured finite element (FE) capability for low-Mach-number resistive MHD. The discussion considers the development of the stabilized FE formulation and the underlying fully-coupled preconditioned Newton-Krylov nonlinear iterative solver. To enable robust, scalable and efficient solution of the large-scale sparse linear systems generated by the Newton linearization, fully-coupled algebraic multilevel preconditioners are employed. Verification results demonstrate the expected order-of-acuracy for the stabilized FE discretization of a 2D vector potential form for the steady and transient solution of the resistive MHD system. In addition, this study puts forth a set of challenging prototype problems that include the solution of an MHD Faraday conduction pump, a hydromagnetic Rayleigh-Bernard linear stability calculation, and a magnetic island coalescence problem. Initial results that explore the scaling of the solution methods are presented on up to 4096 processors for problems with up to 64M unknowns on a CrayXT3/4. Additionally, a large-scale proof-of-capability calculation for 1 billion unknowns for the MHD Faraday pump problem on 24,000 cores is presented.

99 GENERAL AND MISCELLANEOUS↗

Fast Transient And Spatially Non-Homogenous Accident Analysis Of Two-Dimensional Cylindrical Nuclear Reactor

The research about fast transient and spatially non-homogenous nuclear reactor accident analysis of two-dimensional nuclear reactor has been done. This research is about prediction of reactor behavior is during accident. In the present study, space-time diffusion equation is solved by using direct methods which consider spatial factor in detail during nuclear reactor accident simulation. Set of equations that obtained from full implicit finite-difference discretization method is solved by using iterative methods ADI (Alternating Direct Implicit). The indication of accident is decreasing macroscopic absorption cross-section that results large external reactivity. The power reactor has a peak value before reactor has new balance condition. Changing of temperature reactor produce a negative Doppler feedback reactivity. The reactivity will reduce excess positive reactivity. Temperature reactor during accident is still in below fuel melting point which is in secure condition.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A collision-based hybrid method for the BGK equation

In this article, we apply the collision-based hybrid method introduced by Hauck and McClarren to the Boltzmann equation with the BGK operator and a hyperbolic scaling. An implicit treatment of the source term is used to handle stiffness associated with the BGK operator. Although it helps the numerical scheme become stable with a large time step size, it is still not obvious to achieve the desired order of accuracy due to the relationship between the size of the spatial cell and the mean free path. Without asymptotic preserving property, a very restricted grid size is required to resolve the mean free path, which is not practical. Our approaches are based on the noncollision-collision decomposition of the BGK equation. We introduce the arbitrary order of nodal discontinuous Galerkin (DG) discretization in space with a semi-implicit time-stepping method; we employ the backward Euler time integration for the uncollided equation and the 2nd order predictor-corrector scheme for the collided equation, i.e., both source terms in uncollided and collided equations are treated implicitly and only streaming term in the collided equation is solved explicitly. This improves the computational efficiency without the complexity of the numerical implementation. Numerical results are presented for various Knudsen numbers to present the effectiveness and accuracy of our hybrid method. Also, we compare the solutions of the hybrid and non-hybrid schemes.

97 MATHEMATICS AND COMPUTING↗

Nonlinear Asymptotic Integration Algorithms for One-dimensional Autonomous Dissipative First-order Odes

Nonlinear asymptotic integrators are applied to one-dimensional, nonlinear, autonomous, dissipative, ordinary differential equations. These integrators, including a one-step explicit, a one-step implicit, and a one- and two-step midpoint algorithm, are designed to follow the asymptotic behavior of a system approaching a steady state. The methods require that the differential equation be written in a particular asymptotic form. This is always possible for a one-dimensional equation with a globally asymptotic steady state. In this case, conditions are obtained to guarantee that the implicit algorithms are well defined. Further conditions are determined for the implicit methods to be contractive. These methods are all first order accurate, while under certain conditions the midpoint algorithms may also become second order accurate. The stability of each method is investigated and an estimate of the local error is provided.

Haslach, Henry W., Jr.↗

High-Order Mesh Morphing for Boundary and Interface Fitting to Implicit Geometries

Here, we propose a method that morphs high-order meshes such that their boundaries and interfaces coincide/align with implicitly defined geometries. Our focus is particularly on the case when the target surface is prescribed as the zero isocontour of a smooth discrete function. Common examples of this scenario include using level set functions to represent material interfaces in multimaterial configurations, and evolving geometries in shape and topology optimization. The proposed method formulates the mesh optimization problem as a variational minimization of the sum of a chosen mesh-quality metric using the Target-Matrix Optimization Paradigm (TMOP) and a penalty term that weakly forces the selected faces of the mesh to align with the target surface. The distinct features of the method are use of a source mesh to represent the level set function with sufficient accuracy, and adaptive strategies for setting the penalization weight and selecting the faces of the mesh to be fit to the target isocontour of the level set field. We demonstrate that the proposed method is robust for generating boundary- and interface-fitted meshes for curvilinear domains using different element types in 2D and 3D.

97 MATHEMATICS AND COMPUTING↗

Explicit and implicit compact high-resolution shock-capturing methods for multidimensional Euler equations 1: Formulation

Two classes of explicit compact high-resolution shock-capturing methods for the multidimensional compressible Euler equations for fluid dynamics are constructed. Some of these schemes can be fourth-order accurate away from discontinuities. For the semi-discrete case their shock-capturing properties are of the total variation diminishing (TVD), total variation bounded (TVB), total variation diminishing in the mean (TVDM), essentially nonoscillatory (ENO), or positive type of scheme for 1-D scalar hyperbolic conservation laws and are positive schemes in more than one dimension. These fourth-order schemes require the same grid stencil as their second-order non-compact cousins. One class does not require the standard matrix inversion or a special numerical boundary condition treatment associated with typical compact schemes. Due to the construction, these schemes can be viewed as approximations to genuinely multidimensional schemes in the sense that they might produce less distortion in spherical type shocks and are more accurate in vortex type flows than schemes based purely on one-dimensional extensions. However, one class has a more desirable high-resolution shock-capturing property and a smaller operation count in 3-D than the other class. The extension of these schemes to coupled nonlinear systems can be accomplished using the Roe approximate Riemann solver, the generalized Steger and Warming flux-vector splitting or the van Leer type flux-vector splitting. Modification to existing high-resolution second- or third-order non-compact shock-capturing computer codes is minimal. High-resolution shock-capturing properties can also be achieved via a variant of the second-order Lax-Friedrichs numerical flux without the use of Riemann solvers for coupled nonlinear systems with comparable operations count to their classical shock-capturing counterparts. The simplest extension to viscous flows can be achieved by using the standard fourth-order compact or non-compact formula for the viscous terms.

Yee, H. C.↗

Conservation properties of numerical integration methods for systems of ordinary differential equations

If a system of ordinary differential equations represents a property conserving system that can be expressed linearly (e.g., conservation of mass), it is then desirable that the numerical integration method used conserve the same quantity. It is shown that both linear multistep methods and Runge-Kutta methods are 'conservative' and that Newton-type methods used to solve the implicit equations preserve the inherent conservation of the numerical method. It is further shown that a method used by several authors is not conservative.

Rosenbaum, J. S.↗

Multiscale Failure Analysis of Laminated Composite Panels Subjected to Blast Loading Using FEAMAC/Explicit

This preliminary report demonstrates the capabilities of the recently developed software implementation that links the Generalized Method of Cells to explicit finite element analysis by extending a previous development which tied the generalized method of cells to implicit finite elements. The multiscale framework, which uses explicit finite elements at the global-scale and the generalized method of cells at the microscale is detailed. This implementation is suitable for both dynamic mechanics problems and static problems exhibiting drastic and sudden changes in material properties, which often encounter convergence issues with commercial implicit solvers. Progressive failure analysis of stiffened and un-stiffened fiber-reinforced laminates subjected to normal blast pressure loads was performed and is used to demonstrate the capabilities of this framework. The focus of this report is to document the development of the software implementation; thus, no comparison between the results of the models and experimental data is drawn. However, the validity of the results are assessed qualitatively through the observation of failure paths, stress contours, and the distribution of system energies.

Pineda, Evan J.↗

Numerical methods for one-dimensional reaction-diffusion equations arising in combustion theory

A review of numerical methods for one-dimensional reaction-diffusion equations arising in combustion theory is presented. The methods reviewed include explicit, implicit, quasi-linearization, time linearization, operator-splitting, random walk and finite-element techniques and methods of lines. Adaptive and nonadaptive procedures are also reviewed. These techniques are applied first to solve two model problems which have exact traveling wave solutions with which the numerical results can be compared. This comparison is performed in terms of both the wave profile and computed wave speed. It is shown that the computed wave speed is not a good indicator of the accuracy of a particular method. A fourth-order time-linearized, Hermitian compact operator technique is found to be the most accurate method for a variety of time and space sizes.

Ramos, J. I.↗

Investigation of source location determination from Magsat magnetic anomalies: The Euler method approach

The applicability of the Euler method of source location determination was investigated on several model situations pertinent to satellite-data scale situations as well as Magsat data of Europe. Our investigations enabled us to understand the end-member cases for which the Euler method will work with the present satellite magnetic data and also the cases for which the assumptions implicit in the Euler method will not be met by the present satellite magnetic data. These results have been presented in one invited lecture at the Indo-US workshop on Geomagnetism in Studies of the Earth's Interior in August 1994 in Pune, India, and at one presentation at the 21st General Assembly of the IUGG in July 1995 in Boulder, CO. A new method, called Anomaly Attenuation Rate (AAR) Method (based on the Euler method), was developed during this study. This method is scale-independent and is appropriate to locate centroids of semi-compact three dimensional sources of gravity and magnetic anomalies. The method was presented during 1996 Spring AGU meeting and a manuscript describing this method is being prepared for its submission to a high-ranking journal. The grant has resulted in 3 papers and presentations at national and international meetings and one manuscript of a paper (to be submitted shortly to a reputable journal).

Ravat, Dhananjay↗

High resolution viscous fingering simulation in miscible displacement using a p-adaptive discontinuous Galerkin method with algebraic multigrid preconditioner

High resolution simulation of viscous fingering can offer an accurate and detailed prediction for subsurface engineering processes involving fingering phenomena. The fully implicit discontinuous Galerkin (DG) method has been shown to be an accurate and stable method to model viscous fingering with high Peclet number and mobility ratio. In this study, we present two techniques to speedup large scale simulations of this kind. The first technique relies on a simple p-adaptive scheme in which high order basis functions are employed only in elements near the finger fronts where the concentration has a sharp change. As a result, the number of degrees of freedom is significantly reduced and the simulation yields almost identical results to the more expensive simulation with uniform high order elements throughout the mesh. The second technique for speedup involves improving the solver efficiency. We present an algebraic multigrid (AMG) preconditioner which allows the DG matrix to leverage the robust AMG preconditioner designed for the continuous Galerkin (CG) finite element method. The resulting preconditioner works effectively for fixed order DG as well as p-adaptive DG problems. Finally, with the improvements provided by the p-adaptivity and AMG preconditioning, we can perform high resolution three-dimensional viscous fingering simulations required for miscible displacement with high Peclet number and mobility ratio in greater detail than before for well injection problems.

97 MATHEMATICS AND COMPUTING↗

Temporal and spatial inconsistencies of time-split finite-difference schemes

The properties of an implicit time-split algorithm, which utilizes locally one dimensional spatial steps, are examined using the two-dimensional heat conduction equation as the test problem. Both temporal and spatial inconsistencies inherent in the scheme are identified. A consistent, implicit splitting approach is developed. The relationship between this method and other time-split implicit schemes is explained, and stability problems encountered with the method in three dimensions are discussed.

Dwoyer, D. L.↗

Evaluation of a Multigrid Scheme for the Incompressible Navier-Stokes Equations

A fast multigrid solver for the steady, incompressible Navier-Stokes equations is presented. The multigrid solver is based upon a factorizable discrete scheme for the velocity-pressure form of the Navier-Stokes equations. This scheme correctly distinguishes between the advection-diffusion and elliptic parts of the operator, allowing efficient smoothers to be constructed. To evaluate the multigrid algorithm, solutions are computed for flow over a flat plate, parabola, and a Karman-Trefftz airfoil. Both nonlifting and lifting airfoil flows are considered, with a Reynolds number range of 200 to 800. Convergence and accuracy of the algorithm are discussed. Using Gauss-Seidel line relaxation in alternating directions, multigrid convergence behavior approaching that of O(N) methods is achieved. The computational efficiency of the numerical scheme is compared with that of Runge-Kutta and implicit upwind based multigrid methods.

Swanson, R. C.↗

Upwind relaxation algorithms for Euler/Navier-Stokes equations

A description of and results from a solution algorithm for the compressible Navier-Stokes equations are presented. The main features of the algorithm are second or third order accurate upwind discretization of the convection and pressure derivatives and a relaxation scheme for the unfactored implicit backward Euler time method, implemented in a finite-volume formulation. Upwind methods were successfully used to obtain solutions to the Euler equations for flows with strong shock waves. The particular upwind method being used is based on the flux vector splitting technique developed by Van Leer and both second and third order accurate discretizations were developed. Currently, the most widely used implicit solution technique for the Navier-Stokes equations use approximate factorization (AF) methods to treat multidimensional problems. The time integration scheme being used in the present algorithm corresponds to a line Gauss-Seidel relaxation method. This method produces good convergence rates for steady-state flows, and most of the algorithm was vectorized on the NASA Langley VPS 32 computer. The Navier-Stokes algorithm was tested for several two-dimensional flow problems. Solutions for the problems gave excellent results. The presented effort is directed toward the extension of the scheme to the full three-dimensional Navier-Stokes equations.

Thomas, J. L.↗