Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Polynomial interpolation”

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

Large time-step stability of explicit one-dimensional advection schemes

There is a wide-spread belief that most explicit one-dimensional advection schemes need to satisfy the so-called 'CFL condition' - that the Courant number, c = udelta(t)/delta(x), must be less than or equal to one, for stability in the von Neumann sense. This puts severe limitations on the time-step in high-speed, fine-grid calculations and is an impetus for the development of implicit schemes, which often require less restrictive time-step conditions for stability, but are more expensive per time-step. However, it turns out that, at least in one dimension, if explicit schemes are formulated in a consistent flux-based conservative finite-volume form, von Neumann stability analysis does not place any restriction on the allowable Courant number. Any explicit scheme that is stable for c is less than 1, with a complex amplitude ratio, G(c), can be easily extended to arbitrarily large c. The complex amplitude ratio is then given by exp(- (Iota)(Nu)(Theta)) G(delta(c)), where N is the integer part of c, and delta(c) = c - N (less than 1); this is clearly stable. The CFL condition is, in fact, not a stability condition at all, but, rather, a 'range restriction' on the 'pieces' in a piece-wise polynomial interpolation. When a global view is taken of the interpolation, the need for a CFL condition evaporates. A number of well-known explicit advection schemes are considered and thus extended to large delta(t). The analysis also includes a simple interpretation of (large delta(t)) total-variation-diminishing (TVD) constraints.

Leonard, B. P.↗

On the Gibbs phenomenon 5: Recovering exponential accuracy from collocation point values of a piecewise analytic function

The paper presents a method to recover exponential accuracy at all points (including at the discontinuities themselves), from the knowledge of an approximation to the interpolation polynomial (or trigonometrical polynomial). We show that if we are given the collocation point values (or a highly accurate approximation) at the Gauss or Gauss-Lobatto points, we can reconstruct a uniform exponentially convergent approximation to the function f(x) in any sub-interval of analyticity. The proof covers the cases of Fourier, Chebyshev, Legendre, and more general Gegenbauer collocation methods.

Gottlieb, David↗

Discrete-Layer Piezoelectric Plate and Shell Models for Active Tip-Clearance Control

The objectives of this work were to develop computational tools for the analysis of active-sensory composite structures with added or embedded piezoelectric layers. The targeted application for this class of smart composite laminates and the analytical development is the accomplishment of active tip-clearance control in turbomachinery components. Two distinct theories and analytical models were developed and explored under this contract: (1) a discrete-layer plate theory and corresponding computational models, and (2) a three dimensional general discrete-layer element generated in curvilinear coordinates for modeling laminated composite piezoelectric shells. Both models were developed from the complete electromechanical constitutive relations of piezoelectric materials, and incorporate both displacements and potentials as state variables. This report describes the development and results of these models. The discrete-layer theories imply that the displacement field and electrostatic potential through-the-thickness of the laminate are described over an individual layer rather than as a smeared function over the thickness of the entire plate or shell thickness. This is especially crucial for composites with embedded piezoelectric layers, as the actuating and sensing elements within these layers are poorly represented by effective or smeared properties. Linear Lagrange interpolation polynomials were used to describe the through-thickness laminate behavior. Both analytic and finite element approximations were used in the plane or surface of the structure. In this context, theoretical developments are presented for the discrete-layer plate theory, the discrete-layer shell theory, and the formulation of an exact solution for simply-supported piezoelectric plates. Finally, evaluations and results from a number of separate examples are presented for the static and dynamic analysis of the plate geometry. Comparisons between the different approaches are provided when possible, and initial conclusions regarding the accuracy and limitations of these models are given.

Heyliger, P. R.↗

A comparative study of upwind and MacCormack schemes for CAA benchmark problems

In this study, upwind schemes and MacCormack schemes are evaluated as to their suitability for aeroacoustic applications. The governing equations are cast in a curvilinear coordinate system and discretized using finite volume concepts. A flux splitting procedure is used for the upwind schemes, where the signals crossing the cell faces are grouped into two categories: signals that bring information from outside into the cell, and signals that leave the cell. These signals may be computed in several ways, with the desired spatial and temporal accuracy achieved by choosing appropriate interpolating polynomials. The classical MacCormack schemes employed here are fourth order accurate in time and space. Results for categories 1, 4, and 6 of the workshop's benchmark problems are presented. Comparisons are also made with the exact solutions, where available. The main conclusions of this study are finally presented.

