Search NASA⌕ Search

SEARCH · Search NASA

Results for “CHEBYSHEV APPROXIMATION”

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 109 records · Page 6

Linear iterative solvers for implicit ODE methods

The numerical solution of stiff initial value problems, which lead to the problem of solving large systems of mildly nonlinear equations are considered. For many problems derived from engineering and science, a solution is possible only with methods derived from iterative linear equation solvers. A common approach to solving the nonlinear equations is to employ an approximate solution obtained from an explicit method. The error is examined to determine how it is distributed among the stiff and non-stiff components, which bears on the choice of an iterative method. The conclusion is that error is (roughly) uniformly distributed, a fact that suggests the Chebyshev method (and the accompanying Manteuffel adaptive parameter algorithm). This method is described, also commenting on Richardson's method and its advantages for large problems. Richardson's method and the Chebyshev method with the Mantueffel algorithm are applied to the solution of the nonlinear equations by Newton's method.

Saylor, Paul E.↗

Single scattering from nonspherical Chebyshev particles: A compendium of calculations

A large set of exact calculations of the scattering from a class of nonspherical particles known as Chebyshev particles' has been performed. Phase function and degree of polarization in random orientation, and parallel and perpendicular intensities in fixed orientations, are plotted for a variety of particles shapes and sizes. The intention is to furnish a data base against which both experimental data, and the predictions of approximate methods, can be tested. The calculations are performed with the widely-used Extended Boundary Condition Method. An extensive discussion of this method is given, including much material that is not easily available elsewhere (especially the analysis of its convergence properties). An extensive review is also given of all extant methods for nonspherical scattering calculations, as well as of the available pool of experimental data.

Wiscombe, W. J.↗

A conservative staggered-grid Chebyshev multidomain method for compressible flows

We present a new multidomain spectral collocation method that uses staggered grids for the solution of compressible flow problems. The solution unknowns are defined at the nodes of a Gauss quadrature rule. The fluxes are evaluated at the nodes of a Gauss-Lobatto rule. The method is conservative, free-stream preserving, and exponentially accurate. A significant advantage of the method is that subdomain corners are not included in the approximation, making solutions in complex geometries easier to compute.

Kopriva, David A.↗

Arrangement of vortex lattices

A new method is developed for solving the lifting-surface equation for thin wings. The solution requires the downwash equation to be in the form of Cauchy integrals which can be interpreted as a vortex lattice with the positions of the vortices and control points dictated by the finite sum used to approximate the integrals involved. Lan's continuous loading method is employed for the chordwise integral since it properly accounts for the leading-edge singularity, Cauchy singularity, and Kutta condition. Unlike Lan, the spanwise loading is also continuous and the Cauchy singularity in the spanwise integral is also properly accounted for by using the midpoint trapezoidal rule and the theory of Chebyshev polynomials. This technique yields the exact classical solution to Prandtl's lifting-line equation.The solution to the lifting-surface equation for rectangular wings was found to compare well with other continuous loading methods, but with much smaller computational times, and to converge faster than other vortex lattice methods.

Dejarnette, F. R.↗

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

The time evolution of spectral discretizations of hyperbolic systems

A Chebyshev collocation spectral method, applied to hyperbolic systems is considered, particularly for those initial boundary value problems which possess only solutions tending to zero at large times. It is shown that the numerical solutions of the system will also vanish at infinity, if and only if, the numerical solution of a scalar equation of the same type does. This result is then generalized for other spectral approximations.

Lustman, L.↗

Effects of Nonsphericity on the Behavior of Lorenz-Mie Resonances in Scattering Characteristics of Liquid-Cloud Droplets

By using the results of highly accurate T-matrix computations for randomly oriented oblate and prolate spheroids and Chebyshev particles with varying degrees of asphericity, we analyze the effects of a deviation of water-droplet shapes from that of a perfect sphere on the behavior of Lorenz-Mie morphology-dependent resonances of various widths. We demonstrate that the positions and profiles of the resonances can change significantly with increasing asphericity. The absolute degree of asphericity required to suppress a Lorenz-Mie resonance is approximately proportional to the resonance width. Our results imply that numerical averaging of scattering characteristics of real cloud droplets over sizes may rely on a significantly coarser size-parameter resolution than that required for ideal, perfectly spherical particles.

