Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “POLYNOMIALS”

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 649 records · Page 36

Eigenvalue analysis of uncertain ODE systems.

The Polynomial chaos expansion provides a means of representing any L2 random variable as a sum of polynomials that are orthogonal with respect to a chosen measure. Examples include the Hermite polynomials with Gaussian measure on the real line and the Legendre polynomials with uniform measure on an interval. Polynomial chaos can be used to reformulate an uncertain ODE system, using Galerkin projection, as a new, higher-dimensional, deterministic ODE system which describes the evolution of each mode of the polynomial chaos expansion. It is of interest to explore the eigenstructure of the original and reformulated ODE systems by studying the eigenvalues and eigenvectors of their Jacobians. In this talk, we study the distribution of the eigenvalues of the two Jacobians. We outline in general the location of the eigenvalues of the new system with respect to those of the original system, and examine the effect of expansion order on this distribution.

99 GENERAL AND MISCELLANEOUS↗

Data consistency conditions for truncated fanbeam and parallel projections

Purpose: In image reconstruction from projections, data consistency conditions (DCCs) are mathematical relationships that express the overlap of information between ideal projections. DCCs have been incorporated in image reconstruction procedures for positron emission tomography, single photon emission computed tomography, and x-ray computed tomography (CT). Building on published fanbeam DCCs for nontruncated projections along a line, the authors recently announced new DCCs that can be applied to truncated parallel projections in classical (two-dimensional) image reconstruction. These DCCs take the form of polynomial expressions for a weighted backprojection of the projections. The purpose of this work was to present the new DCCs for truncated parallel projections, to extend these conditions to truncated fanbeam projections on a circular trajectory, to verify the conditions with numerical examples, and to present a model of how DCCs could be applied with a toy problem in patient motion estimation with truncated projections. Methods: A mathematical derivation of the new parallel DCCs was performed by substituting the underlying imaging equation into the mathematical expression for the weighted backprojection and demonstrating the resulting polynomial form. This DCC result was extended to fanbeam projections by a substitution of parallel to fanbeam variables. Ideal fanbeam projections of a simple mathematical phantom were simulated and the DCCs for these projections were evaluated by fitting polynomials to the weighted backprojection. For the motion estimation problem, a parametrized motion was simulated using a dynamic version of the mathematical phantom, and both noiseless and noisy fanbeam projections were simulated for a full circular trajectory. The fanbeam DCCs were applied to extract the motion parameters, which allowed the motion contamination to be removed from the projections. A reconstruction was performed from the corrected projections. Results: The mathematical derivation revealed the anticipated polynomial behavior. The conversion to fanbeam variables led to a straight-forward weighted fanbeam backprojection which yielded the same function and therefore the same polynomial behavior as occurred in the parallel case. Plots of the numerically calculated DCCs showed polynomial behavior visually indistinguishable from the fitted polynomials. For the motion estimation problem, the motion parameters were satisfactorily recovered and ten times more accurately for the noise-free case. The reconstructed images showed that only a faint trace of the motion blur was still visible after correction from the noisy motion-contaminated projections. Conclusions: New DCCs have been established for fanbeam and parallel projections, and these conditions have been validated using numerical experiments with truncated projections. It has been shown how these DCCs could be applied to extract parameters of unwanted physical effects in tomographic imaging, even with truncated projections.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

An adaptive ANOVA-based PCKF for high-dimensional nonlinear inverse modeling