Viswanathan, K.↗

On the Use of a Mixed Gaussian/Finite-Element Basis Set for the Calculation of Rydberg States

Configuration-interaction studies are reported for the Rydberg states of the helium atom using mixed Gaussian/finite-element (GTO/FE) one particle basis sets. Standard Gaussian valence basis sets are employed, like those, used extensively in quantum chemistry calculations. It is shown that the term values for high-lying Rydberg states of the helium atom can be obtained accurately (within 1 cm -1), even for a small GTO set, by augmenting the n-particle space with configurations, where orthonormalized interpolation polynomials are singly occupied.

Thuemmel, Helmar T.↗

Toward Immersed Boundary Simulation of High Reynolds Number Flows

In the immersed boundary (IB) method, the surface of an object is reconstructed with forcing terms in the underlying flow field equations. The surface may split a computational cell removing the constraint of the near wall gridlines to be aligned with the surface. This feature greatly simplifies the grid generation process which is cumbersome and expensive in particular for structured grids and complex geometries. The IB method is ideally suited for Cartesian flow solvers. The flow equations written in Cartesian coordinates appear in a very simple form and several numerical algorithms can be used for an efficient solution of the equations. In addition, the accuracy of numerical algorithms is dependent on the underlying grid and it usually deteriorates when the grid deviates from a Cartesian mesh. The challenge for the IB method lies in the representation of the wall boundaries and in providing an adequate near wall flow field resolution. The issue of enforcing no-slip boundary conditions at the immersed surface has been addressed by several authors by imposing a local reconstruction of the solution. Initial work by Verzicco et al. was based on a simple linear, one-dimensional operator and this approach proved to be accurate for boundaries largely aligned with the grid lines. Majumdar et al. used various multidimensional and high order polynomial interpolations schemes. These high order schemes, however, are keen to introduce wiggles and spurious extrema. Iaccarino & Verzicco and Kalitzin & Iaccarino proposed a tri-linear reconstruction for the velocity components and the turbulent scalars. A modified implementation that has proven to be more robust is reported in this paper. The issue of adequate near wall resolution in a Cartesian framework can initially be addressed by using a non-uniform mesh which is stretched near the surface. In this paper, we investigate an unstructured approach for local grid refinement that utilizes Cartesian mesh features. The computation of high Reynolds number wall bounded flows is particularly challenging as it requires the consideration of thin turbulent boundary layers, i.e. near wall regions with large gradients of the flow field variables. For such flows, the representation of the wall boundary has a large impact on the accuracy of the computation. It is also critical for the robustness and convergence of the flow solver.

Kalitzin, Georgi↗

Close-Range Photogrammetry with Video Cameras

Examples of photogrammetric measurements made with video cameras uncorrected for electronic and optical lens distortions are presented. The measurement and correction of electronic distortions of video cameras using both bilinear and polynomial interpolation are discussed. Examples showing the relative stability of electronic distortions over long periods of time are presented. Having corrected for electronic distortion, the data are further corrected for lens distortion using the plumb line method. Examples of close-range photogrammetric data taken with video cameras corrected for both electronic and optical lens distortion are presented.

Burner, A. W.↗

Accurate Adaptive Level Set Method and Sharpening Technique for Three Dimensional Deforming Interfaces

In this paper, we demonstrate improved accuracy of the level set method for resolving deforming interfaces by proposing two key elements: (1) accurate level set solutions on adapted Cartesian grids by judiciously choosing interpolation polynomials in regions of different grid levels and (2) enhanced reinitialization by an interface sharpening procedure. The level set equation is solved using a fifth order WENO scheme or a second order central differencing scheme depending on availability of uniform stencils at each grid point. Grid adaptation criteria are determined so that the Hamiltonian functions at nodes adjacent to interfaces are always calculated by the fifth order WENO scheme. This selective usage between the fifth order WENO and second order central differencing schemes is confirmed to give more accurate results compared to those in literature for standard test problems. In order to further improve accuracy especially near thin filaments, we suggest an artificial sharpening method, which is in a similar form with the conventional re-initialization method but utilizes sign of curvature instead of sign of the level set function. Consequently, volume loss due to numerical dissipation on thin filaments is remarkably reduced for the test problems

