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 739 records · Page 41

The leading term of the Plancherel-Rotach asymptotic formula for solutions of recurrence relations

Recurrence relations generating Padé and Hermite-Padé polynomials are considered. Their coefficients increase with the index of the relation, but after dividing by an appropriate power of the scaling function they tend to a finite limit. As a result, after scaling the polynomials 'stabilize' for large indices; this type of asymptotic behaviour is called Plancherel-Rotach asymptotics. An explicit expression for the leading term of the asymptotic formula, which is valid outside sets containing the zeros of the polynomials, is obtained for wide classes of three- and four-term relations. For three-term recurrence relations this result generalizes a theorem Van Assche obtained for recurrence relations with 'regularly' growing coefficients. Bibliography: 19 titles.

97 MATHEMATICS AND COMPUTING↗

Inflationary potentials in DBI models

We study DBI inflation based upon a general model characterized by a power-law flow parameter ε(φ) ∝ φ{sup α} and speed of sound c{sub s}(φ) ∝ φ{sup β}, where α and β are constants. We show that in the slow-roll limit this general model gives rise to distinct inflationary classes according to the relation between α and β and to the time evolution of the inflaton field, each one corresponding to a specific potential; in particular, we find that the well-known canonical polynomial (large- and small-field), hybrid and exponential potentials also arise in this non-canonical model. We find that these non-canonical classes have the same physical features as their canonical analogs, except for the fact that the inflaton field evolves with varying speed of sound; also, we show that a broad class of canonical and D-brane inflation models are particular cases of this general non-canonical model. Next, we compare the predictions of large-field polynomial models with the current observational data, showing that models with low speed of sound have red-tilted scalar spectrum with low tensor-to-scalar ratio, in good agreement with the observed values. These models also show a correlation between large non-gaussianity with low tensor amplitudes, which is a distinct signature of DBI inflation with large-field polynomial potentials.

79 ASTRONOMY AND ASTROPHYSICS↗

Power spectrum for inflation models with quantum and thermal noises

We determine the power spectrum for inflation models covering all regimes from cold (isentropic) to warm (nonisentropic) inflation. We work in the context of the stochastic inflation approach, which can nicely describe both types of inflationary regimes concomitantly. A throughout analysis is carried out to determine the allowed parameter space for simple single field polynomial chaotic inflation models that is consistent with the most recent cosmological data from the nine-year Wilkinson Microwave Anisotropy Probe (WMAP) and in conjunction with other observational cosmological sources. We present the results for both the amplitude of the power spectrum, the spectral index and for the tensor to scalar curvature perturbation amplitude ratio. We briefly discuss cases when running is present. Despite single field polynomial-type inflaton potential models be strongly disfavored, or even be already ruled out in their simplest versions in the case of cold inflation, this is not the case for nonisentropic inflation models in general (warm inflation in particular), though higher order polynomial potentials (higher than quartic order) tend to become less favorable also in this case, presenting a much smaller region of parameter space compatible with the recent observational cosmological data.

79 ASTRONOMY AND ASTROPHYSICS↗

Tachyon inflation in the large-N formalism

We study tachyon inflation within the large-N formalism, which takes a prescription for the small Hubble flow slow-roll parameter ε{sub 1} as a function of the large number of e-folds N. This leads to a classification of models through their behaviour at large N. In addition to the perturbative N class, we introduce the polynomial and exponential classes for the ε{sub 1} parameter. With this formalism we reconstruct a large number of potentials used previously in the literature for tachyon inflation. We also obtain new families of potentials from the polynomial class. We characterize the realizations of tachyon inflation by computing the usual cosmological observables up to second order in the Hubble flow slow-roll parameters. This allows us to look at observable differences between tachyon and canonical single field inflation. The analysis of observables in light of the Planck 2015 data shows the viability of some of these models, mostly for certain realization of the polynomial and exponential classes.

79 ASTRONOMY AND ASTROPHYSICS↗

THE KEPLER PIXEL RESPONSE FUNCTION

