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 199 records · Page 11

Nested polynomial trends for the improvement of Gaussian process-based predictors

The role of simulation keeps increasing for the sensitivity analysis and the uncertainty quantification of complex systems. Such numerical procedures are generally based on the processing of a huge amount of code evaluations. When the computational cost associated with one particular evaluation of the code is high, such direct approaches based on the computer code only, are not affordable. Surrogate models have therefore to be introduced to interpolate the information given by a fixed set of code evaluations to the whole input space. When confronted to deterministic mappings, the Gaussian process regression (GPR), or kriging, presents a good compromise between complexity, efficiency and error control. Such a method considers the quantity of interest of the system as a particular realization of a Gaussian stochastic process, whose mean and covariance functions have to be identified from the available code evaluations. In this context, this work proposes an innovative parametrization of this mean function, which is based on the composition of two polynomials. This approach is particularly relevant for the approximation of strongly non linear quantities of interest from very little information. After presenting the theoretical basis of this method, this work compares its efficiency to alternative approaches on a series of examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Calibration of an agricultural-hydrological model (RZWQM2) using surrogate global optimization

Robust calibration of an agricultural-hydrological model is critical for simulating crop yield and water quality and making reasonable agricultural management. However, calibration of the agricultural-hydrological system models is challenging because of model complexity, the existence of strong parameter correlation, 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, which greatly restricts the successful application of the model. The goal of this study is to locate the optimal solution of the Root Zone Water Quality Model (RZWQM2) given a limited simulation time, so as to improve the model simulation and help make rational and effective agricultural-hydrological decisions. To this end, we propose a computationally efficient global optimization procedure using sparse-grid based surrogates. We first used advanced sparse grid (SG) interpolation to construct a surrogate system of the actual RZWQM2, and then we calibrate the surrogate model using the global optimization algorithm, Quantum-behaved Particle Swarm Optimization (QPSO). As the surrogate model is a polynomial with fast evaluation, it can be efficiently evaluated with a sufficiently large number of times during the optimization, which facilitates the global search. We calibrate seven model parameters against five years of yield, drain flow, and NO 3 -N loss data from a subsurface-drained corn-soybean field in Iowa. Results indicate that an accurate surrogate model can be created for the RZWQM2 with a relatively small number of SG points (i.e., RZWQM2 runs). Compared to the conventional QPSO algorithm, our surrogate-based optimization method can achieve a smaller objective function value and better calibration performance using a fewer number of expensive RZWQM2 executions, which greatly improves computational efficiency.

60 APPLIED LIFE SCIENCES↗

Selection of polynomial chaos bases via Bayesian model uncertainty methods with applications to sparse approximation of PDEs with stochastic inputs

Generalized polynomial chaos (gPC) expansions allow us to represent the solution of a stochastic system using a series of polynomial chaos basis functions. The number of gPC terms increases dramatically as the dimension of the random input variables increases. When the number of the gPC terms is larger than that of the available samples, a scenario that often occurs when the corresponding deterministic solver is computationally expensive, evaluation of the gPC expansion can be inaccurate due to over-fitting. We propose a fully Bayesian approach that allows for global recovery of the stochastic solutions, in both spatial and random domains, by coupling Bayesian model uncertainty and regularization regression methods. It allows the evaluation of the PC coefficients on a grid of spatial points, via (1) the Bayesian model average (BMA) or (2) the median probability model, and their construction as spatial functions on the spatial domain via spline interpolation. The former accounts for the model uncertainty and provides Bayes-optimal predictions; while the latter provides a sparse representation of the stochastic solutions by evaluating the expansion on a subset of dominating gPC bases. Moreover, the proposed methods quantify the importance of the gPC bases in the probabilistic sense through inclusion probabilities. We design a Markov chain Monte Carlo (MCMC) sampler that evaluates all the unknown quantities without the need of ad-hoc techniques. The proposed methods are suitable for, but not restricted to, problems whose stochastic solutions are sparse in the stochastic space with respect to the gPC bases while the deterministic solver involved is expensive. We demonstrate the accuracy and performance of the proposed methods and make comparisons with other approaches on solving elliptic SPDEs with 1-, 14- and 40-random dimensions.

97 MATHEMATICS AND COMPUTING↗

Prediction of Aerodynamic Coefficients for Wind Tunnel Data using a Genetic Algorithm Optimized Neural Network

