Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “adaptive polynomial approximations”

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.

An adaptive pseudospectral method for discontinuous problems

The accuracy of adaptively chosen, mapped polynomial approximations is studied for functions with steep gradients or discontinuities. It is shown that, for steep gradient functions, one can obtain spectral accuracy in the original coordinate system by using polynomial approximations in a transformed coordinate system with substantially fewer collocation points than are necessary using polynomial expansion directly in the original, physical, coordinate system. It is also shown that one can avoid the usual Gibbs oscillation associated with steep gradient solutions of hyperbolic pde's by approximation in suitably chosen coordinate systems. Continuous, high gradient solutions are computed with spectral accuracy (as measured in the physical coordinate system). Discontinuous solutions associated with nonlinear hyperbolic equations can be accurately computed by using an artificial viscosity chosen to smooth out the solution in the mapped, computational domain. Thus, shocks can be effectively resolved on a scale that is subgrid to the resolution available with collocation only in the physical domain. Examples with Fourier and Chebyshev collocation are given.

Augenbaum, Jeffrey M.↗

An adaptive pseudospectral method for discontinuous problems

The accuracy of adaptively chosen, mapped polynomial approximations is studied for functions with steep gradients or discontinuities. It is shown that, for steep gradient functions, one can obtain spectral accuracy in the original coordinate system by using polynomial approximations in a transformed coordinate system with substantially fewer collocation points than are necessary using polynomial expansion directly in the original, physical, coordinate system. It is also shown that one can avoid the usual Gibbs oscillation associated with steep gradient solutions of hyperbolic pde's by approximation in suitably chosen coordinate systems. Continuous, high gradient solutions are computed with spectral accuracy (as measured in the physical coordinate system). Discontinuous solutions associated with nonlinear hyperbolic equations can be accurately computed by using an artificial viscosity chosen to smooth out the solution in the mapped, computational domain. Thus, shocks can be effectively resolved on a scale that is subgrid to the resolution available with collocation only in the physical domain. Examples with Fourier and Chebyshev collocation are given.

Augenbaum, J. M.↗

An adaptive pseudo-spectral method for reaction diffusion problems

The spectral interpolation error was considered for both the Chebyshev pseudo-spectral and Galerkin approximations. A family of functionals I sub r (u), with the property that the maximum norm of the error is bounded by I sub r (u)/J sub r, where r is an integer and J is the degree of the polynomial approximation, was developed. These functionals are used in the adaptive procedure whereby the problem is dynamically transformed to minimize I sub r (u). The number of collocation points is then chosen to maintain a prescribed error bound. The method is illustrated by various examples from combustion problems in one and two dimensions.

Bayliss, A.↗

An adaptive pseudo-spectral method for reaction diffusion problems

The spectral interpolation error was considered for both the Chebyshev pseudo-spectral and Galerkin approximations. A family of functionals I sub r (u), with the property that the maximum norm of the error is bounded by I sub r (u)/J sub r, where r is an integer and J is the degree of the polynomial approximation, was developed. These functionals are used in the adaptive procedure whereby the problem is dynamically transformed to minimize I sub r (u). The number of collocation points is then chosen to maintain a prescribed error bound. The method is illustrated by various examples from combustion problems in one and two dimensions.

Bayliss, A.↗

An hp-adaptivity and error estimation for hyperbolic conservation laws

This paper presents an hp-adaptive discontinuous Galerkin method for linear hyperbolic conservation laws. A priori and a posteriori error estimates are derived in mesh-dependent norms which reflect the dependence of the approximate solution on the element size (h) and the degree (p) of the local polynomial approximation. The a posteriori error estimate, based on the element residual method, provides bounds on the actual global error in the approximate solution. The adaptive strategy is designed to deliver an approximate solution with the specified level of error in three steps. The a posteriori estimate is used to assess the accuracy of a given approximate solution and the a priori estimate is used to predict the mesh refinements and polynomial enrichment needed to deliver the desired solution. Numerical examples demonstrate the reliability of the a posteriori error estimates and the effectiveness of the hp-adaptive strategy.

Bey, Kim S.↗

Least-Squares Adaptive Control Using Chebyshev Orthogonal Polynomials

This paper presents a new adaptive control approach using Chebyshev orthogonal polynomials as basis functions in a least-squares functional approximation. The use of orthogonal basis functions improves the function approximation significantly and enables better convergence of parameter estimates. Flight control simulations demonstrate the effectiveness of the proposed adaptive control approach.

Nguyen, Nhan T.↗

Mappings and accuracy for Chebyshev pseudo-spectral approximations

The effect of mappings on the approximation, by Chebyshev collocation, of functions which exhibit localized regions of rapid variation is studied. A general strategy is introduced whereby mappings are adaptively constructed which map specified classes of rapidly varying functions into low order polynomials which can be accurately approximated by Chebyshev polynomial expansions. A particular family of mappings constructed in this way is tested on a variety of rapidly varying functions similar to those occurring in approximations. It is shown that the mapped function can be approximated much more accurately by Chebyshev polynomial approximations than in physical space or where mappings constructed from other strategies are employed.

