Search NASA⌕ Search

SEARCH · Search NASA

Results for “Collocation scheme”

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 37 records · Page 2

Direct Numerical Simulation of a Coolant Jet in a Periodic Crossflow

A Direct Numerical Simulation of a coolant jet injected normally into a periodic crossflow is presented. The physical situation simulated represents a periodic module in a coolant hole array with a heated crossflow. A collocated finite difference scheme is used which is fifth-order accurate spatially and second-order accurate temporally. The scheme is based on a fractional step approach and requires the solution of a pressure-Poisson equation. The simulations are obtained for a blowing ratio of 0.25 and a channel Reynolds number of 5600. The simulations reveal the dynamics of several large scale structures including the Counter-rotating Vortex Pair (CVP), the horse-shoe vortex, the shear layer vortex, the wall vortex and the wake vortex. The origins and the interactions of these vortical structures are identified and explored. Also presented are the turbulence statistics and how they relate to the flow structures.

Sharma, Chirdeep↗

Discontinuous dual-primal mixed finite elements for elliptic problems

We propose a novel discontinuous mixed finite element formulation for the solution of second-order elliptic problems. Fully discontinuous piecewise polynomial finite element spaces are used for the trial and test functions. The discontinuous nature of the test functions at the element interfaces allows to introduce new boundary unknowns that, on the one hand enforce the weak continuity of the trial functions, and on the other avoid the need to define a priori algorithmic fluxes as in standard discontinuous Galerkin methods. Static condensation is performed at the element level, leading to a solution procedure based on the sole interface unknowns. The resulting family of discontinuous dual-primal mixed finite element methods is presented in the one and two-dimensional cases. In the one-dimensional case, we show the equivalence of the method with implicit Runge-Kutta schemes of the collocation type exhibiting optimal behavior. Numerical experiments in one and two dimensions demonstrate the order accuracy of the new method, confirming the results of the analysis.

Bottasso, Carlo L.↗

Comparison of Implicit Collocation Methods for the Heat Equation

We combine a high-order compact finite difference scheme to approximate spatial derivatives arid collocation techniques for the time component to numerically solve the two dimensional heat equation. We use two approaches to implement the collocation methods. The first one is based on an explicit computation of the coefficients of polynomials and the second one relies on differential quadrature. We compare them by studying their merits and analyzing their numerical performance. All our computations, based on parallel algorithms, are carried out on the CRAY SV1.

Kouatchou, Jules↗

Preconditioning for first-order spectral discretization

Efficient solution of the equations from spectral discretizations is essential if the high-order accuracy of these methods is to be realized. Direct solution of these equations is rarely feasible, thus iterative techniques are required. A preconditioning scheme for first-order Chebyshev collocation operators is proposed herein, in which the central finite difference mesh is finer than the collocation mesh. Details of the proper techniques for transferring information between the meshes are given here, and the scheme is analyzed by examination of the eigenvalue spectra of the preconditioned operators. The effect of artificial viscosity required in the inversion of the finite difference operator is examined. A second preconditioning scheme, involving a high-order upwind finite difference operator of the van Leer type is also analyzed to provide a comparison with the present scheme. Finally, the performance of the present scheme is verified by application to several test problems.

Streett, C. L.↗

Explicit Discontinuous Galerkin Methods for Conservation Laws

The two explicit DG methods in this study are based on a ‘predictor-corrector’ formulation, the first introduced by Lörcher, Gassner, and Munz (2007, 2008) called space–time expansion discontinuous Galerkin or STE-DG scheme, and the second, introduced independently by the author (Huynh 2006, 2013) called the upwind moment scheme. The predictor step of the two methods is essentially identical using a Cauchy-Kovalevsky (CK) procedure, which involves no interaction of the data among neighboring cells. The corrector step also shares the same space-time integration formulation and is where interaction of the data among neighboring cells takes place; the difference, however, is in how the resulting space-time volume integral is estimated. As a consequence of the different estimates, for the case of advection in one spatial dimension (1D), the moment scheme has a CFL (Courant-Friedrichs-Lewy) condition of 1 for all p and is accurate to order 2p+1, i.e., it possesses the super accuracy property, whereas the STE-DG method has a more restrictive CFL condition and is accurate to the expected order of p+1. For 1D advection, compared with the CFL conditions of 1/(2p+1) of standard RK-DG (Runge-Kutta) scheme where space and time discretization are of the same order, the moment scheme allows a significantly larger time step size. It also turns out that the scheme yields a result identical to Van Leer’s scheme III (1977), which amounts to shifting the data a distance of advection corresponding to the time step and projecting the result onto the space of polynomial solutions. Contrary to Van Leer’s approach, however, the space-time ‘predictor-corrector’ formulation facilitates extensions to the case of systems of equations. Concerning 2D extensions, in the case of advection, when the flow is along the diagonal direction, the CFL conditions for the moment schemes become restrictive as will be shown by Fourier (Von Neumann) stability and accuracy analyses. Since the moment scheme employs the right Radau points as collocation points in time, the method is closely related to the implicit Radau IIA scheme, which is stable for any time step size. The role of Radau IIA in relieving stability restriction for these explicit DG schemes remains to be explored

