Search NASA⌕ Search

SEARCH · Search NASA

Results for “high order 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 163 records · Page 9

High-order essentially non-oscillatory methods for computational aeroacoustics

The desire to obtain acoustic information from the numerical solution of a nonlinear system of equations is a demanding proposition for a computational algorithm. High-order accuracy is required for the propagation of high-frequency, low-amplitude waves. In addition, it is desirable to highly resolve discontinuities that can develop in the solutions of the Euler or Navier-Stokes equations. The class of essentially non-oscillatory (ENO) shock-capturing schemes has been designed to have both of these properties. The dual capacity of ENO schemes for high-order accuracy and non-oscillatory shock-capturing is achieved through the use of adaptive stenciling, which makes these schemes highly nonlinear. These schemes are briefly described and referenced herein. A fourth-order algorithm is then applied to the solution of an acoustic wave in a quasi-one-dimensional converging-diverging nozzle.

Casper, Jay↗

A New Approach for a Wider Class of Entropy Split Methods for Compressible Gas Dynamics and MHD

The high order entropy split methods of Sjögreen & Yee [1, 2] by entropy splitting of the compressible Euler (inviscid) flux derivatives for a thermally-perfect gas are based on Harten’s entropy function [3, 4, 5]. Their derivation takes advantage of the homogeneity property of Euler flux, symmetrizable Euler flux derivatives and energy-norm stability in conjunction with high order classical spatial central, DRP (dispersion relation-preserving) [6, 7, 8] or Padé (compact) spatial discretizations [9] with summation-by-parts (SBP) operators [10]. Our entropy split methods have been proven entropy conserving and stable [1, 11, 12]. Our proofs do not rely on a two-point numerical flux, but rather only a linear difference operator is required to derive these methods. To extend the entropy split method for the MHD, we used the Godunov symmetrizable non-conservative MHD form [12, 13, 14]. These high order entropy split methods not only preserve certain physical properties of the chosen governing equations but are also known to either improve numerical stability, and/or minimize aliasing errors in long time integration of turbulent flow computations without the aid of added numerical dissipation. In our previous published work, extensive error norm comparison with grid refinement was performed to show the high accuracy performance of these methods. These studies also showed how well the entropy split methods conserve the entropy, momentum and mass, and preserve the kinetic energy for long time integration of the various flows [1, 2, 12, 13, 14]. The objective of the present work is to use a new approach to obtain a wider class of entropy split methods consisting of a two-point numerical flux portion and a non-conservative portion in such a way that the homogeneity property of the compressible Euler flux is not required. For high order classical spatial central, DRP (dispersion relation-preserving) or Padé (compact) spatial discretizations, this new approach can be proven to be entropy conservative with conservative spatial dsicretizations while at the same time allowing a wider class of symmetrizable inviscid flux derivatives. We also use this generalization to derive an entropy split scheme that is entropy conserving for the equations of MHD without the homogeneity property using the Godunov symmetrizable ideal MHD formulation [15].

High Order Physical Preserving Methods↗

Practical aspects of spatially high accurate methods

The computational qualities of high order spatially accurate methods for the finite volume solution of the Euler equations are presented. Two dimensional essentially non-oscillatory (ENO), k-exact, and 'dimension by dimension' ENO reconstruction operators are discussed and compared in terms of reconstruction and solution accuracy, computational cost and oscillatory behavior in supersonic flows with shocks. Inherent steady state convergence difficulties are demonstrated for adaptive stencil algorithms. An exact solution to the heat equation is used to determine reconstruction error, and the computational intensity is reflected in operation counts. Standard MUSCL differencing is included for comparison. Numerical experiments presented include the Ringleb flow for numerical accuracy and a shock reflection problem. A vortex-shock interaction demonstrates the ability of the ENO scheme to excel in simulating unsteady high-frequency flow physics.

Godfrey, Andrew G.↗

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

Continued Development of the Discontinuous Galerkin Method for Computational Aeroacoustic Applications

