Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “multistep 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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1975

The use of back corrections in multistep methods of numerical integration

Generalized multistep methods for the numerical solution of nonlinear systems of ordinary differential equations are introduced which allow the correction of previously computed values of the solution at internal points of the grid. These methods are shown to possess enhanced numerical stability. Preliminary numerical results indicate that for some satellite orbit problems these methods also possess greater overall efficiency. A uniformly converging theory of error propagation is presented which is valid for nonasymptotic values of the step size. Experimental results are seen to conform with theory.

Beaudet, P.↗
NASA NTRS1995

On the Dynamics of Implicit Linear Multistep Methods

Some new guidelines on the usage of implicit linear multistep methods (LMMs) as time-dependent approaches for obtaining steady-state numerical solutions in computational fluid dynamics (CFD) are explored. The commonly used implicit LMMs in CFD belong to the class of superstable time discretizations. It can be shown that the nonlinear asymptotic behavior in terms of bifurcation diagrams and basins of attractions of these schemes can provide an improved range of initial data and time step over the linearized stability limit.

Yee, H. C.↗
NASA NTRS1976

Multistep methods of numerical integration using back-corrections

A class of linear multistep methods is proposed for the solution of the equations of motion of certain dynamical systems encountered in celestial mechanics and astrodynamics. These methods are distinguished from the classical predictor-corrector methods in that they permit 'back-corrections' of the solution to be made. As the integration advances in time, the numerical solution is corrected or improved at certain points in the past. The enhanced numerical stability of these methods allows the meaningful application of high-order algorithms. Consequently, step sizes larger than those attainable with the classical methods may be adopted, and greater overall efficiency may be realized. These methods are applied to the problem of determining the orbit of an artificial satellite, and the results are compared with those obtained using classical methods.

Feagin, T.↗
NASA NTRS1994

Round-off error in long-term orbital integrations using multistep methods

Techniques for reducing roundoff error are compared by testing them on high-order Stormer and summetric multistep methods. The best technique for most applications is to write the equation in summed, function-evaluation form and to store the coefficients as rational numbers. A larger error reduction can be achieved by writing the equation in backward-difference form and performing some of the additions in extended precision, but this entails a larger central processing unit (cpu) cost.

Quinlan, Gerald D.↗
NASA NTRS1972

On stiffly stable implicit linear multistep methods.

The motivation to increase the step size with no degradation of numerical accuracy and stability has led to the discovery of particular members of the class of stiffly stable implicit linear multistep algorithms. Sufficient conditions for a consistent linear multistep method to be stiffly stable are given. These conditions involve properties of the stability mapping from the extended complex plane onto itself.

Cooke, C. H.↗
NASA NTRS1977

Error behavior of multistep methods applied to unstable differential systems

The problem of modeling a dynamic system described by a system of ordinary differential equations which has unstable components for limited periods of time is discussed. It is shown that the global error in a multistep numerical method is the solution to a difference equation initial value problem, and the approximate solution is given for several popular multistep integration formulas. Inspection of the solution leads to the formulation of four criteria for integrators appropriate to unstable problems. A sample problem is solved numerically using three popular formulas and two different stepsizes to illustrate the appropriateness of the criteria.

Brown, R. L.↗
NASA NTRS1978

Error behaviour of multistep methods applied to unstable differential systems

The problem of modelling a dynamic system described by a system of ordinary differential equations which has unstable components for limited periods of time is discussed. It is shown that the global error in a multistep numerical method is the solution to a difference equation initial value problem, and the approximate solution is given for several popular multistep integration formulae. Inspection of the solution leads to the formulation of four criteria for integrators appropriate to unstable problems. A sample problem is solved numerically using three popular formulae and two different stepsizes to illustrate the appropriateness of the criteria.

Brown, R. L.↗
NASA NTRS1985

A new theory for multistep discretizations of stiff ordinary differential equations: Stability with large step sizes

A large set of variable coefficient linear systems of ordinary differential equations which possess two different time scales, a slow one and a fast one is considered. A small parameter epsilon characterizes the stiffness of these systems. A system of o.d.e.s. in this set is approximated by a general class of multistep discretizations which includes both one-leg and linear multistep methods. Sufficient conditions are determined under which each solution of a multistep method is uniformly bounded, with a bound which is independent of the stiffness of the system of o.d.e.s., when the step size resolves the slow time scale, but not the fast one. This property is called stability with large step sizes. The theory presented lets one compare properties of one-leg methods and linear multistep methods when they approximate variable coefficient systems of stiff o.d.e.s. In particular, it is shown that one-leg methods have better stability properties with large step sizes than their linear multistep counter parts. The theory also allows one to relate the concept of D-stability to the usual notions of stability and stability domains and to the propagation of errors for multistep methods which use large step sizes.

Majda, G.↗
NASA NTRS1974

Comparison of numerical integration techniques for orbital applications

The present work gives a brief comparison of the performance of programs for integrating differential equations for orbital applications. The evaluation criteria and the method of testing are described, and the results of the test problem set are included. Integration methods that were chosen for comparison include high-order Runge-Kutta methods; a rational extrapolation method (Bulirsch and Stoer, 1966); a variable step, variable order, multistep method (Krogh, 1969); classical multistep methods of Adams and Cowell; and modified multistep methods. The high-order Runge-Kutta methods used in the comparison include RKF 7(8) and RKF 8(9) (Fehlberg, 1968), and RKS 8-10 (Shanks, 1966).

Moore, H.↗
DOE OSTI2023

Interface flux recovery framework for constructing partitioned heterogeneous time-integration methods

A common approach for the development of partitioned schemes employing different time integrators on different subdomains is to lag the coupling terms in time. This can lead to accuracy issues, especially in multistage methods. Here, in this article, we present a novel framework for partitioned heterogeneous time-integration methods, which allows the coupling of arbitrary multistage and multistep methods without reducing their order of accuracy. At the core of our approach are accurate estimates of the interface flux obtained from the Schur complement of an auxiliary monolithic system. We use these estimates to construct a polynomial-in-time approximation of the interface flux over the current time coupling window. This approximation provides the interface boundary conditions necessary to decouple the subdomain problems at any point within the coupling window. In so doing our framework enables a flexible choice of time-integrators for the individual subproblems without compromising the time-accuracy at the coupled problem level. This feature is the main distinction between our framework and other approaches. To demonstrate the framework, we construct a family of partitioned heterogeneous time-integration methods, combining multistage and multistep methods, for a simplified tracer transport component of the coupled air-sea system in Earth system models. We report numerical tests evaluating accuracy and flux conservation for different pairs of time-integrators from the explicit Runge-Kutta and Adams-Moulton families.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

SDYN-GANs: Adversarial learning methods for multistep generative models for general order stochastic dynamics

We introduce adversarial learning methods for data-driven generative modeling of dynamics of nth-order stochastic systems. Our approach builds on Generative Adversarial Networks (GANs) with generative model classes based on stable m-step stochastic numerical integrators. From observations of trajectory samples, we introduce methods for learning long-time predictors and stable representations of the dynamics. Our approaches use discriminators based on Maximum Mean Discrepancy (MMD), training protocols using both conditional and marginal distributions, and methods for learning dynamic responses over different time-scales. We show how our approaches can be used for modeling physical systems to learn force-laws, damping coefficients, and noise-related parameters. Our adversarial learning approaches provide methods for obtaining stable generative models for dynamic tasks including long-time prediction and developing simulations for stochastic systems.

• Artificial intelligence (AI) / machine learning ↗