Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “spectral 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 91 records · Page 5

A spectral method for determining the percentage of green herbage material in clipped samples

A laboratory radiometric method for the rapid determination of green and brown vegetation percentages in clipped grass samples has been developed and tested. The method uses red and photographic infrared radiance or reflectance differences between green and brown vegetation. Mixtures of green and brown material were found to have radiances or reflectances proportional to the percentage of green material present. This method may permit the use of rapid green/brown radiometric determinations to replace the tedious hand sorting now generally used. It may also have application in remote sensing of vegetation ground-truth work where the determination of dry green biomass in clipped samples is necessary.

Tucker, C. J.↗

On time discretizations for spectral methods

New methods are introduced for the time integration of the Fourier and Chebyshev methods of solution for dynamic differential equations. These methods are unconditionally stable, even though no matrix inversions are required. Time steps are chosen by accuracy requirements alone. For the Fourier method both leapfrog and Runge-Kutta methods are considered. For the Chebyshev method only Runge-Kutta schemes are tested. Numerical calculations are presented to verify the analytic results. Applications to the shallow water equations are presented.

Gottlieb, D.↗

Spectral methods in time for hyperbolic equations

A pseudospectral numerical scheme for solving linear, periodic, hyperbolic problems is described. It has infinite accuracy both in time and in space. The high accuracy in time is achieved without increasing the computational work and memory space which is needed for a regular, one step explicit scheme. The algorithm is shown to be optimal in the sense that among all the explicit algorithms of a certain class it requires the least amount of work to achieve a certain given resolution. The class of algorithms referred to consists of all explicit schemes which may be represented as a polynomial in the spatial operator.

Tal-Ezer, H.↗

Fourier-Legendre spectral methods for incompressible channel flow

An iterative collocation technique is described for modeling implicit viscosity in three-dimensional incompressible wall bounded shear flow. The viscosity can vary temporally and in the vertical direction. Channel flow is modeled with a Fourier-Legendre approximation and the mean streamwise advection is treated implicitly. Explicit terms are handled with an Adams-Bashforth method to increase the allowable time-step for calculation of the implicit terms. The algorithm is applied to low amplitude unstable waves in a plane Poiseuille flow at an Re of 7500. Comparisons are made between results using the Legendre method and with Chebyshev polynomials. Comparable accuracy is obtained for the perturbation kinetic energy predicted using both discretizations.

Zang, T. A.↗

Spectral methods in time for parabolic problems

A pseudospectral explicit scheme for solving linear, periodic, parabolic problems is described which has infinite accuracy both in time and in space. The high accuracy is achieved while the time resolution parameter M ( = ) (1/delta t) for time marching algorithm) and the space resolution parameter N B = O(1/detla x) have to satisfy M = O(N sup/+epsilon) epsilon O, compared to the common stability condition M = O(N sup 2) which has to be satisfied in any explicit finite order time algorithm.

Tal-Ezer, H.↗

Elimination of spurious eigenvalues in the Chebyshev tau spectral method

A very simple modification is presented for the Chebyshev tau method which can eliminate spurious eigenvalues, proceeding from a consideration of the vorticity-streamfunction reformulation of the Chebyshev tau method and the Chebyshev-Galerkin method, which have no spurious modes. Consideration of a model problem indicates that these two approaches are equivalent, and that they reduce to the present modification of the tau method. This modified tau method also eliminates spurious eigenvalues from the Orr-Sommerfeld equation.

Mcfadden, G. B.↗

On the cross-stream spectral method for the Orr-Sommerfeld equation