Kepler seeks to detect sequences of transits of Earth-size exoplanets orbiting solar-like stars. Such transit signals are on the order of 100 ppm. The high photometric precision demanded by Kepler requires detailed knowledge of how the Kepler pixels respond to starlight during a nominal observation. This information is provided by the Kepler pixel response function (PRF), defined as the composite of Kepler's optical point-spread function, integrated spacecraft pointing jitter during a nominal cadence and other systematic effects. To provide sub-pixel resolution, the PRF is represented as a piecewise-continuous polynomial on a sub-pixel mesh. This continuous representation allows the prediction of a star's flux value on any pixel given the star's pixel position. The advantages and difficulties of this polynomial representation are discussed, including characterization of spatial variation in the PRF and the smoothing of discontinuities between sub-pixel polynomial patches. On-orbit super-resolution measurements of the PRF across the Kepler field of view are described. Two uses of the PRF are presented: the selection of pixels for each star that maximizes the photometric signal-to-noise ratio for that star, and PRF-fitted centroids which provide robust and accurate stellar positions on the CCD, primarily used for attitude and plate scale tracking. Good knowledge of the PRF has been a critical component for the successful collection of high-precision photometry by Kepler.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Properties of Non-Abelian Fractional Quantum Hall States at Filling {nu}=k/r

We compute the physical properties of non-Abelian fractional quantum Hall (FQH) states described by Jack polynomials at general filling {nu}=k/r. For r=2, these states are the Z{sub k} Read-Rezayi parafermions, whereas for r>2 they represent new FQH states. The r=k+1 states, multiplied by a Vandermonde determinant, are a non-Abelian alternative construction of states at fermionic filling 2/5,3/7,4/9,.... We obtain the thermal Hall coefficient, the quantum dimensions, the electron scaling exponent, and the non-Abelian quasihole propagator. The properties of the r>2 Jack polynomials indicate they are correlators of fields of nonunitary conformal field theories (CFT), but the CFT-FQH connection fails when invoked to compute physical properties such as the quasihole propagator. The quasihole wave function, written as a coherent state representation of Jack polynomials, has an identical structure for all non-Abelian states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SU-E-J-85: Leave-One-Out Perturbation (LOOP) Fitting Algorithm for Absolute Dose Film Calibration

Purpose: To introduce an outliers-recognition fitting routine for film dosimetry. It cannot only be flexible with any linear and non-linear regression but also can provide information for the minimal number of sampling points, critical sampling distributions and evaluating analytical functions for absolute film-dose calibration. Methods: The technique, leave-one-out (LOO) cross validation, is often used for statistical analyses on model performance. We used LOO analyses with perturbed bootstrap fitting called leave-one-out perturbation (LOOP) for film-dose calibration . Given a threshold, the LOO process detects unfit points (“outliers”) compared to other cohorts, and a bootstrap fitting process follows to seek any possibilities of using perturbations for further improvement. After that outliers were reconfirmed by a traditional t-test statistics and eliminated, then another LOOP feedback resulted in the final. An over-sampled film-dose- calibration dataset was collected as a reference (dose range: 0-800cGy), and various simulated conditions for outliers and sampling distributions were derived from the reference. Comparisons over the various conditions were made, and the performance of fitting functions, polynomial and rational functions, were evaluated. Results: (1) LOOP can prove its sensitive outlier-recognition by its statistical correlation to an exceptional better goodness-of-fit as outliers being left-out. (2) With sufficient statistical information, the LOOP can correct outliers under some low-sampling conditions that other “robust fits”, e.g. Least Absolute Residuals, cannot. (3) Complete cross-validated analyses of LOOP indicate that the function of rational type demonstrates a much superior performance compared to the polynomial. Even with 5 data points including one outlier, using LOOP with rational function can restore more than a 95% value back to its reference values, while the polynomial fitting completely failed under the same conditions. Conclusion: LOOP can cooperate with any fitting routine functioning as a “robust fit”. In addition, it can be set as a benchmark for film-dose calibration fitting performance.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Atom-photon cluster as an elementary emitter

