WorldWideScience

Sample records for valued walsh polynomials

  1. The perforamance of genetic algorithms on Walsh polynomials: Some anomalous results and their explanation

    International Nuclear Information System (INIS)

    Forrest, S.

    1991-01-01

    In this paper we discuss a number of seemingly anomalous results reported by Tanese concerning the performance of the genetic algorithm (GA) on a subclass of Walsh polynomials. Tanese found that the GA optimized these functions poorly and that a partitioning of a single large population into a number of smaller independent populations seemed to improve performance. We reexamine these results experimentally and theoretically, and propose and evaluate some explanations. In addition, we examine the question of what are reasonable and appropriate ways to measure the performance of genetic algorithms. 11 refs., 1 tab

  2. Optimal stability polynomials for numerical integration of initial value problems

    KAUST Repository

    Ketcheson, David I.; Ahmadia, Aron

    2013-01-01

    We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest stable step

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

  4. Commutators with idempotent values on multilinear polynomials in ...

    Indian Academy of Sciences (India)

    Multilinear polynomial; derivations; generalized polynomial identity; prime ring; right ideal. Abstract. Let R be a prime ring of characteristic different from 2, C its extended centroid, d a nonzero derivation of R , f ( x 1 , … , x n ) a multilinear polynomial over C , ϱ a nonzero right ideal of R and m > 1 a fixed integer such that.

  5. Optimal stability polynomials for numerical integration of initial value problems

    KAUST Repository

    Ketcheson, David I.

    2013-01-08

    We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest stable step size and corresponding method for a given problem when the spectrum of the initial value problem is known. The problem is expressed in terms of a general least deviation feasibility problem. Its solution is obtained by a new fast, accurate, and robust algorithm based on convex optimization techniques. Global convergence of the algorithm is proven in the case that the order of approximation is one and in the case that the spectrum encloses a starlike region. Examples demonstrate the effectiveness of the proposed algorithm even when these conditions are not satisfied.

  6. The Karlin-McGregor formula for a variant of a discrete version of Walsh's spider

    International Nuclear Information System (INIS)

    Gruenbaum, F Alberto

    2009-01-01

    We consider a variant of a discrete space version of Walsh's spider, see Walsh (1978 Temps Locaux, Asterisque vol 52-53 (Paris: Soc. Math. de France)) as well as Evans and Sowers (2003 Ann. Probab. 31 486-527 and its references). This process can be seen as an instance of a quasi-birth-and-death process, a class of random walks for which the classical theory of Karlin and McGregor can be nicely adapted as in Dette, Reuther, Studden and Zygmunt (2006 SIAM J. Matrix Anal. Appl. 29 117-42), Gruenbaum (2007 Probability, Geometry and Integrable Systems ed Pinsky and Birnir vol 55 (Berkeley, CA: MSRI publication) pp. 241-60, see also arXiv math PR/0703375), Gruenbaum (2007 Dagstuhl Seminar Proc. 07461 on Numerical Methods in Structured Markov Chains ed Bini), Gruenbaum (2008 Proceedings of IWOTA) and Gruenbaum and de la Iglesia (2008 SIAM J. Matrix Anal. Appl. 30 741-63). We give here a weight matrix that makes the corresponding matrix-valued orthogonal polynomials orthogonal to each other. We also determine the polynomials themselves and thus obtain all the ingredients to apply a matrix-valued version of the Karlin-McGregor formula.

  7. Polynomial estimation of the smoothing splines for the new Finnish reference values for spirometry.

    Science.gov (United States)

    Kainu, Annette; Timonen, Kirsi

    2016-07-01

    Background Discontinuity of spirometry reference values from childhood into adulthood has been a problem with traditional reference values, thus modern modelling approaches using smoothing spline functions to better depict the transition during growth and ageing have been recently introduced. Following the publication of the new international Global Lung Initiative (GLI2012) reference values also new national Finnish reference values have been calculated using similar GAMLSS-modelling, with spline estimates for mean (Mspline) and standard deviation (Sspline) provided in tables. The aim of this study was to produce polynomial estimates for these spline functions to use in lieu of lookup tables and to assess their validity in the reference population of healthy non-smokers. Methods Linear regression modelling was used to approximate the estimated values for Mspline and Sspline using similar polynomial functions as in the international GLI2012 reference values. Estimated values were compared to original calculations in absolute values, the derived predicted mean and individually calculated z-scores using both values. Results Polynomial functions were estimated for all 10 spirometry variables. The agreement between original lookup table-produced values and polynomial estimates was very good, with no significant differences found. The variation slightly increased in larger predicted volumes, but a range of -0.018 to +0.022 litres of FEV1 representing ± 0.4% of maximum difference in predicted mean. Conclusions Polynomial approximations were very close to the original lookup tables and are recommended for use in clinical practice to facilitate the use of new reference values.

  8. Central $L$-values of elliptic curves and local polynomials

    OpenAIRE

    Ehlen, Stephan; Guerzhoy, Pavel; Kane, Ben; Rolen, Larry

    2018-01-01

    Here we study the recently introduced notion of a locally harmonic Maass form and its applications to the theory of $L$-functions. In particular, we find finite formulas for certain twisted central $L$-values of a family of elliptic curves in terms of finite sums over canonical binary quadratic forms. This yields vastly simpler formulas related to work of Birch and Swinnerton-Dyer for such $L$-values, and extends beyond their framework to special non-CM elliptic curves.

  9. Application of Walsh functions to neutron transport problems. I. Theory

    International Nuclear Information System (INIS)

    Seed, T.J.; Albrecht, R.W.

    1976-01-01

    An approximation to the neutron transport equation is made by representing the angular flux with an expansion of the angular dependence in the orthogonal, complete, and binary valued sets of Walsh function. The Walsh approximation is applied to the one-speed, isotropic-scattering, rectangular-geometry form of the neutron transport equation. Sets of partial differential equations for the expansion coefficients are derived along with appropriate boundary conditions for their solution. The sets of the Walsh expansion to one- and two-dimensional forms of the transport equation are also obtained. The two-dimensional expansion coefficient equations are shown to be not only hyperbolic but also transformable to a set of S/sub N/-like equations that are coupled only through the scattering term. Such transformal sets of equations are termed Walsh-derived quadrature sets

  10. Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy

    DEFF Research Database (Denmark)

    Frederiksen, Søren Kristoffer Stiil; Miltersen, Peter Bro

    2013-01-01

    We show that the value of a finite-state concurrent reachability game can be approximated to arbitrary precision in TFNP[NP], that is, in the polynomial time hierarchy. Previously, no better bound than PSPACE was known for this problem. The proof is based on formulating a variant of the state red...... reduction algorithm for Markov chains using arbitrary precision floating point arithmetic and giving a rigorous error analysis of the algorithm.......We show that the value of a finite-state concurrent reachability game can be approximated to arbitrary precision in TFNP[NP], that is, in the polynomial time hierarchy. Previously, no better bound than PSPACE was known for this problem. The proof is based on formulating a variant of the state...

  11. A Note on "A polynomial-time algorithm for global value numbering"

    OpenAIRE

    Nabeezath, Saleena; Paleri, Vineeth

    2013-01-01

    Global Value Numbering(GVN) is a popular method for detecting redundant computations. A polynomial time algorithm for GVN is presented by Gulwani and Necula(2006). Here we present two limitations of this GVN algorithm due to which detection of certain kinds of redundancies can not be done using this algorithm. The first one is concerning the use of this algorithm in detecting some instances of the classical global common subexpressions, and the second is concerning its use in the detection of...

  12. Variational Iteration Method for Fifth-Order Boundary Value Problems Using He's Polynomials

    Directory of Open Access Journals (Sweden)

    Muhammad Aslam Noor

    2008-01-01

    Full Text Available We apply the variational iteration method using He's polynomials (VIMHP for solving the fifth-order boundary value problems. The proposed method is an elegant combination of variational iteration and the homotopy perturbation methods and is mainly due to Ghorbani (2007. The suggested algorithm is quite efficient and is practically well suited for use in these problems. The proposed iterative scheme finds the solution without any discritization, linearization, or restrictive assumptions. Several examples are given to verify the reliability and efficiency of the method. The fact that the proposed technique solves nonlinear problems without using Adomian's polynomials can be considered as a clear advantage of this algorithm over the decomposition method.

  13. A Walsh Function Module Users' Manual

    Science.gov (United States)

    Gnoffo, Peter A.

    2014-01-01

    The solution of partial differential equations (PDEs) with Walsh functions offers new opportunities to simulate many challenging problems in mathematical physics. The approach was developed to better simulate hypersonic flows with shocks on unstructured grids. It is unique in that integrals and derivatives are computed using simple matrix multiplication of series representations of functions without the need for divided differences. The product of any two Walsh functions is another Walsh function - a feature that radically changes an algorithm for solving PDEs. A FORTRAN module for supporting Walsh function simulations is documented. A FORTRAN code is also documented with options for solving time-dependent problems: an advection equation, a Burgers equation, and a Riemann problem. The sample problems demonstrate the usage of the Walsh function module including such features as operator overloading, Fast Walsh Transforms in multi-dimensions, and a Fast Walsh reciprocal.

  14. Speech/Nonspeech Detection Using Minimal Walsh Basis Functions

    Directory of Open Access Journals (Sweden)

    Pwint Moe

    2007-01-01

    Full Text Available This paper presents a new method to detect speech/nonspeech components of a given noisy signal. Employing the combination of binary Walsh basis functions and an analysis-synthesis scheme, the original noisy speech signal is modified first. From the modified signals, the speech components are distinguished from the nonspeech components by using a simple decision scheme. Minimal number of Walsh basis functions to be applied is determined using singular value decomposition (SVD. The main advantages of the proposed method are low computational complexity, less parameters to be adjusted, and simple implementation. It is observed that the use of Walsh basis functions makes the proposed algorithm efficiently applicable in real-world situations where processing time is crucial. Simulation results indicate that the proposed algorithm achieves high-speech and nonspeech detection rates while maintaining a low error rate for different noisy conditions.

  15. Leader-follower value congruence in social responsibility and ethical satisfaction: a polynomial regression analysis.

    Science.gov (United States)

    Kang, Seung-Wan; Byun, Gukdo; Park, Hun-Joon

    2014-12-01

    This paper presents empirical research into the relationship between leader-follower value congruence in social responsibility and the level of ethical satisfaction for employees in the workplace. 163 dyads were analyzed, each consisting of a team leader and an employee working at a large manufacturing company in South Korea. Following current methodological recommendations for congruence research, polynomial regression and response surface modeling methodologies were used to determine the effects of value congruence. Results indicate that leader-follower value congruence in social responsibility was positively related to the ethical satisfaction of employees. Furthermore, employees' ethical satisfaction was stronger when aligned with a leader with high social responsibility. The theoretical and practical implications are discussed.

  16. The polynomial property of self-adjoint elliptic boundary-value problems and an algebraic description of their attributes

    International Nuclear Information System (INIS)

    Nazarov, S A

    1999-01-01

    We describe a wide class of boundary-value problems for which the application of elliptic theory can be reduced to elementary algebraic operations and which is characterized by the following polynomial property: the sesquilinear form corresponding to the problem degenerates only on some finite-dimensional linear space P of vector polynomials. Under this condition the boundary-value problem is elliptic, and its kernel and cokernel can be expressed in terms of P. For domains with piecewise-smooth boundary or infinite ends (conic, cylindrical, or periodic), we also present fragments of asymptotic formulae for the solutions, give specific versions of general conditional theorems on the Fredholm property (in particular, by modifying the ordinary weighted norms), and compute the index of the operator corresponding to the boundary-value problem. The polynomial property is also helpful for asymptotic analysis of boundary-value problems in thin domains and junctions of such domains. Namely, simple manipulations with P permit one to find the size of the system obtained by dimension reduction as well as the orders of the differential operators occurring in that system and provide complete information on the boundary layer structure. The results are illustrated by examples from elasticity and hydromechanics

  17. Spectrums Transform Operators in Bases of Fourier and Walsh Functions

    Directory of Open Access Journals (Sweden)

    V. V. Syuzev

    2017-01-01

    Full Text Available The problems of synthesis of the efficient algorithms for digital processing of discrete signals require transforming the signal spectra from one basis system into other. The rational solution to this problem is to construct the Fourier kernel, which is a spectrum of some basis functions, according to the system of functions of the other basis. However, Fourier kernel properties are not equally studied and described for all basis systems of practical importance. The article sets a task and presents an original way to solve the problem of mutual transformation of trigonometric Fourier spectrum into Walsh spectrum of different basis systems.The relevance of this theoretical and applied problem is stipulated, on the one hand, by the prevalence of trigonometric Fourier basis for harmonic representation of digital signals, and, on the other hand, by the fact that Walsh basis systems allow us to have efficient algorithms to simulate signals. The problem solution is achieved through building the Fourier kernel of a special structure that allows us to establish independent groups of Fourier and Walsh spectrum coefficients for further reducing the computational complexity of the transform algorithms.The article analyzes the properties of the system of trigonometric Fourier functions and shows its completeness. Considers the Walsh function basis systems in three versions, namely those of Hadamard, Paley, and Hartmut giving different ordering and analytical descriptions of the functions that make up the basis. Proves a completeness of these systems.Sequentially, for each of the three Walsh systems the analytical curves for the Fourier kernel components are obtained, and Fourier kernel themselves are built with binary rational number of samples of basis functions. The kernels are presented in matrix form and, as an example, recorded for a particular value of the discrete interval of N, equal to 8. The analysis spectral coefficients of the Fourier kernel

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

  19. Comparative Performance of Complex-Valued B-Spline and Polynomial Models Applied to Iterative Frequency-Domain Decision Feedback Equalization of Hammerstein Channels.

    Science.gov (United States)

    Chen, Sheng; Hong, Xia; Khalaf, Emad F; Alsaadi, Fuad E; Harris, Chris J

    2017-12-01

    Complex-valued (CV) B-spline neural network approach offers a highly effective means for identifying and inverting practical Hammerstein systems. Compared with its conventional CV polynomial-based counterpart, a CV B-spline neural network has superior performance in identifying and inverting CV Hammerstein systems, while imposing a similar complexity. This paper reviews the optimality of the CV B-spline neural network approach. Advantages of B-spline neural network approach as compared with the polynomial based modeling approach are extensively discussed, and the effectiveness of the CV neural network-based approach is demonstrated in a real-world application. More specifically, we evaluate the comparative performance of the CV B-spline and polynomial-based approaches for the nonlinear iterative frequency-domain decision feedback equalization (NIFDDFE) of single-carrier Hammerstein channels. Our results confirm the superior performance of the CV B-spline-based NIFDDFE over its CV polynomial-based counterpart.

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

  1. A-integrable martingale sequences and Walsh series

    International Nuclear Information System (INIS)

    Skvortsov, V A

    2001-01-01

    A sufficient condition for a Walsh series converging to an A-integrable function f to be the A-Fourier's series of f is stated in terms of uniform A-integrability of a martingale subsequence of partial sums of the Walsh series. Moreover, the existence is proved of a Walsh series that converges almost everywhere to an A-integrable function and is not the A-Fourier series of its sum

  2. Dyadic Walsh analysis from 1924 onwards Walsh-Gibbs-Butzer dyadic differentiation in science

    CERN Document Server

    Stankovic, Radomir S; Schipp, Ferenc; Wade, William R; Su, Weiyi; Endow, Yasushi; Fridli, Sandor; Golubov, Boris I; Pichler, Franz

    2015-01-01

    Dyadic (Walsh) analysis emerged as a new research area in applied mathematics and engineering in early seventies within attempts to provide answers to demands from practice related to application of spectral analysis of different classes of signals, including audio, video, sonar, and radar signals. In the meantime, it evolved in a mature mathematical discipline with fundamental results and important features providing basis for various applications. The book will provide fundamentals of the area through reprinting carefully selected earlier publications followed by  overview of recent results concerning particular subjects in the area written by experts, most of them being founders of the field, and some of their followers. In this way, this first volume of the two volume book offers a rather complete coverage of the development of dyadic Walsh analysis, and provides a deep insight into its mathematical foundations necessary for consideration of generalizations and applications that are the subject of the se...

  3. Optical network security using unipolar Walsh code

    Science.gov (United States)

    Sikder, Somali; Sarkar, Madhumita; Ghosh, Shila

    2018-04-01

    Optical code-division multiple-access (OCDMA) is considered as a good technique to provide optical layer security. Many research works have been published to enhance optical network security by using optical signal processing. The paper, demonstrates the design of the AWG (arrayed waveguide grating) router-based optical network for spectral-amplitude-coding (SAC) OCDMA networks with Walsh Code to design a reconfigurable network codec by changing signature codes to against eavesdropping. In this paper we proposed a code reconfiguration scheme to improve the network access confidentiality changing the signature codes by cyclic rotations, for OCDMA system. Each of the OCDMA network users is assigned a unique signature code to transmit the information and at the receiving end each receiver correlates its own signature pattern a(n) with the receiving pattern s(n). The signal arriving at proper destination leads to s(n)=a(n).

  4. Quasi-measures, Hausdorff p-measures and Walsh and Haar series

    Energy Technology Data Exchange (ETDEWEB)

    Plotnikov, Mikhail G [Vologda State Academy of Milk Industry, Molochnoe, Vologda Region (Russian Federation)

    2010-09-07

    We study the classes of multiple Haar and Walsh series with at most polynomial growth of the rectangular partial sums. In terms of the Hausdorff p-measure, we find a sufficient condition (a criterion for the multiple Haar series) for a given set to be a U-set for series in the given class. We solve the recovery problem for the coefficients of the series in this class converging outside a uniqueness set. A Bari-type theorem is proved for the relative uniqueness sets for multiple Haar series. For one-dimensional Haar series, we get a criterion for a given set to be a U-set under certain assumptions that generalize the Arutyunyan-Talalyan conditions. We study the problem of describing those Cantor-type sets that are relative uniqueness sets for Haar series.

  5. Quantum algorithms on Walsh transform and Hamming distance for Boolean functions

    Science.gov (United States)

    Xie, Zhengwei; Qiu, Daowen; Cai, Guangya

    2018-06-01

    Walsh spectrum or Walsh transform is an alternative description of Boolean functions. In this paper, we explore quantum algorithms to approximate the absolute value of Walsh transform W_f at a single point z0 (i.e., |W_f(z0)|) for n-variable Boolean functions with probability at least 8/π 2 using the number of O(1/|W_f(z_{0)|ɛ }) queries, promised that the accuracy is ɛ , while the best known classical algorithm requires O(2n) queries. The Hamming distance between Boolean functions is used to study the linearity testing and other important problems. We take advantage of Walsh transform to calculate the Hamming distance between two n-variable Boolean functions f and g using O(1) queries in some cases. Then, we exploit another quantum algorithm which converts computing Hamming distance between two Boolean functions to quantum amplitude estimation (i.e., approximate counting). If Ham(f,g)=t≠0, we can approximately compute Ham( f, g) with probability at least 2/3 by combining our algorithm and {Approx-Count(f,ɛ ) algorithm} using the expected number of Θ( √{N/(\\lfloor ɛ t\\rfloor +1)}+√{t(N-t)}/\\lfloor ɛ t\\rfloor +1) queries, promised that the accuracy is ɛ . Moreover, our algorithm is optimal, while the exact query complexity for the above problem is Θ(N) and the query complexity with the accuracy ɛ is O(1/ɛ 2N/(t+1)) in classical algorithm, where N=2n. Finally, we present three exact quantum query algorithms for two promise problems on Hamming distance using O(1) queries, while any classical deterministic algorithm solving the problem uses Ω(2n) queries.

  6. Colouring and knot polynomials

    International Nuclear Information System (INIS)

    Welsh, D.J.A.

    1991-01-01

    These lectures will attempt to explain a connection between the recent advances in knot theory using the Jones and related knot polynomials with classical problems in combinatorics and statistical mechanics. The difficulty of some of these problems will be analysed in the context of their computational complexity. In particular we shall discuss colourings and groups valued flows in graphs, knots and the Jones and Kauffman polynomials, the Ising, Potts and percolation problems of statistical physics, computational complexity of the above problems. (author). 20 refs, 9 figs

  7. 29 CFR 785.4 - Application to Walsh-Healey Public Contracts Act.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 3 2010-07-01 2010-07-01 false Application to Walsh-Healey Public Contracts Act. 785.4... Considerations § 785.4 Application to Walsh-Healey Public Contracts Act. The principles set forth in this part... employees performing work subject to the provisions of the Walsh-Healey Public Contracts Act. [35 FR 15289...

  8. Walsh-synthesized noise filters for quantum logic

    International Nuclear Information System (INIS)

    Ball, Harrison; Biercuk, Michael J.

    2015-01-01

    We study a novel class of open-loop control protocols constructed to perform arbitrary nontrivial single-qubit logic operations robust against time-dependent non-Markovian noise. Amplitude and phase modulation protocols are crafted leveraging insights from functional synthesis and the basis set of Walsh functions. We employ the experimentally validated generalized filter-transfer function formalism in order to find optimized control protocols for target operations in SU(2) by defining a cost function for the filter-transfer function to be minimized through the applied modulation. Our work details the various techniques by which we define and then optimize the filter-synthesis process in the Walsh basis, including the definition of specific analytic design rules which serve to efficiently constrain the available synthesis space. This approach yields modulated-gate constructions consisting of chains of discrete pulse-segments of arbitrary form, whose modulation envelopes possess intrinsic compatibility with digital logic and clocking. We derive novel families of Walsh-modulated noise filters designed to suppress dephasing and coherent amplitude-damping noise, and describe how well-known sequences derived in NMR also fall within the Walsh-synthesis framework. Finally, our work considers the effects of realistic experimental constraints such as limited modulation bandwidth on achievable filter performance. (orig.)

  9. Walsh-synthesized noise filters for quantum logic

    Energy Technology Data Exchange (ETDEWEB)

    Ball, Harrison; Biercuk, Michael J. [The University of Sydney, ARC Centre for Engineered Quantum Systems, School of Physics, Sydney, NSW (Australia); National Measurement Institute, Sydney, NSW (Australia)

    2015-05-14

    We study a novel class of open-loop control protocols constructed to perform arbitrary nontrivial single-qubit logic operations robust against time-dependent non-Markovian noise. Amplitude and phase modulation protocols are crafted leveraging insights from functional synthesis and the basis set of Walsh functions. We employ the experimentally validated generalized filter-transfer function formalism in order to find optimized control protocols for target operations in SU(2) by defining a cost function for the filter-transfer function to be minimized through the applied modulation. Our work details the various techniques by which we define and then optimize the filter-synthesis process in the Walsh basis, including the definition of specific analytic design rules which serve to efficiently constrain the available synthesis space. This approach yields modulated-gate constructions consisting of chains of discrete pulse-segments of arbitrary form, whose modulation envelopes possess intrinsic compatibility with digital logic and clocking. We derive novel families of Walsh-modulated noise filters designed to suppress dephasing and coherent amplitude-damping noise, and describe how well-known sequences derived in NMR also fall within the Walsh-synthesis framework. Finally, our work considers the effects of realistic experimental constraints such as limited modulation bandwidth on achievable filter performance. (orig.)

  10. Irreducible multivariate polynomials obtained from polynomials in ...

    Indian Academy of Sciences (India)

    Hall, 1409 W. Green Street, Urbana, IL 61801, USA. E-mail: Nicolae. ... Theorem A. If we write an irreducible polynomial f ∈ K[X] as a sum of polynomials a0,..., an ..... This shows us that deg ai = (n − i) deg f2 for each i = 0,..., n, so min k>0.

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

  12. Better polynomials for GNFS

    OpenAIRE

    Bai , Shi; Bouvier , Cyril; Kruppa , Alexander; Zimmermann , Paul

    2016-01-01

    International audience; The general number field sieve (GNFS) is the most efficient algo-rithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The quality of the selected polynomials can be modelled in terms of size and root properties. We propose a new kind of polynomials for GNFS: with a new degree of freedom, we further improve the size property. We demonstrate the efficiency of our algorithm by exhibiting a better polynomial tha...

  13. Some remarks concerning the usage of Walsh transformation in picture processing

    International Nuclear Information System (INIS)

    Schiller, H.; Wille, M.J.

    1976-01-01

    It is shown that after the Walsh transformation of a straight line (e.g. of a track of a bubble chamber picture) it is possible to get information about the position of the line using Walsh coefficients. With the sequential information reduction one can easily suppress the noise of a bubble chamber picture. (author)

  14. 48 CFR 52.222-20 - Walsh-Healey Public Contracts Act.

    Science.gov (United States)

    2010-10-01

    ... Contracts Act. 52.222-20 Section 52.222-20 Federal Acquisition Regulations System FEDERAL ACQUISITION... Clauses 52.222-20 Walsh-Healey Public Contracts Act. As prescribed in 22.610, insert the following clause in solicitations and contracts covered by the Act: Walsh-Healey Public Contracts Act (OCT 2010) If...

  15. 41 CFR 50-201.1 - The Walsh-Healey Public Contracts Act.

    Science.gov (United States)

    2010-07-01

    ... Contracts Act. 50-201.1 Section 50-201.1 Public Contracts and Property Management Other Provisions Relating... Walsh-Healey Public Contracts Act. The Walsh-Healey Public Contracts Act, as amended (41 U.S.C. 35-45... making of contracts by the United States.” It is not an act of general applicability to industry. The...

  16. Sibling curves of quadratic polynomials | Wiggins | Quaestiones ...

    African Journals Online (AJOL)

    Sibling curves were demonstrated in [1, 2] as a novel way to visualize the zeroes of real valued functions. In [3] it was shown that a polynomial of degree n has n sibling curves. This paper focuses on the algebraic and geometric properites of the sibling curves of real and complex quadratic polynomials. Key words: Quadratic ...

  17. Large degree asymptotics of generalized Bessel polynomials

    NARCIS (Netherlands)

    J.L. López; N.M. Temme (Nico)

    2011-01-01

    textabstractAsymptotic 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

  18. FINGERPRINT VERIFICATION IN PERSONAL IDENTIFICATION BY APPLYING LOCAL WALSH HADAMARD TRANSFORM AND GABOR COEFFICIENTS

    Directory of Open Access Journals (Sweden)

    K N Pushpalatha

    2017-05-01

    Full Text Available In an era of advanced computer technology world where innumerable services such as access to bank accounts, or access to secured data or entry to some national important organizations require authentication of genuine individual. Among all biometric personal identification systems, fingerprint recognition system is most accurate and economical technology. In this paper we have proposed fingerprint recognition system using Local Walsh Hadamard Transform (LWHT with Phase Magnitude Histograms (PMHs for feature extraction. Fingerprints display oriented texture-like patterns. Gabor filters have the property of capturing global and local texture information from blur or unclear images and filter bank provides the orientation features which are robust to image distortion and rotation. The LWHT algorithm is compared with other two approaches viz., Gabor Coefficients and Directional Features. The three methods are compared using FVC 2006 Finger print database images. It is found from the observation that the values of TSR, FAR and FRR have improved results compared to existing algorithm.

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

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

  1. Unsteady Solution of Non-Linear Differential Equations Using Walsh Function Series

    Science.gov (United States)

    Gnoffo, Peter A.

    2015-01-01

    Walsh functions form an orthonormal basis set consisting of square waves. The discontinuous nature of square waves make the system well suited for representing functions with discontinuities. The product of any two Walsh functions is another Walsh function - a feature that can radically change an algorithm for solving non-linear partial differential equations (PDEs). The solution algorithm of non-linear differential equations using Walsh function series is unique in that integrals and derivatives may be computed using simple matrix multiplication of series representations of functions. Solutions to PDEs are derived as functions of wave component amplitude. Three sample problems are presented to illustrate the Walsh function series approach to solving unsteady PDEs. These include an advection equation, a Burgers equation, and a Riemann problem. The sample problems demonstrate the use of the Walsh function solution algorithms, exploiting Fast Walsh Transforms in multi-dimensions (O(Nlog(N))). Details of a Fast Walsh Reciprocal, defined here for the first time, enable inversion of aWalsh Symmetric Matrix in O(Nlog(N)) operations. Walsh functions have been derived using a fractal recursion algorithm and these fractal patterns are observed in the progression of pairs of wave number amplitudes in the solutions. These patterns are most easily observed in a remapping defined as a fractal fingerprint (FFP). A prolongation of existing solutions to the next highest order exploits these patterns. The algorithms presented here are considered a work in progress that provide new alternatives and new insights into the solution of non-linear PDEs.

  2. On the estimate of deviations of partial sums of a multiple Fourier-Walsh series of the form S2j,⋯,2jf (x ) of a function in the metric L1(Qk)

    Science.gov (United States)

    Igenberlina, Alua; Matin, Dauren; Turgumbayev, Mendybay

    2017-09-01

    In this paper, deviations of the partial sums of a multiple Fourier-Walsh series of a function in the metric L1(Qk) on a dyadic group are investigated. This estimate plays an important role in the study of equivalent normalizations in this space by means of a difference, oscillation, and best approximation by polynomials in the Walsh system. The classical classical Besov space and its equivalent normalizations are set forth in the well-known monographs of Nikolsky S.M., Besov O.V., Ilyin V.P., Triebel H.; in the works of Kazakh scientists such as Amanov T.I., Mynbaev K.T., Otelbaev M.O., Smailov E.S.. The Besov spaces on the dyadic group and the Vilenkin groups in the one-dimensional case are considered in works by Ombe H., Bloom Walter R, Fournier J., Onneweer C.W., Weyi S., Jun Tateoka.

  3. Zeros and uniqueness of Q-difference polynomials of meromorphic ...

    Indian Academy of Sciences (India)

    Meromorphic functions; Nevanlinna theory; logarithmic order; uniqueness problem; difference-differential polynomial. Abstract. In this paper, we investigate the value distribution of -difference polynomials of meromorphic function of finite logarithmic order, and study the zero distribution of difference-differential polynomials ...

  4. Schur Stability Regions for Complex Quadratic Polynomials

    Science.gov (United States)

    Cheng, Sui Sun; Huang, Shao Yuan

    2010-01-01

    Given a quadratic polynomial with complex coefficients, necessary and sufficient conditions are found in terms of the coefficients such that all its roots have absolute values less than 1. (Contains 3 figures.)

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

  6. Certain non-linear differential polynomials sharing a non zero polynomial

    Directory of Open Access Journals (Sweden)

    Majumder Sujoy

    2015-10-01

    functions sharing a nonzero polynomial and obtain two results which improves and generalizes the results due to L. Liu [Uniqueness of meromorphic functions and differential polynomials, Comput. Math. Appl., 56 (2008, 3236-3245.] and P. Sahoo [Uniqueness and weighted value sharing of meromorphic functions, Applied. Math. E-Notes., 11 (2011, 23-32.].

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

  8. Fiscal Policy and the Implementation of the Walsh Contract for Central Bankers

    OpenAIRE

    Haizhou Huang; A. Jorge Padilla

    2002-01-01

    We develop a simple macroeconomic model where the time inconsistency of optimal monetary policy is due to tax distortions. If fiscal policy is exogenously fixed at its optimal level, a Walsh contract (Walsh, 1995) offered to an independent central bank implements the optimal monetary policy. When fiscal policy is determined endogenously, however, this contract is subject to strategic manipulation by the government, which results in a suboptimal policy mix. Implementing the optimal policy mix ...

  9. Polynomial Heisenberg algebras

    International Nuclear Information System (INIS)

    Carballo, Juan M; C, David J Fernandez; Negro, Javier; Nieto, Luis M

    2004-01-01

    Polynomial deformations of the Heisenberg algebra are studied in detail. Some of their natural realizations are given by the higher order susy partners (and not only by those of first order, as is already known) of the harmonic oscillator for even-order polynomials. Here, it is shown that the susy partners of the radial oscillator play a similar role when the order of the polynomial is odd. Moreover, it will be proved that the general systems ruled by such kinds of algebras, in the quadratic and cubic cases, involve Painleve transcendents of types IV and V, respectively

  10. Generalizations of orthogonal polynomials

    Science.gov (United States)

    Bultheel, A.; Cuyt, A.; van Assche, W.; van Barel, M.; Verdonk, B.

    2005-07-01

    We give a survey of recent generalizations of orthogonal polynomials. That includes multidimensional (matrix and vector orthogonal polynomials) and multivariate versions, multipole (orthogonal rational functions) variants, and extensions of the orthogonality conditions (multiple orthogonality). Most of these generalizations are inspired by the applications in which they are applied. We also give a glimpse of these applications, which are usually generalizations of applications where classical orthogonal polynomials also play a fundamental role: moment problems, numerical quadrature, rational approximation, linear algebra, recurrence relations, and random matrices.

  11. Superiority of legendre polynomials to Chebyshev polynomial in ...

    African Journals Online (AJOL)

    In this paper, we proved the superiority of Legendre polynomial to Chebyshev polynomial in solving first order ordinary differential equation with rational coefficient. We generated shifted polynomial of Chebyshev, Legendre and Canonical polynomials which deal with solving differential equation by first choosing Chebyshev ...

  12. Extended biorthogonal matrix polynomials

    Directory of Open Access Journals (Sweden)

    Ayman Shehata

    2017-01-01

    Full Text Available The pair of biorthogonal matrix polynomials for commutative matrices were first introduced by Varma and Tasdelen in [22]. The main aim of this paper is to extend the properties of the pair of biorthogonal matrix polynomials of Varma and Tasdelen and certain generating matrix functions, finite series, some matrix recurrence relations, several important properties of matrix differential recurrence relations, biorthogonality relations and matrix differential equation for the pair of biorthogonal matrix polynomials J(A,B n (x, k and K(A,B n (x, k are discussed. For the matrix polynomials J(A,B n (x, k, various families of bilinear and bilateral generating matrix functions are constructed in the sequel.

  13. On Symmetric Polynomials

    OpenAIRE

    Golden, Ryan; Cho, Ilwoo

    2015-01-01

    In this paper, we study structure theorems of algebras of symmetric functions. Based on a certain relation on elementary symmetric polynomials generating such algebras, we consider perturbation in the algebras. In particular, we understand generators of the algebras as perturbations. From such perturbations, define injective maps on generators, which induce algebra-monomorphisms (or embeddings) on the algebras. They provide inductive structure theorems on algebras of symmetric polynomials. As...

  14. 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 generic...

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

    International Nuclear Information System (INIS)

    Ismail, M.E.H.; Witte, N.S.

    2000-01-01

    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

  16. Evaluating the Performance of Polynomial Regression Method with Different Parameters during Color Characterization

    Directory of Open Access Journals (Sweden)

    Bangyong Sun

    2014-01-01

    Full Text Available The polynomial regression method is employed to calculate the relationship of device color space and CIE color space for color characterization, and the performance of different expressions with specific parameters is evaluated. Firstly, the polynomial equation for color conversion is established and the computation of polynomial coefficients is analysed. And then different forms of polynomial equations are used to calculate the RGB and CMYK’s CIE color values, while the corresponding color errors are compared. At last, an optimal polynomial expression is obtained by analysing several related parameters during color conversion, including polynomial numbers, the degree of polynomial terms, the selection of CIE visual spaces, and the linearization.

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

  18. Algebraic polynomials with random coefficients

    Directory of Open Access Journals (Sweden)

    K. Farahmand

    2002-01-01

    Full Text Available This paper provides an asymptotic value for the mathematical expected number of points of inflections of a random polynomial of the form a0(ω+a1(ω(n11/2x+a2(ω(n21/2x2+…an(ω(nn1/2xn when n is large. The coefficients {aj(w}j=0n, w∈Ω are assumed to be a sequence of independent normally distributed random variables with means zero and variance one, each defined on a fixed probability space (A,Ω,Pr. A special case of dependent coefficients is also studied.

  19. Fourier series and orthogonal polynomials

    CERN Document Server

    Jackson, Dunham

    2004-01-01

    This text for undergraduate and graduate students illustrates the fundamental simplicity of the properties of orthogonal functions and their developments in related series. Starting with a definition and explanation of the elements of Fourier series, the text follows with examinations of Legendre polynomials and Bessel functions. Boundary value problems consider Fourier series in conjunction with Laplace's equation in an infinite strip and in a rectangle, with a vibrating string, in three dimensions, in a sphere, and in other circumstances. An overview of Pearson frequency functions is followe

  20. Bernoulli Polynomials, Fourier Series and Zeta Numbers

    DEFF Research Database (Denmark)

    Scheufens, Ernst E

    2013-01-01

    Fourier series for Bernoulli polynomials are used to obtain information about values of the Riemann zeta function for integer arguments greater than one. If the argument is even we recover the well-known exact values, if the argument is odd we find integral representations and rapidly convergent...

  1. Euler Polynomials, Fourier Series and Zeta Numbers

    DEFF Research Database (Denmark)

    Scheufens, Ernst E

    2012-01-01

    Fourier series for Euler polynomials is used to obtain information about values of the Riemann zeta function for integer arguments greater than one. If the argument is even we recover the well-known exact values, if the argument is odd we find integral representations and rapidly convergent series....

  2. A Study on the Analysis and Optimal Control of Nonlinear Systems via Walsh Function

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Jin Tae; Kim, Tai Hoon; Ahn, Doo Soo [Sungkyunkwan University (Korea); Lee, Myung Kyu [Kyungsung University (Korea)

    2000-07-01

    This paper presents the new adaptive optimal scheme for the nonlinear systems, which is based on the Picard's iterative approximation and fast Walsh transform. It is well known that the Walsh function approach method is very difficult to apply for the analysis and optimal control of nonlinear systems. However, these problems can be easily solved by the improvement of the previous adaptive optimal scheme. The proposes method is easily applicable to the analysis and optimal control of nonlinear systems. (author). 15 refs., 6 figs., 1 tab.

  3. 29 CFR 1926.15 - Relationship to the Service Contract Act; Walsh-Healey Public Contracts Act.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 8 2010-07-01 2010-07-01 false Relationship to the Service Contract Act; Walsh-Healey Public Contracts Act. 1926.15 Section 1926.15 Labor Regulations Relating to Labor (Continued... FOR CONSTRUCTION General Interpretations § 1926.15 Relationship to the Service Contract Act; Walsh...

  4. On the Laurent polynomial rings

    International Nuclear Information System (INIS)

    Stefanescu, D.

    1985-02-01

    We describe some properties of the Laurent polynomial rings in a finite number of indeterminates over a commutative unitary ring. We study some subrings of the Laurent polynomial rings. We finally obtain two cancellation properties. (author)

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

  6. Polynomial solutions of the Monge-Ampère equation

    Energy Technology Data Exchange (ETDEWEB)

    Aminov, Yu A [B.Verkin Institute for Low Temperature Physics and Engineering, National Academy of Sciences of Ukraine, Khar' kov (Ukraine)

    2014-11-30

    The question of the existence of polynomial solutions to the Monge-Ampère equation z{sub xx}z{sub yy}−z{sub xy}{sup 2}=f(x,y) is considered in the case when f(x,y) is a polynomial. It is proved that if f is a polynomial of the second degree, which is positive for all values of its arguments and has a positive squared part, then no polynomial solution exists. On the other hand, a solution which is not polynomial but is analytic in the whole of the x, y-plane is produced. Necessary and sufficient conditions for the existence of polynomial solutions of degree up to 4 are found and methods for the construction of such solutions are indicated. An approximation theorem is proved. Bibliography: 10 titles.

  7. Least squares orthogonal polynomial approximation in several independent variables

    International Nuclear Information System (INIS)

    Caprari, R.S.

    1992-06-01

    This paper begins with an exposition of a systematic technique for generating orthonormal polynomials in two independent variables by application of the Gram-Schmidt orthogonalization procedure of linear algebra. It is then demonstrated how a linear least squares approximation for experimental data or an arbitrary function can be generated from these polynomials. The least squares coefficients are computed without recourse to matrix arithmetic, which ensures both numerical stability and simplicity of implementation as a self contained numerical algorithm. The Gram-Schmidt procedure is then utilised to generate a complete set of orthogonal polynomials of fourth degree. A theory for the transformation of the polynomial representation from an arbitrary basis into the familiar sum of products form is presented, together with a specific implementation for fourth degree polynomials. Finally, the computational integrity of this algorithm is verified by reconstructing arbitrary fourth degree polynomials from their values at randomly chosen points in their domain. 13 refs., 1 tab

  8. Stochastic Estimation via Polynomial Chaos

    Science.gov (United States)

    2015-10-01

    AFRL-RW-EG-TR-2015-108 Stochastic Estimation via Polynomial Chaos Douglas V. Nance Air Force Research...COVERED (From - To) 20-04-2015 – 07-08-2015 4. TITLE AND SUBTITLE 5a. CONTRACT NUMBER Stochastic Estimation via Polynomial Chaos ...This expository report discusses fundamental aspects of the polynomial chaos method for representing the properties of second order stochastic

  9. Representation of American versus non-American fans in Baillie Walsh's Springsteen & I

    NARCIS (Netherlands)

    Wilkinson, M.C.

    2015-01-01

    This article explores the representation of American versus non-American fans in Baillie Walsh's 2013 crowd/fan-sourced documentary Springsteen & I. The film—as much as it was fed by a wide and international range of fan-produced material—ultimately produced and presented one particular type of fan

  10. "A Chance Child": Jill Paton Walsh and the Re-Invention of the Time Slip Story

    Science.gov (United States)

    Hall, Linda Marian

    2011-01-01

    In this study of Jill Paton Walsh's one time-slip novel, I attempt to show how she reinvents the genre by giving as much prominence to the dislocated present as she does to the sufferings of children caught up in the horrors of the Industrial Revolution. Where previous time-slip authors had concentrated on the past, she addresses clearly unwelcome…

  11. Polynomial optimization : Error analysis and applications

    NARCIS (Netherlands)

    Sun, Zhao

    2015-01-01

    Polynomial optimization is the problem of minimizing a polynomial function subject to polynomial inequality constraints. In this thesis we investigate several hierarchies of relaxations for polynomial optimization problems. Our main interest lies in understanding their performance, in particular how

  12. Complex Polynomial Vector Fields

    DEFF Research Database (Denmark)

    Dias, Kealey

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

  13. Roots of the Chromatic Polynomial

    DEFF Research Database (Denmark)

    Perrett, Thomas

    The chromatic polynomial of a graph G is a univariate polynomial whose evaluation at any positive integer q enumerates the proper q-colourings of G. It was introduced in connection with the famous four colour theorem but has recently found other applications in the field of statistical physics...... extend Thomassen’s technique to the Tutte polynomial and as a consequence, deduce a density result for roots of the Tutte polynomial. This partially answers a conjecture of Jackson and Sokal. Finally, we refocus our attention on the chromatic polynomial and investigate the density of chromatic roots...

  14. Polynomials in algebraic analysis

    OpenAIRE

    Multarzyński, Piotr

    2012-01-01

    The concept of polynomials in the sense of algebraic analysis, for a single right invertible linear operator, was introduced and studied originally by D. Przeworska-Rolewicz \\cite{DPR}. One of the elegant results corresponding with that notion is a purely algebraic version of the Taylor formula, being a generalization of its usual counterpart, well known for functions of one variable. In quantum calculus there are some specific discrete derivations analyzed, which are right invertible linear ...

  15. A Combinatorial Proof of a Result on Generalized Lucas Polynomials

    Directory of Open Access Journals (Sweden)

    Laugier Alexandre

    2016-09-01

    Full Text Available We give a combinatorial proof of an elementary property of generalized Lucas polynomials, inspired by [1]. These polynomials in s and t are defined by the recurrence relation 〈n〉 = s〈n-1〉+t〈n-2〉 for n ≥ 2. The initial values are 〈0〉 = 2; 〈1〉= s, respectively.

  16. General Reducibility and Solvability of Polynomial Equations ...

    African Journals Online (AJOL)

    General Reducibility and Solvability of Polynomial Equations. ... Unlike quadratic, cubic, and quartic polynomials, the general quintic and higher degree polynomials cannot be solved algebraically in terms of finite number of additions, ... Galois Theory, Solving Polynomial Systems, Polynomial factorization, Polynomial Ring ...

  17. 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|<1 , and for the special value they are closely related to Hankel matrice...

  18. Optimization of Cubic Polynomial Functions without Calculus

    Science.gov (United States)

    Taylor, Ronald D., Jr.; Hansen, Ryan

    2008-01-01

    In algebra and precalculus courses, students are often asked to find extreme values of polynomial functions in the context of solving an applied problem; but without the notion of derivative, something is lost. Either the functions are reduced to quadratics, since students know the formula for the vertex of a parabola, or solutions are…

  19. Polynomial approximation on polytopes

    CERN Document Server

    Totik, Vilmos

    2014-01-01

    Polynomial approximation on convex polytopes in \\mathbf{R}^d is considered in uniform and L^p-norms. For an appropriate modulus of smoothness matching direct and converse estimates are proven. In the L^p-case so called strong direct and converse results are also verified. The equivalence of the moduli of smoothness with an appropriate K-functional follows as a consequence. The results solve a problem that was left open since the mid 1980s when some of the present findings were established for special, so-called simple polytopes.

  20. Polynomial intelligent states

    International Nuclear Information System (INIS)

    Milks, Matthew M; Guise, Hubert de

    2005-01-01

    The construction of su(2) intelligent states is simplified using a polynomial representation of su(2). The cornerstone of the new construction is the diagonalization of a 2 x 2 matrix. The method is sufficiently simple to be easily extended to su(3), where one is required to diagonalize a single 3 x 3 matrix. For two perfectly general su(3) operators, this diagonalization is technically possible but the procedure loses much of its simplicity owing to the algebraic form of the roots of a cubic equation. Simplified expressions can be obtained by specializing the choice of su(3) operators. This simpler construction will be discussed in detail

  1. Everywhere divergent Fourier series with respect to the Walsh system and with respect to multiplicative systems

    International Nuclear Information System (INIS)

    Bochkarev, S V

    2004-01-01

    In this paper a new construction of everywhere divergent Fourier-Walsh series is presented. This construction enables one to halve the gap in the Lebesgue-Orlicz classes between the Schipp-Moon lower bound established by using Kolmogorov's construction and the Sjoelin upper bound obtained by using Carleson's method. Fourier series which are everywhere divergent after a rearrangement are constructed with respect to the Walsh system (and to more general systems of characters) with the best lower bound for the Weyl factor. Some results related to an upper bound of the majorant for partial sums of series with respect to rearranged multiplicative systems are established. The results thus obtained show certain merits of harmonic analysis on the dyadic group in clarifying and overcoming fundamental difficulties in the solution of the main problems of Fourier analysis

  2. q-analogue of the Krawtchouk and Meixner orthogonal polynomials

    International Nuclear Information System (INIS)

    Campigotto, C.; Smirnov, Yu.F.; Enikeev, S.G.

    1993-06-01

    The comparative analysis of Krawtchouk polynomials on a uniform grid with Wigner D-functions for the SU(2) group is presented. As a result the partnership between corresponding properties of the polynomials and D-functions is established giving the group-theoretical interpretation of the Krawtchouk polynomials properties. In order to extend such an analysis on the quantum groups SU q (2) and SU q (1,1), q-analogues of Krawtchouk and Meixner polynomials of a discrete variable are studied. The total set of characteristics of these polynomials is calculated, including the orthogonality condition, normalization factor, recurrent relation, the explicit analytic expression, the Rodrigues formula, the difference derivative formula and various particular cases and values. (R.P.) 22 refs.; 2 tabs

  3. On an analogue of Hardy's inequality for the Walsh-Fourier

    International Nuclear Information System (INIS)

    Golubov, B I

    2001-01-01

    According to Hardy's well-known inequality, the l 1 -norm of a function in the Hardy space H(t) consisting of 2π-periodic functions serves as an upper estimate for the l 1 -norm of the sequence of Fourier coefficients of the integral of the function. In this paper, the dyadic Hardy space H(R + ) is introduced and an analogue of this estimate is proved for the Walsh-Fourier transform

  4. An analogue of a theorem of Titchmarsh for Walsh-Fourier transformations

    International Nuclear Information System (INIS)

    Golubov, B I

    1998-01-01

    Let f-hat c be the Fourier cosine transform of f. Then, as proved for functions of class L p (R + ) in Titchmarsh's book 'Introduction to the theory of Fourier integrals' (1937), the Hardy operator and the Hardy-Littlewood operator can be defined. In the present paper similar equalities are proved for functions of class L p (R + ), 1< p≤2, and the Walsh-Fourier transformation

  5. Improved l1-SPIRiT using 3D walsh transform-based sparsity basis.

    Science.gov (United States)

    Feng, Zhen; Liu, Feng; Jiang, Mingfeng; Crozier, Stuart; Guo, He; Wang, Yuxin

    2014-09-01

    l1-SPIRiT is a fast magnetic resonance imaging (MRI) method which combines parallel imaging (PI) with compressed sensing (CS) by performing a joint l1-norm and l2-norm optimization procedure. The original l1-SPIRiT method uses two-dimensional (2D) Wavelet transform to exploit the intra-coil data redundancies and a joint sparsity model to exploit the inter-coil data redundancies. In this work, we propose to stack all the coil images into a three-dimensional (3D) matrix, and then a novel 3D Walsh transform-based sparsity basis is applied to simultaneously reduce the intra-coil and inter-coil data redundancies. Both the 2D Wavelet transform-based and the proposed 3D Walsh transform-based sparsity bases were investigated in the l1-SPIRiT method. The experimental results show that the proposed 3D Walsh transform-based l1-SPIRiT method outperformed the original l1-SPIRiT in terms of image quality and computational efficiency. Copyright © 2014 Elsevier Inc. All rights reserved.

  6. Complex Polynomial Vector Fields

    DEFF Research Database (Denmark)

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

  7. Polynomial methods in combinatorics

    CERN Document Server

    Guth, Larry

    2016-01-01

    This book explains some recent applications of the theory of polynomials and algebraic geometry to combinatorics and other areas of mathematics. One of the first results in this story is a short elegant solution of the Kakeya problem for finite fields, which was considered a deep and difficult problem in combinatorial geometry. The author also discusses in detail various problems in incidence geometry associated to Paul Erdős's famous distinct distances problem in the plane from the 1940s. The proof techniques are also connected to error-correcting codes, Fourier analysis, number theory, and differential geometry. Although the mathematics discussed in the book is deep and far-reaching, it should be accessible to first- and second-year graduate students and advanced undergraduates. The book contains approximately 100 exercises that further the reader's understanding of the main themes of the book. Some of the greatest advances in geometric combinatorics and harmonic analysis in recent years have been accompl...

  8. Polynomial representations of GLn

    CERN Document Server

    Green, James A; Erdmann, Karin

    2007-01-01

    The first half of this book contains the text of the first edition of LNM volume 830, Polynomial Representations of GLn. This classic account of matrix representations, the Schur algebra, the modular representations of GLn, and connections with symmetric groups, has been the basis of much research in representation theory. The second half is an Appendix, and can be read independently of the first. It is an account of the Littelmann path model for the case gln. In this case, Littelmann's 'paths' become 'words', and so the Appendix works with the combinatorics on words. This leads to the repesentation theory of the 'Littelmann algebra', which is a close analogue of the Schur algebra. The treatment is self- contained; in particular complete proofs are given of classical theorems of Schensted and Knuth.

  9. Polynomial representations of GLN

    CERN Document Server

    Green, James A

    1980-01-01

    The first half of this book contains the text of the first edition of LNM volume 830, Polynomial Representations of GLn. This classic account of matrix representations, the Schur algebra, the modular representations of GLn, and connections with symmetric groups, has been the basis of much research in representation theory. The second half is an Appendix, and can be read independently of the first. It is an account of the Littelmann path model for the case gln. In this case, Littelmann's 'paths' become 'words', and so the Appendix works with the combinatorics on words. This leads to the repesentation theory of the 'Littelmann algebra', which is a close analogue of the Schur algebra. The treatment is self- contained; in particular complete proofs are given of classical theorems of Schensted and Knuth.

  10. Information-theoretic lengths of Jacobi polynomials

    Energy Technology Data Exchange (ETDEWEB)

    Guerrero, A; Dehesa, J S [Departamento de Fisica Atomica, Molecular y Nuclear, Universidad de Granada, Granada (Spain); Sanchez-Moreno, P, E-mail: agmartinez@ugr.e, E-mail: pablos@ugr.e, E-mail: dehesa@ugr.e [Instituto ' Carlos I' de Fisica Teorica y Computacional, Universidad de Granada, Granada (Spain)

    2010-07-30

    The information-theoretic lengths of the Jacobi polynomials P{sup ({alpha}, {beta})}{sub n}(x), which are information-theoretic measures (Renyi, Shannon and Fisher) of their associated Rakhmanov probability density, are investigated. They quantify the spreading of the polynomials along the orthogonality interval [- 1, 1] in a complementary but different way as the root-mean-square or standard deviation because, contrary to this measure, they do not refer to any specific point of the interval. The explicit expressions of the Fisher length are given. The Renyi lengths are found by the use of the combinatorial multivariable Bell polynomials in terms of the polynomial degree n and the parameters ({alpha}, {beta}). The Shannon length, which cannot be exactly calculated because of its logarithmic functional form, is bounded from below by using sharp upper bounds to general densities on [- 1, +1] given in terms of various expectation values; moreover, its asymptotics is also pointed out. Finally, several computational issues relative to these three quantities are carefully analyzed.

  11. Efficient computation of Laguerre polynomials

    NARCIS (Netherlands)

    A. Gil (Amparo); J. Segura (Javier); N.M. Temme (Nico)

    2017-01-01

    textabstractAn efficient algorithm and a Fortran 90 module (LaguerrePol) for computing Laguerre polynomials . Ln(α)(z) are presented. The standard three-term recurrence relation satisfied by the polynomials and different types of asymptotic expansions valid for . n large and . α small, are used

  12. Optimization over polynomials : Selected topics

    NARCIS (Netherlands)

    Laurent, M.; Jang, Sun Young; Kim, Young Rock; Lee, Dae-Woong; Yie, Ikkwon

    2014-01-01

    Minimizing a polynomial function over a region defined by polynomial inequalities models broad classes of hard problems from combinatorics, geometry and optimization. New algorithmic approaches have emerged recently for computing the global minimum, by combining tools from real algebra (sums of

  13. Eye aberration analysis with Zernike polynomials

    Science.gov (United States)

    Molebny, Vasyl V.; Chyzh, Igor H.; Sokurenko, Vyacheslav M.; Pallikaris, Ioannis G.; Naoumidis, Leonidas P.

    1998-06-01

    New horizons for accurate photorefractive sight correction, afforded by novel flying spot technologies, require adequate measurements of photorefractive properties of an eye. Proposed techniques of eye refraction mapping present results of measurements for finite number of points of eye aperture, requiring to approximate these data by 3D surface. A technique of wave front approximation with Zernike polynomials is described, using optimization of the number of polynomial coefficients. Criterion of optimization is the nearest proximity of the resulted continuous surface to the values calculated for given discrete points. Methodology includes statistical evaluation of minimal root mean square deviation (RMSD) of transverse aberrations, in particular, varying consecutively the values of maximal coefficient indices of Zernike polynomials, recalculating the coefficients, and computing the value of RMSD. Optimization is finished at minimal value of RMSD. Formulas are given for computing ametropia, size of the spot of light on retina, caused by spherical aberration, coma, and astigmatism. Results are illustrated by experimental data, that could be of interest for other applications, where detailed evaluation of eye parameters is needed.

  14. 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,

  15. On generalized Fibonacci and Lucas polynomials

    Energy Technology Data Exchange (ETDEWEB)

    Nalli, Ayse [Department of Mathematics, Faculty of Sciences, Selcuk University, 42075 Campus-Konya (Turkey)], E-mail: aysenalli@yahoo.com; Haukkanen, Pentti [Department of Mathematics, Statistics and Philosophy, 33014 University of Tampere (Finland)], E-mail: mapehau@uta.fi

    2009-12-15

    Let h(x) be a polynomial with real coefficients. We introduce h(x)-Fibonacci polynomials that generalize both Catalan's Fibonacci polynomials and Byrd's Fibonacci polynomials and also the k-Fibonacci numbers, and we provide properties for these h(x)-Fibonacci polynomials. We also introduce h(x)-Lucas polynomials that generalize the Lucas polynomials and present properties of these polynomials. In the last section we introduce the matrix Q{sub h}(x) that generalizes the Q-matrix whose powers generate the Fibonacci numbers.

  16. 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) ...... of polynomials is in arithmetic NC^3. Our algorithm works over any field and compared to other known algorithms it does not assume the ability to take p'th roots when the field has characteristic p....

  17. Orthogonal polynomials in transport theories

    International Nuclear Information System (INIS)

    Dehesa, J.S.

    1981-01-01

    The asymptotical (k→infinity) behaviour of zeros of the polynomials gsub(k)sup((m)(ν)) encountered in the treatment of direct and inverse problems of scattering in neutron transport as well as radiative transfer theories is investigated in terms of the amplitude antiwsub(k) of the kth Legendre polynomial needed in the expansion of the scattering function. The parameters antiwsub(k) describe the anisotropy of scattering of the medium considered. In particular, it is shown that the asymptotical density of zeros of the polynomials gsub(k)sup(m)(ν) is an inverted semicircle for the anisotropic non-multiplying scattering medium

  18. Equalization of Multiuser Wireless CDMA Downlink Considering Transmitter Nonlinearity Using Walsh Codes

    Directory of Open Access Journals (Sweden)

    Pinter Stephen Z

    2007-01-01

    Full Text Available Transmitter nonlinearity has been a major issue in many scenarios: cellular wireless systems have high power RF amplifier (HPA nonlinearity at the base station; satellite downlinks have nonlinear TWT amplifiers in the satellite transponder and multipath conditions in the ground station; and radio-over-fiber (ROF systems consist of a nonlinear optical link followed by a wireless channel. In many cases, the nonlinearity is simply ignored if there is no out-of-band emission. This results in poor BER performance. In this paper we propose a new technique to estimate the linear part of the wireless downlink in the presence of a nonlinearity using Walsh codes; Walsh codes are commonly used in CDMA downlinks. Furthermore, we show that equalizer performance is significantly improved by taking into account the presence of the nonlinearity during channel estimation. This is shown by using a regular decision feedback equalizer (DFE with both wireless and RF amplifier noise. We perform estimation in a multiuser CDMA communication system where all users transmit their signal simultaneously. Correlation analysis is applied to identify the channel impulse response (CIR and the derivation of key correlation relationships is shown. A difficulty with using Walsh codes in terms of their correlations (compared to PN sequences is then presented, as well as a discussion on how to overcome it. Numerical evaluations show a good estimation of the linear system with 54 users in the downlink and a signal-to-noise ratio (SNR of 25 dB. Bit error rate (BER simulations of the proposed identification and equalization algorithms show a BER of achieved at an SNR of dB.

  19. Large level crossings of a random polynomial

    Directory of Open Access Journals (Sweden)

    Kambiz Farahmand

    1987-01-01

    Full Text Available We know the expected number of times that a polynomial of degree n with independent random real coefficients asymptotically crosses the level K, when K is any real value such that (K2/n→0 as n→∞. The present paper shows that, when K is allowed to be large, this expected number of crossings reduces to only one. The coefficients of the polynomial are assumed to be normally distributed. It is shown that it is sufficient to let K≥exp(nf where f is any function of n such that f→∞ as n→∞.

  20. Polynomial chaos representation of databases on manifolds

    Energy Technology Data Exchange (ETDEWEB)

    Soize, C., E-mail: christian.soize@univ-paris-est.fr [Université Paris-Est, Laboratoire Modélisation et Simulation Multi-Echelle, MSME UMR 8208 CNRS, 5 bd Descartes, 77454 Marne-La-Vallée, Cedex 2 (France); Ghanem, R., E-mail: ghanem@usc.edu [University of Southern California, 210 KAP Hall, Los Angeles, CA 90089 (United States)

    2017-04-15

    Characterizing the polynomial chaos expansion (PCE) of a vector-valued random variable with probability distribution concentrated on a manifold is a relevant problem in data-driven settings. The probability distribution of such random vectors is multimodal in general, leading to potentially very slow convergence of the PCE. In this paper, we build on a recent development for estimating and sampling from probabilities concentrated on a diffusion manifold. The proposed methodology constructs a PCE of the random vector together with an associated generator that samples from the target probability distribution which is estimated from data concentrated in the neighborhood of the manifold. The method is robust and remains efficient for high dimension and large datasets. The resulting polynomial chaos construction on manifolds permits the adaptation of many uncertainty quantification and statistical tools to emerging questions motivated by data-driven queries.

  1. Julia Sets of Orthogonal Polynomials

    DEFF Research Database (Denmark)

    Christiansen, Jacob Stordal; Henriksen, Christian; Petersen, Henrik Laurberg

    2018-01-01

    For a probability measure with compact and non-polar support in the complex plane we relate dynamical properties of the associated sequence of orthogonal polynomials fPng to properties of the support. More precisely we relate the Julia set of Pn to the outer boundary of the support, the lled Julia...... set to the polynomial convex hull K of the support, and the Green's function associated with Pn to the Green's function for the complement of K....

  2. An introduction to orthogonal polynomials

    CERN Document Server

    Chihara, Theodore S

    1978-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

  3. El “Diario” de Rodolfo Walsh o la impotencia de la escritura

    Directory of Open Access Journals (Sweden)

    Romina Magallanes

    2016-07-01

    Full Text Available This paper aims at surveying the experience of an impossibility of writing in Ese hombre y otros papeles personales by Rodolfo Walsh as an exposition of impotence. To this end, several entries from the "Diario" will be examined, as in these such impotence —fundamentally linked to Novel writing— is manifest in its various shapes, and a hypothesis on their nature starting from the idea of writing matter as possibility will be tentatively put forward, supported by Giorgio Agamben's works

  4. On the Divergence of N(o)rlund Logarithmic Means of Walsh-Fourier Series

    Institute of Scientific and Technical Information of China (English)

    Gy(o)rgy GAT; Ushangi GOGINAVA

    2009-01-01

    It is well known in the literature that the logarithmic means1/log n n-1∑k=1 Sk(f)/kof Walsh or trigonometric Fourier series converge a.e. to the function for each integrable function on the unit interval. This is not the case if we take the partial sums. In this paper we prove that the behavior of the so-called N(o)rlund logarithmic means1/log n n-1∑k=1 Sk(f)/n-kis closer to the properties of partial sums in this point of view.

  5. Imaging characteristics of Zernike and annular polynomial aberrations.

    Science.gov (United States)

    Mahajan, Virendra N; Díaz, José Antonio

    2013-04-01

    The general equations for the point-spread function (PSF) and optical transfer function (OTF) are given for any pupil shape, and they are applied to optical imaging systems with circular and annular pupils. The symmetry properties of the PSF, the real and imaginary parts of the OTF, and the modulation transfer function (MTF) of a system with a circular pupil aberrated by a Zernike circle polynomial aberration are derived. The interferograms and PSFs are illustrated for some typical polynomial aberrations with a sigma value of one wave, and 3D PSFs and MTFs are shown for 0.1 wave. The Strehl ratio is also calculated for polynomial aberrations with a sigma value of 0.1 wave, and shown to be well estimated from the sigma value. The numerical results are compared with the corresponding results in the literature. Because of the same angular dependence of the corresponding annular and circle polynomial aberrations, the symmetry properties of systems with annular pupils aberrated by an annular polynomial aberration are the same as those for a circular pupil aberrated by a corresponding circle polynomial aberration. They are also illustrated with numerical examples.

  6. Scattering theory and orthogonal polynomials

    International Nuclear Information System (INIS)

    Geronimo, J.S.

    1977-01-01

    The application of the techniques of scattering theory to the study of polynomials orthogonal on the unit circle and a finite segment of the real line is considered. The starting point is the recurrence relations satisfied by the polynomials instead of the orthogonality condition. A set of two two terms recurrence relations for polynomials orthogonal on the real line is presented and used. These recurrence relations play roles analogous to those satisfied by polynomials orthogonal on unit circle. With these recurrence formulas a Wronskian theorem is proved and the Christoffel-Darboux formula is derived. In scattering theory a fundamental role is played by the Jost function. An analogy is deferred of this function and its analytic properties and the locations of its zeros investigated. The role of the analog Jost function in various properties of these orthogonal polynomials is investigated. The techniques of inverse scattering theory are also used. The discrete analogues of the Gelfand-Levitan and Marchenko equations are derived and solved. These techniques are used to calculate asymptotic formulas for the orthogonal polynomials. Finally Szego's theorem on toeplitz and Hankel determinants is proved using the recurrence formulas and some properties of the Jost function. The techniques of inverse scattering theory are used to calculate the correction terms

  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. Birth-death processes and associated polynomials

    NARCIS (Netherlands)

    van Doorn, Erik A.

    2003-01-01

    We consider birth-death processes on the nonnegative integers and the corresponding sequences of orthogonal polynomials called birth-death polynomials. The sequence of associated polynomials linked with a sequence of birth-death polynomials and its orthogonalizing measure can be used in the analysis

  9. On Multiple Polynomials of Capelli Type

    Directory of Open Access Journals (Sweden)

    S.Y. Antonov

    2016-03-01

    Full Text Available This paper deals with the class of Capelli polynomials in free associative algebra F{Z} (where F is an arbitrary field, Z is a countable set generalizing the construction of multiple Capelli polynomials. The fundamental properties of the introduced Capelli polynomials are provided. In particular, decomposition of the Capelli polynomials by means of the same type of polynomials is shown. Furthermore, some relations between their T -ideals are revealed. A connection between double Capelli polynomials and Capelli quasi-polynomials is established.

  10. Walsh Preprocessor.

    Science.gov (United States)

    1980-08-01

    tile se(q uenw threshold does not utilize thle D)C level inlforiat ion and the time thlresliolditig adaptively adjusts for DC lvel . 𔃻This characteristic...lowest 256/8 = 32 elements. The above observation can be mathematically proven to also relate the fact that the lowest (NT/W) elements can, at worst case

  11. Rotated Walsh-Hadamard Spreading with Robust Channel Estimation for a Coded MC-CDMA System

    Directory of Open Access Journals (Sweden)

    Raulefs Ronald

    2004-01-01

    Full Text Available We investigate rotated Walsh-Hadamard spreading matrices for a broadband MC-CDMA system with robust channel estimation in the synchronous downlink. The similarities between rotated spreading and signal space diversity are outlined. In a multiuser MC-CDMA system, possible performance improvements are based on the chosen detector, the channel code, and its Hamming distance. By applying rotated spreading in comparison to a standard Walsh-Hadamard spreading code, a higher throughput can be achieved. As combining the channel code and the spreading code forms a concatenated code, the overall minimum Hamming distance of the concatenated code increases. This asymptotically results in an improvement of the bit error rate for high signal-to-noise ratio. Higher convolutional channel code rates are mostly generated by puncturing good low-rate channel codes. The overall Hamming distance decreases significantly for the punctured channel codes. Higher channel code rates are favorable for MC-CDMA, as MC-CDMA utilizes diversity more efficiently compared to pure OFDMA. The application of rotated spreading in an MC-CDMA system allows exploiting diversity even further. We demonstrate that the rotated spreading gain is still present for a robust pilot-aided channel estimator. In a well-designed system, rotated spreading extends the performance by using a maximum likelihood detector with robust channel estimation at the receiver by about 1 dB.

  12. 41 CFR 50-210.1 - Coverage under the Walsh-Healey Public Contracts Act of truck drivers employed by oil dealers.

    Science.gov (United States)

    2010-07-01

    ...-Healey Public Contracts Act of truck drivers employed by oil dealers. 50-210.1 Section 50-210.1 Public...-210.1 Coverage under the Walsh-Healey Public Contracts Act of truck drivers employed by oil dealers... Interpretations No. 2 1 with respect to coverage under the Walsh-Healey Public Contracts Act of truck drivers...

  13. Chromatic polynomials of random graphs

    International Nuclear Information System (INIS)

    Van Bussel, Frank; Fliegner, Denny; Timme, Marc; Ehrlich, Christoph; Stolzenberg, Sebastian

    2010-01-01

    Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very small, very sparse or highly structured. Recent algorithmic advances (Timme et al 2009 New J. Phys. 11 023001) now make it possible to compute chromatic polynomials for moderately sized graphs of arbitrary structure and number of edges. Here we present chromatic polynomials of ensembles of random graphs with up to 30 vertices, over the entire range of edge density. We specifically focus on the locations of the zeros of the polynomial in the complex plane. The results indicate that the chromatic zeros of random graphs have a very consistent layout. In particular, the crossing point, the point at which the chromatic zeros with non-zero imaginary part approach the real axis, scales linearly with the average degree over most of the density range. While the scaling laws obtained are purely empirical, if they continue to hold in general there are significant implications: the crossing points of chromatic zeros in the thermodynamic limit separate systems with zero ground state entropy from systems with positive ground state entropy, the latter an exception to the third law of thermodynamics.

  14. Cosmographic analysis with Chebyshev polynomials

    Science.gov (United States)

    Capozziello, Salvatore; D'Agostino, Rocco; Luongo, Orlando

    2018-05-01

    The limits of standard cosmography are here revised addressing the problem of error propagation during statistical analyses. To do so, we propose the use of Chebyshev polynomials to parametrize cosmic distances. In particular, we demonstrate that building up rational Chebyshev polynomials significantly reduces error propagations with respect to standard Taylor series. This technique provides unbiased estimations of the cosmographic parameters and performs significatively better than previous numerical approximations. To figure this out, we compare rational Chebyshev polynomials with Padé series. In addition, we theoretically evaluate the convergence radius of (1,1) Chebyshev rational polynomial and we compare it with the convergence radii of Taylor and Padé approximations. We thus focus on regions in which convergence of Chebyshev rational functions is better than standard approaches. With this recipe, as high-redshift data are employed, rational Chebyshev polynomials remain highly stable and enable one to derive highly accurate analytical approximations of Hubble's rate in terms of the cosmographic series. Finally, we check our theoretical predictions by setting bounds on cosmographic parameters through Monte Carlo integration techniques, based on the Metropolis-Hastings algorithm. We apply our technique to high-redshift cosmic data, using the Joint Light-curve Analysis supernovae sample and the most recent versions of Hubble parameter and baryon acoustic oscillation measurements. We find that cosmography with Taylor series fails to be predictive with the aforementioned data sets, while turns out to be much more stable using the Chebyshev approach.

  15. Simulation of aspheric tolerance with polynomial fitting

    Science.gov (United States)

    Li, Jing; Cen, Zhaofeng; Li, Xiaotong

    2018-01-01

    The shape of the aspheric lens changes caused by machining errors, resulting in a change in the optical transfer function, which affects the image quality. At present, there is no universally recognized tolerance criterion standard for aspheric surface. To study the influence of aspheric tolerances on the optical transfer function, the tolerances of polynomial fitting are allocated on the aspheric surface, and the imaging simulation is carried out by optical imaging software. Analysis is based on a set of aspheric imaging system. The error is generated in the range of a certain PV value, and expressed as a form of Zernike polynomial, which is added to the aspheric surface as a tolerance term. Through optical software analysis, the MTF of optical system can be obtained and used as the main evaluation index. Evaluate whether the effect of the added error on the MTF of the system meets the requirements of the current PV value. Change the PV value and repeat the operation until the acceptable maximum allowable PV value is obtained. According to the actual processing technology, consider the error of various shapes, such as M type, W type, random type error. The new method will provide a certain development for the actual free surface processing technology the reference value.

  16. Polynomial weights and code constructions

    DEFF Research Database (Denmark)

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

    1973-01-01

    polynomial included. This fundamental property is then used as the key to a variety of code constructions including 1) a simplified derivation of the binary Reed-Muller codes and, for any primepgreater than 2, a new extensive class ofp-ary "Reed-Muller codes," 2) a new class of "repeated-root" cyclic codes...... of long constraint length binary convolutional codes derived from2^r-ary Reed-Solomon codes, and 6) a new class ofq-ary "repeated-root" constacyclic codes with an algebraic decoding algorithm.......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...

  17. Orthogonal Polynomials and Special Functions

    CERN Document Server

    Assche, Walter

    2003-01-01

    The set of lectures from the Summer School held in Leuven in 2002 provide an up-to-date account of recent developments in orthogonal polynomials and special functions, in particular for algorithms for computer algebra packages, 3nj-symbols in representation theory of Lie groups, enumeration, multivariable special functions and Dunkl operators, asymptotics via the Riemann-Hilbert method, exponential asymptotics and the Stokes phenomenon. The volume aims at graduate students and post-docs working in the field of orthogonal polynomials and special functions, and in related fields interacting with orthogonal polynomials, such as combinatorics, computer algebra, asymptotics, representation theory, harmonic analysis, differential equations, physics. The lectures are self-contained requiring only a basic knowledge of analysis and algebra, and each includes many exercises.

  18. Symmetric functions and orthogonal polynomials

    CERN Document Server

    Macdonald, I G

    1997-01-01

    One of the most classical areas of algebra, the theory of symmetric functions and orthogonal polynomials has long been known to be connected to combinatorics, representation theory, and other branches of mathematics. Written by perhaps the most famous author on the topic, this volume explains some of the current developments regarding these connections. It is based on lectures presented by the author at Rutgers University. Specifically, he gives recent results on orthogonal polynomials associated with affine Hecke algebras, surveying the proofs of certain famous combinatorial conjectures.

  19. Computationally Efficient Robust Color Image Watermarking Using Fast Walsh Hadamard Transform

    Directory of Open Access Journals (Sweden)

    Suja Kalarikkal Pullayikodi

    2017-10-01

    Full Text Available Watermark is the copy deterrence mechanism used in the multimedia signal that is to be protected from hacking and piracy such a way that it can later be extracted from the watermarked signal by the decoder. Watermarking can be used in various applications such as authentication, video indexing, copyright protection and access control. In this paper a new CDMA (Code Division Multiple Access based robust watermarking algorithm using customized 8 × 8 Walsh Hadamard Transform, is proposed for the color images and detailed performance and robustness analysis have been performed. The paper studies in detail the effect of spreading code length, number of spreading codes and type of spreading codes on the performance of the watermarking system. Compared to the existing techniques the proposed scheme is computationally more efficient and consumes much less time for execution. Furthermore, the proposed scheme is robust and survives most of the common signal processing and geometric attacks.

  20. Performance enhancement of optical code-division multiple-access systems using transposed modified Walsh code

    Science.gov (United States)

    Sikder, Somali; Ghosh, Shila

    2018-02-01

    This paper presents the construction of unipolar transposed modified Walsh code (TMWC) and analysis of its performance in optical code-division multiple-access (OCDMA) systems. Specifically, the signal-to-noise ratio, bit error rate (BER), cardinality, and spectral efficiency were investigated. The theoretical analysis demonstrated that the wavelength-hopping time-spreading system using TMWC was robust against multiple-access interference and more spectrally efficient than systems using other existing OCDMA codes. In particular, the spectral efficiency was calculated to be 1.0370 when TMWC of weight 3 was employed. The BER and eye pattern for the designed TMWC were also successfully obtained using OptiSystem simulation software. The results indicate that the proposed code design is promising for enhancing network capacity.

  1. Optical image encryption using fresnel zone plate mask based on fast walsh hadamard transform

    Science.gov (United States)

    Khurana, Mehak; Singh, Hukum

    2018-05-01

    A new symmetric encryption technique using Fresnel Zone Plate (FZP) based on Fast Walsh Hadamard Transform (FWHT) is proposed for security enhancement. In this technique, bits of plain image is randomized by shuffling the bits randomly. The obtained scrambled image is then masked with FZP using symmetric encryption in FWHT domain to obtain final encrypted image. FWHT has been used in the cryptosystem so as to protect image data from the quantization error and for reconstructing the image perfectly. The FZP used in proposed scheme increases the key space and makes it robust to many traditional attacks. The effectiveness and robustness of the proposed cryptosystem has been analyzed on the basis of various parameters by simulating on MATLAB 8.1.0 (R2012b). The experimental results are provided to highlight suitability of the proposed cryptosystem and prove that the system is secure.

  2. STABILITY SYSTEMS VIA HURWITZ POLYNOMIALS

    Directory of Open Access Journals (Sweden)

    BALTAZAR AGUIRRE HERNÁNDEZ

    2017-01-01

    Full Text Available To analyze the stability of a linear system of differential equations  ẋ = Ax we can study the location of the roots of the characteristic polynomial pA(t associated with the matrix A. We present various criteria - algebraic and geometric - that help us to determine where the roots are located without calculating them directly.

  3. On Modular Counting with Polynomials

    DEFF Research Database (Denmark)

    Hansen, Kristoffer Arnsfelt

    2006-01-01

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

  4. 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 redu...

  5. Congruences concerning Legendre polynomials III

    OpenAIRE

    Sun, Zhi-Hong

    2010-01-01

    Let $p>3$ be a prime, and let $R_p$ be the set of rational numbers whose denominator is coprime to $p$. Let $\\{P_n(x)\\}$ be the Legendre polynomials. In this paper we mainly show that for $m,n,t\\in R_p$ with $m\

  6. Dirichlet polynomials, majorization, and trumping

    International Nuclear Information System (INIS)

    Pereira, Rajesh; Plosker, Sarah

    2013-01-01

    Majorization and trumping are two partial orders which have proved useful in quantum information theory. We show some relations between these two partial orders and generalized Dirichlet polynomials, Mellin transforms, and completely monotone functions. These relations are used to prove a succinct generalization of Turgut’s characterization of trumping. (paper)

  7. The modified Gauss diagonalization of polynomial matrices

    International Nuclear Information System (INIS)

    Saeed, K.

    1982-10-01

    The Gauss algorithm for diagonalization of constant matrices is modified for application to polynomial matrices. Due to this modification the diagonal elements become pure polynomials rather than rational functions. (author)

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

  9. The finite Fourier transform of classical polynomials

    OpenAIRE

    Dixit, Atul; Jiu, Lin; Moll, Victor H.; Vignat, Christophe

    2014-01-01

    The finite Fourier transform of a family of orthogonal polynomials $A_{n}(x)$, is the usual transform of the polynomial extended by $0$ outside their natural domain. Explicit expressions are given for the Legendre, Jacobi, Gegenbauer and Chebyshev families.

  10. A Summation Formula for Macdonald Polynomials

    Science.gov (United States)

    de Gier, Jan; Wheeler, Michael

    2016-03-01

    We derive an explicit sum formula for symmetric Macdonald polynomials. Our expression contains multiple sums over the symmetric group and uses the action of Hecke generators on the ring of polynomials. In the special cases {t = 1} and {q = 0}, we recover known expressions for the monomial symmetric and Hall-Littlewood polynomials, respectively. Other specializations of our formula give new expressions for the Jack and q-Whittaker polynomials.

  11. A New Generalisation of Macdonald Polynomials

    Science.gov (United States)

    Garbali, Alexandr; de Gier, Jan; Wheeler, Michael

    2017-06-01

    We introduce a new family of symmetric multivariate polynomials, whose coefficients are meromorphic functions of two parameters ( q, t) and polynomial in a further two parameters ( u, v). We evaluate these polynomials explicitly as a matrix product. At u = v = 0 they reduce to Macdonald polynomials, while at q = 0, u = v = s they recover a family of inhomogeneous symmetric functions originally introduced by Borodin.

  12. Solving the interval type-2 fuzzy polynomial equation using the ranking method

    Science.gov (United States)

    Rahman, Nurhakimah Ab.; Abdullah, Lazim

    2014-07-01

    Polynomial equations with trapezoidal and triangular fuzzy numbers have attracted some interest among researchers in mathematics, engineering and social sciences. There are some methods that have been developed in order to solve these equations. In this study we are interested in introducing the interval type-2 fuzzy polynomial equation and solving it using the ranking method of fuzzy numbers. The ranking method concept was firstly proposed to find real roots of fuzzy polynomial equation. Therefore, the ranking method is applied to find real roots of the interval type-2 fuzzy polynomial equation. We transform the interval type-2 fuzzy polynomial equation to a system of crisp interval type-2 fuzzy polynomial equation. This transformation is performed using the ranking method of fuzzy numbers based on three parameters, namely value, ambiguity and fuzziness. Finally, we illustrate our approach by numerical example.

  13. Associated polynomials and birth-death processes

    NARCIS (Netherlands)

    van Doorn, Erik A.

    2001-01-01

    We consider sequences of orthogonal polynomials with positive zeros, and pursue the question of how (partial) knowledge of the orthogonalizing measure for the {\\it associated polynomials} can lead to information about the orthogonalizing measure for the original polynomials, with a view to

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

  15. Quantum entanglement via nilpotent polynomials

    International Nuclear Information System (INIS)

    Mandilara, Aikaterini; Akulin, Vladimir M.; Smilga, Andrei V.; Viola, Lorenza

    2006-01-01

    We propose a general method for introducing extensive characteristics of quantum entanglement. The method relies on polynomials of nilpotent raising operators that create entangled states acting on a reference vacuum state. By introducing the notion of tanglemeter, the logarithm of the state vector represented in a special canonical form and expressed via polynomials of nilpotent variables, we show how this description provides a simple criterion for entanglement as well as a universal method for constructing the invariants characterizing entanglement. We compare the existing measures and classes of entanglement with those emerging from our approach. We derive the equation of motion for the tanglemeter and, in representative examples of up to four-qubit systems, show how the known classes appear in a natural way within our framework. We extend our approach to qutrits and higher-dimensional systems, and make contact with the recently introduced idea of generalized entanglement. Possible future developments and applications of the method are discussed

  16. Special polynomials associated with some hierarchies

    International Nuclear Information System (INIS)

    Kudryashov, Nikolai A.

    2008-01-01

    Special polynomials associated with rational solutions of a hierarchy of equations of Painleve type are introduced. The hierarchy arises by similarity reduction from the Fordy-Gibbons hierarchy of partial differential equations. Some relations for these special polynomials are given. Differential-difference hierarchies for finding special polynomials are presented. These formulae allow us to obtain special polynomials associated with the hierarchy studied. It is shown that rational solutions of members of the Schwarz-Sawada-Kotera, the Schwarz-Kaup-Kupershmidt, the Fordy-Gibbons, the Sawada-Kotera and the Kaup-Kupershmidt hierarchies can be expressed through special polynomials of the hierarchy studied

  17. 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.841, year: 2015 http://epubs.siam.org/doi/10.1137/120895950

  18. Codimensions of generalized polynomial identities

    International Nuclear Information System (INIS)

    Gordienko, Aleksei S

    2010-01-01

    It is proved that for every finite-dimensional associative algebra A over a field of characteristic zero there are numbers C element of Q + and t element of Z + such that gc n (A)∼Cn t d n as n→∞, where d=PI exp(A) element of Z + . Thus, Amitsur's and Regev's conjectures hold for the codimensions gc n (A) of the generalized polynomial identities. Bibliography: 6 titles.

  19. Why the Faulhaber Polynomials Are Sums of Even or Odd Powers of (n + 1/2)

    Science.gov (United States)

    Hersh, Reuben

    2012-01-01

    By extending Faulhaber's polynomial to negative values of n, the sum of the p'th powers of the first n integers is seen to be an even or odd polynomial in (n + 1/2) and therefore expressible in terms of the sum of the first n integers.

  20. Stable piecewise polynomial vector fields

    Directory of Open Access Journals (Sweden)

    Claudio Pessoa

    2012-09-01

    Full Text Available Let $N={y>0}$ and $S={y<0}$ be the semi-planes of $mathbb{R}^2$ having as common boundary the line $D={y=0}$. Let $X$ and $Y$ be polynomial vector fields defined in $N$ and $S$, respectively, leading to a discontinuous piecewise polynomial vector field $Z=(X,Y$. This work pursues the stability and the transition analysis of solutions of $Z$ between $N$ and $S$, started by Filippov (1988 and Kozlova (1984 and reformulated by Sotomayor-Teixeira (1995 in terms of the regularization method. This method consists in analyzing a one parameter family of continuous vector fields $Z_{epsilon}$, defined by averaging $X$ and $Y$. This family approaches $Z$ when the parameter goes to zero. The results of Sotomayor-Teixeira and Sotomayor-Machado (2002 providing conditions on $(X,Y$ for the regularized vector fields to be structurally stable on planar compact connected regions are extended to discontinuous piecewise polynomial vector fields on $mathbb{R}^2$. Pertinent genericity results for vector fields satisfying the above stability conditions are also extended to the present case. A procedure for the study of discontinuous piecewise vector fields at infinity through a compactification is proposed here.

  1. Chemical Equilibrium and Polynomial Equations: Beware of Roots.

    Science.gov (United States)

    Smith, William R.; Missen, Ronald W.

    1989-01-01

    Describes two easily applied mathematical theorems, Budan's rule and Rolle's theorem, that in addition to Descartes's rule of signs and intermediate-value theorem, are useful in chemical equilibrium. Provides examples that illustrate the use of all four theorems. Discusses limitations of the polynomial equation representation of chemical…

  2. Nuclear-magnetic-resonance quantum calculations of the Jones polynomial

    International Nuclear Information System (INIS)

    Marx, Raimund; Spoerl, Andreas; Pomplun, Nikolas; Schulte-Herbrueggen, Thomas; Glaser, Steffen J.; Fahmy, Amr; Kauffman, Louis; Lomonaco, Samuel; Myers, John M.

    2010-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 pseudopure 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 nuclear spin state of the molecule in each case, we are able to estimate the value of the Jones polynomial for each of the knots.

  3. Real zeros of classes of random algebraic polynomials

    Directory of Open Access Journals (Sweden)

    K. Farahmand

    2003-01-01

    Full Text Available There are many known asymptotic estimates for the expected number of real zeros of an algebraic polynomial a0+a1x+a2x2+⋯+an−1xn−1 with identically distributed random coefficients. Under different assumptions for the distribution of the coefficients {aj}j=0n−1 it is shown that the above expected number is asymptotic to O(logn. This order for the expected number of zeros remains valid for the case when the coefficients are grouped into two, each group with a different variance. However, it was recently shown that if the coefficients are non-identically distributed such that the variance of the jth term is (nj the expected number of zeros of the polynomial increases to O(n. The present paper provides the value for this asymptotic formula for the polynomials with the latter variances when they are grouped into three with different patterns for their variances.

  4. a Unified Matrix Polynomial Approach to Modal Identification

    Science.gov (United States)

    Allemang, R. J.; Brown, D. L.

    1998-04-01

    One important current focus of modal identification is a reformulation of modal parameter estimation algorithms into a single, consistent mathematical formulation with a corresponding set of definitions and unifying concepts. Particularly, a matrix polynomial approach is used to unify the presentation with respect to current algorithms such as the least-squares complex exponential (LSCE), the polyreference time domain (PTD), Ibrahim time domain (ITD), eigensystem realization algorithm (ERA), rational fraction polynomial (RFP), polyreference frequency domain (PFD) and the complex mode indication function (CMIF) methods. Using this unified matrix polynomial approach (UMPA) allows a discussion of the similarities and differences of the commonly used methods. the use of least squares (LS), total least squares (TLS), double least squares (DLS) and singular value decomposition (SVD) methods is discussed in order to take advantage of redundant measurement data. Eigenvalue and SVD transformation methods are utilized to reduce the effective size of the resulting eigenvalue-eigenvector problem as well.

  5. Solutions of interval type-2 fuzzy polynomials using a new ranking method

    Science.gov (United States)

    Rahman, Nurhakimah Ab.; Abdullah, Lazim; Ghani, Ahmad Termimi Ab.; Ahmad, Noor'Ani

    2015-10-01

    A few years ago, a ranking method have been introduced in the fuzzy polynomial equations. Concept of the ranking method is proposed to find actual roots of fuzzy polynomials (if exists). Fuzzy polynomials are transformed to system of crisp polynomials, performed by using ranking method based on three parameters namely, Value, Ambiguity and Fuzziness. However, it was found that solutions based on these three parameters are quite inefficient to produce answers. Therefore in this study a new ranking method have been developed with the aim to overcome the inherent weakness. The new ranking method which have four parameters are then applied in the interval type-2 fuzzy polynomials, covering the interval type-2 of fuzzy polynomial equation, dual fuzzy polynomial equations and system of fuzzy polynomials. The efficiency of the new ranking method then numerically considered in the triangular fuzzy numbers and the trapezoidal fuzzy numbers. Finally, the approximate solutions produced from the numerical examples indicate that the new ranking method successfully produced actual roots for the interval type-2 fuzzy polynomials.

  6. Improved multivariate polynomial factoring algorithm

    International Nuclear Information System (INIS)

    Wang, P.S.

    1978-01-01

    A new algorithm for factoring multivariate polynomials over the integers based on an algorithm by Wang and Rothschild is described. The new algorithm has improved strategies for dealing with the known problems of the original algorithm, namely, the leading coefficient problem, the bad-zero problem and the occurrence of extraneous factors. It has an algorithm for correctly predetermining leading coefficients of the factors. A new and efficient p-adic algorithm named EEZ is described. Bascially it is a linearly convergent variable-by-variable parallel construction. The improved algorithm is generally faster and requires less store then the original algorithm. Machine examples with comparative timing are included

  7. Killings, duality and characteristic polynomials

    Science.gov (United States)

    Álvarez, Enrique; Borlaf, Javier; León, José H.

    1998-03-01

    In this paper the complete geometrical setting of (lowest order) abelian T-duality is explored with the help of some new geometrical tools (the reduced formalism). In particular, all invariant polynomials (the integrands of the characteristic classes) can be explicitly computed for the dual model in terms of quantities pertaining to the original one and with the help of the canonical connection whose intrinsic characterization is given. Using our formalism the physically, and T-duality invariant, relevant result that top forms are zero when there is an isometry without fixed points is easily proved. © 1998

  8. Orthogonal polynomials and random matrices

    CERN Document Server

    Deift, Percy

    2000-01-01

    This volume expands on a set of lectures held at the Courant Institute on Riemann-Hilbert problems, orthogonal polynomials, and random matrix theory. The goal of the course was to prove universality for a variety of statistical quantities arising in the theory of random matrix models. The central question was the following: Why do very general ensembles of random n {\\times} n matrices exhibit universal behavior as n {\\rightarrow} {\\infty}? The main ingredient in the proof is the steepest descent method for oscillatory Riemann-Hilbert problems.

  9. Introduction to Real Orthogonal Polynomials

    Science.gov (United States)

    1992-06-01

    uses Green’s functions. As motivation , consider the Dirichlet problem for the unit circle in the plane, which involves finding a harmonic function u(r...xv ; a, b ; q) - TO [q-N ab+’q ; q, xq b. Orthogoy RMotion O0 (bq :q)x p.(q* ; a, b ; q) pg(q’ ; a, b ; q) (q "q), (aq)x (q ; q), (I -abq) (bq ; q... motivation and justi- fication for continued study of the intrinsic structure of orthogonal polynomials. 99 LIST OF REFERENCES 1. Deyer, W. M., ed., CRC

  10. Differential operators associated with Hermite polynomials

    International Nuclear Information System (INIS)

    Onyango Otieno, V.P.

    1989-09-01

    This paper considers the boundary value problems for the Hermite differential equation -(e -x2 y'(x))'+e -x2 y(x)=λe -x2 y(x), (x is an element of (-∞, ∞)) in both the so-called right-definite and left-definite cases based partly on a classical approach due to E.C. Titchmarsh. We then link the Titchmarsh approach with operator theoretic results in the spaces L w 2 (-∞, ∞) and H p,q 2 (-∞, ∞). The results in the left-definite case provide an indirect proof of the completeness of the Hermite polynomials in L w 2 (-∞, ∞). (author). 17 refs

  11. A companion matrix for 2-D polynomials

    International Nuclear Information System (INIS)

    Boudellioua, M.S.

    1995-08-01

    In this paper, a matrix form analogous to the companion matrix which is often encountered in the theory of one dimensional (1-D) linear systems is suggested for a class of polynomials in two indeterminates and real coefficients, here referred to as two dimensional (2-D) polynomials. These polynomials arise in the context of 2-D linear systems theory. Necessary and sufficient conditions are also presented under which a matrix is equivalent to this companion form. (author). 6 refs

  12. On polynomial solutions of the Heun equation

    International Nuclear Information System (INIS)

    Gurappa, N; Panigrahi, Prasanta K

    2004-01-01

    By making use of a recently developed method to solve linear differential equations of arbitrary order, we find a wide class of polynomial solutions to the Heun equation. We construct the series solution to the Heun equation before identifying the polynomial solutions. The Heun equation extended by the addition of a term, -σ/x, is also amenable for polynomial solutions. (letter to the editor)

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

  14. Bayer Demosaicking with Polynomial Interpolation.

    Science.gov (United States)

    Wu, Jiaji; Anisetti, Marco; Wu, Wei; Damiani, Ernesto; Jeon, Gwanggil

    2016-08-30

    Demosaicking is a digital image process to reconstruct full color digital images from incomplete color samples from an image sensor. It is an unavoidable process for many devices incorporating camera sensor (e.g. mobile phones, tablet, etc.). In this paper, we introduce a new demosaicking algorithm based on polynomial interpolation-based demosaicking (PID). Our method makes three contributions: calculation of error predictors, edge classification based on color differences, and a refinement stage using a weighted sum strategy. Our new predictors are generated on the basis of on the polynomial interpolation, and can be used as a sound alternative to other predictors obtained by bilinear or Laplacian interpolation. In this paper we show how our predictors can be combined according to the proposed edge classifier. After populating three color channels, a refinement stage is applied to enhance the image quality and reduce demosaicking artifacts. Our experimental results show that the proposed method substantially improves over existing demosaicking methods in terms of objective performance (CPSNR, S-CIELAB E, and FSIM), and visual performance.

  15. Fermionic formula for double Kostka polynomials

    OpenAIRE

    Liu, Shiyuan

    2016-01-01

    The $X=M$ conjecture asserts that the $1D$ sum and the fermionic formula coincide up to some constant power. In the case of type $A,$ both the $1D$ sum and the fermionic formula are closely related to Kostka polynomials. Double Kostka polynomials $K_{\\Bla,\\Bmu}(t),$ indexed by two double partitions $\\Bla,\\Bmu,$ are polynomials in $t$ introduced as a generalization of Kostka polynomials. In the present paper, we consider $K_{\\Bla,\\Bmu}(t)$ in the special case where $\\Bmu=(-,\\mu'').$ We formula...

  16. Polynomial sequences generated by infinite Hessenberg matrices

    Directory of Open Access Journals (Sweden)

    Verde-Star Luis

    2017-01-01

    Full Text Available We show that an infinite lower Hessenberg matrix generates polynomial sequences that correspond to the rows of infinite lower triangular invertible matrices. Orthogonal polynomial sequences are obtained when the Hessenberg matrix is tridiagonal. We study properties of the polynomial sequences and their corresponding matrices which are related to recurrence relations, companion matrices, matrix similarity, construction algorithms, and generating functions. When the Hessenberg matrix is also Toeplitz the polynomial sequences turn out to be of interpolatory type and we obtain additional results. For example, we show that every nonderogative finite square matrix is similar to a unique Toeplitz-Hessenberg matrix.

  17. A simple method of fitting ill-conditioned polynomials to data

    International Nuclear Information System (INIS)

    Buckler, A.N.; Lawrence, J.

    1979-04-01

    A very simple transformation of the independent variable x is shown to cure the ill-conditioning when some polynomial series are fitted to given Y values. Numerical examples are given to illustrate the power of the method. (author)

  18. The computation of bond percolation critical polynomials by the deletion–contraction algorithm

    International Nuclear Information System (INIS)

    Scullard, Christian R

    2012-01-01

    Although every exactly known bond percolation critical threshold is the root in [0,1] of a lattice-dependent polynomial, it has recently been shown that the notion of a critical polynomial can be extended to any periodic lattice. The polynomial is computed on a finite subgraph, called the base, of an infinite lattice. For any problem with exactly known solution, the prediction of the bond threshold is always correct for any base containing an arbitrary number of unit cells. For unsolved problems, the polynomial is referred to as the generalized critical polynomial and provides an approximation that becomes more accurate with increasing number of bonds in the base, appearing to approach the exact answer. The polynomials are computed using the deletion–contraction algorithm, which quickly becomes intractable by hand for more than about 18 bonds. Here, I present generalized critical polynomials calculated with a computer program for bases of up to 36 bonds for all the unsolved Archimedean lattices, except the kagome lattice, which was considered in an earlier work. The polynomial estimates are generally within 10 −5 –10 −7 of the numerical values, but the prediction for the (4,8 2 ) lattice, though not exact, is not ruled out by simulations. (paper)

  19. Polynomials formalism of quantum numbers

    International Nuclear Information System (INIS)

    Kazakov, K.V.

    2005-01-01

    Theoretical aspects of the recently suggested perturbation formalism based on the method of quantum number polynomials are considered in the context of the general anharmonicity problem. Using a biatomic molecule by way of example, it is demonstrated how the theory can be extrapolated to the case of vibrational-rotational interactions. As a result, an exact expression for the first coefficient of the Herman-Wallis factor is derived. In addition, the basic notions of the formalism are phenomenologically generalized and expanded to the problem of spin interaction. The concept of magneto-optical anharmonicity is introduced. As a consequence, an exact analogy is drawn with the well-known electro-optical theory of molecules, and a nonlinear dependence of the magnetic dipole moment of the system on the spin and wave variables is established [ru

  20. Computation of rectangular source integral by rational parameter polynomial method

    International Nuclear Information System (INIS)

    Prabha, Hem

    2001-01-01

    Hubbell et al. (J. Res. Nat Bureau Standards 64C, (1960) 121) have obtained a series expansion for the calculation of the radiation field generated by a plane isotropic rectangular source (plaque), in which leading term is the integral H(a,b). In this paper another integral I(a,b), which is related with the integral H(a,b) has been solved by the rational parameter polynomial method. From I(a,b), we compute H(a,b). Using this method the integral I(a,b) is expressed in the form of a polynomial of a rational parameter. Generally, a function f (x) is expressed in terms of x. In this method this is expressed in terms of x/(1+x). In this way, the accuracy of the expression is good over a wide range of x as compared to the earlier approach. The results for I(a,b) and H(a,b) are given for a sixth degree polynomial and are found to be in good agreement with the results obtained by numerically integrating the integral. Accuracy could be increased either by increasing the degree of the polynomial or by dividing the range of integration. The results of H(a,b) and I(a,b) are given for values of b and a up to 2.0 and 20.0, respectively

  1. Polynomial solutions of nonlinear integral equations

    International Nuclear Information System (INIS)

    Dominici, Diego

    2009-01-01

    We analyze the polynomial solutions of a nonlinear integral equation, generalizing the work of Bender and Ben-Naim (2007 J. Phys. A: Math. Theor. 40 F9, 2008 J. Nonlinear Math. Phys. 15 (Suppl. 3) 73). We show that, in some cases, an orthogonal solution exists and we give its general form in terms of kernel polynomials

  2. Topological string partition functions as polynomials

    International Nuclear Information System (INIS)

    Yamaguchi, Satoshi; Yau Shingtung

    2004-01-01

    We investigate the structure of the higher genus topological string amplitudes on the quintic hypersurface. It is shown that the partition functions of the higher genus than one can be expressed as polynomials of five generators. We also compute the explicit polynomial forms of the partition functions for genus 2, 3, and 4. Moreover, some coefficients are written down for all genus. (author)

  3. Polynomial solutions of nonlinear integral equations

    Energy Technology Data Exchange (ETDEWEB)

    Dominici, Diego [Department of Mathematics, State University of New York at New Paltz, 1 Hawk Dr. Suite 9, New Paltz, NY 12561-2443 (United States)], E-mail: dominicd@newpaltz.edu

    2009-05-22

    We analyze the polynomial solutions of a nonlinear integral equation, generalizing the work of Bender and Ben-Naim (2007 J. Phys. A: Math. Theor. 40 F9, 2008 J. Nonlinear Math. Phys. 15 (Suppl. 3) 73). We show that, in some cases, an orthogonal solution exists and we give its general form in terms of kernel polynomials.

  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. The Bessel polynomials and their differential operators

    International Nuclear Information System (INIS)

    Onyango Otieno, V.P.

    1987-10-01

    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

  6. Exceptional polynomials and SUSY quantum mechanics

    Indian Academy of Sciences (India)

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

  7. Connections between the matching and chromatic polynomials

    Directory of Open Access Journals (Sweden)

    E. J. Farrell

    1992-01-01

    Full Text Available The main results established are (i a connection between the matching and chromatic polynomials and (ii a formula for the matching polynomial of a general complement of a subgraph of a graph. Some deductions on matching and chromatic equivalence and uniqueness are made.

  8. Laguerre polynomials by a harmonic oscillator

    Science.gov (United States)

    Baykal, Melek; Baykal, Ahmet

    2014-09-01

    The study of an isotropic harmonic oscillator, using the factorization method given in Ohanian's textbook on quantum mechanics, is refined and some collateral extensions of the method related to the ladder operators and the associated Laguerre polynomials are presented. In particular, some analytical properties of the associated Laguerre polynomials are derived using the ladder operators.

  9. Laguerre polynomials by a harmonic oscillator

    International Nuclear Information System (INIS)

    Baykal, Melek; Baykal, Ahmet

    2014-01-01

    The study of an isotropic harmonic oscillator, using the factorization method given in Ohanian's textbook on quantum mechanics, is refined and some collateral extensions of the method related to the ladder operators and the associated Laguerre polynomials are presented. In particular, some analytical properties of the associated Laguerre polynomials are derived using the ladder operators. (paper)

  10. On Generalisation of Polynomials in Complex Plane

    Directory of Open Access Journals (Sweden)

    Maslina Darus

    2010-01-01

    Full Text Available The generalised Bell and Laguerre polynomials of fractional-order in complex z-plane are defined. Some properties are studied. Moreover, we proved that these polynomials are univalent solutions for second order differential equations. Also, the Laguerre-type of some special functions are introduced.

  11. Dual exponential polynomials and linear differential equations

    Science.gov (United States)

    Wen, Zhi-Tao; Gundersen, Gary G.; Heittokangas, Janne

    2018-01-01

    We study linear differential equations with exponential polynomial coefficients, where exactly one coefficient is of order greater than all the others. The main result shows that a nontrivial exponential polynomial solution of such an equation has a certain dual relationship with the maximum order coefficient. Several examples illustrate our results and exhibit possibilities that can occur.

  12. Technique for image interpolation using polynomial transforms

    NARCIS (Netherlands)

    Escalante Ramírez, B.; Martens, J.B.; Haskell, G.G.; Hang, H.M.

    1993-01-01

    We present a new technique for image interpolation based on polynomial transforms. This is an image representation model that analyzes an image by locally expanding it into a weighted sum of orthogonal polynomials. In the discrete case, the image segment within every window of analysis is

  13. Factoring polynomials over arbitrary finite fields

    NARCIS (Netherlands)

    Lange, T.; Winterhof, A.

    2000-01-01

    We analyse an extension of Shoup's (Inform. Process. Lett. 33 (1990) 261–267) deterministic algorithm for factoring polynomials over finite prime fields to arbitrary finite fields. In particular, we prove the existence of a deterministic algorithm which completely factors all monic polynomials of

  14. Application of polynomial preconditioners to conservation laws

    NARCIS (Netherlands)

    Geurts, Bernardus J.; van Buuren, R.; Lu, H.

    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

  15. On the number of polynomial solutions of Bernoulli and Abel polynomial differential equations

    Science.gov (United States)

    Cima, A.; Gasull, A.; Mañosas, F.

    2017-12-01

    In this paper we determine the maximum number of polynomial solutions of Bernoulli differential equations and of some integrable polynomial Abel differential equations. As far as we know, the tools used to prove our results have not been utilized before for studying this type of questions. We show that the addressed problems can be reduced to know the number of polynomial solutions of a related polynomial equation of arbitrary degree. Then we approach to these equations either applying several tools developed to study extended Fermat problems for polynomial equations, or reducing the question to the computation of the genus of some associated planar algebraic curves.

  16. Matrix product formula for Macdonald polynomials

    Science.gov (United States)

    Cantini, Luigi; de Gier, Jan; Wheeler, Michael

    2015-09-01

    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.

  17. Matrix product formula for Macdonald polynomials

    International Nuclear Information System (INIS)

    Cantini, Luigi; Gier, Jan de; Michael Wheeler

    2015-01-01

    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)

  18. Arabic text classification using Polynomial Networks

    Directory of Open Access Journals (Sweden)

    Mayy M. Al-Tahrawi

    2015-10-01

    Full Text Available In this paper, an Arabic statistical learning-based text classification system has been developed using Polynomial Neural Networks. Polynomial Networks have been recently applied to English text classification, but they were never used for Arabic text classification. In this research, we investigate the performance of Polynomial Networks in classifying Arabic texts. Experiments are conducted on a widely used Arabic dataset in text classification: Al-Jazeera News dataset. We chose this dataset to enable direct comparisons of the performance of Polynomial Networks classifier versus other well-known classifiers on this dataset in the literature of Arabic text classification. Results of experiments show that Polynomial Networks classifier is a competitive algorithm to the state-of-the-art ones in the field of Arabic text classification.

  19. Optimal Conformal Polynomial Projections for Croatia According to the Airy/Jordan Criterion

    Directory of Open Access Journals (Sweden)

    Dražen Tutić

    2009-05-01

    Full Text Available The paper describes optimal conformal polynomial projections for Croatia according to the Airy/Jordan criterion. A brief introduction of history and theory of conformal mapping is followed by descriptions of conformal polynomial projections and their current application. The paper considers polynomials of degrees 1 to 10. Since there are conditions in which the 1st degree polynomial becomes the famous Mercator projection, it was not considered specifically for Croatian territory. The area of Croatia was defined as a union of national territory and the continental shelf. Area definition data were taken from the Euro Global Map 1:1 000 000 for Croatia, as well as from two maritime delimitation treaties. Such an irregular area was approximated with a regular grid consisting of 11 934 ellipsoidal trapezoids 2' large. The Airy/Jordan criterion for the optimal projection is defined as minimum of weighted mean of Airy/Jordan measure of distortion in points. The value of the Airy/Jordan criterion is calculated from all 11 934 centres of ellipsoidal trapezoids, while the weights are equal to areas of corresponding ellipsoidal trapezoids. The minimum is obtained by Nelder and Mead’s method, as implemented in the fminsearch function of the MATLAB package. Maps of Croatia representing the distribution of distortions are given for polynomial degrees 2 to 6 and 10. Increasing the polynomial degree results in better projections considering the criterion, and the 6th degree polynomial provides a good ratio of formula complexity and criterion value.

  20. on the performance of Autoregressive Moving Average Polynomial

    African Journals Online (AJOL)

    Timothy Ademakinwa

    Distributed Lag (PDL) model, Autoregressive Polynomial Distributed Lag ... Moving Average Polynomial Distributed Lag (ARMAPDL) model. ..... Global Journal of Mathematics and Statistics. Vol. 1. ... Business and Economic Research Center.

  1. Neck curve polynomials in neck rupture model

    International Nuclear Information System (INIS)

    Kurniadi, Rizal; Perkasa, Yudha S.; Waris, Abdul

    2012-01-01

    The Neck Rupture Model is a model that explains the scission process which has smallest radius in liquid drop at certain position. Old fashion of rupture position is determined randomly so that has been called as Random Neck Rupture Model (RNRM). The neck curve polynomials have been employed in the Neck Rupture Model for calculation the fission yield of neutron induced fission reaction of 280 X 90 with changing of order of polynomials as well as temperature. The neck curve polynomials approximation shows the important effects in shaping of fission yield curve.

  2. Charactering baseline shift with 4th polynomial function for portable biomedical near-infrared spectroscopy device

    Science.gov (United States)

    Zhao, Ke; Ji, Yaoyao; Pan, Boan; Li, Ting

    2018-02-01

    The continuous-wave Near-infrared spectroscopy (NIRS) devices have been highlighted for its clinical and health care applications in noninvasive hemodynamic measurements. The baseline shift of the deviation measurement attracts lots of attentions for its clinical importance. Nonetheless current published methods have low reliability or high variability. In this study, we found a perfect polynomial fitting function for baseline removal, using NIRS. Unlike previous studies on baseline correction for near-infrared spectroscopy evaluation of non-hemodynamic particles, we focused on baseline fitting and corresponding correction method for NIRS and found that the polynomial fitting function at 4th order is greater than the function at 2nd order reported in previous research. Through experimental tests of hemodynamic parameters of the solid phantom, we compared the fitting effect between the 4th order polynomial and the 2nd order polynomial, by recording and analyzing the R values and the SSE (the sum of squares due to error) values. The R values of the 4th order polynomial function fitting are all higher than 0.99, which are significantly higher than the corresponding ones of 2nd order, while the SSE values of the 4th order are significantly smaller than the corresponding ones of the 2nd order. By using the high-reliable and low-variable 4th order polynomial fitting function, we are able to remove the baseline online to obtain more accurate NIRS measurements.

  3. Numerical solution of the Schroedinger equation with a polynomial potential

    International Nuclear Information System (INIS)

    Campoy, G.; Palma, A.

    1986-01-01

    A numerical method for solving the Schroedinger equation for a potential expressed as a polynomial is proposed. The basic assumption relies on the asymptotic properties of the solution of this equation. It is possible to obtain the energies and the stationary state functions simultaneously. They analyze, in particular, the cases of the quartic anharmonic oscillator and a hydrogen atom perturbed by a quadratic term, obtaining its energy eigenvalues for some values of the perturbation parameter. Together with the Hellmann-Feynman theorem, they use their algorithm to calculate expectation values of x'' for arbitrary positive values of n. 4 tables

  4. Quantum models with energy-dependent potentials solvable in terms of exceptional orthogonal polynomials

    International Nuclear Information System (INIS)

    Schulze-Halberg, Axel; Roy, Pinaki

    2017-01-01

    We construct energy-dependent potentials for which the Schrödinger equations admit solutions in terms of exceptional orthogonal polynomials. Our method of construction is based on certain point transformations, applied to the equations of exceptional Hermite, Jacobi and Laguerre polynomials. We present several examples of boundary-value problems with energy-dependent potentials that admit a discrete spectrum and the corresponding normalizable solutions in closed form.

  5. Quantum models with energy-dependent potentials solvable in terms of exceptional orthogonal polynomials

    Energy Technology Data Exchange (ETDEWEB)

    Schulze-Halberg, Axel, E-mail: axgeschu@iun.edu [Department of Mathematics and Actuarial Science, Indiana University Northwest, 3400 Broadway, Gary IN 46408 (United States); Department of Physics, Indiana University Northwest, 3400 Broadway, Gary IN 46408 (United States); Roy, Pinaki, E-mail: pinaki@isical.ac.in [Physics and Applied Mathematics Unit, Indian Statistical Institute, Kolkata 700108 (India)

    2017-03-15

    We construct energy-dependent potentials for which the Schrödinger equations admit solutions in terms of exceptional orthogonal polynomials. Our method of construction is based on certain point transformations, applied to the equations of exceptional Hermite, Jacobi and Laguerre polynomials. We present several examples of boundary-value problems with energy-dependent potentials that admit a discrete spectrum and the corresponding normalizable solutions in closed form.

  6. Multilevel weighted least squares polynomial approximation

    KAUST Repository

    Haji-Ali, Abdul-Lateef; Nobile, Fabio; Tempone, Raul; Wolfers, Sö ren

    2017-01-01

    , obtaining polynomial approximations with a single level method can become prohibitively expensive, as it requires a sufficiently large number of samples, each computed with a sufficiently small discretization error. As a solution to this problem, we propose

  7. Polynomials in finite geometries and combinatorics

    NARCIS (Netherlands)

    Blokhuis, A.; Walker, K.

    1993-01-01

    It is illustrated how elementary properties of polynomials can be used to attack extremal problems in finite and euclidean geometry, and in combinatorics. Also a new result, related to the problem of neighbourly cylinders is presented.

  8. Polynomial analysis of ambulatory blood pressure measurements

    NARCIS (Netherlands)

    Zwinderman, A. H.; Cleophas, T. A.; Cleophas, T. J.; van der Wall, E. E.

    2001-01-01

    In normotensive subjects blood pressures follow a circadian rhythm. A circadian rhythm in hypertensive patients is less well established, and may be clinically important, particularly with rigorous treatments of daytime blood pressures. Polynomial analysis of ambulatory blood pressure monitoring

  9. Handbook on semidefinite, conic and polynomial optimization

    CERN Document Server

    Anjos, Miguel F

    2012-01-01

    This book offers the reader a snapshot of the state-of-the-art in the growing and mutually enriching areas of semidefinite optimization, conic optimization and polynomial optimization. It covers theory, algorithms, software and applications.

  10. Generalized catalan numbers, sequences and polynomials

    OpenAIRE

    KOÇ, Cemal; GÜLOĞLU, İsmail; ESİN, Songül

    2010-01-01

    In this paper we present an algebraic interpretation for generalized Catalan numbers. We describe them as dimensions of certain subspaces of multilinear polynomials. This description is of utmost importance in the investigation of annihilators in exterior algebras.

  11. Introduction to the spectral theory of polynomial operator pencils

    CERN Document Server

    Markus, A S

    1988-01-01

    This monograph contains an exposition of the foundations of the spectral theory of polynomial operator pencils acting in a Hilbert space. Spectral problems for polynomial pencils have attracted a steady interest in the last 35 years, mainly because they arise naturally in such diverse areas of mathematical physics as differential equations and boundary value problems, controllable systems, the theory of oscillations and waves, elasticity theory, and hydromechanics. In this book, the author devotes most of his attention to the fundamental results of Keldysh on multiple completeness of the eigenvectors and associate vectors of a pencil, and on the asymptotic behavior of its eigenvalues and generalizations of these results. The author also presents various theorems on spectral factorization of pencils which grew out of known results of M. G. Kreibreven and Heinz Langer. A large portion of the book involves the theory of selfadjoint pencils, an area having numerous applications. Intended for mathematicians, resea...

  12. REGSTEP - stepwise multivariate polynomial regression with singular extensions

    International Nuclear Information System (INIS)

    Davierwalla, D.M.

    1977-09-01

    The program REGSTEP determines a polynomial approximation, in the least squares sense, to tabulated data. The polynomial may be univariate or multivariate. The computational method is that of stepwise regression. A variable is inserted into the regression basis if it is significant with respect to an appropriate F-test at a preselected risk level. In addition, should a variable already in the basis, become nonsignificant (again with respect to an appropriate F-test) after the entry of a new variable, it is expelled from the model. Thus only significant variables are retained in the model. Although written expressly to be incorporated into CORCOD, a code for predicting nuclear cross sections for given values of power, temperature, void fractions, Boron content etc. there is nothing to limit the use of REGSTEP to nuclear applications, as the examples demonstrate. A separate version has been incorporated into RSYST for the general user. (Auth.)

  13. Firefly Algorithm for Polynomial Bézier Surface Parameterization

    Directory of Open Access Journals (Sweden)

    Akemi Gálvez

    2013-01-01

    reality, medical imaging, computer graphics, computer animation, and many others. Very often, the preferred approximating surface is polynomial, usually described in parametric form. This leads to the problem of determining suitable parametric values for the data points, the so-called surface parameterization. In real-world settings, data points are generally irregularly sampled and subjected to measurement noise, leading to a very difficult nonlinear continuous optimization problem, unsolvable with standard optimization techniques. This paper solves the parameterization problem for polynomial Bézier surfaces by applying the firefly algorithm, a powerful nature-inspired metaheuristic algorithm introduced recently to address difficult optimization problems. The method has been successfully applied to some illustrative examples of open and closed surfaces, including shapes with singularities. Our results show that the method performs very well, being able to yield the best approximating surface with a high degree of accuracy.

  14. About the solvability of matrix polynomial equations

    OpenAIRE

    Netzer, Tim; Thom, Andreas

    2016-01-01

    We study self-adjoint matrix polynomial equations in a single variable and prove existence of self-adjoint solutions under some assumptions on the leading form. Our main result is that any self-adjoint matrix polynomial equation of odd degree with non-degenerate leading form can be solved in self-adjoint matrices. We also study equations of even degree and equations in many variables.

  15. Two polynomial representations of experimental design

    OpenAIRE

    Notari, Roberto; Riccomagno, Eva; Rogantin, Maria-Piera

    2007-01-01

    In the context of algebraic statistics an experimental design is described by a set of polynomials called the design ideal. This, in turn, is generated by finite sets of polynomials. Two types of generating sets are mostly used in the literature: Groebner bases and indicator functions. We briefly describe them both, how they are used in the analysis and planning of a design and how to switch between them. Examples include fractions of full factorial designs and designs for mixture experiments.

  16. Rotation of 2D orthogonal polynomials

    Czech Academy of Sciences Publication Activity Database

    Yang, B.; Flusser, Jan; Kautský, J.

    2018-01-01

    Roč. 102, č. 1 (2018), s. 44-49 ISSN 0167-8655 R&D Projects: GA ČR GA15-16928S Institutional support: RVO:67985556 Keywords : Rotation invariants * Orthogonal polynomials * Recurrent relation * Hermite-like polynomials * Hermite moments Subject RIV: JD - Computer Applications, Robotics Impact factor: 1.995, year: 2016 http://library.utia.cas.cz/separaty/2017/ZOI/flusser-0483250.pdf

  17. Stability analysis of polynomial fuzzy models via polynomial fuzzy Lyapunov functions

    OpenAIRE

    Bernal Reza, Miguel Ángel; Sala, Antonio; JAADARI, ABDELHAFIDH; Guerra, Thierry-Marie

    2011-01-01

    In this paper, the stability of continuous-time polynomial fuzzy models by means of a polynomial generalization of fuzzy Lyapunov functions is studied. Fuzzy Lyapunov functions have been fruitfully used in the literature for local analysis of Takagi-Sugeno models, a particular class of the polynomial fuzzy ones. Based on a recent Taylor-series approach which allows a polynomial fuzzy model to exactly represent a nonlinear model in a compact set of the state space, it is shown that a refinemen...

  18. Vertex models, TASEP and Grothendieck polynomials

    International Nuclear Information System (INIS)

    Motegi, Kohei; Sakai, Kazumitsu

    2013-01-01

    We examine the wavefunctions and their scalar products of a one-parameter family of integrable five-vertex models. At a special point of the parameter, the model investigated is related to an irreversible interacting stochastic particle system—the so-called totally asymmetric simple exclusion process (TASEP). By combining the quantum inverse scattering method with a matrix product representation of the wavefunctions, the on-/off-shell wavefunctions of the five-vertex models are represented as a certain determinant form. Up to some normalization factors, we find that the wavefunctions are given by Grothendieck polynomials, which are a one-parameter deformation of Schur polynomials. Introducing a dual version of the Grothendieck polynomials, and utilizing the determinant representation for the scalar products of the wavefunctions, we derive a generalized Cauchy identity satisfied by the Grothendieck polynomials and their duals. Several representation theoretical formulae for the Grothendieck polynomials are also presented. As a byproduct, the relaxation dynamics such as Green functions for the periodic TASEP are found to be described in terms of the Grothendieck polynomials. (paper)

  19. Many-body orthogonal polynomial systems

    International Nuclear Information System (INIS)

    Witte, N.S.

    1997-03-01

    The fundamental methods employed in the moment problem, involving orthogonal polynomial systems, the Lanczos algorithm, continued fraction analysis and Pade approximants has been combined with a cumulant approach and applied to the extensive many-body problem in physics. This has yielded many new exact results for many-body systems in the thermodynamic limit - for the ground state energy, for excited state gaps, for arbitrary ground state avenges - and are of a nonperturbative nature. These results flow from a confluence property of the three-term recurrence coefficients arising and define a general class of many-body orthogonal polynomials. These theorems constitute an analytical solution to the Lanczos algorithm in that they are expressed in terms of the three-term recurrence coefficients α and β. These results can also be applied approximately for non-solvable models in the form of an expansion, in a descending series of the system size. The zeroth order order this expansion is just the manifestation of the central limit theorem in which a Gaussian measure and hermite polynomials arise. The first order represents the first non-trivial order, in which classical distribution functions like the binomial distributions arise and the associated class of orthogonal polynomials are Meixner polynomials. Amongst examples of systems which have infinite order in the expansion are q-orthogonal polynomials where q depends on the system size in a particular way. (author)

  20. Polynomial Chaos Surrogates for Bayesian Inference

    KAUST Repository

    Le Maitre, Olivier

    2016-01-06

    The Bayesian inference is a popular probabilistic method to solve inverse problems, such as the identification of field parameter in a PDE model. The inference rely on the Bayes rule to update the prior density of the sought field, from observations, and derive its posterior distribution. In most cases the posterior distribution has no explicit form and has to be sampled, for instance using a Markov-Chain Monte Carlo method. In practice the prior field parameter is decomposed and truncated (e.g. by means of Karhunen- Lo´eve decomposition) to recast the inference problem into the inference of a finite number of coordinates. Although proved effective in many situations, the Bayesian inference as sketched above faces several difficulties requiring improvements. First, sampling the posterior can be a extremely costly task as it requires multiple resolutions of the PDE model for different values of the field parameter. Second, when the observations are not very much informative, the inferred parameter field can highly depends on its prior which can be somehow arbitrary. These issues have motivated the introduction of reduced modeling or surrogates for the (approximate) determination of the parametrized PDE solution and hyperparameters in the description of the prior field. Our contribution focuses on recent developments in these two directions: the acceleration of the posterior sampling by means of Polynomial Chaos expansions and the efficient treatment of parametrized covariance functions for the prior field. We also discuss the possibility of making such approach adaptive to further improve its efficiency.

  1. Chemical composition and nutritive value of irrigated tall fescue ...

    African Journals Online (AJOL)

    Chemical composition and nutritive value of irrigated tall fescue pasture for dairy cows. TJ Dugmore, KP Walsh, Sally J. Morning, CI MacDonald. Abstract. No Abstract. Full Text: EMAIL FREE FULL TEXT EMAIL FREE FULL TEXT · DOWNLOAD FULL TEXT DOWNLOAD FULL TEXT · AJOL African Journals Online. HOW TO ...

  2. Relations between Möbius and coboundary polynomials

    NARCIS (Netherlands)

    Jurrius, R.P.M.J.

    2012-01-01

    It is known that, in general, the coboundary polynomial and the Möbius polynomial of a matroid do not determine each other. Less is known about more specific cases. In this paper, we will investigate if it is possible that the Möbius polynomial of a matroid, together with the Möbius polynomial of

  3. An algorithmic approach to solving polynomial equations associated with quantum circuits

    International Nuclear Information System (INIS)

    Gerdt, V.P.; Zinin, M.V.

    2009-01-01

    In this paper we present two algorithms for reducing systems of multivariate polynomial equations over the finite field F 2 to the canonical triangular form called lexicographical Groebner basis. This triangular form is the most appropriate for finding solutions of the system. On the other hand, the system of polynomials over F 2 whose variables also take values in F 2 (Boolean polynomials) completely describes the unitary matrix generated by a quantum circuit. In particular, the matrix itself can be computed by counting the number of solutions (roots) of the associated polynomial system. Thereby, efficient construction of the lexicographical Groebner bases over F 2 associated with quantum circuits gives a method for computing their circuit matrices that is alternative to the direct numerical method based on linear algebra. We compare our implementation of both algorithms with some other software packages available for computing Groebner bases over F 2

  4. Special polynomials associated with rational solutions of some hierarchies

    International Nuclear Information System (INIS)

    Kudryashov, Nikolai A.

    2009-01-01

    New special polynomials associated with rational solutions of the Painleve hierarchies are introduced. The Hirota relations for these special polynomials are found. Differential-difference hierarchies to find special polynomials are presented. These formulae allow us to search special polynomials associated with the hierarchies. It is shown that rational solutions of the Caudrey-Dodd-Gibbon, the Kaup-Kupershmidt and the modified hierarchy for these ones can be obtained using new special polynomials.

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

  6. New polynomial-based molecular descriptors with low degeneracy.

    Directory of Open Access Journals (Sweden)

    Matthias Dehmer

    Full Text Available In this paper, we introduce a novel graph polynomial called the 'information polynomial' of a graph. This graph polynomial can be derived by using a probability distribution of the vertex set. By using the zeros of the obtained polynomial, we additionally define some novel spectral descriptors. Compared with those based on computing the ordinary characteristic polynomial of a graph, we perform a numerical study using real chemical databases. We obtain that the novel descriptors do have a high discrimination power.

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

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

    KAUST Repository

    Ait-Haddou, Rachid; Goldman, Ron

    2015-01-01

    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.

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

  10. Complementary Walsh-Hadamard coded optical CDMA coder/decoders structured over arrayed-waveguide grating routers

    Science.gov (United States)

    Huang, Jen-Fa; Yang, Chao-Chin; Tseng, Shin-Pin

    2004-01-01

    In this paper, an optical code-division multiple-access (OCDMA) system with complementary Walsh-Hadamard coded optical encoder/decoder configuration structured over arrayed-waveguide grating (AWG) routers is examined. In the proposed system, each network user requires only two AWG routers to accomplish spectral encoding and decoding for complementary keying, thus, resulting a simpler and low cost system. Performance of the proposed system is analyzed by taking the effect of phase-induced intensity noise into account. The result indicates that the established system not only preserves the capability of suppressing multiple-access interference (MAI), but also improves bit-error-rate performance as compared to the conventional coders employing simple on-off keying.

  11. Discrete-time state estimation for stochastic polynomial systems over polynomial observations

    Science.gov (United States)

    Hernandez-Gonzalez, M.; Basin, M.; Stepanov, O.

    2018-07-01

    This paper presents a solution to the mean-square state estimation problem for stochastic nonlinear polynomial systems over polynomial observations confused with additive white Gaussian noises. The solution is given in two steps: (a) computing the time-update equations and (b) computing the measurement-update equations for the state estimate and error covariance matrix. A closed form of this filter is obtained by expressing conditional expectations of polynomial terms as functions of the state estimate and error covariance. As a particular case, the mean-square filtering equations are derived for a third-degree polynomial system with second-degree polynomial measurements. Numerical simulations show effectiveness of the proposed filter compared to the extended Kalman filter.

  12. Stabilisation of discrete-time polynomial fuzzy systems via a polynomial lyapunov approach

    Science.gov (United States)

    Nasiri, Alireza; Nguang, Sing Kiong; Swain, Akshya; Almakhles, Dhafer

    2018-02-01

    This paper deals with the problem of designing a controller for a class of discrete-time nonlinear systems which is represented by discrete-time polynomial fuzzy model. Most of the existing control design methods for discrete-time fuzzy polynomial systems cannot guarantee their Lyapunov function to be a radially unbounded polynomial function, hence the global stability cannot be assured. The proposed control design in this paper guarantees a radially unbounded polynomial Lyapunov functions which ensures global stability. In the proposed design, state feedback structure is considered and non-convexity problem is solved by incorporating an integrator into the controller. Sufficient conditions of stability are derived in terms of polynomial matrix inequalities which are solved via SOSTOOLS in MATLAB. A numerical example is presented to illustrate the effectiveness of the proposed controller.

  13. Vortices and polynomials: non-uniqueness of the Adler–Moser polynomials for the Tkachenko equation

    International Nuclear Information System (INIS)

    Demina, Maria V; Kudryashov, Nikolai A

    2012-01-01

    Stationary and translating relative equilibria of point vortices in the plane are studied. It is shown that stationary equilibria of any system containing point vortices with arbitrary choice of circulations can be described with the help of the Tkachenko equation. It is also obtained that translating relative equilibria of point vortices with arbitrary circulations can be constructed using a generalization of the Tkachenko equation. Roots of any pair of polynomials solving the Tkachenko equation and the generalized Tkachenko equation are proved to give positions of point vortices in stationary and translating relative equilibria accordingly. These results are valid even if the polynomials in a pair have multiple or common roots. It is obtained that the Adler–Moser polynomial provides non-unique polynomial solutions of the Tkachenko equation. It is shown that the generalized Tkachenko equation possesses polynomial solutions with degrees that are not triangular numbers. (paper)

  14. Global sensitivity analysis by polynomial dimensional decomposition

    Energy Technology Data Exchange (ETDEWEB)

    Rahman, Sharif, E-mail: rahman@engineering.uiowa.ed [College of Engineering, The University of Iowa, Iowa City, IA 52242 (United States)

    2011-07-15

    This paper presents a polynomial dimensional decomposition (PDD) method for global sensitivity analysis of stochastic systems subject to independent random input following arbitrary probability distributions. The method involves Fourier-polynomial expansions of lower-variate component functions of a stochastic response by measure-consistent orthonormal polynomial bases, analytical formulae for calculating the global sensitivity indices in terms of the expansion coefficients, and dimension-reduction integration for estimating the expansion coefficients. Due to identical dimensional structures of PDD and analysis-of-variance decomposition, the proposed method facilitates simple and direct calculation of the global sensitivity indices. Numerical results of the global sensitivity indices computed for smooth systems reveal significantly higher convergence rates of the PDD approximation than those from existing methods, including polynomial chaos expansion, random balance design, state-dependent parameter, improved Sobol's method, and sampling-based methods. However, for non-smooth functions, the convergence properties of the PDD solution deteriorate to a great extent, warranting further improvements. The computational complexity of the PDD method is polynomial, as opposed to exponential, thereby alleviating the curse of dimensionality to some extent.

  15. Remarks on determinants and the classical polynomials

    International Nuclear Information System (INIS)

    Henning, J.J.; Kranold, H.U.; Louw, D.F.B.

    1986-01-01

    As motivation for this formal analysis the problem of Landau damping of Bernstein modes is discussed. It is shown that in the case of a weak but finite constant external magnetic field, the analytical structure of the dispersion relations is of such a nature that longitudinal waves propagating orthogonal to the external magnetic field are also damped, contrary to normal belief. In the treatment of the linearized Vlasov equation it is found convenient to generate certain polynomials by the problem at hand and to explicitly write down expressions for these polynomials. In the course of this study methods are used that relate to elementary but fairly unknown functional relationships between power sums and coefficients of polynomials. These relationships, also called Waring functions, are derived. They are then used in other applications to give explicit expressions for the generalized Laguerre polynomials in terms of determinant functions. The properties of polynomials generated by a wide class of generating functions are investigated. These relationships are also used to obtain explicit forms for the cumulants of a distribution in terms of its moments. It is pointed out that cumulants (or moments, for that matter) do not determine a distribution function

  16. Multilevel weighted least squares polynomial approximation

    KAUST Repository

    Haji-Ali, Abdul-Lateef

    2017-06-30

    Weighted least squares polynomial approximation uses random samples to determine projections of functions onto spaces of polynomials. It has been shown that, using an optimal distribution of sample locations, the number of samples required to achieve quasi-optimal approximation in a given polynomial subspace scales, up to a logarithmic factor, linearly in the dimension of this space. However, in many applications, the computation of samples includes a numerical discretization error. Thus, obtaining polynomial approximations with a single level method can become prohibitively expensive, as it requires a sufficiently large number of samples, each computed with a sufficiently small discretization error. As a solution to this problem, we propose a multilevel method that utilizes samples computed with different accuracies and is able to match the accuracy of single-level approximations with reduced computational cost. We derive complexity bounds under certain assumptions about polynomial approximability and sample work. Furthermore, we propose an adaptive algorithm for situations where such assumptions cannot be verified a priori. Finally, we provide an efficient algorithm for the sampling from optimal distributions and an analysis of computationally favorable alternative distributions. Numerical experiments underscore the practical applicability of our method.

  17. Automatic lithofacies segmentation from well-logs data. A comparative study between the Self-Organizing Map (SOM) and Walsh transform

    Science.gov (United States)

    Aliouane, Leila; Ouadfeul, Sid-Ali; Rabhi, Abdessalem; Rouina, Fouzi; Benaissa, Zahia; Boudella, Amar

    2013-04-01

    The main goal of this work is to realize a comparison between two lithofacies segmentation techniques of reservoir interval. The first one is based on the Kohonen's Self-Organizing Map neural network machine. The second technique is based on the Walsh transform decomposition. Application to real well-logs data of two boreholes located in the Algerian Sahara shows that the Self-organizing map is able to provide more lithological details that the obtained lithofacies model given by the Walsh decomposition. Keywords: Comparison, Lithofacies, SOM, Walsh References: 1)Aliouane, L., Ouadfeul, S., Boudella, A., 2011, Fractal analysis based on the continuous wavelet transform and lithofacies classification from well-logs data using the self-organizing map neural network, Arabian Journal of geosciences, doi: 10.1007/s12517-011-0459-4 2) Aliouane, L., Ouadfeul, S., Djarfour, N., Boudella, A., 2012, Petrophysical Parameters Estimation from Well-Logs Data Using Multilayer Perceptron and Radial Basis Function Neural Networks, Lecture Notes in Computer Science Volume 7667, 2012, pp 730-736, doi : 10.1007/978-3-642-34500-5_86 3)Ouadfeul, S. and Aliouane., L., 2011, Multifractal analysis revisited by the continuous wavelet transform applied in lithofacies segmentation from well-logs data, International journal of applied physics and mathematics, Vol01 N01. 4) Ouadfeul, S., Aliouane, L., 2012, Lithofacies Classification Using the Multilayer Perceptron and the Self-organizing Neural Networks, Lecture Notes in Computer Science Volume 7667, 2012, pp 737-744, doi : 10.1007/978-3-642-34500-5_87 5) Weisstein, Eric W. "Fast Walsh Transform." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/FastWalshTransform.html

  18. Polynomial chaos functions and stochastic differential equations

    International Nuclear Information System (INIS)

    Williams, M.M.R.

    2006-01-01

    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

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

  20. Fast beampattern evaluation by polynomial rooting

    Science.gov (United States)

    Häcker, P.; Uhlich, S.; Yang, B.

    2011-07-01

    Current automotive radar systems measure the distance, the relative velocity and the direction of objects in their environment. This information enables the car to support the driver. The direction estimation capabilities of a sensor array depend on its beampattern. To find the array configuration leading to the best angle estimation by a global optimization algorithm, a huge amount of beampatterns have to be calculated to detect their maxima. In this paper, a novel algorithm is proposed to find all maxima of an array's beampattern fast and reliably, leading to accelerated array optimizations. The algorithm works for arrays having the sensors on a uniformly spaced grid. We use a general version of the gcd (greatest common divisor) function in order to write the problem as a polynomial. We differentiate and root the polynomial to get the extrema of the beampattern. In addition, we show a method to reduce the computational burden even more by decreasing the order of the polynomial.

  1. A polynomial based model for cell fate prediction in human diseases.

    Science.gov (United States)

    Ma, Lichun; Zheng, Jie

    2017-12-21

    Cell fate regulation directly affects tissue homeostasis and human health. Research on cell fate decision sheds light on key regulators, facilitates understanding the mechanisms, and suggests novel strategies to treat human diseases that are related to abnormal cell development. In this study, we proposed a polynomial based model to predict cell fate. This model was derived from Taylor series. As a case study, gene expression data of pancreatic cells were adopted to test and verify the model. As numerous features (genes) are available, we employed two kinds of feature selection methods, i.e. correlation based and apoptosis pathway based. Then polynomials of different degrees were used to refine the cell fate prediction function. 10-fold cross-validation was carried out to evaluate the performance of our model. In addition, we analyzed the stability of the resultant cell fate prediction model by evaluating the ranges of the parameters, as well as assessing the variances of the predicted values at randomly selected points. Results show that, within both the two considered gene selection methods, the prediction accuracies of polynomials of different degrees show little differences. Interestingly, the linear polynomial (degree 1 polynomial) is more stable than others. When comparing the linear polynomials based on the two gene selection methods, it shows that although the accuracy of the linear polynomial that uses correlation analysis outcomes is a little higher (achieves 86.62%), the one within genes of the apoptosis pathway is much more stable. Considering both the prediction accuracy and the stability of polynomial models of different degrees, the linear model is a preferred choice for cell fate prediction with gene expression data of pancreatic cells. The presented cell fate prediction model can be extended to other cells, which may be important for basic research as well as clinical study of cell development related diseases.

  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

    Polynomial hashing as an instantiation of universal hashing is a widely employed method for the construction of MACs and authenticated encryption (AE) schemes, the ubiquitous GCM being a prominent example. It is also used in recent AE proposals within the CAESAR competition which aim at providing...... 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...

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

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

  5. Complex centers of polynomial differential equations

    Directory of Open Access Journals (Sweden)

    Mohamad Ali M. Alwash

    2007-07-01

    Full Text Available We present some results on the existence and nonexistence of centers for polynomial first order ordinary differential equations with complex coefficients. In particular, we show that binomial differential equations without linear terms do not have complex centers. Classes of polynomial differential equations, with more than two terms, are presented that do not have complex centers. We also study the relation between complex centers and the Pugh problem. An algorithm is described to solve the Pugh problem for equations without complex centers. The method of proof involves phase plane analysis of the polar equations and a local study of periodic solutions.

  6. Differential recurrence formulae for orthogonal polynomials

    Directory of Open Access Journals (Sweden)

    Anton L. W. von Bachhaus

    1995-11-01

    Full Text Available Part I - By combining a general 2nd-order linear homogeneous ordinary differential equation with the three-term recurrence relation possessed by all orthogonal polynomials, it is shown that sequences of orthogonal polynomials which satisfy a differential equation of the above mentioned type necessarily have a differentiation formula of the type: gn(xY'n(x=fn(xYn(x+Yn-1(x. Part II - A recurrence formula of the form: rn(xY'n(x+sn(xY'n+1(x+tn(xY'n-1(x=0, is derived using the result of Part I.

  7. Polynomial regression analysis and significance test of the regression function

    International Nuclear Information System (INIS)

    Gao Zhengming; Zhao Juan; He Shengping

    2012-01-01

    In order to analyze the decay heating power of a certain radioactive isotope per kilogram with polynomial regression method, the paper firstly demonstrated the broad usage of polynomial function and deduced its parameters with ordinary least squares estimate. Then significance test method of polynomial regression function is derived considering the similarity between the polynomial regression model and the multivariable linear regression model. Finally, polynomial regression analysis and significance test of the polynomial function are done to the decay heating power of the iso tope per kilogram in accord with the authors' real work. (authors)

  8. The higher rank numerical range of matrix polynomials

    OpenAIRE

    Aretaki, Aikaterini; Maroulas, John

    2011-01-01

    The notion of the higher rank numerical range $\\Lambda_{k}(L(\\lambda))$ for matrix polynomials $L(\\lambda)=A_{m}\\lambda^{m}+...+A_{1}\\lambda+A_{0}$ is introduced here and some fundamental geometrical properties are investigated. Further, the sharp points of $\\Lambda_{k}(L(\\lambda))$ are defined and their relation to the numerical range $w(L(\\lambda))$ is presented. A connection of $\\Lambda_{k}(L(\\lambda))$ with the vector-valued higher rank numerical range $\\Lambda_{k}(A_{0},..., A_{m})$ is a...

  9. Nonclassical Orthogonal Polynomials and Corresponding Quadratures

    CERN Document Server

    Fukuda, H; Alt, E O; Matveenko, A V

    2004-01-01

    We construct nonclassical orthogonal polynomials and calculate abscissas and weights of Gaussian quadrature for arbitrary weight and interval. The program is written by Mathematica and it works if moment integrals are given analytically. The result is a FORTRAN subroutine ready to utilize the quadrature.

  10. Intrinsic Diophantine approximation on general polynomial surfaces

    DEFF Research Database (Denmark)

    Tiljeset, Morten Hein

    2017-01-01

    We study the Hausdorff measure and dimension of the set of intrinsically simultaneously -approximable points on a curve, surface, etc, given as a graph of integer polynomials. We obtain complete answers to these questions for algebraically “nice” manifolds. This generalizes earlier work done...

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

  12. Indecomposability of polynomials via Jacobian matrix

    International Nuclear Information System (INIS)

    Cheze, G.; Najib, S.

    2007-12-01

    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)

  13. On selfadjoint functors satisfying polynomial relations

    DEFF Research Database (Denmark)

    Agerholm, Troels; Mazorchuk, Volodomyr

    2011-01-01

    We study selfadjoint functors acting on categories of finite dimen- sional modules over finite dimensional algebras with an emphasis on functors satisfying some polynomial relations. Selfadjoint func- tors satisfying several easy relations, in particular, idempotents and square roots of a sum...

  14. Polynomial Variables and the Jacobian Problem

    Indian Academy of Sciences (India)

    algebra and algebraic geometry, and ... algebraically, to making the change of variables (X, Y) r--t. (X +p, Y ... aX + bY + p and eX + dY + q are linear polynomials in X, Y. ..... [5] T T Moh, On the Jacobian conjecture and the confipration of roots,.

  15. Function approximation with polynomial regression slines

    International Nuclear Information System (INIS)

    Urbanski, P.

    1996-01-01

    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)

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

  17. Polynomial Asymptotes of the Second Kind

    Science.gov (United States)

    Dobbs, David E.

    2011-01-01

    This note uses the analytic notion of asymptotic functions to study when a function is asymptotic to a polynomial function. Along with associated existence and uniqueness results, this kind of asymptotic behaviour is related to the type of asymptote that was recently defined in a more geometric way. Applications are given to rational functions and…

  18. Characteristic polynomials of linear polyacenes and their ...

    Indian Academy of Sciences (India)

    Coefficients of characteristic polynomials (CP) of linear polyacenes (LP) have been shown to be obtainable from Pascal's triangle by using a graph factorisation and squaring technique. Strong subspectrality existing among the members of the linear polyacene series has been shown from the derivation of the CP's. Thus it ...

  19. Coherent states for polynomial su(2) algebra

    International Nuclear Information System (INIS)

    Sadiq, Muhammad; Inomata, Akira

    2007-01-01

    A class of generalized coherent states is constructed for a polynomial su(2) algebra in a group-free manner. As a special case, the coherent states for the cubic su(2) algebra are discussed. The states so constructed reduce to the usual SU(2) coherent states in the linear limit

  20. Automatic Control Systems Modeling by Volterra Polynomials

    Directory of Open Access Journals (Sweden)

    S. V. Solodusha

    2012-01-01

    Full Text Available The problem of the existence of the solutions of polynomial Volterra integral equations of the first kind of the second degree is considered. An algorithm of the numerical solution of one class of Volterra nonlinear systems of the first kind is developed. Numerical results for test examples are presented.

  1. Spectral properties of birth-death polynomials

    NARCIS (Netherlands)

    van Doorn, Erik A.

    2015-01-01

    We consider sequences of polynomials that are defined by a three-terms recurrence relation and orthogonal with respect to a positive measure on the nonnegative axis. By a famous result of Karlin and McGregor such sequences are instrumental in the analysis of birth-death processes. Inspired by

  2. Spectral properties of birth-death polynomials

    NARCIS (Netherlands)

    van Doorn, Erik A.

    We consider sequences of polynomials that are defined by a three-terms recurrence relation and orthogonal with respect to a positive measure on the nonnegative axis. By a famous result of Karlin and McGregor such sequences are instrumental in the analysis of birth-death processes. Inspired by

  3. transformation of independent variables in polynomial regression ...

    African Journals Online (AJOL)

    Ada

    preferable when possible to work with a simple functional form in transformed variables rather than with a more complicated form in the original variables. In this paper, it is shown that linear transformations applied to independent variables in polynomial regression models affect the t ratio and hence the statistical ...

  4. Inequalities for a Polynomial and its Derivative

    Indian Academy of Sciences (India)

    Annual Meetings · Mid Year Meetings · Discussion Meetings · Public Lectures · Lecture Workshops · Refresher Courses · Symposia · Live Streaming. Home; Journals; Proceedings – Mathematical Sciences; Volume 110; Issue 2. Inequalities for a Polynomial and its Derivative. V K Jain. Volume 110 Issue 2 May 2000 pp 137- ...

  5. Integral Inequalities for Self-Reciprocal Polynomials

    Indian Academy of Sciences (India)

    Annual Meetings · Mid Year Meetings · Discussion Meetings · Public Lectures · Lecture Workshops · Refresher Courses · Symposia · Live Streaming. Home; Journals; Proceedings – Mathematical Sciences; Volume 120; Issue 2. Integral Inequalities for Self-Reciprocal Polynomials. Horst Alzer. Volume 120 Issue 2 April 2010 ...

  6. The BQP-hardness of approximating the Jones polynomial

    Energy Technology Data Exchange (ETDEWEB)

    Aharonov, Dorit; Arad, Itai, E-mail: itaia@cs.huji.ac.il [Department of Computer Science and Engineering, Hebrew University, Jerusalem (Israel)

    2011-03-15

    A celebrated important result due to Freedman et al (2002 Commun. Math. Phys. 227 605-22) states that providing additive approximations of the Jones polynomial at the kth root of unity, for constant k=5 and k{>=}7, is BQP-hard. Together with the algorithmic results of Aharonov et al (2005) and Freedman et al (2002 Commun. Math. Phys. 227 587-603), this gives perhaps the most natural BQP-complete problem known today and motivates further study of the topic. In this paper, we focus on the universality proof; we extend the result of Freedman et al (2002) to ks that grow polynomially with the number of strands and crossings in the link, thus extending the BQP-hardness of Jones polynomial approximations to all values to which the AJL algorithm applies (Aharonov et al 2005), proving that for all those values, the problems are BQP-complete. As a side benefit, we derive a fairly elementary proof of the Freedman et al density result, without referring to advanced results from Lie algebra representation theory, making this important result accessible to a wider audience in the computer science research community. We make use of two general lemmas we prove, the bridge lemma and the decoupling lemma, which provide tools for establishing the density of subgroups in SU(n). Those tools seem to be of independent interest in more general contexts of proving the quantum universality. Our result also implies a completely classical statement, that the multiplicative approximations of the Jones polynomial, at exactly the same values, are P-hard, via a recent result due to Kuperberg (2009 arXiv:0908.0512). Since the first publication of those results in their preliminary form (Aharonov and Arad 2006 arXiv:quant-ph/0605181), the methods we present here have been used in several other contexts (Aharonov and Arad 2007 arXiv:quant-ph/0702008; Peter and Stephen 2008 Quantum Inf. Comput. 8 681). The present paper is an improved and extended version of the results presented by Aharonov and

  7. The BQP-hardness of approximating the Jones polynomial

    International Nuclear Information System (INIS)

    Aharonov, Dorit; Arad, Itai

    2011-01-01

    A celebrated important result due to Freedman et al (2002 Commun. Math. Phys. 227 605-22) states that providing additive approximations of the Jones polynomial at the kth root of unity, for constant k=5 and k≥7, is BQP-hard. Together with the algorithmic results of Aharonov et al (2005) and Freedman et al (2002 Commun. Math. Phys. 227 587-603), this gives perhaps the most natural BQP-complete problem known today and motivates further study of the topic. In this paper, we focus on the universality proof; we extend the result of Freedman et al (2002) to ks that grow polynomially with the number of strands and crossings in the link, thus extending the BQP-hardness of Jones polynomial approximations to all values to which the AJL algorithm applies (Aharonov et al 2005), proving that for all those values, the problems are BQP-complete. As a side benefit, we derive a fairly elementary proof of the Freedman et al density result, without referring to advanced results from Lie algebra representation theory, making this important result accessible to a wider audience in the computer science research community. We make use of two general lemmas we prove, the bridge lemma and the decoupling lemma, which provide tools for establishing the density of subgroups in SU(n). Those tools seem to be of independent interest in more general contexts of proving the quantum universality. Our result also implies a completely classical statement, that the multiplicative approximations of the Jones polynomial, at exactly the same values, are P-hard, via a recent result due to Kuperberg (2009 arXiv:0908.0512). Since the first publication of those results in their preliminary form (Aharonov and Arad 2006 arXiv:quant-ph/0605181), the methods we present here have been used in several other contexts (Aharonov and Arad 2007 arXiv:quant-ph/0702008; Peter and Stephen 2008 Quantum Inf. Comput. 8 681). The present paper is an improved and extended version of the results presented by Aharonov and Arad

  8. Commutators with idempotent values on multilinear polynomials in ...

    Indian Academy of Sciences (India)

    Introduction and statements of the result. In mid-forties, after the development of the general structure theory for rings, a great deal of work was done that showed that under certain types of hypothesis, rings had to be commutative or almost commutative. A classical result of ring theory established by Jacobson generalizes at ...

  9. Density of Real Zeros of the Tutte Polynomial

    DEFF Research Database (Denmark)

    Ok, Seongmin; Perrett, Thomas

    2018-01-01

    The Tutte polynomial of a graph is a two-variable polynomial whose zeros and evaluations encode many interesting properties of the graph. In this article we investigate the real zeros of the Tutte polynomials of graphs, and show that they form a dense subset of certain regions of the plane. This ....... This is the first density result for the real zeros of the Tutte polynomial in a region of positive volume. Our result almost confirms a conjecture of Jackson and Sokal except for one region which is related to an open problem on flow polynomials.......The Tutte polynomial of a graph is a two-variable polynomial whose zeros and evaluations encode many interesting properties of the graph. In this article we investigate the real zeros of the Tutte polynomials of graphs, and show that they form a dense subset of certain regions of the plane...

  10. Density of Real Zeros of the Tutte Polynomial

    DEFF Research Database (Denmark)

    Ok, Seongmin; Perrett, Thomas

    2017-01-01

    The Tutte polynomial of a graph is a two-variable polynomial whose zeros and evaluations encode many interesting properties of the graph. In this article we investigate the real zeros of the Tutte polynomials of graphs, and show that they form a dense subset of certain regions of the plane. This ....... This is the first density result for the real zeros of the Tutte polynomial in a region of positive volume. Our result almost confirms a conjecture of Jackson and Sokal except for one region which is related to an open problem on flow polynomials.......The Tutte polynomial of a graph is a two-variable polynomial whose zeros and evaluations encode many interesting properties of the graph. In this article we investigate the real zeros of the Tutte polynomials of graphs, and show that they form a dense subset of certain regions of the plane...

  11. Some Polynomials Associated with the r-Whitney Numbers

    Indian Academy of Sciences (India)

    26

    Abstract. In the present article we study three families of polynomials associated with ... [29, 39] for their relations with the Bernoulli and generalized Bernoulli polynomials and ... generating functions in a similar way as in the classical cases.

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

    Indian Academy of Sciences (India)

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

  13. 2-variable Laguerre matrix polynomials and Lie-algebraic techniques

    International Nuclear Information System (INIS)

    Khan, Subuhi; Hassan, Nader Ali Makboul

    2010-01-01

    The authors introduce 2-variable forms of Laguerre and modified Laguerre matrix polynomials and derive their special properties. Further, the representations of the special linear Lie algebra sl(2) and the harmonic oscillator Lie algebra G(0,1) are used to derive certain results involving these polynomials. Furthermore, the generating relations for the ordinary as well as matrix polynomials related to these matrix polynomials are derived as applications.

  14. Algebraic limit cycles in polynomial systems of differential equations

    International Nuclear Information System (INIS)

    Llibre, Jaume; Zhao Yulin

    2007-01-01

    Using elementary tools we construct cubic polynomial systems of differential equations with algebraic limit cycles of degrees 4, 5 and 6. We also construct a cubic polynomial system of differential equations having an algebraic homoclinic loop of degree 3. Moreover, we show that there are polynomial systems of differential equations of arbitrary degree that have algebraic limit cycles of degree 3, as well as give an example of a cubic polynomial system of differential equations with two algebraic limit cycles of degree 4

  15. The generalized Yablonskii-Vorob'ev polynomials and their properties

    International Nuclear Information System (INIS)

    Kudryashov, Nikolai A.; Demina, Maria V.

    2008-01-01

    Rational solutions of the generalized second Painleve hierarchy are classified. Representation of the rational solutions in terms of special polynomials, the generalized Yablonskii-Vorob'ev polynomials, is introduced. Differential-difference relations satisfied by the polynomials are found. Hierarchies of differential equations related to the generalized second Painleve hierarchy are derived. One of these hierarchies is a sequence of differential equations satisfied by the generalized Yablonskii-Vorob'ev polynomials

  16. Polynomial selection in number field sieve for integer factorization

    Directory of Open Access Journals (Sweden)

    Gireesh Pandey

    2016-09-01

    Full Text Available The general number field sieve (GNFS is the fastest algorithm for factoring large composite integers which is made up by two prime numbers. Polynomial selection is an important step of GNFS. The asymptotic runtime depends on choice of good polynomial pairs. In this paper, we present polynomial selection algorithm that will be modelled with size and root properties. The correlations between polynomial coefficient and number of relations have been explored with experimental findings.

  17. Contributions to fuzzy polynomial techniques for stability analysis and control

    OpenAIRE

    Pitarch Pérez, José Luis

    2014-01-01

    The present thesis employs fuzzy-polynomial control techniques in order to improve the stability analysis and control of nonlinear systems. Initially, it reviews the more extended techniques in the field of Takagi-Sugeno fuzzy systems, such as the more relevant results about polynomial and fuzzy polynomial systems. The basic framework uses fuzzy polynomial models by Taylor series and sum-of-squares techniques (semidefinite programming) in order to obtain stability guarantees...

  18. "Stuff From Back Home": Enda Walsh's The Walworth FarceDOI:10.5007/2175-8026.2010n58p333

    Directory of Open Access Journals (Sweden)

    Eamonn Jordan

    2010-01-01

    Full Text Available Since its first performance in 2006 by Druid Theatre Company, Enda Walsh's award-winning The Walworth Farce has toured Ireland, Britain, America, Canada, New Zealand and Australia to great acclaim, with the brilliance of the directing, design and acting engaging with the intelligence and theatricality of Walsh's script. The play deals with a family, who as part of a daily enforced ritual, re-enact a farce, written and directed by Dinny, the patriarch, a story which accounts for their exile in London, and away from their family home in Cork. Their enactment is an attempt to create a false memory, for their performance is very much at odds with the real events which provoked their exile.

  19. Constructing a two bands optical code-division multiple-access network of bipolar optical access codecs using Walsh-coded liquid crystal modulators

    Science.gov (United States)

    Yen, Chih-Ta; Huang, Jen-Fa; Chih, Ping-En

    2014-08-01

    We propose and experimentally demonstrated the two bands optical code-division multiple-access (OCDMA) network over bipolar Walsh-coded liquid-crystal modulators (LCMs) and driven by green light and red light lasers. Achieving system performance depends on the construction of a decoder that implements a true bipolar correlation using only unipolar signals and intensity detection for each band. We took advantage of the phase delay characteristics of LCMs to construct a prototype optical coder/decoder (codec). Matched and unmatched Walsh signature codes were evaluated to detect correlations among multiuser data in the access network. By using LCMs, a red and green laser light source was spectrally encoded and the summed light dots were complementary decoded. Favorable contrast on auto- and cross-correlations indicates that binary information symbols can be properly recovered using a balanced photodetector.

  20. Interlacing of zeros of quasi-orthogonal meixner polynomials | Driver ...

    African Journals Online (AJOL)

    ... interlacing of zeros of quasi-orthogonal Meixner polynomials Mn(x;β; c) with the zeros of their nearest orthogonal counterparts Mt(x;β + k; c), l; n ∈ ℕ, k ∈ {1; 2}; is also discussed. Mathematics Subject Classication (2010): 33C45, 42C05. Key words: Discrete orthogonal polynomials, quasi-orthogonal polynomials, Meixner

  1. Strong result for real zeros of random algebraic polynomials

    Directory of Open Access Journals (Sweden)

    T. Uno

    2001-01-01

    Full Text Available An estimate is given for the lower bound of real zeros of random algebraic polynomials whose coefficients are non-identically distributed dependent Gaussian random variables. Moreover, our estimated measure of the exceptional set, which is independent of the degree of the polynomials, tends to zero as the degree of the polynomial tends to infinity.

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

  3. A Determinant Expression for the Generalized Bessel Polynomials

    Directory of Open Access Journals (Sweden)

    Sheng-liang Yang

    2013-01-01

    Full Text Available 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.

  4. On the estimation of the degree of regression polynomial

    International Nuclear Information System (INIS)

    Toeroek, Cs.

    1997-01-01

    The mathematical functions most commonly used to model curvature in plots are polynomials. Generally, the higher the degree of the polynomial, the more complex is the trend that its graph can represent. We propose a new statistical-graphical approach based on the discrete projective transformation (DPT) to estimating the degree of polynomial that adequately describes the trend in the plot

  5. Uniqueness and zeros of q-shift difference polynomials

    Indian Academy of Sciences (India)

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

  6. Polynomially Riesz elements | Živković-Zlatanović | Quaestiones ...

    African Journals Online (AJOL)

    A Banach algebra element ɑ ∈ A is said to be "polynomially Riesz", relative to the homomorphism T : A → B, if there exists a nonzero complex polynomial p(z) such that the image Tp ∈ B is quasinilpotent. Keywords: Homomorphism of Banach algebras, polynomially Riesz element, Fredholm spectrum, Browder element, ...

  7. Multivariable biorthogonal continuous--discrete Wilson and Racah polynomials

    International Nuclear Information System (INIS)

    Tratnik, M.V.

    1990-01-01

    Several families of multivariable, biorthogonal, partly continuous and partly discrete, Wilson polynomials are presented. These yield limit cases that are purely continuous in some of the variables and purely discrete in the others, or purely discrete in all the variables. The latter are referred to as the multivariable biorthogonal Racah polynomials. Interesting further limit cases include the multivariable biorthogonal Hahn and dual Hahn polynomials

  8. Approximating Exponential and Logarithmic Functions Using Polynomial Interpolation

    Science.gov (United States)

    Gordon, Sheldon P.; Yang, Yajun

    2017-01-01

    This article takes a closer look at the problem of approximating the exponential and logarithmic functions using polynomials. Either as an alternative to or a precursor to Taylor polynomial approximations at the precalculus level, interpolating polynomials are considered. A measure of error is given and the behaviour of the error function is…

  9. Degenerate r-Stirling Numbers and r-Bell Polynomials

    Science.gov (United States)

    Kim, T.; Yao, Y.; Kim, D. S.; Jang, G.-W.

    2018-01-01

    The purpose of this paper is to exploit umbral calculus in order to derive some properties, recurrence relations, and identities related to the degenerate r-Stirling numbers of the second kind and the degenerate r-Bell polynomials. Especially, we will express the degenerate r-Bell polynomials as linear combinations of many well-known families of special polynomials.

  10. A new method for the coefficients of the characteristic polynomial

    International Nuclear Information System (INIS)

    Gonzalez, H.E.

    2006-01-01

    In linear algebra, one can associate an equation to each square matrix: its characteristic equation or secular equation. Starting from this equation, the one characteristic polynomial that codes several important properties of the matrix is obtained: its own values, it determinant and it appearance. The first method to calculate those coefficients of this polynomial were proposed by the french astronomer Urbain Jean Joseph Le Verrier (1811-1877), from then on, many methods have intended to calculate these coefficients. In this work the author proposes a new one method and a bibliographical citation is given where the calculations with others methods that know each other for it, taking like reference the matrix used by Le Verrier are explained. It was concluded that it here proposed, besides being the only mexican method that is knew, has the advantage of being very easy of understanding and of calculating well, in the operations that it carries out, it doesn't use the division and it avoids fractions in matrices whose entrances are whole. This has a great importance for their use in the classroom for their great didactic value and in nuclear reactors and Genetic Engineering. (Author)

  11. Equivalence between the Arquès-Walsh sequence formula and the number of connected Feynman diagrams for every perturbation order in the fermionic many-body problem

    Science.gov (United States)

    Castro, E.

    2018-02-01

    From the perturbative expansion of the exact Green function, an exact counting formula is derived to determine the number of different types of connected Feynman diagrams. This formula coincides with the Arquès-Walsh sequence formula in the rooted map theory, supporting the topological connection between Feynman diagrams and rooted maps. A classificatory summing-terms approach is used, in connection to discrete mathematical theory.

  12. 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 highresol......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...

  13. On factorization of generalized Macdonald polynomials

    International Nuclear Information System (INIS)

    Kononov, Ya.; Morozov, A.

    2016-01-01

    A remarkable feature of Schur functions - the common eigenfunctions of cut-and-join operators from W ∞ - is that they factorize at the peculiar two-parametric topological locus in the space of time variables, which is known as the hook formula for quantum dimensions of representations of U q (SL N ) and which 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 (GMPs), 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, which is already a very non-trivial property, calling for proof and better understanding. (orig.)

  14. Quantum Hurwitz numbers and Macdonald polynomials

    Science.gov (United States)

    Harnad, J.

    2016-11-01

    Parametric families in the center Z(C[Sn]) of the group algebra of the symmetric group are obtained by identifying the indeterminates in the generating function for Macdonald polynomials as commuting Jucys-Murphy elements. Their eigenvalues provide coefficients in the double Schur function expansion of 2D Toda τ-functions of hypergeometric type. Expressing these in the basis of products of power sum symmetric functions, the coefficients may be interpreted geometrically as parametric families of quantum Hurwitz numbers, enumerating weighted branched coverings of the Riemann sphere. Combinatorially, they give quantum weighted sums over paths in the Cayley graph of Sn generated by transpositions. Dual pairs of bases for the algebra of symmetric functions with respect to the scalar product in which the Macdonald polynomials are orthogonal provide both the geometrical and combinatorial significance of these quantum weighted enumerative invariants.

  15. Polynomial structures in one-loop amplitudes

    International Nuclear Information System (INIS)

    Britto, Ruth; Feng Bo; Yang Gang

    2008-01-01

    A general one-loop scattering amplitude may be expanded in terms of master integrals. The coefficients of the master integrals can be obtained from tree-level input in a two-step process. First, use known formulas to write the coefficients of (4-2ε)-dimensional master integrals; these formulas depend on an additional variable, u, which encodes the dimensional shift. Second, convert the u-dependent coefficients of (4-2ε)-dimensional master integrals to explicit coefficients of dimensionally shifted master integrals. This procedure requires the initial formulas for coefficients to have polynomial dependence on u. Here, we give a proof of this property in the case of massless propagators. The proof is constructive. Thus, as a byproduct, we produce different algebraic expressions for the scalar integral coefficients, in which the polynomial property is apparent. In these formulas, the box and pentagon contributions are separated explicitly.

  16. P A M Dirac meets M G Krein: matrix orthogonal polynomials and Dirac's equation

    International Nuclear Information System (INIS)

    Duran, Antonio J; Gruenbaum, F Alberto

    2006-01-01

    The solution of several instances of the Schroedinger equation (1926) is made possible by using the well-known orthogonal polynomials associated with the names of Hermite, Legendre and Laguerre. A relativistic alternative to this equation was proposed by Dirac (1928) involving differential operators with matrix coefficients. In 1949 Krein developed a theory of matrix-valued orthogonal polynomials without any reference to differential equations. In Duran A J (1997 Matrix inner product having a matrix symmetric second order differential operator Rocky Mt. J. Math. 27 585-600), one of us raised the question of determining instances of these matrix-valued polynomials going along with second order differential operators with matrix coefficients. In Duran A J and Gruenbaum F A (2004 Orthogonal matrix polynomials satisfying second order differential equations Int. Math. Res. Not. 10 461-84), we developed a method to produce such examples and observed that in certain cases there is a connection with the instance of Dirac's equation with a central potential. We observe that the case of the central Coulomb potential discussed in the physics literature in Darwin C G (1928 Proc. R. Soc. A 118 654), Nikiforov A F and Uvarov V B (1988 Special Functions of Mathematical Physics (Basle: Birkhauser) and Rose M E 1961 Relativistic Electron Theory (New York: Wiley)), and its solution, gives rise to a matrix weight function whose orthogonal polynomials solve a second order differential equation. To the best of our knowledge this is the first instance of a connection between the solution of the first order matrix equation of Dirac and the theory of matrix-valued orthogonal polynomials initiated by M G Krein

  17. Link polynomial, crossing multiplier and surgery formula

    International Nuclear Information System (INIS)

    Deguchi, Tetsuo; Yamada, Yasuhiko.

    1989-01-01

    Relations between link polynomials constructed from exactly solvable lattice models and topological field theory are reviewed. It is found that the surgery formula for a three-sphere S 3 with Wilson lines corresponds to the Markov trace constructed from the exactly solvable models. This indicates that knot theory intimately relates various important subjects such as exactly solvable models, conformal field theories and topological quantum field theories. (author)

  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. Polynomials and identities on real Banach spaces

    Czech Academy of Sciences Publication Activity Database

    Hájek, Petr Pavel; Kraus, M.

    2012-01-01

    Roč. 385, č. 2 (2012), s. 1015-1026 ISSN 0022-247X R&D Projects: GA ČR(CZ) GAP201/11/0345 Institutional research plan: CEZ:AV0Z10190503 Keywords : Polynomials on Banach spaces Subject RIV: BA - General Mathematics Impact factor: 1.050, year: 2012 http://www.sciencedirect.com/science/article/pii/S0022247X11006743

  20. Polynomial curve fitting for control rod worth using least square numerical analysis

    International Nuclear Information System (INIS)

    Muhammad Husamuddin Abdul Khalil; Mark Dennis Usang; Julia Abdul Karim; Mohd Amin Sharifuldin Salleh

    2012-01-01

    RTP must have sufficient excess reactivity to compensate the negative reactivity feedback effects such as those caused by the fuel temperature and power defects of reactivity, fuel burn-up and to allow full power operation for predetermined period of time. To compensate this excess reactivity, it is necessary to introduce an amount of negative reactivity by adjusting or controlling the control rods at will. Control rod worth depends largely upon the value of the neutron flux at the location of the rod and reflected by a polynomial curve. Purpose of this paper is to rule out the polynomial curve fitting using least square numerical techniques via MATLAB compatible language. (author)

  1. HOMFLYPT polynomial is the best quantifier for topological cascades of vortex knots

    Science.gov (United States)

    Ricca, Renzo L.; Liu, Xin

    2018-02-01

    In this paper we derive and compare numerical sequences obtained by adapted polynomials such as HOMFLYPT, Jones and Alexander-Conway for the topological cascade of vortex torus knots and links that progressively untie by a single reconnection event at a time. Two cases are considered: the alternate sequence of knots and co-oriented links (with positive crossings) and the sequence of two-component links with oppositely oriented components (negative crossings). New recurrence equations are derived and sequences of numerical values are computed. In all cases the adapted HOMFLYPT polynomial proves to be the best quantifier for the topological cascade of torus knots and links.

  2. Uniform approximations of Bernoulli and Euler polynomials in terms of hyperbolic functions

    NARCIS (Netherlands)

    J.L. López; N.M. Temme (Nico)

    1998-01-01

    textabstractBernoulli and Euler polynomials are considered for large values of the order. Convergent expansions are obtained for $B_n(nz+1/2)$ and $E_n(nz+1/2)$ in powers of $n^{-1$, with coefficients being rational functions of $z$ and hyperbolic functions of argument $1/2z$. These expansions are

  3. Assessment of ambulatory blood pressure monitoring: better reproducibility with polynomial analysis

    NARCIS (Netherlands)

    Cleophas, A. F.; Zwinderman, A. H.; Cleophas, T. J.

    2000-01-01

    Objective: Ambulatory blood pressure monitoring (ABPM) data using values of arbitrarily separated day- and nighttime hours are poorly reproducible, undermining the validity of this diagnostic tool. Previous studies from our group have demonstrated that polynomial curves can be produced of ABPM data

  4. M-Polynomials and Topological Indices of Dominating David Derived Networks

    Directory of Open Access Journals (Sweden)

    Kang Shin Min

    2018-03-01

    Full Text Available There is a strong relationship between the chemical characteristics of chemical compounds and their molecular structures. Topological indices are numerical values associated with the chemical molecular graphs that help to understand the physical features, chemical reactivity, and biological activity of chemical compound. Thus, the study of the topological indices is important. M-polynomial helps to recover many degree-based topological indices for example Zagreb indices, Randic index, symmetric division idex, inverse sum index etc. In this article we compute M-polynomials of dominating David derived networks of the first type, second type and third type of dimension n and find some topological properties by using these M-polynomials. The results are plotted using Maple to see the dependence of topological indices on the involved parameters.

  5. Predicting physical time series using dynamic ridge polynomial neural networks.

    Directory of Open Access Journals (Sweden)

    Dhiya Al-Jumeily

    Full Text Available Forecasting naturally occurring phenomena is a common problem in many domains of science, and this has been addressed and investigated by many scientists. The importance of time series prediction stems from the fact that it has wide range of applications, including control systems, engineering processes, environmental systems and economics. From the knowledge of some aspects of the previous behaviour of the system, the aim of the prediction process is to determine or predict its future behaviour. In this paper, we consider a novel application of a higher order polynomial neural network architecture called Dynamic Ridge Polynomial Neural Network that combines the properties of higher order and recurrent neural networks for the prediction of physical time series. In this study, four types of signals have been used, which are; The Lorenz attractor, mean value of the AE index, sunspot number, and heat wave temperature. The simulation results showed good improvements in terms of the signal to noise ratio in comparison to a number of higher order and feedforward neural networks in comparison to the benchmarked techniques.

  6. Novel Threshold Changeable Secret Sharing Schemes Based on Polynomial Interpolation.

    Science.gov (United States)

    Yuan, Lifeng; Li, Mingchu; Guo, Cheng; Choo, Kim-Kwang Raymond; Ren, Yizhi

    2016-01-01

    After any distribution of secret sharing shadows in a threshold changeable secret sharing scheme, the threshold may need to be adjusted to deal with changes in the security policy and adversary structure. For example, when employees leave the organization, it is not realistic to expect departing employees to ensure the security of their secret shadows. Therefore, in 2012, Zhang et al. proposed (t → t', n) and ({t1, t2,⋯, tN}, n) threshold changeable secret sharing schemes. However, their schemes suffer from a number of limitations such as strict limit on the threshold values, large storage space requirement for secret shadows, and significant computation for constructing and recovering polynomials. To address these limitations, we propose two improved dealer-free threshold changeable secret sharing schemes. In our schemes, we construct polynomials to update secret shadows, and use two-variable one-way function to resist collusion attacks and secure the information stored by the combiner. We then demonstrate our schemes can adjust the threshold safely.

  7. A Polynomial Subset-Based Efficient Multi-Party Key Management System for Lightweight Device Networks.

    Science.gov (United States)

    Mahmood, Zahid; Ning, Huansheng; Ghafoor, AtaUllah

    2017-03-24

    Wireless Sensor Networks (WSNs) consist of lightweight devices to measure sensitive data that are highly vulnerable to security attacks due to their constrained resources. In a similar manner, the internet-based lightweight devices used in the Internet of Things (IoT) are facing severe security and privacy issues because of the direct accessibility of devices due to their connection to the internet. Complex and resource-intensive security schemes are infeasible and reduce the network lifetime. In this regard, we have explored the polynomial distribution-based key establishment schemes and identified an issue that the resultant polynomial value is either storage intensive or infeasible when large values are multiplied. It becomes more costly when these polynomials are regenerated dynamically after each node join or leave operation and whenever key is refreshed. To reduce the computation, we have proposed an Efficient Key Management (EKM) scheme for multiparty communication-based scenarios. The proposed session key management protocol is established by applying a symmetric polynomial for group members, and the group head acts as a responsible node. The polynomial generation method uses security credentials and secure hash function. Symmetric cryptographic parameters are efficient in computation, communication, and the storage required. The security justification of the proposed scheme has been completed by using Rubin logic, which guarantees that the protocol attains mutual validation and session key agreement property strongly among the participating entities. Simulation scenarios are performed using NS 2.35 to validate the results for storage, communication, latency, energy, and polynomial calculation costs during authentication, session key generation, node migration, secure joining, and leaving phases. EKM is efficient regarding storage, computation, and communication overhead and can protect WSN-based IoT infrastructure.

  8. A solver for General Unilateral Polynomial Matrix Equation with Second-Order Matrices Over Prime Finite Fields

    Science.gov (United States)

    Burtyka, Filipp

    2018-03-01

    The paper firstly considers the problem of finding solvents for arbitrary unilateral polynomial matrix equations with second-order matrices over prime finite fields from the practical point of view: we implement the solver for this problem. The solver’s algorithm has two step: the first is finding solvents, having Jordan Normal Form (JNF), the second is finding solvents among the rest matrices. The first step reduces to the finding roots of usual polynomials over finite fields, the second is essentially exhaustive search. The first step’s algorithms essentially use the polynomial matrices theory. We estimate the practical duration of computations using our software implementation (for example that one can’t construct unilateral matrix polynomial over finite field, having any predefined number of solvents) and answer some theoretically-valued questions.

  9. Del semanario al libro: La escritura del Rosendo de Rodolfo Walsh como construcción del vandorismo en la Argentina del peronismo fracturado From the weekly to the book: The writing of Rodolfo Walsh's Rosendo as the construction of the vandorismo in the Argentina of broken Peronism

    Directory of Open Access Journals (Sweden)

    Darío Dawyd

    2012-06-01

    Full Text Available En el presente artículo se reconstruye la investigación que Rodolfo Walsh realizó sobre el enfrentamiento que costó la vida de Rosendo García, Domingo Blajaquis y Juan Zalazar y que publicó en siete notas en el semanario CGT entre el 16 de mayo y el 27 de junio de 1968. Aquellas notas son contrastadas con su publicación posterior en formato de libro como ¿Quien mató a Rosendo? en mayo de 1969 y se busca destacar las diferencias entre ambos formatos y contextos. Estas diferencias permiten relevar el contexto político acelerado en que se produjeron y la gran distancia entre un momento y otro a pesar de que transcurrió solo un año entre ambos. Con ello se pretende revisitar una de las investigaciones menos abordadas de Walsh y ponerla en contexto al interior de una etapa político-sindical poco estudiada, especialmente los significados de la división de la CGT y el peronismo, en tanto Walsh había retomado su militancia política y estrechado sus primeros vínculos con una de las fracciones del peronismo en disputa.In the present article we reconstructed Rodolfo Walsh's research about the death of Rosendo García, Domingo Blajaquis and Juan Zalazar that he published in seven notes in the weekly CGT between May and June in 1968. Those notes are compare with his later publication of the research as a the book ¿Quien mató a Rosendo? in May, 1969. We try to emphasize the differences between both formats and contexts because those differences allow as to relieve the critical political context in which they took place. The article underline of the worst approached investigations of Walsh and put it in its context of the meanings of the division of the CGT and the Peronism, considering that Walsh had taken again his political militancy and had make his first links with one of the fractions of the Peronism in dispute.

  10. A Polynomial Estimate of Railway Line Delay

    DEFF Research Database (Denmark)

    Cerreto, Fabrizio; Harrod, Steven; Nielsen, Otto Anker

    2017-01-01

    Railway service may be measured by the aggregate delay over a time horizon or due to an event. Timetables for railway service may dampen aggregate delay by addition of additional process time, either supplement time or buffer time. The evaluation of these variables has previously been performed...... by numerical analysis with simulation. This paper proposes an analytical estimate of aggregate delay with a polynomial form. The function returns the aggregate delay of a railway line resulting from an initial, primary, delay. Analysis of the function demonstrates that there should be a balance between the two...

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

  12. Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs

    KAUST Repository

    Chkifa, Abdellah

    2015-04-08

    Motivated by the numerical treatment of parametric and stochastic PDEs, we analyze the least-squares method for polynomial approximation of multivariate functions based on random sampling according to a given probability measure. Recent work has shown that in the univariate case, the least-squares method is quasi-optimal in expectation in [A. Cohen, M A. Davenport and D. Leviatan. Found. Comput. Math. 13 (2013) 819–834] and in probability in [G. Migliorati, F. Nobile, E. von Schwerin, R. Tempone, Found. Comput. Math. 14 (2014) 419–456], under suitable conditions that relate the number of samples with respect to the dimension of the polynomial space. Here “quasi-optimal” means that the accuracy of the least-squares approximation is comparable with that of the best approximation in the given polynomial space. In this paper, we discuss the quasi-optimality of the polynomial least-squares method in arbitrary dimension. Our analysis applies to any arbitrary multivariate polynomial space (including tensor product, total degree or hyperbolic crosses), under the minimal requirement that its associated index set is downward closed. The optimality criterion only involves the relation between the number of samples and the dimension of the polynomial space, independently of the anisotropic shape and of the number of variables. We extend our results to the approximation of Hilbert space-valued functions in order to apply them to the approximation of parametric and stochastic elliptic PDEs. As a particular case, we discuss “inclusion type” elliptic PDE models, and derive an exponential convergence estimate for the least-squares method. Numerical results confirm our estimate, yet pointing out a gap between the condition necessary to achieve optimality in the theory, and the condition that in practice yields the optimal convergence rate.

  13. Hermite Polynomials and the Inverse Problem for Collisionless Equilibria

    Science.gov (United States)

    Allanson, O.; Neukirch, T.; Troscheit, S.; Wilson, F.

    2017-12-01

    It is long established that Hermite polynomial expansions in either velocity or momentum space can elegantly encode the non-Maxwellian velocity-space structure of a collisionless plasma distribution function (DF). In particular, Hermite polynomials in the canonical momenta naturally arise in the consideration of the 'inverse problem in collisionless equilibria' (IPCE): "for a given macroscopic/fluid equilibrium, what are the self-consistent Vlasov-Maxwell equilibrium DFs?". This question is of particular interest for the equilibrium and stability properties of a given macroscopic configuration, e.g. a current sheet. It can be relatively straightforward to construct a formal solution to IPCE by a Hermite expansion method, but several important questions remain regarding the use of this method. We present recent work that considers the necessary conditions of non-negativity, convergence, and the existence of all moments of an equilibrium DF solution found for IPCE. We also establish meaningful analogies between the equations that link the microscopic and macrosopic descriptions of the Vlasov-Maxwell equilibrium, and those that solve the initial value problem for the heat equation. In the language of the heat equation, IPCE poses the pressure tensor as the 'present' heat distribution over an infinite domain, and the non-Maxwellian features of the DF as the 'past' distribution. We find sufficient conditions for the convergence of the Hermite series representation of the DF, and prove that the non-negativity of the DF can be dependent on the magnetisation of the plasma. For DFs that decay at least as quickly as exp(-v^2/4), we show non-negativity is guaranteed for at least a finite range of magnetisation values, as parameterised by the ratio of the Larmor radius to the gradient length scale. 1. O. Allanson, T. Neukirch, S. Troscheit & F. Wilson: From one-dimensional fields to Vlasov equilibria: theory and application of Hermite polynomials, Journal of Plasma Physics, 82

  14. Parallel multigrid smoothing: polynomial versus Gauss-Seidel

    International Nuclear Information System (INIS)

    Adams, Mark; Brezina, Marian; Hu, Jonathan; Tuminaro, Ray

    2003-01-01

    Gauss-Seidel is often the smoother of choice within multigrid applications. In the context of unstructured meshes, however, maintaining good parallel efficiency is difficult with multiplicative iterative methods such as Gauss-Seidel. This leads us to consider alternative smoothers. We discuss the computational advantages of polynomial smoothers within parallel multigrid algorithms for positive definite symmetric systems. Two particular polynomials are considered: Chebyshev and a multilevel specific polynomial. The advantages of polynomial smoothing over traditional smoothers such as Gauss-Seidel are illustrated on several applications: Poisson's equation, thin-body elasticity, and eddy current approximations to Maxwell's equations. While parallelizing the Gauss-Seidel method typically involves a compromise between a scalable convergence rate and maintaining high flop rates, polynomial smoothers achieve parallel scalable multigrid convergence rates without sacrificing flop rates. We show that, although parallel computers are the main motivation, polynomial smoothers are often surprisingly competitive with Gauss-Seidel smoothers on serial machines

  15. Parallel multigrid smoothing: polynomial versus Gauss-Seidel

    Science.gov (United States)

    Adams, Mark; Brezina, Marian; Hu, Jonathan; Tuminaro, Ray

    2003-07-01

    Gauss-Seidel is often the smoother of choice within multigrid applications. In the context of unstructured meshes, however, maintaining good parallel efficiency is difficult with multiplicative iterative methods such as Gauss-Seidel. This leads us to consider alternative smoothers. We discuss the computational advantages of polynomial smoothers within parallel multigrid algorithms for positive definite symmetric systems. Two particular polynomials are considered: Chebyshev and a multilevel specific polynomial. The advantages of polynomial smoothing over traditional smoothers such as Gauss-Seidel are illustrated on several applications: Poisson's equation, thin-body elasticity, and eddy current approximations to Maxwell's equations. While parallelizing the Gauss-Seidel method typically involves a compromise between a scalable convergence rate and maintaining high flop rates, polynomial smoothers achieve parallel scalable multigrid convergence rates without sacrificing flop rates. We show that, although parallel computers are the main motivation, polynomial smoothers are often surprisingly competitive with Gauss-Seidel smoothers on serial machines.

  16. Linear operator pencils on Lie algebras and Laurent biorthogonal polynomials

    International Nuclear Information System (INIS)

    Gruenbaum, F A; Vinet, Luc; Zhedanov, Alexei

    2004-01-01

    We study operator pencils on generators of the Lie algebras sl 2 and the oscillator algebra. These pencils are linear in a spectral parameter λ. The corresponding generalized eigenvalue problem gives rise to some sets of orthogonal polynomials and Laurent biorthogonal polynomials (LBP) expressed in terms of the Gauss 2 F 1 and degenerate 1 F 1 hypergeometric functions. For special choices of the parameters of the pencils, we identify the resulting polynomials with the Hendriksen-van Rossum LBP which are widely believed to be the biorthogonal analogues of the classical orthogonal polynomials. This places these examples under the umbrella of the generalized bispectral problem which is considered here. Other (non-bispectral) cases give rise to some 'nonclassical' orthogonal polynomials including Tricomi-Carlitz and random-walk polynomials. An application to solutions of relativistic Toda chain is considered

  17. Polynomial parameterized representation of macroscopic cross section for PWR reactor

    International Nuclear Information System (INIS)

    Fiel, Joao Claudio B.

    2015-01-01

    The purpose of this work is to describe, by means of Tchebychev polynomial, a parameterized representation of the homogenized macroscopic cross section for PWR fuel element as a function of soluble boron concentration, moderator temperature, fuel temperature, moderator density and 235 U 92 enrichment. Analyzed cross sections are: fission, scattering, total, transport, absorption and capture. This parameterization enables a quick and easy determination of the problem-dependent cross-sections to be used in few groups calculations. The methodology presented here will enable to provide cross-sections values to perform PWR core calculations without the need to generate them based on computer code calculations using standard steps. The results obtained by parameterized cross-sections functions, when compared with the cross-section generated by SCALE code calculations, or when compared with K inf , generated by MCNPX code calculations, show a difference of less than 0.7 percent. (author)

  18. Polynomial invariants for torus knots and topological strings

    International Nuclear Information System (INIS)

    Labastida, J.M.F.

    2001-01-01

    We make a precision test of a recently proposed conjecture relating Chern-Simons gauge theory to topological string theory on the resolution of the conifold. First, we develop a systematic procedure to extract string amplitudes from vacuum expectation values (vevs) of Wilson loops in Chern-Simons gauge theory, and then we evaluate these vevs in arbitrary irreducible representations of SU(N) for torus knots. We find complete agreement with the predictions derived from the target space interpretation of the string amplitudes. We also show that the structure of the free energy of topological open string theory gives further constraints on the Chern-Simons vevs. Our work provides strong evidence towards an interpretation of knot polynomial invariants as generating functions associated to enumerative problems. (orig.)

  19. Need for higher order polynomial basis for polynomial nodal methods employed in LWR calculations

    International Nuclear Information System (INIS)

    Taiwo, T.A.; Palmiotti, G.

    1997-01-01

    The paper evaluates the accuracy and efficiency of sixth order polynomial solutions and the use of one radial node per core assembly for pressurized water reactor (PWR) core power distributions and reactivities. The computer code VARIANT was modified to calculate sixth order polynomial solutions for a hot zero power benchmark problem in which a control assembly along a core axis is assumed to be out of the core. Results are presented for the VARIANT, DIF3D-NODAL, and DIF3D-finite difference codes. The VARIANT results indicate that second order expansion of the within-node source and linear representation of the node surface currents are adequate for this problem. The results also demonstrate the improvement in the VARIANT solution when the order of the polynomial expansion of the within-node flux is increased from fourth to sixth order. There is a substantial saving in computational time for using one radial node per assembly with the sixth order expansion compared to using four or more nodes per assembly and fourth order polynomial solutions. 11 refs., 1 tab

  20. 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 - others: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

  1. Multiple Meixner polynomials and non-Hermitian oscillator Hamiltonians

    OpenAIRE

    Ndayiragije, François; Van Assche, Walter

    2013-01-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. Followi...

  2. On Roots of Polynomials and Algebraically Closed Fields

    Directory of Open Access Journals (Sweden)

    Schwarzweller Christoph

    2017-10-01

    Full Text Available In this article we further extend the algebraic theory of polynomial rings in Mizar [1, 2, 3]. We deal with roots and multiple roots of polynomials and show that both the real numbers and finite domains are not algebraically closed [5, 7]. We also prove the identity theorem for polynomials and that the number of multiple roots is bounded by the polynomial’s degree [4, 6].

  3. Open Problems Related to the Hurwitz Stability of Polynomials Segments

    Directory of Open Access Journals (Sweden)

    Baltazar Aguirre-Hernández

    2018-01-01

    Full Text Available In the framework of robust stability analysis of linear systems, the development of techniques and methods that help to obtain necessary and sufficient conditions to determine stability of convex combinations of polynomials is paramount. In this paper, knowing that Hurwitz polynomials set is not a convex set, a brief overview of some results and open problems concerning the stability of the convex combinations of Hurwitz polynomials is then provided.

  4. General quantum polynomials: irreducible modules and Morita equivalence

    International Nuclear Information System (INIS)

    Artamonov, V A

    1999-01-01

    In this paper we continue the investigation of the structure of finitely generated modules over rings of general quantum (Laurent) polynomials. We obtain a description of the lattice of submodules of periodic finitely generated modules and describe the irreducible modules. We investigate the problem of Morita equivalence of rings of general quantum polynomials, consider properties of division rings of fractions, and solve Zariski's problem for quantum polynomials

  5. Applications of polynomial optimization in financial risk investment

    Science.gov (United States)

    Zeng, Meilan; Fu, Hongwei

    2017-09-01

    Recently, polynomial optimization has many important applications in optimization, financial economics and eigenvalues of tensor, etc. This paper studies the applications of polynomial optimization in financial risk investment. We consider the standard mean-variance risk measurement model and the mean-variance risk measurement model with transaction costs. We use Lasserre's hierarchy of semidefinite programming (SDP) relaxations to solve the specific cases. The results show that polynomial optimization is effective for some financial optimization problems.

  6. Root and Critical Point Behaviors of Certain Sums of Polynomials

    Indian Academy of Sciences (India)

    13

    There is an extensive literature concerning roots of sums of polynomials. Many papers and books([5], [6],. [7]) have written about these polynomials. Perhaps the most immediate question of sums of polynomials,. A + B = C, is “given bounds for the roots of A and B, what bounds can be given for the roots of C?” By. Fell [3], if ...

  7. Topological classification of trigonometric polynomials related to affine Coxeter group A-tilde2

    International Nuclear Information System (INIS)

    Arnold, V.I.

    2006-06-01

    The family of trigonometric polynomials, is defined by the six?Cparametrical expression f(x, y) = a cos x + b sin x + c cos y + d sin y + p cos(x + y) + q sin(x + y). The trigonometric polynomials of this family, having the most complicated topological structure, have 6 critical points. These functions are classified up to the actions of the following groups: two functions are called to be topologically equivalent, if one is transformed to the other by two smooth diffeomorphisms of the manifolds T 2 and R (of the preimages and of the images of mapping f : T 2 → R). We suppose, that the images diffeomorphisms (dependent variable changes) preserve the orientation of the real line, and that the preimages spaces diffeomorphism is homotopic to the identity mapping of the torus. We shall see, that the trigonometric polynomials which have 6 nondegenerated critical points and six different critical values (that might be fixed at points {1, 2, 3, 4, 5, 6 }) form 6 equivalence classes of topologically different functions, while the general Morse functions on the torus, having six critical points and six fixed critical values, form an infinite set of the equivalence classes of functions. With respect to the Diff-equivalence all these functions form only 16 classes. All these unexpected results suggest, that in the 16 Cth Hilbert's problem (on the topological classification of real algebraic manifolds) one would ask to classify topologically rather the defining polynomials, than the real hypersurfaces of their zeros

  8. Quadratic polynomial interpolation on triangular domain

    Science.gov (United States)

    Li, Ying; Zhang, Congcong; Yu, Qian

    2018-04-01

    In the simulation of natural terrain, the continuity of sample points are not in consonance with each other always, traditional interpolation methods often can't faithfully reflect the shape information which lie in data points. So, a new method for constructing the polynomial interpolation surface on triangular domain is proposed. Firstly, projected the spatial scattered data points onto a plane and then triangulated them; Secondly, A C1 continuous piecewise quadric polynomial patch was constructed on each vertex, all patches were required to be closed to the line-interpolation one as far as possible. Lastly, the unknown quantities were gotten by minimizing the object functions, and the boundary points were treated specially. The result surfaces preserve as many properties of data points as possible under conditions of satisfying certain accuracy and continuity requirements, not too convex meantime. New method is simple to compute and has a good local property, applicable to shape fitting of mines and exploratory wells and so on. The result of new surface is given in experiments.

  9. On factorization of generalized Macdonald polynomials

    Energy Technology Data Exchange (ETDEWEB)

    Kononov, Ya. [Landau Institute for Theoretical Physics, Chernogolovka (Russian Federation); HSE, Math Department, Moscow (Russian Federation); Morozov, A. [ITEP, Moscow (Russian Federation); Institute for Information Transmission Problems, Moscow (Russian Federation); National Research Nuclear University MEPhI, Moscow (Russian Federation)

    2016-08-15

    A remarkable feature of Schur functions - the common eigenfunctions of cut-and-join operators from W{sub ∞} - is that they factorize at the peculiar two-parametric topological locus in the space of time variables, which is known as the hook formula for quantum dimensions of representations of U{sub q}(SL{sub N}) and which 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 (GMPs), 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, which is already a very non-trivial property, calling for proof and better understanding. (orig.)

  10. Positive trigonometric polynomials and signal processing applications

    CERN Document Server

    Dumitrescu, Bogdan

    2017-01-01

    This revised edition is made up of two parts: theory and applications. Though many of the fundamental results are still valid and used, new and revised material is woven throughout the text. As with the original book, the theory of sum-of-squares trigonometric polynomials is presented unitarily based on the concept of Gram matrix (extended to Gram pair or Gram set). The programming environment has also evolved, and the books examples are changed accordingly. The applications section is organized as a collection of related problems that use systematically the theoretical results. All the problems are brought to a semi-definite programming form, ready to be solved with algorithms freely available, like those from the libraries SeDuMi, CVX and Pos3Poly. A new chapter discusses applications in super-resolution theory, where Bounded Real Lemma for trigonometric polynomials is an important tool. This revision is written to be more appealing and easier to use for new readers. < Features updated information on LMI...

  11. On factorization of generalized Macdonald polynomials

    Science.gov (United States)

    Kononov, Ya.; Morozov, A.

    2016-08-01

    A remarkable feature of Schur functions—the common eigenfunctions of cut-and-join operators from W_∞ —is that they factorize at the peculiar two-parametric topological locus in the space of time variables, which is known as the hook formula for quantum dimensions of representations of U_q(SL_N) and which 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 (GMPs), 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, which is already a very non-trivial property, calling for proof and better understanding.

  12. From sequences to polynomials and back, via operator orderings

    Energy Technology Data Exchange (ETDEWEB)

    Amdeberhan, Tewodros, E-mail: tamdeber@tulane.edu; Dixit, Atul, E-mail: adixit@tulane.edu; Moll, Victor H., E-mail: vhm@tulane.edu [Department of Mathematics, Tulane University, New Orleans, Louisiana 70118 (United States); De Angelis, Valerio, E-mail: vdeangel@xula.edu [Department of Mathematics, Xavier University of Louisiana, New Orleans, Louisiana 70125 (United States); Vignat, Christophe, E-mail: vignat@tulane.edu [Department of Mathematics, Tulane University, New Orleans, Louisiana 70118, USA and L.S.S. Supelec, Universite d' Orsay (France)

    2013-12-15

    Bender and Dunne [“Polynomials and operator orderings,” J. Math. Phys. 29, 1727–1731 (1988)] showed that linear combinations of words q{sup k}p{sup n}q{sup n−k}, where p and q are subject to the relation qp − pq = ı, may be expressed as a polynomial in the symbol z=1/2 (qp+pq). Relations between such polynomials and linear combinations of the transformed coefficients are explored. In particular, examples yielding orthogonal polynomials are provided.

  13. On Multiple Interpolation Functions of the -Genocchi Polynomials

    Directory of Open Access Journals (Sweden)

    Jin Jeong-Hee

    2010-01-01

    Full Text Available Abstract Recently, many mathematicians have studied various kinds of the -analogue of Genocchi numbers and polynomials. In the work (New approach to q-Euler, Genocchi numbers and their interpolation functions, "Advanced Studies in Contemporary Mathematics, vol. 18, no. 2, pp. 105–112, 2009.", Kim defined new generating functions of -Genocchi, -Euler polynomials, and their interpolation functions. In this paper, we give another definition of the multiple Hurwitz type -zeta function. This function interpolates -Genocchi polynomials at negative integers. Finally, we also give some identities related to these polynomials.

  14. Generalized Pseudospectral Method and Zeros of Orthogonal Polynomials

    Directory of Open Access Journals (Sweden)

    Oksana Bihun

    2018-01-01

    Full Text Available Via a generalization of the pseudospectral method for numerical solution of differential equations, a family of nonlinear algebraic identities satisfied by the zeros of a wide class of orthogonal polynomials is derived. The generalization is based on a modification of pseudospectral matrix representations of linear differential operators proposed in the paper, which allows these representations to depend on two, rather than one, sets of interpolation nodes. The identities hold for every polynomial family pνxν=0∞ orthogonal with respect to a measure supported on the real line that satisfies some standard assumptions, as long as the polynomials in the family satisfy differential equations Apν(x=qν(xpν(x, where A is a linear differential operator and each qν(x is a polynomial of degree at most n0∈N; n0 does not depend on ν. The proposed identities generalize known identities for classical and Krall orthogonal polynomials, to the case of the nonclassical orthogonal polynomials that belong to the class described above. The generalized pseudospectral representations of the differential operator A for the case of the Sonin-Markov orthogonal polynomials, also known as generalized Hermite polynomials, are presented. The general result is illustrated by new algebraic relations satisfied by the zeros of the Sonin-Markov polynomials.

  15. Relations between zeros of special polynomials associated with the Painleve equations

    International Nuclear Information System (INIS)

    Kudryashov, Nikolai A.; Demina, Maria V.

    2007-01-01

    A method for finding relations of roots of polynomials is presented. Our approach allows us to get a number of relations between the zeros of the classical polynomials as well as the roots of special polynomials associated with rational solutions of the Painleve equations. We apply the method to obtain the relations for the zeros of several polynomials. These are: the Hermite polynomials, the Laguerre polynomials, the Yablonskii-Vorob'ev polynomials, the generalized Okamoto polynomials, and the generalized Hermite polynomials. All the relations found can be considered as analogues of generalized Stieltjes relations

  16. Geometry of polynomials and root-finding via path-lifting

    Science.gov (United States)

    Kim, Myong-Hi; Martens, Marco; Sutherland, Scott

    2018-02-01

    Using the interplay between topological, combinatorial, and geometric properties of polynomials and analytic results (primarily the covering structure and distortion estimates), we analyze a path-lifting method for finding approximate zeros, similar to those studied by Smale, Shub, Kim, and others. Given any polynomial, this simple algorithm always converges to a root, except on a finite set of initial points lying on a circle of a given radius. Specifically, the algorithm we analyze consists of iterating where the t k form a decreasing sequence of real numbers and z 0 is chosen on a circle containing all the roots. We show that the number of iterates required to locate an approximate zero of a polynomial f depends only on log\\vert f(z_0)/ρ_\\zeta\\vert (where ρ_\\zeta is the radius of convergence of the branch of f-1 taking 0 to a root ζ) and the logarithm of the angle between f(z_0) and certain critical values. Previous complexity results for related algorithms depend linearly on the reciprocals of these angles. Note that the complexity of the algorithm does not depend directly on the degree of f, but only on the geometry of the critical values. Furthermore, for any polynomial f with distinct roots, the average number of steps required over all starting points taken on a circle containing all the roots is bounded by a constant times the average of log(1/ρ_\\zeta) . The average of log(1/ρ_\\zeta) over all polynomials f with d roots in the unit disk is \

  17. Current advances on polynomial resultant formulations

    Science.gov (United States)

    Sulaiman, Surajo; Aris, Nor'aini; Ahmad, Shamsatun Nahar

    2017-08-01

    Availability of computer algebra systems (CAS) lead to the resurrection of the resultant method for eliminating one or more variables from the polynomials system. The resultant matrix method has advantages over the Groebner basis and Ritt-Wu method due to their high complexity and storage requirement. This paper focuses on the current resultant matrix formulations and investigates their ability or otherwise towards producing optimal resultant matrices. A determinantal formula that gives exact resultant or a formulation that can minimize the presence of extraneous factors in the resultant formulation is often sought for when certain conditions that it exists can be determined. We present some applications of elimination theory via resultant formulations and examples are given to explain each of the presented settings.

  18. Connection coefficients between Boas-Buck polynomial sets

    Science.gov (United States)

    Cheikh, Y. Ben; Chaggara, H.

    2006-07-01

    In this paper, a general method to express explicitly connection coefficients between two Boas-Buck polynomial sets is presented. As application, we consider some generalized hypergeometric polynomials, from which we derive some well-known results including duplication and inversion formulas.

  19. Mathematical Use Of Polynomials Of Different End Periods Of ...

    African Journals Online (AJOL)

    This paper focused on how polynomials of different end period of random numbers can be used in the application of encryption and decryption of a message. Eight steps were used in generating information on how polynomials of different end periods of random numbers in the application of encryption and decryption of a ...

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

  1. Exponential time paradigms through the polynomial time lens

    NARCIS (Netherlands)

    Drucker, A.; Nederlof, J.; Santhanam, R.; Sankowski, P.; Zaroliagis, C.

    2016-01-01

    We propose a general approach to modelling algorithmic paradigms for the exact solution of NP-hard problems. Our approach is based on polynomial time reductions to succinct versions of problems solvable in polynomial time. We use this viewpoint to explore and compare the power of paradigms such as

  2. On polynomial selection for the general number field sieve

    Science.gov (United States)

    Kleinjung, Thorsten

    2006-12-01

    The general number field sieve (GNFS) is the asymptotically fastest algorithm for factoring large integers. Its runtime depends on a good choice of a polynomial pair. In this article we present an improvement of the polynomial selection method of Montgomery and Murphy which has been used in recent GNFS records.

  3. 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…

  4. Some Results on the Independence Polynomial of Unicyclic Graphs

    Directory of Open Access Journals (Sweden)

    Oboudi Mohammad Reza

    2018-05-01

    Full Text Available Let G be a simple graph on n vertices. An independent set in a graph is a set of pairwise non-adjacent vertices. The independence polynomial of G is the polynomial I(G,x=∑k=0ns(G,kxk$I(G,x = \\sum\

  5. Generalized Freud's equation and level densities with polynomial

    Indian Academy of Sciences (India)

    Home; Journals; Pramana – Journal of Physics; Volume 81; Issue 2. Generalized Freud's equation and level densities with polynomial potential. Akshat Boobna Saugata Ghosh. Research Articles Volume 81 ... Keywords. Orthogonal polynomial; Freud's equation; Dyson–Mehta method; methods of resolvents; level density.

  6. Generalized localization for the double trigonometric Fourier series and the Walsh-Fourier series of functions in L log +L log + log +L

    International Nuclear Information System (INIS)

    Bloshanskaya, S K; Bloshanskii, I L; Roslova, T Y

    1998-01-01

    For an arbitrary open set Ω subset of I 2 =[0,1) 2 and an arbitrary function f element of L log + L log + log + L(I 2 ) such that f=0 on Ω the double Fourier series of f with respect to the trigonometric system Ψ=E and the Walsh-Paley system Ψ=W is shown to converge to zero (over rectangles) almost everywhere on Ω. Thus, it is proved that generalized localization almost everywhere holds on arbitrary open subsets of the square I 2 for the double trigonometric Fourier series and the Walsh-Fourier series of functions in the class L log + L log + log + L (in the case of summation over rectangles). It is also established that such localization breaks down on arbitrary sets that are not dense in I 2 , in the classes Φ Ψ (L)(I 2 ) for the orthonormal system Ψ=E and an arbitrary function such that Φ E (u)=o(u log + log + u) as u→∞ or for Φ W (u)=u( log + log + u) 1-ε , 0<ε<1

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

  8. Describing Quadratic Cremer Point Polynomials by Parabolic Perturbations

    DEFF Research Database (Denmark)

    Sørensen, Dan Erik Krarup

    1996-01-01

    We describe two infinite order parabolic perturbation proceduresyielding quadratic polynomials having a Cremer fixed point. The main ideais to obtain the polynomial as the limit of repeated parabolic perturbations.The basic tool at each step is to control the behaviour of certain externalrays.......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...

  9. Primitive polynomials selection method for pseudo-random number generator

    Science.gov (United States)

    Anikin, I. V.; Alnajjar, Kh

    2018-01-01

    In this paper we suggested the method for primitive polynomials selection of special type. This kind of polynomials can be efficiently used as a characteristic polynomials for linear feedback shift registers in pseudo-random number generators. The proposed method consists of two basic steps: finding minimum-cost irreducible polynomials of the desired degree and applying primitivity tests to get the primitive ones. Finally two primitive polynomials, which was found by the proposed method, used in pseudorandom number generator based on fuzzy logic (FRNG) which had been suggested before by the authors. The sequences generated by new version of FRNG have low correlation magnitude, high linear complexity, less power consumption, is more balanced and have better statistical properties.

  10. Orthogonal polynomials derived from the tridiagonal representation approach

    Science.gov (United States)

    Alhaidari, A. D.

    2018-01-01

    The tridiagonal representation approach is an algebraic method for solving second order differential wave equations. Using this approach in the solution of quantum mechanical problems, we encounter two new classes of orthogonal polynomials whose properties give the structure and dynamics of the corresponding physical system. For a certain range of parameters, one of these polynomials has a mix of continuous and discrete spectra making it suitable for describing physical systems with both scattering and bound states. In this work, we define these polynomials by their recursion relations and highlight some of their properties using numerical means. Due to the prime significance of these polynomials in physics, we hope that our short expose will encourage experts in the field of orthogonal polynomials to study them and derive their properties (weight functions, generating functions, asymptotics, orthogonality relations, zeros, etc.) analytically.

  11. Multiple Meixner polynomials and non-Hermitian oscillator Hamiltonians

    International Nuclear Information System (INIS)

    Ndayiragije, F; Van Assche, W

    2013-01-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. (paper)

  12. Polynomial fuzzy model-based approach for underactuated surface vessels

    DEFF Research Database (Denmark)

    Khooban, Mohammad Hassan; Vafamand, Navid; Dragicevic, Tomislav

    2018-01-01

    The main goal of this study is to introduce a new polynomial fuzzy model-based structure for a class of marine systems with non-linear and polynomial dynamics. The suggested technique relies on a polynomial Takagi–Sugeno (T–S) fuzzy modelling, a polynomial dynamic parallel distributed compensation...... surface vessel (USV). Additionally, in order to overcome the USV control challenges, including the USV un-modelled dynamics, complex nonlinear dynamics, external disturbances and parameter uncertainties, the polynomial fuzzy model representation is adopted. Moreover, the USV-based control structure...... and a sum-of-squares (SOS) decomposition. The new proposed approach is a generalisation of the standard T–S fuzzy models and linear matrix inequality which indicated its effectiveness in decreasing the tracking time and increasing the efficiency of the robust tracking control problem for an underactuated...

  13. A note on some identities of derangement polynomials.

    Science.gov (United States)

    Kim, Taekyun; Kim, Dae San; Jang, Gwan-Woo; Kwon, Jongkyum

    2018-01-01

    The problem of counting derangements was initiated by Pierre Rémond de Montmort in 1708 (see Carlitz in Fibonacci Q. 16(3):255-258, 1978, Clarke and Sved in Math. Mag. 66(5):299-303, 1993, Kim, Kim and Kwon in Adv. Stud. Contemp. Math. (Kyungshang) 28(1):1-11 2018. A derangement is a permutation that has no fixed points, and the derangement number [Formula: see text] is the number of fixed-point-free permutations on an n element set. In this paper, we study the derangement polynomials and investigate some interesting properties which are related to derangement numbers. Also, we study two generalizations of derangement polynomials, namely higher-order and r -derangement polynomials, and show some relations between them. In addition, we express several special polynomials in terms of the higher-order derangement polynomials by using umbral calculus.

  14. AMDLIBAE, IBM 360 Subroutine Library, Special Function, Polynomials, Differential Equation

    International Nuclear Information System (INIS)

    Wang, Jesse Y.

    1980-01-01

    -Cotes; D158S P ANC4P: Adap. quad. using 4-th order Newton-Cotes; D161S F GAUSS: Arbitrary Gaussian weights and nodes; D162S F SQUANK: Simpson's quad. used adaptively; D252S F DDFSUB: DP Neville or Stoer sol. lin. dif. eqns.; D253S F DDFSYS: Driver for D252S; D255S F DFBND: Stoer sol. dif. eqs. with error bounds; D256S F DFBDRV: Driver for D255S; D257S F GEARDV: Gear's sol. of init. value problem; D452S F ENDACE: Numerical derivatives real analytic fn.; E206S F LSQPOL: Least squares weighted polynomial fit; E208S F1: Arbitrary function fit, least squares; E209S F CALLSQ: Driver for E206S; E212S F: General least squares fit + function eval.; E250S F VA02A: Least squares funct. min. w/o derivatives; E252S F MINMAX: Chebyshev line fit; E253S F: Arbitrary functional fit II; E256S F BGPOL: Least squares fit with polynomials; E257S F BGLSSQ: Least squares fit with arbitrary function; E350S F SMOOTH: Smoothing by cubic splines

  15. Harmonic sums and polylogarithms generated by cyclotomic polynomials

    Energy Technology Data Exchange (ETDEWEB)

    Ablinger, Jakob; Schneider, Carsten [Johannes Kepler Univ., Linz (Austria). Research Inst. for Symbolic Computation; Bluemlein, Johannes [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany)

    2011-05-15

    The computation of Feynman integrals in massive higher order perturbative calculations in renormalizable Quantum Field Theories requires extensions of multiply nested harmonic sums, which can be generated as real representations by Mellin transforms of Poincare-iterated integrals including denominators of higher cyclotomic polynomials. We derive the cyclotomic harmonic polylogarithms and harmonic sums and study their algebraic and structural relations. The analytic continuation of cyclotomic harmonic sums to complex values of N is performed using analytic representations. We also consider special values of the cyclotomic harmonic polylogarithms at argument x=1, resp., for the cyclotomic harmonic sums at N{yields}{infinity}, which are related to colored multiple zeta values, deriving various of their relations, based on the stuffle and shuffle algebras and three multiple argument relations. We also consider infinite generalized nested harmonic sums at roots of unity which are related to the infinite cyclotomic harmonic sums. Basis representations are derived for weight w=1,2 sums up to cyclotomy l=20. (orig.)

  16. Hydrodynamics-based functional forms of activity metabolism: a case for the power-law polynomial function in animal swimming energetics.

    Science.gov (United States)

    Papadopoulos, Anthony

    2009-01-01

    The first-degree power-law polynomial function is frequently used to describe activity metabolism for steady swimming animals. This function has been used in hydrodynamics-based metabolic studies to evaluate important parameters of energetic costs, such as the standard metabolic rate and the drag power indices. In theory, however, the power-law polynomial function of any degree greater than one can be used to describe activity metabolism for steady swimming animals. In fact, activity metabolism has been described by the conventional exponential function and the cubic polynomial function, although only the power-law polynomial function models drag power since it conforms to hydrodynamic laws. Consequently, the first-degree power-law polynomial function yields incorrect parameter values of energetic costs if activity metabolism is governed by the power-law polynomial function of any degree greater than one. This issue is important in bioenergetics because correct comparisons of energetic costs among different steady swimming animals cannot be made unless the degree of the power-law polynomial function derives from activity metabolism. In other words, a hydrodynamics-based functional form of activity metabolism is a power-law polynomial function of any degree greater than or equal to one. Therefore, the degree of the power-law polynomial function should be treated as a parameter, not as a constant. This new treatment not only conforms to hydrodynamic laws, but also ensures correct comparisons of energetic costs among different steady swimming animals. Furthermore, the exponential power-law function, which is a new hydrodynamics-based functional form of activity metabolism, is a special case of the power-law polynomial function. Hence, the link between the hydrodynamics of steady swimming and the exponential-based metabolic model is defined.

  17. Hydrodynamics-based functional forms of activity metabolism: a case for the power-law polynomial function in animal swimming energetics.

    Directory of Open Access Journals (Sweden)

    Anthony Papadopoulos

    Full Text Available The first-degree power-law polynomial function is frequently used to describe activity metabolism for steady swimming animals. This function has been used in hydrodynamics-based metabolic studies to evaluate important parameters of energetic costs, such as the standard metabolic rate and the drag power indices. In theory, however, the power-law polynomial function of any degree greater than one can be used to describe activity metabolism for steady swimming animals. In fact, activity metabolism has been described by the conventional exponential function and the cubic polynomial function, although only the power-law polynomial function models drag power since it conforms to hydrodynamic laws. Consequently, the first-degree power-law polynomial function yields incorrect parameter values of energetic costs if activity metabolism is governed by the power-law polynomial function of any degree greater than one. This issue is important in bioenergetics because correct comparisons of energetic costs among different steady swimming animals cannot be made unless the degree of the power-law polynomial function derives from activity metabolism. In other words, a hydrodynamics-based functional form of activity metabolism is a power-law polynomial function of any degree greater than or equal to one. Therefore, the degree of the power-law polynomial function should be treated as a parameter, not as a constant. This new treatment not only conforms to hydrodynamic laws, but also ensures correct comparisons of energetic costs among different steady swimming animals. Furthermore, the exponential power-law function, which is a new hydrodynamics-based functional form of activity metabolism, is a special case of the power-law polynomial function. Hence, the link between the hydrodynamics of steady swimming and the exponential-based metabolic model is defined.

  18. Entropy of orthogonal polynomials with Freud weights and information entropies of the harmonic oscillator potential

    Science.gov (United States)

    Van Assche, W.; Yáñez, R. J.; Dehesa, J. S.

    1995-08-01

    The information entropy of the harmonic oscillator potential V(x)=1/2λx2 in both position and momentum spaces can be expressed in terms of the so-called ``entropy of Hermite polynomials,'' i.e., the quantity Sn(H):= -∫-∞+∞H2n(x)log H2n(x) e-x2dx. These polynomials are instances of the polynomials orthogonal with respect to the Freud weights w(x)=exp(-||x||m), m≳0. Here, a very precise and general result of the entropy of Freud polynomials recently established by Aptekarev et al. [J. Math. Phys. 35, 4423-4428 (1994)], specialized to the Hermite kernel (case m=2), leads to an important refined asymptotic expression for the information entropies of very excited states (i.e., for large n) in both position and momentum spaces, to be denoted by Sρ and Sγ, respectively. Briefly, it is shown that, for large values of n, Sρ+1/2logλ≂log(π√2n/e)+o(1) and Sγ-1/2log λ≂log(π√2n/e)+o(1), so that Sρ+Sγ≂log(2π2n/e2)+o(1) in agreement with the generalized indetermination relation of Byalinicki-Birula and Mycielski [Commun. Math. Phys. 44, 129-132 (1975)]. Finally, the rate of convergence of these two information entropies is numerically analyzed. In addition, using a Rakhmanov result, we describe a totally new proof of the leading term of the entropy of Freud polynomials which, naturally, is just a weak version of the aforementioned general result.

  19. A comparison of companion matrix methods to find roots of a trigonometric polynomial

    Science.gov (United States)

    Boyd, John P.

    2013-08-01

    A trigonometric polynomial is a truncated Fourier series of the form fN(t)≡∑j=0Naj cos(jt)+∑j=1N bj sin(jt). It has been previously shown by the author that zeros of such a polynomial can be computed as the eigenvalues of a companion matrix with elements which are complex valued combinations of the Fourier coefficients, the "CCM" method. However, previous work provided no examples, so one goal of this new work is to experimentally test the CCM method. A second goal is introduce a new alternative, the elimination/Chebyshev algorithm, and experimentally compare it with the CCM scheme. The elimination/Chebyshev matrix (ECM) algorithm yields a companion matrix with real-valued elements, albeit at the price of usefulness only for real roots. The new elimination scheme first converts the trigonometric rootfinding problem to a pair of polynomial equations in the variables (c,s) where c≡cos(t) and s≡sin(t). The elimination method next reduces the system to a single univariate polynomial P(c). We show that this same polynomial is the resultant of the system and is also a generator of the Groebner basis with lexicographic ordering for the system. Both methods give very high numerical accuracy for real-valued roots, typically at least 11 decimal places in Matlab/IEEE 754 16 digit floating point arithmetic. The CCM algorithm is typically one or two decimal places more accurate, though these differences disappear if the roots are "Newton-polished" by a single Newton's iteration. The complex-valued matrix is accurate for complex-valued roots, too, though accuracy decreases with the magnitude of the imaginary part of the root. The cost of both methods scales as O(N3) floating point operations. In spite of intimate connections of the elimination/Chebyshev scheme to two well-established technologies for solving systems of equations, resultants and Groebner bases, and the advantages of using only real-valued arithmetic to obtain a companion matrix with real-valued elements

  20. Characterization of the best polynomial approximation with a sign-sensitive weight to a continuous function

    International Nuclear Information System (INIS)

    Ramazanov, A.-R K

    2005-01-01

    Necessary and sufficient conditions for the best polynomial approximation with an arbitrary and, generally speaking, unbounded sign-sensitive weight to a continuous function are obtained; the components of the weight can also take infinite values, therefore the conditions obtained cover, in particular, approximation with interpolation at fixed points and one-sided approximation; in the case of the weight with components equal to 1 one arrives at Chebyshev's classical alternation theorem.

  1. Flowchart Programs, Regular Expressions, and Decidability of Polynomial Growth-Rate

    OpenAIRE

    Ben-Amram, Amir M.; Pineles, Aviad

    2014-01-01

    We present a new method for inferring complexity properties for a class of programs in the form of flowcharts annotated with loop information. Specifically, our method can (soundly and completely) decide if computed values are polynomially bounded as a function of the input; and similarly for the running time. Such complexity properties are undecidable for a Turing-complete programming language, and a common work-around in program analysis is to settle for sound but incomplete solutions. In ...

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

  3. Topological quantum information, virtual Jones polynomials and Khovanov homology

    International Nuclear Information System (INIS)

    Kauffman, Louis H

    2011-01-01

    In this paper, we give a quantum statistical interpretation of the bracket polynomial state sum 〈K〉, the Jones polynomial V K (t) and virtual knot theory versions of the Jones polynomial, including the arrow polynomial. We use these quantum mechanical interpretations to give new quantum algorithms for these Jones polynomials. In those cases where the Khovanov homology is defined, the Hilbert space C(K) of our model is isomorphic with the chain complex for Khovanov homology with coefficients in the complex numbers. There is a natural unitary transformation U:C(K) → C(K) such that 〈K〉 = Trace(U), where 〈K〉 denotes the evaluation of the state sum model for the corresponding polynomial. We show that for the Khovanov boundary operator ∂:C(K) → C(K), we have the relationship ∂U + U∂ = 0. Consequently, the operator U acts on the Khovanov homology, and we obtain a direct relationship between the Khovanov homology and this quantum algorithm for the Jones polynomial. (paper)

  4. Constructing general partial differential equations using polynomial and neural networks.

    Science.gov (United States)

    Zjavka, Ladislav; Pedrycz, Witold

    2016-01-01

    Sum fraction terms can approximate multi-variable functions on the basis of discrete observations, replacing a partial differential equation definition with polynomial elementary data relation descriptions. Artificial neural networks commonly transform the weighted sum of inputs to describe overall similarity relationships of trained and new testing input patterns. Differential polynomial neural networks form a new class of neural networks, which construct and solve an unknown general partial differential equation of a function of interest with selected substitution relative terms using non-linear multi-variable composite polynomials. The layers of the network generate simple and composite relative substitution terms whose convergent series combinations can describe partial dependent derivative changes of the input variables. This regression is based on trained generalized partial derivative data relations, decomposed into a multi-layer polynomial network structure. The sigmoidal function, commonly used as a nonlinear activation of artificial neurons, may transform some polynomial items together with the parameters with the aim to improve the polynomial derivative term series ability to approximate complicated periodic functions, as simple low order polynomials are not able to fully make up for the complete cycles. The similarity analysis facilitates substitutions for differential equations or can form dimensional units from data samples to describe real-world problems. Copyright © 2015 Elsevier Ltd. All rights reserved.

  5. Dynamics of polynomial Chaplygin gas warm inflation

    Energy Technology Data Exchange (ETDEWEB)

    Jawad, Abdul [COMSATS Institute of Information Technology, Department of Mathematics, Lahore (Pakistan); Chaudhary, Shahid [Sharif College of Engineering and Technology, Department of Mathematics, Lahore (Pakistan); Videla, Nelson [Pontificia Universidad Catolica de Valparaiso, Instituto de Fisica, Valparaiso (Chile)

    2017-11-15

    In the present work, we study the consequences of a recently proposed polynomial inflationary potential in the context of the generalized, modified, and generalized cosmic Chaplygin gas models. In addition, we consider dissipative effects by coupling the inflation field to radiation, i.e., the inflationary dynamics is studied in the warm inflation scenario. We take into account a general parametrization of the dissipative coefficient Γ for describing the decay of the inflaton field into radiation. By studying the background and perturbative dynamics in the weak and strong dissipative regimes of warm inflation separately for the positive and negative quadratic and quartic potentials, we obtain expressions for the most relevant inflationary observables as the scalar power spectrum, the scalar spectral, and the tensor-to-scalar ratio. We construct the trajectories in the n{sub s}-r plane for several expressions of the dissipative coefficient and compare with the two-dimensional marginalized contours for (n{sub s}, r) from the latest Planck data. We find that our results are in agreement with WMAP9 and Planck 2015 data. (orig.)

  6. Global sensitivity analysis using polynomial chaos expansions

    International Nuclear Information System (INIS)

    Sudret, Bruno

    2008-01-01

    Global sensitivity analysis (SA) aims at quantifying the respective effects of input random variables (or combinations thereof) onto the variance of the response of a physical or mathematical model. Among the abundant literature on sensitivity measures, the Sobol' indices have received much attention since they provide accurate information for most models. The paper introduces generalized polynomial chaos expansions (PCE) to build surrogate models that allow one to compute the Sobol' indices analytically as a post-processing of the PCE coefficients. Thus the computational cost of the sensitivity indices practically reduces to that of estimating the PCE coefficients. An original non intrusive regression-based approach is proposed, together with an experimental design of minimal size. Various application examples illustrate the approach, both from the field of global SA (i.e. well-known benchmark problems) and from the field of stochastic mechanics. The proposed method gives accurate results for various examples that involve up to eight input random variables, at a computational cost which is 2-3 orders of magnitude smaller than the traditional Monte Carlo-based evaluation of the Sobol' indices

  7. Global sensitivity analysis using polynomial chaos expansions

    Energy Technology Data Exchange (ETDEWEB)

    Sudret, Bruno [Electricite de France, R and D Division, Site des Renardieres, F 77818 Moret-sur-Loing Cedex (France)], E-mail: bruno.sudret@edf.fr

    2008-07-15

    Global sensitivity analysis (SA) aims at quantifying the respective effects of input random variables (or combinations thereof) onto the variance of the response of a physical or mathematical model. Among the abundant literature on sensitivity measures, the Sobol' indices have received much attention since they provide accurate information for most models. The paper introduces generalized polynomial chaos expansions (PCE) to build surrogate models that allow one to compute the Sobol' indices analytically as a post-processing of the PCE coefficients. Thus the computational cost of the sensitivity indices practically reduces to that of estimating the PCE coefficients. An original non intrusive regression-based approach is proposed, together with an experimental design of minimal size. Various application examples illustrate the approach, both from the field of global SA (i.e. well-known benchmark problems) and from the field of stochastic mechanics. The proposed method gives accurate results for various examples that involve up to eight input random variables, at a computational cost which is 2-3 orders of magnitude smaller than the traditional Monte Carlo-based evaluation of the Sobol' indices.

  8. Scattering amplitudes from multivariate polynomial division

    Energy Technology Data Exchange (ETDEWEB)

    Mastrolia, Pierpaolo, E-mail: pierpaolo.mastrolia@cern.ch [Max-Planck-Institut fuer Physik, Foehringer Ring 6, 80805 Muenchen (Germany); Dipartimento di Fisica e Astronomia, Universita di Padova, Padova (Italy); INFN Sezione di Padova, via Marzolo 8, 35131 Padova (Italy); Mirabella, Edoardo, E-mail: mirabell@mppmu.mpg.de [Max-Planck-Institut fuer Physik, Foehringer Ring 6, 80805 Muenchen (Germany); Ossola, Giovanni, E-mail: GOssola@citytech.cuny.edu [New York City College of Technology, City University of New York, 300 Jay Street, Brooklyn, NY 11201 (United States); Graduate School and University Center, City University of New York, 365 Fifth Avenue, New York, NY 10016 (United States); Peraro, Tiziano, E-mail: peraro@mppmu.mpg.de [Max-Planck-Institut fuer Physik, Foehringer Ring 6, 80805 Muenchen (Germany)

    2012-11-15

    We show that the evaluation of scattering amplitudes can be formulated as a problem of multivariate polynomial division, with the components of the integration-momenta as indeterminates. We present a recurrence relation which, independently of the number of loops, leads to the multi-particle pole decomposition of the integrands of the scattering amplitudes. The recursive algorithm is based on the weak Nullstellensatz theorem and on the division modulo the Groebner basis associated to all possible multi-particle cuts. We apply it to dimensionally regulated one-loop amplitudes, recovering the well-known integrand-decomposition formula. Finally, we focus on the maximum-cut, defined as a system of on-shell conditions constraining the components of all the integration-momenta. By means of the Finiteness Theorem and of the Shape Lemma, we prove that the residue at the maximum-cut is parametrized by a number of coefficients equal to the number of solutions of the cut itself.

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

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

  11. Automorphisms of Algebras and Bochner's Property for Vector Orthogonal Polynomials

    Science.gov (United States)

    Horozov, Emil

    2016-05-01

    We construct new families of vector orthogonal polynomials that have the property to be eigenfunctions of some differential operator. They are extensions of the Hermite and Laguerre polynomial systems. A third family, whose first member has been found by Y. Ben Cheikh and K. Douak is also constructed. The ideas behind our approach lie in the studies of bispectral operators. We exploit automorphisms of associative algebras which transform elementary vector orthogonal polynomial systems which are eigenfunctions of a differential operator into other systems of this type.

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

    DEFF Research Database (Denmark)

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

    2011-01-01

    Boolean functions that have constant degree polynomial representation over a fixed finite ring form a natural and strict subclass of the complexity class \\textACC0ACC0. They are also precisely the functions computable efficiently by programs over fixed and finite nilpotent groups. This class...... is not 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...

  13. P A M Dirac meets M G Krein: matrix orthogonal polynomials and Dirac's equation

    Energy Technology Data Exchange (ETDEWEB)

    Duran, Antonio J [Departamento de Analisis Matematico, Universidad de Sevilla, Apdo (PO BOX) 1160, 41080 Sevilla (Spain); Gruenbaum, F Alberto [Department of Mathematics, University of California, Berkeley, CA 94720 (United States)

    2006-04-07

    The solution of several instances of the Schroedinger equation (1926) is made possible by using the well-known orthogonal polynomials associated with the names of Hermite, Legendre and Laguerre. A relativistic alternative to this equation was proposed by Dirac (1928) involving differential operators with matrix coefficients. In 1949 Krein developed a theory of matrix-valued orthogonal polynomials without any reference to differential equations. In Duran A J (1997 Matrix inner product having a matrix symmetric second order differential operator Rocky Mt. J. Math. 27 585-600), one of us raised the question of determining instances of these matrix-valued polynomials going along with second order differential operators with matrix coefficients. In Duran A J and Gruenbaum F A (2004 Orthogonal matrix polynomials satisfying second order differential equations Int. Math. Res. Not. 10 461-84), we developed a method to produce such examples and observed that in certain cases there is a connection with the instance of Dirac's equation with a central potential. We observe that the case of the central Coulomb potential discussed in the physics literature in Darwin C G (1928 Proc. R. Soc. A 118 654), Nikiforov A F and Uvarov V B (1988 Special Functions of Mathematical Physics (Basle: Birkhauser) and Rose M E 1961 Relativistic Electron Theory (New York: Wiley)), and its solution, gives rise to a matrix weight function whose orthogonal polynomials solve a second order differential equation. To the best of our knowledge this is the first instance of a connection between the solution of the first order matrix equation of Dirac and the theory of matrix-valued orthogonal polynomials initiated by M G Krein.

  14. Diffusion Coefficient Calculations With Low Order Legendre Polynomial and Chebyshev Polynomial Approximation for the Transport Equation in Spherical Geometry

    International Nuclear Information System (INIS)

    Yasa, F.; Anli, F.; Guengoer, S.

    2007-01-01

    We present analytical calculations of spherically symmetric radioactive transfer and neutron transport using a hypothesis of P1 and T1 low order polynomial approximation for diffusion coefficient D. Transport equation in spherical geometry is considered as the pseudo slab equation. The validity of polynomial expansionion in transport theory is investigated through a comparison with classic diffusion theory. It is found that for causes when the fluctuation of the scattering cross section dominates, the quantitative difference between the polynomial approximation and diffusion results was physically acceptable in general

  15. A summation procedure for expansions in orthogonal polynomials

    International Nuclear Information System (INIS)

    Garibotti, C.R.; Grinstein, F.F.

    1977-01-01

    Approximants to functions defined by formal series expansions in orthogonal polynomials are introduced. They are shown to be convergent even out of the elliptical domain where the original expansion converges

  16. Classification of complex polynomial vector fields in one complex variable

    DEFF Research Database (Denmark)

    Branner, Bodil; Dias, Kealey

    2010-01-01

    This paper classifies the global structure of monic and centred one-variable complex polynomial vector fields. The classification is achieved by means of combinatorial and analytic data. More specifically, given a polynomial vector field, we construct a combinatorial invariant, describing...... the topology, and a set of analytic invariants, describing the geometry. Conversely, given admissible combinatorial and analytic data sets, we show using surgery the existence of a unique monic and centred polynomial vector field realizing the given invariants. This is the content of the Structure Theorem......, the main result of the paper. This result is an extension and refinement of Douady et al. (Champs de vecteurs polynomiaux sur C. Unpublished manuscript) classification of the structurally stable polynomial vector fields. We further review some general concepts for completeness and show that vector fields...

  17. Skew-orthogonal polynomials and random matrix theory

    CERN Document Server

    Ghosh, Saugata

    2009-01-01

    Orthogonal polynomials satisfy a three-term recursion relation irrespective of the weight function with respect to which they are defined. This gives a simple formula for the kernel function, known in the literature as the Christoffel-Darboux sum. The availability of asymptotic results of orthogonal polynomials and the simple structure of the Christoffel-Darboux sum make the study of unitary ensembles of random matrices relatively straightforward. In this book, the author develops the theory of skew-orthogonal polynomials and obtains recursion relations which, unlike orthogonal polynomials, depend on weight functions. After deriving reduced expressions, called the generalized Christoffel-Darboux formulas (GCD), he obtains universal correlation functions and non-universal level densities for a wide class of random matrix ensembles using the GCD. The author also shows that once questions about higher order effects are considered (questions that are relevant in different branches of physics and mathematics) the ...

  18. Numerical Simulation of Polynomial-Speed Convergence Phenomenon

    Science.gov (United States)

    Li, Yao; Xu, Hui

    2017-11-01

    We provide a hybrid method that captures the polynomial speed of convergence and polynomial speed of mixing for Markov processes. The hybrid method that we introduce is based on the coupling technique and renewal theory. We propose to replace some estimates in classical results about the ergodicity of Markov processes by numerical simulations when the corresponding analytical proof is difficult. After that, all remaining conclusions can be derived from rigorous analysis. Then we apply our results to seek numerical justification for the ergodicity of two 1D microscopic heat conduction models. The mixing rate of these two models are expected to be polynomial but very difficult to prove. In both examples, our numerical results match the expected polynomial mixing rate well.

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

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

  1. Solving polynomial systems using no-root elimination blending schemes

    KAUST Repository

    Barton, Michael

    2011-01-01

    Searching for the roots of (piecewise) polynomial systems of equations is a crucial problem in computer-aided design (CAD), and an efficient solution is in strong demand. Subdivision solvers are frequently used to achieve this goal; however

  2. An algebraic approach to the non-symmetric Macdonald polynomial

    International Nuclear Information System (INIS)

    Nishino, Akinori; Ujino, Hideaki; Wadati, Miki

    1999-01-01

    In terms of the raising and lowering operators, we algebraically construct the non-symmetric Macdonald polynomials which are simultaneous eigenfunctions of the commuting Cherednik operators. We also calculate Cherednik's scalar product of them

  3. An Elementary Proof of the Polynomial Matrix Spectral Factorization Theorem

    OpenAIRE

    Ephremidze, Lasha

    2010-01-01

    A very simple and short proof of the polynomial matrix spectral factorization theorem (on the unit circle as well as on the real line) is presented, which relies on elementary complex analysis and linear algebra.

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

  5. Discrete least squares polynomial approximation with random evaluations - application to PDEs with Random parameters

    KAUST Repository

    Nobile, Fabio

    2015-01-07

    We consider a general problem F(u, y) = 0 where u is the unknown solution, possibly Hilbert space valued, and y a set of uncertain parameters. We specifically address the situation in which the parameterto-solution map u(y) is smooth, however y could be very high (or even infinite) dimensional. In particular, we are interested in cases in which F is a differential operator, u a Hilbert space valued function and y a distributed, space and/or time varying, random field. We aim at reconstructing the parameter-to-solution map u(y) from random noise-free or noisy observations in random points by discrete least squares on polynomial spaces. The noise-free case is relevant whenever the technique is used to construct metamodels, based on polynomial expansions, for the output of computer experiments. In the case of PDEs with random parameters, the metamodel is then used to approximate statistics of the output quantity. We discuss the stability of discrete least squares on random points show convergence estimates both in expectation and probability. We also present possible strategies to select, either a-priori or by adaptive algorithms, sequences of approximating polynomial spaces that allow to reduce, and in some cases break, the curse of dimensionality

  6. Code ''Repol'' to fit experimental data with a polynomial and its graphics plotting

    International Nuclear Information System (INIS)

    Travesi, A.; Romero, L.

    1983-01-01

    The ''Repol'' code performs the fitting of a set of experimental data, with a polynomial of mth. degree (max. 10), using the Least Squares Criterion. Further, it presents the graphic plotting of the fitted polynomial, in the appropriate coordinates axes system, by a plotter. An additional option allows also the graphic plotting of the experimental data, used for the fit. The necessary data to execute this code, are asked to the operator in the screen, in a iterative way, by screen-operator dialogue, and the values are introduced through the keyboard. This code is written in Fortran IV, and because of its structure programming in subroutine blocks, can be adapted to any computer with graphic screen and keyboard terminal, with a plotter serial connected to it, whose software has the Hewlett Packard ''Graphics 1000''. (author)

  7. Code REPOL to fit experimental data with a polynomial, and its graphics plotting

    International Nuclear Information System (INIS)

    Romero, L.; Travesi, A.

    1983-01-01

    The REPOL code, performs the fitting a set of experimental data, with a polynomial of mth. degree (max. 10), using the Least Squares Criterion. further, it presents the graphic plotting of the fitted polynomial, in the appropriate coordinates axes system, by a plotter. An additional option allows also the graphic plotting of the experimental data, used for the fit. The necessary data to execute this code, are asked to the operator in the screen, in a iterative way, by screen-operator dialogue, and the values are introduced through the keyboard. This code is written in Fortran IV, and because of its structure programming in subroutine blocks, can be adapted to any computer with graphic screen and keyboard terminal, with a plotter serial connected to it, whose Software has the Hewlett Packard Graphics 1000. (Author) 5 refs

  8. An asymptotic formula for polynomials orthonormal with respect to a varying weight. II

    International Nuclear Information System (INIS)

    Komlov, A V; Suetin, S P

    2014-01-01

    This paper gives a proof of the theorem announced by the authors in the preceding paper with the same title. The theorem states that asymptotically the behaviour of the polynomials which are orthonormal with respect to the varying weight e −2nQ(x) p g (x)/√(∏ j=1 2p (x−e j )) coincides with the asymptotic behaviour of the Nuttall psi-function, which solves a special boundary-value problem on the relevant hyperelliptic Riemann surface of genus g=p−1. Here e 1 polynomial of even degree 2m and p g is a certain auxiliary polynomial of degree p−1. Bibliography: 23 titles

  9. Entanglement entropy and the colored Jones polynomial

    Science.gov (United States)

    Balasubramanian, Vijay; DeCross, Matthew; Fliss, Jackson; Kar, Arjun; Leigh, Robert G.; Parrikar, Onkar

    2018-05-01

    We study the multi-party entanglement structure of states in Chern-Simons theory created by performing the path integral on 3-manifolds with linked torus boundaries, called link complements. For gauge group SU(2), the wavefunctions of these states (in a particular basis) are the colored Jones polynomials of the corresponding links. We first review the case of U(1) Chern-Simons theory where these are stabilizer states, a fact we use to re-derive an explicit formula for the entanglement entropy across a general link bipartition. We then present the following results for SU(2) Chern-Simons theory: (i) The entanglement entropy for a bipartition of a link gives a lower bound on the genus of surfaces in the ambient S 3 separating the two sublinks. (ii) All torus links (namely, links which can be drawn on the surface of a torus) have a GHZ-like entanglement structure — i.e., partial traces leave a separable state. By contrast, through explicit computation, we test in many examples that hyperbolic links (namely, links whose complements admit hyperbolic structures) have W-like entanglement — i.e., partial traces leave a non-separable state. (iii) Finally, we consider hyperbolic links in the complexified SL(2,C) Chern-Simons theory, which is closely related to 3d Einstein gravity with a negative cosmological constant. In the limit of small Newton constant, we discuss how the entanglement structure is controlled by the Neumann-Zagier potential on the moduli space of hyperbolic structures on the link complement.

  10. Quasi-topological Ricci polynomial gravities

    Science.gov (United States)

    Li, Yue-Zhou; Liu, Hai-Shan; Lü, H.

    2018-02-01

    Quasi-topological terms in gravity can be viewed as those that give no contribution to the equations of motion for a special subclass of metric ansätze. They therefore play no rôle in constructing these solutions, but can affect the general perturbations. We consider Einstein gravity extended with Ricci tensor polynomial invariants, which admits Einstein metrics with appropriate effective cosmological constants as its vacuum solutions. We construct three types of quasi-topological gravities. The first type is for the most general static metrics with spherical, toroidal or hyperbolic isometries. The second type is for the special static metrics where g tt g rr is constant. The third type is the linearized quasitopological gravities on the Einstein metrics. We construct and classify results that are either dependent on or independent of dimensions, up to the tenth order. We then consider a subset of these three types and obtain Lovelock-like quasi-topological gravities, that are independent of the dimensions. The linearized gravities on Einstein metrics on all dimensions are simply Einstein and hence ghost free. The theories become quasi-topological on static metrics in one specific dimension, but non-trivial in others. We also focus on the quasi-topological Ricci cubic invariant in four dimensions as a specific example to study its effect on holography, including shear viscosity, thermoelectric DC conductivities and butterfly velocity. In particular, we find that the holographic diffusivity bounds can be violated by the quasi-topological terms, which can induce an extra massive mode that yields a butterfly velocity unbound above.

  11. Invariant hyperplanes and Darboux integrability of polynomial vector fields

    International Nuclear Information System (INIS)

    Zhang Xiang

    2002-01-01

    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

  12. Interpretation of stream programs: characterizing type 2 polynomial time complexity

    OpenAIRE

    Férée , Hugo; Hainry , Emmanuel; Hoyrup , Mathieu; Péchoux , Romain

    2010-01-01

    International audience; We study polynomial time complexity of type 2 functionals. For that purpose, we introduce a first order functional stream language. We give criteria, named well-founded, on such programs relying on second order interpretation that characterize two variants of type 2 polynomial complexity including the Basic Feasible Functions (BFF). These charac- terizations provide a new insight on the complexity of stream programs. Finally, we adapt these results to functions over th...

  13. The Combinatorial Rigidity Conjecture is False for Cubic Polynomials

    DEFF Research Database (Denmark)

    Henriksen, Christian

    2003-01-01

    We show that there exist two cubic polynomials with connected Julia sets which are combinatorially equivalent but not topologically conjugate on their Julia sets. This disproves a conjecture by McMullen from 1995.......We show that there exist two cubic polynomials with connected Julia sets which are combinatorially equivalent but not topologically conjugate on their Julia sets. This disproves a conjecture by McMullen from 1995....

  14. Vanishing of Littlewood-Richardson polynomials is in P

    OpenAIRE

    Adve, Anshul; Robichaux, Colleen; Yong, Alexander

    2017-01-01

    J. DeLoera-T. McAllister and K. D. Mulmuley-H. Narayanan-M. Sohoni independently proved that determining the vanishing of Littlewood-Richardson coefficients has strongly polynomial time computational complexity. Viewing these as Schubert calculus numbers, we prove the generalization to the Littlewood-Richardson polynomials that control equivariant cohomology of Grassmannians. We construct a polytope using the edge-labeled tableau rule of H. Thomas-A. Yong. Our proof then combines a saturation...

  15. Discrete-Time Filter Synthesis using Product of Gegenbauer Polynomials

    OpenAIRE

    N. Stojanovic; N. Stamenkovic; I. Krstic

    2016-01-01

    A new approximation to design continuoustime and discrete-time low-pass filters, presented in this paper, based on the product of Gegenbauer polynomials, provides the ability of more flexible adjustment of passband and stopband responses. The design is achieved taking into account a prescribed specification, leading to a better trade-off among the magnitude and group delay responses. Many well-known continuous-time and discrete-time transitional filter based on the classical polynomial approx...

  16. Non-existence criteria for Laurent polynomial first integrals

    Directory of Open Access Journals (Sweden)

    Shaoyun Shi

    2003-01-01

    Full Text Available In this paper we derived some simple criteria for non-existence and partial non-existence Laurent polynomial first integrals for a general nonlinear systems of ordinary differential equations $\\dot x = f(x$, $x \\in \\mathbb{R}^n$ with $f(0 = 0$. We show that if the eigenvalues of the Jacobi matrix of the vector field $f(x$ are $\\mathbb{Z}$-independent, then the system has no nontrivial Laurent polynomial integrals.

  17. Raising and Lowering Operators for Askey-Wilson Polynomials

    Directory of Open Access Journals (Sweden)

    Siddhartha Sahi

    2007-01-01

    Full Text Available In this paper we describe two pairs of raising/lowering operators for Askey-Wilson polynomials, which result from constructions involving very different techniques. The first technique is quite elementary, and depends only on the ''classical'' properties of these polynomials, viz. the q-difference equation and the three term recurrence. The second technique is less elementary, and involves the one-variable version of the double affine Hecke algebra.

  18. Bounds and asymptotics for orthogonal polynomials for varying weights

    CERN Document Server

    Levin, Eli

    2018-01-01

    This book establishes bounds and asymptotics under almost minimal conditions on the varying weights, and applies them to universality limits and entropy integrals.  Orthogonal polynomials associated with varying weights play a key role in analyzing random matrices and other topics.  This book will be of use to a wide community of mathematicians, physicists, and statisticians dealing with techniques of potential theory, orthogonal polynomials, approximation theory, as well as random matrices. .

  19. Polynomial fuzzy observer designs: a sum-of-squares approach.

    Science.gov (United States)

    Tanaka, Kazuo; Ohtake, Hiroshi; Seo, Toshiaki; Tanaka, Motoyasu; Wang, Hua O

    2012-10-01

    This paper presents a sum-of-squares (SOS) approach to polynomial fuzzy observer designs for three classes of polynomial fuzzy systems. The proposed SOS-based framework provides a number of innovations and improvements over the existing linear matrix inequality (LMI)-based approaches to Takagi-Sugeno (T-S) fuzzy controller and observer designs. First, we briefly summarize previous results with respect to a polynomial fuzzy system that is a more general representation of the well-known T-S fuzzy system. Next, we propose polynomial fuzzy observers to estimate states in three classes of polynomial fuzzy systems and derive SOS conditions to design polynomial fuzzy controllers and observers. A remarkable feature of the SOS design conditions for the first two classes (Classes I and II) is that they realize the so-called separation principle, i.e., the polynomial fuzzy controller and observer for each class can be separately designed without lack of guaranteeing the stability of the overall control system in addition to converging state-estimation error (via the observer) to zero. Although, for the last class (Class III), the separation principle does not hold, we propose an algorithm to design polynomial fuzzy controller and observer satisfying the stability of the overall control system in addition to converging state-estimation error (via the observer) to zero. All the design conditions in the proposed approach can be represented in terms of SOS and are symbolically and numerically solved via the recently developed SOSTOOLS and a semidefinite-program solver, respectively. To illustrate the validity and applicability of the proposed approach, three design examples are provided. The examples demonstrate the advantages of the SOS-based approaches for the existing LMI approaches to T-S fuzzy observer designs.

  20. Ratio asymptotics of Hermite-Pade polynomials for Nikishin systems

    International Nuclear Information System (INIS)

    Aptekarev, A I; Lopez, Guillermo L; Rocha, I A

    2005-01-01

    The existence of ratio asymptotics is proved for a sequence of multiple orthogonal polynomials with orthogonality relations distributed among a system of m finite Borel measures with support on a bounded interval of the real line which form a so-called Nikishin system. For m=1 this result reduces to Rakhmanov's celebrated theorem on the ratio asymptotics for orthogonal polynomials on the real line.

  1. Families of superintegrable Hamiltonians constructed from exceptional polynomials

    International Nuclear Information System (INIS)

    Post, Sarah; Tsujimoto, Satoshi; Vinet, Luc

    2012-01-01

    We introduce a family of exactly-solvable two-dimensional Hamiltonians whose wave functions are given in terms of Laguerre and exceptional Jacobi polynomials. The Hamiltonians contain purely quantum terms which vanish in the classical limit leaving only a previously known family of superintegrable systems. Additional, higher-order integrals of motion are constructed from ladder operators for the considered orthogonal polynomials proving the quantum system to be superintegrable. (paper)

  2. Lower bounds for the circuit size of partially homogeneous polynomials

    Czech Academy of Sciences Publication Activity Database

    Le, Hong-Van

    2017-01-01

    Roč. 225, č. 4 (2017), s. 639-657 ISSN 1072-3374 Institutional support: RVO:67985840 Keywords : partially homogeneous polynomials * polynomials Subject RIV: BA - General Mathematics OBOR OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8) https://link.springer.com/article/10.1007/s10958-017-3483-4

  3. Euler Polynomials and Identities for Non-Commutative Operators

    OpenAIRE

    De Angelis, V.; Vignat, C.

    2015-01-01

    Three kinds of identities involving non-commutating operators and Euler and Bernoulli polynomials are studied. The first identity, as given by Bender and Bettencourt, expresses the nested commutator of the Hamiltonian and momentum operators as the commutator of the momentum and the shifted Euler polynomial of the Hamiltonian. The second one, due to J.-C. Pain, links the commutators and anti-commutators of the monomials of the position and momentum operators. The third appears in a work by Fig...

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

  5. Polynomial asymptotic stability of damped stochastic differential equations

    Directory of Open Access Journals (Sweden)

    John Appleby

    2004-08-01

    Full Text Available The paper studies the polynomial convergence of solutions of a scalar nonlinear It\\^{o} stochastic differential equation\\[dX(t = -f(X(t\\,dt + \\sigma(t\\,dB(t\\] where it is known, {\\it a priori}, that $\\lim_{t\\rightarrow\\infty} X(t=0$, a.s. The intensity of the stochastic perturbation $\\sigma$ is a deterministic, continuous and square integrable function, which tends to zero more quickly than a polynomially decaying function. The function $f$ obeys $\\lim_{x\\rightarrow 0}\\mbox{sgn}(xf(x/|x|^\\beta = a$, for some $\\beta>1$, and $a>0$.We study two asymptotic regimes: when $\\sigma$ tends to zero sufficiently quickly the polynomial decay rate of solutions is the same as for the deterministic equation (when $\\sigma\\equiv0$. When $\\sigma$ decays more slowly, a weaker almost sure polynomial upper bound on the decay rate of solutions is established. Results which establish the necessity for $\\sigma$ to decay polynomially in order to guarantee the almost sure polynomial decay of solutions are also proven.

  6. Okounkov's BC-Type Interpolation Macdonald Polynomials and Their q=1 Limit

    NARCIS (Netherlands)

    Koornwinder, T.H.

    2015-01-01

    This paper surveys eight classes of polynomials associated with A-type and BC-type root systems: Jack, Jacobi, Macdonald and Koornwinder polynomials and interpolation (or shifted) Jack and Macdonald polynomials and their BC-type extensions. Among these the BC-type interpolation Jack polynomials were

  7. A nonparametric approach to calculate critical micelle concentrations: the local polynomial regression method

    Energy Technology Data Exchange (ETDEWEB)

    Lopez Fontan, J.L.; Costa, J.; Ruso, J.M.; Prieto, G. [Dept. of Applied Physics, Univ. of Santiago de Compostela, Santiago de Compostela (Spain); Sarmiento, F. [Dept. of Mathematics, Faculty of Informatics, Univ. of A Coruna, A Coruna (Spain)

    2004-02-01

    The application of a statistical method, the local polynomial regression method, (LPRM), based on a nonparametric estimation of the regression function to determine the critical micelle concentration (cmc) is presented. The method is extremely flexible because it does not impose any parametric model on the subjacent structure of the data but rather allows the data to speak for themselves. Good concordance of cmc values with those obtained by other methods was found for systems in which the variation of a measured physical property with concentration showed an abrupt change. When this variation was slow, discrepancies between the values obtained by LPRM and others methods were found. (orig.)

  8. Covariance of the number of real zeros of a random trigonometric polynomial

    Directory of Open Access Journals (Sweden)

    K. Farahmand

    2006-01-01

    Full Text Available For random coefficients aj and bj we consider a random trigonometric polynomial defined as Tn(θ=∑j=0n{ajcos⁡jθ+bjsin⁡jθ}. The expected number of real zeros of Tn(θ in the interval (0,2π can be easily obtained. In this note we show that this number is in fact n/3. However the variance of the above number is not known. This note presents a method which leads to the asymptotic value for the covariance of the number of real zeros of the above polynomial in intervals (0,π and (π,2π. It can be seen that our method in fact remains valid to obtain the result for any two disjoint intervals. The applicability of our method to the classical random trigonometric polynomial, defined as Pn(θ=∑j=0naj(ωcos⁡jθ, is also discussed. Tn(θ has the advantage on Pn(θ of being stationary, with respect to θ, for which, therefore, a more advanced method developed could be used to yield the results.

  9. Bayes Node Energy Polynomial Distribution to Improve Routing in Wireless Sensor Network.

    Science.gov (United States)

    Palanisamy, Thirumoorthy; Krishnasamy, Karthikeyan N

    2015-01-01

    Wireless Sensor Network monitor and control the physical world via large number of small, low-priced sensor nodes. Existing method on Wireless Sensor Network (WSN) presented sensed data communication through continuous data collection resulting in higher delay and energy consumption. To conquer the routing issue and reduce energy drain rate, Bayes Node Energy and Polynomial Distribution (BNEPD) technique is introduced with energy aware routing in the wireless sensor network. The Bayes Node Energy Distribution initially distributes the sensor nodes that detect an object of similar event (i.e., temperature, pressure, flow) into specific regions with the application of Bayes rule. The object detection of similar events is accomplished based on the bayes probabilities and is sent to the sink node resulting in minimizing the energy consumption. Next, the Polynomial Regression Function is applied to the target object of similar events considered for different sensors are combined. They are based on the minimum and maximum value of object events and are transferred to the sink node. Finally, the Poly Distribute algorithm effectively distributes the sensor nodes. The energy efficient routing path for each sensor nodes are created by data aggregation at the sink based on polynomial regression function which reduces the energy drain rate with minimum communication overhead. Experimental performance is evaluated using Dodgers Loop Sensor Data Set from UCI repository. Simulation results show that the proposed distribution algorithm significantly reduce the node energy drain rate and ensure fairness among different users reducing the communication overhead.

  10. Mapping Landslides in Lunar Impact Craters Using Chebyshev Polynomials and Dem's

    Science.gov (United States)

    Yordanov, V.; Scaioni, M.; Brunetti, M. T.; Melis, M. T.; Zinzi, A.; Giommi, P.

    2016-06-01

    Geological slope failure processes have been observed on the Moon surface for decades, nevertheless a detailed and exhaustive lunar landslide inventory has not been produced yet. For a preliminary survey, WAC images and DEM maps from LROC at 100 m/pixels have been exploited in combination with the criteria applied by Brunetti et al. (2015) to detect the landslides. These criteria are based on the visual analysis of optical images to recognize mass wasting features. In the literature, Chebyshev polynomials have been applied to interpolate crater cross-sections in order to obtain a parametric characterization useful for classification into different morphological shapes. Here a new implementation of Chebyshev polynomial approximation is proposed, taking into account some statistical testing of the results obtained during Least-squares estimation. The presence of landslides in lunar craters is then investigated by analyzing the absolute values off odd coefficients of estimated Chebyshev polynomials. A case study on the Cassini A crater has demonstrated the key-points of the proposed methodology and outlined the required future development to carry out.

  11. Bayes Node Energy Polynomial Distribution to Improve Routing in Wireless Sensor Network

    Science.gov (United States)

    Palanisamy, Thirumoorthy; Krishnasamy, Karthikeyan N.

    2015-01-01

    Wireless Sensor Network monitor and control the physical world via large number of small, low-priced sensor nodes. Existing method on Wireless Sensor Network (WSN) presented sensed data communication through continuous data collection resulting in higher delay and energy consumption. To conquer the routing issue and reduce energy drain rate, Bayes Node Energy and Polynomial Distribution (BNEPD) technique is introduced with energy aware routing in the wireless sensor network. The Bayes Node Energy Distribution initially distributes the sensor nodes that detect an object of similar event (i.e., temperature, pressure, flow) into specific regions with the application of Bayes rule. The object detection of similar events is accomplished based on the bayes probabilities and is sent to the sink node resulting in minimizing the energy consumption. Next, the Polynomial Regression Function is applied to the target object of similar events considered for different sensors are combined. They are based on the minimum and maximum value of object events and are transferred to the sink node. Finally, the Poly Distribute algorithm effectively distributes the sensor nodes. The energy efficient routing path for each sensor nodes are created by data aggregation at the sink based on polynomial regression function which reduces the energy drain rate with minimum communication overhead. Experimental performance is evaluated using Dodgers Loop Sensor Data Set from UCI repository. Simulation results show that the proposed distribution algorithm significantly reduce the node energy drain rate and ensure fairness among different users reducing the communication overhead. PMID:26426701

  12. Bayes Node Energy Polynomial Distribution to Improve Routing in Wireless Sensor Network.

    Directory of Open Access Journals (Sweden)

    Thirumoorthy Palanisamy

    Full Text Available Wireless Sensor Network monitor and control the physical world via large number of small, low-priced sensor nodes. Existing method on Wireless Sensor Network (WSN presented sensed data communication through continuous data collection resulting in higher delay and energy consumption. To conquer the routing issue and reduce energy drain rate, Bayes Node Energy and Polynomial Distribution (BNEPD technique is introduced with energy aware routing in the wireless sensor network. The Bayes Node Energy Distribution initially distributes the sensor nodes that detect an object of similar event (i.e., temperature, pressure, flow into specific regions with the application of Bayes rule. The object detection of similar events is accomplished based on the bayes probabilities and is sent to the sink node resulting in minimizing the energy consumption. Next, the Polynomial Regression Function is applied to the target object of similar events considered for different sensors are combined. They are based on the minimum and maximum value of object events and are transferred to the sink node. Finally, the Poly Distribute algorithm effectively distributes the sensor nodes. The energy efficient routing path for each sensor nodes are created by data aggregation at the sink based on polynomial regression function which reduces the energy drain rate with minimum communication overhead. Experimental performance is evaluated using Dodgers Loop Sensor Data Set from UCI repository. Simulation results show that the proposed distribution algorithm significantly reduce the node energy drain rate and ensure fairness among different users reducing the communication overhead.

  13. A harmonic polynomial cell (HPC) method for 3D Laplace equation with application in marine hydrodynamics

    Energy Technology Data Exchange (ETDEWEB)

    Shao, Yan-Lin, E-mail: yanlin.shao@dnvgl.com; Faltinsen, Odd M.

    2014-10-01

    We propose a new efficient and accurate numerical method based on harmonic polynomials to solve boundary value problems governed by 3D Laplace equation. The computational domain is discretized by overlapping cells. Within each cell, the velocity potential is represented by the linear superposition of a complete set of harmonic polynomials, which are the elementary solutions of Laplace equation. By its definition, the method is named as Harmonic Polynomial Cell (HPC) method. The characteristics of the accuracy and efficiency of the HPC method are demonstrated by studying analytical cases. Comparisons will be made with some other existing boundary element based methods, e.g. Quadratic Boundary Element Method (QBEM) and the Fast Multipole Accelerated QBEM (FMA-QBEM) and a fourth order Finite Difference Method (FDM). To demonstrate the applications of the method, it is applied to some studies relevant for marine hydrodynamics. Sloshing in 3D rectangular tanks, a fully-nonlinear numerical wave tank, fully-nonlinear wave focusing on a semi-circular shoal, and the nonlinear wave diffraction of a bottom-mounted cylinder in regular waves are studied. The comparisons with the experimental results and other numerical results are all in satisfactory agreement, indicating that the present HPC method is a promising method in solving potential-flow problems. The underlying procedure of the HPC method could also be useful in other fields than marine hydrodynamics involved with solving Laplace equation.

  14. Analysis of the performance of a H-Darrieus rotor under uncertainty using Polynomial Chaos Expansion

    International Nuclear Information System (INIS)

    Daróczy, László; Janiga, Gábor; Thévenin, Dominique

    2016-01-01

    Due to the growing importance of wind energy, improving the efficiency of energy conversion is essential. Horizontal Axis Wind Turbines are the most well-spread, but H-Darrieus turbines are becoming popular as well due to their simple design and easier integration. Due to the high efficiency of existing wind turbines, further improvements require numerical optimization. One important aspect is to find a better configuration that is also robust, i.e., a configuration that retains its performance under uncertainties. For this purpose, forward uncertainty propagation has to be applied. In the present work, an Uncertainty Quantification (UQ) method, Polynomial Chaos Expansion, is applied to transient, turbulent flow simulations of a variable-speed H-Darrieus turbine, taking into account uncertainty in the preset pitch angle and in the angular velocity. The resulting uncertainty of the performance coefficient and of the quasi-periodic torque curve are quantified. In the presence of stall the instantaneous torque coefficients tend to show asymmetric distributions, meaning that error bars cannot be correctly reconstructed using only mean value and standard deviation. The expected performance was always found to be smaller than in computations without UQ techniques, corresponding to up to 10% of relative losses for λ = 2.5. - Highlights: • Uncertainty Quantification/Polynomial Chaos Expansion successfully applied to H-rotor. • Accounting simultaneously for uncertainty in pitch angle and angular velocity. • Performance coefficient decreases by up to 10% when accounting for uncertainty. • For low tip-speed-ratio, high-order polynomials are needed. • Polynomial order 4 is sufficient to reconstruct distribution at higher TSR.

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

    International Nuclear Information System (INIS)

    Schiffgens, J.O.

    1990-01-01

    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)

  16. Multivariate Local Polynomial Regression with Application to Shenzhen Component Index

    Directory of Open Access Journals (Sweden)

    Liyun Su

    2011-01-01

    Full Text Available This study attempts to characterize and predict stock index series in Shenzhen stock market using the concepts of multivariate local polynomial regression. Based on nonlinearity and chaos of the stock index time series, multivariate local polynomial prediction methods and univariate local polynomial prediction method, all of which use the concept of phase space reconstruction according to Takens' Theorem, are considered. To fit the stock index series, the single series changes into bivariate series. To evaluate the results, the multivariate predictor for bivariate time series based on multivariate local polynomial model is compared with univariate predictor with the same Shenzhen stock index data. The numerical results obtained by Shenzhen component index show that the prediction mean squared error of the multivariate predictor is much smaller than the univariate one and is much better than the existed three methods. Even if the last half of the training data are used in the multivariate predictor, the prediction mean squared error is smaller than the univariate predictor. Multivariate local polynomial prediction model for nonsingle time series is a useful tool for stock market price prediction.

  17. Polynomial algebra of discrete models in systems biology.

    Science.gov (United States)

    Veliz-Cuba, Alan; Jarrah, Abdul Salam; Laubenbacher, Reinhard

    2010-07-01

    An increasing number of discrete mathematical models are being published in Systems Biology, ranging from Boolean network models to logical models and Petri nets. They are used to model a variety of biochemical networks, such as metabolic networks, gene regulatory networks and signal transduction networks. There is increasing evidence that such models can capture key dynamic features of biological networks and can be used successfully for hypothesis generation. This article provides a unified framework that can aid the mathematical analysis of Boolean network models, logical models and Petri nets. They can be represented as polynomial dynamical systems, which allows the use of a variety of mathematical tools from computer algebra for their analysis. Algorithms are presented for the translation into polynomial dynamical systems. Examples are given of how polynomial algebra can be used for the model analysis. alanavc@vt.edu Supplementary data are available at Bioinformatics online.

  18. A Formally Verified Conflict Detection Algorithm for Polynomial Trajectories

    Science.gov (United States)

    Narkawicz, Anthony; Munoz, Cesar

    2015-01-01

    In air traffic management, conflict detection algorithms are used to determine whether or not aircraft are predicted to lose horizontal and vertical separation minima within a time interval assuming a trajectory model. In the case of linear trajectories, conflict detection algorithms have been proposed that are both sound, i.e., they detect all conflicts, and complete, i.e., they do not present false alarms. In general, for arbitrary nonlinear trajectory models, it is possible to define detection algorithms that are either sound or complete, but not both. This paper considers the case of nonlinear aircraft trajectory models based on polynomial functions. In particular, it proposes a conflict detection algorithm that precisely determines whether, given a lookahead time, two aircraft flying polynomial trajectories are in conflict. That is, it has been formally verified that, assuming that the aircraft trajectories are modeled as polynomial functions, the proposed algorithm is both sound and complete.

  19. A probabilistic approach of sum rules for heat polynomials

    International Nuclear Information System (INIS)

    Vignat, C; Lévêque, O

    2012-01-01

    In this paper, we show that the sum rules for generalized Hermite polynomials derived by Daboul and Mizrahi (2005 J. Phys. A: Math. Gen. http://dx.doi.org/10.1088/0305-4470/38/2/010) and by Graczyk and Nowak (2004 C. R. Acad. Sci., Ser. 1 338 849) can be interpreted and easily recovered using a probabilistic moment representation of these polynomials. The covariance property of the raising operator of the harmonic oscillator, which is at the origin of the identities proved in Daboul and Mizrahi and the dimension reduction effect expressed in the main result of Graczyk and Nowak are both interpreted in terms of the rotational invariance of the Gaussian distributions. As an application of these results, we uncover a probabilistic moment interpretation of two classical integrals of the Wigner function that involve the associated Laguerre polynomials. (paper)

  20. Local polynomial Whittle estimation of perturbed fractional processes

    DEFF Research Database (Denmark)

    Frederiksen, Per; Nielsen, Frank; Nielsen, Morten Ørregaard

    We propose a semiparametric local polynomial Whittle with noise (LPWN) estimator of the memory parameter in long memory time series perturbed by a noise term which may be serially correlated. The estimator approximates the spectrum of the perturbation as well as that of the short-memory component...... of the signal by two separate polynomials. Including these polynomials we obtain a reduction in the order of magnitude of the bias, but also in‡ate the asymptotic variance of the long memory estimate by a multiplicative constant. We show that the estimator is consistent for d 2 (0; 1), asymptotically normal...... for d ε (0, 3/4), and if the spectral density is infinitely smooth near frequency zero, the rate of convergence can become arbitrarily close to the parametric rate, pn. A Monte Carlo study reveals that the LPWN estimator performs well in the presence of a serially correlated perturbation term...

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

  2. Synchronization of generalized Henon map using polynomial controller

    International Nuclear Information System (INIS)

    Lam, H.K.

    2010-01-01

    This Letter presents the chaos synchronization of two discrete-time generalized Henon map, namely the drive and response systems. A polynomial controller is proposed to drive the system states of the response system to follow those of the drive system. The system stability of the error system formed by the drive and response systems and the synthesis of the polynomial controller are investigated using the sum-of-squares (SOS) technique. Based on the Lyapunov stability theory, stability conditions in terms of SOS are derived to guarantee the system stability and facilitate the controller synthesis. By satisfying the SOS-based stability conditions, chaotic synchronization is achieved. The solution of the SOS-based stability conditions can be found numerically using the third-party Matlab toolbox SOSTOOLS. A simulation example is given to illustrate the merits of the proposed polynomial control approach.

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

    International Nuclear Information System (INIS)

    Griego, J.

    1996-01-01

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

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

  5. Fractional order differentiation by integration with Jacobi polynomials

    KAUST Repository

    Liu, Dayan; Gibaru, O.; Perruquetti, Wilfrid; Laleg-Kirati, Taous-Meriem

    2012-01-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.

  6. Euler polynomials and identities for non-commutative operators

    Science.gov (United States)

    De Angelis, Valerio; Vignat, Christophe

    2015-12-01

    Three kinds of identities involving non-commutating operators and Euler and Bernoulli polynomials are studied. The first identity, as given by Bender and Bettencourt [Phys. Rev. D 54(12), 7710-7723 (1996)], expresses the nested commutator of the Hamiltonian and momentum operators as the commutator of the momentum and the shifted Euler polynomial of the Hamiltonian. The second one, by Pain [J. Phys. A: Math. Theor. 46, 035304 (2013)], links the commutators and anti-commutators of the monomials of the position and momentum operators. The third appears in a work by Figuieira de Morisson and Fring [J. Phys. A: Math. Gen. 39, 9269 (2006)] in the context of non-Hermitian Hamiltonian systems. In each case, we provide several proofs and extensions of these identities that highlight the role of Euler and Bernoulli polynomials.

  7. Local polynomial Whittle estimation covering non-stationary fractional processes

    DEFF Research Database (Denmark)

    Nielsen, Frank

    to the non-stationary region. By approximating the short-run component of the spectrum by a polynomial, instead of a constant, in a shrinking neighborhood of zero we alleviate some of the bias that the classical local Whittle estimators is prone to. This bias reduction comes at a cost as the variance is in...... study illustrates the performance of the proposed estimator compared to the classical local Whittle estimator and the local polynomial Whittle estimator. The empirical justi.cation of the proposed estimator is shown through an analysis of credit spreads....

  8. The algebra of Weyl symmetrised polynomials and its quantum extension

    International Nuclear Information System (INIS)

    Gelfand, I.M.; Fairlie, D.B.

    1991-01-01

    The Algebra of Weyl symmetrised polynomials in powers of Hamiltonian operators P and Q which satisfy canonical commutation relations is constructed. This algebra is shown to encompass all recent infinite dimensional algebras acting on two-dimensional phase space. In particular the Moyal bracket algebra and the Poisson bracket algebra, of which the Moyal is the unique one parameter deformation are shown to be different aspects of this infinite algebra. We propose the introduction of a second deformation, by the replacement of the Heisenberg algebra for P, Q with a q-deformed commutator, and construct algebras of q-symmetrised Polynomials. (orig.)

  9. Skew-orthogonal polynomials, differential systems and random matrix theory

    International Nuclear Information System (INIS)

    Ghosh, S.

    2007-01-01

    We study skew-orthogonal polynomials with respect to the weight function exp[-2V (x)], with V (x) = Σ K=1 2d (u K /K)x K , u 2d > 0, d > 0. A finite subsequence of such skew-orthogonal polynomials arising in the study of Orthogonal and Symplectic ensembles of random matrices, satisfy a system of differential-difference-deformation equation. The vectors formed by such subsequence has the rank equal to the degree of the potential in the quaternion sense. These solutions satisfy certain compatibility condition and hence admit a simultaneous fundamental system of solutions. (author)

  10. Orthogonal polynomials, Laguerre Fock space, and quasi-classical asymptotics

    Science.gov (United States)

    Engliš, Miroslav; Ali, S. Twareque

    2015-07-01

    Continuing our earlier investigation of the Hermite case [S. T. Ali and M. Engliš, J. Math. Phys. 55, 042102 (2014)], we study an unorthodox variant of the Berezin-Toeplitz quantization scheme associated with Laguerre polynomials. In particular, we describe a "Laguerre analogue" of the classical Fock (Segal-Bargmann) space and the relevant semi-classical asymptotics of its Toeplitz operators; the former actually turns out to coincide with the Hilbert space appearing in the construction of the well-known Barut-Girardello coherent states. Further extension to the case of Legendre polynomials is likewise discussed.

  11. Discrete-Time Filter Synthesis using Product of Gegenbauer Polynomials

    Directory of Open Access Journals (Sweden)

    N. Stojanovic

    2016-09-01

    Full Text Available A new approximation to design continuoustime and discrete-time low-pass filters, presented in this paper, based on the product of Gegenbauer polynomials, provides the ability of more flexible adjustment of passband and stopband responses. The design is achieved taking into account a prescribed specification, leading to a better trade-off among the magnitude and group delay responses. Many well-known continuous-time and discrete-time transitional filter based on the classical polynomial approximations(Chebyshev, Legendre, Butterworth are shown to be a special cases of proposed approximation method.

  12. Weierstrass method for quaternionic polynomial root-finding

    Science.gov (United States)

    Falcão, M. Irene; Miranda, Fernando; Severino, Ricardo; Soares, M. Joana

    2018-01-01

    Quaternions, introduced by Hamilton in 1843 as a generalization of complex numbers, have found, in more recent years, a wealth of applications in a number of different areas which motivated the design of efficient methods for numerically approximating the zeros of quaternionic polynomials. In fact, one can find in the literature recent contributions to this subject based on the use of complex techniques, but numerical methods relying on quaternion arithmetic remain scarce. In this paper we propose a Weierstrass-like method for finding simultaneously {\\sl all} the zeros of unilateral quaternionic polynomials. The convergence analysis and several numerical examples illustrating the performance of the method are also presented.

  13. Orthogonal polynomials on the unit circle part 2 spectral theory

    CERN Document Server

    Simon, Barry

    2013-01-01

    This two-part book is a comprehensive overview of the theory of probability measures on the unit circle, viewed especially in terms of the orthogonal polynomials defined by those measures. A major theme involves the connections between the Verblunsky coefficients (the coefficients of the recurrence equation for the orthogonal polynomials) and the measures, an analog of the spectral theory of one-dimensional Schrödinger operators. Among the topics discussed along the way are the asymptotics of Toeplitz determinants (Szegő's theorems), limit theorems for the density of the zeros of orthogonal po

  14. Orthogonal polynomials on the unit circle part 1 classical theory

    CERN Document Server

    2009-01-01

    This two-part book is a comprehensive overview of the theory of probability measures on the unit circle, viewed especially in terms of the orthogonal polynomials defined by those measures. A major theme involves the connections between the Verblunsky coefficients (the coefficients of the recurrence equation for the orthogonal polynomials) and the measures, an analog of the spectral theory of one-dimensional Schrodinger operators. Among the topics discussed along the way are the asymptotics of Toeplitz determinants (Szegő's theorems), limit theorems for the density of the zeros of orthogonal po

  15. The neighbourhood polynomial of some families of dendrimers

    Science.gov (United States)

    Nazri Husin, Mohamad; Hasni, Roslan

    2018-04-01

    The neighbourhood polynomial N(G,x) is generating function for the number of faces of each cardinality in the neighbourhood complex of a graph and it is defined as (G,x)={\\sum }U\\in N(G){x}|U|, where N(G) is neighbourhood complex of a graph, whose vertices of the graph and faces are subsets of vertices that have a common neighbour. A dendrimers is an artificially manufactured or synthesized molecule built up from branched units called monomers. In this paper, we compute this polynomial for some families of dendrimer.

  16. Gaussian polynomials and content ideal in trivial extensions

    International Nuclear Information System (INIS)

    Bakkari, C.; Mahdou, N.

    2006-12-01

    The goal of this paper is to exhibit a class of Gaussian non-coherent rings R (with zero-divisors) such that wdim(R) = ∞ and fPdim(R) is always at most one and also exhibits a new class of rings (with zerodivisors) which are neither locally Noetherian nor locally domain where Gaussian polynomials have a locally principal content. For this purpose, we study the possible transfer of the 'Gaussian' property and the property 'the content ideal of a Gaussian polynomial is locally principal' to various trivial extension contexts. This article includes a brief discussion of the scopes and limits of our result. (author)

  17. M-Polynomial and Related Topological Indices of Nanostar Dendrimers

    Directory of Open Access Journals (Sweden)

    Mobeen Munir

    2016-09-01

    Full Text Available Dendrimers are highly branched organic macromolecules with successive layers of branch units surrounding a central core. The M-polynomial of nanotubes has been vastly investigated as it produces many degree-based topological indices. These indices are invariants of the topology of graphs associated with molecular structure of nanomaterials to correlate certain physicochemical properties like boiling point, stability, strain energy, etc. of chemical compounds. In this paper, we first determine M-polynomials of some nanostar dendrimers and then recover many degree-based topological indices.

  18. On the Lojasiewicz exponent at infinity of real polynomials

    International Nuclear Information System (INIS)

    Ha Huy Vui; Pham Tien Son

    2007-07-01

    Let f : R n → R be a nonconstant polynomial function. In this paper, using the information from 'the curve of tangency' of f, we provide a method to determine the Lojasiewicz exponent at infinity of f. As a corollary, we give a computational criterion to decide if the Lojasiewicz exponent at infinity is finite or not. Then, we obtain a formula to calculate the set of points at which the polynomial f is not proper. Moreover, a relation between the Lojasiewicz exponent at infinity of f with the problem of computing the global optimum of f is also established. (author)

  19. Inequalities for majorizing analytic functions and their applications to rational trigonometric functions and polynomials

    International Nuclear Information System (INIS)

    Olesov, A V

    2014-01-01

    New inequalities are established for analytic functions satisfying Meiman's majorization conditions. Estimates for values of and differential inequalities involving rational trigonometric functions with an integer majorant on an interval of length less than the period and with prescribed poles which are symmetrically positioned relative to the real axis, as well as differential inequalities for trigonometric polynomials in some classes, are given as applications. These results improve several theorems due to Meiman, Genchev, Smirnov and Rusak. Bibliography: 27 titles

  20. Universal localizing bounds for compact invariant sets of natural polynomial Hamiltonian systems

    International Nuclear Information System (INIS)

    Starkov, Konstantin E.

    2008-01-01

    In this Letter we study the localization problem of compact invariant sets of natural Hamiltonian systems with a polynomial Hamiltonian. Our results are based on applying the first order extremum conditions. We compute universal localizing bounds for some domain containing all compact invariant sets of a Hamiltonian system by using one quadratic function of a simple form. These bounds depend on the value of the total energy of the system, degree and some coefficients of a potential and, in addition, some positive number got as a result of a solution of one maximization problem. Besides, under some quasihomogeneity condition(s) we generalize our construction of the localization set

  1. Universal localizing bounds for compact invariant sets of natural polynomial Hamiltonian systems

    Energy Technology Data Exchange (ETDEWEB)

    Starkov, Konstantin E. [CITEDI-IPN, Av. del Parque 1310, Mesa de Otay, Tijuana, BC (Mexico)], E-mail: konst@citedi.mx

    2008-10-06

    In this Letter we study the localization problem of compact invariant sets of natural Hamiltonian systems with a polynomial Hamiltonian. Our results are based on applying the first order extremum conditions. We compute universal localizing bounds for some domain containing all compact invariant sets of a Hamiltonian system by using one quadratic function of a simple form. These bounds depend on the value of the total energy of the system, degree and some coefficients of a potential and, in addition, some positive number got as a result of a solution of one maximization problem. Besides, under some quasihomogeneity condition(s) we generalize our construction of the localization set.

  2. Cocentralizing Generalized Derivations On Multilinear Polynomial On Right Ideals Of Prime Rings

    Directory of Open Access Journals (Sweden)

    Filippis Vincenzo De

    2014-03-01

    Full Text Available Let R be a prime ring with Utumi quotient ring U and with extended centroid C, I a non-zero right ideal of R ƒ (x1… xn a multilinear polynomial over C which is not central valued on R and G, H two generalized derivations of R. Suppose that G(ƒ (r ƒ (r- ƒ (rH(ƒ (r ∈ C, for all r =(r1,….,rn ∈ In. Then one of the following holds:

  3. Structural identifiability of polynomial and rational systems

    NARCIS (Netherlands)

    J. Nemcová (Jana)

    2010-01-01

    htmlabstractSince analysis and simulation of biological phenomena require the availability of their fully specified models, one needs to be able to estimate unknown parameter values of the models. In this paper we deal with identifiability of parametrizations which is the property of one-to-one

  4. Multivariable polynomial fitting of controlled single-phase nonlinear load of input current total harmonic distortion

    Science.gov (United States)

    Sikora, Roman; Markiewicz, Przemysław; Pabjańczyk, Wiesława

    2018-04-01

    The power systems usually include a number of nonlinear receivers. Nonlinear receivers are the source of disturbances generated to the power system in the form of higher harmonics. The level of these disturbances describes the total harmonic distortion coefficient THD. Its value depends on many factors. One of them are the deformation and change in RMS value of supply voltage. A modern LED luminaire is a nonlinear receiver as well. The paper presents the results of the analysis of the influence of change in RMS value of supply voltage and the level of dimming of the tested luminaire on the value of the current THD. The analysis was made using a mathematical model based on multivariable polynomial fitting.

  5. Multivariable polynomial fitting of controlled single-phase nonlinear load of input current total harmonic distortion

    Directory of Open Access Journals (Sweden)

    Sikora Roman

    2018-04-01

    Full Text Available The power systems usually include a number of nonlinear receivers. Nonlinear receivers are the source of disturbances generated to the power system in the form of higher harmonics. The level of these disturbances describes the total harmonic distortion coefficient THD. Its value depends on many factors. One of them are the deformation and change in RMS value of supply voltage. A modern LED luminaire is a nonlinear receiver as well. The paper presents the results of the analysis of the influence of change in RMS value of supply voltage and the level of dimming of the tested luminaire on the value of the current THD. The analysis was made using a mathematical model based on multivariable polynomial fitting.

  6. Interval Continuous Plant Identification from Value Sets

    Directory of Open Access Journals (Sweden)

    R. Hernández

    2012-01-01

    Full Text Available This paper shows how to obtain the values of the numerator and denominator Kharitonov polynomials of an interval plant from its value set at a given frequency. Moreover, it is proven that given a value set, all the assigned polynomials of the vertices can be determined if and only if there is a complete edge or a complete arc lying on a quadrant. This algorithm is nonconservative in the sense that if the value-set boundary of an interval plant is exactly known, and particularly its vertices, then the Kharitonov rectangles are exactly those used to obtain these value sets.

  7. Application of grafted polynomial function in forecasting cotton ...

    African Journals Online (AJOL)

    A study was conducted to forecast cotton production trend with the application of a grafted polynomial function in Nigeria from 1985 through 2013. Grafted models are used in econometrics to embark on economic analysis involving time series. In economic time series, the paucity of data and their availability has always ...

  8. A Polynomial Optimization Approach to Constant Rebalanced Portfolio Selection

    NARCIS (Netherlands)

    Takano, Y.; Sotirov, R.

    2010-01-01

    We address the multi-period portfolio optimization problem with the constant rebalancing strategy. This problem is formulated as a polynomial optimization problem (POP) by using a mean-variance criterion. In order to solve the POPs of high degree, we develop a cutting-plane algorithm based on

  9. On Dual Gabor Frame Pairs Generated by Polynomials

    DEFF Research Database (Denmark)

    Christensen, Ole; Rae Young, Kim

    2010-01-01

    We provide explicit constructions of particularly convenient dual pairs of Gabor frames. We prove that arbitrary polynomials restricted to sufficiently large intervals will generate Gabor frames, at least for small modulation parameters. Unfortunately, no similar function can generate a dual Gabo...

  10. Learning Mixtures of Polynomials of Conditional Densities from Data

    DEFF Research Database (Denmark)

    L. López-Cruz, Pedro; Nielsen, Thomas Dyhre; Bielza, Concha

    2013-01-01

    Mixtures of polynomials (MoPs) are a non-parametric density estimation technique for hybrid Bayesian networks with continuous and discrete variables. We propose two methods for learning MoP ap- proximations of conditional densities from data. Both approaches are based on learning MoP approximatio...

  11. Root and critical point behaviors of certain sums of polynomials

    Indian Academy of Sciences (India)

    Seon-Hong Kim

    2018-04-24

    Apr 24, 2018 ... Root and critical point behaviors of certain sums of polynomials. SEON-HONG KIM1,∗. , SUNG YOON KIM2, TAE HYUNG KIM2 and SANGHEON LEE2. 1Department of Mathematics, Sookmyung Women's University, Seoul 140-742, Korea. 2Gyeonggi Science High School, Suwon 440-800, Korea.

  12. Computational Technique for Teaching Mathematics (CTTM): Visualizing the Polynomial's Resultant

    Science.gov (United States)

    Alves, Francisco Regis Vieira

    2015-01-01

    We find several applications of the Dynamic System Geogebra--DSG related predominantly to the basic mathematical concepts at the context of the learning and teaching in Brasil. However, all these works were developed in the basic level of Mathematics. On the other hand, we discuss and explore, with DSG's help, some applications of the polynomial's…

  13. Polynomial modal analysis of lamellar diffraction gratings in conical mounting.

    Science.gov (United States)

    Randriamihaja, Manjakavola Honore; Granet, Gérard; Edee, Kofi; Raniriharinosy, Karyl

    2016-09-01

    An efficient numerical modal method for modeling a lamellar grating in conical mounting is presented. Within each region of the grating, the electromagnetic field is expanded onto Legendre polynomials, which allows us to enforce in an exact manner the boundary conditions that determine the eigensolutions. Our code is successfully validated by comparison with results obtained with the analytical modal method.

  14. QCD analysis of structure functions in terms of Jacobi polynomials

    International Nuclear Information System (INIS)

    Krivokhizhin, V.G.; Kurlovich, S.P.; Savin, I.A.; Sidorov, A.V.; Skachkov, N.B.; Sanadze, V.V.

    1987-01-01

    A new method of QCD-analysis of singlet and nonsinglet structure functions based on their expansion in orthogonal Jacobi polynomials is proposed. An accuracy of the method is studied and its application is demonstrated using the structure function F 2 (x,Q 2 ) obtained by the EMC Collaboration from measurements with an iron target. (orig.)

  15. Representations for the extreme zeros of orthogonal polynomials

    NARCIS (Netherlands)

    van Doorn, Erik A.; van Foreest, Nicky D.; Zeifman, Alexander I.

    2009-01-01

    We establish some representations for the smallest and largest zeros of orthogonal polynomials in terms of the parameters in the three-terms recurrence relation. As a corollary we obtain representations for the endpoints of the true interval of orthogonality. Implications of these results for the

  16. Superiority of Bessel function over Zernicke polynomial as base ...

    Indian Academy of Sciences (India)

    Abstract. Here we describe the superiority of Bessel function as base function for radial expan- sion 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 ...

  17. Simplified polynomial representation of cross sections for reactor calculation

    International Nuclear Information System (INIS)

    Dias, A.M.; Sakai, M.

    1985-01-01

    It is shown a simplified representation of a cross section library generated by transport theory using the cell model of Wigner-Seitz for typical PWR fuel elements. The effect of burnup evolution through tables of reference cross sections and the effect of the variation of the reactor operation parameters considered by adjusted polynomials are presented. (M.C.K.) [pt

  18. A fast numerical test of multivariate polynomial positiveness with applications

    Czech Academy of Sciences Publication Activity Database

    Augusta, Petr; Augustová, Petra

    2018-01-01

    Roč. 54, č. 2 (2018), s. 289-303 ISSN 0023-5954 Institutional support: RVO:67985556 Keywords : stability * multidimensional systems * positive polynomials * fast Fourier transforms * numerical algorithm Subject RIV: BC - Control Systems Theory OBOR OECD: Automation and control systems Impact factor: 0.379, year: 2016 https://www.kybernetika.cz/content/2018/2/289/paper.pdf

  19. Computing Tutte polynomials of contact networks in classrooms

    Science.gov (United States)

    Hincapié, Doracelly; Ospina, Juan

    2013-05-01

    Objective: The topological complexity of contact networks in classrooms and the potential transmission of an infectious disease were analyzed by sex and age. Methods: The Tutte polynomials, some topological properties and the number of spanning trees were used to algebraically compute the topological complexity. Computations were made with the Maple package GraphTheory. Published data of mutually reported social contacts within a classroom taken from primary school, consisting of children in the age ranges of 4-5, 7-8 and 10-11, were used. Results: The algebraic complexity of the Tutte polynomial and the probability of disease transmission increases with age. The contact networks are not bipartite graphs, gender segregation was observed especially in younger children. Conclusion: Tutte polynomials are tools to understand the topology of the contact networks and to derive numerical indexes of such topologies. It is possible to establish relationships between the Tutte polynomial of a given contact network and the potential transmission of an infectious disease within such network

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

  1. Mirror symmetry, toric branes and topological string amplitudes as polynomials

    Energy Technology Data Exchange (ETDEWEB)

    Alim, Murad

    2009-07-13

    The central theme of this thesis is the extension and application of mirror symmetry of topological string theory. The contribution of this work on the mathematical side is given by interpreting the calculated partition functions as generating functions for mathematical invariants which are extracted in various examples. Furthermore the extension of the variation of the vacuum bundle to include D-branes on compact geometries is studied. Based on previous work for non-compact geometries a system of differential equations is derived which allows to extend the mirror map to the deformation spaces of the D-Branes. Furthermore, these equations allow the computation of the full quantum corrected superpotentials which are induced by the D-branes. Based on the holomorphic anomaly equation, which describes the background dependence of topological string theory relating recursively loop amplitudes, this work generalizes a polynomial construction of the loop amplitudes, which was found for manifolds with a one dimensional space of deformations, to arbitrary target manifolds with arbitrary dimension of the deformation space. The polynomial generators are determined and it is proven that the higher loop amplitudes are polynomials of a certain degree in the generators. Furthermore, the polynomial construction is generalized to solve the extension of the holomorphic anomaly equation to D-branes without deformation space. This method is applied to calculate higher loop amplitudes in numerous examples and the mathematical invariants are extracted. (orig.)

  2. Riesz transforms and Lie groups of polynomial growth

    NARCIS (Netherlands)

    Elst, ter A.F.M.; Robinson, D.W.; Sikora, A.

    1999-01-01

    Let G be a Lie group of polynomial growth. We prove that the second-order Riesz transforms onL2(G; dg) are bounded if, and only if, the group is a direct product of a compact group and a nilpotent group, in which case the transforms of all orders are bounded.

  3. Explicitly solvable complex Chebyshev approximation problems related to sine polynomials

    Science.gov (United States)

    Freund, Roland

    1989-01-01

    Explicitly solvable real Chebyshev approximation problems on the unit interval are typically characterized by simple error curves. A similar principle is presented for complex approximation problems with error curves induced by sine polynomials. As an application, some new explicit formulae for complex best approximations are derived.

  4. Polynomial constitutive model for shape memory and pseudo elasticity

    International Nuclear Information System (INIS)

    Savi, M.A.; Kouzak, Z.

    1995-01-01

    This paper reports an one-dimensional phenomenological constitutive model for shape memory and pseudo elasticity using a polynomial expression for the free energy which is based on the classical Devonshire theory. This study identifies the main characteristics of the classical theory and introduces a simple modification to obtain better results. (author). 9 refs., 6 figs

  5. Weighted Polynomial Approximation for Automated Detection of Inspiratory Flow Limitation

    Directory of Open Access Journals (Sweden)

    Sheng-Cheng Huang

    2017-01-01

    Full Text Available Inspiratory flow limitation (IFL is a critical symptom of sleep breathing disorders. A characteristic flattened flow-time curve indicates the presence of highest resistance flow limitation. This study involved investigating a real-time algorithm for detecting IFL during sleep. Three categories of inspiratory flow shape were collected from previous studies for use as a development set. Of these, 16 cases were labeled as non-IFL and 78 as IFL which were further categorized into minor level (20 cases and severe level (58 cases of obstruction. In this study, algorithms using polynomial functions were proposed for extracting the features of IFL. Methods using first- to third-order polynomial approximations were applied to calculate the fitting curve to obtain the mean absolute error. The proposed algorithm is described by the weighted third-order (w.3rd-order polynomial function. For validation, a total of 1,093 inspiratory breaths were acquired as a test set. The accuracy levels of the classifications produced by the presented feature detection methods were analyzed, and the performance levels were compared using a misclassification cobweb. According to the results, the algorithm using the w.3rd-order polynomial approximation achieved an accuracy of 94.14% for IFL classification. We concluded that this algorithm achieved effective automatic IFL detection during sleep.

  6. A Genetic algorithm for evaluating the zeros (roots) of polynomial ...

    African Journals Online (AJOL)

    This paper presents a Genetic Algorithm software (which is a computational, search technique) for finding the zeros (roots) of any given polynomial function, and optimizing and solving N-dimensional systems of equations. The software is particularly useful since most of the classic schemes are not all embracing.

  7. Global sensitivity analysis using sparse grid interpolation and polynomial chaos

    International Nuclear Information System (INIS)

    Buzzard, Gregery T.

    2012-01-01

    Sparse grid interpolation is widely used to provide good approximations to smooth functions in high dimensions based on relatively few function evaluations. By using an efficient conversion from the interpolating polynomial provided by evaluations on a sparse grid to a representation in terms of orthogonal polynomials (gPC representation), we show how to use these relatively few function evaluations to estimate several types of sensitivity coefficients and to provide estimates on local minima and maxima. First, we provide a good estimate of the variance-based sensitivity coefficients of Sobol' (1990) [1] and then use the gradient of the gPC representation to give good approximations to the derivative-based sensitivity coefficients described by Kucherenko and Sobol' (2009) [2]. Finally, we use the package HOM4PS-2.0 given in Lee et al. (2008) [3] to determine the critical points of the interpolating polynomial and use these to determine the local minima and maxima of this polynomial. - Highlights: ► Efficient estimation of variance-based sensitivity coefficients. ► Efficient estimation of derivative-based sensitivity coefficients. ► Use of homotopy methods for approximation of local maxima and minima.

  8. Simplified polynomial digital predistortion for multimode software defined radios

    DEFF Research Database (Denmark)

    Kardaras, Georgios; Soler, José; Dittmann, Lars

    2010-01-01

    a simplified approach using polynomial digital predistortion in the intermediated frequency (IF) domain. It is fully implementable in software and no hardware changes are required on the digital or analog platform. The adaptation algorithm selected was Least Mean Squares because of its relevant simplicity...

  9. Polynomial kernels for deletion to classes of acyclic digraphs

    NARCIS (Netherlands)

    Mnich, Matthias; van Leeuwen, E.J.

    2017-01-01

    We consider the problem to find a set X of vertices (or arcs) with |X| ≤ k in a given digraph G such that D = G − X is an acyclic digraph. In its generality, this is Directed Feedback Vertex Set (or Directed Feedback Arc Set); the existence of a polynomial kernel for these problems is a notorious

  10. Lie-theoretic generating relations of two variable Laguerre polynomials

    International Nuclear Information System (INIS)

    Khan, Subuhi; Yasmin, Ghazala

    2002-07-01

    Generating relations involving two variable Lagneire polynonuals L n (x, y) are derived. The process involves the construction of a three dimensional Lie algebra isomorphic to special linear algebra sl(2) with the help of Weisner's method by giving suitable interpretations to the index n of the polynomials L n (x, y). (author)

  11. Differentiation by integration using orthogonal polynomials, a survey

    NARCIS (Netherlands)

    Diekema, E.; Koornwinder, T.H.

    2012-01-01

    This survey paper discusses the history of approximation formulas for n-th order derivatives by integrals involving orthogonal polynomials. There is a large but rather disconnected corpus of literature on such formulas. We give some results in greater generality than in the literature. Notably we

  12. Tsallis p, q-deformed Touchard polynomials and Stirling numbers

    Science.gov (United States)

    Herscovici, O.; Mansour, T.

    2017-01-01

    In this paper, we develop and investigate a new two-parametrized deformation of the Touchard polynomials, based on the definition of the NEXT q-exponential function of Tsallis. We obtain new generalizations of the Stirling numbers of the second kind and of the binomial coefficients and represent two new statistics for the set partitions.

  13. Optimum short-time polynomial regression for signal analysis

    Indian Academy of Sciences (India)

    A Sreenivasa Murthy

    the Proceedings of European Signal Processing Conference. (EUSIPCO) 2008. ... In a seminal paper, Savitzky and Golay [4] showed that short-time polynomial modeling is ...... We next consider a linearly frequency-modulated chirp with an exponentially .... 1 http://www.physionet.org/physiotools/matlab/ECGwaveGen/.

  14. on the performance of Autoregressive Moving Average Polynomial

    African Journals Online (AJOL)

    Timothy Ademakinwa

    estimated using least squares and Newton Raphson iterative methods. To determine the order of the ... r is the degree of polynomial while j is the number of lag of the ..... use a real time series dataset, monthly rainfall and temperature series ...

  15. Explicit formulae for the generalized Hermite polynomials in superspace

    International Nuclear Information System (INIS)

    Desrosiers, Patrick; Lapointe, Luc; Mathieu, Pierre

    2004-01-01

    We provide explicit formulae for the orthogonal eigenfunctions of the supersymmetric extension of the rational Calogero-Moser-Sutherland model with harmonic confinement, i.e., the generalized Hermite (or Hi-Jack) polynomials in superspace. The construction relies on the triangular action of the Hamiltonian on the supermonomial basis. This translates into determinantal expressions for the Hamiltonian's eigenfunctions

  16. Szegö Kernels and Asymptotic Expansions for Legendre Polynomials

    Directory of Open Access Journals (Sweden)

    Roberto Paoletti

    2017-01-01

    Full Text Available We present a geometric approach to the asymptotics of the Legendre polynomials Pk,n+1, based on the Szegö kernel of the Fermat quadric hypersurface, leading to complete asymptotic expansions holding on expanding subintervals of [-1,1].

  17. A polynomial optimization approach to constant rebalanced portfolio selection

    NARCIS (Netherlands)

    Takano, Y.; Sotirov, R.

    2012-01-01

    We address the multi-period portfolio optimization problem with the constant rebalancing strategy. This problem is formulated as a polynomial optimization problem (POP) by using a mean-variance criterion. In order to solve the POPs of high degree, we develop a cutting-plane algorithm based on

  18. Mirror symmetry, toric branes and topological string amplitudes as polynomials

    International Nuclear Information System (INIS)

    Alim, Murad

    2009-01-01

    The central theme of this thesis is the extension and application of mirror symmetry of topological string theory. The contribution of this work on the mathematical side is given by interpreting the calculated partition functions as generating functions for mathematical invariants which are extracted in various examples. Furthermore the extension of the variation of the vacuum bundle to include D-branes on compact geometries is studied. Based on previous work for non-compact geometries a system of differential equations is derived which allows to extend the mirror map to the deformation spaces of the D-Branes. Furthermore, these equations allow the computation of the full quantum corrected superpotentials which are induced by the D-branes. Based on the holomorphic anomaly equation, which describes the background dependence of topological string theory relating recursively loop amplitudes, this work generalizes a polynomial construction of the loop amplitudes, which was found for manifolds with a one dimensional space of deformations, to arbitrary target manifolds with arbitrary dimension of the deformation space. The polynomial generators are determined and it is proven that the higher loop amplitudes are polynomials of a certain degree in the generators. Furthermore, the polynomial construction is generalized to solve the extension of the holomorphic anomaly equation to D-branes without deformation space. This method is applied to calculate higher loop amplitudes in numerous examples and the mathematical invariants are extracted. (orig.)

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

    Energy Technology Data Exchange (ETDEWEB)

    Ahlfeld, R., E-mail: r.ahlfeld14@imperial.ac.uk; 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

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

    International Nuclear Information System (INIS)

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

    2016-01-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

  1. Zernike polynomial based Rayleigh-Ritz model of a piezoelectric unimorph deformable mirror

    CSIR Research Space (South Africa)

    Long, CS

    2012-04-01

    Full Text Available , are routinely and conveniently described using Zernike polynomials. A Rayleigh-Ritz structural model, which uses Zernike polynomials directly to describe the displacements, is proposed in this paper. The proposed formulation produces a numerically inexpensive...

  2. Application of Chybeshev Polynomials in Factorizations of Balancing and Lucas-Balancing Numbers

    Directory of Open Access Journals (Sweden)

    Prasanta Kumar Ray

    2012-01-01

    Full Text Available In this paper, with the help of orthogonal polynomial especially Chybeshev polynomials of first and second kind, number theory and linear algebra intertwined to yield factorization of the balancing and Lucas-balancing numbers.

  3. Polynomial meta-models with canonical low-rank approximations: Numerical insights and comparison to sparse polynomial chaos expansions

    Energy Technology Data Exchange (ETDEWEB)

    Konakli, Katerina, E-mail: konakli@ibk.baug.ethz.ch; Sudret, Bruno

    2016-09-15

    The growing need for uncertainty analysis of complex computational models has led to an expanding use of meta-models across engineering and sciences. The efficiency of meta-modeling techniques relies on their ability to provide statistically-equivalent analytical representations based on relatively few evaluations of the original model. Polynomial chaos expansions (PCE) have proven a powerful tool for developing meta-models in a wide range of applications; the key idea thereof is to expand the model response onto a basis made of multivariate polynomials obtained as tensor products of appropriate univariate polynomials. The classical PCE approach nevertheless faces the “curse of dimensionality”, namely the exponential increase of the basis size with increasing input dimension. To address this limitation, the sparse PCE technique has been proposed, in which the expansion is carried out on only a few relevant basis terms that are automatically selected by a suitable algorithm. An alternative for developing meta-models with polynomial functions in high-dimensional problems is offered by the newly emerged low-rank approximations (LRA) approach. By exploiting the tensor–product structure of the multivariate basis, LRA can provide polynomial representations in highly compressed formats. Through extensive numerical investigations, we herein first shed light on issues relating to the construction of canonical LRA with a particular greedy algorithm involving a sequential updating of the polynomial coefficients along separate dimensions. Specifically, we examine the selection of optimal rank, stopping criteria in the updating of the polynomial coefficients and error estimation. In the sequel, we confront canonical LRA to sparse PCE in structural-mechanics and heat-conduction applications based on finite-element solutions. Canonical LRA exhibit smaller errors than sparse PCE in cases when the number of available model evaluations is small with respect to the input

  4. Polynomial meta-models with canonical low-rank approximations: Numerical insights and comparison to sparse polynomial chaos expansions

    International Nuclear Information System (INIS)

    Konakli, Katerina; Sudret, Bruno

    2016-01-01

    The growing need for uncertainty analysis of complex computational models has led to an expanding use of meta-models across engineering and sciences. The efficiency of meta-modeling techniques relies on their ability to provide statistically-equivalent analytical representations based on relatively few evaluations of the original model. Polynomial chaos expansions (PCE) have proven a powerful tool for developing meta-models in a wide range of applications; the key idea thereof is to expand the model response onto a basis made of multivariate polynomials obtained as tensor products of appropriate univariate polynomials. The classical PCE approach nevertheless faces the “curse of dimensionality”, namely the exponential increase of the basis size with increasing input dimension. To address this limitation, the sparse PCE technique has been proposed, in which the expansion is carried out on only a few relevant basis terms that are automatically selected by a suitable algorithm. An alternative for developing meta-models with polynomial functions in high-dimensional problems is offered by the newly emerged low-rank approximations (LRA) approach. By exploiting the tensor–product structure of the multivariate basis, LRA can provide polynomial representations in highly compressed formats. Through extensive numerical investigations, we herein first shed light on issues relating to the construction of canonical LRA with a particular greedy algorithm involving a sequential updating of the polynomial coefficients along separate dimensions. Specifically, we examine the selection of optimal rank, stopping criteria in the updating of the polynomial coefficients and error estimation. In the sequel, we confront canonical LRA to sparse PCE in structural-mechanics and heat-conduction applications based on finite-element solutions. Canonical LRA exhibit smaller errors than sparse PCE in cases when the number of available model evaluations is small with respect to the input

  5. A high-order q-difference equation for q-Hahn multiple orthogonal polynomials

    DEFF Research Database (Denmark)

    Arvesú, J.; Esposito, Chiara

    2012-01-01

    A high-order linear q-difference equation with polynomial coefficients having q-Hahn multiple orthogonal polynomials as eigenfunctions is given. The order of the equation coincides with the number of orthogonality conditions that these polynomials satisfy. Some limiting situations when are studie....... Indeed, the difference equation for Hahn multiple orthogonal polynomials given in Lee [J. Approx. Theory (2007), ), doi: 10.1016/j.jat.2007.06.002] is obtained as a limiting case....

  6. Some properties of generalized self-reciprocal polynomials over finite fields

    Directory of Open Access Journals (Sweden)

    Ryul Kim

    2014-07-01

    Full Text Available Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal polynomials and characterize the parity of the number of irreducible factors for a-self reciprocal polynomials over finite fields of odd characteristic.

  7. Numerical study of nonlinear singular fractional differential equations arising in biology by operational matrix of shifted Legendre polynomials

    Directory of Open Access Journals (Sweden)

    D. Jabari Sabeg

    2016-10-01

    Full Text Available In this paper, we present a new computational method for solving nonlinear singular boundary value problems of fractional order arising in biology. To this end, we apply the operational matrices of derivatives of shifted Legendre polynomials to reduce such problems to a system of nonlinear algebraic equations. To demonstrate the validity and applicability of the presented method, we present some numerical examples.

  8. Limit cycles bifurcating from the periodic annulus of cubic homogeneous polynomial centers

    Directory of Open Access Journals (Sweden)

    Jaume Llibre

    2015-10-01

    Full Text Available We obtain an explicit polynomial whose simple positive real roots provide the limit cycles which bifurcate from the periodic orbits of any cubic homogeneous polynomial center when it is perturbed inside the class of all polynomial differential systems of degree n.

  9. Bernoulli numbers and polynomials from a more general point of view

    International Nuclear Information System (INIS)

    Dattoli, G.; Cesarano, C.; Lorenzutta, S.

    2000-01-01

    In this work it is applied the method of generating function, to introduce new forms of Bernoulli numbers and polynomials, which are exploited to derive further classes of partial sums involving generalized many index many variable polynomials. Analogous considerations are developed for the Euler numbers and polynomials [it

  10. On associated polynomials and decay rates for birth-death processes

    NARCIS (Netherlands)

    van Doorn, Erik A.

    2001-01-01

    We consider sequences of orthogonal polynomials and pursue the question of how (partial) knowledge of the orthogonalizing measure for the {\\it associated polynomials} can lead to information about the orthogonalizing measure for the original polynomials. In particular, we relate the supports of the

  11. On associated polynomials and decay rates for birth-death processes

    NARCIS (Netherlands)

    van Doorn, Erik A.

    2003-01-01

    We consider sequences of orthogonal polynomials and pursue the question of how (partial) knowledge of the orthogonalizing measure for the associated polynomials can lead to information about the orthogonalizing measure for the original polynomials. In particular, we relate the supports of the two

  12. A note on the zeros of Freud-Sobolev orthogonal polynomials

    Science.gov (United States)

    Moreno-Balcazar, Juan J.

    2007-10-01

    We prove that the zeros of a certain family of Sobolev orthogonal polynomials involving the Freud weight function e-x4 on are real, simple, and interlace with the zeros of the Freud polynomials, i.e., those polynomials orthogonal with respect to the weight function e-x4. Some numerical examples are shown.

  13. Design and Use of a Learning Object for Finding Complex Polynomial Roots

    Science.gov (United States)

    Benitez, Julio; Gimenez, Marcos H.; Hueso, Jose L.; Martinez, Eulalia; Riera, Jaime

    2013-01-01

    Complex numbers are essential in many fields of engineering, but students often fail to have a natural insight of them. We present a learning object for the study of complex polynomials that graphically shows that any complex polynomials has a root and, furthermore, is useful to find the approximate roots of a complex polynomial. Moreover, we…

  14. Generalizations of an integral for Legendre polynomials by Persson and Strang

    NARCIS (Netherlands)

    Diekema, E.; Koornwinder, T.H.

    2012-01-01

    Persson and Strang (2003) evaluated the integral over [−1,1] of a squared odd degree Legendre polynomial divided by x2 as being equal to 2. We consider a similar integral for orthogonal polynomials with respect to a general even orthogonality measure, with Gegenbauer and Hermite polynomials as

  15. Valuing Equality in Irish Social Care

    Directory of Open Access Journals (Sweden)

    Niall Hanlon

    2009-01-01

    Full Text Available In this article the author critiques Irish social care by presenting an equality perspective on practice. An equality perspective involves developing emancipatory practices, that is, ways of helping that provide egalitarian solutions and outcomes. Although emancipatory values are often contrasted with traditional social care values, the author seeks a pragmatic and integrated approach to emancipatory practices rather than a restatement of traditional dichotomies. Emancipatory practice begins with an appreciation of the nature and relevance of inequalities on the lives of diverse social care users. Building a commitment to equality within social care education and practice is an important step in altering many individual and institutional social care practices by focussing on equality processes and outcomes as central social care objectives. Using a well credited framework that outlines five dimensions of inequality (Baker, Lynch, Cantillon and Walsh, 2004, the author argues that social care educators and practitioners need to debate the issues raised and develop emancipatory practices.

  16. Design of a polynomial ring based symmetric homomorphic encryption scheme

    Directory of Open Access Journals (Sweden)

    Smaranika Dasgupta

    2016-09-01

    Full Text Available Security of data, especially in clouds, has become immensely essential for present-day applications. Fully homomorphic encryption (FHE is a great way to secure data which is used and manipulated by untrusted applications or systems. In this paper, we propose a symmetric FHE scheme based on polynomial over ring of integers. This scheme is somewhat homomorphic due to accumulation of noise after few operations, which is made fully homomorphic using a refresh procedure. After certain amount of homomorphic computations, large ciphertexts are refreshed for proper decryption. The hardness of the scheme is based on the difficulty of factorizing large integers. Also, it requires polynomial addition which is computationally cost effective. Experimental results are shown to support our claim.

  17. Image Compression Based On Wavelet, Polynomial and Quadtree

    Directory of Open Access Journals (Sweden)

    Bushra A. SULTAN

    2011-01-01

    Full Text Available In this paper a simple and fast image compression scheme is proposed, it is based on using wavelet transform to decompose the image signal and then using polynomial approximation to prune the smoothing component of the image band. The architect of proposed coding scheme is high synthetic where the error produced due to polynomial approximation in addition to the detail sub-band data are coded using both quantization and Quadtree spatial coding. As a last stage of the encoding process shift encoding is used as a simple and efficient entropy encoder to compress the outcomes of the previous stage.The test results indicate that the proposed system can produce a promising compression performance while preserving the image quality level.

  18. Optimization of polynomials in non-commuting variables

    CERN Document Server

    Burgdorf, Sabine; Povh, Janez

    2016-01-01

    This book presents recent results on positivity and optimization of polynomials in non-commuting variables. Researchers in non-commutative algebraic geometry, control theory, system engineering, optimization, quantum physics and information science will find the unified notation and mixture of algebraic geometry and mathematical programming useful. Theoretical results are matched with algorithmic considerations; several examples and information on how to use NCSOStools open source package to obtain the results provided. Results are presented on detecting the eigenvalue and trace positivity of polynomials in non-commuting variables using Newton chip method and Newton cyclic chip method, relaxations for constrained and unconstrained optimization problems, semidefinite programming formulations of the relaxations and finite convergence of the hierarchies of these relaxations, and the practical efficiency of algorithms.

  19. Uncertainty Quantification in Simulations of Epidemics Using Polynomial Chaos

    Directory of Open Access Journals (Sweden)

    F. Santonja

    2012-01-01

    Full Text Available Mathematical models based on ordinary differential equations are a useful tool to study the processes involved in epidemiology. Many models consider that the parameters are deterministic variables. But in practice, the transmission parameters present large variability and it is not possible to determine them exactly, and it is necessary to introduce randomness. In this paper, we present an application of the polynomial chaos approach to epidemiological mathematical models based on ordinary differential equations with random coefficients. Taking into account the variability of the transmission parameters of the model, this approach allows us to obtain an auxiliary system of differential equations, which is then integrated numerically to obtain the first-and the second-order moments of the output stochastic processes. A sensitivity analysis based on the polynomial chaos approach is also performed to determine which parameters have the greatest influence on the results. As an example, we will apply the approach to an obesity epidemic model.

  20. Statistics of stationary points of random finite polynomial potentials

    International Nuclear Information System (INIS)

    Mehta, Dhagash; Niemerg, Matthew; Sun, Chuang

    2015-01-01

    The stationary points (SPs) of the potential energy landscapes (PELs) of multivariate random potentials (RPs) have found many applications in many areas of Physics, Chemistry and Mathematical Biology. However, there are few reliable methods available which can find all the SPs accurately. Hence, one has to rely on indirect methods such as Random Matrix theory. With a combination of the numerical polynomial homotopy continuation method and a certification method, we obtain all the certified SPs of the most general polynomial RP for each sample chosen from the Gaussian distribution with mean 0 and variance 1. While obtaining many novel results for the finite size case of the RP, we also discuss the implications of our results on mathematics of random systems and string theory landscapes. (paper)

  1. M-Polynomials and Topological Indices of Titania Nanotubes

    Directory of Open Access Journals (Sweden)

    Mobeen Munir

    2016-10-01

    Full Text Available Titania is one of the most comprehensively studied nanostructures due to their widespread applications in the production of catalytic, gas sensing, and corrosion-resistant materials. M-polynomial of nanotubes has been vastly investigated, as it produces many degree-based topological indices, which are numerical parameters capturing structural and chemical properties. These indices are used in the development of quantitative structure-activity relationships (QSARs in which the biological activity and other properties of molecules, such as boiling point, stability, strain energy, etc., are correlated with their structure. In this report, we provide M-polynomials of single-walled titania (SW TiO2 nanotubes and recover important topological degree-based indices to theoretically judge these nanotubes. We also plot surfaces associated to single-walled titania (SW TiO2 nanotubes.

  2. Eigenvalues of PT-symmetric oscillators with polynomial potentials

    International Nuclear Information System (INIS)

    Shin, Kwang C

    2005-01-01

    We study the eigenvalue problem -u''(z) - [(iz) m + P m-1 (iz)]u(z) λu(z) with the boundary condition that u(z) decays to zero as z tends to infinity along the rays arg z = -π/2 ± 2π/(m+2) in the complex plane, where P m-1 (z) = a 1 z m-1 + a 2 z m-2 + . . . + a m-1 z is a polynomial and integers m ≥ 3. We provide an asymptotic expansion of the eigenvalues λ n as n → +∞, and prove that for each real polynomial P m-1 , the eigenvalues are all real and positive, with only finitely many exceptions

  3. Symmetric integrable-polynomial factorization for symplectic one-turn-map tracking

    International Nuclear Information System (INIS)

    Shi, Jicong

    1993-01-01

    It was found that any homogeneous polynomial can be written as a sum of integrable polynomials of the same degree which Lie transformations can be evaluated exactly. By utilizing symplectic integrators, an integrable-polynomial factorization is developed to convert a symplectic map in the form of Dragt-Finn factorization into a product of Lie transformations associated with integrable polynomials. A small number of factorization bases of integrable polynomials enable one to use high order symplectic integrators so that the high-order spurious terms can be greatly suppressed. A symplectic map can thus be evaluated with desired accuracy

  4. On Some Extensions of Szasz Operators Including Boas-Buck-Type Polynomials

    Directory of Open Access Journals (Sweden)

    Sezgin Sucu

    2012-01-01

    Full Text Available This paper is concerned with a new sequence of linear positive operators which generalize Szasz operators including Boas-Buck-type polynomials. We establish a convergence theorem for these operators and give the quantitative estimation of the approximation process by using a classical approach and the second modulus of continuity. Some explicit examples of our operators involving Laguerre polynomials, Charlier polynomials, and Gould-Hopper polynomials are given. Moreover, a Voronovskaya-type result is obtained for the operators containing Gould-Hopper polynomials.

  5. Expansion of Sobolev functions in series in Laguerre polynomials

    International Nuclear Information System (INIS)

    Selyakov, K.I.

    1985-01-01

    The solution of the integral equation for the Sobolev functions is represented in the form of series in Laguerre polynomials. The coefficients of these series are simultaneously the coefficients of the power series for the Ambartsumyan-Chandrasekhar H functions. Infinite systems of linear algebraic equations with Toeplitz matrices are given for the coefficients of the series. Numerical results and approximate expressions are given for the case of isotropic scattering

  6. Exact Polynomial Eigenmodes for Homogeneous Spherical 3-Manifolds

    OpenAIRE

    Weeks, Jeffrey R.

    2005-01-01

    Observational data hints at a finite universe, with spherical manifolds such as the Poincare dodecahedral space tentatively providing the best fit. Simulating the physics of a model universe requires knowing the eigenmodes of the Laplace operator on the space. The present article provides explicit polynomial eigenmodes for all globally homogeneous 3-manifolds: the Poincare dodecahedral space S3/I*, the binary octahedral space S3/O*, the binary tetrahedral space S3/T*, the prism manifolds S3/D...

  7. Popov form computation for matrices of Ore polynomials

    DEFF Research Database (Denmark)

    Khochtali, Mohamed; Né Nielsen, Johan Rosenkilde; Storjohann, Arne

    2017-01-01

    Let F[∂; s, d] be a ring of Ore polynomials over a field. We give a new deterministic algorithm for computing the Popov form P of a non-singular matrix A ∈ F[∂; s, d]n×n. Our main focus is to ensure controlled growth in the size of coefficients from F in the case F = k(z), and even k = Q. Our...

  8. First-Order Polynomial Heisenberg Algebras and Coherent States

    International Nuclear Information System (INIS)

    Castillo-Celeita, M; Fernández C, D J

    2016-01-01

    The polynomial Heisenberg algebras (PHA) are deformations of the Heisenberg- Weyl algebra characterizing the underlying symmetry of the supersymmetric partners of the Harmonic oscillator. When looking for the simplest system ruled by PHA, however, we end up with the harmonic oscillator. In this paper we are going to realize the first-order PHA through the harmonic oscillator. The associated coherent states will be also constructed, which turn out to be the well known even and odd coherent states. (paper)

  9. Bifurcation in Z2-symmetry quadratic polynomial systems with delay

    International Nuclear Information System (INIS)

    Zhang Chunrui; Zheng Baodong

    2009-01-01

    Z 2 -symmetry systems are considered. Firstly the general forms of Z 2 -symmetry quadratic polynomial system are given, and then a three-dimensional Z 2 equivariant system is considered, which describes the relations of two predator species for a single prey species. Finally, the explicit formulas for determining the Fold and Hopf bifurcations are obtained by using the normal form theory and center manifold argument.

  10. Erratum to: “Polynomial algebras on classical Banach spaces”

    Czech Academy of Sciences Publication Activity Database

    D'Alessandro, Stefania; Hájek, Petr Pavel; Johanis, M.

    2015-01-01

    Roč. 207, č. 2 (2015), s. 1003-1012 ISSN 0021-2172 R&D Projects: GA ČR(CZ) GAP201/11/0345; GA MŠk(CZ) 7AMB12FR003 Institutional support: RVO:67985840 Keywords : Banach space * polynomial algebra Subject RIV: BA - General Mathematics Impact factor: 0.738, year: 2015 http://link.springer.com/article/10.1007%2Fs11856-015-1155-y

  11. Some Formulas for the Polynomials and Topological Indices of Nanostructures

    Directory of Open Access Journals (Sweden)

    Soleimani Najmeh

    2016-12-01

    Full Text Available In this paper, we focus on the structure of Polycyclic Aromatic Hydrocarbons (PAHs and calculate the Omega and its related counting polynomials of nanostructures. Also, the exact expressions for the Theta, Sadhana, Pi, Hyper Zagreb and Forgotten Zagreb indices of linear [n]-Tetracene, V-Tetracenic nanotube, H-Tetracenic nanotube and Tetracenic nanotori were computed for the first time. These indices can be used in QSAR/QSPR studies.

  12. Global structure of a polynomial autonomous system on the plane

    International Nuclear Information System (INIS)

    Nguyen Van Chau.

    1991-10-01

    This note is to study the global behaviour of a polynomial autonomous system on the plane with divergence non-positive outside a bounded set. It is shown that in some certain conditions the global structure of such system can be simple. The main result here can be seen as an improvement of the result of Olech and Meister concerning with the global asymptotical stable conjecture of Markur and Yamable and the Jacobian Conjecture. (author). 13 refs

  13. Tripartite to Bipartite Entanglement Transformations and Polynomial Identity Testing

    OpenAIRE

    Chitambar, Eric; Duan, Runyao; Shi, Yaoyun

    2009-01-01

    We consider the problem of deciding if a given three-party entangled pure state can be converted, with a non-zero success probability, into a given two-party pure state through local quantum operations and classical communication. We show that this question is equivalent to the well-known computational problem of deciding if a multivariate polynomial is identically zero. Efficient randomized algorithms developed to study the latter can thus be applied to the question of tripartite to bipartit...

  14. Polynomials associated with equilibria of affine Toda-Sutherland systems

    International Nuclear Information System (INIS)

    Odake, S; Sasaki, R

    2004-01-01

    An affine Toda-Sutherland system is a quasi-exactly solvable multi-particle dynamics based on an affine simple root system. It is a 'cross' between two well-known integrable multi-particle dynamics, an affine Toda molecule (exponential potential, periodic nearest-neighbour interaction) and a Sutherland system (inverse sine-square interaction). Polynomials describing the equilibrium positions of affine Toda-Sutherland systems are determined for all affine simple root systems

  15. Polynomial model inversion control: numerical tests and applications

    OpenAIRE

    Novara, Carlo

    2015-01-01

    A novel control design approach for general nonlinear systems is described in this paper. The approach is based on the identification of a polynomial model of the system to control and on the on-line inversion of this model. Extensive simulations are carried out to test the numerical efficiency of the approach. Numerical examples of applicative interest are presented, concerned with control of the Duffing oscillator, control of a robot manipulator and insulin regulation in a type 1 diabetic p...

  16. Positive polynomials and robust stabilization with fixed-order controllers

    Czech Academy of Sciences Publication Activity Database

    Henrion, Didier; Šebek, M.; Kučera, V.

    2003-01-01

    Roč. 48, č. 7 (2003), s. 1178-1186 ISSN 0018-9286 R&D Projects: GA ČR GA102/02/0709; GA MŠk ME 496 Institutional research plan: CEZ:AV0Z1075907 Keywords : fixed-order control lers * linear matrix inequality * polynomials, robust control Subject RIV: BC - Control Systems Theory Impact factor: 1.896, year: 2003

  17. Zeros of Wronskians of Hermite polynomials and Young diagrams

    Science.gov (United States)

    Felder, G.; Hemery, A. D.; Veselov, A. P.

    2012-12-01

    For a certain class of partitions, a simple qualitative relation is observed between the shape of the Young diagram and the pattern of zeros of the Wronskian of the corresponding Hermite polynomials. In the case of the two-term Wronskian W(Hn,Hn+k), we give an explicit formula for the asymptotic shape of the zero set as n→∞. Some empirical asymptotic formulas are given for the zero sets of three-term and four-term Wronskians.

  18. Algebraic invariant curves of plane polynomial differential systems

    Science.gov (United States)

    Tsygvintsev, Alexei

    2001-01-01

    We consider a plane polynomial vector field P(x,y) dx + Q(x,y) dy of degree m>1. With each algebraic invariant curve of such a field we associate a compact Riemann surface with the meromorphic differential ω = dx/P = dy/Q. The asymptotic estimate of the degree of an arbitrary algebraic invariant curve is found. In the smooth case this estimate has already been found by Cerveau and Lins Neto in a different way.

  19. New realisation of Preisach model using adaptive polynomial approximation

    Science.gov (United States)

    Liu, Van-Tsai; Lin, Chun-Liang; Wing, Home-Young

    2012-09-01

    Modelling system with hysteresis has received considerable attention recently due to the increasing accurate requirement in engineering applications. The classical Preisach model (CPM) is the most popular model to demonstrate hysteresis which can be represented by infinite but countable first-order reversal curves (FORCs). The usage of look-up tables is one way to approach the CPM in actual practice. The data in those tables correspond with the samples of a finite number of FORCs. This approach, however, faces two major problems: firstly, it requires a large amount of memory space to obtain an accurate prediction of hysteresis; secondly, it is difficult to derive efficient ways to modify the data table to reflect the timing effect of elements with hysteresis. To overcome, this article proposes the idea of using a set of polynomials to emulate the CPM instead of table look-up. The polynomial approximation requires less memory space for data storage. Furthermore, the polynomial coefficients can be obtained accurately by using the least-square approximation or adaptive identification algorithm, such as the possibility of accurate tracking of hysteresis model parameters.

  20. Design of reinforced areas of concrete column using quadratic polynomials

    Science.gov (United States)

    Arif Gunadi, Tjiang; Parung, Herman; Rachman Djamaluddin, Abd; Arwin Amiruddin, A.

    2017-11-01

    Designing of reinforced concrete columns mostly carried out by a simple planning method which uses column interaction diagram. However, the application of this method is limited because it valids only for certain compressive strenght of the concrete and yield strength of the reinforcement. Thus, a more applicable method is still in need. Another method is the use of quadratic polynomials as a basis for the approach in designing reinforced concrete columns, where the ratio of neutral lines to the effective height of a cross section (ξ) if associated with ξ in the same cross-section with different reinforcement ratios is assumed to form a quadratic polynomial. This is identical to the basic principle used in the Simpson rule for numerical integral using quadratic polynomials and had a sufficiently accurate level of accuracy. The basis of this approach to be used both the normal force equilibrium and the moment equilibrium. The abscissa of the intersection of the two curves is the ratio that had been mentioned, since it fulfill both of the equilibrium. The application of this method is relatively more complicated than the existing method but provided with tables and graphs (N vs ξN ) and (M vs ξM ) so that its used could be simplified. The uniqueness of these tables are only distinguished based on the compresssive strength of the concrete, so in application it could be combined with various yield strenght of the reinforcement available in the market. This method could be solved by using programming languages such as Fortran.