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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

Direct numerical simulations of a reacting turbulent mixing layer by a pseudospectral-spectral element method

An account is given of the implementation of the spectral-element technique for simulating a chemically reacting, spatially developing turbulent mixing layer. Attention is given to experimental and numerical studies that have investigated the development, evolution, and mixing characteristics of shear flows. A mathematical formulation is presented of the physical configuration of the spatially developing reacting mixing layer, in conjunction with a detailed representation of the spectral-element method's application to the numerical simulation of mixing layers. Results from 2D and 3D calculations of chemically reacting mixing layers are given.

Mcmurtry, Patrick A.↗
NASA NTRSDate not supplied

Explore Information Content Efficiently from Current and Future Hyperspectral Satellite Missions using a Spectral Fingerprinting Method

Hyperspectral remote sensors from current and future missions provide measurements of the Top of Atmosphere (TOA) radiance or reflectance spectra with high information content. For example, the Atmospheric Infrared Sounder (AIRS), together with the Cross-track Infrared Sounder (CrIS), and the Infrared Atmospheric Sounding Interferometer (IASI) have provided more than 20 years radiance measurements with thousands of spectral channels. These measurements will be continued for the next two decades with the same or more advanced hyperspectral sensors. The upcoming missions such as NASA’s CLARREO Pathfinder (CPF) and ESA’s TRUTHS will provide unprecedented accurate TOA hyperspectral radiance measurements in solar spectral region. Traditional ways to derive Climate Data Records (CDRs) from these measurements are performing spatial and temporal averages of the retrieved Level-2 products. However, it is a time-consuming process to generate decades of Level-2 data from Level-1 data. Furthermore, the differences in Level-2 algorithms used for different satellite sensors will introduce errors in derived CDRs. In this presentation, we will describe a spectral fingerprinting method to generate high-quality CDRs directly from spatiotemporally averaged Level-1 data. By using consistent radiative kernels which contain the spectral information of various atmospheric and surface CDRs, we can reduce the errors due to algorithm inconsistency. Additionally, the spectral fingerprinting method reduces the time needed to generate CDRs by more than three orders of magnitude. This makes it easy to reprocess CDRs once the Level-1 data from different satellites have been improved via either re-calibrations or inter-satellite calibrations. We will present results of applying spectral fingerprinting method to 20-years of AIRS and CrIS data. The resulting CDRs include: 1) vertical profiles of atmospheric temperature and water vapor, 2) cloud properties such as optical depth, effective size, and height, 3) vertical profiles or column amounts for atmospheric trace gases such as O3 and CO, and 4) surface emissivity spectra and skin temperatures. These CDRs will be publicly available at NASA GES DISC in late 2024. The same fingerprinting method is planned to be applied to future CPF and TRUTHS data for solar spectral region.

hyperspectral remote sensing↗
NASA NTRS1988

Domain decomposition preconditioners for the spectral collocation method

Several block iteration preconditioners are proposed and analyzed for the solution of elliptic problems by spectral collocation methods in a region partitioned into several rectangles. It is shown that convergence is achieved with a rate which does not depend on the polynomial degree of the spectral solution. The iterative methods here presented can be effectively implemented on multiprocessor systems due to their high degree of parallelism.

Quarteroni, Alfio↗
NASA NTRS1980

On the practical use of high-order methods for hyperbolic systems

The paper tests a number of high order methods on a variety of dynamic problems in one, two, and three space dimensions. The problems covered include wave propagation phenomena as well as an asymptotic approach to a steady state. Consideration is given to both smooth and shocked flows. It is shown that the methods compared require only minor modifications of many existing second-order schemes. Further, the results show that significant gains can be expected from the use of fourth-order methods. Finally, spectral methods are also considered for some of the problems presented.

Turkel, E.↗
NASA NTRS1989

Numerical algorithms for computations of feedback laws arising in control of flexible systems

