WorldWideScience

Sample records for boubaker polynomials expansion

  1. On the Connection Coefficients of the Chebyshev-Boubaker Polynomials

    Directory of Open Access Journals (Sweden)

    Paul Barry

    2013-01-01

    Full Text Available The Chebyshev-Boubaker polynomials are the orthogonal polynomials whose coefficient arrays are defined by ordinary Riordan arrays. Examples include the Chebyshev polynomials of the second kind and the Boubaker polynomials. We study the connection coefficients of this class of orthogonal polynomials, indicating how Riordan array techniques can lead to closed-form expressions for these connection coefficients as well as recurrence relations that define them.

  2. Study of ytterbium doping effects on structural, mechanical and opto-thermal properties of sprayed ZnO thin films using the Boubaker Polynomials Expansion Scheme (BPES)

    Energy Technology Data Exchange (ETDEWEB)

    Amlouk, A. [Unite de physique des dispositifs a semi-conducteurs, Faculte des sciences de Tunis, Universite de Tunis El Manar, 2092 Tunis (Tunisia); Boubaker, K., E-mail: mmbb11112000@yahoo.f [Unite de physique des dispositifs a semi-conducteurs, Faculte des sciences de Tunis, Universite de Tunis El Manar, 2092 Tunis (Tunisia); Amlouk, M. [Unite de physique des dispositifs a semi-conducteurs, Faculte des sciences de Tunis, Universite de Tunis El Manar, 2092 Tunis (Tunisia); Bouhafs, M. [Unite de Recherche MA2I, Ecole Nationale d' Ingenieurs de Tunis, B.P. 37 Le Belvedere, 1002 Tunis (Tunisia)

    2009-10-19

    In this work, ZnO thin films have been grown on glass substrates by using a solution of propanol (C{sub 3}H{sub 8}O), water (H{sub 2}O) and zinc acetate (Z{sub n}(CH{sub 3}CO{sub 2}){sub 2}) in acidified medium (pH 5). The obtained films were n doped with ytterbium (Yb) at the rates of 100, 200 and 300 ppm. The structural features of the doped films were investigated using XRD, atomic force microscopy and scanning electronic microscopy techniques. XRD analysis shows a strong (0 0 2) X-ray diffraction line for increasing Yb-doping amounts. This c-axis preferential orientation of ZnO crystallites is naturally required to use this oxide as transparent conductor in optoelectronic applications. Atomic force microscopy (AFM) analysis shows an enhancement in the surface roughness of the doped ZnO:Yb thin films. Optical measurements were performed in 300-1800 nm domain via transmittance T(lambda) and reflectance R(lambda) spectra. Conjoint optical and thermal properties were deduced from the optical measurements in reference to the Amlouk-Boubaker opto-thermal expansivity psi{sub AB}. Optically relevant ytterbium doping effects have been discussed. Finally, mechanical measurements have been carried out using Vickers standard disposal. The results confirmed the structural and functional changes that several recent studies attributed to ytterbium doping.

  3. SnO{sub 2} thin films morphological and optical properties in terms of the Boubaker Polynomials Expansion Scheme BPES-related Opto-Thermal Expansivity {psi}{sub AB}

    Energy Technology Data Exchange (ETDEWEB)

    Amlouk, A.; Boubaker, K. [Unite de physique des dispositifs a semi-conducteurs, Faculte des sciences de Tunis, Universite de Tunis El Manar, 2092 Tunis (Tunisia); Amlouk, M., E-mail: mmbb11112000@yahoo.f [Unite de physique des dispositifs a semi-conducteurs, Faculte des sciences de Tunis, Universite de Tunis El Manar, 2092 Tunis (Tunisia)

    2010-02-04

    In this study, SnO{sub 2} thin films have been grown using spray pyrolysis technique on glass substrates under a substrate temperature (T{sub s} = 440 {sup o}C). The precursors were methanol CH{sub 4}O and anhydrous tin tetrachloride. XRD analyses yielded strong (1 1 0)-(1 0 1)-(2 0 0) X-ray diffraction peaks which are characteristics to tetragonal crystals. Atomic Force Microscopy (AFM) analyses showed the existence of clusters with particular pyramidal shapes. The main part of this study concerns the optical measurements of transmittance T({lambda}) and reflectance R({lambda}) spectra inside 250-1800 nm domain. Conjoint optical and thermal properties were deduced using the Amlouk-Boubaker Opto-Thermal Expansivity {psi}{sub AB}. The obtained value: {psi}{sub AB} {approx} 23.4 m{sup 3} s{sup -1} helped situating the performance of the as-grown SnO{sub 2} compound among most known PV-T oxides like ZnO and TiO{sub 2}.

  4. Diffusion tensor image registration using polynomial expansion

    International Nuclear Information System (INIS)

    In this paper, we present a deformable registration framework for the diffusion tensor image (DTI) using polynomial expansion. The use of polynomial expansion in image registration has previously been shown to be beneficial due to fast convergence and high accuracy. However, earlier work was developed only for 3D scalar medical image registration. In this work, it is shown how polynomial expansion can be applied to DTI registration. A new measurement is proposed for DTI registration evaluation, which seems to be robust and sensitive in evaluating the result of DTI registration. We present the algorithms for DTI registration using polynomial expansion by the fractional anisotropy image, and an explicit tensor reorientation strategy is inherent to the registration process. Analytic transforms with high accuracy are derived from polynomial expansion and used for transforming the tensor's orientation. Three measurements for DTI registration evaluation are presented and compared in experimental results. The experiments for algorithm validation are designed from simple affine deformation to nonlinear deformation cases, and the algorithms using polynomial expansion give a good performance in both cases. Inter-subject DTI registration results are presented showing the utility of the proposed method. (paper)

  5. ASYMPTOTIC EXPANSIONS OF ZEROS FOR KRAWTCHOUK POLYNOMIALS WITH ERROR BOUNDS

    Institute of Scientific and Technical Information of China (English)

    ZHU Xiao-feng; LI Xiu-chun

    2006-01-01

    Krawtchouk polynomials are frequently applied in modern physics. Based on the results which were educed by Li and Wong, the asymptotic expansions of Krawtchouk polynomials are improved by using Airy function, and uniform asymptotic expansions are got. Furthermore, the asymptotic expansions of the zeros for Krawtchouk polynomials are again deduced by using the property of the zeros of Airy function, and their corresponding error bounds are discussed. The obtained results give the asymptotic property of Krawtchouk polynomials with their zeros, which are better than the results educed by Li and Wong.

  6. Effects of substrate temperature on sprayed ZnO thin films optical and morphological properties in terms of Amlouk-Boubaker opto-thermal expansivity psi{sub AB}

    Energy Technology Data Exchange (ETDEWEB)

    Amlouk, A.; Boubaker, K. [Unite de physique des dispositifs a semi-conducteurs, Faculte des sciences de Tunis, Universite de Tunis El Manar, 2092 Tunis (Tunisia); Amlouk, M., E-mail: mmbb11112000@yahoo.f [Unite de physique des dispositifs a semi-conducteurs, Faculte des sciences de Tunis, Universite de Tunis El Manar, 2092 Tunis (Tunisia)

    2009-08-12

    In this study, ZnO thin films have been grown using spray pyrolysis technique on glass substrates under various substrate temperature (400, 420, 440, 460, 480 and 500 deg. C). The Precursors were Propan-2-ol C{sub 3}H{sub 8}O and zinc acetate zinc Zn(CH{sub 3}CO{sub 2}){sub 2} in acidified medium (acetic acid CH{sub 3}CO{sub 2}H, pH = 5). XRD analyses yielded a strong (0 0 2) X-ray diffraction line for low substrate temperatures (400-420 deg. C). This c-axis preferential orientation was not observed for substrate temperature beyond 440 deg. C. Atomic Force Microscopy (AFM) analyses monitored clusters with variable shapes (pyramidal for high temperatures and rounded concentrated ones for temperatures below 440 deg. C). Finally, the optical measurements were carried out via transmittance T(lambda) and reflectance R(lambda) spectra inside 250-2500 nm domain. Thanks to optical measurements, the conjoint optical and thermal properties were deduced using the Amlouk-Boubaker opto-thermal expansively psi{sub AB}.

  7. Polynomial chaos expansion with random and fuzzy variables

    Science.gov (United States)

    Jacquelin, E.; Friswell, M. I.; Adhikari, S.; Dessombz, O.; Sinou, J.-J.

    2016-06-01

    A dynamical uncertain system is studied in this paper. Two kinds of uncertainties are addressed, where the uncertain parameters are described through random variables and/or fuzzy variables. A general framework is proposed to deal with both kinds of uncertainty using a polynomial chaos expansion (PCE). It is shown that fuzzy variables may be expanded in terms of polynomial chaos when Legendre polynomials are used. The components of the PCE are a solution of an equation that does not depend on the nature of uncertainty. Once this equation is solved, the post-processing of the data gives the moments of the random response when the uncertainties are random or gives the response interval when the variables are fuzzy. With the PCE approach, it is also possible to deal with mixed uncertainty, when some parameters are random and others are fuzzy. The results provide a fuzzy description of the response statistical moments.

  8. A GLOBALLY UNIFORM ASYMPTOTIC EXPANSION OF THE HERMITE POLYNOMIALS

    Institute of Scientific and Technical Information of China (English)

    Shi Wei

    2008-01-01

    In this article, the author extends the validity of a uniform asymptotic ex-pansion of the Hermite polynomials HN(√2n+1α) to include all positive values of a.His method makes use of the rational functions introduced by Olde Daalhuis and Temme (SIAM J. Math. Anal., (1994), 25: 304-321). A new estimate for the remainder is given.

  9. Enhancing Sparsity of Hermite Polynomial Expansions by Iterative Rotations

    Energy Technology Data Exchange (ETDEWEB)

    Yang, Xiu; Lei, Huan; Baker, Nathan A.; Lin, Guang

    2016-02-15

    Compressive sensing has become a powerful addition to uncertainty quantification in recent years. This paper identifies new bases for random variables through linear mappings such that the representation of the quantity of interest is more sparse with new basis functions associated with the new random variables. This sparsity increases both the efficiency and accuracy of the compressive sensing-based uncertainty quantification method. Specifically, we consider rotation- based linear mappings which are determined iteratively for Hermite polynomial expansions. We demonstrate the effectiveness of the new method with applications in solving stochastic partial differential equations and high-dimensional (O(100)) problems.

  10. On Continued Fraction Expansion of Real Roots of Polynomial Systems

    DEFF Research Database (Denmark)

    Mantzaflaris, Angelos; Mourrain, Bernard; Tsigaridas, Elias

    2011-01-01

    feasible over unbounded regions. Then, we study an algorithm to split this representation and obtain a subdivision scheme for the domain of multivariate polynomial functions. This implies a new algorithm for real root isolation, MCF, that generalizes the Continued Fraction (CF) algorithm of univariate......, corresponding to the first terms of the continued fraction expansion of the real roots. Finally, we present new complexity bounds for a simplified version of the algorithm in the bit complexity model, and also bounds in the real RAM model for a family of subdivision algorithms in terms of the real condition...... number of the system. Examples computed with our C++ implementation illustrate the practical aspects of our method....

  11. Explicit energy expansion for general odd-degree polynomial potentials

    Science.gov (United States)

    Nanayakkara, Asiri; Mathanaranjan, Thilagarajah

    2013-11-01

    In this paper we derive an almost explicit analytic formula for asymptotic eigenenergy expansion of arbitrary odd-degree polynomial potentials of the form V (x) = (ix)2N+1 + β1x2N + β2x2N-1 + ··· + β2Nx, where β‧k are real or complex for 1 ⩽ k ⩽ 2N. The formula can be used to find semiclassical analytic expressions for eigenenergies up to any order, very efficiently. Each term of the expansion is given explicitly as a multinomial of the parameters β1,β2… and β2N of the potential. Unlike in the even-degree polynomial case, the highest-order term in the potential is pure imaginary and hence the system is non-Hermitian. Therefore all the integrations have been carried out along a contour enclosing two complex branch points, which lies within a wedge in the complex plane. With the help of some examples we demonstrate the accuracy of the method for both real and complex eigenspectra.

  12. Explicit energy expansion for general odd-degree polynomial potentials

    International Nuclear Information System (INIS)

    In this paper we derive an almost explicit analytic formula for asymptotic eigenenergy expansion of arbitrary odd-degree polynomial potentials of the form V (x) = (ix)2N+1 + β1x2N + β2x2N−1 + ··· + β2Nx, where β′k are real or complex for 1 ⩽ k ⩽ 2N. The formula can be used to find semiclassical analytic expressions for eigenenergies up to any order, very efficiently. Each term of the expansion is given explicitly as a multinomial of the parameters β1,β2… and β2N of the potential. Unlike in the even-degree polynomial case, the highest-order term in the potential is pure imaginary and hence the system is non-Hermitian. Therefore all the integrations have been carried out along a contour enclosing two complex branch points, which lies within a wedge in the complex plane. With the help of some examples we demonstrate the accuracy of the method for both real and complex eigenspectra. (paper)

  13. Polynomial Chaos Expansion Approach to Interest Rate Models

    Directory of Open Access Journals (Sweden)

    Luca Di Persio

    2015-01-01

    Full Text Available The Polynomial Chaos Expansion (PCE technique allows us to recover a finite second-order random variable exploiting suitable linear combinations of orthogonal polynomials which are functions of a given stochastic quantity ξ, hence acting as a kind of random basis. The PCE methodology has been developed as a mathematically rigorous Uncertainty Quantification (UQ method which aims at providing reliable numerical estimates for some uncertain physical quantities defining the dynamic of certain engineering models and their related simulations. In the present paper, we use the PCE approach in order to analyze some equity and interest rate models. In particular, we take into consideration those models which are based on, for example, the Geometric Brownian Motion, the Vasicek model, and the CIR model. We present theoretical as well as related concrete numerical approximation results considering, without loss of generality, the one-dimensional case. We also provide both an efficiency study and an accuracy study of our approach by comparing its outputs with the ones obtained adopting the Monte Carlo approach, both in its standard and its enhanced version.

  14. Uncertainty Quantification for Airfoil Icing using Polynomial Chaos Expansions

    CERN Document Server

    DeGennaro, Anthony M; Martinelli, Luigi

    2014-01-01

    The formation and accretion of ice on the leading edge of a wing can be detrimental to airplane performance. Complicating this reality is the fact that even a small amount of uncertainty in the shape of the accreted ice may result in a large amount of uncertainty in aerodynamic performance metrics (e.g., stall angle of attack). The main focus of this work concerns using the techniques of Polynomial Chaos Expansions (PCE) to quantify icing uncertainty much more quickly than traditional methods (e.g., Monte Carlo). First, we present a brief survey of the literature concerning the physics of wing icing, with the intention of giving a certain amount of intuition for the physical process. Next, we give a brief overview of the background theory of PCE. Finally, we compare the results of Monte Carlo simulations to PCE-based uncertainty quantification for several different airfoil icing scenarios. The results are in good agreement and confirm that PCE methods are much more efficient for the canonical airfoil icing un...

  15. A Polynomial Expansion Method and New General Solitary Wave Solutions to KS Equation

    Institute of Scientific and Technical Information of China (English)

    PENG Yan-Ze

    2003-01-01

    Using a polynomial expansion method, the general exact solitary wave solution and singular one areconstructed for the non-linear KS equation. This approach is obviously applicable to a large variety of nonlinear evolution equation.

  16. Closed Form Solution to an Optimal Control Problem by Orthogonal Polynomial Expansion

    Directory of Open Access Journals (Sweden)

    Mohammad A. Tavallaei

    2008-01-01

    Full Text Available In this study the use of orthogonal polynomials for obtaining a close form solution to optimal control problems with a weighed quadratic cost function, is proposed. The method consists of using the Orthogonal Polynomials for the expansion of the state variables and the control signal. This expansion results in a set of linear equations, from which the closed form solution is obtained. A numerical example is provided to demonstrate the applicability and effectiveness of the proposed method.

  17. Use of analytic functions and polynomials within the framework of nodal expansion method

    International Nuclear Information System (INIS)

    A method using one-dimensional flux approximation expressed in terms of polynomials and hyperbolic functions was derived and the accuracy of the method was explored. This method called SANEM(Semi-Analytic Nodal Expansion Method) employs the same transverse leakage approximation used in NEM(Nodal Expansion Method) and flux moment balance equations to find coupling coefficients in current continuity equation. An one-dimensional flux approximation is expressed in the second order/the third order/the fourth order polynomials combined with hyperbolic functions for which several weighting functions are applied and the accuracy of methods were compared. This method has advantages of minimizing memory increase and easy implementation to a nodal code based on the conventional NEM. Benchmark calculations for the code were performed using problems such as IAEA 3D problem, NEACRP-L336 problem and EPRI-9R problem. Results show that both reactivity and assembly power density prediction by the SANEM is better than NEM for NEACRP-L336 problem, which uses MOX fuel, EPRI-9R problem, which shows characteristics of assembly in core periphery. A step function weighting applied to the third order polynomial expansion of a one-dimensional flux approximation produced better results than the polynomial weighting applied to the third order polynomial expansion for IAEA 3D problem. Furthermore, Galerkin weighting applied to the fourth order polynomial expansion shows worse results than polynomial weighting applied to the third order polynomial expansion for IAEA 3D, NEACRP-L336 and EPRI-9R problems

  18. Simulation of stochastic systems via polynomial chaos expansions and convex optimization

    CERN Document Server

    Fagiano, Lorenzo

    2012-01-01

    Polynomial Chaos Expansions represent a powerful tool to simulate stochastic models of dynamical systems. Yet, deriving the expansion's coefficients for complex systems might require a significant and non-trivial manipulation of the model, or the computation of large numbers of simulation runs, rendering the approach too time consuming and impracticable for applications with more than a handful of random variables. We introduce a novel computationally tractable technique for computing the coefficients of polynomial chaos expansions. The approach exploits a regularization technique with a particular choice of weighting matrices, which allow to take into account the specific features of Polynomial Chaos expansions. The method, completely based on convex optimization, can be applied to problems with a large number of random variables and uses a modest number of Monte Carlo simulations, while avoiding model manipulations. Additional information on the stochastic process, when available, can be also incorporated i...

  19. Computation of Higher-Order Moments of Generalized Polynomial Chaos Expansions

    CERN Document Server

    Faverjon, Béatrice

    2016-01-01

    Because of the high complexity of steady-state or transient fluid flow solvers, non-intrusive uncertainty quantification techniques have been developed in aerodynamic simulations in order to compute the output quantities of interest that are required to evaluate the objective function of an optimization process, for example. The latter is commonly expressed in terms of moments of the quantities of interest, such as the mean, standard deviation, or even higher-order moments (skewness, kurtosis...). Polynomial surrogate models based on homogeneous chaos expansions have often been implemented in this respect. The original approach of uncertainty quantification using such polynomial expansions is however intrusive. It is based on a Galerkin-type projection formulation of the model equations to derive the governing equations for the polynomial expansion coefficients of the output quantities of interest. Both the intrusive and non-intrusive approaches call for the computation of third-order, even fourth-order momen...

  20. Compressive sampling of polynomial chaos expansions: Convergence analysis and sampling strategies

    International Nuclear Information System (INIS)

    Sampling orthogonal polynomial bases via Monte Carlo is of interest for uncertainty quantification of models with random inputs, using Polynomial Chaos (PC) expansions. It is known that bounding a probabilistic parameter, referred to as coherence, yields a bound on the number of samples necessary to identify coefficients in a sparse PC expansion via solution to an ℓ1-minimization problem. Utilizing results for orthogonal polynomials, we bound the coherence parameter for polynomials of Hermite and Legendre type under their respective natural sampling distribution. In both polynomial bases we identify an importance sampling distribution which yields a bound with weaker dependence on the order of the approximation. For more general orthonormal bases, we propose the coherence-optimal sampling: a Markov Chain Monte Carlo sampling, which directly uses the basis functions under consideration to achieve a statistical optimality among all sampling schemes with identical support. We demonstrate these different sampling strategies numerically in both high-order and high-dimensional, manufactured PC expansions. In addition, the quality of each sampling method is compared in the identification of solutions to two differential equations, one with a high-dimensional random input and the other with a high-order PC expansion. In both cases, the coherence-optimal sampling scheme leads to similar or considerably improved accuracy

  1. Compressive sampling of polynomial chaos expansions: Convergence analysis and sampling strategies

    Energy Technology Data Exchange (ETDEWEB)

    Hampton, Jerrad; Doostan, Alireza, E-mail: alireza.doostan@colorado.edu

    2015-01-01

    Sampling orthogonal polynomial bases via Monte Carlo is of interest for uncertainty quantification of models with random inputs, using Polynomial Chaos (PC) expansions. It is known that bounding a probabilistic parameter, referred to as coherence, yields a bound on the number of samples necessary to identify coefficients in a sparse PC expansion via solution to an ℓ{sub 1}-minimization problem. Utilizing results for orthogonal polynomials, we bound the coherence parameter for polynomials of Hermite and Legendre type under their respective natural sampling distribution. In both polynomial bases we identify an importance sampling distribution which yields a bound with weaker dependence on the order of the approximation. For more general orthonormal bases, we propose the coherence-optimal sampling: a Markov Chain Monte Carlo sampling, which directly uses the basis functions under consideration to achieve a statistical optimality among all sampling schemes with identical support. We demonstrate these different sampling strategies numerically in both high-order and high-dimensional, manufactured PC expansions. In addition, the quality of each sampling method is compared in the identification of solutions to two differential equations, one with a high-dimensional random input and the other with a high-order PC expansion. In both cases, the coherence-optimal sampling scheme leads to similar or considerably improved accuracy.

  2. On Some Expansion Theorems Involving Confluent Hypergeometric $_{2}F_{2}(x)$ Polynomial

    OpenAIRE

    Vyas, Yashoverdhan; Fatawat, Kalpana

    2016-01-01

    Recently, Rathie and K{\\i}l{\\i}\\c{c}man (2014) employed Kummer-type transformation for $_{2}F_{2}(a, d+1; b, d; x)$ to develop certain classes of expansions theorems for $_{2}F_{2}(x)$ hypergeometric polynomial. Our aim is to deduce Kummer-type transformation for $_{2}F_{2}(a, d+2; b, d; x)$ and utilize it to develop some new expansion theorems for the confluent hypergeometric $_{2}F_{2}(x)$ polynomial. We also obtain a well-known result given by Kim et al. (Integral Transforms Spec. Funct. 2...

  3. On genus expansion of knot polynomials and hidden structure of Hurwitz tau-functions

    International Nuclear Information System (INIS)

    In the genus expansion of the HOMFLY polynomials their representation dependence is naturally captured by symmetric group characters. This immediately implies that the Ooguri-Vafa partition function (OVPF) is a Hurwitz tau-function. In the planar limit involving factorizable special polynomials, it is actually a trivial exponential tau-function. In fact, in the double scaling Kashaev limit (the one associated with the volume conjecture) dominant in the genus expansion are terms associated with the symmetric representations and with the integrability preserving Casimir operators, though we stop one step from converting this fact into a clear statement about the OVPF behavior in the vicinity of q=1. Instead, we explain that the genus expansion provides a hierarchical decomposition of the Hurwitz tau-function, similar to the Takasaki-Takebe expansion of the KP tau-functions. This analogy can be helpful to develop a substitute for the universal Grassmannian description in the Hurwitz tau-functions. (orig.)

  4. Superiority of Bessel function over Zernicke polynomial as base function for radial expansion in tomographic reconstruction

    Indian Academy of Sciences (India)

    A K Chattopadhyay; C V S Rao

    2003-07-01

    Here we describe the superiority of Bessel function as base function for radial expansion over Zernicke polynomial in the tomographic reconstruction technique. The causes for the superiority have been described in detail. The superiority has been shown both with simulated data for Kadomtsev’s model for saw-tooth oscillation and real experimental x-ray data from W7-AS Stellarator.

  5. Uncertainty Quantification in CO{sub 2} Sequestration Using Surrogate Models from Polynomial Chaos Expansion

    Energy Technology Data Exchange (ETDEWEB)

    Zhang, Yan; Sahinidis, Nikolaos V

    2013-04-06

    In this paper, surrogate models are iteratively built using polynomial chaos expansion (PCE) and detailed numerical simulations of a carbon sequestration system. Output variables from a numerical simulator are approximated as polynomial functions of uncertain parameters. Once generated, PCE representations can be used in place of the numerical simulator and often decrease simulation times by several orders of magnitude. However, PCE models are expensive to derive unless the number of terms in the expansion is moderate, which requires a relatively small number of uncertain variables and a low degree of expansion. To cope with this limitation, instead of using a classical full expansion at each step of an iterative PCE construction method, we introduce a mixed-integer programming (MIP) formulation to identify the best subset of basis terms in the expansion. This approach makes it possible to keep the number of terms small in the expansion. Monte Carlo (MC) simulation is then performed by substituting the values of the uncertain parameters into the closed-form polynomial functions. Based on the results of MC simulation, the uncertainties of injecting CO{sub 2} underground are quantified for a saline aquifer. Moreover, based on the PCE model, we formulate an optimization problem to determine the optimal CO{sub 2} injection rate so as to maximize the gas saturation (residual trapping) during injection, and thereby minimize the chance of leakage.

  6. Construction of bootstrap confidence intervals on sensitivity indices computed by polynomial chaos expansion

    International Nuclear Information System (INIS)

    Sensitivity analysis aims at quantifying influence of input parameters dispersion on the output dispersion of a numerical model. When the model evaluation is time consuming, the computation of Sobol' indices based on Monte Carlo method is not applicable and a surrogate model has to be used. Among all approximation methods, polynomial chaos expansion is one of the most efficient to calculate variance-based sensitivity indices. Indeed, their computation is analytically derived from the expansion coefficients but without error estimators of the meta-model approximation. In order to evaluate the reliability of these indices, we propose to build confidence intervals by bootstrap re-sampling on the experimental design used to estimate the polynomial chaos approximation. Since the evaluation of the sensitivity indices is obtained with confidence intervals, it is possible to find a design of experiments allowing the computation of sensitivity indices with a given accuracy. - Highlights: • The proposed methodology combines advantages of sparse polynomial chaos expansion with bootstrap re-sampling to compute variance-based sensitivity indices. • A conservative way to choose the number of bootstrap re-sampling is presented. • A method to increase the degree of the polynomial basis, linked to the size of confidence intervals, is proposed. • Comparisons with classical meta-model error estimators reveals the interest of a sensitivity-indices-oriented methodology

  7. Lattice Boltzmann method for bosons and fermions and the fourth order Hermite polynomial expansion

    CERN Document Server

    Coelho, Rodrigo C V; Doria, M M; Pereira, R M; Aibe, Valter Yoshihiko

    2013-01-01

    The Boltzmann equation with the Bhatnagar-Gross-Krook collision operator is considered for the Bose-Einstein and Fermi-Dirac equilibrium distribution functions. We show that the expansion of the microscopic velocity in terms of Hermite polynomials must be carried until the fourth order to correctly describe the energy equation. The viscosity and thermal coefficients, previously obtained by J.Y. Yang et al through the Uehling-Uhlenbeck approach, are also derived here. Thus the construction of a lattice Boltzmann method for the quantum fluid is possible provided that the Bose-Einstein and Fermi-Dirac equilibrium distribution functions are expanded until fourth order in the Hermite polynomials.

  8. Limitations of polynomial chaos expansions in the Bayesian solution of inverse problems

    International Nuclear Information System (INIS)

    Polynomial chaos expansions are used to reduce the computational cost in the Bayesian solutions of inverse problems by creating a surrogate posterior that can be evaluated inexpensively. We show, by analysis and example, that when the data contain significant information beyond what is assumed in the prior, the surrogate posterior can be very different from the posterior, and the resulting estimates become inaccurate. One can improve the accuracy by adaptively increasing the order of the polynomial chaos, but the cost may increase too fast for this to be cost effective compared to Monte Carlo sampling without a surrogate posterior

  9. Two-energy group solution of the diffusion equation by the multidimensional nodal polynomial expansion method

    International Nuclear Information System (INIS)

    The EPON computer code based in a Nodal Polynomial Expansion Method, wrote in Fortran IV, for steady-state, square geometry, one-dimensional or two-dimensional geometry and for one or two-energy group is presented. The neutron and power flux distributions for nuclear power plants were calculated, comparing with codes that use similar or different methodologies. The availability, economy and speed of the methodology is demonstrated. (E.G.)

  10. A reduced polynomial chaos expansion method for the stochastic finite element analysis

    Indian Academy of Sciences (India)

    B Pascual; S Adhikari

    2012-06-01

    The stochastic finite element analysis of elliptic type partial differential equations is considered. A reduced method of the spectral stochastic finite element method using polynomial chaos is proposed. The method is based on the spectral decomposition of the deterministic system matrix. The reduction is achieved by retaining only the dominant eigenvalues and eigenvectors. The response of the reduced system is expanded as a series of Hermite polynomials, and a Galerkin error minimization approach is applied to obtain the deterministic coefficients of the expansion. The moments and probability density function of the solution are obtained by a process similar to the classical spectral stochastic finite element method. The method is illustrated using three carefully selected numerical examples, namely, bending of a stochastic beam, flow through porous media with stochastic permeability and transverse bending of a plate with stochastic properties. The results obtained from the proposed method are compared with classical polynomial chaos and direct Monte Carlo simulation results.

  11. Fast and accurate sensitivity analysis of IMPT treatment plans using Polynomial Chaos Expansion

    Science.gov (United States)

    Perkó, Zoltán; van der Voort, Sebastian R.; van de Water, Steven; Hartman, Charlotte M. H.; Hoogeman, Mischa; Lathouwers, Danny

    2016-06-01

    The highly conformal planned dose distribution achievable in intensity modulated proton therapy (IMPT) can severely be compromised by uncertainties in patient setup and proton range. While several robust optimization approaches have been presented to address this issue, appropriate methods to accurately estimate the robustness of treatment plans are still lacking. To fill this gap we present Polynomial Chaos Expansion (PCE) techniques which are easily applicable and create a meta-model of the dose engine by approximating the dose in every voxel with multidimensional polynomials. This Polynomial Chaos (PC) model can be built in an automated fashion relatively cheaply and subsequently it can be used to perform comprehensive robustness analysis. We adapted PC to provide among others the expected dose, the dose variance, accurate probability distribution of dose-volume histogram (DVH) metrics (e.g. minimum tumor or maximum organ dose), exact bandwidths of DVHs, and to separate the effects of random and systematic errors. We present the outcome of our verification experiments based on 6 head-and-neck (HN) patients, and exemplify the usefulness of PCE by comparing a robust and a non-robust treatment plan for a selected HN case. The results suggest that PCE is highly valuable for both research and clinical applications.

  12. Efficient linear precoding for massive MIMO systems using truncated polynomial expansion

    KAUST Repository

    Müller, Axel

    2014-06-01

    Massive multiple-input multiple-output (MIMO) techniques have been proposed as a solution to satisfy many requirements of next generation cellular systems. One downside of massive MIMO is the increased complexity of computing the precoding, especially since the relatively \\'antenna-efficient\\' regularized zero-forcing (RZF) is preferred to simple maximum ratio transmission. We develop in this paper a new class of precoders for single-cell massive MIMO systems. It is based on truncated polynomial expansion (TPE) and mimics the advantages of RZF, while offering reduced and scalable computational complexity that can be implemented in a convenient parallel fashion. Using random matrix theory we provide a closed-form expression of the signal-to-interference-and-noise ratio under TPE precoding and compare it to previous works on RZF. Furthermore, the sum rate maximizing polynomial coefficients in TPE precoding are calculated. By simulation, we find that to maintain a fixed peruser rate loss as compared to RZF, the polynomial degree does not need to scale with the system, but it should be increased with the quality of the channel knowledge and signal-to-noise ratio. © 2014 IEEE.

  13. Linear precoding based on polynomial expansion: reducing complexity in massive MIMO

    KAUST Repository

    Mueller, Axel

    2016-02-29

    Massive multiple-input multiple-output (MIMO) techniques have the potential to bring tremendous improvements in spectral efficiency to future communication systems. Counterintuitively, the practical issues of having uncertain channel knowledge, high propagation losses, and implementing optimal non-linear precoding are solved more or less automatically by enlarging system dimensions. However, the computational precoding complexity grows with the system dimensions. For example, the close-to-optimal and relatively “antenna-efficient” regularized zero-forcing (RZF) precoding is very complicated to implement in practice, since it requires fast inversions of large matrices in every coherence period. Motivated by the high performance of RZF, we propose to replace the matrix inversion and multiplication by a truncated polynomial expansion (TPE), thereby obtaining the new TPE precoding scheme which is more suitable for real-time hardware implementation and significantly reduces the delay to the first transmitted symbol. The degree of the matrix polynomial can be adapted to the available hardware resources and enables smooth transition between simple maximum ratio transmission and more advanced RZF. By deriving new random matrix results, we obtain a deterministic expression for the asymptotic signal-to-interference-and-noise ratio (SINR) achieved by TPE precoding in massive MIMO systems. Furthermore, we provide a closed-form expression for the polynomial coefficients that maximizes this SINR. To maintain a fixed per-user rate loss as compared to RZF, the polynomial degree does not need to scale with the system, but it should be increased with the quality of the channel knowledge and the signal-to-noise ratio.

  14. Higher order polynomial expansion nodal method for hexagonal core neutronics analysis

    International Nuclear Information System (INIS)

    A higher-order polynomial expansion nodal(PEN) method is newly formulated as a means to improve the accuracy of the conventional PEN method solutions to multi-group diffusion equations in hexagonal core geometry. The new method is applied to solving various hexagonal core neutronics benchmark problems. The computational accuracy of the higher order PEN method is then compared with that of the conventional PEN method, the analytic function expansion nodal (AFEN) method, and the ANC-H method. It is demonstrated that the higher order PEN method improves the accuracy of the conventional PEN method and that it compares very well with the other nodal methods like the AFEN and ANC-H methods in accuracy

  15. Low order polynomial expansion nodal method for a DeCart axial solution

    Energy Technology Data Exchange (ETDEWEB)

    Cho, Jin-Young; Song, Jae-Seung; Lee, Hyun-Chul, E-mail: jyoung@kaeri.re.k, E-mail: jssong@kaeri.re.k, E-mail: lhc@kaeri.re.k [Korea Atomic Energy Research Institute, Daejon (Korea, Republic of)

    2009-07-01

    This paper applies a low order polynomial expansion nodal (LPEN) method to the simplified Pn (SPn) transport equation for the DeCART (Deterministic Core Analysis based on Ray Tracing) axial solution. For a performance examination of the implemented LPWN method, the C5G7MOC 3-D benchmark and the C5G7 hexagonal variation problems are solved. LPEN method expands the angular flux moments by using up to the second order Legendre polynomials. In the C5G7MOC 3-D benchmark, DeCART shows less than 40 pcm eigenvalue and less 2 % 3-D pin power distribution errors which are similar as the higher order nodal method such as NEM or SANM. In C5G7 hexagonal variation problem, DeCART shows the similar error level as in the C5G7MOX benchmark. Also LPEN method requires less computing time and less memory size than the higher order nodal methods. Therefore, it is concluded that the LPEN method is more applicable to the DeCART cell based axial solver than the higher order nodal methods in aspects of accuracy and performance. (author)

  16. Low order polynomial expansion nodal method for a DeCart axial solution

    International Nuclear Information System (INIS)

    This paper applies a low order polynomial expansion nodal (LPEN) method to the simplified Pn (SPn) transport equation for the DeCART (Deterministic Core Analysis based on Ray Tracing) axial solution. For a performance examination of the implemented LPWN method, the C5G7MOC 3-D benchmark and the C5G7 hexagonal variation problems are solved. LPEN method expands the angular flux moments by using up to the second order Legendre polynomials. In the C5G7MOC 3-D benchmark, DeCART shows less than 40 pcm eigenvalue and less 2 % 3-D pin power distribution errors which are similar as the higher order nodal method such as NEM or SANM. In C5G7 hexagonal variation problem, DeCART shows the similar error level as in the C5G7MOX benchmark. Also LPEN method requires less computing time and less memory size than the higher order nodal methods. Therefore, it is concluded that the LPEN method is more applicable to the DeCART cell based axial solver than the higher order nodal methods in aspects of accuracy and performance. (author)

  17. Surrogate accelerated sampling of reservoir models with complex structures using sparse polynomial chaos expansion

    Science.gov (United States)

    Bazargan, Hamid; Christie, Mike; Elsheikh, Ahmed H.; Ahmadi, Mohammad

    2015-12-01

    Markov Chain Monte Carlo (MCMC) methods are often used to probe the posterior probability distribution in inverse problems. This allows for computation of estimates of uncertain system responses conditioned on given observational data by means of approximate integration. However, MCMC methods suffer from the computational complexities in the case of expensive models as in the case of subsurface flow models. Hence, it is of great interest to develop alterative efficient methods utilizing emulators, that are cheap to evaluate, in order to replace the full physics simulator. In the current work, we develop a technique based on sparse response surfaces to represent the flow response within a subsurface reservoir and thus enable efficient exploration of the posterior probability density function and the conditional expectations given the data. Polynomial Chaos Expansion (PCE) is a powerful tool to quantify uncertainty in dynamical systems when there is probabilistic uncertainty in the system parameters. In the context of subsurface flow model, it has been shown to be more accurate and efficient compared with traditional experimental design (ED). PCEs have a significant advantage over other response surfaces as the convergence to the true probability distribution when the order of the PCE is increased can be proved for the random variables with finite variances. However, the major drawback of PCE is related to the curse of dimensionality as the number of terms to be estimated grows drastically with the number of the input random variables. This renders the computational cost of classical PCE schemes unaffordable for reservoir simulation purposes when the deterministic finite element model is expensive to evaluate. To address this issue, we propose the reduced-terms polynomial chaos representation which uses an impact factor to only retain the most relevant terms of the PCE decomposition. Accordingly, the reduced-terms polynomial chaos proxy can be used as the pseudo

  18. On polynomial chaos expansion via gradient-enhanced ℓ1-minimization

    Science.gov (United States)

    Peng, Ji; Hampton, Jerrad; Doostan, Alireza

    2016-04-01

    Gradient-enhanced Uncertainty Quantification (UQ) has received recent attention, in which the derivatives of a Quantity of Interest (QoI) with respect to the uncertain parameters are utilized to improve the surrogate approximation. Polynomial chaos expansions (PCEs) are often employed in UQ, and when the QoI can be represented by a sparse PCE, ℓ1-minimization can identify the PCE coefficients with a relatively small number of samples. In this work, we investigate a gradient-enhanced ℓ1-minimization, where derivative information is computed to accelerate the identification of the PCE coefficients. For this approach, stability and convergence analysis are lacking, and thus we address these here with a probabilistic result. In particular, with an appropriate normalization, we show the inclusion of derivative information will almost-surely lead to improved conditions, e.g. related to the null-space and coherence of the measurement matrix, for a successful solution recovery. Further, we demonstrate our analysis empirically via three numerical examples: a manufactured PCE, an elliptic partial differential equation with random inputs, and a plane Poiseuille flow with random boundaries. These examples all suggest that including derivative information admits solution recovery at reduced computational cost.

  19. Numerical scheme for the modal method based on subsectional Gegenbauer polynomial expansion: application to biperiodic binary grating.

    Science.gov (United States)

    Edee, K; Plumey, J P

    2015-03-01

    The modal method based on Gegenbauer polynomials (MMGE) is extended to the case of bidimensional binary gratings. A new concept of modified polynomials is introduced in order to take into account boundary conditions and also to make the method more flexible in use. In the previous versions of MMGE, an undersized matrix relation is obtained by solving Maxwell's equations, and the boundary conditions complement this undersized system. In the current work, contrary to this previous version of the MMGE, boundary conditions are incorporated into the definition of a new basis of polynomial functions, which are adapted to the boundary value problem of interest. Results are successfully compared for both metallic and dielectric structures to those obtained from the modal method based on Fourier expansion (MMFE) and MMFE with adaptative spatial resolution. PMID:26366651

  20. A new surrogate modeling technique combining Kriging and polynomial chaos expansions – Application to uncertainty analysis in computational dosimetry

    Energy Technology Data Exchange (ETDEWEB)

    Kersaudy, Pierric, E-mail: pierric.kersaudy@orange.com [Orange Labs, 38 avenue du Général Leclerc, 92130 Issy-les-Moulineaux (France); Whist Lab, 38 avenue du Général Leclerc, 92130 Issy-les-Moulineaux (France); ESYCOM, Université Paris-Est Marne-la-Vallée, 5 boulevard Descartes, 77700 Marne-la-Vallée (France); Sudret, Bruno [ETH Zürich, Chair of Risk, Safety and Uncertainty Quantification, Stefano-Franscini-Platz 5, 8093 Zürich (Switzerland); Varsier, Nadège [Orange Labs, 38 avenue du Général Leclerc, 92130 Issy-les-Moulineaux (France); Whist Lab, 38 avenue du Général Leclerc, 92130 Issy-les-Moulineaux (France); Picon, Odile [ESYCOM, Université Paris-Est Marne-la-Vallée, 5 boulevard Descartes, 77700 Marne-la-Vallée (France); Wiart, Joe [Orange Labs, 38 avenue du Général Leclerc, 92130 Issy-les-Moulineaux (France); Whist Lab, 38 avenue du Général Leclerc, 92130 Issy-les-Moulineaux (France)

    2015-04-01

    In numerical dosimetry, the recent advances in high performance computing led to a strong reduction of the required computational time to assess the specific absorption rate (SAR) characterizing the human exposure to electromagnetic waves. However, this procedure remains time-consuming and a single simulation can request several hours. As a consequence, the influence of uncertain input parameters on the SAR cannot be analyzed using crude Monte Carlo simulation. The solution presented here to perform such an analysis is surrogate modeling. This paper proposes a novel approach to build such a surrogate model from a design of experiments. Considering a sparse representation of the polynomial chaos expansions using least-angle regression as a selection algorithm to retain the most influential polynomials, this paper proposes to use the selected polynomials as regression functions for the universal Kriging model. The leave-one-out cross validation is used to select the optimal number of polynomials in the deterministic part of the Kriging model. The proposed approach, called LARS-Kriging-PC modeling, is applied to three benchmark examples and then to a full-scale metamodeling problem involving the exposure of a numerical fetus model to a femtocell device. The performances of the LARS-Kriging-PC are compared to an ordinary Kriging model and to a classical sparse polynomial chaos expansion. The LARS-Kriging-PC appears to have better performances than the two other approaches. A significant accuracy improvement is observed compared to the ordinary Kriging or to the sparse polynomial chaos depending on the studied case. This approach seems to be an optimal solution between the two other classical approaches. A global sensitivity analysis is finally performed on the LARS-Kriging-PC model of the fetus exposure problem.

  1. A new surrogate modeling technique combining Kriging and polynomial chaos expansions – Application to uncertainty analysis in computational dosimetry

    International Nuclear Information System (INIS)

    In numerical dosimetry, the recent advances in high performance computing led to a strong reduction of the required computational time to assess the specific absorption rate (SAR) characterizing the human exposure to electromagnetic waves. However, this procedure remains time-consuming and a single simulation can request several hours. As a consequence, the influence of uncertain input parameters on the SAR cannot be analyzed using crude Monte Carlo simulation. The solution presented here to perform such an analysis is surrogate modeling. This paper proposes a novel approach to build such a surrogate model from a design of experiments. Considering a sparse representation of the polynomial chaos expansions using least-angle regression as a selection algorithm to retain the most influential polynomials, this paper proposes to use the selected polynomials as regression functions for the universal Kriging model. The leave-one-out cross validation is used to select the optimal number of polynomials in the deterministic part of the Kriging model. The proposed approach, called LARS-Kriging-PC modeling, is applied to three benchmark examples and then to a full-scale metamodeling problem involving the exposure of a numerical fetus model to a femtocell device. The performances of the LARS-Kriging-PC are compared to an ordinary Kriging model and to a classical sparse polynomial chaos expansion. The LARS-Kriging-PC appears to have better performances than the two other approaches. A significant accuracy improvement is observed compared to the ordinary Kriging or to the sparse polynomial chaos depending on the studied case. This approach seems to be an optimal solution between the two other classical approaches. A global sensitivity analysis is finally performed on the LARS-Kriging-PC model of the fetus exposure problem

  2. Polynomial Chaos Expansion of random coefficients and the solution of stochastic partial differential equations in the Tensor Train format

    KAUST Repository

    Dolgov, S.

    2015-03-11

    We apply the Tensor Train (TT) decomposition to construct the tensor product Polynomial Chaos Expansion (PCE) of a random field, to solve the stochastic elliptic diffusion PDE with the stochastic Galerkin discretization, and to compute some quantities of interest (mean, variance, exceedance probabilities). We assume that the random diffusion coefficient is given as a smooth transformation of a Gaussian random field. In this case, the PCE is delivered by a complicated formula, which lacks an analytic TT representation. To construct its TT approximation numerically, we develop the new block TT cross algorithm, a method that computes the whole TT decomposition from a few evaluations of the PCE formula. The new method is conceptually similar to the adaptive cross approximation in the TT format, but is more efficient when several tensors must be stored in the same TT representation, which is the case for the PCE. Besides, we demonstrate how to assemble the stochastic Galerkin matrix and to compute the solution of the elliptic equation and its post-processing, staying in the TT format. We compare our technique with the traditional sparse polynomial chaos and the Monte Carlo approaches. In the tensor product polynomial chaos, the polynomial degree is bounded for each random variable independently. This provides higher accuracy than the sparse polynomial set or the Monte Carlo method, but the cardinality of the tensor product set grows exponentially with the number of random variables. However, when the PCE coefficients are implicitly approximated in the TT format, the computations with the full tensor product polynomial set become possible. In the numerical experiments, we confirm that the new methodology is competitive in a wide range of parameters, especially where high accuracy and high polynomial degrees are required.

  3. Polynomial Chaos Expansion of Random Coefficients and the Solution of Stochastic Partial Differential Equations in the Tensor Train Format

    KAUST Repository

    Dolgov, Sergey

    2015-11-03

    We apply the tensor train (TT) decomposition to construct the tensor product polynomial chaos expansion (PCE) of a random field, to solve the stochastic elliptic diffusion PDE with the stochastic Galerkin discretization, and to compute some quantities of interest (mean, variance, and exceedance probabilities). We assume that the random diffusion coefficient is given as a smooth transformation of a Gaussian random field. In this case, the PCE is delivered by a complicated formula, which lacks an analytic TT representation. To construct its TT approximation numerically, we develop the new block TT cross algorithm, a method that computes the whole TT decomposition from a few evaluations of the PCE formula. The new method is conceptually similar to the adaptive cross approximation in the TT format but is more efficient when several tensors must be stored in the same TT representation, which is the case for the PCE. In addition, we demonstrate how to assemble the stochastic Galerkin matrix and to compute the solution of the elliptic equation and its postprocessing, staying in the TT format. We compare our technique with the traditional sparse polynomial chaos and the Monte Carlo approaches. In the tensor product polynomial chaos, the polynomial degree is bounded for each random variable independently. This provides higher accuracy than the sparse polynomial set or the Monte Carlo method, but the cardinality of the tensor product set grows exponentially with the number of random variables. However, when the PCE coefficients are implicitly approximated in the TT format, the computations with the full tensor product polynomial set become possible. In the numerical experiments, we confirm that the new methodology is competitive in a wide range of parameters, especially where high accuracy and high polynomial degrees are required.

  4. The principal component analysis method used with polynomial Chaos expansion to propagate uncertainties through critical transport problems

    International Nuclear Information System (INIS)

    A critical neutron transport problem with random material properties is introduced. The total cross section and the average neutron multiplicity are assumed to be uncertain, characterized by the mean and variance with a log-normal distribution. The average neutron multiplicity and the total cross section are assumed to be uncorrected and the material properties for differing materials are also assumed to be uncorrected. The principal component analysis method is used to decompose the covariance matrix into eigenvalues and eigenvectors and then 'realizations' of the material properties can be computed. A simple Monte Carlo brute force sampling of the decomposed covariance matrix is employed to obtain a benchmark result for each test problem. In order to save computational time and to characterize the moments and probability density function of the multiplication factor the polynomial chaos expansion method is employed along with the stochastic collocation method. A Gauss-Hermite quadrature set is convolved into a multidimensional tensor product quadrature set and is successfully used to compute the polynomial chaos expansion coefficients of the multiplication factor. Finally, for a particular critical fuel pin assembly the appropriate number of random variables and polynomial expansion order are investigated. (authors)

  5. Interbasis expansions for the isotropic 3D harmonic oscillator and bivariate Krawtchouk polynomials

    International Nuclear Information System (INIS)

    An explicit expression for the general bivariate Krawtchouk polynomials is obtained in terms of the standard Krawtchouk and dual Hahn polynomials. The bivariate Krawtchouk polynomials occur as matrix elements of the unitary reducible representations of SO(3) on the energy eigenspaces of the three-dimensional isotropic harmonic oscillator and the explicit formula is obtained from the decomposition of these representations into their irreducible components. The decomposition entails expanding the Cartesian basis states in the spherical bases that span irreducible SO(3) representations. The overlap coefficients are obtained from the Clebsch–Gordan problem for the su(1,1) Lie algebra. (paper)

  6. Chebyshev polynomials

    CERN Document Server

    Mason, JC

    2002-01-01

    Chebyshev polynomials crop up in virtually every area of numerical analysis, and they hold particular importance in recent advances in subjects such as orthogonal polynomials, polynomial approximation, numerical integration, and spectral methods. Yet no book dedicated to Chebyshev polynomials has been published since 1990, and even that work focused primarily on the theoretical aspects. A broad, up-to-date treatment is long overdue.Providing highly readable exposition on the subject''s state of the art, Chebyshev Polynomials is just such a treatment. It includes rigorous yet down-to-earth coverage of the theory along with an in-depth look at the properties of all four kinds of Chebyshev polynomials-properties that lead to a range of results in areas such as approximation, series expansions, interpolation, quadrature, and integral equations. Problems in each chapter, ranging in difficulty from elementary to quite advanced, reinforce the concepts and methods presented.Far from being an esoteric subject, Chebysh...

  7. A Posteriori Error Analysis of Stochastic Differential Equations Using Polynomial Chaos Expansions

    KAUST Repository

    Butler, T.

    2011-01-01

    We develop computable a posteriori error estimates for linear functionals of a solution to a general nonlinear stochastic differential equation with random model/source parameters. These error estimates are based on a variational analysis applied to stochastic Galerkin methods for forward and adjoint problems. The result is a representation for the error estimate as a polynomial in the random model/source parameter. The advantage of this method is that we use polynomial chaos representations for the forward and adjoint systems to cheaply produce error estimates by simple evaluation of a polynomial. By comparison, the typical method of producing such estimates requires repeated forward/adjoint solves for each new choice of random parameter. We present numerical examples showing that there is excellent agreement between these methods. © 2011 Society for Industrial and Applied Mathematics.

  8. Jacobi polynomials flux moments expansions and factorized kernel approach to the stationary integral anisotropic transport in a finite cylinder

    International Nuclear Information System (INIS)

    A transport method was developed in view of benchmark calculations of the eigenvalues and flux distributions for monoenergetic neutrons anisotropically colliding in a critical cylinder of finite radius and half-height. For the kernels appearing in the system of integral equations for spherical harmonic moments of the angular flux we proposed a factorized form that accounted for the anisotropy of scattering and worked in the original Euclidean space, extending to cylinder geometry, of interest for pratical reactor calculations, a technique previously adopted for the simpler parallelepiped geometry. This treatment of the two-dimensional kernels allows representations typical in one dimensional problems for the matrix formulation to which the problem reduces by the introduction of a corresponding projectional technique. Optimal in view of an appropriate matrix formulation appears also the representation of the unknown spherical harmonics moments in terms of special jacobi polynomials, coinciding with a Legrendre polynomials expansion for the total flux in the case of isotropic scattering. The high accuracy of the results obtained in this case for both eigenvalues and fluxes is finally tested by internal convergence studies and heights as well as for the limiting cases or ratios of radius to height going to zero or to infinity

  9. Irreducibility algorithm for the Weierstrass polynomials of two complex variables and the Puiseux expansions: Part[A], Part[B], Part[C

    OpenAIRE

    Kang, Chunghyuk

    2014-01-01

    It is very fundamental to study irreducible plane curve singularities in algebraic geometry. The contents of the paper consist of three parts, called Part[A], Part[B] and Part[C] with Good Appendix. Our aim is to prove by Part[B] and Part[C] that a complete irreducibility algorithm for the Weierstrass polynomial of two complex variables and the Puiseux expansions in Part[A] can be explicitly and rigorously computable in an elementary way, as follows. For brevity, Weierstrass polynomials may b...

  10. Polynomial functors and polynomial monads

    CERN Document Server

    Gambino, Nicola

    2009-01-01

    We study polynomial functors over locally cartesian closed categories. After setting up the basic theory, we show how polynomial functors assemble into a double category, in fact a framed bicategory. We show that the free monad on a polynomial endofunctor is polynomial. The relationship with operads and other related notions is explored.

  11. Jack polynomials in superspace

    CERN Document Server

    Desrosiers, P; Mathieu, P

    2003-01-01

    This work initiates the study of {\\it orthogonal} symmetric polynomials in superspace. Here we present two approaches leading to a family of orthogonal polynomials in superspace that generalize the Jack polynomials. The first approach relies on previous work by the authors in which eigenfunctions of the supersymmetric extension of the trigonometric Calogero-Moser-Sutherland Hamiltonian were constructed. Orthogonal eigenfunctions are now obtained by diagonalizing the first nontrivial element of a bosonic tower of commuting conserved charges not containing this Hamiltonian. Quite remarkably, the expansion coefficients of these orthogonal eigenfunctions in the supermonomial basis are stable with respect to the number of variables. The second and more direct approach amounts to symmetrize products of non-symmetric Jack polynomials with monomials in the fermionic variables. This time, the orthogonality is inherited from the orthogonality of the non-symmetric Jack polynomials, and the value of the norm is given exp...

  12. Orthogonal polynomials

    CERN Document Server

    Freud, Géza

    1971-01-01

    Orthogonal Polynomials contains an up-to-date survey of the general theory of orthogonal polynomials. It deals with the problem of polynomials and reveals that the sequence of these polynomials forms an orthogonal system with respect to a non-negative m-distribution defined on the real numerical axis. Comprised of five chapters, the book begins with the fundamental properties of orthogonal polynomials. After discussing the momentum problem, it then explains the quadrature procedure, the convergence theory, and G. Szegő's theory. This book is useful for those who intend to use it as referenc

  13. Reliable Computational Predictions by Modeling Uncertainties Using Arbitrary Polynomial Chaos

    OpenAIRE

    Witteveen, J.A.S.; Bijl, H

    2006-01-01

    Inherent physical uncertainties can have a significant influence on computational predictions. It is therefore important to take physical uncertainties into account to obtain more reliable computational predictions. The Galerkin polynomial chaos method is a commonly applied uncertainty quantification method. However, the polynomial chaos expansion has some limitations. Firstly, the polynomial chaos expansion based on classical polynomials can achieve exponential convergence for a limited set ...

  14. Large degree asymptotics of generalized Bessel polynomials

    NARCIS (Netherlands)

    López, J.L.; Temme, N.M.

    2011-01-01

    Asymptotic expansions are given for large values of $n$ of the generalized Bessel polynomials $Y_n^\\mu(z)$. The analysis is based on integrals that follow from the generating functions of the polynomials. A new simple expansion is given that is valid outside a compact neighborhood of the origin in t

  15. Polynomially Bounded Sequences and Polynomial Sequences

    Directory of Open Access Journals (Sweden)

    Okazaki Hiroyuki

    2015-09-01

    Full Text Available In this article, we formalize polynomially bounded sequences that plays an important role in computational complexity theory. Class P is a fundamental computational complexity class that contains all polynomial-time decision problems [11], [12]. It takes polynomially bounded amount of computation time to solve polynomial-time decision problems by the deterministic Turing machine. Moreover we formalize polynomial sequences [5].

  16. Schubert polynomials, slide polynomials, Stanley symmetric functions and quasi-Yamanouchi pipe dreams

    OpenAIRE

    Assaf, Sami; Searles, Dominic

    2016-01-01

    We introduce two new bases for polynomials that lift monomial and fundamental quasisymmetric functions to the full polynomial ring. By defining a new condition on pipe dreams, called quasi-Yamanouchi, we give a positive combinatorial rule for expanding Schubert polynomials into these new bases that parallels the expansion of Schur functions into fundamental quasisymmetric functions. As a result, we obtain a refinement of the stable limits of Schubert polynomials to Stanley symmetric functions...

  17. On the use of polynomial chaos expansions and generalized moments within the frame of gas radiation in non-uniform media

    International Nuclear Information System (INIS)

    In many applications involving gaseous media at high temperature, accurate but computationally efficient models are required for the radiative properties of gases. The aim of the present work is to show how, by combining results from Polynomial Chaos framework and Devyatov's Method Of Moments, one can provide simple estimates of the transmission functions of gases both in uniform and non-uniform media. The proposed model only involves polynomials. It is probably one of the simplest in terms of mathematical formulation but also one of the most sophisticated, considering the concepts that it involves. It can be applied in uniform and non-uniform media, where it is shown to be equivalent, in terms of accuracy, to usual C–k models. - Highlights: • The CDPC approach is introduced. • It uses polynomial chaos and generalized moments to approximate narrow band gas transmissivities. • The approach provides result as accurate as usual C–k models (uniform and non-uniform media). • The approach is less computationally expensive than usual C–k models in uniform media

  18. Haglund's conjecture on 3-column Macdonald polynomials

    OpenAIRE

    Blasiak, Jonah

    2014-01-01

    We prove a positive combinatorial formula for the Schur expansion of LLT polynomials indexed by a 3-tuple of skew shapes. This verifies a conjecture of Haglund. The proof requires expressing a noncommutative Schur function as a positive sum of monomials in Lam's algebra of ribbon Schur operators. Combining this result with the expression of Haglund, Haiman, and Loehr for transformed Macdonald polynomials in terms of LLT polynomials then yields a positive combinatorial rule for transformed Mac...

  19. Large Degree Asymptotics of Generalized Bessel Polynomials

    OpenAIRE

    López, J. L.; Temme, Nico

    2011-01-01

    Asymptotic expansions are given for large values of $n$ of the generalized Bessel polynomials $Y_n^\\mu(z)$. The analysis is based on integrals that follow from the generating functions of the polynomials. A new simple expansion is given that is valid outside a compact neighborhood of the origin in the $z-$plane. New forms of expansions in terms of elementary functions valid in sectors not containing the turning points $z=\\pm i/n$ are derived, and a new expansion in terms of modified Bessel fu...

  20. The Gibbs Phenomenon for Series of Orthogonal Polynomials

    Science.gov (United States)

    Fay, T. H.; Kloppers, P. Hendrik

    2006-01-01

    This note considers the four classes of orthogonal polynomials--Chebyshev, Hermite, Laguerre, Legendre--and investigates the Gibbs phenomenon at a jump discontinuity for the corresponding orthogonal polynomial series expansions. The perhaps unexpected thing is that the Gibbs constant that arises for each class of polynomials appears to be the same…

  1. Factoring multivariate integral polynomials.

    OpenAIRE

    Lenstra, A.K.

    1983-01-01

    An algorithm is presented to factorize polynomials in several variables with integral coefficients that is polynomial-time in the degrees of the polynomial to be factored, for any fixed number of variables. The algorithm generalizes the algorithm presented by A. K. Lenstra et al. to factorize integral polynomials in one variable.

  2. New classes of test polynomials of polynomial algebras

    Institute of Scientific and Technical Information of China (English)

    冯克勤; 余解台

    1999-01-01

    A polynomial p in a polynomial algebra over a field is called a test polynomial if any endomorphism of the polynomial algebra that fixes p is an automorphism. some classes of new test polynomials recognizing nonlinear automorphisms of polynomial algebras are given. In the odd prime characteristic case, test polynomials recognizing non-semisimple automorphisms are also constructed.

  3. Approximation for Transient of Nonlinear Circuits Using RHPM and BPES Methods

    Directory of Open Access Journals (Sweden)

    H. Vazquez-Leal

    2013-01-01

    Full Text Available The microelectronics area constantly demands better and improved circuit simulation tools. Therefore, in this paper, rational homotopy perturbation method and Boubaker Polynomials Expansion Scheme are applied to a differential equation from a nonlinear circuit. Comparing the results obtained by both techniques revealed that they are effective and convenient.

  4. Polynomial Subtraction Method for Disconnected Quark Loops

    CERN Document Server

    Liu, Quan; Morgan, Ron

    2014-01-01

    The polynomial subtraction method, a new numerical approach for reducing the noise variance of Lattice QCD disconnected matrix elements calculation, is introduced in this paper. We use the MinRes polynomial expansion of the QCD matrix as the approximation to the matrix inverse and get a significant reduction in the variance calculation. We compare our results with that of the perturbative subtraction and find that the new strategy yields a faster decrease in variance which increases with quark mass.

  5. Generalized bivariate Fibonacci polynomials

    OpenAIRE

    Catalani, Mario

    2002-01-01

    We define generalized bivariate polynomials, from which upon specification of initial conditions the bivariate Fibonacci and Lucas polynomials are obtained. Using essentially a matrix approach we derive identities and inequalities that in most cases generalize known results.

  6. Factoring Polynomials and Fibonacci.

    Science.gov (United States)

    Schwartzman, Steven

    1986-01-01

    Discusses the factoring of polynomials and Fibonacci numbers, offering several challenges teachers can give students. For example, they can give students a polynomial containing large numbers and challenge them to factor it. (JN)

  7. Branched polynomial covering maps

    DEFF Research Database (Denmark)

    Hansen, Vagn Lundsgaard

    1999-01-01

    A Weierstrass polynomial with multiple roots in certain points leads to a branched covering map. With this as the guiding example, we formally define and study the notion of a branched polynomial covering map. We shall prove that many finite covering maps are polynomial outside a discrete branch...... set. Particular studies are made of branched polynomial covering maps arising from Riemann surfaces and from knots in the 3-sphere....

  8. Branched polynomial covering maps

    DEFF Research Database (Denmark)

    Hansen, Vagn Lundsgaard

    2002-01-01

    A Weierstrass polynomial with multiple roots in certain points leads to a branched covering map. With this as the guiding example, we formally define and study the notion of a branched polynomial covering map. We shall prove that many finite covering maps are polynomial outside a discrete branch...... set. Particular studies are made of branched polynomial covering maps arising from Riemann surfaces and from knots in the 3-sphere. (C) 2001 Elsevier Science B.V. All rights reserved....

  9. Asymptotic expansions of Jacobi functions

    International Nuclear Information System (INIS)

    The author presents an asymptotic expansion of the Jacobi polynomials which is based on the fact, that these polynomials are special hypergeometric functions. He uses an integral representation of these functions and expands the integrand in a power series. He derives explicit error bounds on this expansion. (HSI)

  10. Bernstein polynomials on Simplex

    OpenAIRE

    Bayad, A.; Kim, T.; Rim, S. -H.

    2011-01-01

    We prove two identities for multivariate Bernstein polynomials on simplex, which are considered on a pointwise. In this paper, we study good approximations of Bernstein polynomials for every continuous functions on simplex and the higher dimensional q-analogues of Bernstein polynomials on simplex

  11. Coherent orthogonal polynomials

    International Nuclear Information System (INIS)

    We discuss a fundamental characteristic of orthogonal polynomials, like the existence of a Lie algebra behind them, which can be added to their other relevant aspects. At the basis of the complete framework for orthogonal polynomials we include thus–in addition to differential equations, recurrence relations, Hilbert spaces and square integrable functions–Lie algebra theory. We start here from the square integrable functions on the open connected subset of the real line whose bases are related to orthogonal polynomials. All these one-dimensional continuous spaces allow, besides the standard uncountable basis (|x〉), for an alternative countable basis (|n〉). The matrix elements that relate these two bases are essentially the orthogonal polynomials: Hermite polynomials for the line and Laguerre and Legendre polynomials for the half-line and the line interval, respectively. Differential recurrence relations of orthogonal polynomials allow us to realize that they determine an infinite-dimensional irreducible representation of a non-compact Lie algebra, whose second order Casimir C gives rise to the second order differential equation that defines the corresponding family of orthogonal polynomials. Thus, the Weyl–Heisenberg algebra h(1) with C=0 for Hermite polynomials and su(1,1) with C=−1/4 for Laguerre and Legendre polynomials are obtained. Starting from the orthogonal polynomials the Lie algebra is extended both to the whole space of the L2 functions and to the corresponding Universal Enveloping Algebra and transformation group. Generalized coherent states from each vector in the space L2 and, in particular, generalized coherent polynomials are thus obtained. -- Highlights: •Fundamental characteristic of orthogonal polynomials (OP): existence of a Lie algebra. •Differential recurrence relations of OP determine a unitary representation of a non-compact Lie group. •2nd order Casimir originates a 2nd order differential equation that defines the

  12. Generalized Fibonacci-Lucas Polynomials

    Directory of Open Access Journals (Sweden)

    Mamta Singh

    2013-12-01

    Full Text Available Various sequences of polynomials by the names of Fibonacci and Lucas polynomials occur in the literature over a century. The Fibonacci polynomials and Lucas polynomials are famous for possessing wonderful and amazing properties and identities. In this paper, Generalized Fibonacci-Lucas Polynomials are introduced and defined by the recurrence relation with and . Some basic identities of Generalized Fibonacci-Lucas Polynomials are obtained by method of generating function.   Keywords: Fibonacci polynomials, Lucas polynomials, Generalized Fibonacci polynomials, Generalized Fibonacci-Lucas polynomials

  13. Extended Fibonacci numbers and polynomials with probability applications

    Directory of Open Access Journals (Sweden)

    Demetrios L. Antzoulakos

    2004-10-01

    Full Text Available The extended Fibonacci sequence of numbers and polynomials is introduced and studied. The generating function, recurrence relations, an expansion in terms of multinomial coefficients, and several properties of the extended Fibonacci numbers and polynomials are obtained. Interesting relations between them and probability problems which take into account lengths of success and failure runs are also established.

  14. Weierstrass polynomials for links

    DEFF Research Database (Denmark)

    Hansen, Vagn Lundsgaard

    1997-01-01

    There is a natural way of identifying links in3-space with polynomial covering spaces over thecircle. Thereby any link in 3-space can be definedby a Weierstrass polynomial over the circle. Theequivalence relation for covering spaces over thecircle is, however, completely different from that for...... links in 3-space. This paper initiates a study of the connections between polynomial covering spaces over the circle and links in 3-space....

  15. A Bivariate Analogue to the Composed Product of Polynomials

    Institute of Scientific and Technical Information of China (English)

    Donald Mills; Kent M. Neuerburg

    2003-01-01

    The concept of a composed product for univariate polynomials has been explored extensively by Brawley, Brown, Carlitz, Gao,Mills, et al. Starting with these fundamental ideas andutilizing fractional power series representation(in particular, the Puiseux expansion) of bivariate polynomials, we generalize the univariate results. We define a bivariate composed sum,composed multiplication,and composed product (based on function composition). Further, we investigate the algebraic structure of certain classes of bivariate polynomials under these operations. We also generalize a result of Brawley and Carlitz concerningthe decomposition of polynomials into irreducibles.

  16. Quantum Grothendieck polynomials

    OpenAIRE

    Kirillov, Anatol N.

    1996-01-01

    We study the algebraic aspects of (small) quantum equivariant $K$-theory of flag manifold. Lascoux-Sch\\"utzenberger's type formula for quantum double and quantum double dual Grothendieck polynomials and the quantum Cauchy identity for quantum Grothendieck polynomials are obtained.

  17. Weighted lattice polynomials

    OpenAIRE

    Marichal, Jean-Luc

    2007-01-01

    We define the concept of weighted lattice polynomial functions as lattice polynomial functions constructed from both variables and parameters. We provide equivalent forms of these functions in an arbitrary bounded distributive lattice. We also show that these functions include the class of discrete Sugeno integrals and that they are characterized by a median based decomposition formula.

  18. Feynman Graph Polynomials

    Science.gov (United States)

    Bogner, Christian; Weinzierl, Stefan

    The integrand of any multiloop integral is characterized after Feynman parametrization by two polynomials. In this review we summarize the properties of these polynomials. Topics covered in this paper include among others: spanning trees and spanning forests, the all-minors matrix-tree theorem, recursion relations due to contraction and deletion of edges, Dodgson's identity and matroids.

  19. Nonnegativity of uncertain polynomials

    Directory of Open Access Journals (Sweden)

    Šiljak Dragoslav D.

    1998-01-01

    Full Text Available The purpose of this paper is to derive tests for robust nonnegativity of scalar and matrix polynomials, which are algebraic, recursive, and can be completed in finite number of steps. Polytopic families of polynomials are considered with various characterizations of parameter uncertainty including affine, multilinear, and polynomic structures. The zero exclusion condition for polynomial positivity is also proposed for general parameter dependencies. By reformulating the robust stability problem of complex polynomials as positivity of real polynomials, we obtain new sufficient conditions for robust stability involving multilinear structures, which can be tested using only real arithmetic. The obtained results are applied to robust matrix factorization, strict positive realness, and absolute stability of multivariable systems involving parameter dependent transfer function matrices.

  20. Polynomial chaos functions and stochastic differential equations

    International Nuclear Information System (INIS)

    The Karhunen-Loeve procedure and the associated polynomial chaos expansion have been employed to solve a simple first order stochastic differential equation which is typical of transport problems. Because the equation has an analytical solution, it provides a useful test of the efficacy of polynomial chaos. We find that the convergence is very rapid in some cases but that the increased complexity associated with many random variables can lead to very long computational times. The work is illustrated by exact and approximate solutions for the mean, variance and the probability distribution itself. The usefulness of a white noise approximation is also assessed. Extensive numerical results are given which highlight the weaknesses and strengths of polynomial chaos. The general conclusion is that the method is promising but requires further detailed study by application to a practical problem in transport theory

  1. On universal knot polynomials

    CERN Document Server

    Mironov, A; Morozov, A

    2015-01-01

    We present a universal knot polynomials for 2- and 3-strand torus knots in adjoint representation, by universalization of appropriate Rosso-Jones formula. According to universality, these polynomials coincide with adjoined colored HOMFLY and Kauffman polynomials at SL and SO/Sp lines on Vogel's plane, and give their exceptional group's counterparts on exceptional line. We demonstrate that [m,n]=[n,m] topological invariance, when applicable, take place on the entire Vogel's plane. We also suggest the universal form of invariant of figure eight knot in adjoint representation, and suggest existence of such universalization for any knot in adjoint and its descendant representation. Properties of universal polynomials and applications of these results are discussed.

  2. Computing Modular Polynomials

    OpenAIRE

    Charles, Denis; Lauter, Kristin

    2004-01-01

    We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our algorithm has the distinguishing feature that it does not involve the computation of Fourier coefficients of modular forms. We avoid computing the exponentially large integral coefficients by working directly modulo a prime and computing isogenies between e...

  3. On genus expansion of superpolynomials

    OpenAIRE

    Mironov, Andrei; Morozov, Alexei; Sleptsov, Alexei; Smirnov, Andrey(ITEP, Moscow, 117218, Russia)

    2013-01-01

    Recently it was shown that the (Ooguri-Vafa) generating function of HOMFLY polynomials is the Hurwitz partition function, i.e. that the dependence of the HOMFLY polynomials on representation R is naturally captured by symmetric group characters (cut-and-join eigenvalues). The genus expansion and expansion through Vassiliev invariants explicitly demonstrate this phenomenon. In the present letter we claim that the superpolynomials are not functions of such a type: symmetric group characters do ...

  4. Fuzzy Morphological Polynomial Image Representation

    Directory of Open Access Journals (Sweden)

    Chin-Pan Huang

    2010-01-01

    Full Text Available A novel signal representation using fuzzy mathematical morphology is developed. We take advantage of the optimum fuzzy fitting and the efficient implementation of morphological operators to extract geometric information from signals. The new representation provides results analogous to those given by the polynomial transform. Geometrical decomposition of a signal is achieved by windowing and applying sequentially fuzzy morphological opening with structuring functions. The resulting representation is made to resemble an orthogonal expansion by constraining the results of opening to equate adapted structuring functions. Properties of the geometric decomposition are considered and used to calculate the adaptation parameters. Our procedure provides an efficient and flexible representation which can be efficiently implemented in parallel. The application of the representation is illustrated in data compression and fractal dimension estimation temporal signals and images.

  5. Asymptotic analysis of the Nörlund and Stirling polynomials

    Directory of Open Access Journals (Sweden)

    Mark Daniel Ward

    2012-04-01

    Full Text Available We provide a full asymptotic analysis of the N{\\"o}rlund polynomials and Stirling polynomials. We give a general asymptotic expansion---to any desired degree of accuracy---when the parameter is not an integer. We use singularity analysis, Hankel contours, and transfer theory. This investigation was motivated by a need for such a complete asymptotic description, with parameter 1/2, during this author's recent solution of Wilf's 3rd (previously Unsolved Problem.

  6. Strong and ratio asymptotics for Laguerre polynomials revisited

    OpenAIRE

    Deaño, Alfredo; Huertas, Edmundo J.; Marcellán, Francisco

    2013-01-01

    In this paper we consider the strong asymptotic behavior of Laguerre polynomials in the complex plane. The leading behavior is well known from Perron and Mehler-Heine formulas, but higher order coefficients, which are important in the context of Krall-Laguerre or Laguerre-Sobolev-type orthogonal polynomials, are notoriously difficult to compute. In this paper, we propose the use of an alternative expansion, due to Buchholz, in terms of Bessel functions of the first kind. The coefficients in t...

  7. Additive and polynomial representations

    CERN Document Server

    Krantz, David H; Suppes, Patrick

    1971-01-01

    Additive and Polynomial Representations deals with major representation theorems in which the qualitative structure is reflected as some polynomial function of one or more numerical functions defined on the basic entities. Examples are additive expressions of a single measure (such as the probability of disjoint events being the sum of their probabilities), and additive expressions of two measures (such as the logarithm of momentum being the sum of log mass and log velocity terms). The book describes the three basic procedures of fundamental measurement as the mathematical pivot, as the utiliz

  8. STABILITY OF SWITCHED POLYNOMIAL SYSTEMS

    Institute of Scientific and Technical Information of China (English)

    Zhiqiang LI; Yupeng QIAO; Hongsheng QI; Daizhan CHENG

    2008-01-01

    This paper investigates the stability of (switched) polynomial systems. Using semi-tensor product of matrices, the paper develops two tools for testing the stability of a (switched) polynomial system. One is to convert a product of multi-variable polynomials into a canonical form, and the other is an easily verifiable sufficient condition to justify whether a multi-variable polynomial is positive definite. Using these two tools, the authors construct a polynomial function as a candidate Lyapunov function and via testing its derivative the authors provide some sufficient conditions for the global stability of polynomial systems.

  9. Complexity of Ising Polynomials

    CERN Document Server

    Kotek, Tomer

    2011-01-01

    This paper deals with the partition function of the Ising model from statistical mechanics, which is used to study phase transitions in physical systems. A special case of interest is that of the Ising model with constant energies and external field. One may consider such an Ising system as a simple graph together with vertex and edge weight values. When these weights are considered indeterminates, the partition function for the constant case is a trivariate polynomial Z(G;x,y,z). This polynomial was studied with respect to its approximability by L. A. Goldberg, M. Jerrum and M. Patersonin 2003. Z(G;x,y,z) generalizes a bivariate polynomial Z(G;t,y), which was studied in by D. Andr\\'{e}n and K. Markstr\\"{o}m in 2009. We consider the complexity of Z(G;t,y) and Z(G;x,y,z) in comparison to that of the Tutte polynomial, which is well-known to be closely related to the Potts model in the absence of an external field. We show that Z(G;\\x,\\y,\\z) is #P-hard to evaluate at all points in $mathbb{Q}^3$, except those in ...

  10. Densification via polynomial extensions

    Czech Academy of Sciences Publication Activity Database

    Galatos, N.; Horčík, Rostislav

    Vienna: Vienna University of Technology, 2014 - (Baaz, M.; Ciabattoni, A.; Hetzl, S.). s. 179-182 [LATD 2014. Logic, Algebra and Truth Degrees. 16.07.2014-19.07.2014, Vienna] Institutional support: RVO:67985807 Keywords : densification * commutative ordered monoid * commutative residuated chain * idempotent semiring * polynomial extension Subject RIV: BA - General Mathematics

  11. Nonconventional Polynomial CLT

    OpenAIRE

    Hafouta, Y.; Kifer, Y.

    2015-01-01

    We obtain a functional central limit theorem (CLT) for sums of the form $\\xi_N(t)=\\frac1{\\sqrt N}\\sum_{n=1}^{[Nt]}\\big(F(X(q_1(n)),...,X(q_\\ell(n)))-\\bar F\\big)$ where $q_1,...,q_\\ell$ are polynomials.

  12. Functional composition of polynomials: indecomposability, Diophantine equations and lacunary polynomials

    OpenAIRE

    Kreso, Dijana; Tichy, Robert F.

    2015-01-01

    Starting from Ritt's classical theorems, we give a survey of results in functional decomposition of polynomials and of applications in Diophantine equations. This includes sufficient conditions for the indecomposability of polynomials, the study of decompositions of lacunary polynomials and the finiteness criterion for the equations of type f(x) = g(y).

  13. Computing the Alexander Polynomial Numerically

    DEFF Research Database (Denmark)

    Hansen, Mikael Sonne

    2006-01-01

    Explains how to construct the Alexander Matrix and how this can be used to compute the Alexander polynomial numerically.......Explains how to construct the Alexander Matrix and how this can be used to compute the Alexander polynomial numerically....

  14. Chromatic polynomials for simplicial complexes

    DEFF Research Database (Denmark)

    Møller, Jesper Michael; Nord, Gesche

    2016-01-01

    In this note we consider s s -chromatic polynomials for finite simplicial complexes. When s=1 s=1 , the 1 1 -chromatic polynomial is just the usual graph chromatic polynomial of the 1 1 -skeleton. In general, the s s -chromatic polynomial depends on the s s -skeleton and its value at r r is the n...

  15. On Q-derived polynomials

    NARCIS (Netherlands)

    R.J. Stroeker (Roel)

    2002-01-01

    textabstractA Q-derived polynomial is a univariate polynomial, defined over the rationals, with the property that its zeros, and those of all its derivatives are rational numbers. There is a conjecture that says that Q-derived polynomials of degree 4 with distinct roots for themselves and all their

  16. Complex Polynomial Vector Fields

    DEFF Research Database (Denmark)

    Dias, Kealey

    The two branches of dynamical systems, continuous and discrete, correspond to the study of differential equations (vector fields) and iteration of mappings respectively. In holomorphic dynamics, the systems studied are restricted to those described by holomorphic (complex analytic) functions or...... vector fields. Since the class of complex polynomial vector fields in the plane is natural to consider, it is remarkable that its study has only begun very recently. There are numerous fundamental questions that are still open, both in the general classification of these vector fields, the decomposition...... of parameter spaces into structurally stable domains, and a description of the bifurcations. For this reason, the talk will focus on these questions for complex polynomial vector fields....

  17. Oblivious Polynomial Evaluation

    Institute of Scientific and Technical Information of China (English)

    Hong-Da Li; Dong-Yao Ji; Deng-Guo Feng; Bao Li

    2004-01-01

    The problem of two-party oblivious polynomial evaluation(OPE)is studied,where one party(Alice)has a polynomial P(x)and the other party(Bob)with an input x wants to learn P(x)in such an oblivious way that Bob obtains P(x)without learning any additional information about P except what is implied by P(x)and Alice does not know Bob's input x.The former OPE protocols are based on an intractability assumption except for OT protocols.In fact,evaluating P(x)is equivalent to computing the product of the coefficient vectors(a0,...,an)and(1,...,xn).Using this idea,an efficient scale product protocol of two vectors is proposed first and then two OPE protocols are presented which do not need any other cryptographic assumption except for OT protocol.Compared with the existing OPE protocol,another characteristic of the proposed protocols is the degree of the polynomial is private.Another OPE protocol works in case of existence of untrusted third party.

  18. Polynomial Learning of Distribution Families

    CERN Document Server

    Belkin, Mikhail

    2010-01-01

    The question of polynomial learnability of probability distributions, particularly Gaussian mixture distributions, has recently received significant attention in theoretical computer science and machine learning. However, despite major progress, the general question of polynomial learnability of Gaussian mixture distributions still remained open. The current work resolves the question of polynomial learnability for Gaussian mixtures in high dimension with an arbitrary fixed number of components. The result on learning Gaussian mixtures relies on an analysis of distributions belonging to what we call "polynomial families" in low dimension. These families are characterized by their moments being polynomial in parameters and include almost all common probability distributions as well as their mixtures and products. Using tools from real algebraic geometry, we show that parameters of any distribution belonging to such a family can be learned in polynomial time and using a polynomial number of sample points. The r...

  19. Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers

    OpenAIRE

    R. Kannan; Lenstra, Arjen K.; Lovasz, L.

    1988-01-01

    It is shown that the binary expansions of algebraic numbers do not form secure pseudorandom sequences, given sufficiently many initial bits of an algebraic number, its minimal polynomial can be reconstructed, and therefore the further bits of the algebraic number can be computed. This also enables the authors to devise a simple algorithm to factorise polynomials with rational coefficients. All algorithms work in polynomial time

  20. The Kauffman bracket and the Jones polynomial in quantum gravity

    International Nuclear Information System (INIS)

    In the loop representation the quantum states of gravity are given by knot invariants. From general arguments concerning the loop transform of the exponential of the Chern-Simons form, a certain expansion of the Kauffman bracket knot polynomial can be formally viewed as a solution of the Hamiltonian constraint with a cosmological constant in the loop representation. The Kauffman bracket is closely related to the Jones polynomial. In this paper the operation of the Hamiltonian on the power expansions of the Kauffman bracket and Jones polynomials is analyzed. It is explicitly shown that the Kauffman bracket is a formal solution of the Hamiltonian constraint to third order in the cosmological constant. We make use of the extended loop representation of quantum gravity where the analytic calculation can be thoroughly accomplished. Some peculiarities of the extended loop calculus are considered and the significance of the results to the case of the conventional loop representation is discussed. (orig.)

  1. Schur Coefficients of the Integral Form Macdonald Polynomials

    OpenAIRE

    Yoo, Meesue

    2015-01-01

    In this paper, we consider the combinatorial formula for the Schur coefficients of the integral form of the Macdonald polynomials. As an attempt to prove Haglund's conjecture that $\\Biggl \\in \\mathbb{N}[q]$, we have found explicit combinatorial formulas for the Schur coefficients in one row case, two column case and certain hook shape cases [Yoo12]. A result of Egge-Loehr-Warrington [ELW] gives a combinatorial way of getting Schur expansion of symmetric functions when the expansion of the fun...

  2. Symmetric functions and Hall polynomials

    CERN Document Server

    MacDonald, Ian Grant

    1998-01-01

    This reissued classic text is the acclaimed second edition of Professor Ian Macdonald's groundbreaking monograph on symmetric functions and Hall polynomials. The first edition was published in 1979, before being significantly expanded into the present edition in 1995. This text is widely regarded as the best source of information on Hall polynomials and what have come to be known as Macdonald polynomials, central to a number of key developments in mathematics and mathematical physics in the 21st century Macdonald polynomials gave rise to the subject of double affine Hecke algebras (or Cherednik algebras) important in representation theory. String theorists use Macdonald polynomials to attack the so-called AGT conjectures. Macdonald polynomials have been recently used to construct knot invariants. They are also a central tool for a theory of integrable stochastic models that have found a number of applications in probability, such as random matrices, directed polymers in random media, driven lattice gases, and...

  3. Polynomial Regression on Riemannian Manifolds

    CERN Document Server

    Hinkle, Jacob; Fletcher, P Thomas; Joshi, Sarang

    2012-01-01

    In this paper we develop the theory of parametric polynomial regression in Riemannian manifolds and Lie groups. We show application of Riemannian polynomial regression to shape analysis in Kendall shape space. Results are presented, showing the power of polynomial regression on the classic rat skull growth data of Bookstein as well as the analysis of the shape changes associated with aging of the corpus callosum from the OASIS Alzheimer's study.

  4. Deformed Mittag-Leffler Polynomials

    OpenAIRE

    Miomir S. Stankovic; Marinkovic, Sladjana D.; Rajkovic, Predrag M.

    2010-01-01

    The starting point of this paper are the Mittag-Leffler polynomials introduced by H. Bateman [1]. Based on generalized integer powers of real numbers and deformed exponential function, we introduce deformed Mittag-Leffler polynomials defined by appropriate generating function. We investigate their recurrence relations, differential properties and orthogonality. Since they have all zeros on imaginary axes, we also consider real polynomials with real zeros associated to them.

  5. Witt Rings and Permutation Polynomials

    Institute of Scientific and Technical Information of China (English)

    Qifan Zhang

    2005-01-01

    Let p be a prime number. In this paper, the author sets up a canonical correspondence between polynomial functions over Z/p2Z and 3-tuples of polynomial functions over Z/pZ. Based on this correspondence, he proves and reproves some fundamental results on permutation polynomials mod pl. The main new result is the characterization of strong orthogonal systems over Z/p1Z.

  6. Polynomial Bell Inequalities

    Science.gov (United States)

    Chaves, Rafael

    2016-01-01

    It is a recent realization that many of the concepts and tools of causal discovery in machine learning are highly relevant to problems in quantum information, in particular quantum nonlocality. The crucial ingredient in the connection between both fields is the mathematical theory of causality, allowing for the representation of arbitrary causal structures and providing a rigorous tool to reason about probabilistic causation. Indeed, Bell's theorem concerns a very particular kind of causal structure and Bell inequalities are a special case of linear constraints following from such models. It is thus natural to look for generalizations involving more complex Bell scenarios. The problem, however, relies on the fact that such generalized scenarios are characterized by polynomial Bell inequalities and no current method is available to derive them beyond very simple cases. In this work, we make a significant step in that direction, providing a new, general, and conceptually clear method for the derivation of polynomial Bell inequalities in a wide class of scenarios. We also show how our construction can be used to allow for relaxations of causal constraints and naturally gives rise to a notion of nonsignaling in generalized Bell networks.

  7. A transition from a decelerated to an accelerated phase of the universe expansion from the simplest non-trivial polynomial function of T in the f(R,T) formalism

    CERN Document Server

    Moraes, P H R S; Correa, R A C

    2016-01-01

    In this work we present cosmological solutions from the simplest non-trivial $T$-dependence in $f(R,T)$ theory of gravity, with $R$ and $T$ standing for the Ricci scalar and trace of the energy-momentum tensor, respectively. Although such an approach yields a highly non-linear differential equation for the scale factor, we show that it is possible to obtain analytical solutions for the cosmological parameters. For some values of the free parameters, the model is able to predict a transition from a decelerated to an accelerated expansion of the universe.

  8. On genus expansion of superpolynomials

    CERN Document Server

    Mironov, A; Sleptsov, A; Smirnov, A

    2013-01-01

    Recently it was shown that the (Ooguri-Vafa) generating function of HOMFLY polynomials is the Hurwitz partition function, i.e. that the dependence of the HOMFLY polynomials on representation is naturally captured by symmetric group characters (cut-and-join eigenvalues). The genus expansion and expansion through Vassiliev invariants explicitly demonstrate this phenomenon. In the present letter we claim that the superpolynomials are not functions of such a type: symmetric group characters do not provide an adequate linear basis for their expansions. Deformation to superpolynomials is, however, straightforward in the multiplicative basis:the Casimir operators are beta-deformed to Hamiltonians of the Calogero-Moser-Sutherland system. Applying this trick to the genus and Vassiliev expansions, we observe that the deformation is rather straightforward only for the thin knots. Beyond this family additional algebraically independent terms appear in the Vassiliev and genus expansions. This can suggest that the superpol...

  9. Digital terrain modeling with the Chebyshev polynomials

    CERN Document Server

    Florinsky, I V

    2015-01-01

    Mathematical problems of digital terrain analysis include interpolation of digital elevation models (DEMs), DEM generalization and denoising, and computation of morphometric variables by calculation of partial derivatives of elevation. Traditionally, these procedures are based on numerical treatments of two-variable discrete functions of elevation. We developed a spectral analytical method and algorithm based on high-order orthogonal expansions using the Chebyshev polynomials of the first kind with the subsequent Fejer summation. The method and algorithm are intended for DEM analytical treatment, such as, DEM global approximation, denoising, and generalization as well as computation of morphometric variables by analytical calculation of partial derivatives. To test the method and algorithm, we used a DEM of the Northern Andes including 230,880 points (the elevation matrix 480 $\\times$ 481). DEMs were reconstructed with 480, 240, 120, 60, and 30 expansion coefficients. The first and second partial derivatives ...

  10. Complex Polynomial Vector Fields

    DEFF Research Database (Denmark)

    Dias, Kealey

    The two branches of dynamical systems, continuous and discrete, correspond to the study of differential equations (vector fields) and iteration of mappings respectively. In holomorphic dynamics, the systems studied are restricted to those described by holomorphic (complex analytic) functions or...... meromorphic (allowing poles as singularities) functions. There already exists a well-developed theory for iterative holomorphic dynamical systems, and successful relations found between iteration theory and flows of vector fields have been one of the main motivations for the recent interest in holomorphic...... vector fields. Since the class of complex polynomial vector fields in the plane is natural to consider, it is remarkable that its study has only begun very recently. There are numerous fundamental questions that are still open, both in the general classification of these vector fields, the decomposition...

  11. Factorization of colored knot polynomials at roots of unity

    Directory of Open Access Journals (Sweden)

    Ya. Kononov

    2015-07-01

    Full Text Available HOMFLY polynomials are the Wilson-loop averages in Chern–Simons theory and depend on four variables: the closed line (knot in 3d space–time, representation R of the gauge group SU(N and exponentiated coupling constant q. From analysis of a big variety of different knots we conclude that at q, which is a 2m-th root of unity, q2m=1, HOMFLY polynomials in symmetric representations [r] satisfy recursion identity: Hr+m=Hr⋅Hm for any A=qN, which is a generalization of the property Hr=H1r for special polynomials at m=1. We conjecture a further generalization to arbitrary representation R, which, however, is checked only for torus knots. Next, Kashaev polynomial, which arises from HR at q2=e2πi/|R|, turns equal to the special polynomial with A substituted by A|R|, provided R is a single-hook representations (including arbitrary symmetric – what provides a q−A dual to the similar property of Alexander polynomial. All this implies non-trivial relations for the coefficients of the differential expansions, which are believed to provide reasonable coordinates in the space of knots – existence of such universal relations means that these variables are still not unconstrained.

  12. Factorization of colored knot polynomials at roots of unity

    Science.gov (United States)

    Kononov, Ya.; Morozov, A.

    2015-07-01

    HOMFLY polynomials are the Wilson-loop averages in Chern-Simons theory and depend on four variables: the closed line (knot) in 3d space-time, representation R of the gauge group SU (N) and exponentiated coupling constant q. From analysis of a big variety of different knots we conclude that at q, which is a 2m-th root of unity, q2m = 1, HOMFLY polynomials in symmetric representations [ r ] satisfy recursion identity: Hr+m =Hr ṡHm for any A =qN, which is a generalization of the property Hr = H1r for special polynomials at m = 1. We conjecture a further generalization to arbitrary representation R, which, however, is checked only for torus knots. Next, Kashaev polynomial, which arises from HR at q2 = e 2 πi / | R |, turns equal to the special polynomial with A substituted by A| R |, provided R is a single-hook representations (including arbitrary symmetric) - what provides a q - A dual to the similar property of Alexander polynomial. All this implies non-trivial relations for the coefficients of the differential expansions, which are believed to provide reasonable coordinates in the space of knots - existence of such universal relations means that these variables are still not unconstrained.

  13. Polynomial weights and code constructions

    DEFF Research Database (Denmark)

    Massey, J; Costello, D; Justesen, Jørn

    1973-01-01

    For any nonzero elementcof a general finite fieldGF(q), it is shown that the polynomials(x - c)^i, i = 0,1,2,cdots, have the "weight-retaining" property that any linear combination of these polynomials with coefficients inGF(q)has Hamming weight at least as great as that of the minimum degree...

  14. Parallel Construction of Irreducible Polynomials

    DEFF Research Database (Denmark)

    Frandsen, Gudmund Skovbjerg

    Let arithmetic pseudo-NC^k denote the problems that can be solved by log space uniform arithmetic circuits over the finite prime field GF(p) of depth O(log^k (n + p)) and size polynomial in (n + p). We show that the problem of constructing an irreducible polynomial of specified degree over GF(p) ...

  15. Cyclotomy and permutation polynomials of large indices

    OpenAIRE

    WANG Qiang

    2012-01-01

    We use cyclotomy to design new classes of permutation polynomials over finite fields. This allows us to generate many classes of permutation polynomials in an algorithmic way. Many of them are permutation polynomials of large indices.

  16. On the Action of Steenrod Operations on Polynomial Algebras

    OpenAIRE

    KARACA, İsmet

    1998-01-01

    Let \\( \\bba \\) be the mod-\\( p \\) Steenrod Algebra. Let \\( p \\) be an odd prime number and \\( Zp = Z/pZ \\). Let \\( Ps = Zp [x1,x2,\\ldots,xs]. \\) A polynomial \\( N \\in Ps \\) is said to be hit if it is in the image of the action \\( A \\otimes Ps \\ra Ps. \\) In [10] for \\( p=2, \\) Wood showed that if \\( \\a(d+s) > s \\) then every polynomial of degree \\( d \\) in \\( Ps \\) is hit where \\( \\a(d+s) \\) denotes the number of ones in the binary expansion of \\( d+s \\). Latter in [6] Monks extended a resu...

  17. Difference equations of q-Appell polynomials

    OpenAIRE

    Mahmudov, Nazim I.

    2014-01-01

    In this paper, we study some properties of the q-Appell polynomials, including the recurrence relations and the q-difference equations which extend some known calssical (q=1) results. We also provide the recurrence relations and the q-difference equations for q-Bernoulli polynomials, q-Euler polynomials, q-Genocchi polynomials and for newly defined q-Hermite polynomials, as special cases of q-Appell polynomials

  18. Complex Roots of Quaternion Polynomials

    OpenAIRE

    Dospra, Petroula; Poulakis, Dimitrios

    2015-01-01

    The polynomials with quaternion coefficients have two kind of roots: isolated and spherical. A spherical root generates a class of roots which contains only one complex number $z$ and its conjugate $\\bar{z}$, and this class can be determined by $z$. In this paper, we deal with the complex roots of quaternion polynomials. More precisely, using B\\'{e}zout matrices, we give necessary and sufficient conditions, for a quaternion polynomial to have a complex root, a spherical root, and a complex is...

  19. Orthogonal polynomials and deformed oscillators

    Science.gov (United States)

    Borzov, V. V.; Damaskinsky, E. V.

    2015-10-01

    In the example of the Fibonacci oscillator, we discuss the construction of oscillator-like systems associated with orthogonal polynomials. We also consider the question of the dimensions of the corresponding Lie algebras.

  20. Polynomials Associated with Dihedral Groups

    Directory of Open Access Journals (Sweden)

    Charles F. Dunkl

    2007-03-01

    Full Text Available There is a commutative algebra of differential-difference operators, with two parameters, associated to any dihedral group with an even number of reflections. The intertwining operator relates this algebra to the algebra of partial derivatives. This paper presents an explicit form of the action of the intertwining operator on polynomials by use of harmonic and Jacobi polynomials. The last section of the paper deals with parameter values for which the formulae have singularities.

  1. An introduction to orthogonal polynomials

    CERN Document Server

    Chihara, Theodore S

    2011-01-01

    Assuming no further prerequisites than a first undergraduate course in real analysis, this concise introduction covers general elementary theory related to orthogonal polynomials. It includes necessary background material of the type not usually found in the standard mathematics curriculum. Suitable for advanced undergraduate and graduate courses, it is also appropriate for independent study. Topics include the representation theorem and distribution functions, continued fractions and chain sequences, the recurrence formula and properties of orthogonal polynomials, special functions, and some

  2. Evaluations of topological Tutte polynomials

    CERN Document Server

    Ellis-Monaghan, Joanna A

    2011-01-01

    We find a number of new combinatorial identities for, and interpretations of evaluations of, the topological Tutte polynomials of Las Vergnas, $L(G)$, and of and Bollob\\'as and Riordan, $R(G)$, as well as for the classical Tutte polynomial $T(G)$. For example, we express $R(G)$ and $T(G)$ as a sum of chromatic polynomials, show that $R(G)$ counts non-crossing graph states and $k$-valuations, and reformulate the Four Colour Theorem in terms of $R(G)$. Our main approach is to apply identities for the topological transition polynomial, one involving twisted duals, and one involving doubling the edges of a graph. These identities for the transition polynomial allow us to show that the Penrose polynomial $P(G)$ can be recovered from $R(G)$, a fact that we use to obtain identities and interpretations for $R(G)$. We also consider enumeration of circuits in medial graphs and use this to relate $R(G)$ and $L(G)$ for graphs embedded in low genus surfaces.

  3. Colored graphs, Gaussian integrals and stable graph polynomials

    CERN Document Server

    Artamkin, I V

    2010-01-01

    Asymptotic expansions of Gaussian integrals may often be interpreted as generating functions for certain combinatorial objects (graphs with additional data). In this article we discuss a general approach to all such cases using colored graphs. We prove that the generating power series for such graphs satisfy the same system of partial differential equations as the Gaussian integral and the formal power series solution of this system is unique. The solution is obtained as the genus expansion of the generating power series. The initial term of this expansion is the corresponding generating function for trees. The consequence equations for this term turns to be equivalent to the inversion problem for the gradient mapping defined by the initial condition. The equations for the higher terms of the genus expansion are linear. The solutions of these equations can be expressed explicitly by substitution of the initial conditions and the initial term (the tree expansion) into some universal polynomials (for g>1) which...

  4. SAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos

    Science.gov (United States)

    Ahlfeld, R.; Belkouchi, B.; Montomoli, F.

    2016-09-01

    A new arbitrary Polynomial Chaos (aPC) method is presented for moderately high-dimensional problems characterised by limited input data availability. The proposed methodology improves the algorithm of aPC and extends the method, that was previously only introduced as tensor product expansion, to moderately high-dimensional stochastic problems. The fundamental idea of aPC is to use the statistical moments of the input random variables to develop the polynomial chaos expansion. This approach provides the possibility to propagate continuous or discrete probability density functions and also histograms (data sets) as long as their moments exist, are finite and the determinant of the moment matrix is strictly positive. For cases with limited data availability, this approach avoids bias and fitting errors caused by wrong assumptions. In this work, an alternative way to calculate the aPC is suggested, which provides the optimal polynomials, Gaussian quadrature collocation points and weights from the moments using only a handful of matrix operations on the Hankel matrix of moments. It can therefore be implemented without requiring prior knowledge about statistical data analysis or a detailed understanding of the mathematics of polynomial chaos expansions. The extension to more input variables suggested in this work, is an anisotropic and adaptive version of Smolyak's algorithm that is solely based on the moments of the input probability distributions. It is referred to as SAMBA (PC), which is short for Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos. It is illustrated that for moderately high-dimensional problems (up to 20 different input variables or histograms) SAMBA can significantly simplify the calculation of sparse Gaussian quadrature rules. SAMBA's efficiency for multivariate functions with regard to data availability is further demonstrated by analysing higher order convergence and accuracy for a set of nonlinear test functions with 2, 5 and 10

  5. Uniqueness and Zeros of -Shift Difference Polynomials

    Indian Academy of Sciences (India)

    Kai Liu; Xin-Ling Liu; Ting-Bin Cao

    2011-08-01

    In this paper, we consider the zero distributions of -shift difference polynomials of meromorphic functions with zero order, and obtain two theorems that extend the classical Hayman results on the zeros of differential polynomials to -shift difference polynomials. We also investigate the uniqueness problem of -shift difference polynomials that share a common value.

  6. On the Irreducibility of Some Composite Polynomials

    Directory of Open Access Journals (Sweden)

    M. Alizadeh

    2012-06-01

    Full Text Available . In this paper we study the irreducibility of some composite polynomials, constructed by a polynomial composition method over finite fields. Finally, a recurrent method for constructing families of irreducible polynomials of higher degree from given irreducible polynomials over finite fields is given

  7. Bannai-Ito polynomials and dressing chains

    OpenAIRE

    Derevyagin, Maxim; Tsujimoto, Satoshi; Vinet, Luc; Zhedanov, Alexei

    2012-01-01

    Schur-Delsarte-Genin (SDG) maps and Bannai-Ito polynomials are studied. SDG maps are related to dressing chains determined by quadratic algebras. The Bannai-Ito polynomials and their kernel polynomials -- the complementary Bannai-Ito polynomials -- are shown to arise in the framework of the SDG maps.

  8. Differentiation by integration with Jacobi polynomials

    CERN Document Server

    Liu, Da-Yan; Perruquetti, Wilfrid

    2010-01-01

    In this paper, the numerical differentiation by integration method based on Jacobi polynomials originally introduced by Mboup, Fliess and Join is revisited in the central case where the used integration window is centered. Such method based on Jacobi polynomials was introduced through an algebraic approach and extends the numerical differentiation by integration method introduced by Lanczos. The here proposed method is used to estimate the $n^{th}$ ($n \\in \\mathbb{N}$) order derivative from noisy data of a smooth function belonging to at least $C^{n+1+q}$ $(q \\in \\mathbb{N})$. In the recent paper of Mboup, Fliess and Join, where the causal and anti-causal case were investigated, the mismodelling due to the truncation of the Taylor expansion was investigated and improved allowing a small time-delay in the derivative estimation. Here, for the central case, we show that the bias error is $O(h^{q+2})$ where $h$ is the integration window length for $f\\in C^{n+q+2}$ in the noise free case and the corresponding conv...

  9. Sparse polynomial surrogates for aerodynamic computations with random inputs

    CERN Document Server

    Savin, Eric; Peter, Jacques

    2015-01-01

    This paper deals with some of the methodologies used to construct polynomial surrogate models based on generalized polynomial chaos (gPC) expansions for applications to uncertainty quantification (UQ) in aerodynamic computations. A core ingredient in gPC expansions is the choice of a dedicated sampling strategy, so as to define the most significant scenarios to be considered for the construction of such metamodels. A desirable feature of the proposed rules shall be their ability to handle several random inputs simultaneously. Methods to identify the relative "importance" of those variables or uncertain data shall be ideally considered as well. The present work is more particularly dedicated to the development of sampling strategies based on sparsity principles. Sparse multi-dimensional cubature rules based on general one-dimensional Gauss-Jacobi-type quadratures are first addressed. These sets are non nested, but they are well adapted to the probability density functions with compact support for the random in...

  10. From Jack to double Jack polynomials via the supersymmetric bridge

    CERN Document Server

    Lapointe, L

    2015-01-01

    The Calogero-Sutherland (CS) model occurs in a large number of physical contexts, either directly or via its eigenfunctions, the Jack polynomials. The supersymmetric counterpart of the CS model, although much less ubiquitous, has an equally rich structure. In particular, its eigenfunctions, the Jack superpolynomials, appear to share the very same remarkable properties as their non-supersymmetric versions. These super-functions are parametrized by superpartitions with fixed bosonic and fermionic degrees. Now, a truly amazing feature pops out when the fermionic degree is sufficiently large: the Jack superpolynomials stabilize and factorize. Their stability is with respect to their expansion in terms of an elementary basis where, in the stable sector, the expansion coefficients become independent of the fermionic degree. Their factorization is seen when the fermionic variables are stripped off in a suitable way which results in a product of two ordinary Jack polynomials (somewhat modified by plethystic transform...

  11. Ehrhart polynomials of matroid polytopes and polymatroids

    OpenAIRE

    De Loera, Jesús A.; Haws, David C.; Köppe, Matthias

    2007-01-01

    We investigate properties of Ehrhart polynomials for matroid polytopes, independence matroid polytopes, and polymatroids. In the first half of the paper we prove that for fixed rank their Ehrhart polynomials are computable in polynomial time. The proof relies on the geometry of these polytopes as well as a new refined analysis of the evaluation of Todd polynomials. In the second half we discuss two conjectures about the h^*-vector and the coefficients of Ehrhart polynomials of matroid polytop...

  12. A $q$-multinomial expansion of LLT coefficients and plethysm multiplicities

    CERN Document Server

    Iijima, Kazuto

    2011-01-01

    Lascoux, Leclerc and Thibon\\cite{LLT} introduced a family of symmetric polynomials, called LLT polynomials. We prove a $q$-multinomial expansion of the coefficients of LLT polynomials in the case where $ \\boldsymbol{\\mu} = \\underbrace{(\\mu,...,\\mu)}_{n}$ and define a $q$-analog of a sum of the plethysm multiplicities.

  13. On genus expansion of superpolynomials

    Energy Technology Data Exchange (ETDEWEB)

    Mironov, Andrei, E-mail: mironov@itep.ru [Lebedev Physics Institute, Moscow 119991 (Russian Federation); ITEP, Moscow 117218 (Russian Federation); National Research Nuclear University MEPhI, Moscow 115409 (Russian Federation); Morozov, Alexei, E-mail: morozov@itep.ru [ITEP, Moscow 117218 (Russian Federation); National Research Nuclear University MEPhI, Moscow 115409 (Russian Federation); Sleptsov, Alexei, E-mail: sleptsov@itep.ru [ITEP, Moscow 117218 (Russian Federation); Laboratory of Quantum Topology, Chelyabinsk State University, Chelyabinsk 454001 (Russian Federation); KdVI, University of Amsterdam (Netherlands); Smirnov, Andrey, E-mail: asmirnov@math.columbia.edu [ITEP, Moscow 117218 (Russian Federation); Columbia University, Department of Mathematics, New York (United States)

    2014-12-15

    Recently it was shown that the (Ooguri–Vafa) generating function of HOMFLY polynomials is the Hurwitz partition function, i.e. that the dependence of the HOMFLY polynomials on representation R is naturally captured by symmetric group characters (cut-and-join eigenvalues). The genus expansion and expansion through Vassiliev invariants explicitly demonstrate this phenomenon. In the present paper we claim that the superpolynomials are not functions of such a type: symmetric group characters do not provide an adequate linear basis for their expansions. Deformation to superpolynomials is, however, straightforward in the multiplicative basis: the Casimir operators are β-deformed to Hamiltonians of the Calogero–Moser–Sutherland system. Applying this trick to the genus and Vassiliev expansions, we observe that the deformation is fully straightforward only for the thin knots. Beyond the family of thin knots additional algebraically independent terms appear in the Vassiliev and genus expansions. This can suggest that the superpolynomials do in fact contain more information about knots than the colored HOMFLY and Kauffman polynomials. However, even for the thin knots the beta-deformation is non-innocent: already in the simplest examples it seems inconsistent with the positivity of colored superpolynomials in non-(anti)symmetric representations, which also happens in I. Cherednik's (DAHA-based) approach to the torus knots.

  14. On genus expansion of superpolynomials

    International Nuclear Information System (INIS)

    Recently it was shown that the (Ooguri–Vafa) generating function of HOMFLY polynomials is the Hurwitz partition function, i.e. that the dependence of the HOMFLY polynomials on representation R is naturally captured by symmetric group characters (cut-and-join eigenvalues). The genus expansion and expansion through Vassiliev invariants explicitly demonstrate this phenomenon. In the present paper we claim that the superpolynomials are not functions of such a type: symmetric group characters do not provide an adequate linear basis for their expansions. Deformation to superpolynomials is, however, straightforward in the multiplicative basis: the Casimir operators are β-deformed to Hamiltonians of the Calogero–Moser–Sutherland system. Applying this trick to the genus and Vassiliev expansions, we observe that the deformation is fully straightforward only for the thin knots. Beyond the family of thin knots additional algebraically independent terms appear in the Vassiliev and genus expansions. This can suggest that the superpolynomials do in fact contain more information about knots than the colored HOMFLY and Kauffman polynomials. However, even for the thin knots the beta-deformation is non-innocent: already in the simplest examples it seems inconsistent with the positivity of colored superpolynomials in non-(anti)symmetric representations, which also happens in I. Cherednik's (DAHA-based) approach to the torus knots

  15. Differential cross section analysis in kaon photoproduction using associated legendre polynomials

    CERN Document Server

    Hutauruk, P T P; Rosner, G

    2009-01-01

    Angular distributions of differential cross sections from the latest CLAS data sets \\cite{bradford}, for the reaction ${\\gamma}+p {\\to} K^{+} + {\\Lambda}$ have been analyzed using associated Legendre polynomials. This analysis is based upon theoretical calculations in Ref. \\cite{fasano} where all sixteen observables in kaon photoproduction can be classified into four Legendre classes. Each observable can be described by an expansion of associated Legendre polynomial functions. One of the questions to be addressed is how many associated Legendre polynomials are required to describe the data. In this preliminary analysis, we used data models with different numbers of associated Legendre polynomials. We then compared these models by calculating posterior probabilities of the models. We found that the CLAS data set needs no more than four associated Legendre polynomials to describe the differential cross section data. In addition, we also show the extracted coefficients of the best model.

  16. q-Bernstein polynomials, q-Stirling numbers and q-Bernoulli polynomials

    OpenAIRE

    Kim, T.

    2010-01-01

    In this paper, we give new identities involving Phillips q-Bernstein polynomials and we derive some interesting properties of q-Berstein polynomials associated with q-Stirling numbers and q-Bernoulli polynomials.

  17. Modular forms and period polynomials

    CERN Document Server

    Pasol, Vicentiu

    2012-01-01

    We study the space of period polynomials associated with modular forms for finite index subgroups of the modular group. For the full modular group, this space is endowed with a pairing, corresponding to the Petersson inner product on modular forms via a formula of Haberland, and with an action of Hecke operators, defined algebraically by Zagier. We extend Haberland's formula to arbitrary modular forms for finite index subgroups of the modular group, and we show that it conceals two stronger formulas. We extend the action of Hecke operators to \\Gamma_0(N) and \\Gamma_1(N), and we prove algebraically that the pairing on period polynomials appearing in Haberland's formula is Hecke equivariant. Two indefinite theta series identities follow from this proof. We give two ways of determining the extra relations satisfied by the even and odd parts of period polynomials associated with cusp forms, which are independent of the period relations.

  18. Plain Polynomial Arithmetic on GPU

    International Nuclear Information System (INIS)

    As for serial code on CPUs, parallel code on GPUs for dense polynomial arithmetic relies on a combination of asymptotically fast and plain algorithms. Those are employed for data of large and small size, respectively. Parallelizing both types of algorithms is required in order to achieve peak performances. In this paper, we show that the plain dense polynomial multiplication can be efficiently parallelized on GPUs. Remarkably, it outperforms (highly optimized) FFT-based multiplication up to degree 212 while on CPU the same threshold is usually at 26. We also report on a GPU implementation of the Euclidean Algorithm which is both work-efficient and runs in linear time for input polynomials up to degree 218 thus showing the performance of the GCD algorithm based on systolic arrays.

  19. General linearization formulae for products of continuous hypergeometric-type polynomials

    OpenAIRE

    Sánchez-Ruiz, Jorge; López Artés, Pedro; Martínez-Finkelshtein, Andrei; Sánchez Dehesa, Jesús

    1999-01-01

    The linearization of products of wavefunctions of exactly solvable potentials often reduces to the generalized linearization problem for hypergeometric polynomials (HPs) of a continuous variable, which consists of the expansion of the product of two arbitrary HPs in series of an orthogonal HP set. Here, this problem is algebraically solved directly in terms of the coefficients of the second-order differential equations satisfied by the involved polynomials. General expressions for the expansi...

  20. Coordinate Free Tensorial Representation of the Orientation Distribution Function With Harmonic Polynomials

    OpenAIRE

    Sam, David D.; Onat, E. Turan; Etingof, Pavel I.; Adams, Brent L.

    1993-01-01

    The crystallite orientation distribution function (CODF) is reviewed in terms of classical spherical function representation and more recent coordinate free tensorial representation (CFTR). A CFTR is a Fourier expansion wherein the coefficients are tensors in the three-dimensional space. The equivalence between homogeneous harmonic polynomials of degree k and symmetric and traceless tensors of rank k allows a realization of these tensors by the method of harmonic polynomials. Such a method pr...

  1. Orthogonal Polynomials and their Applications

    CERN Document Server

    Dehesa, Jesús; Marcellan, Francisco; Francia, José; Vinuesa, Jaime

    1988-01-01

    The Segovia meeting set out to stimulate an intensive exchange of ideas between experts in the area of orthogonal polynomials and its applications, to present recent research results and to reinforce the scientific and human relations among the increasingly international community working in orthogonal polynomials. This volume contains original research papers as well as survey papers about fundamental questions in the field (Nevai, Rakhmanov & López) and its relationship with other fields such as group theory (Koornwinder), Padé approximation (Brezinski), differential equations (Krall, Littlejohn) and numerical methods (Rivlin).

  2. Symbolic computation of Appell polynomials using Maple

    Directory of Open Access Journals (Sweden)

    H. Alkahby

    2001-07-01

    Full Text Available This work focuses on the symbolic computation of Appell polynomials using the computer algebra system Maple. After describing the traditional approach of constructing Appell polynomials, the paper examines the operator method of constructing the same Appell polynomials. The operator approach enables us to express the Appell polynomial as Bessel function whose coefficients are Euler and Bernuolli numbers. We have also constructed algorithms using Maple to compute Appell polynomials based on the methods we have described. The achievement is the construction of Appell polynomials for any function of bounded variation.

  3. Two polynomial division inequalities in

    Directory of Open Access Journals (Sweden)

    Goetgheluck P

    1998-01-01

    Full Text Available This paper is a first attempt to give numerical values for constants and , in classical estimates and where is an algebraic polynomial of degree at most and denotes the -metric on . The basic tools are Markov and Bernstein inequalities.

  4. Entanglement conditions and polynomial identities

    International Nuclear Information System (INIS)

    We develop a rather general approach to entanglement characterization based on convexity properties and polynomial identities. This approach is applied to obtain simple and efficient entanglement conditions that work equally well in both discrete as well as continuous-variable environments. Examples of violations of our conditions are presented.

  5. On Modular Counting with Polynomials

    DEFF Research Database (Denmark)

    Hansen, Kristoffer Arnsfelt

    For any integers m and l, where m has r sufficiently large (depending on l) factors, that are powers of r distinct primes, we give a construction of a (symmetric) polynomial over Z_m of degree O(\\sqrt n) that is a generalized representation (commonly also called weak representation) of the MODl f...

  6. Sheffer and Non-Sheffer Polynomial Families

    Directory of Open Access Journals (Sweden)

    G. Dattoli

    2012-01-01

    Full Text Available By using the integral transform method, we introduce some non-Sheffer polynomial sets. Furthermore, we show how to compute the connection coefficients for particular expressions of Appell polynomials.

  7. Quantum F-polynomials in Classical Types

    CERN Document Server

    Tran, Thao

    2009-01-01

    In their "Cluster Algebras IV" paper, Fomin and Zelevinsky defined F-polynomials and g-vectors, and they showed that the cluster variables in any cluster algebra can be expressed in a formula involving the appropriate F-polynomial and g-vector. In "F-polynomials in Quantum Cluster Algebras," the predecessor to this paper, we defined and proved the existence of quantum F-polynomials, which are analogs of F-polynomials in quantum cluster algebras in the sense that cluster variables in any quantum cluster algebra can be expressed in a similar formula in terms of quantum F-polynomials and g-vectors. In this paper, we give formulas for both F-polynomials and quantum F-polynomials for cluster algebras of classical type when the initial exchange matrix is acyclic.

  8. Solutions of differential equations in a Bernstein polynomial basis

    Science.gov (United States)

    Idrees Bhatti, M.; Bracken, P.

    2007-08-01

    An algorithm for approximating solutions to differential equations in a modified new Bernstein polynomial basis is introduced. The algorithm expands the desired solution in terms of a set of continuous polynomials over a closed interval and then makes use of the Galerkin method to determine the expansion coefficients to construct a solution. Matrix formulation is used throughout the entire procedure. However, accuracy and efficiency are dependent on the size of the set of Bernstein polynomials and the procedure is much simpler compared to the piecewise B spline method for solving differential equations. A recursive definition of the Bernstein polynomials and their derivatives are also presented. The current procedure is implemented to solve three linear equations and one nonlinear equation, and excellent agreement is found between the exact and approximate solutions. In addition, the algorithm improves the accuracy and efficiency of the traditional methods for solving differential equations that rely on much more complicated numerical techniques. This procedure has great potential to be implemented in more complex systems where there are no exact solutions available except approximations.

  9. Application of Chebyshev Polynomial to simulated modeling

    Institute of Scientific and Technical Information of China (English)

    CHI Hai-hong; LI Dian-pu

    2006-01-01

    Chebyshev polynomial is widely used in many fields, and used usually as function approximation in numerical calculation. In this paper, Chebyshev polynomial expression of the propeller properties across four quadrants is given at first, then the expression of Chebyshev polynomial is transformed to ordinary polynomial for the need of simulation of propeller dynamics. On the basis of it,the dynamical models of propeller across four quadrants are given. The simulation results show the efficiency of mathematical model.

  10. An Improved Volumetric Estimation Using Polynomial Regression

    OpenAIRE

    Noraini Abdullah; Amran Ahmed; Zainodin Hj. Jubok

    2011-01-01

    The polynomial regression (PR) technique is used to estimate the parameters of the dependent variable having a polynomial relationship with the independent variable. Normality and nonlinearity exhibit polynomial characterization of power terms greater than 2. Polynomial Regression models (PRM) with the auxiliary variables are considered up to their third order interactions. Preliminary, multicollinearity between the independent variables is minimized and statistical tests involving the Global...

  11. Computing the zeros of quaternion polynomials

    OpenAIRE

    Serôdio, R.; Pereira, E.; Vitória, J.

    2001-01-01

    A method is developed to compute the zeros of a quaternion polynomial with all terms of the form qkXk. This method is based essentially in Niven's algorithm [1], which consists of dividing the polynomial by a characteristic polynomial associated to a zero. The information about the trace and the norm of the zero is obtained by an original idea which requires the companion matrix associated to the polynomial. The companion matrix is represented by a matrix with complex entries. Three numerical...

  12. A Class of Binomial Permutation Polynomials

    OpenAIRE

    Tu, Ziran; Zeng, Xiangyong; Hu, Lei; Li, Chunlei

    2013-01-01

    In this note, a criterion for a class of binomials to be permutation polynomials is proposed. As a consequence, many classes of binomial permutation polynomials and monomial complete permutation polynomials are obtained. The exponents in these monomials are of Niho type.

  13. Positive trigonometric polynomials and signal processing applications

    CERN Document Server

    Dumitrescu, Bogdan

    2007-01-01

    Presents the results on positive trigonometric polynomials within a unitary framework; the theoretical results obtained partly from the general theory of real polynomials, partly from self-sustained developments. This book provides information on the theory of sum-of-squares trigonometric polynomials in two parts: theory and applications.

  14. s-Numbers sequences for homogeneous polynomials

    OpenAIRE

    Caliskan, Erhan; Rueda, Pilar

    2015-01-01

    We extend the well known theory of $s$-numbers of linear operators to homogeneous polynomials defined between Banach spaces. Approximation, Kolmogorov and Gelfand numbers of polynomials are introduced and some well-known results of the linear and multilinear settings are obtained for homogeneous polynomials.

  15. Graph colorings, flows and arithmetic Tutte polynomial

    OpenAIRE

    D'Adderio, Michele; Moci, Luca

    2011-01-01

    We introduce the notions of arithmetic colorings and arithmetic flows over a graph with labelled edges, which generalize the notions of colorings and flows over a graph. We show that the corresponding arithmetic chromatic polynomial and arithmetic flow polynomial are given by suitable specializations of the associated arithmetic Tutte polynomial, generalizing classical results of Tutte.

  16. Lattice Platonic Solids and their Ehrhart polynomial

    Directory of Open Access Journals (Sweden)

    E. J. Ionascu

    2013-01-01

    Full Text Available First, we calculate the Ehrhart polynomial associated to an arbitrary cube with integer coordinates for its vertices. Then, we use this result to derive relationships between the Ehrhart polynomials for regular lattice tetrahedra and those for regular lattice octahedra. These relations allow one to reduce the calculation of these polynomials to only one coefficient.

  17. Lattice Platonic Solids and their Ehrhart polynomial

    CERN Document Server

    Ionascu, Eugen J

    2011-01-01

    First, we calculate the Ehrhart polynomial associated to an arbitrary cube with integer coordinates for its vertices. Then, we use this result to derive relationships between the Ehrhart polynomials for regular lattice tetrahedrons and those for regular lattice octahedrons. These relations allow one to reduce the calculation of these polynomials to only one coefficient.

  18. Discriminants of Polynomials Related to Chebyshev Polynomials: The 'Mutt and Jeff' Syndrome

    OpenAIRE

    Tran, Khang

    2016-01-01

    The discriminants of certain polynomials related to Chebyshev polynomials factor into the product of two polynomials, one of which has coefficients that are much larger than the other's. Remarkably, these polynomials of dissimilar size have "almost" the same roots, and their discriminants involve exactly the same prime factors.

  19. Complete Bell polynomials and new generalized identities for polynomials of higher order

    CERN Document Server

    Rubinstein, Boris Y

    2009-01-01

    The relations between the Bernoulli and Eulerian polynomials of higher order and the complete Bell polynomials are found that lead to new identities for the Bernoulli and Eulerian polynomials and numbers of higher order. General form of these identities is considered and generating function for polynomials satisfying this general identity is found.

  20. Normal BGG solutions and polynomials

    CERN Document Server

    Cap, A; Hammerl, M

    2012-01-01

    First BGG operators are a large class of overdetermined linear differential operators intrinsically associated to a parabolic geometry on a manifold. The corresponding equations include those controlling infinitesimal automorphisms, higher symmetries, and many other widely studied PDE of geometric origin. The machinery of BGG sequences also singles out a subclass of solutions called normal solutions. These correspond to parallel tractor fields and hence to (certain) holonomy reductions of the canonical normal Cartan connection. Using the normal Cartan connection, we define a special class of local frames for any natural vector bundle associated to a parabolic geometry. We then prove that the coefficient functions of any normal solution of a first BGG operator with respect to such a frame are polynomials in the normal coordinates of the parabolic geometry. A bound on the degree of these polynomials in terms of representation theory data is derived. For geometries locally isomorphic to the homogeneous model of ...

  1. BSDEs with polynomial growth generators

    Directory of Open Access Journals (Sweden)

    Philippe Briand

    2000-01-01

    Full Text Available In this paper, we give existence and uniqueness results for backward stochastic differential equations when the generator has a polynomial growth in the state variable. We deal with the case of a fixed terminal time, as well as the case of random terminal time. The need for this type of extension of the classical existence and uniqueness results comes from the desire to provide a probabilistic representation of the solutions of semilinear partial differential equations in the spirit of a nonlinear Feynman-Kac formula. Indeed, in many applications of interest, the nonlinearity is polynomial, e.g, the Allen-Cahn equation or the standard nonlinear heat and Schrödinger equations.

  2. Twisted Polynomials and Forgery Attacks on GCM

    DEFF Research Database (Denmark)

    Abdelraheem, Mohamed Ahmed A. M. A.; Beelen, Peter; Bogdanov, Andrey;

    2015-01-01

    twisted polynomials from Ore rings as forgery polynomials. We show how to construct sparse forgery polynomials with full control over the sets of roots. We also achieve complete and explicit disjoint coverage of the key space by these polynomials. We furthermore leverage this new construction in an...... improved key recovery algorithm. As cryptanalytic applications of our twisted polynomials, we develop the first universal forgery attacks on GCM in the weak-key model that do not require nonce reuse. Moreover, we present universal weak-key forgeries for the nonce-misuse resistant AE scheme POET, which is a...

  3. Space complexity in polynomial calculus

    Czech Academy of Sciences Publication Activity Database

    Filmus, Y.; Lauria, M.; Nordström, J.; Ron-Zewi, N.; Thapen, Neil

    2015-01-01

    Roč. 44, č. 4 (2015), s. 1119-1153. ISSN 0097-5397 R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061 Institutional support: RVO:67985840 Keywords : proof complexity * polynomial calculus * lower bounds Subject RIV: BA - General Mathematics Impact factor: 0.741, year: 2014 http://epubs.siam.org/doi/10.1137/120895950

  4. Simplifying Tensor Polynomials with Indices

    CERN Document Server

    Balfagón, A

    1998-01-01

    We are presenting an algorithm capable of simplifying tensor polynomials with indices when the building tensors have index symmetry properties. These properties include simple symmetry, cyclicity and those due to the presence of partial and covariant derivatives. We are also including some examples using the Riemann tensor as a paradigm. The algorithm is part of a Mathematica package called Tools of Tensor Calculus (TTC) [web address: http//baldufa.upc.es/ttc

  5. Roots of Quaternion Standard Polynomials

    CERN Document Server

    Chapman, Adam

    2011-01-01

    Here we present a reduction of any quaternion standard polynomial equation into an equation with two central variables and quaternion coefficients. If only pure imaginary roots are in demand, then the equation is with one central variable. As a result of this reduction we obtain formulas for the solutions of quadratic equations. Another result is a routine for analytically solving cubic quaternion equations assuming they have at least one pure imaginary root.

  6. A polynomial bracket for the Dubrovin--Zhang hierarchies

    CERN Document Server

    Buryak, A; Shadrin, S

    2010-01-01

    We define a hierarchy of Hamiltonian PDEs associated to an arbitrary tau-function in the semi-simple orbit of the Givental group action on genus expansions of Frobenius manifolds. We prove that the equations, the Hamiltonians, and the bracket are weighted-homogeneous polynomials in the derivatives of the dependent variables with respect to the space variable. In the particular case of a conformal (homogeneous) Frobenius structure, our hierarchy coincides with the Dubrovin-Zhang hierarchy that is canonically associated to the underlying Frobenius structure. Therefore, our approach allows to prove the polynomiality of the equations, Hamiltonians and one of the Poisson brackets of these hierarchies, as conjectured by Dubrovin and Zhang.

  7. Pattern Matching under Polynomial Transformation

    CERN Document Server

    Butman, Ayelet; Clifford, Raphael; Jalsenius, Markus; Lewenstein, Noa; Porat, Benny; Porat, Ely; Sach, Benjamin

    2011-01-01

    We consider a class of pattern matching problems where a polynomial transformation can be applied to the pattern at every alignment. Given a pattern of length m and a longer text of length n where both are assumed to contain integer values only, we show O(n log m) algorithms for pattern matching under linear transformations even when wildcard symbols can occur in the input. We then show how to extend the technique to polynomial transformations of arbitrary degree. Next we consider the problem of finding the minimum Hamming distance under polynomial transformation. We show that, for any epsilon > 0, there cannot exist an O(nm^(1-epsilon)) algorithm for additive and linear transformations conditional on the hardness of the classic 3SUM problem. Finally, we consider a version of the Hamming distance problem under additive transformations with a bound k on the maximum distance that need be reported. We give a deterministic O(nk log k) time solution which we then improve by careful use of randomisation to O(n sqrt...

  8. Polynomial approximation, local polynomial convexity, and degenerate CR singularities -- II

    OpenAIRE

    Bharali, Gautam

    2010-01-01

    We provide some conditions for the graph of a Hoelder-continuous function on \\bar{D}, where \\bar{D} is a closed disc in the complex plane, to be polynomially convex. Almost all sufficient conditions known to date --- provided the function (say F) is smooth --- arise from versions of the Weierstrass Approximation Theorem on \\bar{D}. These conditions often fail to yield any conclusion if rank_R(DF) is not maximal on a sufficiently large subset of \\bar{D}. We bypass this difficulty by introducin...

  9. Projected Hartree Fock Theory as a Polynomial Similarity Transformation Theory of Single Excitations

    CERN Document Server

    Qiu, Yiheng; Scuseria, Gustavo E

    2016-01-01

    Spin-projected Hartree-Fock is introduced as a particle-hole excitation ansatz over a symmetry-adapted reference determinant. Remarkably, this expansion has an analytic expression that we were able to decipher. While the form of the polynomial expansion is universal, the excitation amplitudes need to be optimized. This is equivalent to the optimization of orbitals in the conventional projected Hartree-Fock framework of non-orthogonal determinants. Using the inverse of the particle-hole expansion, we similarity transform the Hamiltonian in a coupled-cluster style theory. The left eigenvector of the non-hermitian Hamiltonian is constructed in a similar particle-hole expansion fashion, and we show that to numerically reproduce variational projected Hartree-Fock results, one needs as many pair excitations in the bra as the number of strongly correlated entangled pairs in the system. This single-excitation polynomial similarity transformation theory is an alternative to our recently presented double excitation the...

  10. Chromatic Polynomials of Mixed Hypercycles

    Directory of Open Access Journals (Sweden)

    Allagan Julian A.

    2014-08-01

    Full Text Available We color the vertices of each of the edges of a C-hypergraph (or cohypergraph in such a way that at least two vertices receive the same color and in every proper coloring of a B-hypergraph (or bihypergraph, we forbid the cases when the vertices of any of its edges are colored with the same color (monochromatic or when they are all colored with distinct colors (rainbow. In this paper, we determined explicit formulae for the chromatic polynomials of C-hypercycles and B-hypercycles

  11. Zeroes of random Reinhardt polynomials

    OpenAIRE

    Karami, Arash

    2012-01-01

    For a Reinhardt domain $\\Omega$ with the smooth boundary in $\\mathbb{C}^{m+1}$ and a positive smooth measure $\\mu$ on the boundary of $\\Omega$, we consider the ensemble $P_{N}$ of polynomials of degree $N$ with the Gaussian probability measure $\\gamma_{N}$ which is induced by $L^{2}(\\partial\\Omega,d\\mu)$. Our aim is to compute scaling limit distribution function and scaling limit pair correlation function between zeros when $z\\in\\partial\\Omega$. First of all we apply stationary phase method t...

  12. Global Polynomial Kernel Hazard Estimation

    DEFF Research Database (Denmark)

    Hiabu, Munir; Miranda, Maria Dolores Martínez; Nielsen, Jens Perch;

    2015-01-01

    This paper introduces a new bias reducing method for kernel hazard estimation. The method is called global polynomial adjustment (GPA). It is a global correction which is applicable to any kernel hazard estimator. The estimator works well from a theoretical point of view as it asymptotically...... reduces bias with unchanged variance. A simulation study investigates the finite-sample properties of GPA. The method is tested on local constant and local linear estimators. From the simulation experiment we conclude that the global estimator improves the goodness-of-fit. An especially encouraging result...

  13. Eigenvalues and eigenfunctions for the ground state of polynomial potentials

    International Nuclear Information System (INIS)

    Analytic approximations for the ground state eigenvalues and eigenfunctions of polynomial potentials are found using an extended two-point quasi-rational approximation technique. In this procedure, the approximants are obtained through the power series and asymptotic expansion of the logarithmic derivative of the ground state eigenfunction, leaving the energy eigenvalue as a free parameter. A first approximation to the energy is obtained by imposing the condition that the rational approximating function must not have defects. Later, an iteration procedure leads to very precise energy eigenvalues. The method is described in detail using several explicit potentials as examples

  14. Nonnegative Polynomials and Sums of Squares

    CERN Document Server

    Blekherman, Grigoriy

    2010-01-01

    In the smallest cases where there exist nonnegative polynomials that are not sums of squares we present a complete classification of the differences between these sets. We show that in these cases the fundamental reason that the set of sums of squares is smaller than the set of nonnegative polynomials is that polynomials of degree d satisfy certain linear relations known as the Cayley-Bacharach relations, which are not satisfied by polynomials of full degree 2d. For any nonnegative polynomial that is not a sum of squares we can write down a linear inequality coming from a Cayley-Bacharach relation that certifies that the polynomial is not a sum of squares. We also present structure results on the strictly positive sums of squares that lie on the boundary of the cone of sums of squares and results on extreme rays of the cone dual to the cone of sums of squares.

  15. An Improved Volumetric Estimation Using Polynomial Regression

    Directory of Open Access Journals (Sweden)

    Noraini Abdullah

    2011-12-01

    Full Text Available The polynomial regression (PR technique is used to estimate the parameters of the dependent variable having a polynomial relationship with the independent variable. Normality and nonlinearity exhibit polynomial characterization of power terms greater than 2. Polynomial Regression models (PRM with the auxiliary variables are considered up to their third order interactions. Preliminary, multicollinearity between the independent variables is minimized and statistical tests involving the Global, Correlation Coefficient, Wald, and Goodness-of-Fit tests, are carried out to select significant variables with their possible interactions. Comparisons between the polynomial regression models (PRM are made using the eight selection criteria (8SC. The best regression model is identified based on the minimum value of the eight selection criteria (8SC. The use of an appropriate transformation will increase in the degree of a statistically valid polynomial, hence, providing a better estimation for the model.

  16. Exceptional polynomials and SUSY quantum mechanics

    Indian Academy of Sciences (India)

    K V S Shiv Chaitanya; S Sree Ranjani; Prasanta K Panigrahi; R Radhakrishnan; V Srinivasan

    2015-07-01

    We show that for the quantum mechanical problem which admit classical Laguerre/Jacobi polynomials as solutions for the Schrödinger equations (SE), will also admit exceptional Laguerre/Jacobi polynomials as solutions having the same eigenvalues but with the ground state missing after a modification of the potential. Then, we claim that the existence of these exceptional polynomials leads to the presence of non-trivial supersymmetry.

  17. A new Arnoldi approach for polynomial eigenproblems

    Energy Technology Data Exchange (ETDEWEB)

    Raeven, F.A.

    1996-12-31

    In this paper we introduce a new generalization of the method of Arnoldi for matrix polynomials. The new approach is compared with the approach of rewriting the polynomial problem into a linear eigenproblem and applying the standard method of Arnoldi to the linearised problem. The algorithm that can be applied directly to the polynomial eigenproblem turns out to be more efficient, both in storage and in computation.

  18. Landau and Kolmogoroff type polynomial inequalities

    OpenAIRE

    Alves Claudia RR; Dimitrov Dimitar K

    1999-01-01

    Let be integers. Denote by the norm . For various positive values of and we establish Kolmogoroff type inequalities with certain constants , which hold for every ( denotes the space of real algebraic polynomials of degree not exceeding ). For the particular case and , we provide a complete characterisation of the positive constants and , for which the corresponding Landau type polynomial inequalities hold. In each case we determine the corresponding extremal polynomials for which e...

  19. Accelerated graph-based spectral polynomial filters

    OpenAIRE

    Knyazev, Andrew; Malyshev, Alexander,

    2015-01-01

    Graph-based spectral denoising is a low-pass filtering using the eigendecomposition of the graph Laplacian matrix of a noisy signal. Polynomial filtering avoids costly computation of the eigendecomposition by projections onto suitable Krylov subspaces. Polynomial filters can be based, e.g., on the bilateral and guided filters. We propose constructing accelerated polynomial filters by running flexible Krylov subspace based linear and eigenvalue solvers such as the Block Locally Optimal Precond...

  20. Quantum Schubert polynomials and quantum Schur functions

    OpenAIRE

    Kirillov, Anatol N.

    1997-01-01

    We introduce the quantum multi-Schur functions, quantum factorial Schur functions and quantum Macdonald polynomials. We prove that for restricted vexillary permutations the quantum double Schubert polynomial coincides with some quantum multi-Schur function and prove a quantum analog of the Nagelsbach-Kostka and Jacobi-Trudi formulae for the quantum double Schubert polynomials in the case of Grassmannian permutations. We prove, also, an analog of the Billey-Jockusch-Stanley formula for quantum...

  1. Generalizations of Bernoulli numbers and polynomials

    OpenAIRE

    Qiu-Ming Luo; Bai-Ni Guo; Feng Qi; Lokenath Debnath

    2003-01-01

    The concepts of Bernoulli numbers Bn, Bernoulli polynomials Bn(x), and the generalized Bernoulli numbers Bn(a,b) are generalized to the one Bn(x;a,b,c) which is called the generalized Bernoulli polynomials depending on three positive real parameters. Numerous properties of these polynomials and some relationships between Bn, Bn(x), Bn(a,b), and Bn(x;a,b,c) are established.

  2. About polynomials related to a quadratic equation

    OpenAIRE

    Groux, Roland

    2011-01-01

    We consider here a particular quadratic equation linking two elements of a C-Algebra. By analysing powers of the unknowns, it appears a double sequence of polynomials related to classical Bernoulli polynomials. We get the generating functions, integral forms and explicit formulas for the coefficients involving cosecant and tangent numbers. We also study the use of these polynomials for the calculation of some integral transforms.

  3. Discrete least squares approximation with polynomial vectors

    OpenAIRE

    Van Barel, Marc; Bultheel, Adhemar

    1993-01-01

    We give a solution of a discrete least squares approximation problem in terms of orthogonal polynomial vectors. The degrees of the polynomial elements of these vectors can be different. An algorithm is constructed computing the coefficients of recurrence relations for the orthogonal polynomial vectors. In case the function values are prescribed in points on the real line or on the unit circle variants of the original algorithm can be designed which are an order of magnitude more efficient. Al...

  4. On permutation polynomials over finite fields

    OpenAIRE

    C. Small; R. A. Mollin

    1987-01-01

    A polynomial f over a finite field F is called a permutation polynomial if the mapping F→F defined by f is one-to-one. In this paper we consider the problem of characterizing permutation polynomials; that is, we seek conditions on the coefficients of a polynomial which are necessary and sufficient for it to represent a permutation. We also give some results bearing on a conjecture of Carlitz which says essentially that for any even integer m, the cardinality of finite fields admitting pe...

  5. The q-Laguerre matrix polynomials.

    Science.gov (United States)

    Salem, Ahmed

    2016-01-01

    The Laguerre polynomials have been extended to Laguerre matrix polynomials by means of studying certain second-order matrix differential equation. In this paper, certain second-order matrix q-difference equation is investigated and solved. Its solution gives a generalized of the q-Laguerre polynomials in matrix variable. Four generating functions of this matrix polynomials are investigated. Two slightly different explicit forms are introduced. Three-term recurrence relation, Rodrigues-type formula and the q-orthogonality property are given. PMID:27190749

  6. Control to Facet for Polynomial Systems

    DEFF Research Database (Denmark)

    Sloth, Christoffer; Wisniewski, Rafael

    2014-01-01

    This paper presents a solution to the control to facet problem for arbitrary polynomial vector fields defined on simplices. The novelty of the work is to use Bernstein coefficients of polynomials for determining certificates of positivity. Specifically, the constraints that are set up for the...... controller design are solved by searching for polynomials in Bernstein form. This allows the controller design problem to be formulated as a linear programming problem. Examples are provided that demonstrate the efficiency of the method for designing controls for polynomial systems....

  7. Polynomial chaotic inflation in supergravity revisited

    Directory of Open Access Journals (Sweden)

    Kazunori Nakayama

    2014-10-01

    Full Text Available We revisit a polynomial chaotic inflation model in supergravity which we proposed soon after the Planck first data release. Recently some issues have been raised in Ref. [12], concerning the validity of our polynomial chaotic inflation model. We study the inflaton dynamics in detail, and confirm that the inflaton potential is very well approximated by a polynomial potential for the parameters of our interest in any practical sense, and in particular, the spectral index and the tensor-to-scalar ratio can be estimated by single-field approximation. This justifies our analysis of the polynomial chaotic inflation in supergravity.

  8. Multi-indexed (q)-Racah Polynomials

    CERN Document Server

    Odake, Satoru

    2012-01-01

    As the second stage of the project $multi-indexed orthogonal polynomials$, we present, in the framework of `discrete quantum mechanics' with real shifts in one dimension, the multi-indexed (q)-Racah polynomials. They are obtained from the (q)-Racah polynomials by multiple application of the discrete analogue of the Darboux transformations or the Crum-Krein-Adler deletion of `virtual state' vectors of type I and II, in a similar way to the multi-indexed Laguerre and Jacobi polynomials reported earlier. The virtual state vectors are the `solutions' of the matrix Schr\\"odinger equation with negative `eigenvalues', except for one of the two boundary points.

  9. Macdonald Polynomials and Multivariable Basic Hypergeometric Series

    Directory of Open Access Journals (Sweden)

    Michael J. Schlosser

    2007-03-01

    Full Text Available We study Macdonald polynomials from a basic hypergeometric series point of view. In particular, we show that the Pieri formula for Macdonald polynomials and its recently discovered inverse, a recursion formula for Macdonald polynomials, both represent multivariable extensions of the terminating very-well-poised ${}_6phi_5$ summation formula. We derive several new related identities including multivariate extensions of Jackson's very-well-poised ${}_8phi_7$ summation. Motivated by our basic hypergeometric analysis, we propose an extension of Macdonald polynomials to Macdonald symmetric functions indexed by partitions with complex parts. These appear to possess nice properties.

  10. On the Fermionic -adic Integral Representation of Bernstein Polynomials Associated with Euler Numbers and Polynomials

    Directory of Open Access Journals (Sweden)

    Ryoo CS

    2010-01-01

    Full Text Available The purpose of this paper is to give some properties of several Bernstein type polynomials to represent the fermionic -adic integral on . From these properties, we derive some interesting identities on the Euler numbers and polynomials.

  11. Zernike olivary polynomials for applications with olivary pupils.

    Science.gov (United States)

    Zheng, Yi; Sun, Shanshan; Li, Ying

    2016-04-20

    Orthonormal polynomials have been extensively applied in optical image systems. One important optical pupil, which is widely processed in lateral shearing interferometers (LSI) and subaperture stitch tests (SST), is the overlap region of two circular wavefronts that are displaced from each other. We call it an olivary pupil. In this paper, the normalized process of an olivary pupil in a unit circle is first presented. Then, using a nonrecursive matrix method, Zernike olivary polynomials (ZOPs) are obtained. Previously, Zernike elliptical polynomials (ZEPs) have been considered as an approximation over an olivary pupil. We compare ZOPs with their ZEPs counterparts. Results show that they share the same components but are in different proportions. For some low-order aberrations such as defocus, coma, and spherical, the differences are considerable and may lead to deviations. Using a least-squares method to fit coefficient curves, we present a power-series expansion form for the first 15 ZOPs, which can be used conveniently with less than 0.1% error. The applications of ZOP are demonstrated in wavefront decomposition, LSI interferogram reconstruction, and SST overlap domain evaluation. PMID:27140076

  12. Convergent series for lattice models with polynomial interactions

    CERN Document Server

    Ivanov, Aleksandr S

    2016-01-01

    The standard perturbative weak-coupling expansions in lattice models are asymptotic. The reason for this is hidden in the incorrect interchange of the summation and integration. However, substituting the Gaussian initial approximation of the perturbative expansions by a certain interacting model or regularizing original lattice integrals, one can construct desired convergent series. In this paper we develop methods, which are based on the joint and separate utilization of the regularization and new initial approximation. We prove, that the convergent series exist and can be expressed as the re-summed standard perturbation theory for any model on the finite lattice with the polynomial interaction of even degree. We discuss properties of such series and make them applicable to practical computations. The workability of the methods is demonstrated on the example of the lattice $\\phi^4$-model. We calculate the operator $\\langle\\phi_n^2\\rangle$ using the convergent series, the comparison of the results with the Bo...

  13. Polynomial invariants of quantum codes

    CERN Document Server

    Rains, E M

    1997-01-01

    The weight enumerators (quant-ph/9610040) of a quantum code are quite powerful tools for exploring its structure. As the weight enumerators are quadratic invariants of the code, this suggests the consideration of higher-degree polynomial invariants. We show that the space of degree k invariants of a code of length n is spanned by a set of basic invariants in one-to-one correspondence with S_k^n. We then present a number of equations and inequalities in these invariants; in particular, we give a higher-order generalization of the shadow enumerator of a code, and prove that its coefficients are nonnegative. We also prove that the quartic invariants of a ((4,4,2)) are uniquely determined, an important step in a proof that any ((4,4,2)) is additive ([2]).

  14. Algebras, dialgebras, and polynomial identities

    CERN Document Server

    Bremner, Murray R

    2012-01-01

    This is a survey of some recent developments in the theory of associative and nonassociative dialgebras, with an emphasis on polynomial identities and multilinear operations. We discuss associative, Lie, Jordan, and alternative algebras, and the corresponding dialgebras; the KP algorithm for converting identities for algebras into identities for dialgebras; the BSO algorithm for converting operations in algebras into operations in dialgebras; Lie and Jordan triple systems, and the corresponding disystems; and a noncommutative version of Lie triple systems based on the trilinear operation abc-bca. The paper concludes with a conjecture relating the KP and BSO algorithms, and some suggestions for further research. Most of the original results are joint work with Raul Felipe, Luiz A. Peresi, and Juana Sanchez-Ortega.

  15. Elementary combinatorics of the HOMFLYPT polynomial

    OpenAIRE

    Chmutov, Sergei; Polyak, Michael

    2008-01-01

    We explore Jaeger's state model for the HOMFLYPT polynomial. We reformulate this model in the language of Gauss diagrams and use it to obtain Gauss diagram formulas for a two-parameter family of Vassiliev invariants coming from the HOMFLYPT polynomial. These formulas are new already for invariants of degree 3.

  16. Application of polynomial preconditioners to conservation laws

    NARCIS (Netherlands)

    Geurts, Bernard J.; Buuren, van René; Lu, Hao

    2000-01-01

    Polynomial preconditioners which are suitable in implicit time-stepping methods for conservation laws are reviewed and analyzed. The preconditioners considered are either based on a truncation of a Neumann series or on Chebyshev polynomials for the inverse of the system-matrix. The latter class of p

  17. An inequality for polynomials with elliptic majorant

    OpenAIRE

    Nikolov Geno

    1999-01-01

    Let be the transformed Chebyshev polynomial of the first kind, where . We show here that has the greatest uniform norm in of its -th derivative among all algebraic polynomials of degree not exceeding , which vanish at and satisfy the inequality at the points .

  18. The Bessel polynomials and their differential operators

    International Nuclear Information System (INIS)

    Differential operators associated with the ordinary and the generalized Bessel polynomials are defined. In each case the commutator bracket is constructed and shows that the differential operators associated with the Bessel polynomials and their generalized form are not commutative. Some applications of these operators to linear differential equations are also discussed. (author). 4 refs

  19. Sums of Powers of Fibonacci Polynomials

    Indian Academy of Sciences (India)

    Helmut Prodinger

    2009-11-01

    Using the explicit (Binet) formula for the Fibonacci polynomials, a summation formula for powers of Fibonacci polynomials is derived straightforwardly, which generalizes a recent result for squares that appeared in Proc. Ind. Acad. Sci. (Math. Sci.) 118 (2008) 27--41.

  20. The weighted lattice polynomials as aggregation functions

    OpenAIRE

    Marichal, Jean-Luc

    2006-01-01

    We define the concept of weighted lattice polynomials as lattice polynomials constructed from both variables and parameters. We provide equivalent forms of these functions in an arbitrary bounded distributive lattice. We also show that these functions include the class of discrete Sugeno integrals and that they are characterized by a remarkable median based decomposition formula.

  1. A Note on Solvable Polynomial Algebras

    Directory of Open Access Journals (Sweden)

    Huishi Li

    2014-03-01

    Full Text Available In terms of their defining relations, solvable polynomial algebras introduced by Kandri-Rody and Weispfenning [J. Symbolic Comput., 9(1990] are characterized by employing Gr\\"obner bases of ideals in free algebras, thereby solvable polynomial algebras are completely determinable and constructible in a computational way.

  2. On the Zeros of a Polynomial

    Indian Academy of Sciences (India)

    V K Jain

    2009-02-01

    For a polynomial of degree , we have obtained an upper bound involving coefficients of the polynomial, for moduli of its zeros of smallest moduli, and then a refinement of the well-known Eneström–Kakeya theorem (under certain conditions).

  3. A generalization of the Bernoulli polynomials

    OpenAIRE

    Pierpaolo Natalini; Angela Bernardini

    2003-01-01

    A generalization of the Bernoulli polynomials and, consequently, of the Bernoulli numbers, is defined starting from suitable generating functions. Furthermore, the differential equations of these new classes of polynomials are derived by means of the factorization method introduced by Infeld and Hull (1951).

  4. A generalization of the Bernoulli polynomials

    Directory of Open Access Journals (Sweden)

    Pierpaolo Natalini

    2003-01-01

    Full Text Available A generalization of the Bernoulli polynomials and, consequently, of the Bernoulli numbers, is defined starting from suitable generating functions. Furthermore, the differential equations of these new classes of polynomials are derived by means of the factorization method introduced by Infeld and Hull (1951.

  5. Quantum Search for Zeros of Polynomials

    CERN Document Server

    Weigert, S

    2003-01-01

    A quantum mechanical search procedure to determine the real zeros of a polynomial is introduced. It is based on the construction of a spin observable whose eigenvalues coincide with the zeros of the polynomial. Subsequent quantum mechanical measurements of the observable output directly the numerical values of the zeros. Performing the measurements is the only computational resource involved.

  6. A quantum search for zeros of polynomials

    Energy Technology Data Exchange (ETDEWEB)

    Weigert, Stefan [HuMP-Hull Mathematical Physics, Department of Mathematics, University of Hull, Hull HU6 7RX (United Kingdom)

    2003-12-01

    A quantum mechanical search procedure to determine the real zeros of a polynomial is introduced. It is based on the construction of a spin observable whose eigenvalues coincide with the zeros of the polynomial. Subsequent quantum mechanical measurements of the observable output directly the numerical values of the zeros. Performing the measurements is the only computational resource involved.

  7. Point vortex equilibria related to Bessel polynomials

    Science.gov (United States)

    O'Neil, Kevin A.

    2016-05-01

    The method of polynomials is used to construct two families of stationary point vortex configurations. The vortices are placed at the reciprocals of the zeroes of Bessel polynomials. Configurations that translate uniformly, and configurations that are completely stationary, are obtained in this way.

  8. A $(p,q)$-Analogue of Poly-Euler Polynomials and Some Related Polynomials

    OpenAIRE

    Komatsu, Takao; Ramírez, José L.; Sirvent, Víctor F.

    2016-01-01

    In the present article, we introduce a $(p,q)$-analogue of the poly-Euler polynomials and numbers by using the $(p,q)$-polylogarithm function. These new sequences are generalizations of the poly-Euler numbers and polynomials. We give several combinatorial identities and properties of these new polynomials. Moreover, we show some relations with the $(p,q)$-poly-Bernoulli polynomials and $(p,q)$-poly-Cauchy polynomials. The $(p,q)$-analogues generalize the well-known concept of the $q$-analogue.

  9. Sobolev orthogonal polynomials on a simplex

    CERN Document Server

    Aktas, Rabia

    2011-01-01

    The Jacobi polynomials on the simplex are orthogonal polynomials with respect to the weight function $W_\\bg(x) = x_1^{\\g_1} ... x_d^{\\g_d} (1- |x|)^{\\g_{d+1}}$ when all $\\g_i > -1$ and they are eigenfunctions of a second order partial differential operator $L_\\bg$. The singular cases that some, or all, $\\g_1,...,\\g_{d+1}$ are -1 are studied in this paper. Firstly a complete basis of polynomials that are eigenfunctions of $L_\\bg$ in each singular case is found. Secondly, these polynomials are shown to be orthogonal with respect to an inner product which is explicitly determined. This inner product involves derivatives of the functions, hence the name Sobolev orthogonal polynomials.

  10. Orthogonal Polynomials from Hermitian Matrices II

    CERN Document Server

    Odake, Satoru

    2016-01-01

    This is the second part of the project `unified theory of classical orthogonal polynomials of a discrete variable derived from the eigenvalue problems of hermitian matrices.' In a previous paper, orthogonal polynomials having Jackson integral measures were not included, since such measures cannot be obtained from single infinite dimensional hermitian matrices. Here we show that Jackson integral measures for the polynomials of the big $q$-Jacobi family are the consequence of the recovery of self-adjointness of the unbounded Jacobi matrices governing the difference equations of these polynomials. The recovery of self-adjointness is achieved in an extended $\\ell^2$ Hilbert space on which a direct sum of two unbounded Jacobi matrices acts as a Hamiltonian or a difference Schr\\"odinger operator for an infinite dimensional eigenvalue problem. The polynomial appearing in the upper/lower end of Jackson integral constitutes the eigenvector of each of the two unbounded Jacobi matrix of the direct sum. We also point out...

  11. Matrix product formula for Macdonald polynomials

    International Nuclear Information System (INIS)

    We derive a matrix product formula for symmetric Macdonald polynomials. Our results are obtained by constructing polynomial solutions of deformed Knizhnik–Zamolodchikov equations, which arise by considering representations of the Zamolodchikov–Faddeev and Yang–Baxter algebras in terms of t-deformed bosonic operators. These solutions are generalized probabilities for particle configurations of the multi-species asymmetric exclusion process, and form a basis of the ring of polynomials in n variables whose elements are indexed by compositions. For weakly increasing compositions (anti-dominant weights), these basis elements coincide with non-symmetric Macdonald polynomials. Our formulas imply a natural combinatorial interpretation in terms of solvable lattice models. They also imply that normalizations of stationary states of multi-species exclusion processes are obtained as Macdonald polynomials at q = 1. (paper)

  12. Tutte polynomial in functional magnetic resonance imaging

    Science.gov (United States)

    García-Castillón, Marlly V.

    2015-09-01

    Methods of graph theory are applied to the processing of functional magnetic resonance images. Specifically the Tutte polynomial is used to analyze such kind of images. Functional Magnetic Resonance Imaging provide us connectivity networks in the brain which are represented by graphs and the Tutte polynomial will be applied. The problem of computing the Tutte polynomial for a given graph is #P-hard even for planar graphs. For a practical application the maple packages "GraphTheory" and "SpecialGraphs" will be used. We will consider certain diagram which is depicting functional connectivity, specifically between frontal and posterior areas, in autism during an inferential text comprehension task. The Tutte polynomial for the resulting neural networks will be computed and some numerical invariants for such network will be obtained. Our results show that the Tutte polynomial is a powerful tool to analyze and characterize the networks obtained from functional magnetic resonance imaging.

  13. On some properties on bivariate Fibonacci and Lucas polynomials

    OpenAIRE

    Belbachir, Hacéne; Bencherif, Farid

    2007-01-01

    In this paper we generalize to bivariate polynomials of Fibonacci and Lucas, properties obtained for Chebyshev polynomials. We prove that the coordinates of the bivariate polynomials over appropriate basis are families of integers satisfying remarkable recurrence relations.

  14. Bernoulli-like polynomials associated with Stirling Numbers

    OpenAIRE

    Bender, Carl M; Brody, Dorje C.; BERNHARD K. MEISTER

    2005-01-01

    The Stirling numbers of the first kind can be represented in terms of a new class of polynomials that are closely related to the Bernoulli polynomials. Recursion relations for these polynomials are given.

  15. Polynomial Interpolation in the Elliptic Curve Cryptosystem

    Directory of Open Access Journals (Sweden)

    Liew K. Jie

    2011-01-01

    Full Text Available Problem statement: In this research, we incorporate the polynomial interpolation method in the discrete logarithm problem based cryptosystem which is the elliptic curve cryptosystem. Approach: In this study, the polynomial interpolation method to be focused is the Lagrange polynomial interpolation which is the simplest polynomial interpolation method. This method will be incorporated in the encryption algorithm of the elliptic curve ElGamal cryptosystem. Results: The scheme modifies the elliptic curve ElGamal cryptosystem by adding few steps in the encryption algorithm. Two polynomials are constructed based on the encrypted points using Lagrange polynomial interpolation and encrypted for the second time using the proposed encryption method. We believe it is safe from the theoretical side as it still relies on the discrete logarithm problem of the elliptic curve. Conclusion/Recommendations: The modified scheme is expected to be more secure than the existing scheme as it offers double encryption techniques. On top of the existing encryption algorithm, we managed to encrypt one more time using the polynomial interpolation method. We also have provided detail examples based on the described algorithm.

  16. Tree based functional expansions for Feynman--Kac particle models

    OpenAIRE

    Del Moral, Pierre; Patras, Frédéric; Rubenthaler, Sylvain

    2009-01-01

    We design exact polynomial expansions of a class of Feynman–Kac particle distributions. These expansions are finite and are parametrized by coalescent trees and other related combinatorial quantities. The accuracy of the expansions at any order is related naturally to the number of coalescences of the trees. Our results include an extension of the Wick product formula to interacting particle systems. They also provide refined nonasymptotic propagation of chaos-type properties, as well as shar...

  17. On the defect and stability of differential expansion

    CERN Document Server

    Kononov, Ya

    2015-01-01

    Empirical analysis of many colored knot polynomials, made possible by recent computational advances in Chern-Simons theory, reveals their stability: for any given negative N and any given knot the set of coefficients of the polynomial in r-th symmetric representation does not change with r, if it is large enough. This fact reflects the non-trivial and previously unknown properties of the differential expansion, and it turns out that from this point of view there are universality classes of knots, characterized by a single integer, which we call defect, and which is in fact related to the power of Alexander polynomial.

  18. More on rotations as spin matrix polynomials

    Energy Technology Data Exchange (ETDEWEB)

    Curtright, Thomas L. [Department of Physics, University of Miami, Coral Gables, Florida 33124-8046 (United States)

    2015-09-15

    Any nonsingular function of spin j matrices always reduces to a matrix polynomial of order 2j. The challenge is to find a convenient form for the coefficients of the matrix polynomial. The theory of biorthogonal systems is a useful framework to meet this challenge. Central factorial numbers play a key role in the theoretical development. Explicit polynomial coefficients for rotations expressed either as exponentials or as rational Cayley transforms are considered here. Structural features of the results are discussed and compared, and large j limits of the coefficients are examined.

  19. Cycles are determined by their domination polynomials

    OpenAIRE

    Akbari, Saieed; Oboudi, Mohammad Reza

    2009-01-01

    Let $G$ be a simple graph of order $n$. A dominating set of $G$ is a set $S$ of vertices of $G$ so that every vertex of $G$ is either in $S$ or adjacent to a vertex in $S$. The domination polynomial of $G$ is the polynomial $D(G,x)=\\sum_{i=1}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. In this paper we show that cycles are determined by their domination polynomials.

  20. On function compositions that are polynomials

    OpenAIRE

    Aichinger, Erhard

    2015-01-01

    For a polynomial map $\\tupBold{f} : k^n \\to k^m$ ($k$ a field), we investigate those polynomials $g \\in k[t_1,\\ldots, t_n]$ that can be written as a composition $g = h \\circ \\tupBold{f}$, where $h: k^m \\to k$ is an arbitrary function. In the case that $k$ is algebraically closed of characteristic~$0$ and $\\tupBold{f}$ is surjective, we will show that $g = h \\circ \\tupBold{f}$ implies that $h$ is a polynomial.

  1. On Combinatorial Formulas for Macdonald Polynomials

    OpenAIRE

    Lenart, Cristian

    2008-01-01

    A recent breakthrough in the theory of (type A) Macdonald polynomials is due to Haglund, Haiman and Loehr, who exhibited a combinatorial formula for these polynomials in terms of a pair of statistics on fillings of Young diagrams. Ram and Yip gave a formula for the Macdonald polynomials of arbitrary type in terms of so-called alcove walks; these originate in the work of Gaussent-Littelmann and of the author with Postnikov on discrete counterparts to the Littelmann path model. In this paper, w...

  2. On Calculation of Adomian Polynomials by MATLAB

    Directory of Open Access Journals (Sweden)

    Hossein ABOLGHASEMI

    2011-01-01

    Full Text Available Adomian Decomposition Method (ADM is an elegant technique to handle an extensive class of linear or nonlinear differential and integral equations. However, in case of nonlinear equations, ADM demands a special representation of each nonlinear term, namely, Adomian polynomials. The present paper introduces a novel MATLAB code which computes Adomian polynomials associated with several types of nonlinearities. The code exploits symbolic programming incorporated with a recently proposed alternative scheme to be straightforward and fast. For the sake of exemplification, Adomian polynomials of famous nonlinear operators, computed by the code, are given.

  3. Thermal expansion

    International Nuclear Information System (INIS)

    Thermal expansion of fuel pellet is an important property which limits the lifetime of the fuels in reactors, because it affects both the pellet and cladding mechanical interaction and the gap conductivity. By fitting a number of available measured data, recommended equations have been presented and successfully used to estimate thermal expansion coefficient of the nuclear fuel pellet. However, due to large scatter of the measured data, non-consensus data have been omitted in formulating the equations. Also, the equation is strongly governed by the lack of appropriate experimental data. For those reasons, it is important to develop theoretical methodologies to better describe thermal expansion behaviour of nuclear fuel. In particular, first-principles and molecular dynamics simulations have been certainly contributed to predict reliable thermal expansion without fitting the measured data. Furthermore, the two theoretical techniques have improved on understanding the change of fuel dimension by describing the atomic-scale processes associated with lattice expansion in the fuels. (author)

  4. Tutte Polynomial of Scale-Free Networks

    Science.gov (United States)

    Chen, Hanlin; Deng, Hanyuan

    2016-05-01

    The Tutte polynomial of a graph, or equivalently the q-state Potts model partition function, is a two-variable polynomial graph invariant of considerable importance in both statistical physics and combinatorics. The computation of this invariant for a graph is NP-hard in general. In this paper, we focus on two iteratively growing scale-free networks, which are ubiquitous in real-life systems. Based on their self-similar structures, we mainly obtain recursive formulas for the Tutte polynomials of two scale-free networks (lattices), one is fractal and "large world", while the other is non-fractal but possess the small-world property. Furthermore, we give some exact analytical expressions of the Tutte polynomial for several special points at ( x, y)-plane, such as, the number of spanning trees, the number of acyclic orientations, etc.

  5. Transversals of Complex Polynomial Vector Fields

    DEFF Research Database (Denmark)

    Dias, Kealey

    Vector fields in the complex plane are defined by assigning the vector determined by the value P(z) to each point z in the complex plane, where P is a polynomial of one complex variable. We consider special families of so-called rotated vector fields that are determined by a polynomial multiplied...... by rotational constants. Transversals are a certain class of curves for such a family of vector fields that represent the bifurcation states for this family of vector fields. More specifically, transversals are curves that coincide with a homoclinic separatrix for some rotation of the vector field....... Given a concrete polynomial, it seems to take quite a bit of work to prove that it is generic, i.e. structurally stable. This has been done for a special class of degree d polynomial vector fields having simple equilibrium points at the d roots of unity, d odd. In proving that such vector fields are...

  6. Characteristic Polynomials of Sample Covariance Matrices

    OpenAIRE

    Kösters, Holger

    2009-01-01

    We investigate the second-order correlation function of the characteristic polynomial of a sample covariance matrix. Starting from an explicit formula for the generating function, we re-obtain several well-known kernels from random matrix theory.

  7. Thermodynamic characterization of networks using graph polynomials

    CERN Document Server

    Ye, Cheng; Peron, Thomas K DM; Silva, Filipi N; Rodrigues, Francisco A; Costa, Luciano da F; Torsello, Andrea; Hancock, Edwin R

    2015-01-01

    In this paper, we present a method for characterizing the evolution of time-varying complex networks by adopting a thermodynamic representation of network structure computed from a polynomial (or algebraic) characterization of graph structure. Commencing from a representation of graph structure based on a characteristic polynomial computed from the normalized Laplacian matrix, we show how the polynomial is linked to the Boltzmann partition function of a network. This allows us to compute a number of thermodynamic quantities for the network, including the average energy and entropy. Assuming that the system does not change volume, we can also compute the temperature, defined as the rate of change of entropy with energy. All three thermodynamic variables can be approximated using low-order Taylor series that can be computed using the traces of powers of the Laplacian matrix, avoiding explicit computation of the normalized Laplacian spectrum. These polynomial approximations allow a smoothed representation of the...

  8. Solving Bivariate Polynomial Systems on a GPU

    International Nuclear Information System (INIS)

    We present a CUDA implementation of dense multivariate polynomial arithmetic based on Fast Fourier Transforms over finite fields. Our core routine computes on the device (GPU) the subresultant chain of two polynomials with respect to a given variable. This subresultant chain is encoded by values on a FFT grid and is manipulated from the host (CPU) in higher-level procedures. We have realized a bivariate polynomial system solver supported by our GPU code. Our experimental results (including detailed profiling information and benchmarks against a serial polynomial system solver implementing the same algorithm) demonstrate that our strategy is well suited for GPU implementation and provides large speedup factors with respect to pure CPU code.

  9. Superconformal minimal models and admissible Jack polynomials

    CERN Document Server

    Blondeau-Fournier, Olivier; Ridout, David; Wood, Simon

    2016-01-01

    We give new proofs of the rationality of the N=1 superconformal minimal model vertex operator superalgebras and of the classification of their modules in both the Neveu-Schwarz and Ramond sectors. For this, we combine the standard free field realisation with the theory of Jack symmetric functions. A key role is played by Jack symmetric polynomials with a certain negative parameter that are labelled by admissible partitions. These polynomials are shown to describe free fermion correlators, suitably dressed by a symmetrising factor. The classification proofs concentrate on explicitly identifying Zhu's algebra and its twisted analogue. Interestingly, these identifications do not use an explicit expression for the non-trivial vacuum singular vector. While the latter is known to be expressible in terms of an Uglov symmetric polynomial or a linear combination of Jack superpolynomials, it turns out that standard Jack polynomials (and functions) suffice to prove the classification.

  10. Inequalities for a polynomial and its derivative

    Science.gov (United States)

    Chanam, Barchand; Dewan, K. K.

    2007-12-01

    Let , 1[less-than-or-equals, slant][mu][less-than-or-equals, slant]n, be a polynomial of degree n such that p(z)[not equal to]0 in z0, then for 0Yadav and Pukhta [K.K. Dewan, R.S. Yadav, M.S. Pukhta, Inequalities for a polynomial and its derivative, Math. Inequal. Appl. 2 (2) (1999) 203-205] proved Equality holds for the polynomial where n is a multiple of [mu]E In this paper, we obtain an improvement of the above inequality by involving some of the coefficients. As an application of our result, we further improve upon a result recently proved by Aziz and Shah [A. Aziz, W.M. Shah, Inequalities for a polynomial and its derivative, Math. Inequal. Appl. 7 (3) (2004) 379-391].

  11. Bergman orthogonal polynomials and the Grunsky matrix

    OpenAIRE

    Beckermann, Bernhard; Stylianopoulos, Nikos

    2016-01-01

    By exploiting a link between Bergman orthogonal polynomials and the Grunsky matrix, probably first observed by Kühnau in 1985, we improve some recent results on strong asymptotics of Bergman polynomials outside the domain G of orthogonality, and on entries of the Bergman shift operator. In our proofs we suggest a new matrix approach involving the Grunsky matrix, and use well-established results in the literature relating properties of the Grunsky matrix to the regularity of the boundary of G,...

  12. Equivalence of polynomial conjectures in additive combinatorics

    CERN Document Server

    Lovett, Shachar

    2010-01-01

    We study two conjectures in additive combinatorics. The first is the polynomial Freiman-Ruzsa conjecture, which relates to the structure of sets with small doubling. The second is the inverse Gowers conjecture for $U^3$, which relates to functions which locally look like quadratics. In both cases a weak form, with exponential decay of parameters is known, and a strong form with only a polynomial loss of parameters is conjectured. Our main result is that the two conjectures are in fact equivalent.

  13. Stochastic processes with orthogonal polynomial eigenfunctions

    Science.gov (United States)

    Griffiths, Bob

    2009-12-01

    Markov processes which are reversible with either Gamma, Normal, Poisson or Negative Binomial stationary distributions in the Meixner class and have orthogonal polynomial eigenfunctions are characterized as being processes subordinated to well-known diffusion processes for the Gamma and Normal, and birth and death processes for the Poisson and Negative Binomial. A characterization of Markov processes with Beta stationary distributions and Jacobi polynomial eigenvalues is also discussed.

  14. Ferrers Matrices Characterized by the Rook Polynomials

    Institute of Scientific and Technical Information of China (English)

    MAHai-cheng; HUSheng-biao

    2003-01-01

    In this paper,we show that there exist precisely W(A) Ferrers matrices F(C1,C2,…,cm)such that the rook polynomials is equal to the rook polynomial of Ferrers matrix F(b1,b2,…,bm), where A={b1,b2-1,…,bm-m+1} is a repeated set,W(A) is weight of A.

  15. Quantum group invariants and link polynomials

    International Nuclear Information System (INIS)

    A general method is developed for constructing quantum group invariants and determining their eigenvalues. Applied to the universal R-matrix this method leads to the construction of a closed formula for link polynomials. To illustrate the application of this formula, the quantum groups Uq(E8), Uq(so(2m+1)) and Uq(gl(m)) are considered as examples, and corresponding link polynomials are obtained. (orig.)

  16. On Sharing, Memoization, and Polynomial Time

    OpenAIRE

    Avanzini, Martin; Dal Lago, Ugo

    2015-01-01

    We study how the adoption of an evaluation mechanism with sharing and memoization impacts the class of functions which can be computed in polynomial time. We first show how a natural cost model in which lookup for an already computed result has no cost is indeed invariant. As a corollary, we then prove that the most general notion of ramified recurrence is sound for polynomial time, this way settling an open problem in implicit computational complexity.

  17. Laguerre polynomials method in the valon model

    CERN Document Server

    Boroun, G R

    2014-01-01

    We used the Laguerre polynomials method for determination of the proton structure function in the valon model. We have examined the applicability of the valon model with respect to a very elegant method, where the structure of the proton is determined by expanding valon distributions and valon structure functions on Laguerre polynomials. We compared our results with the experimental data, GJR parameterization and DL model. Having checked, this method gives a good description for the proton structure function in valon model.

  18. Positive maps, positive polynomials and entanglement witnesses

    International Nuclear Information System (INIS)

    We link the study of positive quantum maps, block positive operators and entanglement witnesses with problems related to multivariate polynomials. For instance, we show how indecomposable block positive operators relate to biquadratic forms that are not sums of squares. Although the general problem of describing the set of positive maps remains open, in some particular cases we solve the corresponding polynomial inequalities and obtain explicit conditions for positivity.

  19. A Polynomial Preconditioner for the CMRH Algorithm

    OpenAIRE

    Shiji Xu; Jiangzhou Lai; Linzhang Lu

    2011-01-01

    Many large and sparse linear systems can be solved efficiently by restarted GMRES and CMRH methods Sadok 1999. The CMRH(m) method is less expensive and requires slightly less storage than GMRES(m). But like GMRES, the restarted CMRH method may not converge. In order to remedy this defect, this paper presents a polynomial preconditioner for CMRH-based algorithm. Numerical experiments are given to show that the polynomial preconditioner is quite simple and easily constructed and the preconditio...

  20. Blind Signature Scheme Based on Chebyshev Polynomials

    Directory of Open Access Journals (Sweden)

    Maheswara Rao Valluri

    2011-12-01

    Full Text Available A blind signature scheme is a cryptographic protocol to obtain a valid signature for a message from a signer such that signer’s view of the protocol can’t be linked to the resulting message signature pair. This paper presents blind signature scheme using Chebyshev polynomials. The security of the given scheme depends upon the intractability of the integer factorization problem and discrete logarithms ofChebyshev polynomials.

  1. Nonsymmetric Askey-Wilson polynomials and $Q$-polynomial distance-regular graphs

    OpenAIRE

    Lee, Jae-Ho

    2015-01-01

    In his famous theorem (1982), Douglas Leonard characterized the $q$-Racah polynomials and their relatives in the Askey scheme from the duality property of $Q$-polynomial distance-regular graphs. In this paper we consider a nonsymmetric (or Laurent) version of the $q$-Racah polynomials in the above situation. Let $\\Gamma$ denote a $Q$-polynomial distance-regular graph that contains a Delsarte clique $C$. Assume that $\\Gamma$ has $q$-Racah type. Fix a vertex $x \\in C$. We partition the vertex s...

  2. Vector-Valued Jack Polynomials from Scratch

    Directory of Open Access Journals (Sweden)

    Jean-Gabriel Luque

    2011-03-01

    Full Text Available Vector-valued Jack polynomials associated to the symmetric group S_N are polynomials with multiplicities in an irreducible module of S_N and which are simultaneous eigenfunctions of the Cherednik-Dunkl operators with some additional properties concerning the leading monomial. These polynomials were introduced by Griffeth in the general setting of the complex reflections groups G(r,p,N and studied by one of the authors (C. Dunkl in the specialization r=p=1 (i.e. for the symmetric group. By adapting a construction due to Lascoux, we describe an algorithm allowing us to compute explicitly the Jack polynomials following a Yang-Baxter graph. We recover some properties already studied by C. Dunkl and restate them in terms of graphs together with additional new results. In particular, we investigate normalization, symmetrization and antisymmetrization, polynomials with minimal degree, restriction etc. We give also a shifted version of the construction and we discuss vanishing properties of the associated polynomials.

  3. Eigenvalue hypothesis for Racah matrices and HOMFLY polynomials for 3-strand knots in any symmetric and antisymmetric representations

    CERN Document Server

    Itoyama, H; Morozov, A; Morozov, An

    2012-01-01

    Character expansion expresses extended HOMFLY polynomials through traces of products of finite dimensional R- and Racah mixing matrices. We conjecture that the mixing matrices are expressed entirely in terms of the eigenvalues of the corresponding R-matrices. Even a weaker (and, perhaps, more reliable) version of this conjecture is sufficient to explicitly calculate HOMFLY polynomials for all the 3-strand braids in arbitrary (anti)symmetric representations. We list the examples of so obtained polynomials for V=[3] and V=[4], and they are in accordance with the known answers for torus and figure-eight knots, as well as for the colored special and Jones polynomials. This provides an indirect evidence in support of our conjecture.

  4. The application of polynomial chaos methods to a point kinetics model of MIPR: An Aqueous Homogeneous Reactor

    Energy Technology Data Exchange (ETDEWEB)

    Cooling, C.M., E-mail: c.cooling10@imperial.ac.uk [Imperial College of Science, Technology and Medicine (United Kingdom); Williams, M.M.R. [Imperial College of Science, Technology and Medicine (United Kingdom); Nygaard, E.T. [Babcock and Wilcox Technical Services Group (TSG) (United States); Eaton, M.D. [Imperial College of Science, Technology and Medicine (United Kingdom)

    2013-09-15

    Highlights: • A point kinetics model for the Medical Isotope Production Reactor is formulated. • Reactivity insertions are simulated using this model. • Polynomial chaos is used to simulate uncertainty in reactor parameters. • The computational efficiency of polynomial chaos is compared to that of Monte Carlo. -- Abstract: This paper models a conceptual Medical Isotope Production Reactor (MIPR) using a point kinetics model which is used to explore power excursions in the event of a reactivity insertion. The effect of uncertainty of key parameters is modelled using intrusive polynomial chaos. It is found that the system is stable against reactivity insertions and power excursions are all bounded and tend towards a new equilibrium state due to the negative feedbacks inherent in Aqueous Homogeneous Reactors (AHRs). The Polynomial Chaos Expansion (PCE) method is found to be much more computationally efficient than that of Monte Carlo simulation in this application.

  5. Online segmentation of time series based on polynomial least-squares approximations.

    Science.gov (United States)

    Fuchs, Erich; Gruber, Thiemo; Nitschke, Jiri; Sick, Bernhard

    2010-12-01

    The paper presents SwiftSeg, a novel technique for online time series segmentation and piecewise polynomial representation. The segmentation approach is based on a least-squares approximation of time series in sliding and/or growing time windows utilizing a basis of orthogonal polynomials. This allows the definition of fast update steps for the approximating polynomial, where the computational effort depends only on the degree of the approximating polynomial and not on the length of the time window. The coefficients of the orthogonal expansion of the approximating polynomial-obtained by means of the update steps-can be interpreted as optimal (in the least-squares sense) estimators for average, slope, curvature, change of curvature, etc., of the signal in the time window considered. These coefficients, as well as the approximation error, may be used in a very intuitive way to define segmentation criteria. The properties of SwiftSeg are evaluated by means of some artificial and real benchmark time series. It is compared to three different offline and online techniques to assess its accuracy and runtime. It is shown that SwiftSeg-which is suitable for many data streaming applications-offers high accuracy at very low computational costs. PMID:20975120

  6. Possible quantum algorithms for the Bollobas-Riordan-Tutte polynomial of a ribbon graph

    Science.gov (United States)

    Vélez, Mario; Ospina, Juan

    2008-04-01

    Three possible quantum algorithms, for the computation of the Bollobás-Riordan-Tutte polynomial of a given ribbon graph, are presented and discussed. The first possible algorithm is based on the spanning quasi-trees expansion for generalized Tutte polynomials of generalized graphs and on a quantum version of the Binary Decision Diagram (BDD) for quasi-trees . The second possible algorithm is based on the relation between the Kauffman bracket and the Tutte polynomial; and with an application of the recently introduced Aharonov-Arad-Eban-Landau quantum algorithm. The third possible algorithm is based on the relation between the HOMFLY polynomial and the Tutte polynomial; and with an application of the Wocjan-Yard quantum algorithm. It is claimed that these possible algorithms may be more efficient that the best known classical algorithms. These three algorithms may have interesting applications in computer science at general or in computational biology and bio-informatics in particular. A line for future research based on the categorification project is mentioned.

  7. Generalized Narayana Polynomials, Riordan Arrays and Lattice Paths

    OpenAIRE

    Barry, Paul; Hennessy, Aoife

    2012-01-01

    We study a family of polynomials in two variables, identifying them as the moments of a two-parameter family of orthogonal polynomials. The coefficient array of these orthogonal polynomials is shown to be an ordinary Riordan array. We express the generating function of the sequence of polynomials under study as a continued fraction, and determine the corresponding Hankel transform. An alternative characterization of the polynomials in terms of a related Riordan array is also given. This Riord...

  8. Wavelet approach to accelerator problems. 1: Polynomial dynamics

    International Nuclear Information System (INIS)

    This is the first part of a series of talks in which the authors present applications of methods from wavelet analysis to polynomial approximations for a number of accelerator physics problems. In the general case they have the solution as a multiresolution expansion in the base of compactly supported wavelet basis. The solution is parameterized by solutions of two reduced algebraical problems, one is nonlinear and the second is some linear problem, which is obtained from one of the next wavelet constructions: Fast Wavelet Transform, Stationary Subdivision Schemes, the method of Connection Coefficients. In this paper the authors consider the problem of calculation of orbital motion in storage rings. The key point in the solution of this problem is the use of the methods of wavelet analysis, relatively novel set of mathematical methods, which gives one a possibility to work with well-localized bases in functional spaces and with the general type of operators (including pseudodifferential) in such bases

  9. Uncertainty Analysis via Failure Domain Characterization: Polynomial Requirement Functions

    Science.gov (United States)

    Crespo, Luis G.; Munoz, Cesar A.; Narkawicz, Anthony J.; Kenny, Sean P.; Giesy, Daniel P.

    2011-01-01

    This paper proposes an uncertainty analysis framework based on the characterization of the uncertain parameter space. This characterization enables the identification of worst-case uncertainty combinations and the approximation of the failure and safe domains with a high level of accuracy. Because these approximations are comprised of subsets of readily computable probability, they enable the calculation of arbitrarily tight upper and lower bounds to the failure probability. A Bernstein expansion approach is used to size hyper-rectangular subsets while a sum of squares programming approach is used to size quasi-ellipsoidal subsets. These methods are applicable to requirement functions whose functional dependency on the uncertainty is a known polynomial. Some of the most prominent features of the methodology are the substantial desensitization of the calculations from the uncertainty model assumed (i.e., the probability distribution describing the uncertainty) as well as the accommodation for changes in such a model with a practically insignificant amount of computational effort.

  10. Solving the Frustrated Spherical Model with q-Polynomials

    CERN Document Server

    Cappelli, A P; Cappelli, Andrea; Colomo, Filippo

    1998-01-01

    We analyse the Spherical Model with frustration induced by an external gauge field. In infinite dimensions, this has been recently mapped onto a problem of q-deformed oscillators, whose real parameter q measures the frustration. We find the analytic solution of this model by suitably representing the q-oscillator algebra with q-Hermite polynomials. We also present a related Matrix Model which possesses the same diagrammatic expansion in the planar approximation. Its interaction potential is oscillating at infinity with period log(q), and may lead to interesting metastability phenomena beyond the planar approximation. The Spherical Model is similarly q-periodic, but does not exhibit such phenomena: actually its low-temperature phase is not glassy and depends smoothly on q.

  11. A new class of generalized polynomials associated with Hermite and Bernoulli polynomials

    Directory of Open Access Journals (Sweden)

    M. A. Pathan

    2015-05-01

    Full Text Available In this paper, we introduce a new class of generalized  polynomials associated with  the modified Milne-Thomson's polynomials Φ_{n}^{(α}(x,ν of degree n and order α introduced by  Derre and Simsek.The concepts of Bernoulli numbers B_n, Bernoulli polynomials  B_n(x, generalized Bernoulli numbers B_n(a,b, generalized Bernoulli polynomials  B_n(x;a,b,c of Luo et al, Hermite-Bernoulli polynomials  {_HB}_n(x,y of Dattoli et al and {_HB}_n^{(α} (x,y of Pathan  are generalized to the one   {_HB}_n^{(α}(x,y,a,b,c which is called  the generalized  polynomial depending on three positive real parameters. Numerous properties of these polynomials and some relationships between B_n, B_n(x, B_n(a,b, B_n(x;a,b,c and {}_HB_n^{(α}(x,y;a,b,c  are established. Some implicit summation formulae and general symmetry identities are derived by using different analytical means and applying generating functions. These results extend some known summations and identities of generalized Bernoulli numbers and polynomials

  12. Time-dependent generalized polynomial chaos

    International Nuclear Information System (INIS)

    Generalized polynomial chaos (gPC) has non-uniform convergence and tends to break down for long-time integration. The reason is that the probability density distribution (PDF) of the solution evolves as a function of time. The set of orthogonal polynomials associated with the initial distribution will therefore not be optimal at later times, thus causing the reduced efficiency of the method for long-time integration. Adaptation of the set of orthogonal polynomials with respect to the changing PDF removes the error with respect to long-time integration. In this method new stochastic variables and orthogonal polynomials are constructed as time progresses. In the new stochastic variable the solution can be represented exactly by linear functions. This allows the method to use only low order polynomial approximations with high accuracy. The method is illustrated with a simple decay model for which an analytic solution is available and subsequently applied to the three mode Kraichnan-Orszag problem with favorable results.

  13. NMR Quantum Calculations of the Jones Polynomial

    CERN Document Server

    Marx, Raimund; Kauffman, Louis; Lomonaco, Samuel; Spörl, Andreas; Pomplun, Nikolas; Myers, John; Glaser, Steffen J

    2009-01-01

    The repertoire of problems theoretically solvable by a quantum computer recently expanded to include the approximate evaluation of knot invariants, specifically the Jones polynomial. The experimental implementation of this evaluation, however, involves many known experimental challenges. Here we present experimental results for a small-scale approximate evaluation of the Jones Polynomial by nuclear-magnetic resonance (NMR), in addition we show how to escape from the limitations of NMR approaches that employ pseudo pure states. Specifically, we use two spin 1/2 nuclei of natural abundance chloroform and apply a sequence of unitary transforms representing the Trefoil Knot, the Figure Eight Knot and the Borromean Rings. After measuring the state of the molecule in each case, we are able to estimate the value of the Jones Polynomial for each of the knots.

  14. Quantum chaotic dynamics and random polynomials

    International Nuclear Information System (INIS)

    The distribution of roots of polynomials of high degree with random coefficients is investigated which, among others, appear naturally in the context of 'quantum chaotic dynamics'. It is shown that under quite general conditions their roots tend to concentrate near the unit circle in the complex plane. In order to further increase this tendency, the particular case of self-inverse random polynomials is studied, and it is shown that for them a finite portion of all roots lies exactly on the unit circle. Correlation functions of these roots are also computed analytically, and compared to the correlations of eigenvalues of random matrices. The problem of ergodicity of chaotic wavefunctions is also considered. Special attention is devoted to the role of symmetries in the distribution of roots of random polynomials. (author)

  15. Minimal residual method stronger than polynomial preconditioning

    Energy Technology Data Exchange (ETDEWEB)

    Faber, V.; Joubert, W.; Knill, E. [Los Alamos National Lab., NM (United States)] [and others

    1994-12-31

    Two popular methods for solving symmetric and nonsymmetric systems of equations are the minimal residual method, implemented by algorithms such as GMRES, and polynomial preconditioning methods. In this study results are given on the convergence rates of these methods for various classes of matrices. It is shown that for some matrices, such as normal matrices, the convergence rates for GMRES and for the optimal polynomial preconditioning are the same, and for other matrices such as the upper triangular Toeplitz matrices, it is at least assured that if one method converges then the other must converge. On the other hand, it is shown that matrices exist for which restarted GMRES always converges but any polynomial preconditioning of corresponding degree makes no progress toward the solution for some initial error. The implications of these results for these and other iterative methods are discussed.

  16. Polynomial Vector Fields in One Complex Variable

    DEFF Research Database (Denmark)

    Branner, Bodil

    In recent years Adrien Douady was interested in polynomial vector fields, both in relation to iteration theory and as a topic on their own. This talk is based on his work with Pierrette Sentenac, work of Xavier Buff and Tan Lei, and my own joint work with Kealey Dias.......In recent years Adrien Douady was interested in polynomial vector fields, both in relation to iteration theory and as a topic on their own. This talk is based on his work with Pierrette Sentenac, work of Xavier Buff and Tan Lei, and my own joint work with Kealey Dias....

  17. Sparse DOA estimation with polynomial rooting

    DEFF Research Database (Denmark)

    Xenaki, Angeliki; Gerstoft, Peter; Fernandez Grande, Efren

    2015-01-01

    Direction-of-arrival (DOA) estimation involves the localization of a few sources from a limited number of observations on an array of sensors. Thus, DOA estimation can be formulated as a sparse signal reconstruction problem and solved efficiently with compressive sensing (CS) to achieve...... highresolution imaging. Utilizing the dual optimal variables of the CS optimization problem, it is shown with Monte Carlo simulations that the DOAs are accurately reconstructed through polynomial rooting (Root-CS). Polynomial rooting is known to improve the resolution in several other DOA estimation methods...

  18. Incomplete Bivariate Fibonacci and Lucas -Polynomials

    Directory of Open Access Journals (Sweden)

    Dursun Tasci

    2012-01-01

    Full Text Available We define the incomplete bivariate Fibonacci and Lucas -polynomials. In the case =1, =1, we obtain the incomplete Fibonacci and Lucas -numbers. If =2, =1, we have the incomplete Pell and Pell-Lucas -numbers. On choosing =1, =2, we get the incomplete generalized Jacobsthal number and besides for =1 the incomplete generalized Jacobsthal-Lucas numbers. In the case =1, =1, =1, we have the incomplete Fibonacci and Lucas numbers. If =1, =1, =1, =⌊(−1/(+1⌋, we obtain the Fibonacci and Lucas numbers. Also generating function and properties of the incomplete bivariate Fibonacci and Lucas -polynomials are given.

  19. On the Waring problem for polynomial rings

    CERN Document Server

    Fröberg, Ralf; Shapiro, Boris

    2011-01-01

    In this note we discuss an analog of the classical Waring problem for C[x_0, x_1,...,x_n]. Namely, we show that a general homogeneous polynomial p \\in C[x_0,x_1,...,x_n] of degree divisible by k\\ge 2 can be represented as a sum of at most k^n k-th powers of homogeneous polynomials in C[x_0, x_1,...,x_n]. Noticeably, k^n coincides with the number obtained by naive dimension count.

  20. Error Minimization of Polynomial Approximation of Delta

    Indian Academy of Sciences (India)

    Islam Sana; Sadiq Muhammad; Qureshi Muhammad Shahid

    2008-09-01

    The difference between Universal time (UT) and Dynamical time (TD), known as Delta ( ) is tabulated for the first day of each year in the Astronomical Almanac. During the last four centuries it is found that there are large differences between its values for two consecutive years. Polynomial approximations have been developed to obtain the values of for any time of a year for the period AD 1620 to AD 2000 (Meeu 2000) as no dynamical theories describe the variations in . In this work, a new set of polynomials for is obtained for the period AD 1620 to AD 2007 that is found to produce better results compared to previous attempts.

  1. The chromatic polynomial and list colorings

    DEFF Research Database (Denmark)

    Thomassen, Carsten

    2009-01-01

    We prove that, if a graph has a list of k available colors at every vertex, then the number of list-colorings is at least the chromatic polynomial evaluated at k when k is sufficiently large compared to the number of vertices of the graph.......We prove that, if a graph has a list of k available colors at every vertex, then the number of list-colorings is at least the chromatic polynomial evaluated at k when k is sufficiently large compared to the number of vertices of the graph....

  2. Irreducible Cartesian tensor expansions of scalar fields

    International Nuclear Information System (INIS)

    It is shown how a scalar function V(parallel R + Σ/sub i equals 1/sup n/ a/sub i/parallel) of a sum of n + 1 vectors can be expanded as a multiple Cartesian tensor series in the vectors a/ sub i/. This expansion is a rearrangement of the multiple Taylor series expansion of such a function. In order to prove the fundamental theorem, generalized Cartesian Legendre polynomials are defined. The theorem is applied to the eigenfunctions of the Laplace operator and to inverse powers. The expansion of the latter type of function leads to forms involving generalized hypergeometric functions in several variables. As a special case, the Cartesian form of the multipole expansion of the electrostatic potential between two linear molecules is derived. A number of sum rules for hypergeometric functions and addition formulas for (standard and modified) spherical Bessel functions are proved by using a reduction property of the generalized Legendre polynomials. The case of the expansion of a tensorial function is also briefly discussed

  3. Five Constructions of Permutation Polynomials over $\\gf(q^2)$

    OpenAIRE

    Ding, Cunsheng; Yuan, Pingzhi

    2015-01-01

    Four recursive constructions of permutation polynomials over $\\gf(q^2)$ with those over $\\gf(q)$ are developed and applied to a few famous classes of permutation polynomials. They produce infinitely many new permutation polynomials over $\\gf(q^{2^\\ell})$ for any positive integer $\\ell$ with any given permutation polynomial over $\\gf(q)$. A generic construction of permutation polynomials over $\\gf(2^{2m})$ with o-polynomials over $\\gf(2^m)$ is also presented, and a number of new classes of per...

  4. Perturbations around the zeros of classical orthogonal polynomials

    CERN Document Server

    Sasaki, Ryu

    2014-01-01

    Starting from degree N solutions of a time dependent Schroedinger-like equation for classical orthogonal polynomials, a linear matrix equation describing perturbations around the N zeros of the polynomial is derived. The matrix has remarkable Diophantine properties. Its eigenvalues are independent of the zeros. The corresponding eigenvectors provide the representations of the lower degree (0,1,...,N-1) polynomials in terms of the zeros of the degree N polynomial. The results are valid universally for all the classical orthogonal polynomials, including the Askey scheme of hypergeometric orthogonal polynomials and its q-analogues.

  5. Perturbations around the zeros of classical orthogonal polynomials

    Science.gov (United States)

    Sasaki, Ryu

    2015-04-01

    Starting from degree N solutions of a time dependent Schrödinger-like equation for classical orthogonal polynomials, a linear matrix equation describing perturbations around the N zeros of the polynomial is derived. The matrix has remarkable Diophantine properties. Its eigenvalues are independent of the zeros. The corresponding eigenvectors provide the representations of the lower degree ( 0 , 1 , … , N - 1 ) polynomials in terms of the zeros of the degree N polynomial. The results are valid universally for all the classical orthogonal polynomials, including the Askey scheme of hypergeometric orthogonal polynomials and its q-analogues.

  6. Polynomial similarity transformation theory: A smooth interpolation between coupled cluster doubles and projected BCS applied to the reduced BCS Hamiltonian

    Science.gov (United States)

    Degroote, Matthias; Henderson, Thomas M.; Zhao, Jinmo; Dukelsky, Jorge; Scuseria, Gustavo E.

    2016-03-01

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

  7. Inclusion-exclusion polynomials with large coefficients

    OpenAIRE

    Bzdega, Bartlomiej

    2012-01-01

    We prove that for every positive integer $k$ there exist an inclusion-exclusion polynomial $Q_{\\{q_1,q_2,...,q_k\\}}$ with the height at least $c^{2^k}\\prod_{j=1}^{k-2}q_j^{2^{k-j-1}-1}$, where $c$ is a positive constant and $q_1

  8. Scalar Field Theories with Polynomial Shift Symmetries

    CERN Document Server

    Griffin, Tom; Horava, Petr; Yan, Ziqi

    2014-01-01

    We continue our study of naturalness in nonrelativistic QFTs of the Lifshitz type, focusing on scalar fields that can play the role of Nambu-Goldstone (NG) modes associated with spontaneous symmetry breaking. Such systems allow for an extension of the constant shift symmetry to a shift by a polynomial of degree $P$ in spatial coordinates. These "polynomial shift symmetries" in turn protect the technical naturalness of modes with a higher-order dispersion relation, and lead to a refinement of the proposed classification of infrared Gaussian fixed points available to describe NG modes in nonrelativistic theories. Generic interactions in such theories break the polynomial shift symmetry explicitly to the constant shift. It is thus natural to ask: Given a Gaussian fixed point with polynomial shift symmetry of degree $P$, what are the lowest-dimension operators that preserve this symmetry, and deform the theory into a self-interacting scalar field theory with the shift symmetry of degree $P$? To answer this (essen...

  9. Algebraic differential equations associated to some polynomials

    OpenAIRE

    Barlet, Daniel

    2013-01-01

    We compute the Gauss-Manin differential equation for any period of a polynomial in \\ $\\C[x_{0},\\dots, x_{n}]$ \\ with \\ $(n+2)$ \\ monomials. We give two general factorizations theorem in the algebra \\ $\\C$ \\ for such a differential equations.

  10. Nondimensional Simplification of Tensor Polynomials with Indices

    CERN Document Server

    Jaén, X

    1999-01-01

    We are presenting an algorithm capable of simplifying tensor polynomials withindices when the building tensors have index symmetry properties. Theseproperties include simple symmetry, cyclicity and those due to the presence ofcovariant derivatives. The algorithm is part of a Mathematica package calledTools of Tensor Calculus (TTC) [web address: http://baldufa.upc.es/ttc

  11. Quantum Hilbert matrices and orthogonal polynomials

    DEFF Research Database (Denmark)

    Andersen, Jørgen Ellegaard; Berg, Christian

    2009-01-01

    Using the notion of quantum integers associated with a complex number q≠0 , we define the quantum Hilbert matrix and various extensions. They are Hankel matrices corresponding to certain little q -Jacobi polynomials when |q|... of reciprocal Fibonacci numbers called Filbert matrices. We find a formula for the entries of the inverse quantum Hilbert matrix....

  12. Z-polynomials and ring commutativity

    OpenAIRE

    Buckley, S.M.; McHale, D.

    2012-01-01

    We characterise polynomials f with integer coefficients such that a ring with unity R is necessarily commutative if f(x) is central for all x Ɛ R. We also solve the corresponding problem without the assumption that the ring has a unity.

  13. Thermodynamic characterization of networks using graph polynomials

    Science.gov (United States)

    Ye, Cheng; Comin, César H.; Peron, Thomas K. DM.; Silva, Filipi N.; Rodrigues, Francisco A.; Costa, Luciano da F.; Torsello, Andrea; Hancock, Edwin R.

    2015-09-01

    In this paper, we present a method for characterizing the evolution of time-varying complex networks by adopting a thermodynamic representation of network structure computed from a polynomial (or algebraic) characterization of graph structure. Commencing from a representation of graph structure based on a characteristic polynomial computed from the normalized Laplacian matrix, we show how the polynomial is linked to the Boltzmann partition function of a network. This allows us to compute a number of thermodynamic quantities for the network, including the average energy and entropy. Assuming that the system does not change volume, we can also compute the temperature, defined as the rate of change of entropy with energy. All three thermodynamic variables can be approximated using low-order Taylor series that can be computed using the traces of powers of the Laplacian matrix, avoiding explicit computation of the normalized Laplacian spectrum. These polynomial approximations allow a smoothed representation of the evolution of networks to be constructed in the thermodynamic space spanned by entropy, energy, and temperature. We show how these thermodynamic variables can be computed in terms of simple network characteristics, e.g., the total number of nodes and node degree statistics for nodes connected by edges. We apply the resulting thermodynamic characterization to real-world time-varying networks representing complex systems in the financial and biological domains. The study demonstrates that the method provides an efficient tool for detecting abrupt changes and characterizing different stages in network evolution.

  14. Interpolation of Shifted-Lacunary Polynomials

    CERN Document Server

    Giesbrecht, Mark

    2008-01-01

    Given a "black box" function to evaluate an unknown rational polynomial f in Q[x] at points modulo a prime p, we exhibit algorithms to compute the representation of the polynomial in the sparsest shifted power basis. That is, we determine the sparsity t, the shift alpha, the exponents 0<=e1polynomial in the (sparse) representation size, log(alpha)+ sum_i(log|c_i|+log(e_i)) and in particular is logarithmic in deg(f). Our method combines previous celebrated results on sparse interpolation and computing sparsest shifts, and provides a way to handle polynomials with extremely high degree which are, in some sense, sparse in information.

  15. Cumulants, lattice paths, and orthogonal polynomials

    OpenAIRE

    Lehner, Franz

    2001-01-01

    A formula expressing free cumulants in terms of the Jacobi parameters of the corresponding orthogonal polynomials is derived. It combines Flajolet's theory of continued fractions and Lagrange inversion. For the converse we discuss Gessel-Viennot theory to express Hankel determinants in terms of various cumulants.

  16. Algebraic polynomial system solving and applications

    NARCIS (Netherlands)

    Bleylevens, I.W.M.

    2010-01-01

    The problem of computing the solutions of a system of multivariate polynomial equations can be approached by the Stetter-Möller matrix method which casts the problem into a large eigenvalue problem. This Stetter-Möller matrix method forms the starting point for the development of computational proce

  17. Polynomial stabilization of some dissipative hyperbolic systems

    Czech Academy of Sciences Publication Activity Database

    Ammari, K.; Feireisl, Eduard; Nicaise, S.

    2014-01-01

    Roč. 34, č. 11 (2014), s. 4371-4388. ISSN 1078-0947 R&D Projects: GA ČR GA201/09/0917 Institutional support: RVO:67985840 Keywords : exponential stability * polynomial stability * observability inequality Subject RIV: BA - General Mathematics Impact factor: 0.826, year: 2014 http://www.aimsciences.org/journals/displayArticlesnew.jsp?paperID=9924

  18. Indecomposability of polynomials via Jacobian matrix

    International Nuclear Information System (INIS)

    Uni-multivariate decomposition of polynomials is a special case of absolute factorization. Recently, thanks to the Ruppert's matrix some effective results about absolute factorization have been improved. Here we show that with a jacobian matrix we can get sharper bounds for the special case of uni-multivariate decomposition. (author)

  19. Ideals in Polynomial Near-rings

    Institute of Scientific and Technical Information of China (English)

    Mark Farag

    2002-01-01

    In this paper, we further explore the relationship between the ideals of N and those of N[x], where N is a zero-symmetric right near-ring with identity and N[x] is the polynomial near-ring introduced by Bagley in 1993.

  20. Function approximation with polynomial regression slines

    International Nuclear Information System (INIS)

    Principles of the polynomial regression splines as well as algorithms and programs for their computation are presented. The programs prepared using software package MATLAB are generally intended for approximation of the X-ray spectra and can be applied in the multivariate calibration of radiometric gauges. (author)

  1. Leading log expansion of combinatorial Dyson Schwinger equations

    CERN Document Server

    Delage, Lucas

    2016-01-01

    We study combinatorial Dyson Schwinger equations, expressed in the Hopf algebra of words with a quasi shuffle product. We map them into an algebra of polynomials in one indeterminate L and show that the leading log expansion one obtains with such a mapping are simple power law like expression

  2. Zero bias transformation and asymptotic expansions II : the Poisson case

    OpenAIRE

    Jiao, Ying

    2009-01-01

    We apply a discrete version of the methodology in \\cite{gauss} to obtain a recursive asymptotic expansion for $\\esp[h(W)]$ in terms of Poisson expectations, where $W$ is a sum of independent integer-valued random variables and $h$ is a polynomially growing function. We also discuss the remainder estimations.

  3. All-order asymptotics of hyperbolic knot invariants from non-perturbative topological recursion of A-polynomials

    CERN Document Server

    Borot, Gaëtan

    2012-01-01

    We propose a conjecture to compute the all-order asymptotic expansion of the colored Jones polynomial of the complement of a hyperbolic knot, J_N(q = exp(2u/N)) when N goes to infinity. Our conjecture claims that the asymptotic expansion of the colored Jones polynomial is a the formal wave function of an integrable system whose semiclassical spectral curve S would be the SL_2(C) character variety of the knot (the A-polynomial), and is formulated in the framework of the topological recursion. It takes as starting point the proposal made recently by Dijkgraaf, Fuji and Manabe (who kept only the perturbative part of the wave function, and found some discrepancies), but it also contains the non-perturbative parts, and solves the discrepancy problem. These non-perturbative corrections are derivatives of Theta functions associated to S, but the expansion is still in powers of 1/N due to the special properties of A-polynomials. We provide a detailed check for the figure-eight knot and the once-punctured torus bundle...

  4. On an Inequality Concerning the Polar Derivative of a Polynomial

    Indian Academy of Sciences (India)

    A Aziz; N A Rather

    2007-08-01

    In this paper, we present a correct proof of an -inequality concerning the polar derivative of a polynomial with restricted zeros. We also extend Zygmund’s inequality to the polar derivative of a polynomial.

  5. Representations of Knot Groups and Twisted Alexander Polynomials

    Institute of Scientific and Technical Information of China (English)

    Xiao Song LIN

    2001-01-01

    We present a twisted version of the Alexander polynomial associated with a matrix representation of the knot group. Examples of two knots with the same Alexander module but differenttwisted Alexander polynomials are given.

  6. Self-dual Koornwinder-MacDonald polynomials

    CERN Document Server

    Van Diejen, J F

    1995-01-01

    We prove certain duality properties and present recurrence relations for a four-parameter family of self-dual Koornwinder-Macdonald polynomials. The recurrence relations are used to verify Macdonald's normalization conjectures for these polynomials.

  7. Irreducibility Results for Compositions of Polynomials in Several Variables

    Indian Academy of Sciences (India)

    Anca Iuliana Bonciocat; Alexandru Zaharescu

    2005-05-01

    We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions of polynomials.

  8. Remarks on Homogeneous Al-Salam and Carlitz Polynomials

    OpenAIRE

    Jian-Ping Fang

    2014-01-01

    Several multilinear generating functions of the homogeneous Al-Salam and Carlitz polynomials are derived from q-operator. In addition, two interesting relationships of product of this kind of polynomials are obtained.

  9. Identities involving Bessel polynomials arising from linear differential equations

    OpenAIRE

    Kim, Taekyun; Kim, Dae San

    2016-01-01

    In this paper, we study linear di?erential equations arising from Bessel polynomials and their applications. From these linear differential equations, we give some new and explicit identities for Bessel polynomials.

  10. Double beta decay to the first $2^+$ state within a boson expansion formalism with a projected spherical single particle basis

    CERN Document Server

    Raduta, A A

    2007-01-01

    The Gamow-Teller transition operator is written as a polynomial in the dipole proton-neutron and quadrupole charge conserving QRPA boson operators, using the prescription of the boson expansion technique of Belyaev-Zelevinski type. Then, the $2\

  11. On the optimal polynomial approximation of stochastic PDEs by galerkin and collocation methods

    KAUST Repository

    Beck, Joakim

    2012-09-01

    In this work we focus on the numerical approximation of the solution u of a linear elliptic PDE with stochastic coefficients. The problem is rewritten as a parametric PDE and the functional dependence of the solution on the parameters is approximated by multivariate polynomials. We first consider the stochastic Galerkin method, and rely on sharp estimates for the decay of the Fourier coefficients of the spectral expansion of u on an orthogonal polynomial basis to build a sequence of polynomial subspaces that features better convergence properties, in terms of error versus number of degrees of freedom, than standard choices such as Total Degree or Tensor Product subspaces. We consider then the Stochastic Collocation method, and use the previous estimates to introduce a new class of Sparse Grids, based on the idea of selecting a priori the most profitable hierarchical surpluses, that, again, features better convergence properties compared to standard Smolyak or tensor product grids. Numerical results show the effectiveness of the newly introduced polynomial spaces and sparse grids. © 2012 World Scientific Publishing Company.

  12. Best polynomial degree reduction on q-lattices with applications to q-orthogonal polynomials

    KAUST Repository

    Ait-Haddou, Rachid

    2015-06-07

    We show that a weighted least squares approximation of q-Bézier coefficients provides the best polynomial degree reduction in the q-L2-norm. We also provide a finite analogue of this result with respect to finite q-lattices and we present applications of these results to q-orthogonal polynomials. © 2015 Elsevier Inc. All rights reserved.

  13. New results on permutation polynomials over finite fields

    OpenAIRE

    Ma, Jingxue; Zhang, Tao; Feng, Tao; Ge, Gennian

    2015-01-01

    Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, four classes of monomial complete permutation polynomials and one class of trinomial complete permutation polynomials are presented, one of which confirms a conjecture proposed by Wu et al. (Sci. China Math., to appear. Doi: 10.1007/s11425-014-4964-2). Furthermore, we give two classes of trinomial permutation polynomials, and make some pr...

  14. Some Systems of Multivariable Orthogonal q-Racah polynomials

    OpenAIRE

    Gasper, George; Rahman, Mizan

    2004-01-01

    In 1991 Tratnik derived two systems of multivariable orthogonal Racah polynomials and considered their limit cases. q-Extensions of these systems are derived, yielding systems of multivariable orthogonal q-Racah polynomials, from which systems of multivariable orthogonal q-Hahn, dual q-Hahn, q-Krawtchouk, q-Meixner, and q-Charlier polynomials follow as special or limit cases.

  15. On the Lorentz degree of a product of polynomials

    KAUST Repository

    Ait-Haddou, Rachid

    2015-01-01

    In this note, we negatively answer two questions of T. Erdélyi (1991, 2010) on possible lower bounds on the Lorentz degree of product of two polynomials. We show that the correctness of one question for degree two polynomials is a direct consequence of a result of Barnard et al. (1991) on polynomials with nonnegative coefficients.

  16. Further Results on Permutation Polynomials over Finite Fields

    OpenAIRE

    Yuan, Pingzhi; Ding, Cunsheng

    2013-01-01

    Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a demonstration of the theorems, we present a number of classes of explicit permutation polynomials on $\\gf_q$.

  17. Universality for polynomial invariants on ribbon graphs with flags

    OpenAIRE

    Avohou, Remi C.; Geloun, Joseph Ben; Hounkonnou , Mahouton N.

    2013-01-01

    In this paper, we analyze the Bollobas and Riordan polynomial for ribbon graphs with flags introduced in arXiv:1301.1987 and prove its universality. We also show that this polynomial can be defined on some equivalence classes of ribbon graphs involving flag moves and that the new polynomial is still universal on these classes.

  18. On conformal measures for infinitely renormalizable quadratic polynomials

    Institute of Scientific and Technical Information of China (English)

    HUANG Zhiyong; JIANG Yunping; WANG Yuefei

    2005-01-01

    We study a conformal measure for an infinitely renormalizable quadratic polynomial. We prove that the conformal measure is ergodic if the polynomial is unbranched and has complex bounds. The main technique we use in the proof is the three-dimensional puzzle for an infinitely renormalizable quadratic polynomial.

  19. Probabilistic aspects of Al-Salam-Chihara polynomials

    OpenAIRE

    Bryc, Wlodzimierz; Matysiak, Wojciech; Szablowski, Pawel J.

    2003-01-01

    We solve the connection coefficient problem between the Al-Salam-Chihara polynomials and the q-Hermite polynomials, and we use the resulting identity to answer a question from probability theory. We also derive the distribution of some Al-Salam-Chihara polynomials, and compute determinants of related Hankel matrices.

  20. Moments for Generating Functions of Al-Salam-Carlitz Polynomials

    OpenAIRE

    Jian Cao

    2012-01-01

    We employ the moment representations for Al-Salam-Carlitz polynomials and show how to deduce bilinear, trilinear, and multilinear generating functions for Al-Salam-Carlitz polynomials. Moreover, we obtain two terminating generating functions for Al-Salam-Carlitz polynomials by the method of moments.

  1. Some advances in tensor analysis and polynomial optimization

    OpenAIRE

    Li, Zhening; Ling, Chen; Wang, Yiju; Yang, Qingzhi

    2014-01-01

    Tensor analysis (also called as numerical multilinear algebra) mainly includes tensor decomposition, tensor eigenvalue theory and relevant algorithms. Polynomial optimization mainly includes theory and algorithms for solving optimization problems with polynomial objects functions under polynomial constrains. This survey covers the most of recent advances in these two fields. For tensor analysis, we introduce some properties and algorithms concerning the spectral radius of nonnegative tensors'...

  2. A Determinant Expression for the Generalized Bessel Polynomials

    OpenAIRE

    Sheng-liang Yang; Sai-nan Zheng

    2013-01-01

    Using the exponential Riordan arrays, we show that a variation of the generalized Bessel polynomial sequence is of Sheffer type, and we obtain a determinant formula for the generalized Bessel polynomials. As a result, the Bessel polynomial is represented as determinant the entries of which involve Catalan numbers.

  3. Polynomial approximations of a class of stochastic multiscale elasticity problems

    Science.gov (United States)

    Hoang, Viet Ha; Nguyen, Thanh Chung; Xia, Bingxing

    2016-06-01

    We consider a class of elasticity equations in {mathbb{R}^d} whose elastic moduli depend on n separated microscopic scales. The moduli are random and expressed as a linear expansion of a countable sequence of random variables which are independently and identically uniformly distributed in a compact interval. The multiscale Hellinger-Reissner mixed problem that allows for computing the stress directly and the multiscale mixed problem with a penalty term for nearly incompressible isotropic materials are considered. The stochastic problems are studied via deterministic problems that depend on a countable number of real parameters which represent the probabilistic law of the stochastic equations. We study the multiscale homogenized problems that contain all the macroscopic and microscopic information. The solutions of these multiscale homogenized problems are written as generalized polynomial chaos (gpc) expansions. We approximate these solutions by semidiscrete Galerkin approximating problems that project into the spaces of functions with only a finite number of N gpc modes. Assuming summability properties for the coefficients of the elastic moduli's expansion, we deduce bounds and summability properties for the solutions' gpc expansion coefficients. These bounds imply explicit rates of convergence in terms of N when the gpc modes used for the Galerkin approximation are chosen to correspond to the best N terms in the gpc expansion. For the mixed problem with a penalty term for nearly incompressible materials, we show that the rate of convergence for the best N term approximation is independent of the Lamé constants' ratio when it goes to {infty}. Correctors for the homogenization problem are deduced. From these we establish correctors for the solutions of the parametric multiscale problems in terms of the semidiscrete Galerkin approximations. For two-scale problems, an explicit homogenization error which is uniform with respect to the parameters is deduced. Together

  4. Polynomial threshold functions and Boolean threshold circuits

    DEFF Research Database (Denmark)

    Hansen, Kristoffer Arnsfelt; Podolskii, Vladimir V.

    2013-01-01

    secondary interest. We show that PTFs on general Boolean domains are tightly connected to depth two threshold circuits. Our main results in regard to this connection are: PTFs of polynomial length and polynomial degree compute exactly the functions computed by THRMAJ circuits. An exponential length lower...... bound for PTFs that holds regardless of degree, thereby extending known lower bounds for THRMAJ circuits. We generalize two-party unbounded error communication complexity to the multi-party number-on-the-forehead setting, and show that communication lower bounds for 3-player protocols would yield size...... lower bounds for THRTHR circuits. We obtain several other results about PTFs. These include relationships between weight and degree of PTFs, and a degree lower bound for PTFs of constant length. We also consider a variant of PTFs over the max-plus algebra. We show that they are connected to PTFs over...

  5. Venereau polynomials and related fiber bundles

    OpenAIRE

    Kaliman, Shulim; ZAIDENBERG, MIKHAIL

    2003-01-01

    The Venereau polynomials v-n:=y+x^n(xz+y(yu+z^2)), n>= 1, on A4 have all fibers isomorphic to the affine space A3. Moreover, for all n>= 1 the map (v-n, x) : A4 -> A2 yields a flat family of affine planes over A2. In the present note we show that over the punctured plane A2\\0, this family is a fiber bundle. This bundle is trivial if and only if v-n is a variable of the ring C[x][y,z,u] over C[x]. It is an open question whether v1 and v2 are variables of the polynomial ring C[x,y,z,u]. S. Vene...

  6. Tabulating knot polynomials for arborescent knots

    CERN Document Server

    Mironov, A; Morozov, An; Sleptsov, A; Ramadevi, P; Singh, Vivek Kumar

    2016-01-01

    Arborescent knots are the ones which can be represented in terms of double fat graphs or equivalently as tree Feynman diagrams. This is the class of knots for which the present knowledge is enough for lifting topological description to the level of effective analytical formulas. The paper describes the origin and structure of the new tables of colored knot polynomials, which will be posted at the dedicated site. Even if formal expressions are known in terms of modular transformation matrices, the computation in finite time requires additional ideas. We use the "family" approach, and apply it to arborescent knots in Rolfsen table by developing a Feynman diagram technique, associated with an auxiliary matrix model field theory. Gauge invariance in this theory helps to provide meaning to Racah matrices in the case of non-trivial multiplicities and explains the need for peculiar sign prescriptions in the calculation of [21]-colored HOMFLY polynomials.

  7. On computing factors of cyclotomic polynomials

    Science.gov (United States)

    Brent, Richard P.

    1993-07-01

    For odd square-free n > 1 the cyclotomic polynomial {Φ_n}(x) satisfies the identity of Gauss, 4{Φ_n}(x) = A_n^2 - {( - 1)^{(n - 1)/2}}nB_n^2. A similar identity of Aurifeuille, Le Lasseur, and Lucas is {Φ_n}({( - 1)^{(n - 1)/2}}x) = C_n^2 - nxD_n^2 or, in the case that n is even and square-free, ± {Φ_{n/2}}( - {x^2}) = C_n^2 - nxD_n^2. Here, {A_n}(x), ldots ,{D_n}(x) are polynomials with integer coefficients. We show how these coefficients can be computed by simple algorithms which require O({n^2}) arithmetic operations and work over the integers. We also give explicit formulae and generating functions for {A_n}(x), ldots ,{D_n}(x) , and illustrate the application to integer factorization with some numerical examples.

  8. Zernike polynomials for photometric characterization of LEDs

    International Nuclear Information System (INIS)

    We propose a method based on Zernike polynomials to characterize photometric quantities and descriptors of light emitting diodes (LEDs) from measurements of the angular distribution of the luminous intensity, such as total luminous flux, BA, inhomogeneity, anisotropy, direction of the optical axis and Lambertianity of the source. The performance of this method was experimentally tested for 18 high-power LEDs from different manufacturers and with different photometric characteristics. A small set of Zernike coefficients can be used to calculate all the mentioned photometric quantities and descriptors. For applications not requiring a great accuracy such as those of lighting design, the angular distribution of the luminous intensity of most of the studied LEDs can be interpolated with only two Zernike polynomials. (paper)

  9. Polynomial Operators on Classes of Regular Languages

    Science.gov (United States)

    Klíma, Ondřej; Polák, Libor

    We assign to each positive variety mathcal V and each natural number k the class of all (positive) Boolean combinations of the restricted polynomials, i.e. the languages of the form L_0a_1 L_1a_2dots a_ell L_ell, text{ where } ell≤ k, a 1,...,a ℓ are letters and L 0,...,L ℓ are languages from the variety mathcal V. For this polynomial operator we give a certain algebraic counterpart which works with identities satisfied by syntactic (ordered) monoids of languages considered. We also characterize the property that a variety of languages is generated by a finite number of languages. We apply our constructions to particular examples of varieties of languages which are crucial for a certain famous open problem concerning concatenation hierarchies.

  10. On Polynomial Sized MDP Succinct Policies

    CERN Document Server

    Liberatore, P

    2011-01-01

    Policies of Markov Decision Processes (MDPs) determine the next action to execute from the current state and, possibly, the history (the past states). When the number of states is large, succinct representations are often used to compactly represent both the MDPs and the policies in a reduced amount of space. In this paper, some problems related to the size of succinctly represented policies are analyzed. Namely, it is shown that some MDPs have policies that can only be represented in space super-polynomial in the size of the MDP, unless the polynomial hierarchy collapses. This fact motivates the study of the problem of deciding whether a given MDP has a policy of a given size and reward. Since some algorithms for MDPs work by finding a succinct representation of the value function, the problem of deciding the existence of a succinct representation of a value function of a given size and reward is also considered.

  11. General Linearized Polynomial Interpolation and Its Applications

    CERN Document Server

    Xie, Hongmei; Suter, Bruce W

    2011-01-01

    In this paper, we first propose a general interpolation algorithm in a free module of a linearized polynomial ring, and then apply this algorithm to decode several important families of codes, Gabidulin codes, KK codes and MV codes. Our decoding algorithm for Gabidulin codes is different from the polynomial reconstruction algorithm by Loidreau. When applied to decode KK codes, our interpolation algorithm is equivalent to the Sudan-style list-1 decoding algorithm proposed by K/"otter and Kschischang for KK codes. The general interpolation approach is also capable of solving the interpolation problem for the list decoding of MV codes proposed by Mahdavifar and Vardy, and has a lower complexity than solving linear equations.

  12. Line Complexity Asymptotics of Polynomial Cellular Automata

    OpenAIRE

    Stone, Bertrand

    2016-01-01

    Cellular automata are discrete dynamical systems that consist of patterns of symbols on a grid, which change according to a locally determined transition rule. In this paper, we will consider cellular automata that arise from polynomial transition rules, where the symbols in the automaton are integers modulo some prime $p$. We are principally concerned with the asymptotic behavior of the line complexity sequence $a_T(k)$, which counts, for each $k$, the number of coefficient strings of length...

  13. Block Toeplitz methods in polynomial matrix computations

    Czech Academy of Sciences Publication Activity Database

    Zuniga, J. C.; Henrion, Didier

    Leuven: Kathlolieke Universiteit, 2004 - (de Moor, B.; Motmans, B.; Willems, J.), s. 1-7 ISBN 90-5682-517-8. [MTNS 2004 /16./. Leuven (BE), 05.07.2004-09.07.2004] R&D Projects: GA ČR GA102/02/0709 Institutional research plan: CEZ:AV0Z1075907 Keywords : polynomial matrices * numerical linear algebra * computer - aided control system design Subject RIV: BC - Control Systems Theory

  14. Pure Imaginary Roots of Quaternion Standard Polynomials

    OpenAIRE

    Chapman, Adam

    2011-01-01

    In this paper, we present a new method for solving standard quaternion equations. Using this method we reobtain the known formulas for the solution of a quadratic quaternion equation, and provide an explicit solution for the cubic quaternion equation, as long as the equation has at least one pure imaginary root. We also discuss the number of essential pure imaginary roots of a two-sided quaternion polynomial.

  15. Polynomial approximation of functions in Sobolev spaces

    Science.gov (United States)

    Dupont, T.; Scott, R.

    1980-01-01

    Constructive proofs and several generalizations of approximation results of J. H. Bramble and S. R. Hilbert are presented. Using an averaged Taylor series, we represent a function as a polynomial plus a remainder. The remainder can be manipulated in many ways to give different types of bounds. Approximation of functions in fractional order Sobolev spaces is treated as well as the usual integer order spaces and several nonstandard Sobolev-like spaces.

  16. Real meromorphic functions and linear differential polynomials

    Institute of Scientific and Technical Information of China (English)

    LANGLEY; J.; K.

    2010-01-01

    We determine all real meromorphic functions f in the plane such that f has finitely many zeros, the poles of f have bounded multiplicities, and f and F have finitely many non-real zeros, where F is a linear differential polynomial given by F = f (k) +Σk-1j=0ajf(j) , in which k≥2 and the coefficients aj are real numbers with a0≠0.

  17. Moments, positive polynomials and their applications

    CERN Document Server

    Lasserre, Jean Bernard

    2009-01-01

    Many important applications in global optimization, algebra, probability and statistics, applied mathematics, control theory, financial mathematics, inverse problems, etc. can be modeled as a particular instance of the Generalized Moment Problem (GMP) . This book introduces a new general methodology to solve the GMP when its data are polynomials and basic semi-algebraic sets. This methodology combines semidefinite programming with recent results from real algebraic geometry to provide a hierarchy of semidefinite relaxations converging to the desired optimal value. Applied on appropriate cones,

  18. Completeness of the ring of polynomials

    DEFF Research Database (Denmark)

    Thorup, Anders

    2015-01-01

    Consider the polynomial ring R:=k[X1,…,Xn]R:=k[X1,…,Xn] in n≥2n≥2 variables over an uncountable field k. We prove that R   is complete in its adic topology, that is, the translation invariant topology in which the non-zero ideals form a fundamental system of neighborhoods of 0. In addition we pro...

  19. Products of Random Matrices from Polynomial Ensembles

    OpenAIRE

    Kieburg, Mario; Kösters, Holger

    2016-01-01

    Very recently we have shown that the spherical transform is a convenient tool for studying the relation between the joint density of the singular values and that of the eigenvalues for bi-unitarily invariant random matrices. In the present work we discuss the implications of these results for products of random matrices. In particular, we derive a transformation formula for the joint densities of a product of two independent bi-unitarily invariant random matrices, the first from a polynomial ...

  20. Reverse-engineering of polynomial dynamical systems

    OpenAIRE

    Jarrah, Abdul Salam; Laubenbacher, Reinhard; Stigler, Brandilyn; Stillman, Michael

    2006-01-01

    Multivariate polynomial dynamical systems over finite fields have been studied in several contexts, including engineering and mathematical biology. An important problem is to construct models of such systems from a partial specification of dynamic properties, e.g., from a collection of state transition measurements. Here, we consider static models, which are directed graphs that represent the causal relationships between system variables, so-called wiring diagrams. This paper contains an algo...

  1. Detecting Prime Numbers via Roots of Polynomials

    Science.gov (United States)

    Dobbs, David E.

    2012-01-01

    It is proved that an integer n [greater than or equal] 2 is a prime (resp., composite) number if and only if there exists exactly one (resp., more than one) nth-degree monic polynomial f with coefficients in Z[subscript n], the ring of integers modulo n, such that each element of Z[subscript n] is a root of f. This classroom note could find use in…

  2. Polynomial chaos representation of a stochastic preconditioner

    OpenAIRE

    Desceliers, Christophe; Ghanem, R; Soize, Christian

    2005-01-01

    A method is developed in this paper to accelerate the convergence in computing the solution of stochastic algebraic systems of equations. The method is based on computing, via statistical sampling, a polynomial chaos decomposition of a stochastic preconditioner to the system of equations. This preconditioner can subsequently be used in conjunction with either chaos representations of the solution or with approaches based on Monte Carlo sampling. In addition to presenting the supporting theory...

  3. A Deterministic and Polynomial Modified Perceptron Algorithm

    Directory of Open Access Journals (Sweden)

    Olof Barr

    2006-01-01

    Full Text Available We construct a modified perceptron algorithm that is deterministic, polynomial and also as fast as previous known algorithms. The algorithm runs in time O(mn3lognlog(1/ρ, where m is the number of examples, n the number of dimensions and ρ is approximately the size of the margin. We also construct a non-deterministic modified perceptron algorithm running in timeO(mn2lognlog(1/ρ.

  4. HOMFLY polynomials in representation [3,1] for 3-strand braids

    CERN Document Server

    Mironov, A; Morozov, An; Sleptsov, A

    2016-01-01

    This paper is a new step in the project of systematic description of colored knot polynomials started in arXiv:1506.00339. In this paper, we managed to explicitly find the inclusive Racah matrix, i.e. the whole set of mixing matrices in channels R^3->Q with all possible Q, for R=[3,1]. The calculation is made possible by the use of a newly-developed efficient highest-weight method, still it remains tedious. The result allows one to evaluate and investigate [3,1]-colored polynomials for arbitrary 3-strand knots, and this confirms many previous conjectures on various factorizations, universality, and differential expansions. We consider in some detail the next-to-twist-knots three-strand family (n,-1|1,-1) and deduce its colored HOMFLY. Also confirmed and clarified is the eigenvalue hypothesis for the Racah matrices, which promises to provide a shortcut to generic formulas for arbitrary representations.

  5. Bounding the Failure Probability Range of Polynomial Systems Subject to P-box Uncertainties

    Science.gov (United States)

    Crespo, Luis G.; Kenny, Sean P.; Giesy, Daniel P.

    2012-01-01

    This paper proposes a reliability analysis framework for systems subject to multiple design requirements that depend polynomially on the uncertainty. Uncertainty is prescribed by probability boxes, also known as p-boxes, whose distribution functions have free or fixed functional forms. An approach based on the Bernstein expansion of polynomials and optimization is proposed. In particular, we search for the elements of a multi-dimensional p-box that minimize (i.e., the best-case) and maximize (i.e., the worst-case) the probability of inner and outer bounding sets of the failure domain. This technique yields intervals that bound the range of failure probabilities. The offset between this bounding interval and the actual failure probability range can be made arbitrarily tight with additional computational effort.

  6. On progress of the solution of the stationary 2-dimensional neutron diffusion equation: a polynomial approximation method with error analysis

    Energy Technology Data Exchange (ETDEWEB)

    Ceolin, C., E-mail: celina.ceolin@gmail.com [Universidade Federal de Santa Maria (UFSM), Frederico Westphalen, RS (Brazil). Centro de Educacao Superior Norte; Schramm, M.; Bodmann, B.E.J.; Vilhena, M.T., E-mail: celina.ceolin@gmail.com [Universidade Federal do Rio Grande do Sul (UFRGS), Porto Alegre, RS (Brazil). Programa de Pos-Graduacao em Engenharia Mecanica

    2015-07-01

    Recently the stationary neutron diffusion equation in heterogeneous rectangular geometry was solved by the expansion of the scalar fluxes in polynomials in terms of the spatial variables (x; y), considering the two-group energy model. The focus of the present discussion consists in the study of an error analysis of the aforementioned solution. More specifically we show how the spatial subdomain segmentation is related to the degree of the polynomial and the Lipschitz constant. This relation allows to solve the 2-D neutron diffusion problem for second degree polynomials in each subdomain. This solution is exact at the knots where the Lipschitz cone is centered. Moreover, the solution has an analytical representation in each subdomain with supremum and infimum functions that shows the convergence of the solution. We illustrate the analysis with a selection of numerical case studies. (author)

  7. Polynomial sequences for bond percolation critical thresholds

    International Nuclear Information System (INIS)

    In this paper, I compute the inhomogeneous (multi-probability) bond critical surfaces for the (4, 6, 12) and (34, 6) lattices using the linearity approximation described in Scullard and Ziff (2010 J. Stat. Mech. P03021), implemented as a branching process of lattices. I find the estimates for the bond percolation thresholds, pc(4, 6, 12) = 0.693 778 49... and pc(34, 6) = 0.434 370 77..., to be compared with Parviainen's numerical results of pc≈0.693 733 83 and 0.434 306 21 (Parviainen, 2007 J. Phys. A: Math. Theor. 40 9253). These deviations are of the order of 10−5, as is standard for this method, although they are larger than Parviainen's typical standard error of 10−7. Deriving thresholds in this way for a given lattice leads to a polynomial with integer coefficients, whose root in [0, 1] gives the estimate for the bond threshold. I show how the method can be refined, leading to a sequence of higher-order polynomials giving predictions that probably converge to the exact answer. Finally, I discuss how this fact hints that for certain graphs, such as the kagome lattice, the exact bond threshold may not be the root of any polynomial with integer coefficients

  8. A homological study of Green polynomials

    CERN Document Server

    Kato, Syu

    2011-01-01

    We interpret the orthogonality relation of Kostka polynomials arising from complex reflection groups (c.f. [Shoji, Invent. Math. 74 (1983), J. Algebra 245 (2001)] and [Lusztig, Adv. Math. 61 (1986)]) in terms of homological algebra. This leads us to the notion of Kostka system, which can be seen as a categorical counter-part of Kostka polynomials. Then, we show that every generalized Springer correspondence (in good characteristic) (c.f. [Lusztig, Invent. Math. 75 (1984)]) gives rise to a Kostka system. This enables us to see the top-term generation property of the homology of generalized Springer fibers, and the transition formula of Kostka polynomials between two generalized Springer correspondences of type $\\mathsf{BC}$. The latter enhances one of the main results from [Ciubotaru-Kato-K, Invent. Math., to appear] to its graded version. In the appendix, we present a purely algebraic proof that a Kostka system exists for type $\\mathsf{A}$, and therefore one can skip geometric sections \\S 3--5 to see the key ...

  9. The bivariate Rogers-Szegoe polynomials

    International Nuclear Information System (INIS)

    We present an operator approach to deriving Mehler's formula and the Rogers formula for the bivariate Rogers-Szegoe polynomials hn(x, y vertical bar q). The proof of Mehler's formula can be considered as a new approach to the nonsymmetric Poisson kernel formula for the continuous big q-Hermite polynomials Hn(x; a vertical bar q) due to Askey, Rahman and Suslov. Mehler's formula for hn(x, y vertical bar q) involves a 3Φ2 sum and the Rogers formula involves a 2Φ1 sum. The proofs of these results are based on parameter augmentation with respect to the q-exponential operator and the homogeneous q-shift operator in two variables. By extending recent results on the Rogers-Szegoe polynomials hn(x vertical bar q) due to Hou, Lascoux and Mu, we obtain another Rogers-type formula for hn(x, y vertical bar q). Finally, we give a change of base formula for Hn(x; a vertical bar q) which can be used to evaluate some integrals by using the Askey-Wilson integral

  10. Characteristic polynomials of pseudo-Anosov maps

    CERN Document Server

    Birman, Joan; Kawamuro, Keiko

    2010-01-01

    We study the relationship between three different approaches to the action of a pseudo-Anosov mapping class $[F]$ on a surface: the original theorem of Thurston, its algorithmic proof by Bestvina-Handel, and related investigations of Penner-Harer. Bestvina and Handel represent $[F]$ as a suitably chosen homotopy equivalence $f: G\\to G$ of a finite graph, with an associated transition matrix $T$ whose largest eigenvalue is the dilatation of $[F]$. Extending a skew-symmetric form introduced by Penner and Harer to the setting of Bestvina and Handel, we show that the characteristic polynomial of $T$ is a monic and palindromic or anti-palindromic polynomial, possibly multiplied by a power of $x$. Moreover, it factors as a product of three polynomials. One of them reflects the action of $[F]$ on a certain symplectic space, the second one relates to the degeneracies of the skew-symmetric form, and the third one reflects the restriction of $f$ to the vertices of $G$. We give an application to the problem of deciding ...

  11. Role of discriminantly separable polynomials in integrable dynamical systems

    Science.gov (United States)

    Dragović, Vladimir; Kukić, Katarina

    2014-11-01

    Discriminantly separable polynomials of degree two in each of the three variables are considered. Those polynomials are by definition polynomials which discriminants are factorized as the products of the polynomials in one variable. Motivating example for introducing such polynomials is the famous Kowalevski top. Motivated by the role of such polynomials in the Kowalevski top, we generalize Kowalevski's integration procedure on a whole class of systems basically obtained by replacing so called the Kowalevski's fundamental equation by some other instance of the discriminantly separable polynomial. We present also the role of the discriminantly separable polynomils in twowell-known examples: the case of Kirchhoff elasticae and the Sokolov's case of a rigid body in an ideal fluid.

  12. Analysis of cubic permutation polynomials for turbo codes

    CERN Document Server

    Trifina, Lucian

    2011-01-01

    Quadratic permutation polynomials (QPPs) have been widely studied and used as interleavers in turbo codes. However, less attention has been given to cubic permutation polynomials (CPPs). This paper proves a theorem which states sufficient and necessary conditions for a cubic permutation polynomial to be a null permutation polynomial. The result is used to reduce the search complexity of CPP interleavers for short lengths (multiples of 8, between 40 and 256), by improving the distance spectrum over the set of polynomials with the largest spreading factor. The comparison with QPP interleavers is made in terms of search complexity and upper bounds of the bit error rate (BER) and frame error rate (FER) for AWGN channel. Cubic permutation polynomials leading to better performance than quadratic permutation polynomials are found for some lengths.

  13. Efficient modeling of photonic crystals with local Hermite polynomials

    Science.gov (United States)

    Boucher, C. R.; Li, Zehao; Albrecht, J. D.; Ram-Mohan, L. R.

    2014-04-01

    Developing compact algorithms for accurate electrodynamic calculations with minimal computational cost is an active area of research given the increasing complexity in the design of electromagnetic composite structures such as photonic crystals, metamaterials, optical interconnects, and on-chip routing. We show that electric and magnetic (EM) fields can be calculated using scalar Hermite interpolation polynomials as the numerical basis functions without having to invoke edge-based vector finite elements to suppress spurious solutions or to satisfy boundary conditions. This approach offers several fundamental advantages as evidenced through band structure solutions for periodic systems and through waveguide analysis. Compared with reciprocal space (plane wave expansion) methods for periodic systems, advantages are shown in computational costs, the ability to capture spatial complexity in the dielectric distributions, the demonstration of numerical convergence with scaling, and variational eigenfunctions free of numerical artifacts that arise from mixed-order real space basis sets or the inherent aberrations from transforming reciprocal space solutions of finite expansions. The photonic band structure of a simple crystal is used as a benchmark comparison and the ability to capture the effects of spatially complex dielectric distributions is treated using a complex pattern with highly irregular features that would stress spatial transform limits. This general method is applicable to a broad class of physical systems, e.g., to semiconducting lasers which require simultaneous modeling of transitions in quantum wells or dots together with EM cavity calculations, to modeling plasmonic structures in the presence of EM field emissions, and to on-chip propagation within monolithic integrated circuits.

  14. Maximally positive polynomial systems supported on circuits

    OpenAIRE

    Bihan, Frédéric

    2013-01-01

    A real polynomial system with support $\\calW \\subset \\Z^n$ is called {\\it maximally positive} if all its complex solutions are positive solutions. A support $\\calW$ having $n+2$ elements is called a circuit. We previously showed that the number of non-degenerate positive solutions of a system supported on a circuit $\\calW \\subset\\Z^n$ is at most $m(\\calW)+1$, where $m(\\calW) \\leq n$ is the degeneracy index of $\\calW$. We prove that if a circuit $\\calW \\subset \\Z^n$ supports a maximally positi...

  15. Pseudorandom Generators for Polynomial Threshold Functions

    OpenAIRE

    Meka, Raghu; Zuckerman, David

    2009-01-01

    We study the natural question of constructing pseudorandom generators (PRGs) for low-degree polynomial threshold functions (PTFs). We give a PRG with seed-length log n/eps^{O(d)} fooling degree d PTFs with error at most eps. Previously, no nontrivial constructions were known even for quadratic threshold functions and constant error eps. For the class of degree 1 threshold functions or halfspaces, we construct PRGs with much better dependence on the error parameter eps and obtain a PRG with se...

  16. Softness, Polynomial Boundedness and Amplitudes' Positivity

    CERN Document Server

    Bai, Dong

    2016-01-01

    In this note, we study the connection between infrared (IR) and ultraviolet (UV) behaviors of scattering amplitudes of massless channels by exploiting dispersion relations and positivity bounds. Given forward scattering amplitudes which scale as $\\mathcal{A}(s)\\sim s^M$ in the IR ($s\\to0$) and could be embedded into UV completions satisfying unitarity, analyticity, crossing symmetry and polynomial boundedness $|\\mathcal{A}(s)|< c\\, |s|^N$ ($|s|\\to\\infty$), with $M$ and $N$ integers, we show that the inequality $2\\ceil*{\\frac{N}{2}}\\ge M \\ge 0$ must hold, where $\\ceil*{x}$ is the smallest integer greater than or equal to $x$.

  17. Conditional Density Approximations with Mixtures of Polynomials

    DEFF Research Database (Denmark)

    Varando, Gherardo; López-Cruz, Pedro L.; Nielsen, Thomas Dyhre;

    2015-01-01

    Mixtures of polynomials (MoPs) are a non-parametric density estimation technique especially designed for hybrid Bayesian networks with continuous and discrete variables. Algorithms to learn one- and multi-dimensional (marginal) MoPs from data have recently been proposed. In this paper we introduce...... two methods for learning MoP approximations of conditional densities from data. Both approaches are based on learning MoP approximations of the joint density and the marginal density of the conditioning variables, but they differ as to how the MoP approximation of the quotient of the two densities is...

  18. A Matricial Algorithm for Polynomial Refinement

    CERN Document Server

    King, Emily J

    2011-01-01

    In order to have a multiresolution analysis, the scaling function must be refinable. That is, it must be the linear combination of 2-dilation, $\\mathbb{Z}$-translates of itself. Refinable functions used in connection with wavelets are typically compactly supported. In 2002, David Larson posed the question, "Are all polynomials (of a single variable) finitely refinable?" That summer the author proved that the answer indeed was true using basic linear algebra. The result was presented in a number of talks but had not been typed up until now. The purpose of this short note is to record that particular proof.

  19. Time-reversal symmetry and random polynomials

    CERN Document Server

    Braun, D; Zyczkowski, K

    1996-01-01

    We analyze the density of roots of random polynomials where each complex coefficient is constructed of a random modulus and a fixed, deterministic phase. The density of roots is shown to possess a singular component only in the case for which the phases increase linearly with the index of coefficients. This means that, contrary to earlier belief, eigenvectors of a typical quantum chaotic system with some antiunitary symmetry will not display a clustering curve in the stellar representation. Moreover, a class of time-reverse invariant quantum systems is shown, for which spectra display fluctuations characteristic of orthogonal ensemble, while eigenvectors confer to predictions of unitary ensemble.

  20. Inverting Onto Functions and Polynomial Hierarchy

    Czech Academy of Sciences Publication Activity Database

    Buhrman, H.; Fortnow, L.; Koucký, Michal; Rogers, J.D.; Vereshchagin, N.K.

    Berlin : Springer-Verlag, 2007 - (Diekert, V.; Volkov, M.; Voronkov, A.), s. 92-103 ISBN 978-3-540-74509-9. - (Lecture Notes in Computer Science. 4649). [International Computer Science Symposium in Russia, CSR 2007. Jekaterinburg (RU), 03.09.2007-07.09.2007] R&D Projects: GA ČR GA201/05/0124; GA ČR GP201/07/P276 Institutional research plan: CEZ:AV0Z10190503 Keywords : one-way functions * polynomial hierarchy * Kolmogorov generic oracle s Subject RIV: BA - General Mathematics

  1. Polynomial solutions of the field equations for cosmic strings coupled to the einstein equations

    International Nuclear Information System (INIS)

    A cosmic string described by an interaction Lagrangian and including a U(1) gauge vector field, minimally coupled to a scalar field was considered. This Lagrangian includes also a gravitation interacting scalar term. The field equations have been obtained from the above Lagrangian, these equations were coupled to Einstein's equations. Such a system of equations has been solved numerically and polynomial expansions derived for the fields which describe the string. With the above solutions the second order corrections to the angular deficit, produced by the string was determined. (author)

  2. VARIATIONAL APPROACH IN WAVELET FRAMEWORK TO POLYNOMIAL APPROXIMATIONS OF NONLINEAR ACCELERATOR PROBLEMS

    International Nuclear Information System (INIS)

    In this paper the authors present applications of methods from wavelet analysis to polynomial approximations for a number of accelerator physics problems. According to a variational approach in the general case they have the solution as a multiresolution (multiscales) expansion on the base of compactly supported wavelet basis. They give an extension of their results to the cases of periodic orbital particle motion and arbitrary variable coefficients. Then they consider more flexible variational method which is based on a biorthogonal wavelet approach. Also they consider a different variational approach, which is applied to each scale

  3. On difference equations for orthogonal polynomials on nonuniform lattices

    International Nuclear Information System (INIS)

    By the study of various properties of some divided-difference equations, we simplify the definition of classical orthogonal polynomials given by Atakishiyev, Rahman and Suslov (1995), then prove that orthogonal polynomials obtained by some modifications of the classical orthogonal polynomials on nonuniform lattices satisfy a single fourth-order linear homogeneous divided-difference equation with polynomial coefficients. Moreover, we factorize and solve explicitly these divided-difference equations. Also, we prove that the product of two functions, each of which satisfying a second-order linear homogeneous divided-difference equation is a solution of a fourth-order linear homogeneous divided-difference equation. This result holds in particular when the divided-difference operator is carefully replaced by the Askey-Wilson operator Dq, following pioneer work by Alphonse Magnus (1988) connecting Dq and divided-difference operators. Finally, we propose a method to look for polynomial solutions of linear divided-difference equations with polynomial coefficients. (author)

  4. Note on Generating Orthogonal Polynomials and Their Application in Solving Complicated Polynomial Regression Tasks

    Czech Academy of Sciences Publication Activity Database

    Knížek, J.; Tichý, Petr; Beránek, L.; Šindelář, Jan; Vojtěšek, B.; Bouchal, P.; Nenutil, R.; Dedík, O.

    2010-01-01

    Roč. 7, č. 10 (2010), s. 48-60. ISSN 0974-5718 Grant ostatní: GA MZd(CZ) NS9812; GA ČR(CZ) GAP304/10/0868 Institutional research plan: CEZ:AV0Z10300504; CEZ:AV0Z10750506 Keywords : polynomial regression * orthogonalization * numerical methods * markers * biomarkers Subject RIV: BA - General Mathematics

  5. Darboux polynomials for Lotka-Volterra systems in three dimensions

    CERN Document Server

    Christodoulides, Yiannis T

    2008-01-01

    We consider Lotka-Volterra systems in three dimensions depending on three real parameters. By using elementary algebraic methods we classify the Darboux polynomials (also known as second integrals) for such systems for various values of the parameters, and give the explicit form of the corresponding cofactors. More precisely, we show that a Darboux polynomial of degree greater than one is reducible. In fact, it is a product of linear Darboux polynomials and first integrals.

  6. Polynomial force approximations and multifrequency atomic force microscopy

    OpenAIRE

    Daniel Platz; Daniel Forchheimer; Tholén, Erik A; David B. Haviland

    2013-01-01

    We present polynomial force reconstruction from experimental intermodulation atomic force microscopy (ImAFM) data. We study the tip–surface force during a slow surface approach and compare the results with amplitude-dependence force spectroscopy (ADFS). Based on polynomial force reconstruction we generate high-resolution surface-property maps of polymer blend samples. The polynomial method is described as a special example of a more general approximative force reconstruction, where the aim is...

  7. A Laguerre Polynomial Orthogonality and the Hydrogen Atom

    OpenAIRE

    Dunkl, Charles F.

    2000-01-01

    The radial part of the wave function of an electron in a Coulomb potential is the product of a Laguerre polynomial and an exponential with the variable scaled by a factor depending on the degree. This note presents an elementary proof of the orthogonality of wave functions with differing energy levels. It is also shown that this is the only other natural orthogonality for Laguerre polynomials. By expanding in terms of the usual Laguerre polynomial basis an analogous strange orthogonality is o...

  8. Optimization of coefficients of lists of polynomials by evolutionary algorithms

    OpenAIRE

    Sendra Pons, Juan Rafael; Winkler, Stephan M.

    2015-01-01

    We here discuss the optimization of coefficients of lists of polynomials using evolutionary computation. The given polynomials have 5 variables, namely t, a1, a2, a3, a4, and integer coefficients. The goal is to find integer values i, with i 2 {1, 2, 3, 4}, substituting ai such that, after crossing out the gcd (greatest common divisor) of all coefficients of the polynomials, the resulting integers are minimized in absolute value. Evolution strategies, a special class of heu...

  9. Quantization of gauge fields, graph polynomials and graph cohomology

    OpenAIRE

    Kreimer, Dirk; Sars, Matthias; van Suijlekom, Walter D.

    2012-01-01

    We review quantization of gauge fields using algebraic properties of 3-regular graphs. We derive the Feynman integrand at n loops for a non-abelian gauge theory quantized in a covariant gauge from scalar integrands for connected 3-regular graphs, obtained from the two Symanzik polynomials. The transition to the full gauge theory amplitude is obtained by the use of a third, new, graph polynomial, the corolla polynomial. This implies effectively a covariant quantization without ghosts, where al...

  10. Characteristic and Counting Polynomials: Modelling Nonane Isomers Properties

    OpenAIRE

    Jäntschi, Lorentz; BOLBOACA, Sorana D.; FURDUI, Cristina Maria

    2009-01-01

    Abstract The major goal of this study was to investigate the broad application of graph polynomials to the analysis of Henry?s law constants (solubility) of nonane isomers. In this context, Henry?s law constants of nonane isomers were modelled using characteristic and counting polynomials. The characteristic and counting polynomials on the distance matrix, on the maximal fragments matrix, on the complement of maximal fragments matrix, and on the Szeged matrix were calculated for ea...

  11. LINX-1: a code for linking polynomial cross section files

    International Nuclear Information System (INIS)

    The capabilities of the LINX-1 code are described. It was developed for the purpose of linking seperate fuel assembly and reflector node polynomial cross section files, obtained by the POLX-1 code, together into a single reactor polynomial cross section library. The output of the polynomial cross section library can be in either binary or fixed (BCD) format. Input data requirements and the format of the output file generated by LINX-1 are also described. 2 refs

  12. On Factorization of Generalized Macdonald Polynomials

    CERN Document Server

    Kononov, Ya

    2016-01-01

    A remarkable feature of Schur functions -- the common eigenfunctions of cut-and-join operators from $W_\\infty$ -- is that they factorize at the peculiar two-parametric topological locus in the space of time-variables, what is known as the hook formula for quantum dimensions of representations of $U_q(SL_N)$ and plays a big role in various applications. This factorization survives at the level of Macdonald polynomials. We look for its further generalization to generalized Macdonald polynomials (GMP), associated in the same way with the toroidal Ding-Iohara-Miki algebras, which play the central role in modern studies in Seiberg-Witten-Nekrasov theory. In the simplest case of the first-coproduct eigenfunctions, where GMP depend on just two sets of time-variables, we discover a weak factorization -- on a one- (rather than four-) parametric slice of the topological locus, what is already a very non-trivial property, calling for proof and better understanding.

  13. Quantum Schubert polynomials and the Vafa-Intriligator formula

    CERN Document Server

    Kirillov, A N; Kirillov, Anatol N.; Maeno, Toshiaki

    1996-01-01

    We introduce a quantization map and study the quantization of Schubert and Grothendieck polynomials, monomials, elementary and complete polynomials. Our construction is based on the quantum Cauchy identity. As a corollary, we prove the Lascoux-Schützenberger type formula for quantum Schubert polynomials of the flag manifold. Our formula gives a simple method for computation of quantum Schubert polynomials. We also prove the higher genus analog of Vafa-Intriligator's formula for the flag manifold. We introduce the Extended Ehresman-Bruhat order on the symmetric group and prove the equivariant quantum Pieri formula.

  14. An Analytic Formula for the A_2 Jack Polynomials

    Directory of Open Access Journals (Sweden)

    Vladimir V. Mangazeev

    2007-01-01

    Full Text Available In this letter I shall review my joint results with Vadim Kuznetsov and Evgeny Sklyanin [Indag. Math. 14 (2003, 451-482] on separation of variables (SoV for the $A_n$ Jack polynomials. This approach originated from the work [RIMS Kokyuroku 919 (1995, 27-34] where the integral representations for the $A_2$ Jack polynomials was derived. Using special polynomial bases I shall obtain a more explicit expression for the $A_2$ Jack polynomials in terms of generalised hypergeometric functions.

  15. Unimodularity of zeros of self-inversive polynomials

    CERN Document Server

    Lalin, Matilde N

    2012-01-01

    We generalise a necessary and sufficient condition given by Cohn for all the zeros of a self-inversive polynomial to be on the unit circle. Our theorem implies some sufficient conditions found by Lakatos, Losonczi and Schinzel. We apply our result to the study of a polynomial family closely related to Ramanujan polynomials, recently introduced by Gun, Murty and Rath, and studied by Murty, Smyth and Wang and Lal\\'in and Rogers. We prove that all polynomials in this family have their zeros on the unit circle, a result conjectured by Lal\\'in and Rogers on computational evidence.

  16. Multi-indexed Wilson and Askey-Wilson Polynomials

    CERN Document Server

    Odake, Satoru

    2013-01-01

    As the third stage of the project multi-indexed orthogonal polynomials, we present, in the framework of 'discrete quantum mechanics' with pure imaginary shifts in one dimension, the multi-indexed Wilson and Askey-Wilson polynomials. They are obtained from the original Wilson and Askey-Wilson polynomials by multiple application of the discrete analogue of the Darboux transformations or the Crum-Krein-Adler deletion of 'virtual state solutions' of type I and II, in a similar way to the multi-indexed Laguerre, Jacobi and (q-)Racah polynomials reported earlier.

  17. Quantum algorithms for virtual Jones polynomials via Thistlethwaite theorems

    Science.gov (United States)

    Vélez, Mario; Ospina, Juan

    2010-04-01

    Recently a quantum algorithm for the Jones polynomial of virtual links was proposed by Kauffman and Dye via the implementation of the virtual braid group in anyonic topological quantum computation when the virtual crossings are considered as generalized swap gates. Also recently, a mathematical method for the computation of the Jones polynomial of a given virtual link in terms of the relative Tuttle polynomial of its face (Tait) graph with some suitable variable substitutions was proposed by Diao and Hetyei. The method of Diao and Hetyei is offered as an alternative to the ribbon graph approach according to which the Tutte polynomial of a given virtual link is computed in terms of the Bollobás- Riordan polynomial of the corresponding ribbon graph. The method of Diao and Hetyei can be considered as an extension of the celebrated Thistlethwaite theorem according to which invariant polynomials for knots and links are derived from invariant polynomials for graphs. Starting from these ideas we propose a quantum algorithm for the Jones polynomial of a given virtual link in terms of the generalized Tutte polynomials by exploiting the Thistlethwaite theorem and the Kauffman algorithm . Our method is claimed as the quantum version of the Diao-Hetyei method. Possible supersymmetric implementations of our algortihm are discussed jointly with its formulations using topological quantum lambda calculus.

  18. The discretized harmonic oscillator: Mathieu functions and a new class of generalized Hermite polynomials

    International Nuclear Information System (INIS)

    We present a general, asymptotical solution for the discretized harmonic oscillator. The corresponding Schroedinger equation is canonically conjugate to the Mathieu differential equation, the Schroedinger equation of the quantum pendulum. Thus, in addition to giving an explicit solution for the Hamiltonian of an isolated Josephon junction or a superconducting single-electron transistor (SSET), we obtain an asymptotical representation of Mathieu functions. We solve the discretized harmonic oscillator by transforming the infinite-dimensional matrix-eigenvalue problem into an infinite set of algebraic equations which are later shown to be satisfied by the obtained solution. The proposed ansatz defines a new class of generalized Hermite polynomials which are explicit functions of the coupling parameter and tend to ordinary Hermite polynomials in the limit of vanishing coupling constant. The polynomials become orthogonal as parts of the eigenvectors of a Hermitian matrix and, consequently, the exponential part of the solution can not be excluded. We have conjectured the general structure of the solution, both with respect to the quantum number and the order of the expansion. An explicit proof is given for the three leading orders of the asymptotical solution and we sketch a proof for the asymptotical convergence of eigenvectors with respect to norm. From a more practical point of view, we can estimate the required effort for improving the known solution and the accuracy of the eigenvectors. The applied method can be generalized in order to accommodate several variables

  19. Finite difference method and algebraic polynomial interpolation for numerically solving Poisson's equation over arbitrary domains

    Directory of Open Access Journals (Sweden)

    Tsugio Fukuchi

    2014-06-01

    Full Text Available The finite difference method (FDM based on Cartesian coordinate systems can be applied to numerical analyses over any complex domain. A complex domain is usually taken to mean that the geometry of an immersed body in a fluid is complex; here, it means simply an analytical domain of arbitrary configuration. In such an approach, we do not need to treat the outer and inner boundaries differently in numerical calculations; both are treated in the same way. Using a method that adopts algebraic polynomial interpolations in the calculation around near-wall elements, all the calculations over irregular domains reduce to those over regular domains. Discretization of the space differential in the FDM is usually derived using the Taylor series expansion; however, if we use the polynomial interpolation systematically, exceptional advantages are gained in deriving high-order differences. In using the polynomial interpolations, we can numerically solve the Poisson equation freely over any complex domain. Only a particular type of partial differential equation, Poisson's equations, is treated; however, the arguments put forward have wider generality in numerical calculations using the FDM.

  20. On the cable expansion formula

    OpenAIRE

    Liu, Qihou

    2008-01-01

    In this paper, a generalized version of Morton's formula is proved. Using this formula, one can write down the colored Jones polynomials of cabling of an knot in terms of the colored Jones polynomials of the original knot.

  1. Determinantal and permanental representation of generalized bivariate Fibonacci p-polynomials

    OpenAIRE

    Kaygisiz, Kenan; Sahin, Adem

    2011-01-01

    In this paper, we give some determinantal and permanental representations of generalized bivariate Fibonacci p-polynomials by using various Hessenberg matrices. The results that we obtained are important since generalized bivariate Fibonacci p-polynomials are general form of, for example, bivariate Fibonacci and Pell p-polynomials, second kind Chebyshev polynomials, bivariate Jacobsthal polynomials etc.

  2. Quantification of Geometric Uncertainties in Single Cell Cavities for BESSY VSR Using Polynomial Chaos

    CERN Document Server

    Heller, J; Schmidt, C; van Rienen, U

    2014-01-01

    The electromagnetic properties of SRF cavities are mostly determined by their shape. Due to fabrication tolerances, tuning and limited resolution of measurement systems, the exact shape remains uncertain. In order to make assessments for the real life behaviour it is important to quantify how these geometrical uncertainties propagate through the mathematical system and influence certain electromagnetic properties, like the resonant frequencies of the structure’s eigenmodes. This can be done by using non-intrusive straightforward methods like Monte Carlo (MC) simulations. However, such simulations require a large number of deterministic problem solutions to obtain a sufficient accuracy. In order to avoid this scaling behaviour, the so-called generalized polynomial chaos (gPC) expansion is used. This technique allows for the relatively fast computation of uncertainty propagation for few uncertain parameters in the case of computationally expensive deterministic models. In this paper we use the gPC expansion t...

  3. Inequalities for a Polynomial and its Derivative

    Indian Academy of Sciences (India)

    V K Jain

    2000-05-01

    For an arbitrary entire function and any > 0, let $M(f, r):=\\max_{|z|=r}|f(z)|$. It is known that if is a polynomial of degree having no zeros in the open unit disc, and $m:=\\min_{|z|=1}|p(z)|$, then $$M(p',1)≤\\frac{n}{2}\\{M(p,1)-m\\},$$ $$M(p, R)≤\\left(\\frac{R^n+1}{2}\\right)M(p, 1)-m\\left(\\frac{R^n-1}{2}\\right), R>> 1.$$ It is also known that if has all its zeros in the closed unit disc, then $$M(p', 1)≥\\frac{n}{2}\\{M(p, 1)+m\\}.$$ The present paper contains certain generalizations of these inequalities

  4. Orthogonal polynomials for refinable linear functionals

    Science.gov (United States)

    Laurie, Dirk; de Villiers, Johan

    2006-12-01

    A refinable linear functional is one that can be expressed as a convex combination and defined by a finite number of mask coefficients of certain stretched and shifted replicas of itself. The notion generalizes an integral weighted by a refinable function. The key to calculating a Gaussian quadrature formula for such a functional is to find the three-term recursion coefficients for the polynomials orthogonal with respect to that functional. We show how to obtain the recursion coefficients by using only the mask coefficients, and without the aid of modified moments. Our result implies the existence of the corresponding refinable functional whenever the mask coefficients are nonnegative, even when the same mask does not define a refinable function. The algorithm requires O(n^2) rational operations and, thus, can in principle deliver exact results. Numerical evidence suggests that it is also effective in floating-point arithmetic.

  5. Study on the Grey Polynomial Geometric Programming

    Institute of Scientific and Technical Information of China (English)

    LUODang

    2005-01-01

    In the model of geometric programming, values of parameters cannot be gotten owing to data fluctuation and incompletion. But reasonable bounds of these parameters can be attained. This is to say, parameters of this model can be regarded as interval grey numbers. When the model contains grey numbers, it is hard for common programming method to solve them. By combining the common programming model with the grey system theory,and using some analysis strategies, a model of grey polynomial geometric programming, a model of 8 positioned geometric programming and their quasi-optimum solution or optimum solution are put forward. At the same time, we also developed an algorithm for the problem.This approach brings a new way for the application research of geometric programming. An example at the end of this paper shows the rationality and feasibility of the algorithm.

  6. Dynamic normal forms and dynamic characteristic polynomial

    DEFF Research Database (Denmark)

    Frandsen, Gudmund Skovbjerg; Sankowski, Piotr

    2011-01-01

    We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case, our algorithm supports rank-one updates in O(n2logn) randomized time and queries in constant time, whereas in the general case the algorithm works in O(n2klogn......) randomized time, where k is the number of invariant factors of the matrix. The algorithm is based on the first dynamic algorithm for computing normal forms of a matrix such as the Frobenius normal form or the tridiagonal symmetric form. The algorithm can be extended to solve the matrix eigenproblem with...... relative error 2−b in additional O(nlog2nlogb) time. Furthermore, it can be used to dynamically maintain the singular value decomposition (SVD) of a generic matrix. Together with the algorithm, the hardness of the problem is studied. For the symmetric case, we present an Ω(n2) lower bound for rank...

  7. Polynomial Approximations of Electronic Wave Functions

    CERN Document Server

    Panin, Andrej I

    2010-01-01

    This work completes the construction of purely algebraic version of the theory of non-linear quantum chemistry methods. It is shown that at the heart of these methods there lie certain algebras close in their definition to the well-known Clifford algebra but quite different in their properties. The most important for quantum chemistry property of these algebras is the following : for a fixed number of electrons the corresponding sector of the Fock space becomes a commutative algebra and its ideals are determined by the order of excitations from the Hartree-Fock reference state. Quotients of this algebra can also be endowed with commutative algebra structures and quotient Schr{\\"o}dinger equations are exactly the couple cluster type equations. Possible computer implementation of multiplication in the aforementioned algebras is described. Quality of different polynomial approximations of configuration interaction wave functions is illustrated with concrete examples. Embedding of algebras of infinitely separated...

  8. The Polynomially Exponential Time Restrained Analytical Hierarchy

    Institute of Scientific and Technical Information of China (English)

    眭跃飞

    1991-01-01

    A polynomially exponential time restrained analytical hierarchy is introduced with the basic properties of the hierarchy followed.And it will be shown that there is a recursive set A such that A does not belong to any level of the p-arithmetical hierarchies.Then we shall prove that there are recursive sets A and B such that the different levels of the analytical hierarchy relative to A are different and for some n every level higher than n of the analytical hierarchy relative to B is the same as the n-th level.And whether the higher levels are collapsed into some lower level is neither provable nor disprovable in set theory and several other results.

  9. On Nilpotent Elements of Skew Polynomial Rings

    Directory of Open Access Journals (Sweden)

    J. Esmaeili

    2012-09-01

    Full Text Available We study the structure of the set of nilpotent elements in skew polynomial ring R[x; α], when R is an α-Armendariz ring. We prove that if R is a nil α-Armendariz ring and α t = IR, then the set of nilpotent elements of R is an α-compatible subrng of R. Also, it is shown that if R is an α-Armendariz ring and α t = IR, then R is nil α-Armendariz. We give some examples of non α-Armendariz rings which are nil α-Armendariz. Moreover, we show that if α t = IR for some positive integer t and R is a nil α-Armendariz ring and nil(R[x][y; α] = nil(R[x][y], then R[x] is nil α-Armendariz. Some results of [3] follow as consequences of our results

  10. Properties of the corolla polynomial of a 3-regular graph

    OpenAIRE

    Kreimer, Dirk; Yeats, Karen

    2012-01-01

    We investigate combinatorial properties of a graph polynomial indexed by half-edges of a graph which was introduced recently to understand the connection between Feynman rules for scalar field theory and Feynman rules for gauge theory. We investigate the new graph polynomial as a stand-alone object.

  11. Zonal polynomials and hypergeometric functions of quaternion matrix argument

    OpenAIRE

    Li, Fei; Xue, Yifeng

    2009-01-01

    We define zonal polynomials of quaternion matrix argument and deduce some important formulae of zonal polynomials and hypergeometric functions of quaternion matrix argument. As an application, we give the distributions of the largest and smallest eigenvalues of a quaternion central Wishart matrix $W\\sim\\mathbb{Q}W(n,\\Sigma)$, respectively.

  12. On the Structure of Cubic and Quartic Polynomials

    CERN Document Server

    Haramaty, Elad

    2009-01-01

    In this paper we study the structure of polynomials of degree three and four that have high bias or high Gowers norm, over arbitrary prime fields. In particular we obtain the following results. 1. We give a canonical representation for degree three or four polynomials that have a significant bias (i.e. they are not equidistributed). This result generalizes the corresponding results from the theory of quadratic forms. It also significantly improves the results of Green and Tao and Kaufman and Lovett for such polynomials. 2. For the case of degree four polynomials with high Gowers norm we show that (a subspace of co-dimension O(1) of) F^n can be partitioned to subspaces of dimension Omega(n) such that on each of the subspaces the polynomial is equal to some degree three polynomial. It was shown by Green and Tao and by Lovett, Meshulam and Samorodnitsky that a quartic polynomial with a high Gowers norm is not necessarily correlated with any cubic polynomial. Our result shows that a slightly weaker statement does...

  13. On fully split lacunary polynomials in finite fields

    OpenAIRE

    Bibak, Khodakhast; Shparlinski, Igor E.

    2011-01-01

    We estimate the number of possible types degree patterns of $k$-lacunary polynomials of degree $t < p$ which split completely modulo $p$. The result is based on a combination of a bound on the number of zeros of lacunary polynomials with some graph theory arguments.

  14. Learning Read-constant Polynomials of Constant Degree modulo Composites

    DEFF Research Database (Denmark)

    Chattopadhyay, Arkadev; Gavaldá, Richard; Hansen, Kristoffer Arnsfelt;

    2011-01-01

    known to be learnable in any reasonable learning model. In this paper, we provide a deterministic polynomial time algorithm for learning Boolean functions represented by polynomials of constant degree over arbitrary finite rings from membership queries, with the additional constraint that each variable...

  15. A generating algorithm for ribbon tableaux and spin polynomials

    OpenAIRE

    Francois Descouens

    2006-01-01

    We describe a general algorithm for generating various families of ribbon tableaux and computing their spin polynomials. This algorithm is derived from a new matricial coding. An advantage of this new notation lies in the fact that it permits one to generate ribbon tableaux with skew shapes. This algorithm permits us to compute quickly big LLT polynomials in MuPAD-Combinat.

  16. On peculiar properties of generating functions of some orthogonal polynomials

    International Nuclear Information System (INIS)

    We prove that for |x| ⩽ |t| ≥(ti)/(q)ihn+i( x|q) =hn(x|t,q) Σi≥0(ti)/(q)ihi(x|q), where hn(x|q) and hn(x|t, q) are respectively the so-called q-Hermite and the big q-Hermite polynomials, and (q)n denotes the so-called q-Pochhammer symbol. We prove similar equalities involving big q-Hermite and Al-Salam–Chihara polynomials, and Al-Salam–Chihara and the so-called continuous dual q-Hahn polynomials. Moreover, we are able to relate in this way some other ‘ordinary’ orthogonal polynomials such as, e.g., Hermite, Chebyshev or Laguerre. These equalities give a new interpretation of the polynomials involved and moreover can give rise to a simple method of generating more and more general (i.e. involving more and more parameters) families of orthogonal polynomials. We pose some conjectures concerning Askey–Wilson polynomials and their possible generalizations. We prove that these conjectures are true for the cases q = 1 (classical case) and q = 0 (free case), thus paving the way to generalization of Askey–Wilson polynomials at least in these two cases. (paper)

  17. On linear operators preserving the set of positive polynomials

    OpenAIRE

    Guterman, Alexander; Shapiro, Boris

    2008-01-01

    Following the classical approach of P´olya-Schur theory [14] we initiate in this paper the study of linear operators acting on R[x] and preserving either the set of positive univariate polynomials or similar sets of non-negative and elliptic polynomials.

  18. Animating Nested Taylor Polynomials to Approximate a Function

    Science.gov (United States)

    Mazzone, Eric F.; Piper, Bruce R.

    2010-01-01

    The way that Taylor polynomials approximate functions can be demonstrated by moving the center point while keeping the degree fixed. These animations are particularly nice when the Taylor polynomials do not intersect and form a nested family. We prove a result that shows when this nesting occurs. The animations can be shown in class or…

  19. Generalization of the Macdonald formula for Hall-Littlewood polynomials

    CERN Document Server

    Klostermann, Inka

    2011-01-01

    We study the Gaussent-Littelmann formula for Hall-Littlewood polynomials and we develop combinatorial tools to describe the formula in a purely combinatorial way for type A_n. Furthermore, we show by using these tools that the Gaussent-Littelmann formula and the well-known Macdonald formula for Hall-Littlewood polynomials for type A_n are the same.

  20. A Parallel Algorithm for Finding Roots of a Complex Polynomial

    Institute of Scientific and Technical Information of China (English)

    程锦松

    1990-01-01

    A distribution theory of the roots of a polynomial and a parallel algorithm for finding roots of a complex polynomial based on that theory are developed in this paper.With high parallelism,the algorithm is an improvement over the Wilf algorithm[3].

  1. Approximation to Continuous Functions by a Kind of Interpolation Polynomials

    Institute of Scientific and Technical Information of China (English)

    Yuan Xue-gang; Wang De-hui

    2001-01-01

    In this paper, an interpolation polynomial operator Fn (f; l, x ) is constructed based on the zeros of a kind of Jacobi polynomials as the interpolation nodes. For any continuous function f(x)∈ Cb[1,1] (0≤b≤l) Fn(f; l,x) converges to f(x) uniformly, where l is an odd number.

  2. On -Euler Numbers Related to the Modified -Bernstein Polynomials

    OpenAIRE

    Min-Soo Kim; Daeyeoul Kim; Taekyun Kim

    2010-01-01

    We consider q-Euler numbers, polynomials, and q-Stirling numbers of first and second kinds. Finally, we investigate some interesting properties of the modified q-Bernstein polynomials related to q-Euler numbers and q-Stirling numbers by using fermionic p-adic integrals on ℤp.

  3. A new two-variable generalization of the Jones polynomial

    OpenAIRE

    Goundaroulis, Dimos; Lambropoulou, Sofia

    2016-01-01

    We present a new 2-variable generalization of the Jones polynomial that can be defined through the skein relation of the Jones polynomial. The well-definedness of this new generalization is proved algebraically. We also give a closed combinatorial formula for this new classical link invariant.

  4. Polynomial perturbations of hermitian linear functionals and difference equations

    CERN Document Server

    Cantero, M J; Velázquez, L

    2009-01-01

    This paper is devoted to the study of general (Laurent) polynomial modifications of moment functionals on the unit circle, i.e., associated with hermitian Toeplitz matrices. We present a new approach which allows us to study polynomial modifications of arbitrary degree. The main objective is the characterization of the quasi-definiteness of the functionals involved in the problem in terms of a difference equation relating the corresponding Schur parameters. The results are presented in the general framework of (non necessarily quasi-definite) hermitian functionals, so that the maximum number of orthogonal polynomials is characterized by the number of consistent steps of an algorithm based on the referred recurrence for the Schur parameters. Some concrete applications to the study of orthogonal polynomials on the unit circle show the effectiveness of this new approach: an exhaustive and instructive analysis of the functionals coming from a general inverse polynomial perturbation of degree one for the Lebesgue ...

  5. Multiple Meixner polynomials and non-Hermitian oscillator Hamiltonians

    Science.gov (United States)

    Ndayiragije, F.; Van Assche, W.

    2013-12-01

    Multiple Meixner polynomials are polynomials in one variable which satisfy orthogonality relations with respect to r > 1 different negative binomial distributions (Pascal distributions). There are two kinds of multiple Meixner polynomials, depending on the selection of the parameters in the negative binomial distribution. We recall their definition and some formulas and give generating functions and explicit expressions for the coefficients in the nearest neighbor recurrence relation. Following a recent construction of Miki, Tsujimoto, Vinet and Zhedanov (for multiple Meixner polynomials of the first kind), we construct r > 1 non-Hermitian oscillator Hamiltonians in r dimensions which are simultaneously diagonalizable and for which the common eigenstates are expressed in terms of multiple Meixner polynomials of the second kind.

  6. Low degree polynomial equations arithmetic, geometry and topology

    CERN Document Server

    Kollár, J

    1996-01-01

    These are the notes of my lectures at the 1996 European Congress of Mathematicians. Polynomials appear in mathematics frequently, and we all know from experience that low degree polynomials are easier to deal with than high degree ones. It is, however, not clear that there is a well defined class of ``low degree" polynomials. For many questions, polynomials behave well if their degree is low enough, but the precise bound on the degree depends on the concrete problem. It turns out that there is a collection of basic questions in arithmetic, algebraic geometry and topology all of which give the same class of ``low degree" polynomials. The aim of this lecture is to explain these properties and to provide a survey of the known results.

  7. Approximating smooth functions using algebraic-trigonometric polynomials

    Science.gov (United States)

    Sharapudinov, Idris I.

    2011-01-01

    The problem under consideration is that of approximating classes of smooth functions by algebraic-trigonometric polynomials of the form p_n(t)+\\tau_m(t), where p_n(t) is an algebraic polynomial of degree n and \\tau_m(t)=a_0+\\sum_{k=1}^ma_k\\cos k\\pi t+b_k\\sin k\\pi t is a trigonometric polynomial of order m. The precise order of approximation by such polynomials in the classes W^r_\\infty(M) and an upper bound for similar approximations in the class W^r_p(M) with \\frac43 are found. The proof of these estimates uses mixed series in Legendre polynomials which the author has introduced and investigated previously. Bibliography: 13 titles.

  8. Approximating smooth functions using algebraic-trigonometric polynomials

    International Nuclear Information System (INIS)

    The problem under consideration is that of approximating classes of smooth functions by algebraic-trigonometric polynomials of the form pn(t)+τm(t), where pn(t) is an algebraic polynomial of degree n and τm(t)=a0+Σk=1mak cos kπt + bk sin kπt is a trigonometric polynomial of order m. The precise order of approximation by such polynomials in the classes Wr∞(M) and an upper bound for similar approximations in the class Wrp(M) with 4/3< p<4 are found. The proof of these estimates uses mixed series in Legendre polynomials which the author has introduced and investigated previously. Bibliography: 13 titles.

  9. Properties of the zeros of generalized basic hypergeometric polynomials

    Science.gov (United States)

    Bihun, Oksana; Calogero, Francesco

    2015-11-01

    We define the generalized basic hypergeometric polynomial of degree N in terms of the generalized basic hypergeometric function, by choosing one of its parameters to allow the termination of the series after a finite number of summands. In this paper, we obtain a set of nonlinear algebraic equations satisfied by the N zeros of the polynomial. Moreover, we obtain an N × N matrix M defined in terms of the zeros of the polynomial, which, in turn, depend on the parameters of the polynomial. The eigenvalues of this remarkable matrix M are given by neat expressions that depend only on some of the parameters of the polynomial; that is, the matrix M is isospectral. Moreover, in case the parameters that appear in the expressions for the eigenvalues of M are rational, the matrix M has rational eigenvalues, a Diophantine property.

  10. On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal

    CERN Document Server

    Jansen, Bart M P

    2011-01-01

    The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite (i.e., 2-colorable) by deleting at most l vertices. We study structural parameterizations of OCT with respect to their polynomial kernelizability, i.e., whether instances can be efficiently reduced to a size polynomial in the chosen parameter. It is a major open problem in parameterized complexity whether Odd Cycle Transversal admits a polynomial kernel when parameterized by l. On the positive side, we show a polynomial kernel for OCT when parameterized by the vertex deletion distance to the class of bipartite graphs of treewidth at most w (for any constant w); this generalizes the parameter feedback vertex set number (i.e., the distance to a forest). Complementing this, we exclude polynomial kernels for OCT parameterized by the distance to outerplanar graphs, conditioned on the assumption that NP \

  11. Polynomial harmonic GMDH learning networks for time series modeling.

    Science.gov (United States)

    Nikolaev, Nikolay Y; Iba, Hitoshi

    2003-12-01

    This paper presents a constructive approach to neural network modeling of polynomial harmonic functions. This is an approach to growing higher-order networks like these build by the multilayer GMDH algorithm using activation polynomials. Two contributions for enhancement of the neural network learning are offered: (1) extending the expressive power of the network representation with another compositional scheme for combining polynomial terms and harmonics obtained analytically from the data; (2) space improving the higher-order network performance with a backpropagation algorithm for further gradient descent learning of the weights, initialized by least squares fitting during the growing phase. Empirical results show that the polynomial harmonic version phGMDH outperforms the previous GMDH, a Neurofuzzy GMDH and traditional MLP neural networks on time series modeling tasks. Applying next backpropagation training helps to achieve superior polynomial network performances. PMID:14622880

  12. Higher order branching of periodic orbits from polynomial isochrones

    Directory of Open Access Journals (Sweden)

    B. Toni

    1999-09-01

    Full Text Available We discuss the higher order local bifurcations of limit cycles from polynomial isochrones (linearizable centers when the linearizing transformation is explicitly known and yields a polynomial perturbation one-form. Using a method based on the relative cohomology decomposition of polynomial one-forms complemented with a step reduction process, we give an explicit formula for the overall upper bound of branch points of limit cycles in an arbitrary $n$ degree polynomial perturbation of the linear isochrone, and provide an algorithmic procedure to compute the upper bound at successive orders. We derive a complete analysis of the nonlinear cubic Hamiltonian isochrone and show that at most nine branch points of limit cycles can bifurcate in a cubic polynomial perturbation. Moreover, perturbations with exactly two, three, four, six, and nine local families of limit cycles may be constructed.

  13. Modelling Trends in Ordered Correspondence Analysis Using Orthogonal Polynomials.

    Science.gov (United States)

    Lombardo, Rosaria; Beh, Eric J; Kroonenberg, Pieter M

    2016-06-01

    The core of the paper consists of the treatment of two special decompositions for correspondence analysis of two-way ordered contingency tables: the bivariate moment decomposition and the hybrid decomposition, both using orthogonal polynomials rather than the commonly used singular vectors. To this end, we will detail and explain the basic characteristics of a particular set of orthogonal polynomials, called Emerson polynomials. It is shown that such polynomials, when used as bases for the row and/or column spaces, can enhance the interpretations via linear, quadratic and higher-order moments of the ordered categories. To aid such interpretations, we propose a new type of graphical display-the polynomial biplot. PMID:25791164

  14. Chebyshev Expansions for Solutions of Linear Differential Equations

    OpenAIRE

    Benoit, Alexandre; Salvy, Bruno

    2009-01-01

    A Chebyshev expansion is a series in the basis of Chebyshev polynomials of the first kind. When such a series solves a linear differential equation, its coefficients satisfy a linear recurrence equation. We interpret this equation as the numerator of a fraction of linear recurrence operators. This interpretation lets us give a simple view of previous algorithms, analyze their complexity, and design a faster one for large orders.

  15. Bivariate Count Data Regression Using Series Expansions: With Applications

    OpenAIRE

    A. Colin Cameron; Per Johansson

    2004-01-01

    Most research on count data regression models, i.e. models for there the dependent variable takes only non-negative integer values or count values, has focused on the univariate case. Very little attention has been given to joint modeling of two or more counts. We propose parametric regression models for bivariate counts based on squared polynomial expansions around a baseline density. The models are more flexible than the current leading bivariate count model, the bivariate Poisson. The mode...

  16. Asymptotic Expansions of Feynman Amplitudes in a Generic Covariant Gauge

    OpenAIRE

    Linhares, C. A.; Malbouisson, A. P. C.; Roditi, I.

    2006-01-01

    We show in this paper how to construct Symanzik polynomials and the Schwinger parametric representation of Feynman amplitudes for gauge theories in an unspecified covariant gauge. The complete Mellin representation of such amplitudes is then established in terms of invariants (squared sums of external momenta and squared masses). From the scaling of the invariants by a parameter we extend for the present situation a theorem on asymptotic expansions, previously proven for the case of scalar fi...

  17. Parameterization of the harmonic content of the complex MPI signal of magnetic tracers using a set of polynomial coefficients

    International Nuclear Information System (INIS)

    In our work, we investigate the possibility of a polynomial interpolation of the Magnetic Particle Imaging (MPI) signal to parameterize the harmonic content of the signal to analyze the imaging quality at a limited number of harmonics. The traditional Taylor expansion of the magnetization curve is limited by a radius of convergence which is exceeded by the physical properties of real nanoparticle ensembles and MPI setups. This led us to the derivation of an alternative method using polynomial interpolation. Our method enabled us to express MPI signals based on the analytical Langevin function as well as numerical simulated data using other magnetization functions and a phase shift in relation to the excitation signal. The argument range of the interpolation function is wide enough to cover real cases. We conclude that the polynomial interpolation method represents a versatile tool to describe the relation between the magnetization curve and the MPI signals. - Highlights: • Ways to parameterize the MPI signal using polynomials were investigated. • The Taylor series diverges at ξ=±π when applied to the Langevin function. • The parameterization using a numerical model was successful. • The Langevin function and simulated time shifted signals could be parameterized

  18. On a class of polynomials associated with the Cliques in a graph and its applications

    Directory of Open Access Journals (Sweden)

    E. J. Farrell

    1989-03-01

    Full Text Available The clique polynomial of a graph is defined. An explicit formula is then derived for the clique polynomial of the complete graph. A fundamental theorem and a reduction process is then given for clique polynomials. Basic properties of the polynomial are also given. It is shown that the number theoretic functions defined by Menon are related to clique polynomials. This establishes a connection between the clique polynomial and decompositions of finite sets, symmetric groups and analysis.

  19. A link polynomial via a vertex-edge-face state model

    OpenAIRE

    Fiedler, Thomas

    2007-01-01

    We construct a 2-variable link polynomial, called $W_L$, for classical links by considering simultaneously the Kauffman state models for the Alexander and for the Jones polynomials. We conjecture that this polynomial is the product of two 1-variable polynomials, one of which is the Alexander polynomial. We refine $W_L$ to an ordered set of 3-variable polynomials for those links in 3-space which contain a Hopf link as a sublink.

  20. vs. a polynomial chaos-based MCMC

    KAUST Repository

    Siripatana, Adil

    2014-08-01

    Bayesian Inference of Manning\\'s n coefficient in a Storm Surge Model Framework: comparison between Kalman lter and polynomial based method Adil Siripatana Conventional coastal ocean models solve the shallow water equations, which describe the conservation of mass and momentum when the horizontal length scale is much greater than the vertical length scale. In this case vertical pressure gradients in the momentum equations are nearly hydrostatic. The outputs of coastal ocean models are thus sensitive to the bottom stress terms de ned through the formulation of Manning\\'s n coefficients. This thesis considers the Bayesian inference problem of the Manning\\'s n coefficient in the context of storm surge based on the coastal ocean ADCIRC model. In the first part of the thesis, we apply an ensemble-based Kalman filter, the singular evolutive interpolated Kalman (SEIK) filter to estimate both a constant Manning\\'s n coefficient and a 2-D parameterized Manning\\'s coefficient on one ideal and one of more realistic domain using observation system simulation experiments (OSSEs). We study the sensitivity of the system to the ensemble size. we also access the benefits from using an in ation factor on the filter performance. To study the limitation of the Guassian restricted assumption on the SEIK lter, 5 we also implemented in the second part of this thesis a Markov Chain Monte Carlo (MCMC) method based on a Generalized Polynomial chaos (gPc) approach for the estimation of the 1-D and 2-D Mannning\\'s n coe cient. The gPc is used to build a surrogate model that imitate the ADCIRC model in order to make the computational cost of implementing the MCMC with the ADCIRC model reasonable. We evaluate the performance of the MCMC-gPc approach and study its robustness to di erent OSSEs scenario. we also compare its estimates with those resulting from SEIK in term of parameter estimates and full distributions. we present a full analysis of the solution of these two methods, of the

  1. Conformal Laplace superintegrable systems in 2D: polynomial invariant subspaces

    Science.gov (United States)

    Escobar-Ruiz, M. A.; Miller, Willard, Jr.

    2016-07-01

    2nd-order conformal superintegrable systems in n dimensions are Laplace equations on a manifold with an added scalar potential and 2n-1 independent 2nd order conformal symmetry operators. They encode all the information about Helmholtz (eigenvalue) superintegrable systems in an efficient manner: there is a 1-1 correspondence between Laplace superintegrable systems and Stäckel equivalence classes of Helmholtz superintegrable systems. In this paper we focus on superintegrable systems in two-dimensions, n = 2, where there are 44 Helmholtz systems, corresponding to 12 Laplace systems. For each Laplace equation we determine the possible two-variate polynomial subspaces that are invariant under the action of the Laplace operator, thus leading to families of polynomial eigenfunctions. We also study the behavior of the polynomial invariant subspaces under a Stäckel transform. The principal new results are the details of the polynomial variables and the conditions on parameters of the potential corresponding to polynomial solutions. The hidden gl 3-algebraic structure is exhibited for the exact and quasi-exact systems. For physically meaningful solutions, the orthogonality properties and normalizability of the polynomials are presented as well. Finally, for all Helmholtz superintegrable solvable systems we give a unified construction of one-dimensional (1D) and two-dimensional (2D) quasi-exactly solvable potentials possessing polynomial solutions, and a construction of new 2D PT-symmetric potentials is established.

  2. On the field theory expansion of superstring five point amplitudes

    CERN Document Server

    Boels, Rutger H

    2013-01-01

    A simple recursive expansion algorithm for the integrals of superstring five point amplitudes in a flat background is given which reduces the expansion to simple symbol(ic) manipulations. This approach can be used for instance to prove the expansion is maximally transcendental to all orders and to verify several conjectures made in recent literature to high order. Starting at order eighteen for instance new identities for products of certain matrices associated to single (odd) zeta values are identified. For closed strings apart from generalities in particular the maximal R-symmetry violating amplitudes in type IIB superstring theory are studied. The obtained expansion of the open string amplitudes reduces the analysis for MRV amplitudes to the classification of completely symmetric polynomials of the external legs, up to momentum conservation. Using Molien's theorem as a counting tool this problem is solved by constructing an explicit nine element basis for this class. This theorem may be of wider interest: ...

  3. Ladder operators and recursion relations for the associated Bessel polynomials

    International Nuclear Information System (INIS)

    Introducing the associated Bessel polynomials in terms of two non-negative integers, and under an integrability condition we simultaneously factorize their corresponding differential equation into a product of the ladder operators by four different ways as shape invariance symmetry equations. This procedure gives four different pairs of recursion relations on the associated Bessel polynomials. In spite of description of Bessel and Laguerre polynomials in terms of each other, we show that the associated Bessel differential equation is factorized in four different ways whereas for Laguerre one we have three different ways

  4. Ladder operators and recursion relations for the associated Bessel polynomials

    Science.gov (United States)

    Fakhri, H.; Chenaghlou, A.

    2006-10-01

    Introducing the associated Bessel polynomials in terms of two non-negative integers, and under an integrability condition we simultaneously factorize their corresponding differential equation into a product of the ladder operators by four different ways as shape invariance symmetry equations. This procedure gives four different pairs of recursion relations on the associated Bessel polynomials. In spite of description of Bessel and Laguerre polynomials in terms of each other, we show that the associated Bessel differential equation is factorized in four different ways whereas for Laguerre one we have three different ways.

  5. Ladder operators and recursion relations for the associated Bessel polynomials

    Energy Technology Data Exchange (ETDEWEB)

    Fakhri, H. [Institute for Studies in Theoretical Physics and Mathematics (IPM), PO Box 19395-5531, Tehran (Iran, Islamic Republic of) and Department of Theoretical Physics and Astrophysics, Physics Faculty, Tabriz University, PO Box 51666-16471, Tabriz (Iran, Islamic Republic of)]. E-mail: hfakhri@ipm.ir; Chenaghlou, A. [Institute for Studies in Theoretical Physics and Mathematics (IPM), PO Box 19395-5531, Tehran (Iran, Islamic Republic of) and Physics Department, Faculty of Science, Sahand University of Technology, PO Box 51335-1996, Tabriz (Iran, Islamic Republic of)]. E-mail: a.chenaghlou@sut.ac.ir

    2006-10-30

    Introducing the associated Bessel polynomials in terms of two non-negative integers, and under an integrability condition we simultaneously factorize their corresponding differential equation into a product of the ladder operators by four different ways as shape invariance symmetry equations. This procedure gives four different pairs of recursion relations on the associated Bessel polynomials. In spite of description of Bessel and Laguerre polynomials in terms of each other, we show that the associated Bessel differential equation is factorized in four different ways whereas for Laguerre one we have three different ways.

  6. Polynomial system solving for decoding linear codes and algebraic cryptanalysis

    OpenAIRE

    Bulygin, Stanislav

    2009-01-01

    This thesis is devoted to applying symbolic methods to the problems of decoding linear codes and of algebraic cryptanalysis. The paradigm we employ here is as follows. We reformulate the initial problem in terms of systems of polynomial equations over a finite field. The solution(s) of such systems should yield a way to solve the initial problem. Our main tools for handling polynomials and polynomial systems in such a paradigm is the technique of Gröbner bases and normal form reductions. The ...

  7. Stable radial distortion calibration by polynomial matrix inequalities programming

    CERN Document Server

    Heller, Jan; Pajdla, Tomas

    2014-01-01

    Polynomial and rational functions are the number one choice when it comes to modeling of radial distortion of lenses. However, several extrapolation and numerical issues may arise while using these functions that have not been covered by the literature much so far. In this paper, we identify these problems and show how to deal with them by enforcing nonnegativity of certain polynomials. Further, we show how to model these nonnegativities using polynomial matrix inequalities (PMI) and how to estimate the radial distortion parameters subject to PMI constraints using semidefinite programming (SDP). Finally, we suggest several approaches on how to incorporate the proposed method into the overall camera calibration procedure.

  8. Ratio Monotonicity of Polynomials Derived from Nondecreasing Sequences

    CERN Document Server

    Chen, William Y C; Zhou, Elaine L F

    2010-01-01

    The ratio monotonicity of a polynomial is a stronger property than log-concavity. Let P(x) be a polynomial with nonnegative and nondecreasing coefficients. We prove the ratio monotone property of P(x+1), which leads to the log-concavity of P(x+c) for any $c\\geq 1$ due to Llamas and Mart\\'{\\i}nez-Bernal. As a consequence, we obtain the ratio monotonicity of the Boros-Moll polynomials obtained by Chen and Xia without resorting to the recurrence relations of the coefficients.

  9. Transfer matrix computation of generalised critical polynomials in percolation

    OpenAIRE

    Scullard, Christian R.; Jacobsen, Jesper Lykke

    2012-01-01

    Percolation thresholds have recently been studied by means of a graph polynomial $P_B(p)$, henceforth referred to as the critical polynomial, that may be defined on any periodic lattice. The polynomial depends on a finite subgraph $B$, called the basis, and the way in which the basis is tiled to form the lattice. The unique root of $P_B(p)$ in $[0,1]$ either gives the exact percolation threshold for the lattice, or provides an approximation that becomes more accurate with appropriately increa...

  10. Separation of variables in the A$_{2}$ type Jack polynomials

    CERN Document Server

    Kuznetsov, V B

    1995-01-01

    An integral operator M is constructed performing a separation of variables for the 3-particle quantum Calogero-Sutherland (CS) model. Under the action of M the CS eigenfunctions (Jack polynomials for the root system A_2) are transformed to the factorized form \\phi(y_1)\\phi(y_2), where \\phi(y) is a trigonometric polynomial of one variable expressed in terms of the {}_3F_2 hypergeometric series. The inversion of M produces a new integral representation for the A_2 Jack polynomials.

  11. Combinatorial theory of Macdonald polynomials I: Proof of Haglund's formula

    OpenAIRE

    Haglund, J.; Haiman, M.; Loehr, N.

    2005-01-01

    Haglund recently proposed a combinatorial interpretation of the modified Macdonald polynomials H̃μ. We give a combinatorial proof of this conjecture, which establishes the existence and integrality of H̃μ. As corollaries, we obtain the cocharge formula of Lascoux and Schützenberger for Hall–Littlewood polynomials, a formula of Sahi and Knop for Jack's symmetric functions, a generalization of this result to the integral Macdonald polynomials Jμ, a formula for H̃μ in terms of Lascoux–Leclerc–Th...

  12. The F-pure threshold of quasi-homogeneous polynomials

    OpenAIRE

    Müller, Susanne

    2016-01-01

    Inspired by the work of Bhatt and Singh (see: arXiv:1307.1171) we compute the $F$-pure threshold of quasi-homogeneous polynomials. We first consider the case of a curve given by a quasi-homogeneous polynomial $f$ in three variables $x,y,z$ of degree equal to the degree of $xyz$ and then we proceed with the general case of a Calabi-Yau hypersurface, i.e. a hypersurface given by a quasi-homogeneous polynomial $f$ in $n+1$ variables $x_0, \\ldots, x_n$ of degree equal to the degree of $x_0 \\cdots...

  13. Generalizations of Poly-Bernoulli numbers and polynomials

    OpenAIRE

    Jolany, Hassan; Darafsheh, M. R.; Alikelaye, R. Eizadi

    2012-01-01

    The Concepts of poly-Bernoulli numbers $B_n^{(k)}$, poly-Bernoulli polynomials $B_n^{k}{(t)}$ and the generalized poly-bernoulli numbers $B_{n}^{(k)}(a,b)$ are generalized to $B_{n}^{(k)}(t,a,b,c)$ which is called the generalized poly-Bernoulli polynomials depending on real parameters \\textit{a,b,c}. Some properties of these polynomials and some relationships between $B_n^{k}$, $B_n^{(k)}(t)$, $B_{n}^{(k)}(a,b)$ and $B_{n}^{(k)}(t,a,b,c)$ are established

  14. Generalized Freud's equation and level densities with polynomial potential

    Science.gov (United States)

    Boobna, Akshat; Ghosh, Saugata

    2013-08-01

    We study orthogonal polynomials with weight $\\exp[-NV(x)]$, where $V(x)=\\sum_{k=1}^{d}a_{2k}x^{2k}/2k$ is a polynomial of order 2d. We derive the generalised Freud's equations for $d=3$, 4 and 5 and using this obtain $R_{\\mu}=h_{\\mu}/h_{\\mu -1}$, where $h_{\\mu}$ is the normalization constant for the corresponding orthogonal polynomials. Moments of the density functions, expressed in terms of $R_{\\mu}$, are obtained using Freud's equation and using this, explicit results of level densities as $N\\rightarrow\\infty$ are derived.

  15. Uniform asymptotics of the coefficients of unitary moment polynomials

    CERN Document Server

    Hiary, Ghaith A

    2010-01-01

    Keating and Snaith showed that the $2k^{th}$ absolute moment of the characteristic polynomial of a random unitary matrix evaluated on the unit circle is given by a polynomial of degree $k^2$. In this article, uniform asymptotics for the coefficients of that polynomial are derived, and a maximal coefficient is located. Some of the asymptotics are given in explicit form. Numerical data to support these calculations are presented. Some apparent connections between random matrix theory and the Riemann zeta function are discussed.

  16. q-Bernoulli numbers and q-Bernoulli polynomials revisited

    Directory of Open Access Journals (Sweden)

    Kim Taekyun

    2011-01-01

    Full Text Available Abstract This paper performs a further investigation on the q-Bernoulli numbers and q-Bernoulli polynomials given by Acikgöz et al. (Adv Differ Equ, Article ID 951764, 9, 2010, some incorrect properties are revised. It is point out that the generating function for the q-Bernoulli numbers and polynomials is unreasonable. By using the theorem of Kim (Kyushu J Math 48, 73-86, 1994 (see Equation 9, some new generating functions for the q-Bernoulli numbers and polynomials are shown. Mathematics Subject Classification (2000 11B68, 11S40, 11S80

  17. Integral Inequalities for Self-Reciprocal Polynomials

    Indian Academy of Sciences (India)

    Horst Alzer

    2010-04-01

    Let $n≥ 1$ be an integer and let $\\mathcal{P}_n$ be the class of polynomials of degree at most satisfying $z^nP(1/z)=P(z)$ for all $z\\in C$. Moreover, let be an integer with $1≤ r≤ n$. Then we have for all $P\\in\\mathcal{P}_n$: $$_n(r)\\int^{2}_0|P(e^{it})|^2dt≤\\int^{2}_0|P^{(r)}(e^{it})|^2dt≤_n(r)\\int^{2}_0|P(e^{it})|^2dt$$ with the best possible factors \\begin{equation*}_n(r)=\\begin{cases}\\prod^{r-1}_{j=0}\\left(\\frac{n}{2}-j\\right)^2, < \\text{if is even},\\\\ \\frac{1}{2}\\left[\\prod^{r-1}_{j=0}\\left(\\frac{n+1}{2}-j\\right)^2+\\prod^{r-1}_{j=0}\\left(\\frac{n-1}{2}-j\\right)^2\\right], < \\text{if is odd},\\end{cases}\\end{equation*} and \\begin{equation*}_n(r)=\\frac{1}{2}\\prod\\limits^{r-1}_{j=0}(n-j)^2.\\end{equation*} This refines and extends a result due to Aziz and Zargar (1997).

  18. Constructing Polynomial Spectral Models for Stars

    CERN Document Server

    Rix, Hans-Walter; Conroy, Charlie; Hogg, David W

    2016-01-01

    Stellar spectra depend on the stellar parameters and on dozens of photospheric elemental abundances. Simultaneous fitting of these $\\mathcal{N}\\sim \\,$10-40 model labels to observed spectra has been deemed unfeasible, because the number of ab initio spectral model grid calculations scales exponentially with $\\mathcal{N}$. We suggest instead the construction of a polynomial spectral model (PSM) of order $\\mathcal{O}$ for the model flux at each wavelength. Building this approximation requires a minimum of only ${\\mathcal{N}+\\mathcal{O}\\choose\\mathcal{O}}$ calculations: e.g. a quadratic spectral model ($\\mathcal{O}=\\,$2), which can then fit $\\mathcal{N}=\\,$20 labels simultaneously, can be constructed from as few as 231 ab initio spectral model calculations; in practice, a somewhat larger number ($\\sim\\,$300-1000) of randomly chosen models lead to a better performing PSM. Such a PSM can be a good approximation to ab initio spectral models only over a limited portion of label space, which will vary case by case. Y...

  19. Polynomial Method for PLL Controller Optimization

    Directory of Open Access Journals (Sweden)

    Tsung-Yu Chiou

    2011-06-01

    Full Text Available The Phase-Locked Loop (PLL is a key component of modern electronic communication and control systems. PLL is designed to extract signals from transmission channels. It plays an important role in systems where it is required to estimate the phase of a received signal, such as carrier tracking from global positioning system satellites. In order to robustly provide centimeter-level accuracy, it is crucial for the PLL to estimate the instantaneous phase of an incoming signal which is usually buried in random noise or some type of interference. This paper presents an approach that utilizes the recent development in the semi-definite programming and sum-of-squares field. A Lyapunov function will be searched as the certificate of the pull-in range of the PLL system. Moreover, a polynomial design procedure is proposed to further refine the controller parameters for system response away from the equilibrium point. Several simulation results as well as an experiment result are provided to show the effectiveness of this approach.

  20. Polynomial Time Algorithms for Minimum Energy Scheduling

    CERN Document Server

    Baptiste, Philippe; Durr, Christoph

    2009-01-01

    The aim of power management policies is to reduce the amount of energy consumed by computer systems while maintaining satisfactory level of performance. One common method for saving energy is to simply suspend the system during the idle times. No energy is consumed in the suspend mode. However, the process of waking up the system itself requires a certain fixed amount of energy, and thus suspending the system is beneficial only if the idle time is long enough to compensate for this additional energy expenditure. In the specific problem studied in the paper, we have a set of jobs with release times and deadlines that need to be executed on a single processor. Preemptions are allowed. The processor requires energy L to be woken up and, when it is on, it uses one unit of energy per one unit of time. It has been an open problem whether a schedule minimizing the overall energy consumption can be computed in polynomial time. We solve this problem in positive, by providing an O(n^5)-time algorithm. In addition we pr...

  1. Polynomial super-gl(n) algebras

    International Nuclear Information System (INIS)

    We introduce a class of finite-dimensional nonlinear superalgebras L L0-bar + L1-bar providing gradings of L0-bar = gl(n) ≅ sl(n) + gl(1). Odd generators close by anticommutation on polynomials (of degree >1) in the gl(n) generators. Specifically, we investigate 'type I' super-gl(n) algebras, having odd generators transforming in a single irreducible representation of gl(n) together with its contragredient. Admissible structure constants are discussed in terms of available gl(n) couplings, and various special cases and candidate superalgebras are identified and exemplified via concrete oscillator constructions. For the case of the n-dimensional defining representation, with odd generators Qa, Q-barb and even generators Eab, a, b = 1, ..., n, a three-parameter family of quadratic super-gl(n) algebras (deformations of sl(n/1)) is defined. In general, additional covariant Serre-type conditions are imposed in order that the Jacobi identities are fulfilled. For these quadratic super-gl(n) algebras, the construction of Kac modules and conditions for atypicality are briefly considered. Applications in quantum field theory, including Hamiltonian lattice QCD and spacetime supersymmetry, are discussed

  2. An analysis of polynomial chaos approximations for modeling single-fluid-phase flow in porous medium systems

    International Nuclear Information System (INIS)

    We examine a variety of polynomial-chaos-motivated approximations to a stochastic form of a steady state groundwater flow model. We consider approaches for truncating the infinite dimensional problem and producing decoupled systems. We discuss conditions under which such decoupling is possible and show that to generalize the known decoupling by numerical cubature, it would be necessary to find new multivariate cubature rules. Finally, we use the acceleration of Monte Carlo to compare the quality of polynomial models obtained for all approaches and find that in general the methods considered are more efficient than Monte Carlo for the relatively small domains considered in this work. A curse of dimensionality in the series expansion of the log-normal stochastic random field used to represent hydraulic conductivity provides a significant impediment to efficient approximations for large domains for all methods considered in this work, other than the Monte Carlo method

  3. Quantization of gauge fields, graph polynomials and graph homology

    International Nuclear Information System (INIS)

    We review quantization of gauge fields using algebraic properties of 3-regular graphs. We derive the Feynman integrand at n loops for a non-abelian gauge theory quantized in a covariant gauge from scalar integrands for connected 3-regular graphs, obtained from the two Symanzik polynomials. The transition to the full gauge theory amplitude is obtained by the use of a third, new, graph polynomial, the corolla polynomial. This implies effectively a covariant quantization without ghosts, where all the relevant signs of the ghost sector are incorporated in a double complex furnished by the corolla polynomial–we call it cycle homology–and by graph homology. -- Highlights: •We derive gauge theory Feynman from scalar field theory with 3-valent vertices. •We clarify the role of graph homology and cycle homology. •We use parametric renormalization and the new corolla polynomial

  4. On polynomial mappings from the plane to the plane

    OpenAIRE

    Krzyżanowska, Iwona; Szafraniec, Zbigniew

    2012-01-01

    Let $f:{\\mathbb R}^2\\longrightarrow {\\mathbb R}^2$ be a generic polynomial mapping. There are constructed quadratic forms whose signatures determine the number of positive and negative cusps of $f$.

  5. Complete permutation polynomials over finite fields of odd characteristic

    OpenAIRE

    Xu, Guangkui; Cao, Xiwang; Tu, Ziran; Zeng, Xiangyong; Hu, Lei

    2013-01-01

    In this paper, we present three classes of complete permutation monomials over finite fields of odd characteristic. Meanwhile, the compositional inverses of these complete permutation polynomials are also proposed.

  6. Polynomials on the space of ω-ultradifferentiable functions

    OpenAIRE

    Katarzyna Grasela

    2007-01-01

    The space of polynomials on the the space \\(D_{\\omega}\\) of \\(\\omega\\)-ultradifferentiable functions is represented as the direct sum of completions of symmetric tensor powers of \\(D^{\\prime}_{\\omega}\\).

  7. APPROXIMATION BY GENERALIZED MKZ-OPERATORS IN POLYNOMIAL WEIGHTED SPACES

    Institute of Scientific and Technical Information of China (English)

    Lucyna Rempulska; Mariola Skorupka

    2007-01-01

    We prove some approximation properties of generalized Meyer-K(o)nig and Zeller operators for differentiable functions in polynomial weighted spaces. The results extend some results proved in [ 1-3,7-16].

  8. Inner approximations for polynomial matrix inequalities and robust stability regions

    CERN Document Server

    Henrion, Didier

    2011-01-01

    Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by parametrized polynomial matrix inequalities (PMI). These feasibility sets are typically nonconvex. Given a parametrized PMI set, we provide a hierarchy of linear matrix inequality (LMI) problems whose optimal solutions generate inner approximations modelled by a single polynomial sublevel set. Those inner approximations converge in a strong analytic sense to the nonconvex original feasible set, with asymptotically vanishing conservatism. One may also impose the hierarchy of inner approximations to be nested or convex. In the latter case they do not converge any more to the feasible set, but they can be used in a convex optimization framework at the price of some conservatism. Finally, we show that the specific geometry of nonconvex polynomial stability regions can be exploited to improve convergence of the hierarchy of inner approximation...

  9. On the one dimensional polynomial and regular images of Rn

    OpenAIRE

    Fernando Galván, José Francisco

    2014-01-01

    his work we present a full geometric characterization of the 1-dimensional polynomial and regular images S of Rn and we compute for all of them the invariants ppSq and rpSq, already introduced in [FG2].

  10. Stability of the Bose-Einstein condensate under polynomial perturbations

    OpenAIRE

    Gielerak, R.; Damek, J.

    2002-01-01

    The problem of the Bose-Einstein condensate preservation under thermofield and standard gauge-invariant perturbations is discussed. A new result on stability of the condensate under thermofield perturbations of a polynomial type is presented.

  11. Some functional inequalities on polynomial volume growth Lie groups

    OpenAIRE

    Chamorro, Diego

    2010-01-01

    We study in this article some Sobolev-type inequalities on polynomial volume growth Lie groups. We show in particular that improved Sobolev inequalities can be extended without the use of the Littlewood-Paley decomposition to this general framework.

  12. Force prediction in cold rolling mills by polynomial methods

    Directory of Open Access Journals (Sweden)

    Nicu ROMAN

    2007-12-01

    Full Text Available A method for steel and aluminium strip thickness control is provided including a new technique for predictive rolling force estimation method by statistic model based on polynomial techniques.

  13. Maximum likelihood polynomial regression for robust speech recognition

    Institute of Scientific and Technical Information of China (English)

    LU Yong; WU Zhenyang

    2011-01-01

    The linear hypothesis is the main disadvantage of maximum likelihood linear re- gression (MLLR). This paper applies the polynomial regression method to model adaptation and establishes a nonlinear model adaptation algorithm using maximum likelihood polyno

  14. Polynomial form of the Hilbert-Einstein action

    OpenAIRE

    Katanaev, M. O.

    2005-01-01

    Configuration space of general relativity is extended by inclusion of the determinant of the metric as a new independent variable. As the consequence the Hilbert-Einstein action takes a polynomial form.

  15. Quantization of gauge fields, graph polynomials and graph homology

    Energy Technology Data Exchange (ETDEWEB)

    Kreimer, Dirk, E-mail: kreimer@physik.hu-berlin.de [Humboldt University, 10099 Berlin (Germany); Sars, Matthias [Humboldt University, 10099 Berlin (Germany); Suijlekom, Walter D. van [Radboud University Nijmegen, 6525 AJ Nijmegen (Netherlands)

    2013-09-15

    We review quantization of gauge fields using algebraic properties of 3-regular graphs. We derive the Feynman integrand at n loops for a non-abelian gauge theory quantized in a covariant gauge from scalar integrands for connected 3-regular graphs, obtained from the two Symanzik polynomials. The transition to the full gauge theory amplitude is obtained by the use of a third, new, graph polynomial, the corolla polynomial. This implies effectively a covariant quantization without ghosts, where all the relevant signs of the ghost sector are incorporated in a double complex furnished by the corolla polynomial–we call it cycle homology–and by graph homology. -- Highlights: •We derive gauge theory Feynman from scalar field theory with 3-valent vertices. •We clarify the role of graph homology and cycle homology. •We use parametric renormalization and the new corolla polynomial.

  16. Cauchy-Kowalevski and polynomial ordinary differential equations

    Directory of Open Access Journals (Sweden)

    Roger J. Thelwell

    2012-01-01

    Full Text Available The Cauchy-Kowalevski Theorem is the foremost result guaranteeing existence and uniqueness of local solutions for analytic quasilinear partial differential equations with Cauchy initial data. The techniques of Cauchy-Kowalevski may also be applied to initial-value ordinary differential equations. These techniques, when applied in the polynomial ordinary differential equation setting, lead one naturally to a method in which coefficients of the series solution are easily computed in a recursive manner, and an explicit majorization admits a clear a priori error bound. The error bound depends only on immediately observable quantities of the polynomial system; coefficients, initial conditions, and polynomial degree. The numerous benefits of the polynomial system are shown for a specific example.

  17. Guts of surfaces and the colored Jones polynomial

    CERN Document Server

    Futer, David; Purcell, Jessica

    2013-01-01

    This monograph derives direct and concrete relations between colored Jones polynomials and the topology of incompressible spanning surfaces in knot and link complements. Under mild diagrammatic hypotheses, we prove that the growth of the degree of the colored Jones polynomials is a boundary slope of an essential surface in the knot complement. We show that certain coefficients of the polynomial measure how far this surface is from being a fiber for the knot; in particular, the surface is a fiber if and only if a particular coefficient vanishes. We also relate hyperbolic volume to colored Jones polynomials. Our method is to generalize the checkerboard decompositions of alternating knots. Under mild diagrammatic hypotheses, we show that these surfaces are essential, and obtain an ideal polyhedral decomposition of their complement. We use normal surface theory to relate the pieces of the JSJ decomposition of the  complement to the combinatorics of certain surface spines (state graphs). Since state graphs have p...

  18. Performance comparison of polynomial representations for optimizing optical freeform systems

    Science.gov (United States)

    Brömel, A.; Gross, H.; Ochse, D.; Lippmann, U.; Ma, C.; Zhong, Y.; Oleszko, M.

    2015-09-01

    Optical systems can benefit strongly from freeform surfaces, however the choice of the right representation isn`t an easy one. Classical representations like X-Y-polynomials, as well as Zernike-polynomials are often used for such systems, but should have some disadvantage regarding their orthogonality, resulting in worse convergence and reduced quality in final results compared to newer representations like the Q-polynomials by Forbes. Additionally the supported aperture is a circle, which can be a huge drawback in case of optical systems with rectangular aperture. In this case other representations like Chebyshev-or Legendre-polynomials come into focus. There are a larger number of possibilities; however the experience with these newer representations is rather limited. Therefore in this work the focus is on investigating the performance of four widely used representations in optimizing two ambitious systems with very different properties: Three-Mirror-Anastigmat and an anamorphic System. The chosen surface descriptions offer support for circular or rectangular aperture, as well as different grades of departure from rotational symmetry. The basic shapes are for example a conic or best-fit-sphere and the polynomial set is non-, spatial or slope-orthogonal. These surface representations were chosen to evaluate the impact of these aspects on the performance optimization of the two example systems. Freeform descriptions investigated here were XY-polynomials, Zernike in Fringe representation, Q-polynomials by Forbes, as well as 2-dimensional Chebyshev-polynomials. As a result recommendations for the right choice of freeform surface representations for practical issues in the optimization of optical systems can be given.

  19. Polynomials whose reducibility is related to the Goldbach conjecture

    OpenAIRE

    Borwein, Peter B.; Choi, Stephen K. K.; Martin, Greg; Samuels, Charles L.

    2014-01-01

    We introduce a collection of polynomials $F_N$, associated to each positive integer $N$, whose divisibility properties yield a reformulation of the Goldbach conjecture. While this reformulation certainly does not lead to a resolution of the conjecture, it does suggest two natural generalizations for which we provide some numerical evidence. As these polynomials $F_N$ are independently interesting, we further explore their basic properties, giving, among other things, asymptotic estimates on t...

  20. Finding low-weight polynomial multiples using discrete logarithm

    OpenAIRE

    Didier, Frédéric; Laigle-Chapuy, Yann

    2007-01-01

    Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The classical algorithm to solve this problem is based on a time memory trade-off. We will present an improvement to this approach using discrete logarithm rather than a direct representation of the involved polynomials. This gives an algorithm which improves the theoretical complexity, and is also very flexible in practice.

  1. Exploiting symmetries in SDP-relaxations for polynomial optimization

    OpenAIRE

    Riener, Cordian; Theobald, Thorsten; Andrén, Lina Jansson; Lasserre, Jean B.

    2011-01-01

    In this paper we study various approaches for exploiting symmetries in polynomial optimization problems within the framework of semi definite programming relaxations. Our special focus is on constrained problems especially when the symmetric group is acting on the variables. In particular, we investigate the concept of block decomposition within the framework of constrained polynomial optimization problems, show how the degree principle for the symmetric group can be computationally exploited...

  2. Modeling Microwave Structures in Time Domain Using Laguerre Polynomials

    OpenAIRE

    Z. Raida; Lacik, J.

    2006-01-01

    The paper is focused on time domain modeling of microwave structures by the method of moments. Two alternative schemes with weighted Laguerre polynomials are presented. Thanks to their properties, these schemes are free of late time oscillations. Further, the paper is aimed to effective and accurate evaluation of Green's functions integrals within these schemes. For this evaluation, a first- and second-order polynomial approximation is developed. The last part of the paper deals with mode...

  3. Auslander-Reiten conjecture for symmetric algebras of polynomial growth

    OpenAIRE

    Zhou, Guodong; Zimmermann, Alexander

    2010-01-01

    This paper studies self-injective algebras of polynomial growth. We prove that the derived equivalence classification of weakly symmetric algebras of domestic type coincides with the classification up to stable equivalences (of Morita type). As for weakly symmetric non-domestic algebras of polynomial growth, up to some scalar problems, the derived equivalence classification coincides with the classification up to stable equivalences of Morita type. As a consequence, we get the validity of the...

  4. On Sharing, Memoization, and Polynomial Time (Long Version)

    OpenAIRE

    Avanzini, Martin; Lago, Ugo Dal

    2015-01-01

    We study how the adoption of an evaluation mechanism with sharing and memoization impacts the class of functions which can be computed in polynomial time. We first show how a natural cost model in which lookup for an already computed value has no cost is indeed invariant. As a corollary, we then prove that the most general notion of ramified recurrence is sound for polynomial time, this way settling an open problem in implicit computational complexity.

  5. Exact Bivariate Polynomial Factorization in Q by Approximation of Roots

    OpenAIRE

    Feng, Yong; Wu, Wenyuan; Zhang, Jingzhong

    2010-01-01

    Factorization of polynomials is one of the foundations of symbolic computation. Its applications arise in numerous branches of mathematics and other sciences. However, the present advanced programming languages such as C++ and J++, do not support symbolic computation directly. Hence, it leads to difficulties in applying factorization in engineering fields. In this paper, we present an algorithm which use numerical method to obtain exact factors of a bivariate polynomial with rational coeffici...

  6. General Convolution Identities for Bernoulli and Euler Polynomials

    OpenAIRE

    Dilcher, K.; Vignat , C.

    2015-01-01

    Using general identities for difference operators, as well as a technique of symbolic computation and tools from probability theory, we derive very general kth order (k \\ge 2) convolution identities for Bernoulli and Euler polynomials. This is achieved by use of an elementary result on uniformly distributed random variables. These identities depend on k positive real parameters, and as special cases we obtain numerous known and new identities for these polynomials. In particular we show that ...

  7. Invariant hyperplanes and Darboux integrability of polynomial vector fields

    International Nuclear Information System (INIS)

    This paper is composed of two parts. In the first part, we provide an upper bound for the number of invariant hyperplanes of the polynomial vector fields in n variables. This result generalizes those given in Artes et al (1998 Pac. J. Math. 184 207-30) and Llibre and Rodriguez (2000 Bull. Sci. Math. 124 599-619). The second part gives an extension of the Darboux theory of integrability to polynomial vector fields on algebraic varieties

  8. Zeros of differential polynomials in real meromorphic functions

    OpenAIRE

    Bergweiler, W.; Eremenko, A.; Langley, J.

    2004-01-01

    We show that for a real transcendental meromorphic function f, the differential polynomial f'+f^m with m > 4 has infinitely many non-real zeros. Similar results are obtained for differential polynomials f'f^m-1. We specially investigate the case of meromorphic functions with finitely many poles. We show by examples the precision of our results. One of our main tools is the Fatou theorem from complex dynamics.

  9. CONVERGENCE ARTE FOR INTERATES OF q-BERNSTEIN POLYNOMIALS

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    Recently, q-Bernstein polynomials have been intensively investigated by a number of authors. Their results show that for q ≠ 1, q-Bernstein polynomials possess of many interesting properties. In this paper, the convergence rate for iterates of both q-Bernstein when n →∞ and convergence rate of Bn(f,q;x) when f ∈ Cn-1[0, 1], q →∞ are also presented.

  10. Fast parallel computation of polynomials using few processors

    DEFF Research Database (Denmark)

    Valiant, Leslie; Skyum, Sven

    1981-01-01

    It is shown that any multivariate polynomial that can be computed sequentially in C steps and has degree d can be computed in parallel in 0((log d) (log C + log d)) steps using only (Cd)0(1) processors.......It is shown that any multivariate polynomial that can be computed sequentially in C steps and has degree d can be computed in parallel in 0((log d) (log C + log d)) steps using only (Cd)0(1) processors....

  11. Fast Parallel Computation of Polynomials Using Few Processors

    DEFF Research Database (Denmark)

    Valiant, Leslie G.; Skyum, Sven; Berkowitz, S.;

    1983-01-01

    It is shown that any multivariate polynomial of degree $d$ that can be computed sequentially in $C$ steps can be computed in parallel in $O((\\log d)(\\log C + \\log d))$ steps using only $(Cd)^{O(1)} $ processors.......It is shown that any multivariate polynomial of degree $d$ that can be computed sequentially in $C$ steps can be computed in parallel in $O((\\log d)(\\log C + \\log d))$ steps using only $(Cd)^{O(1)} $ processors....

  12. Software for Exact Integration of Polynomials over Polyhedra

    CERN Document Server

    De Loera, Jesus; Koeppe, Matthias; Moreinis, Stanislav; Pinto, Gregory; Wu, Jianqiu

    2011-01-01

    We are interested in the fast computation of the exact value of integrals of polynomial functions over convex polyhedra. We present speed ups and extensions of the algorithms presented in previous work. We present the new software implementation and provide benchmark computations. The computation of integrals of polynomials over polyhedral regions has many applications; here we demonstrate our algorithmic tools solving a challenge from combinatorial voting theory.

  13. Sparse polynomial interpolation and the fast Euclidean algorithm

    OpenAIRE

    Go, Soo

    2012-01-01

    We introduce an algorithm to interpolate sparse multivariate polynomials with integer coefficients. Our algorithm modifies Ben-Or and Tiwari's deterministic algorithm for interpolating over rings of characteristic zero to work modulo p, a smooth prime of our choice. We present benchmarks comparing our algorithm to Zippel's probabilistic sparse interpolation algorithm, demonstrating that our algorithm makes fewer probes for sparse polynomials. Our interpolation algorithm requires finding roo...

  14. Nonstandard decision methods for the solvability of real polynomial equations

    Institute of Scientific and Technical Information of China (English)

    曾广兴

    1999-01-01

    For a multivariate polynomial equation with coefficients in a computable ordered field, two criteria of this equation having real solutions are given. Based on the criteria, decision methods for the existence of real zeros and the semidefiniteness of binary polynomials are provided. With the aid of computers, these methods are used to solve several examples. The technique is to extend the original field involved in the question to a computable non-Archimedean ordered field containing infinitesimal elements.

  15. Twisted exponential sums of polynomials in one variable

    Institute of Scientific and Technical Information of China (English)

    2010-01-01

    The twisted T-adic exponential sums associated to a polynomial in one variable are studied.An explicit arithmetic polygon in terms of the highest two exponents of the polynomial is proved to be a lower bound of the Newton polygon of the C-function of the twisted T-adic exponential sums.This bound gives lower bounds for the Newton polygon of the L-function of twisted p-power order exponential sums.

  16. First extension groups of Verma modules and $R$-polynomials

    CERN Document Server

    Abe, Noriyuki

    2010-01-01

    We study the first extension groups between Verma modules. There was a conjecture which claims that the dimensions of the higher extension groups between Verma modules are the coefficients of $R$-polynomials defined by Kazhdan-Lusztig. This conjecture was known as the Gabber-Joseph conjecture (although Gebber and Joseph did not state.) However, Boe gives a counterexample to this conjecture. In this paper, we study how far are the dimensions of extension groups from the coefficients of $R$-polynomials.

  17. Conference on Commutative rings, integer-valued polynomials and polynomial functions

    CERN Document Server

    Frisch, Sophie; Glaz, Sarah; Commutative Algebra : Recent Advances in Commutative Rings, Integer-Valued Polynomials, and Polynomial Functions

    2014-01-01

    This volume presents a multi-dimensional collection of articles highlighting recent developments in commutative algebra. It also includes an extensive bibliography and lists a substantial number of open problems that point to future directions of research in the represented subfields. The contributions cover areas in commutative algebra that have flourished in the last few decades and are not yet well represented in book form. Highlighted topics and research methods include Noetherian and non- Noetherian ring theory as well as integer-valued polynomials and functions. Specific topics include: ·    Homological dimensions of Prüfer-like rings ·    Quasi complete rings ·    Total graphs of rings ·    Properties of prime ideals over various rings ·    Bases for integer-valued polynomials ·    Boolean subrings ·    The portable property of domains ·    Probabilistic topics in Intn(D) ·    Closure operations in Zariski-Riemann spaces of valuation domains ·    Stability of do...

  18. Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states.

    Science.gov (United States)

    Traversa, Fabio Lorenzo; Ramella, Chiara; Bonani, Fabrizio; Di Ventra, Massimiliano

    2015-07-01

    Memcomputing is a novel non-Turing paradigm of computation that uses interacting memory cells (memprocessors for short) to store and process information on the same physical platform. It was recently proven mathematically that memcomputing machines have the same computational power of nondeterministic Turing machines. Therefore, they can solve NP-complete problems in polynomial time and, using the appropriate architecture, with resources that only grow polynomially with the input size. The reason for this computational power stems from properties inspired by the brain and shared by any universal memcomputing machine, in particular intrinsic parallelism and information overhead, namely, the capability of compressing information in the collective state of the memprocessor network. We show an experimental demonstration of an actual memcomputing architecture that solves the NP-complete version of the subset sum problem in only one step and is composed of a number of memprocessors that scales linearly with the size of the problem. We have fabricated this architecture using standard microelectronic technology so that it can be easily realized in any laboratory setting. Although the particular machine presented here is eventually limited by noise-and will thus require error-correcting codes to scale to an arbitrary number of memprocessors-it represents the first proof of concept of a machine capable of working with the collective state of interacting memory cells, unlike the present-day single-state machines built using the von Neumann architecture. PMID:26601208

  19. An overview on polynomial approximation of NP-hard problems

    Directory of Open Access Journals (Sweden)

    Paschos Vangelis Th.

    2009-01-01

    Full Text Available The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the NP-hard problems strongly motivates both the researchers and the practitioners to try to solve such problems heuristically, by making a trade-off between computational time and solution's quality. In other words, heuristic computation consists of trying to find not the best solution but one solution which is 'close to' the optimal one in reasonable time. Among the classes of heuristic methods for NP-hard problems, the polynomial approximation algorithms aim at solving a given NP-hard problem in poly-nomial time by computing feasible solutions that are, under some predefined criterion, as near to the optimal ones as possible. The polynomial approximation theory deals with the study of such algorithms. This survey first presents and analyzes time approximation algorithms for some classical examples of NP-hard problems. Secondly, it shows how classical notions and tools of complexity theory, such as polynomial reductions, can be matched with polynomial approximation in order to devise structural results for NP-hard optimization problems. Finally, it presents a quick description of what is commonly called inapproximability results. Such results provide limits on the approximability of the problems tackled.

  20. Characterizing Polynomial Time Computability of Rational and Real Functions

    Directory of Open Access Journals (Sweden)

    Walid Gomaa

    2009-11-01

    Full Text Available Recursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], and D. Lacombe [1955]. It is based on a discrete mechanical framework that can be used to model computation over the real numbers. In this context the computational complexity of real functions defined over compact domains has been extensively studied. However, much less have been done for other kinds of real functions. This article is divided into two main parts. The first part investigates polynomial time computability of rational functions and the role of continuity in such computation. On the one hand this is interesting for its own sake. On the other hand it provides insights into polynomial time computability of real functions for the latter, in the sense of recursive analysis, is modeled as approximations of rational computations. The main conclusion of this part is that continuity does not play any role in the efficiency of computing rational functions. The second part defines polynomial time computability of arbitrary real functions, characterizes it, and compares it with the corresponding notion over rational functions. Assuming continuity, the main conclusion is that there is a conceptual difference between polynomial time computation over the rationals and the reals manifested by the fact that there are polynomial time computable rational functions whose extensions to the reals are not polynomial time computable and vice versa.

  1. On the values of independence and domination polynomials at specific points

    Directory of Open Access Journals (Sweden)

    Saeid Alikhani

    2012-06-01

    Full Text Available Let G be a simple graph of order n. We consider the independence polynomial and the domination polynomial of a graph G. The value of a graph polynomial at a specific point can give sometimes a very surprising information about the structure of the graph. In this paper we investigate independence and domination polynomial at -1 and 1.

  2. On the field theory expansion of superstring five point amplitudes

    International Nuclear Information System (INIS)

    A simple recursive expansion algorithm for the integrals of tree level superstring five point amplitudes in a flat background is given which reduces the expansion to simple symbol(ic) manipulations. This approach can be used for instance to prove the expansion is maximally transcendental to all orders and to verify several conjectures made in recent literature to high order. Closed string amplitudes follow from these open string results by the KLT relations. To obtain insight into these results in particular the maximal R-symmetry violating amplitudes (MRV) in type IIB superstring theory are studied. The obtained expansion of the open string amplitudes reduces the analysis for MRV amplitudes to the classification of completely symmetric polynomials of the external legs, up to momentum conservation. Using Molien's theorem as a counting tool this problem is solved by constructing an explicit nine element basis for this class. This theorem may be of wider interest: as is illustrated at higher points it can be used to calculate dimensions of polynomials of external momenta invariant under any finite group for in principle any number of legs, up to momentum conservation

  3. On the field theory expansion of superstring five point amplitudes

    Energy Technology Data Exchange (ETDEWEB)

    Boels, Rutger H., E-mail: rutger.boels@desy.de

    2013-11-01

    A simple recursive expansion algorithm for the integrals of tree level superstring five point amplitudes in a flat background is given which reduces the expansion to simple symbol(ic) manipulations. This approach can be used for instance to prove the expansion is maximally transcendental to all orders and to verify several conjectures made in recent literature to high order. Closed string amplitudes follow from these open string results by the KLT relations. To obtain insight into these results in particular the maximal R-symmetry violating amplitudes (MRV) in type IIB superstring theory are studied. The obtained expansion of the open string amplitudes reduces the analysis for MRV amplitudes to the classification of completely symmetric polynomials of the external legs, up to momentum conservation. Using Molien's theorem as a counting tool this problem is solved by constructing an explicit nine element basis for this class. This theorem may be of wider interest: as is illustrated at higher points it can be used to calculate dimensions of polynomials of external momenta invariant under any finite group for in principle any number of legs, up to momentum conservation.

  4. On the field theory expansion of superstring five point amplitudes

    Science.gov (United States)

    Boels, Rutger H.

    2013-11-01

    A simple recursive expansion algorithm for the integrals of tree level superstring five point amplitudes in a flat background is given which reduces the expansion to simple symbol(ic) manipulations. This approach can be used for instance to prove the expansion is maximally transcendental to all orders and to verify several conjectures made in recent literature to high order. Closed string amplitudes follow from these open string results by the KLT relations. To obtain insight into these results in particular the maximal R-symmetry violating amplitudes (MRV) in type IIB superstring theory are studied. The obtained expansion of the open string amplitudes reduces the analysis for MRV amplitudes to the classification of completely symmetric polynomials of the external legs, up to momentum conservation. Using Molien's theorem as a counting tool this problem is solved by constructing an explicit nine element basis for this class. This theorem may be of wider interest: as is illustrated at higher points it can be used to calculate dimensions of polynomials of external momenta invariant under any finite group for in principle any number of legs, up to momentum conservation. In the closed (or mixed) case this follows after application of the Kawai-Lewellen-Tye [1] relations (or their analogons [2,3]).

  5. A polynomial chaos ensemble hydrologic prediction system for efficient parameter inference and robust uncertainty assessment

    Science.gov (United States)

    Wang, S.; Huang, G. H.; Baetz, B. W.; Huang, W.

    2015-11-01

    This paper presents a polynomial chaos ensemble hydrologic prediction system (PCEHPS) for an efficient and robust uncertainty assessment of model parameters and predictions, in which possibilistic reasoning is infused into probabilistic parameter inference with simultaneous consideration of randomness and fuzziness. The PCEHPS is developed through a two-stage factorial polynomial chaos expansion (PCE) framework, which consists of an ensemble of PCEs to approximate the behavior of the hydrologic model, significantly speeding up the exhaustive sampling of the parameter space. Multiple hypothesis testing is then conducted to construct an ensemble of reduced-dimensionality PCEs with only the most influential terms, which is meaningful for achieving uncertainty reduction and further acceleration of parameter inference. The PCEHPS is applied to the Xiangxi River watershed in China to demonstrate its validity and applicability. A detailed comparison between the HYMOD hydrologic model, the ensemble of PCEs, and the ensemble of reduced PCEs is performed in terms of accuracy and efficiency. Results reveal temporal and spatial variations in parameter sensitivities due to the dynamic behavior of hydrologic systems, and the effects (magnitude and direction) of parametric interactions depending on different hydrological metrics. The case study demonstrates that the PCEHPS is capable not only of capturing both expert knowledge and probabilistic information in the calibration process, but also of implementing an acceleration of more than 10 times faster than the hydrologic model without compromising the predictive accuracy.

  6. Uncertainty quantification in neutron transport with generalized polynomial chaos using the method of characteristics

    International Nuclear Information System (INIS)

    Highlights: ► The general theory for the stochastic method of characteristics is given. ► Stochastic space is discretised using the polynomial chaos technique. ► Stochastic Galerkin and collocation methods are used to solve the working equations. ► Fixed source and multiplying problems are used to illustrate the theory. ► For increased compute time, Galerkin methods show little benefit over collocation. - Abstract: The polynomial chaos expansion has been used to solve the mono-energetic stochastic neutron transport equation with the spatial and angular components discretised using the step characteristics method. Uncertainties were assumed to arise purely from the material cross sections and a novel method for treating uncertainties in discrete, uncorrelated, material regions has been proposed. The method is illustrated by numerical and Monte Carlo simulation of the mean, variance and probability density of the scalar flux for the fixed source Reed cell problem and a critical benchmark in one dimension. For the case of the critical benchmark we compare the results from the Newton–Krylov root finding method to that of the stochastic collocation method. We find that there is no benefit in the extra computation of using the Newton–Krylov method.

  7. X-ray spectrum estimation from transmission measurements by an exponential of a polynomial model

    Science.gov (United States)

    Perkhounkov, Boris; Stec, Jessika; Sidky, Emil Y.; Pan, Xiaochuan

    2016-04-01

    There has been much recent research effort directed toward spectral computed tomography (CT). An important step in realizing spectral CT is determining the spectral response of the scanning system so that the relation between material thicknesses and X-ray transmission intensity is known. We propose a few parameter spectrum model that can accurately model the X-ray transmission curves and has a form which is amenable to simultaneous spectral CT image reconstruction and CT system spectrum calibration. While the goal is to eventually realize the simultaneous image reconstruction/spectrum estimation algorithm, in this work we investigate the effectiveness of the model on spectrum estimation from simulated transmission measurements through known thicknesses of known materials. The simulated transmission measurements employ a typical X-ray spectrum used for CT and contain noise due to the randomness in detecting finite numbers of photons. The proposed model writes the X-ray spectrum as the exponential of a polynomial (EP) expansion. The model parameters are obtained by use of a standard software implementation of the Nelder-Mead simplex algorithm. The performance of the model is measured by the relative error between the predicted and simulated transmission curves. The estimated spectrum is also compared with the model X-ray spectrum. For reference, we also employ a polynomial (P) spectrum model and show performance relative to the proposed EP model.

  8. Efficient temperature-dependent Green's functions methods for realistic systems: compact grids for orthogonal polynomial transforms

    CERN Document Server

    Kananenka, Alexei A; Zgid, Dominika

    2015-01-01

    The temperature-dependent Matsubara Green's function that is used to describe temperature-dependent behavior is expressed on a numerical grid. While such a grid usually has a couple of hundred points for low-energy model systems, for realistic systems in large basis sets the size of an accurate grid can be tens of thousands of points, constituting a severe computational and memory bottleneck. In this paper, we determine efficient imaginary time grids for the temperature-dependent Matsubara Green's function formalism that can be used for calculations on realistic systems. We show that due to the use of orthogonal polynomial transform, we can restrict the imaginary time grid to few hundred points and reach micro-Hartree accuracy in the electronic energy evaluation. Moreover, we show that only a limited number of orthogonal polynomial expansion coefficients are necessary to preserve accuracy when working with a dual representation of Green's function or self-energy and transforming between the imaginary time and...

  9. Adaptive surrogate modeling by ANOVA and sparse polynomial dimensional decomposition for global sensitivity analysis in fluid simulation

    Science.gov (United States)

    Tang, Kunkun; Congedo, Pietro M.; Abgrall, Rémi

    2016-06-01

    The Polynomial Dimensional Decomposition (PDD) is employed in this work for the global sensitivity analysis and uncertainty quantification (UQ) of stochastic systems subject to a moderate to large number of input random variables. Due to the intimate connection between the PDD and the Analysis of Variance (ANOVA) approaches, PDD is able to provide a simpler and more direct evaluation of the Sobol' sensitivity indices, when compared to the Polynomial Chaos expansion (PC). Unfortunately, the number of PDD terms grows exponentially with respect to the size of the input random vector, which makes the computational cost of standard methods unaffordable for real engineering applications. In order to address the problem of the curse of dimensionality, this work proposes essentially variance-based adaptive strategies aiming to build a cheap meta-model (i.e. surrogate model) by employing the sparse PDD approach with its coefficients computed by regression. Three levels of adaptivity are carried out in this paper: 1) the truncated dimensionality for ANOVA component functions, 2) the active dimension technique especially for second- and higher-order parameter interactions, and 3) the stepwise regression approach designed to retain only the most influential polynomials in the PDD expansion. During this adaptive procedure featuring stepwise regressions, the surrogate model representation keeps containing few terms, so that the cost to resolve repeatedly the linear systems of the least-squares regression problem is negligible. The size of the finally obtained sparse PDD representation is much smaller than the one of the full expansion, since only significant terms are eventually retained. Consequently, a much smaller number of calls to the deterministic model is required to compute the final PDD coefficients.

  10. Permutation Polynomials of Degree 6 or 7 over Finite Fields of Characteristic 2

    OpenAIRE

    Li, Jiyou; Chandler, David B.; Xiang, Qing

    2010-01-01

    In \\cite{D1}, Dickson listed all permutation polynomials up to degree 5 over an arbitrary finite field, and all permutation polynomials of degree 6 over finite fields of odd characteristic. The classification of degree 6 permutation polynomials over finite fields of characteristic 2 was left incomplete. In this paper we complete the classification of permutation polynomials of degree 6 over finite fields of characteristic 2. In addition, all permutation polynomials of degree 7 over finite fie...

  11. Variations of the Ramanujan polynomials and remarks on $\\zeta(2j+1)/\\pi^{2j+1}$

    CERN Document Server

    Lalin, Matilde

    2011-01-01

    We observe that five polynomial families have all of their zeros on the unit circle. We prove the statements explicitly for four of the polynomial families. The polynomials have coefficients which involve Bernoulli numbers, Euler numbers, and the odd values of the Riemann zeta function. These polynomials are closely related to the Ramanujan polynomials, which were recently introduced by Murty, Smyth and Wang. Our proofs rely upon theorems of Schinzel, and Lakatos and Losonczi and some generalizations.

  12. Discriminants and functional equations for polynomials orthogonal on the unit circle

    International Nuclear Information System (INIS)

    We derive raising and lowering operators for orthogonal polynomials on the unit circle and find second order differential and q-difference equations for these polynomials. A general functional equation is found which allows one to relate the zeros of the orthogonal polynomials to the stationary values of an explicit quasi-energy and implies recurrences on the orthogonal polynomial coefficients. We also evaluate the discriminants and quantized discriminants of polynomials orthogonal on the unit circle

  13. Permutation Polynomials of Degree 6 or 7 over Finite Fields of Characteristic 2

    CERN Document Server

    Li, Jiyou; Xiang, Qing

    2010-01-01

    In \\cite{D1}, Dickson listed all permutation polynomials up to degree 5 over an arbitrary finite field, and all permutation polynomials of degree 6 over finite fields of odd characteristic. The classification of degree 6 permutation polynomials over finite fields of characteristic 2 was left incomplete. In this paper we complete the classification of permutation polynomials of degree 6 over finite fields of characteristic 2. In addition, all permutation polynomials of degree 7 over finite fields of characteristic 2 are classified.

  14. Virtual Structure Constants as Intersection Numbers of Moduli Space of Polynomial Maps with Two Marked Points

    Science.gov (United States)

    Jinzenji, Masao

    2008-12-01

    In this paper, we derive the virtual structure constants used in the mirror computation of the degree k hypersurface in CP N-1, by using a localization computation applied to moduli space of polynomial maps from CP 1 to CP N-1 with two marked points. This moduli space corresponds to the GIT quotient of the standard moduli space of instantons of Gauged Linear Sigma Model by the standard torus action. We also apply this technique to the non-nef local geometry {{\\cal O}(1)oplus {\\cal O}(-3)rightarrow CP1} and realize the mirror computation without using Birkhoff factorization. Especially, we obtain a geometrical construction of the expansion coefficients of the mirror maps of these models.

  15. From one-dimensional fields to Vlasov equilibria: Theory and application of Hermite polynomials

    CERN Document Server

    Allanson, O; Troscheit, S; Wilson, F

    2016-01-01

    We consider the theory and application of a solution method for the inverse problem in collisionless equilibria, namely that of calculating a Vlasov-Maxwell equilibrium for a given macroscopic (fluid) equilibrium. Using Jeans' Theorem, the equilibrium distribution functions are expressed as functions of the constants of motion, in the form of a Maxwellian multiplied by an unknown function of the canonical momenta. In this case it is possible to reduce the inverse problem to inverting Weierstrass transforms, which we achieve by using expansions over Hermite polynomials. A sufficient condition on the pressure tensor is found which guarantees the convergence and the boundedness of the candidate solution, when satisfied. This condition is obtained by elementary means, and it is clear how to put it into practice. We also argue that for a given pressure tensor for which our method applies, there always exists a positive distribution function solution for a sufficiently magnetised plasma. Illustrative examples of th...

  16. Fast polynomial approach to calculating wake fields

    International Nuclear Information System (INIS)

    In the computation of transverse wake field effects in accelerators, it is necessary to compute expressions of the form given in equations (1). It is usually desired to compute this a large number of times, the values of zi and xi being different at each iteration, other quantities remaining the same. The problem in practical applications is that the computational work grows as Nm2. Thus even using parallel computation to achieve speedup, the elapsed time to obtain a result still increases linearly with Nm. The authors introduce here an approximate method of evaluating the sum in (1) whose computational work increases only as NmlogNm. It involves some significant initial computation which does not have to be repeated at each subsequent iteration. The basis of the approach is to replace the individual contributions of a group of distant macroparticles with a local series expansion. In this respect it is similar in spirit to the so called fast multipole method

  17. Operational matrices with respect to Hermite polynomials and their applications in solving linear dierential equations with variable coecients

    Directory of Open Access Journals (Sweden)

    A. Aminataei

    2014-05-01

    Full Text Available In this paper, a new and ecient approach is applied for numerical approximation of the linear dierential equations with variable coecients based on operational matrices with respect to Hermite polynomials. Explicit formulae which express the Hermite expansioncoecients for the moments of derivatives of any dierentiable function in terms of the original expansion coecients of the function itself are given in the matrix form. The mainimportance of this scheme is that using this approach reduces solving the linear dierentialequations to solve a system of linear algebraic equations, thus greatly simplifying the problem. In addition, two experiments are given to demonstrate the validity and applicability of the method

  18. A Green's function nodal expansion method for LWR diffusion calculation

    International Nuclear Information System (INIS)

    A Green's Function Nodal Expansion Method (GNEM) has been developed for the efficient numerical solution of the LWR multi-dimensional neutron diffusion equation. It is an improved version of Nodal Expansion Method (NEM) and Nodal Green's Function Method (NGFM). The code interior fluxes are approximated by a high order polynomial expansion as in NEM. The nodal surface fluxes are coupled with the net currents by using the Green's function method to improve the accuracy. A computer code GNEM has been developed and tested. The numerical results demonstrate that GNEM has the same accuracy as NGFM, while it is twice as fast as NGFM. Especially, the numerical results of TMI-1 core depletion cycles 1 and 6 demonstrate that GNEM is about two times faster than ADMARC and possesses better accuracy

  19. QCD Evolution Equations Numerical Algorithms from the Laguerre Expansion

    CERN Document Server

    Corianò, C; Coriano, Claudio; Savkli, Cetin

    1999-01-01

    A complete numerical implementation, in both singlet and non-singlet sectors, of a very elegant method to solve the QCD Evolution equations, due to Furmanski and Petronzio, is presented. The algorithm is directly implemented in x-space by a Laguerre expansion of the parton distributions. All the leading-twist distributions are evolved: longitudinally polarized, transversely polarized and unpolarized, to NLO accuracy. The expansion is optimal at finite x, up to reasonably small x-values ($x\\approx 10^{-3}$), below which the convergence of the expansion slows down. The polarized evolution is smoother, due to the less singular structure of the anomalous dimensions at small-x. In the region of fast convergence, which covers most of the usual perturbative applications, high numerical accuracy is achieved by expanding over a set of approximately 30 polynomials, with a very modest running time.

  20. QCD Evolution equations: Numerical algorithms from the Laguerre expansion

    International Nuclear Information System (INIS)

    A complete numerical implementation, in both singlet and non-singlet sectors, of a very elegant method to solve the QCD Evolution equations, due to Furmanski and Petronzio, is presented. The algorithm is directly implemented in x-space by a Laguerre expansion of the parton distributions. All the leading-twist distributions are evolved: longitudinally polarized, transversely polarized and unpolarized, to NLO accuracy. The expansion is optimal at finite x, up to reasonably small x-values (x∼10-3), below which the convergence of the expansion slows down. The polarized evolution is smoother, due to the less singular structure of the anomalous dimensions at small-x. In the region of fast convergence, which covers most of the usual perturbative applications, high numerical accuracy is achieved by expanding over a set of approximately 30 polynomials, with a very modest running time

  1. On Different Classes of Algebraic Polynomials with Random Coefficients

    Directory of Open Access Journals (Sweden)

    K. Farahmand

    2008-01-01

    Full Text Available The expected number of real zeros of the polynomial of the form a0+a1x+a2x2+⋯+anxn, where a0,a1,a2,…,an is a sequence of standard Gaussian random variables, is known. For n large it is shown that this expected number in (−∞,∞ is asymptotic to (2/πlog⁡n. In this paper, we show that this asymptotic value increases significantly to n+1 when we consider a polynomial in the form a0(n01/2x/1+a1(n11/2x2/2+a2(n21/2x3/3+⋯+an(nn1/2xn+1/n+1 instead. We give the motivation for our choice of polynomial and also obtain some other characteristics for the polynomial, such as the expected number of level crossings or maxima. We note, and present, a small modification to the definition of our polynomial which improves our result from the above asymptotic relation to the equality.

  2. Ladder Operators for Lamé Spheroconal Harmonic Polynomials

    Directory of Open Access Journals (Sweden)

    Ricardo Méndez-Fragoso

    2012-10-01

    Full Text Available Three sets of ladder operators in spheroconal coordinates and their respective actions on Lamé spheroconal harmonic polynomials are presented in this article. The polynomials are common eigenfunctions of the square of the angular momentum operator and of the asymmetry distribution Hamiltonian for the rotations of asymmetric molecules, in the body-fixed frame with principal axes. The first set of operators for Lamé polynomials of a given species and a fixed value of the square of the angular momentum raise and lower and lower and raise in complementary ways the quantum numbers $n_1$ and $n_2$ counting the respective nodal elliptical cones. The second set of operators consisting of the cartesian components $hat L_x$, $hat L_y$, $hat L_z$ of the angular momentum connect pairs of the four species of polynomials of a chosen kind and angular momentum. The third set of operators, the cartesian components $hat p_x$, $hat p_y$, $hat p_z$ of the linear momentum, connect pairs of the polynomials differing in one unit in their angular momentum and in their parities. Relationships among spheroconal harmonics at the levels of the three sets of operators are illustrated.

  3. PLOTNFIT.4TH, Data Plotting and Curve Fitting by Polynomials

    International Nuclear Information System (INIS)

    1 - Description of program or function: PLOTnFIT is used for plotting and analyzing data by fitting nth degree polynomials of basis functions to the data interactively and printing graphs of the data and the polynomial functions. It can be used to generate linear, semi-log, and log-log graphs and can automatically scale the coordinate axes to suit the data. Multiple data sets may be plotted on a single graph. An auxiliary program, READ1ST, is included which produces an on-line summary of the information contained in the PLOTnFIT reference report. 2 - Method of solution: PLOTnFIT uses the least squares method to calculate the coefficients of nth-degree (up to 10. degree) polynomials of 11 selected basis functions such that each polynomial fits the data in a least squares sense. The procedure incorporated in the code uses a linear combination of orthogonal polynomials to avoid 'i11-conditioning' and to perform the curve fitting task with single-precision arithmetic. 3 - Restrictions on the complexity of the problem - Maxima of: 225 data points per job (or graph) including all data sets 8 data sets (or tasks) per job (or graph)

  4. Efficient computer algebra algorithms for polynomial matrices in control design

    Science.gov (United States)

    Baras, J. S.; Macenany, D. C.; Munach, R.

    1989-01-01

    The theory of polynomial matrices plays a key role in the design and analysis of multi-input multi-output control and communications systems using frequency domain methods. Examples include coprime factorizations of transfer functions, cannonical realizations from matrix fraction descriptions, and the transfer function design of feedback compensators. Typically, such problems abstract in a natural way to the need to solve systems of Diophantine equations or systems of linear equations over polynomials. These and other problems involving polynomial matrices can in turn be reduced to polynomial matrix triangularization procedures, a result which is not surprising given the importance of matrix triangularization techniques in numerical linear algebra. Matrices with entries from a field and Gaussian elimination play a fundamental role in understanding the triangularization process. In the case of polynomial matrices, matrices with entries from a ring for which Gaussian elimination is not defined and triangularization is accomplished by what is quite properly called Euclidean elimination. Unfortunately, the numerical stability and sensitivity issues which accompany floating point approaches to Euclidean elimination are not very well understood. New algorithms are presented which circumvent entirely such numerical issues through the use of exact, symbolic methods in computer algebra. The use of such error-free algorithms guarantees that the results are accurate to within the precision of the model data--the best that can be hoped for. Care must be taken in the design of such algorithms due to the phenomenon of intermediate expressions swell.

  5. Orbifold E-functions of dual invertible polynomials

    Science.gov (United States)

    Ebeling, Wolfgang; Gusein-Zade, Sabir M.; Takahashi, Atsushi

    2016-08-01

    An invertible polynomial is a weighted homogeneous polynomial with the number of monomials coinciding with the number of variables and such that the weights of the variables and the quasi-degree are well defined. In the framework of the search for mirror symmetric orbifold Landau-Ginzburg models, P. Berglund and M. Henningson considered a pair (f , G) consisting of an invertible polynomial f and an abelian group G of its symmetries together with a dual pair (f ˜ , G ˜) . We consider the so-called orbifold E-function of such a pair (f , G) which is a generating function for the exponents of the monodromy action on an orbifold version of the mixed Hodge structure on the Milnor fibre of f. We prove that the orbifold E-functions of Berglund-Henningson dual pairs coincide up to a sign depending on the number of variables and a simple change of variables. The proof is based on a relation between monomials (say, elements of a monomial basis of the Milnor algebra of an invertible polynomial) and elements of the whole symmetry group of the dual polynomial.

  6. An Enhanced Asymptotic Expansion for the Stability of Nonlinear Elastic Structures

    DEFF Research Database (Denmark)

    Christensen, Claus Dencker; Byskov, Esben

    2010-01-01

    A new, enhanced asymptotic expansion applicable to stability of structures made of nonlinear elastic materials is established. The method utilizes “hyperbolic” terms instead of the conventional polynomial terms, covers full kinematic nonlinearity and is applied to nonlinear elastic Euler columns...... with two different types of cross-section. Comparison with numerical results show that our expansion provides more accurate predictions of the behavior than usual expansions. The method is based on an extended version of the principle of virtual displacements that covers cases with auxiliary conditions...

  7. Decompositions of Trigonometric Polynomials with Applications to Multivariate Subdivision Schemes

    CERN Document Server

    Dyn, Nira

    2009-01-01

    We study multivariate trigonometric polynomials, satisfying a set of constraints close to the known Strung-Fix conditions. Based on the polyphase representation of these polynomials relative to a general dilation matrix, we develop a simple constructive method for a special type of decomposition of such polynomials. These decompositions are of interest to the analysis of convergence and smoothness of multivariate subdivision schemes associated with general dilation matrices. We apply these decompositions, by verifying sufficient conditions for the convergence and smoothness of multivariate scalar subdivision schemes, proved here. For the convergence analysis our sufficient conditions apply to arbitrary dilation matrices, while the previously known necessary and sufficient conditions are relevant only in case of dilation matrices with a self similar tiling. For the analysis of smoothness, we state and prove two theorems on multivariate matrix subdivision schemes, which lead to sufficient conditions for C^1 lim...

  8. Equations on knot polynomials and 3d/5d duality

    CERN Document Server

    Mironov, A

    2012-01-01

    We briefly review the current situation with various relations between knot/braid polynomials (Chern-Simons correlation functions), ordinary and extended, considered as functions of the representation and of the knot topology. These include linear skein relations, quadratic Plucker relations, as well as "differential" and (quantum) A-polynomial structures. We pay a special attention to identity between the A-polynomial equations for knots and Baxter equations for quantum relativistic integrable systems, related through Seiberg-Witten theory to 5d super-Yang-Mills models and through the AGT relation to the q-Virasoro algebra. This identity is an important ingredient of emerging a 3d-5d generalization of the AGT relation. The shape of the Baxter equation (including the values of coefficients) depend on the choice of the knot/braid. Thus, like the case of KP integrability, where (some, so far torus) knots parameterize particular points of the Universal Grassmannian, in this relation they parameterize particular ...

  9. Polynomial quasisolutions of linear differential-difference equations

    Directory of Open Access Journals (Sweden)

    Valery B. Cherepennikov

    2006-01-01

    Full Text Available The paper discusses a linear differential-difference equation of neutral type with linear coefficients, when at the initial time moment \\(t=0\\ the value of the desired function \\(x(t\\ is known. The authors are not familiar with any results which would state the solvability conditions for the given problem in the class of analytical functions. A polynomial of some degree \\(N\\ is introduced into the investigation. Then the term "polynomial quasisolution" (PQ-solution is understood in the sense of appearance of the residual \\(\\Delta (t=O(t^N\\, when this polynomial is substituted into the initial problem. The paper is devoted to finding PQ-solutions for the initial-value problem under analysis.

  10. Polynomial parametrization of Pythagorean quadruples, quintuples and sextuples

    CERN Document Server

    Frisch, Sophie

    2011-01-01

    A Pythagorean n-tuple is an integer solution of x_1^2+...+x_{n-1}^2=x_n^2. For n=4 and n=6, the Pythagorean n-tuples admit a parametrization by a single n-tuple of polynomials with integer coefficients (which is impossible for n=3). For n=5, there is an integer-valued polynomial Pythagorean 5-tuple which parametrizes Pythagorean quintuples (similar to the case n=3). Pythagorean quadruples are closely related to (integer) Descartes quadruples (solutions of 2(b_1^2+b_2^2+b_3^2+b_4^2) = (b_1+b_2+b_3+b_4)^2), which we also parametrize by a Descartes quadruple of polynomials with integer coefficients.

  11. Fractional order differentiation by integration with Jacobi polynomials

    KAUST Repository

    Liu, Dayan

    2012-12-01

    The differentiation by integration method with Jacobi polynomials was originally introduced by Mboup, Join and Fliess [22], [23]. This paper generalizes this method from the integer order to the fractional order for estimating the fractional order derivatives of noisy signals. The proposed fractional order differentiator is deduced from the Jacobi orthogonal polynomial filter and the Riemann-Liouville fractional order derivative definition. Exact and simple formula for this differentiator is given where an integral formula involving Jacobi polynomials and the noisy signal is used without complex mathematical deduction. Hence, it can be used both for continuous-time and discrete-time models. The comparison between our differentiator and the recently introduced digital fractional order Savitzky-Golay differentiator is given in numerical simulations so as to show its accuracy and robustness with respect to corrupting noises. © 2012 IEEE.

  12. Basic polynomial invariants, fundamental representations and the Chern class map

    CERN Document Server

    Baek, Sanghoon; Zainoulline, Kirill

    2011-01-01

    Consider a crystallographic root system together with its Weyl group $W$ acting on the weight lattice $M$. Let $Z[M]^W$ and $S^*(M)^W$ be the $W$-invariant subrings of the integral group ring $Z[M]$ and the symmetric algebra $S^*(M)$ respectively. A celebrated theorem of Chevalley says that $Z[M]^W$ is a polynomial ring over $Z$ in classes of fundamental representations $w_1,...,w_n$ and $S^*(M)^{W}$ over rational numbers is a polynomial ring in basic polynomial invariants $q_1,...,q_n$, where $n$ is the rank. In the present paper we establish and investigate the relationship between $w_i$'s and $q_i$'s over the integers.

  13. Characterizing Polynomial Time Computability of Rational and Real Functions

    CERN Document Server

    Gomaa, Walid

    2009-01-01

    Recursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], and D. Lacombe [1955]. It is based on a discrete mechanical framework that can be used to model computation over the real numbers. In this context the computational complexity of real functions defined over compact domains has been extensively studied. However, much less have been done for other kinds of real functions. This article is divided into two main parts. The first part investigates polynomial time computability of rational functions and the role of continuity in such computation. On the one hand this is interesting for its own sake. On the other hand it provides insights into polynomial time computability of real functions for the latter, in the sense of recursive analysis, is modeled as approximations of rational computations. The main conclusion of this part is that continuity does not play any role in the efficiency of computing rational functions. The second part defines polynomial time computability of arbitrary real ...

  14. Applying polynomial filtering to mass preconditioned Hybrid Monte Carlo

    CERN Document Server

    Haar, Taylor; Zanotti, James; Nakamura, Yoshifumi

    2016-01-01

    The use of mass preconditioning or Hasenbusch filtering in modern Hybrid Monte Carlo simulations is common. At light quark masses, multiple filters (three or more) are typically used to reduce the cost of generating dynamical gauge fields; however, the task of tuning a large number of Hasenbusch mass terms is non-trivial. The use of short polynomial approximations to the inverse has been shown to provide an effective UV filter for HMC simulations. In this work we investigate the application of polynomial filtering to the mass preconditioned Hybrid Monte Carlo algorithm as a means of introducing many time scales into the molecular dynamics integration with a simplified parameter tuning process. A generalized multi-scale integration scheme that permits arbitrary step- sizes and can be applied to Omelyan-style integrators is also introduced. We find that polynomial-filtered mass-preconditioning (PF-MP) performs as well as or better than standard mass preconditioning, with significantly less fine tuning required.

  15. Multivariate polynomial interpolation and sampling in Paley-Wiener spaces

    CERN Document Server

    Bailey, B A

    2010-01-01

    In this paper, an equivalence between existence of particular exponential Riesz bases for multivariate bandlimited functions and existence of certain polynomial interpolants for these bandlimited functions is given. For certain classes of unequally spaced data nodes and corresponding $\\ell_2$ data, the existence of these polynomial interpolants allows for a simple recovery formula for multivariate bandlimited functions which demonstrates $L_2$ and uniform convergence on $\\mathbb{R}^d$. A simpler computational version of this recovery formula is also given, at the cost of replacing $L_2$ and uniform convergence on $\\mathbb{R}^d$ with $L_2$ and uniform convergence on increasingly large subsets of $\\mathbb{R}^d$. As a special case, the polynomial interpolants of given $\\ell_2$ data converge in the same fashion to the multivariate bandlimited interpolant of that same data. Concrete examples of pertinant Riesz bases and unequally spaced data nodes are also given.

  16. Describing Quadratic Cremer Point Polynomials by Parabolic Perturbations

    DEFF Research Database (Denmark)

    Sørensen, Dan Erik Krarup

    1996-01-01

    .Polynomials of the Cremer type correspond to parameters at the boundary of ahyperbolic component of the Mandelbrot set. In this paper we concentrate onthe main cardioid component. We investigate the differences between two-sided(i.e. alternating) and one-sided parabolic perturbations.In the two-sided case, we...... prove the existence of polynomials having an explicitlygiven external ray accumulating both at the Cremer point and at its non-periodicpreimage. We think of the Julia set as containing a "topologists double comb".In the one-sided case we prove a weaker result: the existence of polynomials havingan...... explicitly given external ray accumulating the Cremer point, but having in itsimpression both the Cremer point and its other preimage. We think of the Julia setas containing a "topologists single comb".By tuning, similar results hold on the boundary of any hyperbolic component of theMandelbrot set....

  17. On adaptive weighted polynomial preconditioning for Hermitian positive definite matrices

    Science.gov (United States)

    Fischer, Bernd; Freund, Roland W.

    1992-01-01

    The conjugate gradient algorithm for solving Hermitian positive definite linear systems is usually combined with preconditioning in order to speed up convergence. In recent years, there has been a revival of polynomial preconditioning, motivated by the attractive features of the method on modern architectures. Standard techniques for choosing the preconditioning polynomial are based only on bounds for the extreme eigenvalues. Here a different approach is proposed, which aims at adapting the preconditioner to the eigenvalue distribution of the coefficient matrix. The technique is based on the observation that good estimates for the eigenvalue distribution can be derived after only a few steps of the Lanczos process. This information is then used to construct a weight function for a suitable Chebyshev approximation problem. The solution of this problem yields the polynomial preconditioner. In particular, we investigate the use of Bernstein-Szego weights.

  18. Integrability of the dynamical systems with polynomial Hamiltonians

    International Nuclear Information System (INIS)

    The paper is devoted to an exhaustive study of the integrability of dynamical systems described by polynomial Hamiltonians. After a general analysis of the conditions in which the integration of the equation of motion is possible, we determine the classes of polynomial potentials satisfying these conditions. We effectively study two models admitting both exact solutions and chaotic ones. Despite the fact that the maximal degree of the potential is different in the two cases, an interesting connection can be established between the two models. This connection is given by studying the similar classes of periodical solutions admitted by the two models. The paper will end with a study referring to a non-polynomial potential of the Thomas-Fermi type. (author)

  19. Tensor calculus in polar coordinates using Jacobi polynomials

    CERN Document Server

    Vasil, Geoffrey M; Lecoanet, Daniel; Olver, Sheehan; Brown, Benjamin P; Oishi, Jeffrey S

    2015-01-01

    Spectral methods are an efficient way to solve partial differential equations on domains possessing certain symmetries. The utility of a method depends strongly on the choice of spectral basis. In this paper we describe a set of bases built out of Jacobi polynomials, and associated operators for solving scalar, vector, and tensor partial differential equations in polar coordinates on a unit disk. By construction, the bases satisfy regularity conditions at r=0 for any tensorial field. The coordinate singularity in a disk is a prototypical case for many coordinate singularities. The work presented here extends to other geometries. The operators represent covariant derivatives, multiplication by azimuthally symmetric functions, and the tensorial relationship between fields. These arise naturally from relations between classical orthogonal polynomials, and form a Heisenberg algebra. Other past work uses more specific polynomial bases for solving equations in polar coordinates. The main innovation in this paper is...

  20. Fast polynomial approach to calculating wake fields

    Energy Technology Data Exchange (ETDEWEB)

    Goldstein, C.I.; Peierls, R.F. [Brookhaven National Lab., Upton, NY (United States). Dept. of Applied Science

    1997-06-15

    In the computation of transverse wake field effects in accelerators, it is necessary to compute expressions of the form given in equations (1). It is usually desired to compute this a large number of times, the values of z{sub i} and x{sub i} being different at each iteration, other quantities remaining the same. The problem in practical applications is that the computational work grows as N{sub m}{sup 2}. Thus even using parallel computation to achieve speedup, the elapsed time to obtain a result still increases linearly with N{sub m}. The authors introduce here an approximate method of evaluating the sum in (1) whose computational work increases only as N{sub m}logN{sub m}. It involves some significant initial computation which does not have to be repeated at each subsequent iteration. The basis of the approach is to replace the individual contributions of a group of distant macroparticles with a local series expansion. In this respect it is similar in spirit to the so called fast multipole method.