Cross-stream models are defined as solutions to the Orr-Sommerfeld equation which are propagating normal to the flow direction. These models are utilized as a basis for a Hilbert space to approximate the spectrum of the Orr-Sommerfeld equation with plane Poiseuille flow. The cross-stream basis leads to a standard eigenvalue problem for the frequencies of Poiseuille flow instability waves. The coefficient matrix in the eigenvalue problem is shown to be the sum of a real matrix and a negative-imaginary diagonal matrix which represents the frequencies of the cross-stream modes. The real coefficient matrix is shown to approach a Toeplitz matrix when the row and column indices are large. The Toeplitz matrix is diagonally dominant, and the diagonal elements vary inversely in magnitude with diagonal position. The Poiseuille flow eigenvalues are shown to lie within Gersgorin disks with radii bounded by the product of the average flow speed and the axial wavenumber. It is shown that the eigenvalues approach the Gersgorin disk centers when the mode index is large, so that the method may be used to compute spectra with an essentially unlimited number of elements. When the mode index is large, the real part of the eigenvalue is the product of the axial wavenumber and the average flow speed, and the imaginary part of the eigen value is identical to the corresponding cross-stream mode frequency. The cross-stream method is numerically well-conditioned in comparison to Chebyshev based methods, providing equivalent accuracy for small mode indices and superior accuracy for large indices.

Zorumski, William E.↗

An Efficient Spectral Method for Ordinary Differential Equations with Rational Function Coefficients

We present some relations that allow the efficient approximate inversion of linear differential operators with rational function coefficients. We employ expansions in terms of a large class of orthogonal polynomial families, including all the classical orthogonal polynomials. These families obey a simple three-term recurrence relation for differentiation, which implies that on an appropriately restricted domain the differentiation operator has a unique banded inverse. The inverse is an integration operator for the family, and it is simply the tridiagonal coefficient matrix for the recurrence. Since in these families convolution operators (i.e. matrix representations of multiplication by a function) are banded for polynomials, we are able to obtain a banded representation for linear differential operators with rational coefficients. This leads to a method of solution of initial or boundary value problems that, besides having an operation count that scales linearly with the order of truncation N, is computationally well conditioned. Among the applications considered is the use of rational maps for the resolution of sharp interior layers.

Coutsias, Evangelos A.↗

Dynamic Models for LES of Turbulent Front Propagation With a Spectral Method

Direct numerical simulation of turbulent reacting flows places extreme demands on computational resources. At the present time, simulations can be performed only for greatly simplified reaction systems and for very low Reynolds numbers. Direct simulation of more realistic cases occurring at higher Reynolds number and including multiple species and numerous chemical reactions will exceed available computational resources far into the future. Because of this, there is a clear need to develop the technique of large eddy simulation for reacting flows. Unfortunately this task is complicated by the fact that combustion arises from chemical reactions that occur at the smallest scales of the flow. Capturing the large-scale behavior without resolving the small-scale details is extremely difficult in combustion problems. Thus LES modeling for turbulent combustion encounters difficulties not present in modeling momentum transport, in which the main effect of the small scales is to provide dissipation. The difficulty is more pronounced in premixed combustion, where detailed chemistry plays an essential role in determining the flame speed (or overall burning rate); in nonpremixed combustion infinite rate chemistry can be assumed, eliminating the small scale features to a first approximation.

Im, H. G.↗

Comparison of AGE and Spectral Methods for the Simulation of Far-Wakes

Turbulent flow simulation methods based on finite differences are attractive for their simplicity, flexibility and efficiency, but not always for accuracy or stability. This report demonstrates that a good compromise is possible with the Advected Grid Explicit (AGE) method. AGE has proven to be both efficient and accurate for simulating turbulent free-shear flows, including planar mixing layers and planar jets. Its efficiency results from its localized fully explicit finite difference formulation (Bisset 1998a,b) that is very straightforward to compute, outweighing the need for a fairly small timestep. Also, most of the successful simulations were slightly under-resolved, and therefore they were, in effect, large-eddy simulations (LES) without a sub-grid-scale (SGS) model, rather than direct numerical simulations (DNS). The principle is that the role of the smallest scales of turbulent motion (when the Reynolds number is not too low) is to dissipate turbulent energy, and therefore they do not have to be simulated when the numerical method is inherently dissipative at its resolution limits. Such simulations are termed 'auto-LES' (LES with automatic SGS modeling) in this report.