Several continuous models will be examined, which describe flexible structures with boundary or point control/observation. Issues related to the computation of feedback laws are examined (particularly stabilizing feedbacks) with sensors and actuators located either on the boundary or at specific point locations of the structure. One of the main difficulties is due to the great sensitivity of the system (hyperbolic systems with unbounded control actions), with respect to perturbations caused either by uncertainty of the model or by the errors introduced in implementing numerical algorithms. Thus, special care must be taken in the choice of the appropriate numerical schemes which eventually lead to implementable finite dimensional solutions. Finite dimensional algorithms are constructed on a basis of a priority analysis of the properties of the original, continuous (infinite diversional) systems with the following criteria in mind: (1) convergence and stability of the algorithms and (2) robustness (reasonable insensitivity with respect to the unknown parameters of the systems). Examples with mixed finite element methods and spectral methods are provided.

Lasiecka, Irena↗
NASA NTRS1990

Numerical simulation of instability and transition physics

The study deals with the algorithm technology used in instability and transition simulations. Discretization methods are outlined, and attention is focused on high-order finite-difference methods and high-order centered-difference formulas. One advantage of finite-difference methods over spectral methods is thought to be in implementation of nonrigorous boundary conditions. It is suggested that the next significant advances in the understanding of transition physics and the ability to predict transition will come with more physically-realistic simulations. Compressible-flow algorithms are discussed, and it is noted that with further development, exploration of bypass mechanism on simple bodies at high speed would be possible.

Streett, C. L.↗
NASA NTRS2000

High Order Discontinuous Gelerkin Methods for Convection Dominated Problems with Application to Aeroacoustics

This project is about the investigation of the development of the discontinuous Galerkin finite element methods, for general geometry and triangulations, for solving convection dominated problems, with applications to aeroacoustics. On the analysis side, we have studied the efficient and stable discontinuous Galerkin framework for small second derivative terms, for example in Navier-Stokes equations, and also for related equations such as the Hamilton-Jacobi equations. This is a truly local discontinuous formulation where derivatives are considered as new variables. On the applied side, we have implemented and tested the efficiency of different approaches numerically. Related issues in high order ENO and WENO finite difference methods and spectral methods have also been investigated. Jointly with Hu, we have presented a discontinuous Galerkin finite element method for solving the nonlinear Hamilton-Jacobi equations. This method is based on the RungeKutta discontinuous Galerkin finite element method for solving conservation laws. The method has the flexibility of treating complicated geometry by using arbitrary triangulation, can achieve high order accuracy with a local, compact stencil, and are suited for efficient parallel implementation. One and two dimensional numerical examples are given to illustrate the capability of the method. Jointly with Hu, we have constructed third and fourth order WENO schemes on two dimensional unstructured meshes (triangles) in the finite volume formulation. The third order schemes are based on a combination of linear polynomials with nonlinear weights, and the fourth order schemes are based on combination of quadratic polynomials with nonlinear weights. We have addressed several difficult issues associated with high order WENO schemes on unstructured mesh, including the choice of linear and nonlinear weights, what to do with negative weights, etc. Numerical examples are shown to demonstrate the accuracies and robustness of the methods for shock calculations. Jointly with P. Montarnal, we have used a recently developed energy relaxation theory by Coquel and Perthame and high order weighted essentially non-oscillatory (WENO) schemes to simulate the Euler equations of real gas. The main idea is an energy decomposition under the form epsilon = epsilon(sub 1) + epsilon(sub 2), where epsilon(sub 1) is associated with a simpler pressure law (gamma)-law in this paper) and the nonlinear deviation epsilon(sub 2) is convected with the flow. A relaxation process is performed for each time step to ensure that the original pressure law is satisfied. The necessary characteristic decomposition for the high order WENO schemes is performed on the characteristic fields based on the epsilon(sub l) gamma-law. The algorithm only calls for the original pressure law once per grid point per time step, without the need to compute its derivatives or any Riemann solvers. Both one and two dimensional numerical examples are shown to illustrate the effectiveness of this approach.

Shu, Chi-Wang↗
NASA NTRS2013

Spectral Element Method for the Simulation of Unsteady Compressible Flows