The formulation and the implementation of boundary conditions within the context of the quadrature-free form of the discontinuous Galerkin method are presented for several types of boundary conditions for the Euler equations. An important feature of the discontinuous Galerkin method is that the interior point algorithm is well behaved in the neighborhood of the boundary and requires no modifications. This feature leads to a simple and accurate treatment for wall boundary conditions and simple inflow and outflow boundary conditions. Curved walls are accurately treated with only minor changes to the implementation described in earlier work. The 'perfectly matched layer' approach to nonreflecting boundary conditions is easily applied to the discontinuous Galerkin. The compactness of the discontinuous Galerkin method makes it better suited for buffer-zone-type methods than high-order finite-difference methods. Results are presented for wall, characteristic inflow and outflow, and nonreflecting boundary conditions.

Atkins, H. L.↗

A method for obtaining reduced-order control laws for high-order systems using optimization techniques

A method of synthesizing reduced-order optimal feedback control laws for a high-order system is developed. A nonlinear programming algorithm is employed to search for the control law design variables that minimize a performance index defined by a weighted sum of mean-square steady-state responses and control inputs. An analogy with the linear quadractic Gaussian solution is utilized to select a set of design variables and their initial values. To improve the stability margins of the system, an input-noise adjustment procedure is used in the design algorithm. The method is applied to the synthesis of an active flutter-suppression control law for a wind tunnel model of an aeroelastic wing. The reduced-order controller is compared with the corresponding full-order controller and found to provide nearly optimal performance. The performance of the present method appeared to be superior to that of two other control law order-reduction methods. It is concluded that by using the present algorithm, nearly optimal low-order control laws with good stability margins can be synthesized.

Mukhopadhyay, V.↗

A panel method procedure for interference assessment in slotted-wall wind tunnels

This paper describes a method for three-dimensional wind tunnel interference assessment developed specifically for slotted-wall tunnels. The method is an adaptation to the assessment problem of a previously published high-order panel method procedure for simulating the flow in slotted-wall tunnel test sections. The method uses a mixed outer boundary condition, primarily a Neumann condition, with measured pressure constraints used to control only those boundary phenomena which can not be specified accurately a priori. Assessment results are illustrated from a calibration test with variations in wall geometry, and from tests of a generic subsonic transport aircraft configuration.

Kemp, William B., Jr.↗

Multi-Dimensional High Order Essentially Non-Oscillatory Finite Difference Methods in Generalized Coordinates

This project is about the development of high order, non-oscillatory type schemes for computational fluid dynamics. Algorithm analysis, implementation, and applications are performed. Collaborations with NASA scientists have been carried out to ensure that the research is relevant to NASA objectives. The combination of ENO finite difference method with spectral method in two space dimension is considered, jointly with Cai [3]. The resulting scheme behaves nicely for the two dimensional test problems with or without shocks. Jointly with Cai and Gottlieb, we have also considered one-sided filters for spectral approximations to discontinuous functions [2]. We proved theoretically the existence of filters to recover spectral accuracy up to the discontinuity. We also constructed such filters for practical calculations.

Shu, Chi-Wang↗

Fourth-order 2N-storage Runge-Kutta schemes

A family of five-stage fourth-order Runge-Kutta schemes is derived; these schemes required only two storage locations. A particular scheme is identified that has desirable efficiency characteristics for hyperbolic and parabolic initial (boundary) value problems. This scheme is competitive with the classical fourth-order method (high-storage) and is considerably more efficient and accurate than existing third-order low-storage schemes.

Carpenter, Mark H.↗

Conservative high-order-accurate finite-difference methods for curvilinear grids