A fast, reliable way of predicting aerodynamic coefficients is produced using a neural network optimized by a genetic algorithm. Basic aerodynamic coefficients (e.g. lift, drag, pitching moment) are modelled as functions of angle of attack and Mach number. The neural network is first trained on a relatively rich set of data from wind tunnel tests of numerical simulations to learn an overall model. Most of the aerodynamic parameters can be well-fitted using polynomial functions. A new set of data, which can be relatively sparse, is then supplied to the network to produce a new model consistent with the previous model and the new data. Because the new model interpolates realistically between the sparse test data points, it is suitable for use in piloted simulations. The genetic algorithm is used to choose a neural network architecture to give best results, avoiding over-and under-fitting of the test data.

Rajkumar, T.↗

Algorithmic Classification of Raman Spectra Biosignatures: Improving Life Detection Confidence

“Agnostic” biosignatures – indicators of life (or the absence of life), independent of a particular biochemistry – are increasingly considered a high standard for life detection. The Ladder of Life Detection (2018) called for investigating how combinations of independent and different potential biosignatures affect confidence. To address this gap, statistical classification of elemental abundances, isotopic fractionation, and reflectance spectroscopy (VNIR) has been implemented. Raman spectroscopy, highly desirable due to its wide availability, has the potential to improve this predictive power. This work implemented biosignature classification algorithms on Raman data alone, in preparation for combination with the other data types. Raman spectroscopy data was collected from published databases and papers as part of a manually curated dataset of “indicative” and “non-indicative of life” samples. These currently include 61 non-indicative samples (meteorites, magnetite); 3 indicative living samples (bacteria); 20 indicative non-living samples (chalk, bone); and 12 indicative mixed (with non-indicative material) samples (soil, microbial mats). Laboratory work is ongoing to characterize additional samples, particularly a greater breadth of mixed systems. Spectra were interpolated, filtered with the Savitzsky-Golay filter, and de-noised. For a preliminary examination, agnostic features were manually extracted including mean intensity, number of peaks, and mean peak width. Different peak prominences and filtering polynomials were used to refine features. Classification algorithms were implemented: k-nearest neighbors (KNN), logistic regression (LR), linear support vector machines (SVM), random forest (RF), Gaussian naïve bayes (GNB). Lastly, Monte Carlo simulations on 1,000 50%-train-test-splits were used to validate classification performance and feature significance. The preliminary feature set achieved its highest AUC of 0.52 with LR, with no strongly discriminatory features. Work to improve feature extraction, such as through deep learning with back propagation, is planned. In future work, the Raman data will be combined with the other data types, and potentially new data types such as enantiomeric excess. This project was partially supported through the NASA Ames Project EXcellence (APEX) incubator program.

Astrobiology↗

An approach to simultaneous system design. II - Nonswitching gain and dynamic feedback compensation by algebraic geometric methods

This paper studies structured uncertainty problems in feedback system design, considers a compact parameterization of the space of linear dynamical systems and introduces 'base points' and 'critical points' as two algebraic-geometric objects that have significance in sensitivity and robustness studies, respectively. Using the Nevanlinna-Pick interpolation theory, the author obtains a necessary and sufficient condition for simultaneous stabilization of a structured one-parameter family of plants. A recent result due to Kharitonov, on the simultaneous stability of a parameterized family of polynomials, leads to a sufficiency condition for simultaneous stabilization of a structured multiparameter family of plants. Furthermore, the author considers 'simultaneous pole placement' of an r-tuple of plants as a means to arbitrarily tune the natural frequencies of a multimode linear dynamical system. The concept of 'nondegenerate' and 'twisted' r-tuples of plants is introduced as the pole placement problem is studied via Schubert enumerative geometry as an intersection problem on the associated Grassmannian. Various other design problems, viz., the strong stabilization problem and the dead beat control problem, are also considered.

Ghosh, Bijoy K.↗

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

A finite-volume high-order ENO scheme for two-dimensional hyperbolic systems

The finite-volume approach is presently used to obtain a 2D, high-order accurate and basically nonoscillatory shock-capture method whose high-order spatial accuracy is obtained by means of a piecewise polynomial approximation of the solution from cell averages. Attention is given to a high-order spatial operator that is able to both retain high-order accuracy in smooth regions and avoid the oscillations that are associated with interpolations across steep gradients. The operator is extended to hyperbolic systems of equations and curvilinear meshes.

Casper, Jay↗

Quantifying uncertainty in the process-structure relationship for Al–Cu solidification