Bayliss, Alvin↗

Mappings and accuracy for Chebyshev pseudo-spectral approximations

The effect of mappings on the approximation, by Chebyshev collocation, of functions which exhibit localized regions of rapid variation is studied. A general strategy is introduced whereby mappings are adaptively constructed which map specified classes of rapidly varying functions into low order polynomials which can be accurately approximated by Chebyshev polynomial expansions. A particular family of mappings constructed in this way is tested on a variety of rapidly varying functions similar to those occurring in approximations. It is shown that the mapped function can be approximated much more accurately by Chebyshev polynomial approximations than in physical space or where mappings constructed from other strategies are employed.

Bayliss, Alvin↗

Finite-volume application of high-order ENO schemes to two-dimensional boundary-value problems

Finite-volume applications of high-order accurate ENO schemes to two-dimensional boundary-value problems are studied. These schemes achieve high-order spatial accuracy, in smooth regions, by a piecewise polynomial approximation of the solution from cell averages. In addition, this spatial operation involves an adaptive stencil algorithm in order to avoid the oscillatory behavior that is associated with interpolation across steep gradients. High-order TVD Runge-Kutta methods are employed for time integration, thus making these schemes best suited for unsteady problems. Fifth- and sixth-order accurate applications are validated through a grid refinement study involving the solutions of scalar hyperbolic equations. A previously proposed extension for the Euler equations of gas dynamics is tested, including its application to solutions of boundary-value problems involving solid walls and curvilinear coordinates.

Casper, Jay↗

A wavelet-optimized, very high order adaptive grid and order numerical method

Differencing operators of arbitrarily high order can be constructed by interpolating a polynomial through a set of data followed by differentiation of this polynomial and finally evaluation of the polynomial at the point where a derivative approximation is desired. Furthermore, the interpolating polynomial can be constructed from algebraic, trigonometric, or, perhaps exponential polynomials. This paper begins with a comparison of such differencing operator construction. Next, the issue of proper grids for high order polynomials is addressed. Finally, an adaptive numerical method is introduced which adapts the numerical grid and the order of the differencing operator depending on the data. The numerical grid adaptation is performed on a Chebyshev grid. That is, at each level of refinement the grid is a Chebvshev grid and this grid is refined locally based on wavelet analysis.

Jameson, Leland↗

Uniformly high order accurate essentially non-oscillatory schemes. III

In the present continuation of development and analysis efforts towards essentially nonoscillatory shock-capturing approximations of hyperbolic conservation laws, the Godunov (1959) scheme and its MUSCL second-order-accurate extension are generalized to an arbitrary order of accuracy by means of a hierarchy of uniformly high-order-accurate schemes. The design method, which involves the solution's essentially nonoscillatory piecewise polynomial reconstruction on the basis of its cell averages, followed by time-evolution through an approximate solution of the resulting initial value problem and its averaging over each cell, employs an adaptive stencil of grid points to yield schemes that are highly nonlinear.

Harten, Ami↗

On adaptive weighted polynomial preconditioning for Hermitian positive definite matrices

The conjugate gradient algorithm for solving Hermitian positive definite linear systems is usually combined with preconditioning in order to speed up convergence. In recent years, there has been a revival of polynomial preconditioning, motivated by the attractive features of the method on modern architectures. Standard techniques for choosing the preconditioning polynomial are based only on bounds for the extreme eigenvalues. Here a different approach is proposed, which aims at adapting the preconditioner to the eigenvalue distribution of the coefficient matrix. The technique is based on the observation that good estimates for the eigenvalue distribution can be derived after only a few steps of the Lanczos process. This information is then used to construct a weight function for a suitable Chebyshev approximation problem. The solution of this problem yields the polynomial preconditioner. In particular, we investigate the use of Bernstein-Szego weights.

Fischer, Bernd↗

Multi-Dimensional ENO Schemes for General Geometries

A class of ENO schemes is presented for the numerical solution of multidimensional hyperbolic systems of conservation laws in structured and unstructured grids. This is a class of shock-capturing schemes which are designed to compute cell-averages to high order accuracy. The ENO scheme is composed of a piecewise-polynomial reconstruction of the solution form its given cell-averages, approximate evolution of the resulting initial value problem, and averaging of this approximate solution over each cell. The reconstruction algorithm is based on an adaptive selection of stencil for each cell so as to avoid spurious oscillations near discontinuities while achieving high order of accuracy away from them.

Harten, Ami↗

Design of an essentially non-oscillatory reconstruction procedure in finite-element type meshes