Discontinuous Galerkin↗

Assimilation of (A) TOVS data at the NASA Goddard Data Assimilation Office

At the NASA Goddard Data Assimilation Office (DAO), a 1D variational radiance assimilation system has been developed. This system, called DAOTOVS (Tiros operational vertical sounder (TOVS)), uses (A)TOVS level 1b radiances. It has been implemented within the DAO's semi-operational system as well as within the next generation data assimilation system that uses a finite-volume dynamical core. We will show results from (A)TOVS assimilation, including stratospheric analyses and validation. We will also describe our systematic error correction scheme which is based on collocated radiosondes.

Joiner, Joanna↗

High-Order Space-Time Methods for Conservation Laws

Current high-order methods such as discontinuous Galerkin and/or flux reconstruction can provide effective discretization for the spatial derivatives. Together with a time discretization, such methods result in either too small a time step size in the case of an explicit scheme or a very large system in the case of an implicit one. To tackle these problems, two new high-order space-time schemes for conservation laws are introduced: the first is explicit and the second, implicit. The explicit method here, also called the moment scheme, achieves a Courant-Friedrichs-Lewy (CFL) condition of 1 for the case of one-spatial dimension regardless of the degree of the polynomial approximation. (For standard explicit methods, if the spatial approximation is of degree p, then the time step sizes are typically proportional to 1/p(exp 2)). Fourier analyses for the one and two-dimensional cases are carried out. The property of super accuracy (or super convergence) is discussed. The implicit method is a simplified but optimal version of the discontinuous Galerkin scheme applied to time. It reduces to a collocation implicit Runge-Kutta (RK) method for ordinary differential equations (ODE) called Radau IIA. The explicit and implicit schemes are closely related since they employ the same intermediate time levels, and the former can serve as a key building block in an iterative procedure for the latter. A limiting technique for the piecewise linear scheme is also discussed. The technique can suppress oscillations near a discontinuity while preserving accuracy near extrema. Preliminary numerical results are shown

Huynh, H. T.↗

An adaptive identification and control scheme for large space structures

A unified identification and control scheme capable of achieving space at form performance objectives under nominal or failure conditions is described. Preliminary results are also presented, showing that the methodology offers much promise for effective robust control of large space structures. The control method is a multivariable, adaptive, output predictive controller called Model Predictive Control (MPC). MPC uses a state space model and input reference trajectories of set or tracking points to adaptively generate optimum commands. For a fixed model, MPC processes commands with great efficiency, and is also highly robust. A key feature of MPC is its ability to control either nonminimum phase or open loop unstable systems. As an output controller, MPC does not explicitly require full state feedback, as do most multivariable (e.g., Linear Quadratic) methods. Its features are very useful in LSS operations, as they allow non-collocated actuators and sensors. The identification scheme is based on canonical variate analysis (CVA) of input and output data. The CVA technique is particularly suited for the measurement and identification of structural dynamic processes - that is, unsteady transient or dynamically interacting processes such as between aerodynamics and structural deformation - from short, noisy data. CVA is structured so that the identification can be done in real or near real time, using computationally stable algorithms. Modeling LSS dynamics in 1-g laboratories has always been a major impediment not only to understanding their behavior in orbit, but also to controlling it. In cases where the theoretical model is not confirmed, current methods provide few clues concerning additional dynamical relationships that are not included in the theoretical models. CVA needs no a priori model data, or structure; all statistically significant dynamical states are determined using natural, entropy-based methods. Heretofore, a major limitation in applying adaptive controllers to LSS problems has been the requirement for accurate models. We feel that MPC coupled with the CVA identification scheme will resolve this limitation. The results are based on research performed under an SBIR grant, administered by the Air Force Office of Scientific Research.