Phase field method (PFM) is a simulation tool to predict microstructural evolution during solidification and is helpful to establish the process-structure relationship for alloys. The robustness of the relationship however is affected by model-form and parameter uncertainties in PFM. In this paper, the uncertainty associated with the thermodynamic and process parameters of PFM is studied and quantified. Surrogate modeling is used to interpolate four quantities of interests (QoIs), including dendritic perimeter, area, primary arm length, and solute segregation, as functions of thermodynamic and process parameters. A sparse grid approach is applied to mitigate the curse-of-dimensionality computational burden in uncertainty quantification. Polynomial chaos expansion is employed to obtain the probability density functions of the QoIs. The effect of parameter uncertainty on the Al–Cu dendritic growth during solidification simulation are investigated. Here, the results show that the dendritic morphology varies significantly with respect to the interface mobility and the initial temperature.

36 MATERIALS SCIENCE↗

Method for Constructing Composite Response Surfaces by Combining Neural Networks with other Interpolation or Estimation Techniques

A method and system for design optimization that incorporates the advantages of both traditional response surface methodology (RSM) and neural networks is disclosed. The present invention employs a unique strategy called parameter-based partitioning of the given design space. In the design procedure, a sequence of composite response surfaces based on both neural networks and polynomial fits is used to traverse the design space to identify an optimal solution. The composite response surface has both the power of neural networks and the economy of low-order polynomials (in terms of the number of simulations needed and the network training requirements). The present invention handles design problems with many more parameters than would be possible using neural networks alone and permits a designer to rapidly perform a variety of trade-off studies before arriving at the final design.

Rai, Man Mohan↗

Matrix-Free High-Performance Saddle-Point Solvers for High-Order Problems in \(\boldsymbol{H}(\operatorname{\textbf{div}})\)

Here, this work describes the development of matrix-free GPU-accelerated solvers for high-order finite element problems in H(div). The solvers are applicable to grad-div and Darcy problems in saddle-point formulation, and have applications in radiation diffusion and porous media flow problems, among others. Using the interpolation–histopolation basis, efficient matrix-free preconditioners can be constructed for the (1, 1)-block and Schur complement of the block system. With these approximations, block-preconditioned MINRES converges in a number of iterations that is independent of the mesh size and polynomial degree. The approximate Schur complement takes the form of an M-matrix graph Laplacian and therefore can be well-preconditioned by highly scalable algebraic multigrid methods. High-performance GPU-accelerated algorithms for all components of the solution algorithm are developed, discussed, and benchmarked. Numerical results are presented on a number of challenging test cases, including the “crooked pipe” grad-div problem, the SPE10 reservoir modeling benchmark problem, and a nonlinear radiation diffusion test case.

97 MATHEMATICS AND COMPUTING↗

Nonconforming Mesh Refinement for High-Order Finite Elements

In this study, we propose a general algorithm for nonconforming adaptive mesh refinement (AMR) of unstructured meshes in high-order finite element codes. Our focus is on $h$-refinement with a fixed polynomial order. The algorithm handles triangular, quadrilateral, hexahedral, and prismatic meshes of arbitrarily high-order curvature, for any order finite element space in the de Rham sequence. We present a flexible data structure for meshes with hanging nodes and a general procedure to construct the conforming interpolation operator, both in serial and in parallel. The algorithm and data structure allow anisotropic refinement of tensor product elements in two and three dimensions and support unlimited refinement ratios of adjacent elements. We report numerical experiments verifying the correctness of the algorithms and perform a parallel scaling study to show that we can adapt meshes containing billions of elements and run efficiently on 393,000 parallel tasks. Finally, we illustrate the integration of dynamic AMR into a high-order Lagrangian hydrodynamics solver.

97 MATHEMATICS AND COMPUTING↗

Enabling attractive-repulsive potentials in binary-collision-approximation monte-carlo codes for ion-surface interactions