The probabilistic collocation-based Kalman filter (PCKF) is a recently developed approach for solving inverse problems. It resembles the ensemble Kalman filter (EnKF) in every aspect—except that it represents and propagates model uncertainty by polynomial chaos expansion (PCE) instead of an ensemble of model realizations. Previous studies have shown PCKF is a more efficient alternative to EnKF for many data assimilation problems. However, the accuracy and efficiency of PCKF depends on an appropriate truncation of the PCE series. Having more polynomial chaos basis functions in the expansion helps to capture uncertainty more accurately but increases computational cost. Selection of basis functions is particularly important for high-dimensional stochastic problems because the number of polynomial chaos basis functions required to represent model uncertainty grows dramatically as the number of input parameters (random dimensions) increases. In classic PCKF algorithms, the PCE basis functions are pre-set based on users' experience. Also, for sequential data assimilation problems, the basis functions kept in PCE expression remain unchanged in different Kalman filter loops, which could limit the accuracy and computational efficiency of classic PCKF algorithms. To address this issue, we present a new algorithm that adaptively selects PCE basis functions for different problems and automatically adjusts the number of basis functions in different Kalman filter loops. The algorithm is based on adaptive functional ANOVA (analysis of variance) decomposition, which approximates a high-dimensional function with the summation of a set of low-dimensional functions. Thus, instead of expanding the original model into PCE, we implement the PCE expansion on these low-dimensional functions, which is much less costly. We also propose a new adaptive criterion for ANOVA that is more suited for solving inverse problems. The new algorithm was tested with different examples and demonstrated great effectiveness in comparison with non-adaptive PCKF and EnKF algorithms.

97 MATHEMATICS AND COMPUTING↗

Data compression preserving statistical independence

The purpose of this study was to determine the optimum points of evaluation of data compressed by means of polynomial smoothing. It is shown that a set y of m statistically independent observations Y(t sub 1), Y(t sub 2), ... Y(t sub m) of a quantity X(t), which can be described by a (n-1)th degree polynomial in time, may be represented by a set Z of n statistically independent compressed observations Z (tau sub 1), Z (tau sub 2),...Z (tau sub n), such that The compressed set Z has the same information content as the observed set Y. the times tau sub 1, tau sub 2,.. tau sub n are the zeros of an nth degree polynomial P sub n, to whose definition and properties the bulk of this report is devoted. The polynomials P sub n are defined as functions of the observation times t sub 1, t sub 2,.. t sub n, and it is interesting to note that if the observation times are continuously distributed the polynomials P sub n degenerate to legendre polynomials. The proposed data compression scheme is a little more complex than those usually employed, but has the advantage of preserving all the information content of the original observations.

Morduch, G. E.↗

A simplified procedure for correcting both errors and erasures of a Reed-Solomon code using the Euclidean algorithm

It is well known that the Euclidean algorithm or its equivalent, continued fractions, can be used to find the error locator polynomial and the error evaluator polynomial in Berlekamp's key equation needed to decode a Reed-Solomon (RS) code. A simplified procedure is developed and proved to correct erasures as well as errors by replacing the initial condition of the Euclidean algorithm by the erasure locator polynomial and the Forney syndrome polynomial. By this means, the errata locator polynomial and the errata evaluator polynomial can be obtained, simultaneously and simply, by the Euclidean algorithm only. With this improved technique the complexity of time domain RS decoders for correcting both errors and erasures is reduced substantially from previous approaches. As a consequence, decoders for correcting both errors and erasures of RS codes can be made more modular, regular, simple, and naturally suitable for both VLSI and software implementation. An example illustrating this modified decoding procedure is given for a (15, 9) RS code.

Truong, T. K.↗

Direct solution for thermal stresses in a nose cap under an arbitrary axisymmetric temperature distribution

The design of a nose cap for a hypersonic vehicle is an iterative process requiring a rapid, easy to use and accurate stress analysis. The objective of this paper is to develop such a stress analysis technique from a direct solution of the thermal stress equations for a spherical shell. The nose cap structure is treated as a thin spherical shell with an axisymmetric temperature distribution. The governing differential equations are solved by expressing the stress solution to the thermoelastic equations in terms of a series of derivatives of the Legendre polynomials. The process of finding the coefficients for the series solution in terms of the temperature distribution is generalized by expressing the temperature along the shell and through the thickness as a polynomial in the spherical angle coordinate. Under this generalization the orthogonality property of the Legendre polynomials leads to a sequence of integrals involving powers of the spherical shell coordinate times the derivative of the Legendre polynomials. The coefficients of the temperature polynomial appear outside of these integrals. Thus, the integrals are evaluated only once and their values tabulated for use with any arbitrary polynomial temperature distribution.