Carroll, J. V.↗

Solution of 3-dimensional time-dependent viscous flows. Part 1: Investigation of candidate algoriths

There is considerable interest in developing a numerical scheme for solving the time dependent viscous compressible three dimensional flow to aid in the design of helicopter rotors. Numerical algorithms are examined to determine their overall suitability for the efficient and routine solution of an appropriate system of partial differential equations. It is concluded that a consistently split time linearized block implicit scheme using either quintic B spline collocation or the generalized operator compact implicit approach to generate a fourth order accurate algorithm is particularly well suited for use on the present problem. High cell Reynolds number behavior leads to favoring the generalized operator compact implicit approach over the quintic B spline collocation method.

Weinberg, B. C.↗

Discontinuous Galerkin and Related Methods for ODE

A defining feature of the discontinuous Galerkin (DG) method for ODE is that the piecewise polynomial solution can have a jump discontinuity at the beginning of each step. Starting from the standard integral formulation, the DG method is derived here in differential form. The key ingredient is a polynomial called the correction function, which helps ‘correct’ the discontinuous solution by approximating the jump and yields a continuous one. Under the right Radau quadrature, this continuous solution is identical to the solutions by the right Radau collocation and the continuous Galerkin (CG) methods. Next, the correction function facilitates the construction of the associated implicit Runge-Kutta schemes (IRK-DG). Different quadratures for DG result in different IRK-DG methods: left Radau quadrature in Radau IA, right Radau quadrature in Radau IIA or right Radau collocation, and Gauss quadrature in a method called DG-Gauss. The construction of IRK-DG clarifies the meaning and facilitates the proofs of various 𝐵(𝑝), 𝐶(𝜂), and 𝐷(𝜁) conditions for accuracy. The two consequences of these conditions are that all 𝑠-stage IRK-DG methods are accurate to order 2𝑠 − 1, and the IRK-DG methods of Radau type are unique. Numerical examples showing the behavior of the DG solutions are provided. In all, the correction function plays a key role and helps establish the relations among the DG, IRK-DG, collocation, and CG schemes.

numerical methods↗

A spectral collocation method for compressible, non-similar boundary layers

An efficient and highly accurate algorithm based on a spectral collocation method is developed for numerical solution of the compressible, two-dimensional and axisymmetric boundary layer equations. The numerical method incorporates a fifth-order, fully implicit marching scheme in the streamwise (timelike) dimension and a spectral collocation method based on Chebyshev polynomial expansions in the wall-normal (spacelike) dimension. The spectral collocation algorithm is used to derive the nonsimilar mean velocity and temperature profiles in the boundary layer of a 'fuselage' (cylinder) in a high-speed (Mach 5) flow parallel to its axis. The stability of the flow is shown to be sensitive to the gradual streamwise evolution of the mean flow and it is concluded that the effects of transverse curvature on stability should not be ignored routinely.

Pruett, C. D.↗

A spectral multi-domain technique with application to generalized curvilinear coordinates

Spectral collocation methods have proven to be efficient discretization schemes for many aerodynamic and fluid mechanic problems. The high order accuracy and resolution shown by these methods allows one to obtain engineering accuracy solutions on coarse meshes, or alternatively, to obtain solutions with very small error. One drawback to these techniques was the requirement that a complicated physical domain must map into a simple computational domain for discretization. This mapping must be smooth if the high order accuracy and expontential convergence rates associated with spectral methods are to be preserved. Additionally even smooth stretching transformations can decrease the accuracy of a spectral method, if the stretching is severe. A further difficulty with spectral methods was in their implementation on parallel processing computers, where efficient spectral algorithms were lacking. The above restrictions are overcome by splitting the domain into regions, each of which preserve the advantages of spectral collocation, and allow the ratio of the mesh spacing between regions to be several orders of magnitude higher than allowable in a single domain. Such stretchings would be required to resolve the thin viscous region in an external aerodynamic problem. Adjoining regions are interfaced by enforcing a global flux balance which preserves high-order continuity of the solution, regardless of the type of the equations being solved.

Macaraeg, M. G.↗

A pseudo-spectral collocation method applied to the problem of convective diffusive transport in fluids subject to unsteady residual accelerations