Kim, Hyoungin↗

Fitting Nonlinear Curves by use of Optimization Techniques

MULTIVAR is a FORTRAN 77 computer program that fits one of the members of a set of six multivariable mathematical models (five of which are nonlinear) to a multivariable set of data. The inputs to MULTIVAR include the data for the independent and dependent variables plus the user s choice of one of the models, one of the three optimization engines, and convergence criteria. By use of the chosen optimization engine, MULTIVAR finds values for the parameters of the chosen model so as to minimize the sum of squares of the residuals. One of the optimization engines implements a routine, developed in 1982, that utilizes the Broydon-Fletcher-Goldfarb-Shanno (BFGS) variable-metric method for unconstrained minimization in conjunction with a one-dimensional search technique that finds the minimum of an unconstrained function by polynomial interpolation and extrapolation without first finding bounds on the solution. The second optimization engine is a faster and more robust commercially available code, denoted Design Optimization Tool, that also uses the BFGS method. The third optimization engine is a robust and relatively fast routine that implements the Levenberg-Marquardt algorithm.

Hill, Scott A.↗

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↗

Polynominal Interpolation Methods for Viscous Flow Calculations

Higher-order collocation procedures resulting in tridiagonal matrix systems are derived from polynomial spline interpolation and by Hermitian (Taylor series) finite-difference discretization. The similarities and special features of these different developments are discussed. The governing systems apply for both uniform and variable meshes. Hybrid schemes resulting from two different polynomial approximations for the first and second derivatives lead to a nonuniform mesh extension of the so-called compact or Pad? difference technique (Hermite 4). A variety of fourth-order methods are described and the Hermitian approach is extended to sixth-order (Hermite 6). The appropriate spline boundary conditions are derived for all procedures. For central finite differences, this leads to a two-point, second-order accurate generalization of the commonly used three-point end-difference formula. Solutions with several spline and Hermite procedures are presented for the boundary layer equations, with and without mass transfer, and for the incompressible viscous flow in a driven cavity. Divergence and nondivergence equations are considered for the cavity. Among the fourth-order techniques, it is shown that spline 4 has the smallest truncation error. The spline 4 procedure generally requires one-quarter the number of mesh points in a given coordinate direction as a central finite-difference calculation of equal accuracy. The Hermite 6 procedure leads to remarkably accurate boundary layer solutions.

Rubin, S. G.↗

Time-step dependent force interpolation scheme for suppressing numerical Cherenkov instability in relativistic particle-in-cell simulations

The WT scheme, a piecewise polynomial force interpolation scheme with time-step dependency, is proposed in this paper for relativistic particle-in-cell (PIC) simulations. The WT scheme removes the lowest order numerical Cherenkov instability (NCI) growth rate for arbitrary time steps allowed by the Courant condition. While NCI from higher order resonances is still present, the numerical tests show that for smaller time steps, the numerical instability grows much slower than using the optimal time step found in previous studies. The WT scheme is efficient for improving the quality and flexibility of relativistic PIC simulations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Polynomial Similarity Transformation Theory: A smooth interpolation between coupled cluster doubles and projected BCS applied to the reduced BCS Hamiltonian

We present a similarity transformation theory based on a polynomial form of a particle-hole pair excitation operator. In the weakly correlated limit, this polynomial becomes an exponential, leading to coupled cluster doubles. In the opposite strongly correlated limit, the polynomial becomes an extended Bessel expansion and yields the projected BCS wavefunction. In between, we interpolate using a single parameter. The e ective Hamiltonian is non-hermitian and this Polynomial Similarity Transformation Theory follows the philosophy of traditional coupled cluster, left projecting the transformed Hamiltonian onto subspaces of the Hilbert space in which the wave function variance is forced to be zero. Similarly, the interpolation parameter is obtained through minimizing the next residual in the projective hierarchy. We rationalize and demonstrate how and why coupled cluster doubles is ill suited to the strongly correlated limit whereas the Bessel expansion remains well behaved. The model provides accurate wave functions with energy errors that in its best variant are smaller than 1% across all interaction stengths. The numerical cost is polynomial in system size and the theory can be straightforwardly applied to any realistic Hamiltonian.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimization of the determinant of the Vandermonde matrix and related matrices