matrices (mathematics)↗

Leapfrog variants of iterative methods for linear algebra equations

Two iterative methods are considered, Richardson's method and a general second order method. For both methods, a variant of the method is derived for which only even numbered iterates are computed. The variant is called a leapfrog method. Comparisons between the conventional form of the methods and the leapfrog form are made under the assumption that the number of unknowns is large. In the case of Richardson's method, it is possible to express the final iterate in terms of only the initial approximation, a variant of the iteration called the grand-leap method. In the case of the grand-leap variant, a set of parameters is required. An algorithm is presented to compute these parameters that is related to algorithms to compute the weights and abscissas for Gaussian quadrature. General algorithms to implement the leapfrog and grand-leap methods are presented. Algorithms for the important special case of the Chebyshev method are also given.

Saylor, Paul E.↗

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↗

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

Stability analysis of spectral methods for hyperbolic initial-boundary value systems

A constant coefficient hyperbolic system in one space variable, with zero initial data is discussed. Dissipative boundary conditions are imposed at the two points x = + or - 1. This problem is discretized by a spectral approximation in space. Sufficient conditions under which the spectral numerical solution is stable are demonstrated - moreover, these conditions have to be checked only for scalar equations. The stability theorems take the form of explicit bounds for the norm of the solution in terms of the boundary data. The dependence of these bounds on N, the number of points in the domain (or equivalently the degree of the polynomials involved), is investigated for a class of standard spectral methods, including Chebyshev and Legendre collocations.

Gottlieb, D.↗

Sensitivity Analysis of Flutter Response of a Wing Incorporating Finite-Span Corrections

Flutter analysis of a wing is performed in compressible flow using state-space representation of the unsteady aerodynamic behavior. Three different expressions are used to incorporate corrections due to the finite-span effects of the wing in estimating the lift-curve slope. The structural formulation is based on a Rayleigh-Pitz technique with Chebyshev polynomials used for the wing deflections. The aeroelastic equations are solved as an eigen-value problem to determine the flutter speed of the wing. The flutter speeds are found to be higher in these cases, when compared to that obtained without accounting for the finite-span effects. The derivatives of the flutter speed with respect to the shape parameters, namely: aspect ratio, area, taper ratio and sweep angle, are calculated analytically. The shape sensitivity derivatives give a linear approximation to the flutter speed curves over a range of values of the shape parameter which is perturbed. Flutter and sensitivity calculations are performed on a wing using a lifting-surface unsteady aerodynamic theory using modules from a system of programs called FAST.

Issac, Jason Cherian↗

Topics in spectral methods

After detailing the construction of spectral approximations to time-dependent mixed initial boundary value problems, a study is conducted of differential equations of the form 'partial derivative of u/partial derivative of t = Lu + f', where for each t, u(t) belongs to a Hilbert space such that u satisfies homogeneous boundary conditions. For the sake of simplicity, it is assumed that L is an unbounded, time-independent linear operator. Attention is given to Fourier methods of both Galerkin and pseudospectral method types, the Galerkin method, the pseudospectral Chebyshev and Legendre methods, the error equation, hyperbolic partial differentiation equations, and time discretization and iterative methods.

Gottlieb, D.↗

Scalable Bayesian Physics-Informed Kolmogorov-Arnold Networks

Uncertainty quantification (UQ) plays a pivotal role in scientific machine learning, especially when surrogate models are used to approximate complex systems. Although multilayer perceptions (MLPs) are commonly employed as surrogates, they often suffer from overfitting due to their large number of parameters. Kolmogorov-Arnold networks (KANs) offer an alternative solution with fewer parameters. However, gradient-based inference methods, such as Hamiltonian Monte Carlo (HMC), may result in computational inefficiency when applied to KANs, especially for large-scale datasets, due to the high cost of back-propagation. To address these challenges, we propose a novel approach, combining the dropout Tikhonov ensemble Kalman inversion (DTEKI) with Chebyshev KANs. This gradient-free method effectively mitigates overfitting and enhances numerical stability. In addition, we incorporate the active subspace method to reduce the parameter-space dimensionality, allowing us to improve the accuracy of predictions and obtain more reliable uncertainty estimates. Extensive experiments demonstrate the efficacy of our approach in various test cases, including scenarios with large datasets and high noise levels. Our results show that the new method achieves comparable or better accuracy, much higher efficiency as well as stability compared to HMC, in addition to scalability. Moreover, by leveraging the low-dimensional parameter subspace, our method preserves prediction accuracy while substantially reducing further the computational cost.

