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 55 records · Page 3

Recent advances in the development of implicit schemes for the equations of fluid dynamics

Innovations and extensions of implicit schemes for equations of fluid dynamics are presented. The notation and theory for linear multistep methods are reviewed, and extensions of work by Beam and Warming (1979) include the implementation of one-leg methods, ADI methods for equations with mixed derivatives, flux vector splitting, the P-dimensional wave equation, and boundary conditions. Numerical experiments indicate that implicit treatment of the boundary conditions is necessary for unconditional stability, and the improvement and implementation of the boundary condition theory should improve the implicit algorithms for gas dynamic equations.

Warming, R. F.↗

TDRSS OVLBI experiment - Data correlation and results

The use of an orbiting antenna in a VLBI experiment complicates the data correlation, due to the spacecraft motion and the presence of the satellite-to-ground link. For this experiment, using a TDRSS satellite, a multistep method was used to calculate delay and phase for correlation and fringe-fitting. Data from three sources: 1510-089, NRAO 530 (1730-130), and 174l-038 were successfully correlated. The maximum projected baseline achieved was 1.4 earth diameters, for NRAO 530, with baselines longer than one earth diameter obtained for all three sources. Fringe visibilities for the maximum projected baselines were: 0.15 (1510-089), 0.05 (NRAO 530), and 0.50 (1741-038). The coherence of baselines to the orbiting antenna was 84 percent for 700 seconds. For a dedicated orbiting VLBI observatory (e.g., QUASAT), excellent coherence can be expected for integration times of several hundred seconds and observing frequencies as high as 20-30 GHz.

Linfield, R. P.↗

Geometry control in adaptive truss structures

Forward and inverse kinematics equations are derived for the large geometry maneuver of adaptive trusses. A new algorithm based on higher-order multistep methods is proposed as a means of computing the length control for a described large geometry maneuver. The algorithm is shown to improve in computational speed at least five times over the algorithm presented in an earlier paper. The acceleration in control computation and other features such as varying velocity profiles and curved trajectories are illustrated by simulation results.

Ramesh, A. V.↗

Global Asymptotic Behavior of Iterative Implicit Schemes

The global asymptotic nonlinear behavior of some standard iterative procedures in solving nonlinear systems of algebraic equations arising from four implicit linear multistep methods (LMMs) in discretizing three models of 2 x 2 systems of first-order autonomous nonlinear ordinary differential equations (ODEs) is analyzed using the theory of dynamical systems. The iterative procedures include simple iteration and full and modified Newton iterations. The results are compared with standard Runge-Kutta explicit methods, a noniterative implicit procedure, and the Newton method of solving the steady part of the ODEs. Studies showed that aside from exhibiting spurious asymptotes, all of the four implicit LMMs can change the type and stability of the steady states of the differential equations (DEs). They also exhibit a drastic distortion but less shrinkage of the basin of attraction of the true solution than standard nonLMM explicit methods. The simple iteration procedure exhibits behavior which is similar to standard nonLMM explicit methods except that spurious steady-state numerical solutions cannot occur. The numerical basins of attraction of the noniterative implicit procedure mimic more closely the basins of attraction of the DEs and are more efficient than the three iterative implicit procedures for the four implicit LMMs. Contrary to popular belief, the initial data using the Newton method of solving the steady part of the DEs may not have to be close to the exact steady state for convergence. These results can be used as an explanation for possible causes and cures of slow convergence and nonconvergence of steady-state numerical solutions when using an implicit LMM time-dependent approach in computational fluid dynamics.

Yee, H. C.↗

Dynamical Approach Study of Spurious Steady-State Numerical Solutions of Nonlinear Differential Equations: Global Asymptotic Behavior of Time Discretizations - 2

The global asymptotic nonlinear behavior of 1 1 explicit and implicit time discretizations for four 2 x 2 systems of first-order autonomous nonlinear ordinary differential equations (ODES) is analyzed. The objectives are to gain a basic understanding of the difference in the dynamics of numerics between the scalars and systems of nonlinear autonomous ODEs and to set a baseline global asymptotic solution behavior of these schemes for practical computations in computational fluid dynamics. We show how 'numerical' basins of attraction can complement the bifurcation diagrams in gaining more detailed global asymptotic behavior of time discretizations for nonlinear differential equations (DEs). We show how in the presence of spurious asymptotes the basins of the true stable steady states can be segmented by the basins of the spurious stable and unstable asymptotes. One major consequence of this phenomenon which is not commonly known is that this spurious behavior can result in a dramatic distortion and, in most cases, a dramatic shrinkage and segmentation of the basin of attraction of the true solution for finite time steps. Such distortion, shrinkage and segmentation of the numerical basins of attraction will occur regardless of the stability of the spurious asymptotes, and will occur for unconditionally stable implicit linear multistep methods. In other words, for the same (common) steady-state solution the associated basin of attraction of the DE might be very different from the discretized counterparts and the numerical basin of attraction can be very different from numerical method to numerical method. The results can be used as an explanation for possible causes of error, and slow convergence and nonconvergence of steady-state numerical solutions when using the time-dependent approach for nonlinear hyperbolic or parabolic PDES.