An essentially non oscillatory reconstruction for functions defined on finite element type meshes is designed. Two related problems are studied: the interpolation of possibly unsmooth multivariate functions on arbitary meshes and the reconstruction of a function from its averages in the control volumes surrounding the nodes of the mesh. Concerning the first problem, the behavior of the highest coefficients of two polynomial interpolations of a function that may admit discontinuities of locally regular curves is studied: the Lagrange interpolation and an approximation such that the mean of the polynomial on any control volume is equal to that of the function to be approximated. This enables the best stencil for the approximation to be chosen. The choice of the smallest possible number of stencils is addressed. Concerning the reconstruction problem, two methods were studied: one based on an adaptation of the so called reconstruction via deconvolution method to irregular meshes and one that lies on the approximation on the mean as defined above. The first method is conservative up to a quadrature formula and the second one is exactly conservative. The two methods have the expected order of accuracy, but the second one is much less expensive than the first one. Some numerical examples are given which demonstrate the efficiency of the reconstruction.

Abgrall, Remi↗

Multidisciplinary Design Optimization of a Full Vehicle with High Performance Computing

Multidisciplinary design optimization (MDO) of a full vehicle under the constraints of crashworthiness, NVH (Noise, Vibration and Harshness), durability, and other performance attributes is one of the imperative goals for automotive industry. However, it is often infeasible due to the lack of computational resources, robust simulation capabilities, and efficient optimization methodologies. This paper intends to move closer towards that goal by using parallel computers for the intensive computation and combining different approximations for dissimilar analyses in the MDO process. The MDO process presented in this paper is an extension of the previous work reported by Sobieski et al. In addition to the roof crush, two full vehicle crash modes are added: full frontal impact and 50% frontal offset crash. Instead of using an adaptive polynomial response surface method, this paper employs a DOE/RSM method for exploring the design space and constructing highly nonlinear crash functions. Two NMO strategies are used and results are compared. This paper demonstrates that with high performance computing, a conventionally intractable real world full vehicle multidisciplinary optimization problem considering all performance attributes with large number of design variables become feasible.

Yang, R. J.↗

Compression of ephemerides by discrete Chebyshev approximations

The use of Chebyshev series in representing the ephemerides of satellites and planets in terms of truncated polynomial series is discussed. Emphasis is placed on a FORTRAN package which was developed for fitting satellite orbits. The features desired in any approximation are: (1) the ability to compress a satellite emphemeris; (2) the ability to represent a satellite ephemeris over several orbits; (3) guaranteed accuracy to within prescribed tolerance over the time interval of consideration; and (4) fast processing. These features are imposed with an eye towards adapting the approximation for use on microprocessor applications in which storage is limited and real time processing is required.

Pickard, H. M.↗

Uniformly high order accurate essentially non-oscillatory schemes 3

In this paper (a third in a series) the construction and the analysis of essentially non-oscillatory shock capturing methods for the approximation of hyperbolic conservation laws are presented. Also presented is a hierarchy of high order accurate schemes which generalizes Godunov's scheme and its second order accurate MUSCL extension to arbitrary order of accuracy. The design involves an essentially non-oscillatory piecewise polynomial reconstruction of the solution from its cell averages, time evolution through an approximate solution of the resulting initial value problem, and averaging of this approximate solution over each cell. The reconstruction algorithm is derived from a new interpolation technique that when applied to piecewise smooth data gives high-order accuracy whenever the function is smooth but avoids a Gibbs phenomenon at discontinuities. Unlike standard finite difference methods this procedure uses an adaptive stencil of grid points and consequently the resulting schemes are highly nonlinear.

Harten, A.↗

Adaptive Optimization for System Performance and Combined Bernstein Polynomial, Optimal Reciprocal Collision Avoidance, Differential Dynamic Programming for Trajectory Replanning and Collision Avoidance for UAM Vehicles

The emerging urban air mobility (UAM) sector in aerospace is driving development of unconventional multi-modal vehicle configurations and autonomous flight. The combination of multi-modal vehicle dynamics, complex environment, requirements to deal with flight contingencies in an efficient and safe manner, as well as necessity for precise trajectory following and performance, are the driving influence behind adaptive optimization for system performance. We are interested in trajectory optimization algorithm that would system parameter estimation and identifying the optimal switching time between modes of hybrid dynamical systems. This presentation discusses a parameterized optimal control trajectory optimization algorithm that is an extended and generalized version of Differential Dynamic Programming (DDP), titled Parameterized Differential Dynamic Programming (PDDP). DDP is an efficient trajectory optimization algorithm relying on second order approximations of a system’s dynamics and cost function and has recently been applied to optimize systems with time invariant parameters. Experiments are presented applying PDDP to solve model predictive control (MPC) and moving horizon estimation (MHE) tasks simultaneously. In particular, PDDP is used to determine the optimal transition point between flight regimes of a complex urban air mobility (UAM) class vehicle exhibiting multiple phases of flight and to identify and compensate for actuation faults.

optimization↗