The interaction of an atomic ensemble localized in a microcavity with external electromagnetic fields under Raman resonance conditions with an optically forbidden atomic transition involving photons of the microcavity mode has been described in terms of third-order polynomial algebra. It has been shown that atoms and photons localized in the microcavity under these conditions form a united object, an atom-photon cluster, on the states of which the irreducible representations of polynomial algebra are implemented. Classical coherent and quantum broadband electromagnetic fields are considered as external fields. The effective Hamiltonian, effective dipole moment operator, and relaxation operator of the atom-photon cluster are expressed in terms of the generators of polynomial algebra, which is the algebra of the dynamical symmetry of the problem. The developed mathematical technique has been applied to describe the main radiative processes-spontaneous emission and nutation effect-on atom-photon clusters. All of these effects are peculiar and differ from similar phenomena on two-level atoms, but only simple cases of the mentioned radiative processes have been considered.

74 ATOMIC AND MOLECULAR PHYSICS↗

Spectral finite-element methods for parametric constrained optimization problems.

We present a method to approximate the solution mapping of parametric constrained optimization problems. The approximation, which is of the spectral finite element type, is represented as a linear combination of orthogonal polynomials. Its coefficients are determined by solving an appropriate finite-dimensional constrained optimization problem. We show that, under certain conditions, the latter problem is solvable because it is feasible for a sufficiently large degree of the polynomial approximation and has an objective function with bounded level sets. In addition, the solutions of the finite-dimensional problems converge for an increasing degree of the polynomials considered, provided that the solutions exhibit a sufficiently large and uniform degree of smoothness. Our approach solves, in the case of optimization problems with uncertain parameters, the most computationally intensive part of stochastic finite-element approaches. We demonstrate that our framework is applicable to parametric eigenvalue problems.

97 MATHEMATICS AND COMPUTING↗

Distribution functions of probabilistic automata

Each probabilistic automaton M over an alphabet A defines a probability measure Prob sub(M) on the set of all finite and infinite words over A. We can identify a k letter alphabet A with the set {0, 1,..., k-1}, and, hence, we can consider every finite or infinite word w over A as a radix k expansion of a real number X(w) in the interval [0, 1]. This makes X(w) a random variable and the distribution function of M is defined as usual: F(x) := Prob sub(M) { w: X(w) < x }. Utilizing the fixed-point semantics (denotational semantics), extended to probabilistic computations, we investigate the distribution functions of probabilistic automata in detail. Automata with continuous distribution functions are characterized. By a new, and much more easier method, it is shown that the distribution function F(x) is an analytic function if it is a polynomial. Finally, answering a question posed by D. Knuth and A. Yao, we show that a polynomial distribution function F(x) on [0, 1] can be generated by a prob abilistic automaton iff all the roots of F'(x) = 0 in this interval, if any, are rational numbers. For this, we define two dynamical systems on the set of polynomial distributions and study attracting fixed points of random composition of these two systems.

Denotational semantics↗

A Comparative Study of Different Reconstruction Schemes for a Reconstructed Discontinuous Galerkin Method on Arbitrary Grids

A comparative study of different reconstruction schemes for a reconstruction-based discontinuous Galerkin, termed RDG(P1P2) method is performed for compressible flow problems on arbitrary grids. The RDG method is designed to enhance the accuracy of the discontinuous Galerkin method by increasing the order of the underlying polynomial solution via a reconstruction scheme commonly used in the finite volume method. Both Green-Gauss and least-squares reconstruction methods and a least-squares recovery method are implemented to obtain a quadratic polynomial representation of the underlying discontinuous Galerkin linear polynomial solution on each cell. These three reconstruction/recovery methods are compared for a variety of compressible flow problems on arbitrary meshes to access their accuracy and robustness. The numerical results demonstrate that all three reconstruction methods can significantly improve the accuracy of the underlying second-order DG method, although the least-squares reconstruction method provides the best performance in terms of both accuracy and robustness.

97 MATHEMATICS AND COMPUTING↗

Expeditious modeling of vapor transport and reactions in polymeric materials

