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 163 records · Page 9

The spectral energy distributions of active galactic nuclei

ABSTRACT We present spectral energy distributions (SEDs) of 41 active galactic nuclei, derived from multiwavelength photometry and archival spectroscopy. All of the SEDs span at least 0.09 to 30 $\mu$m, but in some instances wavelength coverage extends into the X-ray, far-infrared, and radio. For some active galactic nuclei (AGNs) we have fitted the measured far-infrared photometry with greybody models, while radio flux density measurements have been approximated by power laws or polynomials. We have been able to fill some of the gaps in the spectral coverage using interpolation or extrapolation of simple models. In addition to the 41 individual AGN SEDs, we have produced 72 Seyfert SEDs by mixing SEDs of the central regions of Seyferts with galaxy SEDs. Relative to the literature, our templates have broader wavelength coverage and/or higher spectral resolution. We have tested the utility of our SEDs by using them to generate photometric redshifts for 0 < z ≤ 6.12 AGNs in the Boötes field (selected with X-ray, IR, and optical criteria) and, relative to SEDs from the literature, they produce comparable or better photometric redshifts with reduced flux density residuals.

Brown, M. J. I.↗

Characterizing Tradeoffs in Memory, Accuracy, and Speed for Chemistry Tabulation Techniques

Chemistry tabulation is a common approach in practical simulations of turbulent combustion at engineering scales. Linear interpolants have traditionally been used for accessing precomputed multidimensional tables but suffer from large memory requirements and discontinuous derivatives. Higher-degree interpolants address some of these restrictions but are similarly limited to relatively low-dimensional tabulation. Artificial neural networks (ANNs) can be used to overcome these limitations but cannot guarantee the same accuracy as interpolants and introduce challenges in reproducibility and reliable training. These challenges are enhanced as the physics complexity to be represented within the tabulation increases. Here, we assess the efficiency, accuracy, and memory requirements of Lagrange polynomials, tensor product B-splines, and ANNs as tabulation strategies. We analyze results in the context of nonadiabatic flamelet modeling where higher dimension counts are necessary. While ANNs do not require structuring of data, providing benefits for complex physics representation, interpolation approaches often rely on some structuring of the table. Interpolation using structured table inputs that are not directly related to the variables transported in a simulation can incur additional query costs. This is demonstrated in the present implementation of heat losses. We show that ANNs, despite being difficult to train and reproduce, can be advantageous for high-dimensional, unstructured datasets relevant to nonadiabatic flamelet models. Furthermore we demonstrate that Lagrange polynomials show significant speedup for similar accuracy compared to B-splines.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Construction of Response Surface with Higher Order Continuity and Its Application to Reliability Engineering

The usefulness of piecewise polynomials with C1 and C2 derivative continuity for response surface construction method is examined. A Moving Least Squares (MLS) method is developed and compared with four other interpolation methods, including kriging. First the selected methods are applied and compared with one another in a two-design variables problem with a known theoretical response function. Next the methods are tested in a four-design variables problem from a reliability-based design application. In general the piecewise polynomial with higher order derivative continuity methods produce less error in the response prediction. The MLS method was found to be superior for response surface construction among the methods evaluated.

Krishnamurthy, T.↗

Detailed three-dimensional isentropic analysis using an objective cross-sectional approach

An approach is presented which is designed to give detailed, computationally-efficient meteorological objective analyses over data-rich regions, with results independent of numerical model influences. Observed station data and interstation gradients are used to interpolate pressure, wind, and moisture information from vertical cross-sections onto isentropci surfaces by means of cubic polynomials. Three-dimensional grid-point analyses of mass and moisture are obtained by first constructing a series of nearly parallel vertical cross sections over a specified area, and then filling in the space between adjacent vertical analyses by employing a second set of nearly orthogonal cross sections. Gradients obtained from the mass analyses are then combined with observed wind data to obtain thermally-consistent observed wind analyses. It is concluded that the resulting analyses are useful for preserving significnat horizontal and vertical gradients, such as those associated with jet-streak systems. Examples are given which verify the applicability of this analysis technique to radiosonde data.

Petersen, R. A.↗

Polynomial approximation of functions of matrices and its application to the solution of a general system of linear equations