Davis, Randall C.↗

Heliospheric shocks and catastrophe theory

Various configurations of forward and reverse shocks that occur in the outer heliosphere can be classified using catastrophe theory. The existence of a forward shock is associated with a local maximum of a polynomial, and the existence of a reverse shock is associated with a local minimum of a polynomial. A configuration with N forward shocks and N reverse shocks corresponds to a polynomial with N maxima and N minima. The formation of forward and reverse shocks corresponds to the creation of maxima and minima of a polynomial, which is described by the separatrices of the catastrophes. The coalescence of two forward (reverse) shocks corresponds to the situation when two maxima (minima) of a polynomial have equal values, and the interaction of a forward shock with a reverse shock corresponds to a polynomial with a local maximum equal to a local minimum; these situations are described by the Maxwell sets of the appropriate catastrophes.

Burlaga, L. F.↗

Determination of robust stability margin for second-order systems

Robust stabilization of uncertain systems has been extensively investigated and the stability test for the whole set of uncertain parameters has been reduced to a finite number of test points, four points for the characteristic polynomial with independent coefficients. As a result the robust stability margin can be determined using a reasonable amount of computation. It is impossible to apply the results of the test to a practical system as the coefficients of the characteristic polynomial for a physical system are usually functions of uncertain parameters. However, many physical systems may be represented by a second-order mass-spring-damper system with a special multilinear form in its characteristic polynomial. This paper investigates second-order mass-spring-damper systems and the reduction of the number of test points. It is shown that such a system with arbritrary compensators always has a multilinear characteristic polynomial. It is also shown that a line in the two-dimensional parameter space forms the boundary after the mapping of a multilinear characteristic polynomial and this interior extreme line forms a conic curve in the complex plane. The boundary of uncertain domain for a multilinear polynomial with two uncertainty parameters can be determined analytically using this curve, and the four sides image of a square of the uncertain parameter. Therefore, the stability margin may be determined by checking the intersections of the boundary with the zero point. A similar procedure can be used for second-order systems with more than two uncertainty parameters when parameter optimization is used in determining the boundary.

Chuang, C.-H.↗

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↗

Optimal control and Galois theory

An important role is played in the solution of a class of optimal control problems by a certain special polynomial of degree 2(n−1) with integer coefficients. The linear independence of a family of k roots of this polynomial over the field Q implies the existence of a solution of the original problem with optimal control in the form of an irrational winding of a k-dimensional Clifford torus, which is passed in finite time. In the paper, we prove that for n≤15 one can take an arbitrary positive integer not exceeding [n/2] for k. The apparatus developed in the paper is applied to the systems of Chebyshev-Hermite polynomials and generalized Chebyshev-Laguerre polynomials. It is proved that for such polynomials of degree 2m every subsystem of [(m+1)/2] roots with pairwise distinct squares is linearly independent over the field Q. Bibliography: 11 titles.

97 MATHEMATICS AND COMPUTING↗

Extended Hamiltonians and shift, ladder functions and operators