Abstract Binary Collision Approximation (BCA) codes for ion-material interactions, such as SRIM, Tridyn, F-TRIDYN, and SDtrimSP, have historically been limited to screened Coulomb potentials even at low energies due to the difficulty in numerically solving the Distance of Closest Approach (DOCA) problem for attractive-repulsive potentials. Techniques such as direct n-body simulation or modifications to Newton’s method are either prohibitively costly or not guaranteed to work for all potentials. Advanced rootfinding techniques, such as companion matrix solvers, offer a solution. For many attractive-repulsive potentials, however, a companion matrix cannot be used directly, because there is no way to put the associated functions into a monomial basis form. A complementary technique is proxy rootfinding—by finding the best-fit polynomial approximant of a function, the zeros of the approximant can be guaranteed to be close to the zeros of the function. Using the Chebyshev basis and grid offers additional guarantees with regards to the quality of the approximation, the speed of convergence, and the avoidance of Runge’s phenomenon. By finding Chebyshev interpolants and using the Chebyshev-Frobenius companion matrix, the zeros of any real function on a bounded domain can be found. Here we show that using an Adaptive Chebyshev Proxy Rootfinder with Automatic Subdivision (ACPRAS) with appropriate scaling functions, numerical issues presented by attractive-repulsive potentials, including those of scale, can be handled. Using these techniques, we show that it is possible to include any physically reasonable interatomic potential in a BCA code, and to guarantee correctness of the resulting scattering angle calculations.

Materials Science↗

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

High-Order Simulation of Non-Linear Oscillations and Shocks in the Solar Atmosphere

The solar atmosphere presents a rich source of highly non-linear magneto-hydrodynamic phenomena: strong gradients and forcing terms result in both large shocks and oscillations. The additional requirements of energy balance and initialization in hydrostatic equilibrium compound the challenge of this problem. A wealth of observational data allows us to check the results of our simulations. The problem of simulating the solar atmosphere provides, in addition to an interesting system in its own right, a challenging testbed for high-order shock-capturing methods. We discuss the challenge of simulating solar atmospheric phenomena, concentrating on various high-order central methods ranging from second to fourth order. Our method is based on the central-upwind scheme of Kurganov, Noelle and Petrova, which we extend to high order via various interpolants. We investigate various initial data for our simulations, corresponding to observed conditions in different regions of the solar surface: the normal quiet sun and sunspots. When non-oscillatory using second- and third-order methods, we are able to reproduce non-trivial observational results. In particular we find a correlation between initial data and both the shock speeds and particle oscillation spectra that match observations in the corresponding regions. When using fourth-order WENO interpolants, we find that while the individual shock profiles at any given time appear non-oscillatory, spurious oscillations appear in the fields after long time integrations. The issue of initialization in hydrostatic equilibrium raises difficult issues. Careful treatment of the gravitational source term can reduce violations of hydrostatic equilibrium, but difficulties remain, primarily due to discontinuities in the piecewise-polynomial reconstructions. In the case of the Euler equations in gravity, the use of high-order methods reduces the violation of hydrostatic equilibrium to a sufficiently low level for the above described results to be obtained. Including various energy flux terms in the equations, however, leads to severe instability when hydrostatic balance is violated. We discuss various strategies to address this problem, including adaptive grid methods.

Bryson, S.↗

Polynomial striction algorithms in the detection and determination of the characteristics of non-stationary phenomena

The effectiveness of the algorithm of polynomial striction of the data is examined, and the selection of an algorithm is carried out, according to the results of measurements of the components of the permanent magnetic field in communication sequences from the Venera-9 space vehicle, where the shock waves were recorded. It is shown that the most effective algorithm, according to the coefficient of striction, is the algorithm of the zero order interpolator. Also examined is the increase in effectiveness with the introduction of a variable threshold of comparison. The root-mean-square deviation of the error of regeneration of the data with various thresholds is calculated, and qualitative analysis of the distortions is carried out, having shown a considerable change in the form of the small discontinuities, which may be interpreted as potential interplanetary shock waves.

Yevdokimov, V. P.↗

DSN Data Visualization Suite

The DSN Data Visualization Suite is a set of computer programs and reusable Application Programming Interfaces (APIs) that assist in the visualization and analysis of Deep Space Network (DSN) spacecraft-tracking data, which can include predicted and actual values of downlink frequencies, uplink frequencies, and antenna-pointing angles in various formats that can include tables of values and polynomial coefficients. The data can also include lists of antenna-pointing events, lists of antenna- limit events, and schedules of tracking activities. To date, analysis and correlation of these intricately related data before and after tracking have been difficult and time-consuming. The DSN Data Visualization Suite enables operators to quickly diagnose tracking-data problems before, during, and after tracking. The Suite provides interpolation on demand and plotting of DSN tracking data, correlation of all data on a given temporal point, and display of data with color coding configurable by users. The suite thereby enables rapid analysis of the data prior to transmission of the data to DSN control centers. At the control centers, the same suite enables operators to validate the data before committing the data to DSN subsystems. This software is also Web-enabled to afford its capabilities to international space agencies.

Bui, Bach X.↗