During the process of solving a mathematical model numerically, there is often a need to operate on a vector v by an operator which can be expressed as f(A) while A is NxN matrix (ex: exp(A), sin(A), A sup -1). Except for very simple matrices, it is impractical to construct the matrix f(A) explicitly. Usually an approximation to it is used. In the present research, an algorithm is developed which uses a polynomial approximation to f(A). It is reduced to a problem of approximating f(z) by a polynomial in z while z belongs to the domain D in the complex plane which includes all the eigenvalues of A. This problem of approximation is approached by interpolating the function f(z) in a certain set of points which is known to have some maximal properties. The approximation thus achieved is almost best. Implementing the algorithm to some practical problem is described. Since a solution to a linear system Ax = b is x= A sup -1 b, an iterative solution to it can be regarded as a polynomial approximation to f(A) = A sup -1. Implementing the algorithm in this case is also described.

Tal-Ezer, Hillel↗

DELO-BEZIER FORMAL SOLUTIONS OF THE POLARIZED RADIATIVE TRANSFER EQUATION

We present two new accurate and efficient methods to compute the formal solution of the polarized radiative transfer equation. In this work, the source function and the absorption matrix are approximated using quadratic and cubic Bezier spline interpolants. These schemes provide second- and third-order approximations, respectively, and do not suffer from erratic behavior of the polynomial approximation (overshooting). The accuracy and the convergence of the new method are studied along with other popular solutions of the radiative transfer equation, using stellar atmospheres with strong gradients in the line-of-sight velocity and in the magnetic-field vector.

79 ASTRONOMY AND ASTROPHYSICS↗

Fitting surfaces to scattered data

A variety of numerical methods for fitting a function to data given at a set of points scattered throughout a domain in the plane are surveyed. Four classes of methods are discussed: (1) global interpolation; (2) local interpolation; (3) global approximation; and (4) local approximation. Also, two-stage methods and contouring are discussed. The surfaces constructed include polynomials, spline functions, and rational functions, among others.

Schumaker, L. L.↗

Momentum-space Argonne V18 interaction

This paper gives a momentum-space representation of the Argonne V18 potential as an expansion in products of spin-isospin operators with scalar coefficient functions of the momentum transfer. Two representations of the scalar coefficient functions for the strong part of the interaction are given. One is as an expansion in an orthonormal basis of rational functions and the other as an expansion in Chebyshev polynomials on different intervals. Both provide practical and efficient representations for computing the momentum-space potential that do not require integration or interpolation. Programs based on both expansions are available as supplementary material. Analytic expressions are given for the scalar coefficient functions of the Fourier transform of the electromagnetic part of the Argonne V18. A simple method for computing the partial-wave projections of these interactions from the operator expressions is also given.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

End-to-end GPU acceleration of low-order-refined preconditioning for high-order finite element discretizations

In this article, we present algorithms and implementations for the end-to-end GPU acceleration of matrix-free low-order-refined preconditioning of high-order finite element problems. The methods described here allow for the construction of effective preconditioners for high-order problems with optimal memory usage and computational complexity. The preconditioners are based on the construction of a spectrally equivalent low-order discretization on a refined mesh, which is then amenable to, for example, algebraic multigrid preconditioning. The constants of equivalence are independent of mesh size and polynomial degree. For vector finite element problems in H(curl) and H(div) (e.g., for electromagnetic or radiation diffusion problems), a specially constructed interpolation–histopolation basis is used to ensure fast convergence. Detailed performance studies are carried out to analyze the efficiency of the GPU algorithms. The kernel throughput of each of the main algorithmic components is measured, and the strong and weak parallel scalability of the methods is demonstrated. The different relative weighting and significance of the algorithmic components on GPUs and CPUs is discussed. Results on problems involving adaptively refined nonconforming meshes are shown, and the use of the preconditioners on a large-scale magnetic diffusion problem using all spaces of the finite element de Rham complex is illustrated.

97 MATHEMATICS AND COMPUTING↗

SU-E-T-120: Analytic Dose Verification for Patient-Specific Proton Pencil Beam Scanning Plans