Bisset, D. K.↗

A Multi-domain Spectral Method for Supersonic Reactive Flows

This paper has a dual purpose: it presents a multidomain Chebyshev method for the solution of the two-dimensional reactive compressible Navier-Stokes equations, and it reports the results of the application of this code to the numerical simulations of high Mach number reactive flows in recessed cavity. The computational method utilizes newly derived interface boundary conditions as well as an adaptive filtering technique to stabilize the computations. The results of the simulations are relevant to recessed cavity flameholders.

Don, Wai-Sun↗

Challenges at Petascale for Pseudo-Spectral Methods on Spheres (A Last Hurrah?)

Conclusions: a) Proper software abstractions should enable rapid-exploration of platform-specific optimizations/ tradeoffs. b) Pseudo-spectra! methods are marginally viable for at least some classes of petascaie problems. i.e., GPU based machine with good bisection would be best. c) Scalability at exascale is possible, but the necessary resolution will make algorithm prohibitively expensive. Efficient implementations of realistic global transposes are mtricate and tedious in MPI. PS at petascaie requires exploration of a variety of strategies for spreading local and remote communic3tions. PGAS allows far simpler implementation and thus rapid exploration of variants.

Clune, Thomas↗

Adaptive mesh strategies for the spectral element method

An adaptive spectral method was developed for the efficient solution of time dependent partial differential equations. Adaptive mesh strategies that include resolution refinement and coarsening by three different methods are illustrated on solutions to the 1-D viscous Burger equation and the 2-D Navier-Stokes equations for driven flow in a cavity. Sharp gradients, singularities, and regions of poor resolution are resolved optimally as they develop in time using error estimators which indicate the choice of refinement to be used. The adaptive formulation presents significant increases in efficiency, flexibility, and general capabilities for high order spectral methods.

Mavriplis, Catherine↗

Shock capturing by the spectral viscosity method

A main disadvantage of using spectral methods for nonlinear conservation laws lies in the formation of Gibbs phenomenon, once spontaneous shock discontinuities appear in the solution. The global nature of spectral methods than pollutes the unstable Gibbs oscillations overall the computational domain, and the lack of entropy dissipation prevents convergences in these cases. The Spectral Viscosity method, which is based on high frequency dependent vanishing viscosity regularization of the classical spectral methods is discussed. It is shown that this method enforces the convergence of nonlinear spectral approximations without sacrificing their overall spectral accuracy.

Tadmor, Eitan↗

A High-Order Finite Spectral Volume Method for Conservation Laws on Unstructured Grids

A time accurate, high-order, conservative, yet efficient method named Finite Spectral Volume (FSV) is developed for conservation laws on unstructured grids. The concept of a 'spectral volume' is introduced to achieve high-order accuracy in an efficient manner similar to spectral element and multi-domain spectral methods. In addition, each spectral volume is further sub-divided into control volumes (CVs), and cell-averaged data from these control volumes is used to reconstruct a high-order approximation in the spectral volume. Riemann solvers are used to compute the fluxes at spectral volume boundaries. Then cell-averaged state variables in the control volumes are updated independently. Furthermore, TVD (Total Variation Diminishing) and TVB (Total Variation Bounded) limiters are introduced in the FSV method to remove/reduce spurious oscillations near discontinuities. A very desirable feature of the FSV method is that the reconstruction is carried out only once, and analytically, and is the same for all cells of the same type, and that the reconstruction stencil is always non-singular, in contrast to the memory and CPU-intensive reconstruction in a high-order finite volume (FV) method. Discussions are made concerning why the FSV method is significantly more efficient than high-order finite volume and the Discontinuous Galerkin (DG) methods. Fundamental properties of the FSV method are studied and high-order accuracy is demonstrated for several model problems with and without discontinuities.

Wang, Z. J.↗