Bijl, Hester | Search NASA

NASA NTRS2010

A General Algorithm for Reusing Krylov Subspace Information. I. Unsteady Navier-Stokes

A general algorithm is developed that reuses available information to accelerate the iterative convergence of linear systems with multiple right-hand sides A x = b (sup i), which are commonly encountered in steady or unsteady simulations of nonlinear equations. The algorithm is based on the classical GMRES algorithm with eigenvector enrichment but also includes a Galerkin projection preprocessing step and several novel Krylov subspace reuse strategies. The new approach is applied to a set of test problems, including an unsteady turbulent airfoil, and is shown in some cases to provide significant improvement in computational efficiency relative to baseline approaches.

Carpenter, Mark H.↗

NASA NTRS2001

Time Integration Schemes for the Unsteady Navier-stokes Equations

The efficiency and accuracy of several time integration schemes are investigated for the unsteady Navier-Stokes equations. This study focuses on the efficiency of higher-order Runge-Kutta schemes in comparison with the popular Backward Differencing Formulations. For this comparison an unsteady two-dimensional laminar flow problem is chosen, i.e., flow around a circular cylinder at Re = 1200. It is concluded that for realistic error tolerances (smaller than 10(exp -1)) fourth-and fifth-order Runge-Kutta schemes are the most efficient. For reasons of robustness and computer storage, the fourth-order Runge-Kutta method is recommended. The efficiency of the fourth-order Runge-Kutta scheme exceeds that of second-order Backward Difference Formula by a factor of 2.5 at engineering error tolerance levels (10(exp -1) to 10(exp -2)). Efficiency gains are more dramatic at smaller tolerances.

Bijl, Hester↗