Yee, H. C.↗

The Dynamics of Some Iterative Implicit Schemes

The global asymptotic nonlinear behavior of some standard iterative procedures in solving nonlinear systems of algebraic equations arising from four implicit linear multistep methods (LMMs) in discretizing 2 x 2 systems of first-order autonomous nonlinear ordinary differential equations is analyzed using the theory of dynamical systems. With the aid of parallel Connection Machines (CM-2 and CM-5), the associated bifurcation diagrams as a function of the time step, and the complex behavior of the associated 'numerical basins of attraction' of these iterative implicit schemes are revealed and compared. Studies showed that all of the four implicit LMMs exhibit a drastic distortion and segmentation but less shrinkage of the basin of attraction of the true solution than standard explicit methods. The numerical basins of attraction of a noniterative implicit procedure mimic more closely the basins of attraction of the differential equations than the iterative implicit procedures for the four implicit LMMs.

Yee, H. C.↗

Dynamical Approach Study of Spurious Steady-State Numerical Solutions of Nonlinear Differential Equations: Global Asymptotic Behavior of Time Discretizations - Part 2

The global asymptotic nonlinear behavior of 11 explicit and implicit time discretizations for four 2 x 2 systems of first-order autonomous nonlinear ordinary differential equations (ODEs) is analyzed. The objectives are to gain a basic understanding of the difference in the dynamics of numerics between the scalars and systems of nonlinear autonomous ODEs and to set a baseline global asymptotic solution behavior of these schemes for practical computations in computational fluid dynamics. We show how 'numerical' basins of attraction can complement the bifurcation diagrams in gaining more detailed global asymptotic behavior of time discretizations for nonlinear differential equations (DEs). We show how in the presence of spurious asymptotes the basins of the true stable steady states can be segmented by the basins of the spurious stable and unstable asymptotes. One major consequence of this phenomenon which is not commonly known is that this spurious behavior can result in a dramatic distortion and, in most cases, a dramatic shrinkage and segmentation of the basin of attraction of the true solution for finite time steps. Such distortion, shrinkage and segmentation of the numerical basins of attraction will occur regardless of the stability of the spurious asymptotes, and will occur for unconditionally stable implicit linear multistep methods. In other words, for the same (common) steady-state solution the associated basin of attraction of the DE might be very different from the discretized counterparts and the numerical basin of attraction can be very different from numerical method to numerical method. The results can be used as an explanation for possible causes of error, and slow convergence and nonconvergence of steady-state numerical solutions when using the time-dependent approach for nonlinear hyperbolic or parabolic PDEs.

Yee, H. C.↗

A comparison between onestep and other multiconic trajectory propagation methods

The paper presents an optimized version of the one-step multiconic method of spacecraft trajectory propagation in the presence of two attracting bodies. This method is compared to eleven other methods ranging from simple conic propagation to full integration of the equations of motion by applying the methods to a wide variety of test cases taken from planned space missions. This optimize one-step method is shown to be an order of magnitude better than other single-step methods for interplanetary and most lunar trajectories. Multistep multiconics methods and integration of the state offer another order of magnitude improvement, but at a proportionally higher cost and calculation time.

Kiedron, Krystyna↗

Boundary conditions for multistep finite-difference methods for time-dependent equations

The stability and accuracy of various boundary treatments are analyzed for the two-step Richtmyer and MacCormack methods. Special attention is paid to ways of imposing the extra boundary conditions after the first step of the two-step process. The theory of Kreiss is used to study stability properties for both scalar and vector equations. The theory of Skollermo is used to compare accuracies of the various methods. Computations were also performed on both wavelike equations and on systems that approach a steady state. Several suggestions are given for more reliable boundary treatments.

Gottlieb, D.↗

Variable-mesh method of solving differential equations

Multistep predictor-corrector method for numerical solution of ordinary differential equations retains high local accuracy and convergence properties. In addition, the method was developed in a form conducive to the generation of effective criteria for the selection of subsequent step sizes in step-by-step solution of differential equations.