In recent years, many natural Hamiltonian systems, classical and quantum, with constants of motion of high degree, or symmetry operators of high order, have been found and studied. Most of these Hamiltonians, in the classical case, can be included in the family of extended Hamiltonians, geometrically characterized by the structure of warped manifold of their configuration manifold. For the extended Hamiltonians, the characteristic constants of motion of high degree are polynomial in the momenta of determined form. We consider here a different form of the constants of motion, based on the factorization procedure developed for systems of two degrees of freedom by S. Kuru, J. Negro and others. We show that an important subclass of the extended Hamiltonians, with arbitrary dimension, admits factorized constants of motion and we determine their expression. The classical constants can be polynomial or non-polynomial in the momenta, but the factorization procedure allows, in a type of extended Hamiltonians, their quantization via shift and ladder operators, for systems of any finite dimension. - Highlights: • A factorization procedure is proposed for first integrals of high degree of extended Hamiltonian systems. • The extended Hamiltonians are defined on warped manifolds of any finite dimension. • Polynomial first integrals are quantized into factorized polynomial symmetry operators of Laplace–Beltrami-type quantum Hamiltonians.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An adaptive least-squares global sensitivity method and application to a plasma-coupled combustion prediction with parametric correlation

We introduce an efficient non-intrusive surrogate-based methodology for global sensitivity analysis and uncertainty quantification. Modified covariance-based sensitivity indices (mCov-SI) are defined for outputs that reflect correlated effects. The overall approach is applied to simulations of a complex plasma-coupled combustion system with disparate uncertain parameters in sub-models for chemical kinetics and a laser-induced breakdown ignition seed. The surrogate is based on an Analysis of Variance (ANOVA) expansion, such as widely used in statistics, with orthogonal polynomials representing the ANOVA subspaces and a polynomial dimensional decomposition (PDD) representing its multi-dimensional components. The coefficients of the PDD expansion are obtained using a least-squares regression, which both avoids the direct computation of high-dimensional integrals and affords an attractive flexibility in choosing sampling points. This facilitates importance sampling using a Bayesian calibrated posterior distribution, which is fast and thus particularly advantageous in common practical cases, such as our large-scale demonstration, for which the asymptotic convergence properties of polynomial expansions cannot be realized due to computation expense. Effort, instead, is focused on efficient finite-resolution sampling. Standard covariance-based sensitivity indices (Cov-SI) are employed to account for correlation of the uncertain parameters. Magnitude of Cov-SI is unfortunately unbounded, which can produce extremely large indices that limit their utility. Alternatively, mCov-SI are then proposed in order to bound this magnitude $\in$ [0, 1]. The polynomial expansion is coupled with an adaptive ANOVA strategy to provide an accurate surrogate as the union of several low-dimensional spaces, avoiding the typical computational cost of a high-dimensional expansion. It is also adaptively simplified according to the relative contribution of the different polynomials to the total variance. Finally, the approach is demonstrated for a laser-induced turbulent combustion simulation model, which includes parameters with correlated effects.

42 ENGINEERING↗

A family of Nikishin systems with periodic recurrence coefficients

Suppose we have a Nikishin system of p measures with the kth generating measure of the Nikishin system supported on an interval {Delta}{sub k} subset of R with {Delta}{sub k} Intersection {Delta}{sub k+1} = Empty-Set for all k. It is well known that the corresponding staircase sequence of multiple orthogonal polynomials satisfies a (p+2)-term recurrence relation whose recurrence coefficients, under appropriate assumptions on the generating measures, have periodic limits of period p. (The limit values depend only on the positions of the intervals {Delta}{sub k}.) Taking these periodic limit values as the coefficients of a new (p+2)-term recurrence relation, we construct a canonical sequence of monic polynomials {l_brace}P{sub n}{r_brace}{sub n=0}{sup {infinity}}, the so-called Chebyshev-Nikishin polynomials. We show that the polynomials P{sub n} themselves form a sequence of multiple orthogonal polynomials with respect to some Nikishin system of measures, with the kth generating measure being absolutely continuous on {Delta}{sub k}. In this way we generalize a result of the third author and Rocha [22] for the case p=2. The proof uses the connection with block Toeplitz matrices, and with a certain Riemann surface of genus zero. We also obtain strong asymptotics and an exact Widom-type formula for functions of the second kind of the Nikishin system for {l_brace}P{sub n}{r_brace}{sub n=0}{sup {infinity}}. Bibliography: 27 titles.