We present a methodology for approximating dynamic adsorption of vapor coupled with diffusion in polymeric materials. In previous publications, the dynamic adsorption was represented by ordinary differential equations (ODEs) and solved in concentration and parameter space. To accelerate the calculation, we have developed a statistical approximation method using computationally cheap surrogate models (e.g., algebraic polynomials) that replace the ODE solutions of adsorption and are coupled with the diffusion equations. Since the polynomial presentation of the adsorption term is obtained in a standard format prior to modeling coupled sorption‐diffusion, the adsorption operator can be expressed as input data in the transport code. Compared to conventional operator‐splitting methods, the polynomial approximation of adsorption offers better computational efficiency. The methodology is demonstrated and validated using a dynamic Langmuir adsorption model that is coupled to diffusion and absorption models and applied to a water vapor sorption‐diffusion process in polydimethylsiloxane polymers. © 2017 American Institute of Chemical Engineers AIChE J , 63: 4079–4089, 2017

Sun, Yunwei↗

Comparison of multigrid algorithms for high‐order continuous finite element discretizations

Summary We present a comparison of different multigrid approaches for the solution of systems arising from high‐order continuous finite element discretizations of elliptic partial differential equations on complex geometries. We consider the pointwise Jacobi, the Chebyshev‐accelerated Jacobi, and the symmetric successive over‐relaxation smoothers, as well as elementwise block Jacobi smoothing. Three approaches for the multigrid hierarchy are compared: (1) high‐order h ‐multigrid, which uses high‐order interpolation and restriction between geometrically coarsened meshes; (2) p ‐multigrid, in which the polynomial order is reduced while the mesh remains unchanged, and the interpolation and restriction incorporate the different‐order basis functions; and (3) a first‐order approximation multigrid preconditioner constructed using the nodes of the high‐order discretization. This latter approach is often combined with algebraic multigrid for the low‐order operator and is attractive for high‐order discretizations on unstructured meshes, where geometric coarsening is difficult. Based on a simple performance model, we compare the computational cost of the different approaches. Using scalar test problems in two and three dimensions with constant and varying coefficients, we compare the performance of the different multigrid approaches for polynomial orders up to 16. Overall, both h ‐multigrid and p ‐multigrid work well; the first‐order approximation is less efficient. For constant coefficients, all smoothers work well. For variable coefficients, Chebyshev and symmetric successive over‐relaxation smoothing outperform Jacobi smoothing. While all of the tested methods converge in a mesh‐independent number of iterations, none of them behaves completely independent of the polynomial order. When multigrid is used as a preconditioner in a Krylov method, the iteration number decreases significantly compared with using multigrid as a solver. Copyright © 2015 John Wiley & Sons, Ltd.

Sundar, Hari↗

Error estimates to smooth solutions of semi-discrete discontinuous Galerkin methods with quadrature rules for scalar conservation laws

Here, we focus on error estimates to smooth solutions of semi-discrete discontinuous Galerkin (DG) methods with quadrature rules for scalar conservation laws. The main techniques we use are energy estimate and Taylor expansion first introduced by Zhang and Shu in (Zhang and Shu, SIAM J Num Anal 42 (2004), 641–666). We show that, with p K (piecewise polynomials of degree k) finite elements in 1D problems, if the quadrature over elements is exact for polynomials of degree (2k) error estimates of O(h k+1/2 ) are obtained for general monotone fluxes, and optimal estimates of O(h k+1 ) are obtained for upwind fluxes. For multidimensional problems, if in addition quadrature over edges is exact for polynomials of degree (2k+1), error estimates of O(h k ) are obtained for general monotone fluxes, and O(h k+1/2 ) are obtained for monotone and sufficiently smooth numerical fluxes. Numerical results validate our analysis.

97 MATHEMATICS AND COMPUTING↗

Characterization of Quantum States Based on Creation Complexity