Two fourth-order-accurate finite-difference methods for numerically solving hyperbolic systems of conservation equations on smooth curvilinear grids are presented. The first method uses the differential form of the conservation equations; the second method uses the integral form of the conservation equations. Modifications to these schemes, which are required near boundaries to maintain overall high-order accuracy, are discussed. An analysis that demonstrates the stability of the modified schemes is also provided. Modifications to one of the schemes to make it total variation diminishing (TVD) are also discussed. Results that demonstrate the high-order accuracy of both schemes are included in the paper. In particular, a Ringleb-flow computation demonstrates the high-order accuracy and the stability of the boundary and near-boundary procedures. A second computation of supersonic flow over a cylinder demonstrates the shock-capturing capability of the TVD methodology. An important contribution of this paper is the dear demonstration that higher order accuracy leads to increased computational efficiency.

Rai, Man M.↗

Numerical Evaluation of P-Multigrid Method for the Solution of Discontinuous Galerkin Discretizations of Diffusive Equations

This paper describes numerical experiments with P-multigrid to corroborate analysis, validate the present implementation, and to examine issues that arise in the implementations of the various combinations of relaxation schemes, discretizations and P-multigrid methods. The two approaches to implement P-multigrid presented here are equivalent for most high-order discretization methods such as spectral element, SUPG, and discontinuous Galerkin applied to advection; however it is discovered that the approach that mimics the common geometric multigrid implementation is less robust, and frequently unstable when applied to discontinuous Galerkin discretizations of di usion. Gauss-Seidel relaxation converges 40% faster than block Jacobi, as predicted by analysis; however, the implementation of Gauss-Seidel is considerably more expensive that one would expect because gradients in most neighboring elements must be updated. A compromise quasi Gauss-Seidel relaxation method that evaluates the gradient in each element twice per iteration converges at rates similar to those predicted for true Gauss-Seidel.

Atkins, H. L.↗

A closer look at the induced drag of crescent-shaped wings

Recent interest in the induced drag characteristics of crescent-shaped wings has led to a closer look at the methods used for determination of induced drag from computational aerodynamic methods. Induced drag may be computed by integration of surface pressure, or by evaluation of a contour integral in the Trefftz plane. A high-order panel method was used to study the induced drag of crescent and elliptical wings using both techniques. Induced drag computations using surface-pressure integration were strongly affected by panel density and angle of attack. Accurate drag computations for the crescent wing were obtained only when the spanwise as well as chordwise panel density was extremely high. Trefftz-plane results for the two wing planforms do not show this sensitivity to panel density or angle of attack. Span efficiencies of 0.994 for the crescent wing and 0.987 for the elliptical wing were computed by the Trefftz-plane technique. Substitution of a force-free, rolled-up wake geometry on the crescent wing did not change the pressure-integrated drag significantly. The slightly higher span efficiency of the crescent wing is attributed to a more nearly elliptical spanwise lift distribution. The chord distribution of the elliptical wing was modified to produce an elliptical span-loading on a wing with an unswept quarter-chord line. This wing demonstrated a span efficiency equal to that of the crescent wing.

Smith, Stephen C.↗

A finite-volume high-order ENO scheme for two-dimensional hyperbolic systems

The finite-volume approach is presently used to obtain a 2D, high-order accurate and basically nonoscillatory shock-capture method whose high-order spatial accuracy is obtained by means of a piecewise polynomial approximation of the solution from cell averages. Attention is given to a high-order spatial operator that is able to both retain high-order accuracy in smooth regions and avoid the oscillations that are associated with interpolations across steep gradients. The operator is extended to hyperbolic systems of equations and curvilinear meshes.

Casper, Jay↗

LES of Temporally Evolving Mixing Layers by an Eighth-Order Filter Scheme

An eighth-order filter method for a wide range of compressible flow speeds (H.C. Yee and B. Sjogreen, Proceedings of ICOSAHOM09, June 22-26, 2009, Trondheim, Norway) are employed for large eddy simulations (LES) of temporally evolving mixing layers (TML) for different convective Mach numbers (Mc) and Reynolds numbers. The high order filter method is designed for accurate and efficient simulations of shock-free compressible turbulence, turbulence with shocklets and turbulence with strong shocks with minimum tuning of scheme parameters. The value of Mc considered is for the TML range from the quasi-incompressible regime to the highly compressible supersonic regime. The three main characteristics of compressible TML (the self similarity property, compressibility effects and the presence of large-scale structure with shocklets for high Mc) are considered for the LES study. The LES results using the same scheme parameters for all studied cases agree well with experimental results of Barone et al. (2006), and published direct numerical simulations (DNS) work of Rogers & Moser (1994) and Pantano & Sarkar (2002).