97 MATHEMATICS AND COMPUTING↗

Investigation of advanced UQ for CRUD prediction with VIPRE.

This document summarizes the results from a level 3 milestone study within the CASL VUQ effort. It demonstrates the application of 'advanced UQ,' in particular dimension-adaptive p-refinement for polynomial chaos and stochastic collocation. The study calculates statistics for several quantities of interest that are indicators for the formation of CRUD (Chalk River unidentified deposit), which can lead to CIPS (CRUD induced power shift). Stochastic expansion methods are attractive methods for uncertainty quantification due to their fast convergence properties. For smooth functions (i.e., analytic, infinitely-differentiable) in L{sup 2} (i.e., possessing finite variance), exponential convergence rates can be obtained under order refinement for integrated statistical quantities of interest such as mean, variance, and probability. Two stochastic expansion methods are of interest: nonintrusive polynomial chaos expansion (PCE), which computes coefficients for a known basis of multivariate orthogonal polynomials, and stochastic collocation (SC), which forms multivariate interpolation polynomials for known coefficients. Within the DAKOTA project, recent research in stochastic expansion methods has focused on automated polynomial order refinement ('p-refinement') of expansions to support scalability to higher dimensional random input spaces [4, 3]. By preferentially refining only in the most important dimensions of the input space, the applicability of these methods can be extended from O(10{sup 0})-O(10{sup 1}) random variables to O(10{sup 2}) and beyond, depending on the degree of anisotropy (i.e., the extent to which randominput variables have differing degrees of influence on the statistical quantities of interest (QOIs)). Thus, the purpose of this study is to investigate the application of these adaptive stochastic expansion methods to the analysis of CRUD using the VIPRE simulation tools for two different plant models of differing random dimension, anisotropy, and smoothness.

99 GENERAL AND MISCELLANEOUS↗

Linac Sector 21-30 'QE' Quadrupole Magnet Excitation in LCLS Operation

The existing SLAC linac quadrupole magnets, described as the 'QE' quadrupoles, are designed for excitation currents up to 200 A with length-integrated gradients up to 100 kG needed to focus up to 50-GeV electron or positron beams. The eight 'QE' magnets within a linac sector are powered in series on a single 200-A bulk power supply, and each magnet in sectors 21-29 also includes a 20-A booster supply (adds 0-20 A to each magnet) for gradient tapering within the sector. Sector 30 is different again with individual 200-A power supplies per magnet. The LCLS will use these same quadrupole magnets, mostly in their existing locations and with their present power supplies, but for an electron energy range of 0.25-14 GeV. This much lower beam energy will require good power supply regulation ({le} 0.05% rms for f > 0.5 Hz) [1] and accurate field excitation at much lower currents, as low as a few amperes. The present (pre-2006) gradient-to-current polynomials (IVBU) in the SLC database are based on magnetic measurements at excitation currents above 20 A, and are not accurate in extrapolation below about 10 A. For this reason the IVBU polynomials for all 'QE' quadrupoles in sectors 21-30 will be updated in 2007 for LCLS operation. Magnets beyond Q21601 will be updated with a new generic polynomial (with polarity considerations) based on magnetic measurements from zero current all the way up to 200 A, with additional data taken in the 0-20 A range for accuracy in LCLS mode (see Fig. 1). In addition, the first five LCLS 'QE' magnets (Q21201, Q21301, Q21401, Q21501, and Q21601), most of which run at the lowest currents of <3 A, have been individually measured and fitted with a specific polynomial to meet their special settings in LCLS mode. All changes will continue to fully support 30-50 GeV linac operations. This note describes these changes and the method used to arrive at this solution. Regulation tests have already been run on both the bulk and booster power supplies which demonstrate a regulation level below 0.05% rms [1]. Table 2 lists a summary of the gradient-to-current polynomials needed in 2007 for all 'QE' magnets from sector-21 to 30.