This work uses a discontinuous-Galerkin spectral-element method (DGSEM) to solve the compressible Navier-Stokes equations [1{3]. The inviscid ux is computed using the approximate Riemann solver of Roe [4]. The viscous fluxes are computed using the second form of Bassi and Rebay (BR2) [5] in a manner consistent with the spectral-element approximation. The method of lines with the classical 4th-order explicit Runge-Kutta scheme is used for time integration. Results for polynomial orders up to p = 15 (16th order) are presented. The code is parallelized using the Message Passing Interface (MPI). The computations presented in this work are performed using the Sandy Bridge nodes of the NASA Pleiades supercomputer at NASA Ames Research Center. Each Sandy Bridge node consists of 2 eight-core Intel Xeon E5-2670 processors with a clock speed of 2.6Ghz and 2GB per core memory. On a Sandy Bridge node the Tau Benchmark [6] runs in a time of 7.6s.

Diosady, Laslo Tibor↗
NASA NTRS1983

Preconditioners for the spectral multigrid method

The systems of algebraic equations which arise from spectral discretizations of elliptic equations are full and direct solutions of them are rarely feasible. Iterative methods are an attractive alternative because Fourier transform techniques enable the discrete matrix-vector products to be computed with nearly the same efficiency as is possible for corresponding but sparse finite difference discretizations. For realistic Dirichlet problems preconditioning is essential for acceptable convergence rates. A brief description of Chebyshev spectral approximations and spectral multigrid methods for elliptic problems is given. A survey of preconditioners for Dirichlet problems based on second-order finite difference methods is made. New preconditioning techniques based on higher order finite differences and on the spectral matrix itself are presented. The preconditioners are analyzed in terms of their spectra and numerical examples are presented.

Phillips, T. N.↗
NASA NTRS1986

Preconditioners for the spectral multigrid method

The systems of algebraic equations which arise from spectral discretizations of elliptic equations are full and direct solutions of them are rarely feasible. Iterative methods are an attractive alternative because Fourier transform techniques enable the discrete matrix-vector products to be computed with nearly the same efficiency as is possible for corresponding but sparse finite difference discretizations. For realistic Dirichlet problem preconditioning is essential for acceptable convergence rates. A brief description of Chebyshev spectral approximations and spectral multigrid methods for elliptic problems is given. A survey of preconditioners for Dirichlet problems based on second-order finite difference methods is made. New preconditioning techniques based on higher order finite differences and on the spectral matrix itself are presented. The preconditioners are analyzed in terms of their spectra and numerical examples are presented.

Phillips, T. N.↗
NASA NTRS1994

Three-dimensional fully spectral numerical method for mantle convection with depth-dependent properties

A semi-implicit fully spectral collocation method for the simulation of three-dimensional mantle convection with depth-dependent thermo-dynamic and transport properties is presented. The variable property Navier-Stokes equation expressed in terms of the primitive variable velocity and pressure is solved with the mass continuity and temperature equations. The periodic horizontal boundary conditions allow a Fourier expansion for the two horizontal directions. The stress-free, impermeable isothermal boundary conditions along with the depth dependent coefficients are handled with a Chebyshev expansion in the vertical direction. In the limit of an infinite Prandtl number appropriate to mantle convection, the inertial terms in the momentum equation are unimportant. In this case an explicit solution of a Poisson equation for pressure can be avoided; instead a fourth-order equation for vertical velocity can be solved. Simultaneous imposition of both impermeable and continuity boundary conditions during the vertical velocity evaluation is discussed. The pressure distributions on the top and bottom bounding planes were determined by means of an influence matrix technique. The numerical method employed here avoids time-splitting errors and enforces velocity boundary conditions and continuity over the entire domain, including the boundaries, to machine accuracy. Strongly time-dependent three-dimensional solutions up to a surface Rayleigh number of 1 x 10(exp 7) have been obtained. Strong upwellings, pulsating chaotically, are formed by the collective merging of cylindrical plumes.

Balachandar, S.↗
NASA NTRS2005

Multi-Dimensional Spectral Difference Method for Unstructured Grids

A new, high-order, conservative, and efficient method for conservation laws on unstructured grids is developed. It combines the best features of structured and unstructured grid methods to attain computational efficiency and geometric flexibility; it utilizes the concept of discontinuous and high-order local representations to achieve conservation and high accuracy; and it is based on the finite-difference formulation for simplicity. Universal reconstructions are obtained by distributing unknowns in a geometrically similar manner for all unstructured cells. Placements of the unknown and flux points with various order of accuracy are given for the line, triangular and tetrahedral elements. The data structure of the new method permits an optimum use of cache memory, resulting in further computational efficiency on modern computers. A new pointer system is developed that reduces memory requirements and simplifies programming for any order of accuracy. Numerical solutions are presented and compared with the exact solutions for wave propagation problems in both two and three dimensions to demonstrate the capability of the method. Excellent agreement has been found. The method is simpler and more efficient than previous discontinuous Galerkin and spectral volume methods for unstructured grids.

Liu, Yen↗
NASA NTRS1989

A multidomain spectral collocation method for the Stokes problem

A multidomain spectral collocation scheme is proposed for the approximation of the two-dimensional Stokes problem. It is shown that the discrete velocity vector field is exactly divergence-free and we prove error estimates both for the velocity and the pressure.

Landriani, G. Sacchi↗
NASA NTRS1977

A spectral domain method for remotely probing stratified media

The problem of remotely probing a stratified, lossless, dielectric medium is formulated using the spectral domain method of probing. The response of the medium to a spectrum of plane waves incident at various angles is used to invert the unknown profile. For TE polarization, the electric field satisfies a Helmholtz equation. The inverse problem is solved by means of a new representation for the wave function. The principal step in this inversion is solving a second kind Fredholm equation which is very amenable to numerical computations. Several examples are presented including some which indicate that the method can be used with experimentally obtained data. When the fields exhibit a surface wave behavior, a unique inversion can be obtained only if information about the magnetic field is also available. In this case, the inversion is accomplished by a two-step procedure which employs a formula of Jost and Kohn. Some examples are presented, and an approach which greatly shortens the computations without greatly deteriorating the results is discussed.

Schaubert, D. H.↗
NASA NTRS2004

Discontinuous Spectral Difference Method for Conservation Laws on Unstructured Grids

A new, high-order, conservative, and efficient discontinuous spectral finite difference (SD) method for conservation laws on unstructured grids is developed. The concept of discontinuous and high-order local representations to achieve conservation and high accuracy is utilized in a manner similar to the Discontinuous Galerkin (DG) and the Spectral Volume (SV) methods, but while these methods are based on the integrated forms of the equations, the new method is based on the differential form to attain a simpler formulation and higher efficiency. Conventional unstructured finite-difference and finite-volume methods require data reconstruction based on the least-squares formulation using neighboring point or cell data. Since each unknown employs a different stencil, one must repeat the least-squares inversion for every point or cell at each time step, or to store the inversion coefficients. In a high-order, three-dimensional computation, the former would involve impractically large CPU time, while for the latter the memory requirement becomes prohibitive. In addition, the finite-difference method does not satisfy the integral conservation in general. By contrast, the DG and SV methods employ a local, universal reconstruction of a given order of accuracy in each cell in terms of internally defined conservative unknowns. Since the solution is discontinuous across cell boundaries, a Riemann solver is necessary to evaluate boundary flux terms and maintain conservation. In the DG method, a Galerkin finite-element method is employed to update the nodal unknowns within each cell. This requires the inversion of a mass matrix, and the use of quadratures of twice the order of accuracy of the reconstruction to evaluate the surface integrals and additional volume integrals for nonlinear flux functions. In the SV method, the integral conservation law is used to update volume averages over subcells defined by a geometrically similar partition of each grid cell. As the order of accuracy increases, the partitioning for 3D requires the introduction of a large number of parameters, whose optimization to achieve convergence becomes increasingly more difficult. Also, the number of interior facets required to subdivide non-planar faces, and the additional increase in the number of quadrature points for each facet, increases the computational cost greatly.

Liu, Yen↗