Van Wyk, R.↗

MULTISTEP AND CONTINUOUS PHYSICS-INFORMED NEURAL NETWORK METHODS FOR LEARNING GOVERNING EQUATIONS AND CONSTITUTIVE RELATIONS

In this work, we investigate the applicability and relative merit of discrete and continuous versions of physics-informed neural network (PINN) methods for learning unknown governing equations or constitutive relations in a nonlinear dynamical system. In the case of unknown dynamics, entire right-hand-side (RHS) equations of the ordinary differential equations are unknown. In the case of unknown constitutive relations, however, the RHS equations are known up to the specification of constitutive relations (that may depend on the state of the system). We use a deep neural network to model unknown governing equations or constitutive relations. The discrete PINN approach combines classical multistep discretization methods for dynamical systems with neural-network-based machine learning methods. On the other hand, the continuous versions utilize deep neural networks to minimize the residual function for the continuous governing equations. We use the case of a fedbatch bioreactor system to study the effectiveness of these approaches and discuss conditions for their applicability. Our results indicate that the accuracy of the trained neural network models is much higher for the cases where we only have to learn a constitutive relation instead of all dynamics. This finding corroborates the well-known fact from scientific computing that building as much structural information as is available into an algorithm can enhance its efficiency and/or accuracy.

97 MATHEMATICS AND COMPUTING↗

RAISHIN: A High-Resolution Three-Dimensional General Relativistic Magnetohydrodynamics Code

We have developed a new three-dimensional general relativistic magnetohydrodynamic (GRMHD) code, RAISHIN, using a conservative, high resolution shock-capturing scheme. The numerical fluxes are calculated using the Harten, Lax, & van Leer (HLL) approximate Riemann solver scheme. The flux-interpolated, constrained transport scheme is used to maintain a divergence-free magnetic field. In order to examine the numerical accuracy and the numerical efficiency, the code uses four different reconstruction methods: piecewise linear methods with Minmod and MC slope-limiter function, convex essentially non-oscillatory (CENO) method, and piecewise parabolic method (PPM) using multistep TVD Runge-Kutta time advance methods with second and third-order time accuracy. We describe code performance on an extensive set of test problems in both special and general relativity. Our new GRMHD code has proven to be accurate in second order and has successfully passed with all tests performed, including highly relativistic and magnetized cases in both special and general relativity.

Mizuno, Yosuke↗

Recent advances in computational transonic aerodynamics

The near-term prospects are discussed for calculation of viscous transonic flow fields about realistic configurations at full-scale Reynolds numbers. Three basic algorithms are considered: The central-difference, three-factor ADI method; the central-difference, explicit, multistep Runge-Kutta method with multigrid acceleration; and the relaxation method for the upwind-differenced, flux-split equations. Each method has distinct advantages and disadvantages regarding stability, convergence rate, and vectorizability. It appears that computation times can be 15 to 60 hours on the latest super computers unless 3D algorithms are improved to perform as well as current 2D algorithms.

South, J. C., Jr.↗

Buckling and vibration analysis for stiffened orthotropic shells of revolution.

Development of a numerical method, using the multistep integration approach, in which the buckling and vibration analyses are formulated as a succession of linear eigenvalue problems. The method does not require an estimate of the eigenvector, and once an eigenvalue has been converged good estimates for other eigenvalues are automatically available. This is accomplished through the use of an in-core Householder scheme for solution of the eigenvalue problem. Furthermore, since the method uses an eigenvalue solution, the possibility of missing modes is eliminated.

Svalbonas, V.↗

Stability with large step sizes for multistep discretizations of stiff ordinary differential equations

One-leg and multistep discretizations of variable-coefficient linear systems of ODEs having both slow and fast time scales are investigated analytically. The stability properties of these discretizations are obtained independent of ODE stiffness and compared. The results of numerical computations are presented in tables, and it is shown that for large step sizes the stability of one-leg methods is better than that of the corresponding linear multistep methods.

Majda, George↗

The application of generalized, cyclic, and modified numerical integration algorithms to problems of satellite orbit computation

Generalized, cyclic, and modified multistep numerical integration methods are developed and evaluated for application to problems of satellite orbit computation. Generalized methods are compared with the presently utilized Cowell methods; new cyclic methods are developed for special second-order differential equations; and several modified methods are developed and applied to orbit computation problems. Special computer programs were written to generate coefficients for these methods, and subroutines were written which allow use of these methods with NASA's GEOSTAR computer program.

Chesler, L.↗