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 433 records · Page 24

LSENS, The NASA Lewis Kinetics and Sensitivity Analysis Code

A general chemical kinetics and sensitivity analysis code for complex, homogeneous, gas-phase reactions is described. The main features of the code, LSENS (the NASA Lewis kinetics and sensitivity analysis code), are its flexibility, efficiency and convenience in treating many different chemical reaction models. The models include: static system; steady, one-dimensional, inviscid flow; incident-shock initiated reaction in a shock tube; and a perfectly stirred reactor. In addition, equilibrium computations can be performed for several assigned states. An implicit numerical integration method (LSODE, the Livermore Solver for Ordinary Differential Equations), which works efficiently for the extremes of very fast and very slow reactions, is used to solve the "stiff" ordinary differential equation systems that arise in chemical kinetics. For static reactions, the code uses the decoupled direct method to calculate sensitivity coefficients of the dependent variables and their temporal derivatives with respect to the initial values of dependent variables and/or the rate coefficient parameters. Solution methods for the equilibrium and post-shock conditions and for perfectly stirred reactor problems are either adapted from or based on the procedures built into the NASA code CEA (Chemical Equilibrium and Applications).

Radhakrishnan, K.↗

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.↗

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↗

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.↗

Counterrotating prop-fan simulations which feature a relative-motion multiblock grid decomposition enabling arbitrary time-steps

Improvements are presented of a computer algorithm developed for the time-accurate flow analysis of rotating machines. The flow model is a finite volume method utilizing a high-resolution approximate Riemann solver for interface flux definitions. The numerical scheme is a block LU implicit iterative-refinement method which possesses apparent unconditional stability. Multiblock composite gridding is used to orderly partition the field into a specified arrangement of blocks exhibiting varying degrees of similarity. Block-block relative motion is achieved using local grid distortion to reduce grid skewness and accommodate arbitrary time step selection. A general high-order numerical scheme is applied to satisfy the geometric conservation law. An even-blade-count counterrotating unducted fan configuration is chosen for a computational study comparing solutions resulting from altering parameters such as time step size and iteration count. The solutions are compared with measured data.

Janus, J. Mark↗

Analysis of implicit second-order upwind-biased stencils

Truncation error and stability properties of several implicit upwind schemes for the two-dimensional Euler equations are examined. The schemes use linear data reconstruction methods to achieve second-order flux integrations where the implicit Jacobian operators are first order. The stability properties of the schemes are examined by a Von Neumann analysis of the linearized, constant-coefficient Euler equations. The choice of the data reconstruction method used to evaluate the flux integral has a dramatic effect on the convergence properties of the implicit solution method. In particular, the typical one-dimensional data reconstruction methods used with structured grids exhibit poor convergence properties compared to the unstructured grid method considered. Of the schemes examined, the one with the superior convergence properties is well-suited for both unstructured and structured grids, which has important implications for the design of implicit methods.

Roberts, Thomas W.↗

Implicit Priors in Galaxy Cluster Mass and Scaling Relation Determinations

Deriving the total masses of galaxy clusters from observations of the intracluster medium (ICM) generally requires some prior information, in addition to the assumptions of hydrostatic equilibrium and spherical symmetry. Often, this information takes the form of particular parametrized functions used to describe the cluster gas density and temperature profiles. In this paper, we investigate the implicit priors on hydrostatic masses that result from this fully parametric approach, and the implications of such priors for scaling relations formed from those masses. We show that the application of such fully parametric models of the ICM naturally imposes a prior on the slopes of the derived scaling relations, favoring the self-similar model, and argue that this prior may be influential in practice. In contrast, this bias does not exist for techniques which adopt an explicit prior on the form of the mass profile but describe the ICM non-parametrically. Constraints on the slope of the cluster mass-temperature relation in the literature show a separation based the approach employed, with the results from fully parametric ICM modeling clustering nearer the self-similar value. Given that a primary goal of scaling relation analyses is to test the self-similar model, the application of methods subject to strong, implicit priors should be avoided. Alternative methods and best practices are discussed.

Mantz, A.↗

Calculations of three-dimensional flows using the isenthalpic Euler equations with implicit flux-vector splitting

A numerical method for solving the isenthalpic form of the Euler equations is developed. The method is based on the concept of flux vector splitting in its implicit form applied to a cell centered finite volume scheme. Approximate factorization is implemented in solving the implicit part of the governing equations. Time marching to a steady state solution requires short computational times due to the relative efficiency of the basic method. Computational times are further reduced by the implementation of multigrid. Results for several basic cases are shown.

Cannizzaro, Frank E.↗

Collocation and Galerkin Time-Stepping Methods

We study the numerical solutions of ordinary differential equations by one-step methods where the solution at tn is known and that at t(sub n+1) is to be calculated. The approaches employed are collocation, continuous Galerkin (CG) and discontinuous Galerkin (DG). Relations among these three approaches are established. A quadrature formula using s evaluation points is employed for the Galerkin formulations. We show that with such a quadrature, the CG method is identical to the collocation method using quadrature points as collocation points. Furthermore, if the quadrature formula is the right Radau one (including t(sub n+1)), then the DG and CG methods also become identical, and they reduce to the Radau IIA collocation method. In addition, we present a generalization of DG that yields a method identical to CG and collocation with arbitrary collocation points. Thus, the collocation, CG, and generalized DG methods are equivalent, and the latter two methods can be formulated using the differential instead of integral equation. Finally, all schemes discussed can be cast as s-stage implicit Runge-Kutta methods.

Huynh, H. T.↗

When ancient numerical demons meet physics-informed machine learning: adjoint-based gradients for implicit differentiable modeling

Recent advances in differentiable modeling, a genre of physics-informed machine learning that trains neural networks (NNs) together with process-based equations, have shown promise in enhancing hydrological models' accuracy, interpretability, and knowledge-discovery potential. Current differentiable models are efficient for NN-based parameter regionalization, but the simple explicit numerical schemes paired with sequential calculations (operator splitting) can incur numerical errors whose impacts on models' representation power and learned parameters are not clear. Implicit schemes, however, cannot rely on automatic differentiation to calculate gradients due to potential issues of gradient vanishing and memory demand. Here we propose a “discretize-then-optimize” adjoint method to enable differentiable implicit numerical schemes for the first time for large-scale hydrological modeling. The adjoint model demonstrates comprehensively improved performance, with Kling–Gupta efficiency coefficients, peak-flow and low-flow metrics, and evapotranspiration that moderately surpass the already-competitive explicit model. Therefore, the previous sequential-calculation approach had a detrimental impact on the model's ability to represent hydrological dynamics. Furthermore, with a structural update that describes capillary rise, the adjoint model can better describe baseflow in arid regions and also produce low flows that outperform even pure machine learning methods such as long short-term memory networks. The adjoint model rectified some parameter distortions but did not alter spatial parameter distributions, demonstrating the robustness of regionalized parameterization. Despite higher computational expenses and modest improvements, the adjoint model's success removes the barrier for complex implicit schemes to enrich differentiable modeling in hydrology.

58 GEOSCIENCES↗