Purpose: To independently verify the QA dose of proton pencil beam scanning (PBS) plans using an analytic dose calculation model. Methods: An independent proton dose calculation engine is created using the same commissioning measurements as those employed to build our commercially available treatment planning system (TPS). Each proton PBS plan is exported from the TPS in DICOM format and calculated by this independent dose engine in a standard 40 x 40 x 40 cm water tank. This three-dimensional dose grid is then compared with the QA dose calculated by the commercial TPS, using standard Gamma criterion. A total of 18 measured pristine Bragg peaks, ranging from 100 to 226 MeV, are used in the model. Intermediate proton energies are interpolated. Similarly, optical properties of the spots are measured in air over 15 cm upstream and downstream, and fitted to a second-order polynomial. Multiple Coulomb scattering in water is approximated analytically using Preston and Kohler formula for faster calculation. The effect of range shifters on spot size is modeled with generalized Highland formula. Note that the above formulation approximates multiple Coulomb scattering in water and we therefore chose not use the full Moliere/Hanson form. Results: Initial examination of 3 patient-specific prostate PBS plans shows that agreement exists between 3D dose distributions calculated by the TPS and the independent proton PBS dose calculation engine. Both calculated dose distributions are compared with actual measurements at three different depths per beam and good agreements are again observed. Conclusion: Results here showed that 3D dose distributions calculated by this independent proton PBS dose engine are in good agreement with both TPS calculations and actual measurements. This tool can potentially be used to reduce the amount of different measurement depths required for patient-specific proton PBS QA.

60 APPLIED LIFE SCIENCES↗

The space-time solution element method: A new numerical approach for the Navier-Stokes equations

This paper is one of a series of papers describing the development of a new numerical method for the Navier-Stokes equations. Unlike conventional numerical methods, the current method concentrates on the discrete simulation of both the integral and differential forms of the Navier-Stokes equations. Conservation of mass, momentum, and energy in space-time is explicitly provided for through a rigorous enforcement of both the integral and differential forms of the governing conservation laws. Using local polynomial expansions to represent the discrete primitive variables on each cell, fluxes at cell interfaces are evaluated and balanced using exact functional expressions. No interpolation or flux limiters are required. Because of the generality of the current method, it applies equally to the steady and unsteady Navier-Stokes equations. In this paper, we generalize and extend the authors' 2-D, steady state implicit scheme. A general closure methodology is presented so that all terms up through a given order in the local expansions may be retained. The scheme is also extended to nonorthogonal Cartesian grids. Numerous flow fields are computed and results are compared with known solutions. The high accuracy of the scheme is demonstrated through its ability to accurately resolve developing boundary layers on coarse grids. Finally, we discuss applications of the current method to the unsteady Navier-Stokes equations.

Scott, James R.↗

Calibration of the E3SM Land Model Using Surrogate‐Based Global Optimization

Abstract Calibration of the Energy Exascale Earth System Model (E3SM), land model (ELMv0) is challenging because of its model complexity, strong model nonlinearity, and significant computational requirements. Therefore, only a limited number of simulations can be allowed in any attempt to find a near‐optimal solution within an affordable time. The goal of this study is to calibrate some of the ELMv0 parameters to improve model projection of carbon fluxes. We propose a computationally efficient global optimization procedure using sparse‐grid based surrogates. We first use advanced sparse grid (SG) interpolation to construct a surrogate system of the ELMv0, and then calibrate the surrogate model in the optimization process. As the surrogate model is a polynomial whose evaluation is fast, it can be efficiently evaluated a sufficiently large number of times in the optimization, which facilitates the global search. We calibrate eight parameters against five years of net ecosystem exchange, total leaf area index, and latent heat flux data from the U.S. Missouri Ozark flux tower. The calibrated model is then used for predicting the three variables in the following 4 years. The results indicate that an accurate surrogate model can be created for the ELMv0 with a relatively small number of SG points, i.e., a few ELMv0 simulations that can be fully parallel. And, the application of the optimized parameters leads to a better model performance and a higher predictive capability than the default parameter values in the ELMv0.

54 ENVIRONMENTAL SCIENCES↗

Potential energy surface fitting by a statistically localized, permutationally invariant, local interpolating moving least squares method for the many-body potential: Method and application to N{sub 4}