Hadjadj, A↗

An Automated Approach to Very High Order Aeroacoustic Computations in Complex Geometries

Computational aeroacoustics requires efficient, high-resolution simulation tools. And for smooth problems, this is best accomplished with very high order in space and time methods on small stencils. But the complexity of highly accurate numerical methods can inhibit their practical application, especially in irregular geometries. This complexity is reduced by using a special form of Hermite divided-difference spatial interpolation on Cartesian grids, and a Cauchy-Kowalewslci recursion procedure for time advancement. In addition, a stencil constraint tree reduces the complexity of interpolating grid points that are located near wall boundaries. These procedures are used to automatically develop and implement very high order methods (>15) for solving the linearized Euler equations that can achieve less than one grid point per wavelength resolution away from boundaries by including spatial derivatives of the primitive variables at each grid point. The accuracy of stable surface treatments is currently limited to 11th order for grid aligned boundaries and to 2nd order for irregular boundaries.

Dyson, Rodger W.↗

Automated Approach to Very High-Order Aeroacoustic Computations

Computational aeroacoustics requires efficient, high-resolution simulation tools. For smooth problems, this is best accomplished with very high-order in space and time methods on small stencils. However, the complexity of highly accurate numerical methods can inhibit their practical application, especially in irregular geometries. This complexity is reduced by using a special form of Hermite divided-difference spatial interpolation on Cartesian grids, and a Cauchy-Kowalewski recursion procedure for time advancement. In addition, a stencil constraint tree reduces the complexity of interpolating grid points that am located near wall boundaries. These procedures are used to develop automatically and to implement very high-order methods (> 15) for solving the linearized Euler equations that can achieve less than one grid point per wavelength resolution away from boundaries by including spatial derivatives of the primitive variables at each grid point. The accuracy of stable surface treatments is currently limited to 11th order for grid aligned boundaries and to 2nd order for irregular boundaries.

Dyson, Rodger W.↗

Solution of Ordinary Differential Equations in Gradient-Based Multidisciplinary Design Optimization

A gradient-based approach to multidisciplinary design optimization enables efficient scalability to large numbers of design variables. However, the need for derivatives causes difficulties when integrating ordinary differential equations (ODEs) in models. To simplify this, we propose the use of the general linear methods framework, which unifies all Runge-Kutta and linear multistep methods. This approach enables rapid implementation of integration methods without the need to differentiate each one, even in a gradient-based optimization context. We also develop a new parallel time integration algorithm that enables vectorization across time steps. We present a set of benchmarking results using a stiff ODE, a non-stiff nonlinear ODE, and an orbital dynamics ODE, and compare integration methods. In a modular gradient-based multidisciplinary design optimization context, we find that the new parallel time integration algorithm with high-order implicit methods, especially Gauss-Legendre collocation, is the best choice for a broad range of problems.

Hwang, John T.↗

A stiff order condition theory for Runge–Kutta methods applied to semilinear ODEs

Classical convergence theory of Runge–Kutta methods assumes that the time step is small relative to the Lipschitz constant of the ordinary differential equation (ODE). For stiff problems, that assumption is often violated, and a problematic degradation in accuracy, known as order reduction, can arise. Methods with high stage order, e.g., Gauss–Legendre and Radau, are known to avoid order reduction, but they must be fully implicit. For the broad class of semilinear ODEs, which consist of a stiff linear term and non-stiff nonlinear term, we show that weaker conditions suffice. Here, our new semilinear order conditions are formulated in terms of orthogonality relations and can be enumerated by rooted trees. Finally, we prove global error bounds that hold uniformly with respect to stiffness of the linear term.

Mathematics and Computing↗