Various techniques for interpolation of data, moment matching in stochastic applications and various methods in numerical analysis can be described using Vandermonde matrices. For this reason the properties of the determinant of the Vandermonde matrix and related matrices are interesting. Here the extreme points of the Vandermonde determinant, and related determinants, on some simple surfaces such as the unit sphere are analyzed, both numerically and analytically. Some results are also visualized in various dimensions. The extreme points of the Vandermonde determinant are also related to the roots of certain orthogonal polynomials such as the Hermite polynomials.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dynamic graphs, community detection, and Riemannian geometry

A community is a subset of a wider network where the members of that subset are more strongly connected to each other than they are to the rest of the network. In this paper, we consider the problem of identifying and tracking communities in graphs that change over time {dynamic community detection} and present a framework based on Riemannian geometry to aid in this task. Our framework currently supports several important operations such as interpolating between and averaging over graph snapshots. We compare these Riemannian methods with entry-wise linear interpolation and that the Riemannian methods are generally better suited to dynamic community detection. Next steps with the Riemannian framework include developing higher-order interpolation methods (e.g. the analogues of polynomial and spline interpolation) and a Riemannian least-squares regression method for working with noisy data.

dynamic community detection↗

Managing uncertainty in data-driven simulation-based optimization

Optimization using data from complex simulations has become an attractive decision-making option, due to ability to embed high-fidelity, non-linear understanding of processes within the search for optimal values. Due to lack of tractable algebraic equations, the link between simulations and optimization is oftentimes a surrogate metamodel. However, several forms of uncertainty exist within the cycle that links simulation data, to metamodels, to optimization. Uncertainty may originate from parameters of the simulation, or the form and fitted parameters of the metamodel. This paper reviews different literatures that are relevant to surrogate-based optimization and proposes different strategies for handling uncertainty, by combining machine learning with stochastic programming, robust optimization, and discrepancy modeling. We show that incorporating uncertainty management within simulation-based optimization leads to more robust solutions, which protect the decision-maker from infeasible solutions. Here, we present the results of our proposed approaches through a case study for direct-air capture through temperature swing adsorption.

42 ENGINEERING↗

Electromagnetic wave propagation based upon spectral-element methodology in dispersive and attenuating media

SUMMARY We build on mathematical equivalences between Maxwell’s wave equations for an electromagnetic medium and elastic seismic wave equations. This allows us to readily model Maxwell’s wave propagation in the spectral-element codes SPECFEM2D and SPECFEM3D, written for acoustic, viscoelastic and poroelastic seismic wave propagation, providing the ability to handle complex geometries, inherent to finite-element methods and retaining the strength of exponential convergence and accuracy due to the use of high-degree polynomials to interpolate field functions on the elements, characteristic to spectral-element methods (SEMs). Attenuation and dispersion processes related to the frequency dependence of dielectric permittivity and conductivity are also included using a Zener model, similar to shear attenuation in viscoelastic media or viscous diffusion in poroelastic media, and a Kelvin–Voigt model, respectively. Ability to account for anisotropic media is also discussed. Here, we limit ourselves to certain dielectric permittivity tensor geometries, in order to conserve a diagonal mass matrix after discretization of the system of equations. Doing so, simulation of Maxwell’s wave equations in the radar frequency range based on SEM can be solved using explicit time integration schemes well suited for parallel computation. We validate our formulation with analytical solutions. In 2-D, our implementation allows for the modelling of both a transverse magnetic (TM) mode, suitable for surface based reflection ground penetration radar type of applications, and a transverse electric (TE) mode more suitable for crosshole and vertical radar profiling setups. Two 2-D examples are designed to demonstrated the use of the TM and TE modes. A 3-D example is also presented, which allows for the full TEM solution, different antenna orientations, and out-of-plane variations in material properties.

58 GEOSCIENCES↗