Fitting potential energy surfaces to analytic forms is an important first step for efficient molecular dynamics simulations. Here, we present an improved version of the local interpolating moving least squares method (L-IMLS) for such fitting. Our method has three key improvements. First, pairwise interactions are modeled separately from many-body interactions. Second, permutational invariance is incorporated in the basis functions, using permutationally invariant polynomials in Morse variables, and in the weight functions. Third, computational cost is reduced by statistical localization, in which we statistically correlate the cutoff radius with data point density. We motivate our discussion in this paper with a review of global and local least-squares-based fitting methods in one dimension. Then, we develop our method in six dimensions, and we note that it allows the analytic evaluation of gradients, a feature that is important for molecular dynamics. The approach, which we call statistically localized, permutationally invariant, local interpolating moving least squares fitting of the many-body potential (SL-PI-L-IMLS-MP, or, more simply, L-IMLS-G2), is used to fit a potential energy surface to an electronic structure dataset for N{sub 4}. We discuss its performance on the dataset and give directions for further research, including applications to trajectory calculations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quadrature, Interpolation and Observability

Methods of interpolation and quadrature have been used for over 300 years. Improvements in the techniques have been made by many, most notably by Gauss, whose technique applied to polynomials is referred to as Gaussian Quadrature. Stieltjes extended Gauss's method to certain non-polynomial functions as early as 1884. Conditions that guarantee the existence of quadrature formulas for certain collections of functions were studied by Tchebycheff, and his work was extended by others. Today, a class of functions which satisfies these conditions is called a Tchebycheff System. This thesis contains the definition of a Tchebycheff System, along with the theorems, proofs, and definitions necessary to guarantee the existence of quadrature formulas for such systems. Solutions of discretely observable linear control systems are of particular interest, and observability with respect to a given output function is defined. The output function is written as a linear combination of a collection of orthonormal functions. Orthonormal functions are defined, and their properties are discussed. The technique for evaluating the coefficients in the output function involves evaluating the definite integral of functions which can be shown to form a Tchebycheff system. Therefore, quadrature formulas for these integrals exist, and in many cases are known. The technique given is useful in cases where the method of direct calculation is unstable. The condition number of a matrix is defined and shown to be an indication of the the degree to which perturbations in data affect the accuracy of the solution. In special cases, the number of data points required for direct calculation is the same as the number required by the method presented in this thesis. But the method is shown to require more data points in other cases. A lower bound for the number of data points required is given.

Hodges, Lucille McDaniel↗

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↗

Spectral multigrid methods for elliptic equations 2

A detailed description of spectral multigrid methods is provided. This includes the interpolation and coarse-grid operators for both periodic and Dirichlet problems. The spectral methods for periodic problems use Fourier series and those for Dirichlet problems are based upon Chebyshev polynomials. An improved preconditioning for Dirichlet problems is given. Numerical examples and practical advice are included.

Zang, T. A.↗

Spectral multigrid methods for elliptic equations II

A detailed description of spectral multigrid methods is provided. This includes the interpolation and coarse-grid operators for both periodic and Dirichlet problems. The spectral methods for periodic problems use Fourier series and those for Dirichlet problems are based upon Chebyshev polynomials. An improved preconditioning for Dirichlet problems is given. Numerical examples and practical advice are included.

Zang, T. A.↗

Accurate Compression of Tabulated Chemistry Models with Partition of Unity Networks

Tabulated chemistry models are widely used to simulate large-scale turbulent fires in applications including energy generation and fire safety. Tabulation via piecewise Cartesian interpolation suffers from the curse-of-dimensionality, leading to a prohibitive exponential growth in parameters and memory usage as more dimensions are considered. Artificial neural networks (ANNs) have attracted attention for constructing surrogates for chemistry models due to their ability to perform high-dimensional approximation. However, due to well-known pathologies regarding the realization of suboptimal local minima during training, in practice they do not converge and provide unreliable accuracy. Partition of unity networks (POUnets) are a recently introduced family of ANNs which preserve notions of convergence while performing high-dimensional approximation, discovering a mesh-free partition of space which may be used to perform optimal polynomial approximation. In this work, we assess their performance with respect to accuracy and model complexity in reconstructing unstructured flamelet data representative of nonadiabatic pool fire models. Our results show that POUnets can provide the desirable accuracy of classical spline-based interpolants with the low memory footprint of traditional ANNs while converging faster to significantly lower errors than ANNs. For example, we observe POUnets obtaining target accuracies in two dimensions with 40 to 50 times less memory and roughly double the compression in three dimensions. We also address the practical matter of efficiently training accurate POUnets by studying convergence over key hyperparameters, the impact of partition/basis formulation, and the sensitivity to initialization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