The problem of determining the sensitivity of Bridgman-Stockbarger directional solidification experiments to residual accelerations of the type associated with spacecraft in low earth orbit is analyzed numerically using a pseudo-spectral collocation method. The approach employs a novel iterative scheme combining the method of artificial compressibility and a generalized ADI method. The results emphasize the importance of the consideration of residual accelerations and careful selection of the operating conditions in order to take full advantages of the low gravity conditions.

Alexander, J. Iwan↗

Domain decomposition methods for systems of conservation laws: Spectral collocation approximations

Hyperbolic systems of conversation laws are considered which are discretized in space by spectral collocation methods and advanced in time by finite difference schemes. At any time-level a domain deposition method based on an iteration by subdomain procedure was introduced yielding at each step a sequence of independent subproblems (one for each subdomain) that can be solved simultaneously. The method is set for a general nonlinear problem in several space variables. The convergence analysis, however, is carried out only for a linear one-dimensional system with continuous solutions. A precise form of the error reduction factor at each iteration is derived. Although the method is applied here to the case of spectral collocation approximation only, the idea is fairly general and can be used in a different context as well. For instance, its application to space discretization by finite differences is straight forward.

Quarteroni, Alfio↗

Global collocation methods for approximation and the solution of partial differential equations

Polynomial interpolation methods are applied both to the approximation of functions and to the numerical solutions of hyperbolic and elliptic partial differential equations. The derivative matrix for a general sequence of the collocation points is constructed. The approximate derivative is then found by a matrix times vector multiply. The effects of several factors on the performance of these methods including the effect of different collocation points are then explored. The resolution of the schemes for both smooth functions and functions with steep gradients or discontinuities in some derivative are also studied. The accuracy when the gradients occur both near the center of the region and in the vicinity of the boundary is investigated. The importance of the aliasing limit on the resolution of the approximation is investigated in detail. Also examined is the effect of boundary treatment on the stability and accuracy of the scheme.

Solomonoff, A.↗

The eigenvalue spectrum of the Rayleigh equation for a plane shear layer

The eigenvalue spectrum of the Rayleigh equation is examined using three different solution techniques. In particular, a simple second-order finite difference scheme and two spectral methods, the Chebyshev tau and Chebyshev collocation methods, are used to discretize the equation. All of the approximation methods are shown to be capable of predicting the discrete spectrum as well as the continuous spectrum associated with the critical point singularity for the Rayleigh equation. The global eigenvalue methods considered here provide an efficient way of obtaining either an approximation to the complete eigenvalue spectrum or initial guesses for a local shooting procedure for the discrete part of the spectrum.

Liou, William W.-W.↗

Discrete approximations to optimal trajectories using direct transcription and nonlinear programming

A recently developed method for solving optimal trajectory problems uses a piecewise-polynomial representation of the state and control variables, enforces the equations of motion via a collocation procedure, and thus approximates the original calculus-of-variations problem with a nonlinear-programming problem, which is solved numerically. This paper identifies this method as a direct transcription method and proceeds to investigate the relationship between the original optimal-control problem and the nonlinear-programming problem. The discretized adjoint equation of the collocation method is found to have deficient accuracy, and an alternate scheme which discretizes the equations of motion using an explicit Runge-Kutta parallel-shooting approach is developed. Both methods are applied to finite-thrust spacecraft trajectory problems, including a low-thrust escape spiral, a three-burn rendezvous, and a low-thrust transfer to the moon.

Enright, Paul J.↗

Multigrid calculation of internal flows in complex geometries

The development, validation, and application of a general purpose multigrid solution algorithm and computer program for the computation of elliptic flows in complex geometries is presented. This computer program combines several desirable features including a curvilinear coordinate system, collocated arrangement of the variables, and Full Multi-Grid/Full Approximation Scheme (FMG/FAS). Provisions are made for the inclusion of embedded obstacles and baffles inside the flow domain. The momentum and continuity equations are solved in a decoupled manner and a pressure corrective equation is used to update the pressures such that the fluxes at the cell faces satisfy local mass continuity. Despite the computational overhead required in the restriction and prolongation phases of the multigrid cycling, the superior convergence results in reduced overall CPU time. The numerical scheme and selected results of several validation flows are presented. Finally, the procedure is applied to study the flowfield in a side-inlet dump combustor and twin jet impingement from a simulated aircraft fuselage.

Smith, K. M.↗