Abstract The creation complexity of a quantum state is the minimum number of elementary gates required to create it from a basic initial state. The creation complexity of quantum states is closely related to the complexity of quantum circuits, which is crucial in developing efficient quantum algorithms that can outperform classical algorithms. A major question unanswered so far is what quantum states can be created with a number of elementary gates that scales polynomially with the number of qubits. In this work, it is first shown that for an entirely general quantum state it is exponentially hard (requires a number of steps that scales exponentially with the number of qubits) to determine if the creation complexity is polynomial. Then, it is shown that it is possible for a large class of quantum states with polynomial creation complexity to have common coefficient features such that, given any candidate quantum state, an efficient coefficient sampling procedure can be designed to determine if the state belongs to the class or not with arbitrarily high success probability. Consequently, partial knowledge of a quantum state's creation complexity is obtained, which can be useful for designing quantum circuits and algorithms involving such a state.

74 ATOMIC AND MOLECULAR PHYSICS↗

The Approximability of Partial Vertex Covers in Trees.

Motivated by applications in risk management of computational systems, we focus our attention on a special case of the partial vertex cover problem, where the underlying graph is assumed to be a tree. Here, we consider four possible versions of this setting, depending on whether vertices and edges are weighted or not. Two of these versions, where edges are assumed to be unweighted, are known to be polynomial-time solvable (Gandhi, Khuller, and Srinivasan, 2004). However, the computational complexity of this problem with weighted edges, and possibly with weighted vertices, has not been determined yet. The main contribution of this paper is to resolve these questions, by fully characterizing which variants of partial vertex cover remain intractable in trees, and which can be efficiently solved. In particular, we propose a pseudo-polynomial DP-based algorithm for the most general case of having weights on both edges and vertices, which is proven to be NPhard. This algorithm provides a polynomial-time solution method when weights are limited to edges, and combined with additional scaling ideas, leads to an FPTAS for the general case. A secondary contribution of this work is to propose a novel way of using centroid decompositions in trees, which could be useful in other settings as well.

97 MATHEMATICS AND COMPUTING↗

Consequences and benefits of utilizing continuous vibro-impact representations in constrained pipeline conveying fluid systems

Here, the effectiveness of continuous vibro-impact forcing representations for the cantilevered pipe that conveys fluid is explored and analyzed. The previously accepted forcing model utilizing a smoothened trilinear spring is estimated using three continuous forcing representations, namely, polynomial, rational polynomial, and hyperbolic tangent. The accuracy of the estimated forcing functions is investigated and analyzed by calculating the root mean square error, and bifurcation diagrams are generated and compared to the nominal system. Additionally, the dynamic response of the system is further characterized using Poincare maps, power spectra, and basins of attraction. Once all continuous forcing representations are analyzed and compared to the nominal system, the computational cost of each method is examined, and further limitations of the hyperbolic tangent method are discovered. It is proved that the hyperbolic tangent forcing representation most accurately captures the dynamic response of the pipeline, and the least accurate representation is the rational polynomial representation. Additionally, considerable computational cost is saved when employing the hyperbolic tangent representation compared to the discontinuous representation.

42 ENGINEERING↗

A fourth-order Lagrangian discontinuous Galerkin method using a hierarchical orthogonal basis on curvilinear grids

The existing high-order Lagrangian discontinuous Galerkin (DG) hydrodynamic methods are restricted to using quadratic meshes with quadratic polynomials (P2), which in turn, yield up to third-order accuracy. Additionally, these existing DG hydrodynamic schemes, when extended to work with cubic meshes and cubic polynomials (P3), can be unstable on strong-shock problems. Therefore, this paper presents a new Lagrangian discontinuous Galerkin (DG) hydrodynamic method to simulate compressible material dynamics ( e.g., gasses, fluids, and solids) with strong-shocks using cubic meshes and cubic polynomials, and delivers up to fourth-order accuracy on smooth flows. The stability on shock problems is achieved using new hierarchical orthogonal basis functions and a new subcell mesh stabilization (SMS) scheme for cubic meshes. The accuracy and robustness of the new high-order accurate Lagrangian DG hydrodynamic method is demonstrated by simulating a diverse suite of challenging test problems covering gas and solid dynamic problems on curvilinear meshes.

97 MATHEMATICS AND COMPUTING↗