43 PARTICLE ACCELERATORS↗

Characterization of high order spatial discretizations and lumping techniques for discontinuous finite element SN transport

We examine several possible methods of mass matrix lumping for discontinuous finite element discrete ordinates transport using a Lagrange interpolatory polynomial trial space. Though positive outflow angular flux is guaranteed with traditional mass matrix lumping in a purely absorbing 1-D slab cell for the linear discontinuous approximation, we show that when used with higher degree interpolatory polynomial trial spaces, traditional lumping does yield strictly positive outflows and does not increase in accuracy with an increase in trial space polynomial degree. As an alternative, we examine methods which are 'self-lumping'. Self-lumping methods yield diagonal mass matrices by using numerical quadrature restricted to the Lagrange interpolatory points. Using equally-spaced interpolatory points, self-lumping is achieved through the use of closed Newton-Cotes formulas, resulting in strictly positive outflows in pure absorbers for odd power polynomials in 1-D slab geometry. By changing interpolatory points from the traditional equally-spaced points to the quadrature points of the Gauss-Legendre or Lobatto-Gauss-Legendre quadratures, it is possible to generate solution representations with a diagonal mass matrix and a strictly positive outflow for any degree polynomial solution representation in a pure absorber medium in 1-D slab geometry. Further, there is no inherent limit to local truncation error order of accuracy when using interpolatory points that correspond to the quadrature points of high order accuracy numerical quadrature schemes. (authors)

97 MATHEMATICS AND COMPUTING↗

3D spherical functional expansion tallies in Serpent 2 Monte Carlo code

This work extends the application of functional expansion tallies to 3D spherical geometries. The 3D Zernike polynomials are set as an orthonormal polynomials basis for the functional reconstruction. The study describes the construction of the complete set of polynomials, a natural expansion of the spherical harmonics polynomials where 3D Zernike moments can be evaluated as a linear combination of the geometrical moments. The 3D Zernike polynomials formulation and the computational approach implemented in Serpent 2 are presented and tested through the Godiva model from the ICSBEP criticality benchmark test cases. The implementation results are in agreement with a reference solution described in a fine-resolution mesh, enhancing also the performance and memory demand. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness

The challenge of quantifying uncertainty propagation in real-world systems is rooted in the high-dimensionality of the stochastic input and the frequent lack of explicit knowledge of its probability distribution. Traditional approaches show limitations for such problems, especially when the size of the training data is limited. To address these diculties, we have developed a general framework of constructing surrogate models on spaces of stochastic input with arbitrary probability measure irrespective of the mutual dependencies between individual components of the random inputs and the analytical form. The present Data-driven Sparsity-enhancing Rotation for Arbitrary Randomness (DSRAR) framework includes a data-driven construction of multivariate polynomial basis for arbitrary mutually dependent probability measure and a sparsity enhancement rotation procedure. This sparsity-enhancing rotation method was initially proposed in our previous work [1] for Gaussian density distributions, which may not be feasible for non-Gaussian distributions due to the loss of orthogonality after the rotation. To remedy such diculties, we developed a new data-driven approach to construct orthonormal polynomials for polynomials for arbitrary mutually dependent (amdP) randomness, ensuring the constructed basis maintains the orthogonality/near-orthogonality with respect to the density of the rotated random vector, where directly applying the regular polynomial chaos including arbitrary polynomial chaos (aPC) [2] shows limitations due to the assumption of the mutual independence between the components of the random inputs. The developed DSRAR framework leads to accurate recovery, with only limited training data, of a sparse representation of the target functions. The eectiveness of our method is demonstrated in challenging problems such as PDEs and realistic molecular systems within high-dimensional conformational space (O(10)) where the underlying density is implicitly represented by a large collection of sample data, as well as systems with explicitly given non-Gaussian probabilistic measures.

Lei, Huan↗