97 MATHEMATICS AND COMPUTING↗

Approximate solutions to minimax optimal control problems for aeroassisted orbital transfer

The maneuver considered in the present investigation involves the coplanar transfer of a spacecraft from a high earth orbit (HEO) to a low earth orbit (LEO). HEO can be a geosynchronous earth orbit (GEO). The basic concept utilized involves the hybrid combination of propulsive maneuvers in space and aerodynamic maneuvers in the sensible atmosphere. The considered type of flight is also called synergetic space flight. With respect to the atmospheric part of the maneuver, trajectory control is achieved by means of lift modulation. The Bolza problem of optimal control is stated, and the first-order optimality conditions for this problem are given. The one-arc approach, the two-arc approach, and the three-subarc approach are discussed. Attention is given to the Chebyshev problem of optimal control, details concerning aeroassisted orbital transfer (AOT), AOT optimization problems, and numerical experiments.

Miele, A.↗

Phase Screen Determination for the GeoSAR Interferometric Mapping Instrument

GeoSAR is a dual frequency airborne radar interferometric mapping instrument designed to obtain high resolution and high accuracy digital elevation models. The X-band inteferometric antennas are mounted beneath the fuselage with a separation distance of 2.6 m. Midway between the antennas along the aircraft centerline is a large fairing housing the Laser Baseline metrology System (LBMS) and Inertial Navigtion Units (INUs). The P-band antennas are mounted in wingtip pods approximately 10 m from the aircraft centerline. Multipath signals reflected from the LBMS fairing cause phase distortions corrupting the topograhic height measurements for both the X-band and P-band systems. In addition multipath off the wing affects the P-band phase measurements. In this paper we discuss a technique used to mitigate the amount of X-Band multipath and methods calibrating and correcting the phase for both X-Band and P-Band using a high accuracy DEM. Height differences between the interferometrically derived elevations and a photogrammetrically derived DEM are converted into phase differences. Multipath phase errors are sinusoidal with spatial frequency and amplitude related to the magnitude of reflection of the multipath reflection point and its distance from the interferometric antennas. These phase residuals are fitted using a Chebyshev polynomial sequence and used as a phase screen in the processor to correct the phase prior to height reconstruction. Based on the correction signal it is possible to estimate the location and magnitude of the multipath signal. This information can then be used to extend the domain of the phase screen over mapping angles not covered during the calibration passes. Keywords: SAR,interferometry,phase screen

Hensley, Scott↗

Validation of three-dimensional incompressible spatial direct numerical simulation code: A comparison with linear stability and parabolic stability equation theories for boundary-layer transition on a flat plate

Spatially evolving instabilities in a boundary layer on a flat plate are computed by direct numerical simulation (DNS) of the incompressible Navier-Stokes equations. In a truncated physical domain, a nonstaggered mesh is used for the grid. A Chebyshev-collocation method is used normal to the wall; finite difference and compact difference methods are used in the streamwise direction; and a Fourier series is used in the spanwise direction. For time stepping, implicit Crank-Nicolson and explicit Runge-Kutta schemes are used to the time-splitting method. The influence-matrix technique is used to solve the pressure equation. At the outflow boundary, the buffer-domain technique is used to prevent convective wave reflection or upstream propagation of information from the boundary. Results of the DNS are compared with those from both linear stability theory (LST) and parabolized stability equation (PSE) theory. Computed disturbance amplitudes and phases are in very good agreement with those of LST (for small inflow disturbance amplitudes). A measure of the sensitivity of the inflow condition is demonstrated with both LST and PSE theory used to approximate inflows. Although the DNS numerics are very different than those of PSE theory, the results are in good agreement. A small discrepancy in the results that does occur is likely a result of the variation in PSE boundary condition treatment in the far field. Finally, a small-amplitude wave triad is forced at the inflow, and simulation results are compared with those of LST. Again, very good agreement is found between DNS and LST results for the 3-D simulations, the implication being that the disturbance amplitudes are sufficiently small that nonlinear interactions are negligible.

Joslin, Ronald D.↗