Information entropy of Gegenbauer polynomials and Gaussian quadrature

NASA Astrophysics Data System (ADS)

Sánchez-Ruiz, Jorge

2003-05-01

In a recent paper (Buyarov V S, López-Artés P, Martínez-Finkelshtein A and Van Assche W 2000 J. Phys. A: Math. Gen. 33 6549-60), an efficient method was provided for evaluating in closed form the information entropy of the Gegenbauer polynomials C(lambda)n(x) in the case when lambda = l in Bbb N. For given values of n and l, this method requires the computation by means of recurrence relations of two auxiliary polynomials, P(x) and H(x), of degrees 2l - 2 and 2l - 4, respectively. Here it is shown that P(x) is related to the coefficients of the Gaussian quadrature formula for the Gegenbauer weights wl(x) = (1 - x2)l-1/2, and this fact is used to obtain the explicit expression of P(x). From this result, an explicit formula is also given for the polynomial S(x) = limnrightarrowinfty P(1 - x/(2n2)), which is relevant to the study of the asymptotic (n rightarrow infty with l fixed) behaviour of the entropy.

New formulae between Jacobi polynomials and some fractional Jacobi functions generalizing some connection formulae

NASA Astrophysics Data System (ADS)

Abd-Elhameed, W. M.

2017-07-01

In this paper, a new formula relating Jacobi polynomials of arbitrary parameters with the squares of certain fractional Jacobi functions is derived. The derived formula is expressed in terms of a certain terminating hypergeometric function of the type _4F3(1) . With the aid of some standard reduction formulae such as Pfaff-Saalschütz's and Watson's identities, the derived formula can be reduced in simple forms which are free of any hypergeometric functions for certain choices of the involved parameters of the Jacobi polynomials and the Jacobi functions. Some other simplified formulae are obtained via employing some computer algebra algorithms such as the algorithms of Zeilberger, Petkovsek and van Hoeij. Some connection formulae between some Jacobi polynomials are deduced. From these connection formulae, some other linearization formulae of Chebyshev polynomials are obtained. As an application to some of the introduced formulae, a numerical algorithm for solving nonlinear Riccati differential equation is presented and implemented by applying a suitable spectral method.

Coherent orthogonal polynomials

DOE Office of Scientific and Technical Information (OSTI.GOV)

Celeghini, E., E-mail: celeghini@fi.infn.it; Olmo, M.A. del, E-mail: olmo@fta.uva.es

2013-08-15

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

Poly-Frobenius-Euler polynomials

NASA Astrophysics Data System (ADS)

Kurt, Burak

2017-07-01

Hamahata [3] defined poly-Euler polynomials and the generalized poly-Euler polynomials. He proved some relations and closed formulas for the poly-Euler polynomials. By this motivation, we define poly-Frobenius-Euler polynomials. We give some relations for this polynomials. Also, we prove the relationships between poly-Frobenius-Euler polynomials and Stirling numbers of the second kind.

Independence polynomial and matching polynomial of the Koch network

NASA Astrophysics Data System (ADS)

Liao, Yunhua; Xie, Xiaoliang

2015-11-01

The lattice gas model and the monomer-dimer model are two classical models in statistical mechanics. It is well known that the partition functions of these two models are associated with the independence polynomial and the matching polynomial in graph theory, respectively. Both polynomials have been shown to belong to the “#P-complete” class, which indicate the problems are computationally “intractable”. We consider these two polynomials of the Koch networks which are scale-free with small-world effects. Explicit recurrences are derived, and explicit formulae are presented for the number of independent sets of a certain type.

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

NASA Astrophysics Data System (ADS)

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.

Van-der-Waals interaction of atoms in dipolar Rydberg states

NASA Astrophysics Data System (ADS)

Kamenski, Aleksandr A.; Mokhnenko, Sergey N.; Ovsiannikov, Vitaly D.

2018-02-01

An asymptotic expression for the van-der-Waals constant C 6( n) ≈ -0.03 n 12 K p ( x) is derived for the long-range interaction between two highly excited hydrogen atoms A and B in their extreme Stark states of equal principal quantum numbers n A = n B = n ≫ 1 and parabolic quantum numbers n 1(2) = n - 1, n 2(1) = m = 0 in the case of collinear orientation of the Stark-state dipolar electric moments and the interatomic axis. The cubic polynomial K 3( x) in powers of reciprocal values of the principal quantum number x = 1/ n and quadratic polynomial K 2( y) in powers of reciprocal values of the principal quantum number squared y = 1/ n 2 were determined on the basis of the standard curve fitting polynomial procedure from the calculated data for C 6( n). The transformation of attractive van-der-Waals force ( C 6 > 0) for low-energy states n < 23 into repulsive force ( C 6 < 0) for all higher-energy states of n ≥ 23, is observed from the results of numerical calculations based on the second-order perturbation theory for the operator of the long-range interaction between neutral atoms. This transformation is taken into account in the asymptotic formulas (in both cases of p = 2, 3) by polynomials K p tending to unity at n → ∞ ( K p (0) = 1). The transformation from low- n attractive van-der-Waals force into high- n repulsive force demonstrates the gradual increase of the negative contribution to C 6( n) from the lower-energy two-atomic states, of the A(B)-atom principal quantum numbers n'A(B) = n-Δ n (where Δ n = 1, 2, … is significantly smaller than n for the terms providing major contribution to the second-order series), which together with the states of n″B(A) = n+Δ n make the joint contribution proportional to n 12. So, the hydrogen-like manifold structure of the energy spectrum is responsible for the transformation of the power-11 asymptotic dependence C 6( n) ∝ n 11of the low-angular-momenta Rydberg states in many-electron atoms into the power

Quantum-Mechanical Definition of Atoms and Chemical Bonds in Molecules

DTIC Science & Technology

2015-01-01

properties into atomic and bonding contributions, continue to be a focus of considerable attention, dating from early studies of Slater [12], Van Vleck [13...theory employing (Eisenschitz-London) spectral products of atomic eigenstates, familiar from early combined studies of covalent and van der Waals...of atoms and bonds in molecules provided by the present study , rather than to report highly accurate potential curves for the H3 molecule obtained

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

NASA Astrophysics Data System (ADS)

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.

Umbral orthogonal polynomials

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lopez-Sendino, J. E.; del Olmo, M. A.

2010-12-23

We present an umbral operator version of the classical orthogonal polynomials. We obtain three families which are the umbral counterpart of the Jacobi, Laguerre and Hermite polynomials in the classical case.

Multiple zeros of polynomials

NASA Technical Reports Server (NTRS)

Wood, C. A.

1974-01-01

For polynomials of higher degree, iterative numerical methods must be used. Four iterative methods are presented for approximating the zeros of a polynomial using a digital computer. Newton's method and Muller's method are two well known iterative methods which are presented. They extract the zeros of a polynomial by generating a sequence of approximations converging to each zero. However, both of these methods are very unstable when used on a polynomial which has multiple zeros. That is, either they fail to converge to some or all of the zeros, or they converge to very bad approximations of the polynomial's zeros. This material introduces two new methods, the greatest common divisor (G.C.D.) method and the repeated greatest common divisor (repeated G.C.D.) method, which are superior methods for numerically approximating the zeros of a polynomial having multiple zeros. These methods were programmed in FORTRAN 4 and comparisons in time and accuracy are given.

Hermite Functional Link Neural Network for Solving the Van der Pol-Duffing Oscillator Equation.

PubMed

Mall, Susmita; Chakraverty, S

2016-08-01

Hermite polynomial-based functional link artificial neural network (FLANN) is proposed here to solve the Van der Pol-Duffing oscillator equation. A single-layer hermite neural network (HeNN) model is used, where a hidden layer is replaced by expansion block of input pattern using Hermite orthogonal polynomials. A feedforward neural network model with the unsupervised error backpropagation principle is used for modifying the network parameters and minimizing the computed error function. The Van der Pol-Duffing and Duffing oscillator equations may not be solved exactly. Here, approximate solutions of these types of equations have been obtained by applying the HeNN model for the first time. Three mathematical example problems and two real-life application problems of Van der Pol-Duffing oscillator equation, extracting the features of early mechanical failure signal and weak signal detection problems, are solved using the proposed HeNN method. HeNN approximate solutions have been compared with results obtained by the well known Runge-Kutta method. Computed results are depicted in term of graphs. After training the HeNN model, we may use it as a black box to get numerical results at any arbitrary point in the domain. Thus, the proposed HeNN method is efficient. The results reveal that this method is reliable and can be applied to other nonlinear problems too.

Orthonormal vector general polynomials derived from the Cartesian gradient of the orthonormal Zernike-based polynomials.

PubMed

Mafusire, Cosmas; Krüger, Tjaart P J

2018-06-01

The concept of orthonormal vector circle polynomials is revisited by deriving a set from the Cartesian gradient of Zernike polynomials in a unit circle using a matrix-based approach. The heart of this model is a closed-form matrix equation of the gradient of Zernike circle polynomials expressed as a linear combination of lower-order Zernike circle polynomials related through a gradient matrix. This is a sparse matrix whose elements are two-dimensional standard basis transverse Euclidean vectors. Using the outer product form of the Cholesky decomposition, the gradient matrix is used to calculate a new matrix, which we used to express the Cartesian gradient of the Zernike circle polynomials as a linear combination of orthonormal vector circle polynomials. Since this new matrix is singular, the orthonormal vector polynomials are recovered by reducing the matrix to its row echelon form using the Gauss-Jordan elimination method. We extend the model to derive orthonormal vector general polynomials, which are orthonormal in a general pupil by performing a similarity transformation on the gradient matrix to give its equivalent in the general pupil. The outer form of the Gram-Schmidt procedure and the Gauss-Jordan elimination method are then applied to the general pupil to generate the orthonormal vector general polynomials from the gradient of the orthonormal Zernike-based polynomials. The performance of the model is demonstrated with a simulated wavefront in a square pupil inscribed in a unit circle.

Hadamard Factorization of Stable Polynomials

NASA Astrophysics Data System (ADS)

Loredo-Villalobos, Carlos Arturo; Aguirre-Hernández, Baltazar

2011-11-01

The stable (Hurwitz) polynomials are important in the study of differential equations systems and control theory (see [7] and [19]). A property of these polynomials is related to Hadamard product. Consider two polynomials p,q ∈ R[x]:p(x) = anxn+an-1xn-1+...+a1x+a0q(x) = bmx m+bm-1xm-1+...+b1x+b0the Hadamard product (p × q) is defined as (p×q)(x) = akbkxk+ak-1bk-1xk-1+...+a1b1x+a0b0where k = min(m,n). Some results (see [16]) shows that if p,q ∈R[x] are stable polynomials then (p×q) is stable, also, i.e. the Hadamard product is closed; however, the reciprocal is not always true, that is, not all stable polynomial has a factorization into two stable polynomials the same degree n, if n> 4 (see [15]).In this work we will give some conditions to Hadamard factorization existence for stable polynomials.

Extending a Property of Cubic Polynomials to Higher-Degree Polynomials

ERIC Educational Resources Information Center

Miller, David A.; Moseley, James

2012-01-01

In this paper, the authors examine a property that holds for all cubic polynomials given two zeros. This property is discovered after reviewing a variety of ways to determine the equation of a cubic polynomial given specific conditions through algebra and calculus. At the end of the article, they will connect the property to a very famous method…

On universal knot polynomials

NASA Astrophysics Data System (ADS)

Mironov, A.; Mkrtchyan, R.; Morozov, A.

2016-02-01

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

Determinants with orthogonal polynomial entries

NASA Astrophysics Data System (ADS)

Ismail, Mourad E. H.

2005-06-01

We use moment representations of orthogonal polynomials to evaluate the corresponding Hankel determinants formed by the orthogonal polynomials. We also study the Hankel determinants which start with pn on the top left-hand corner. As examples we evaluate the Hankel determinants whose entries are q-ultraspherical or Al-Salam-Chihara polynomials.

Interpolation and Polynomial Curve Fitting

ERIC Educational Resources Information Center

Yang, Yajun; Gordon, Sheldon P.

2014-01-01

Two points determine a line. Three noncollinear points determine a quadratic function. Four points that do not lie on a lower-degree polynomial curve determine a cubic function. In general, n + 1 points uniquely determine a polynomial of degree n, presuming that they do not fall onto a polynomial of lower degree. The process of finding such a…

Stochastic Estimation via Polynomial Chaos

DTIC Science & Technology

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

Chaos, Fractals, and Polynomials.

ERIC Educational Resources Information Center

Tylee, J. Louis; Tylee, Thomas B.

1996-01-01

Discusses chaos theory; linear algebraic equations and the numerical solution of polynomials, including the use of the Newton-Raphson technique to find polynomial roots; fractals; search region and coordinate systems; convergence; and generating color fractals on a computer. (LRW)

Multi-indexed (q-)Racah polynomials

NASA Astrophysics Data System (ADS)

Odake, Satoru; Sasaki, Ryu

2012-09-01

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

Equivalences of the multi-indexed orthogonal polynomials

DOE Office of Scientific and Technical Information (OSTI.GOV)

Odake, Satoru

2014-01-15

Multi-indexed orthogonal polynomials describe eigenfunctions of exactly solvable shape-invariant quantum mechanical systems in one dimension obtained by the method of virtual states deletion. Multi-indexed orthogonal polynomials are labeled by a set of degrees of polynomial parts of virtual state wavefunctions. For multi-indexed orthogonal polynomials of Laguerre, Jacobi, Wilson, and Askey-Wilson types, two different index sets may give equivalent multi-indexed orthogonal polynomials. We clarify these equivalences. Multi-indexed orthogonal polynomials with both type I and II indices are proportional to those of type I indices only (or type II indices only) with shifted parameters.

Extending Romanovski polynomials in quantum mechanics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Quesne, C.

2013-12-15

Some extensions of the (third-class) Romanovski polynomials (also called Romanovski/pseudo-Jacobi polynomials), which appear in bound-state wavefunctions of rationally extended Scarf II and Rosen-Morse I potentials, are considered. For the former potentials, the generalized polynomials satisfy a finite orthogonality relation, while for the latter an infinite set of relations among polynomials with degree-dependent parameters is obtained. Both types of relations are counterparts of those known for conventional polynomials. In the absence of any direct information on the zeros of the Romanovski polynomials present in denominators, the regularity of the constructed potentials is checked by taking advantage of the disconjugacy properties ofmore » second-order differential equations of Schrödinger type. It is also shown that on going from Scarf I to Scarf II or from Rosen-Morse II to Rosen-Morse I potentials, the variety of rational extensions is narrowed down from types I, II, and III to type III only.« less

On Certain Wronskians of Multiple Orthogonal Polynomials

NASA Astrophysics Data System (ADS)

Zhang, Lun; Filipuk, Galina

2014-11-01

We consider determinants of Wronskian type whose entries are multiple orthogonal polynomials associated with a path connecting two multi-indices. By assuming that the weight functions form an algebraic Chebyshev (AT) system, we show that the polynomials represented by the Wronskians keep a constant sign in some cases, while in some other cases oscillatory behavior appears, which generalizes classical results for orthogonal polynomials due to Karlin and Szegő. There are two applications of our results. The first application arises from the observation that the m-th moment of the average characteristic polynomials for multiple orthogonal polynomial ensembles can be expressed as a Wronskian of the type II multiple orthogonal polynomials. Hence, it is straightforward to obtain the distinct behavior of the moments for odd and even m in a special multiple orthogonal ensemble - the AT ensemble. As the second application, we derive some Turán type inequalities for m! ultiple Hermite and multiple Laguerre polynomials (of two kinds). Finally, we study numerically the geometric configuration of zeros for the Wronskians of these multiple orthogonal polynomials. We observe that the zeros have regular configurations in the complex plane, which might be of independent interest.

Polynomial Graphs and Symmetry

ERIC Educational Resources Information Center

Goehle, Geoff; Kobayashi, Mitsuo

2013-01-01

Most quadratic functions are not even, but every parabola has symmetry with respect to some vertical line. Similarly, every cubic has rotational symmetry with respect to some point, though most cubics are not odd. We show that every polynomial has at most one point of symmetry and give conditions under which the polynomial has rotational or…

Approximating exponential and logarithmic functions using polynomial interpolation

NASA Astrophysics Data System (ADS)

Gordon, Sheldon P.; Yang, Yajun

2017-04-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 analysed. The results of interpolating polynomials are compared with those of Taylor polynomials.

Experimental proof of the existence of water clusters in fullerene-like PrF3 nanoparticles

NASA Astrophysics Data System (ADS)

Alakshin, E. M.; Blokhin, D. S.; Sabitova, A. M.; Klochkov, A. V.; Klochkov, V. V.; Kono, K.; Korableva, S. L.; Tagirov, M. S.

2012-10-01

Synthesized fullerene-like nanoparticles of the Van Vleck paramagnet PrF3 have been studied by nuclear magnetic resonance cryoporometry. Water clusters have been discovered in the internal cavities of the nanoparticles. The analysis of the experimental data indicates that the cluster radius is 1-2.3 nm. The obtained data agree well with the high-resolution transmission electron microscopy data.

Percolation critical polynomial as a graph invariant

DOE PAGES

Scullard, Christian R.

2012-10-18

Every lattice for which the bond percolation critical probability can be found exactly possesses a critical polynomial, with the root in [0; 1] providing the threshold. Recent work has demonstrated that this polynomial may be generalized through a definition that can be applied on any periodic lattice. The polynomial depends on the lattice and on its decomposition into identical finite subgraphs, but once these are specified, the polynomial is essentially unique. On lattices for which the exact percolation threshold is unknown, the polynomials provide approximations for the critical probability with the estimates appearing to converge to the exact answer withmore » increasing subgraph size. In this paper, I show how the critical polynomial can be viewed as a graph invariant like the Tutte polynomial. In particular, the critical polynomial is computed on a finite graph and may be found using the deletion-contraction algorithm. This allows calculation on a computer, and I present such results for the kagome lattice using subgraphs of up to 36 bonds. For one of these, I find the prediction p c = 0:52440572:::, which differs from the numerical value, p c = 0:52440503(5), by only 6:9 X 10 -7.« less

Parallel multigrid smoothing: polynomial versus Gauss-Seidel

NASA Astrophysics Data System (ADS)

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.

Simple Proof of Jury Test for Complex Polynomials

NASA Astrophysics Data System (ADS)

Choo, Younseok; Kim, Dongmin

Recently some attempts have been made in the literature to give simple proofs of Jury test for real polynomials. This letter presents a similar result for complex polynomials. A simple proof of Jury test for complex polynomials is provided based on the Rouché's Theorem and a single-parameter characterization of Schur stability property for complex polynomials.

Discrete Tchebycheff orthonormal polynomials and applications

NASA Technical Reports Server (NTRS)

Lear, W. M.

1980-01-01

Discrete Tchebycheff orthonormal polynomials offer a convenient way to make least squares polynomial fits of uniformly spaced discrete data. Computer programs to do so are simple and fast, and appear to be less affected by computer roundoff error, for the higher order fits, than conventional least squares programs. They are useful for any application of polynomial least squares fits: approximation of mathematical functions, noise analysis of radar data, and real time smoothing of noisy data, to name a few.

On polynomial preconditioning for indefinite Hermitian matrices

NASA Technical Reports Server (NTRS)

Freund, Roland W.

1989-01-01

The minimal residual method is studied combined with polynomial preconditioning for solving large linear systems (Ax = b) with indefinite Hermitian coefficient matrices (A). The standard approach for choosing the polynomial preconditioners leads to preconditioned systems which are positive definite. Here, a different strategy is studied which leaves the preconditioned coefficient matrix indefinite. More precisely, the polynomial preconditioner is designed to cluster the positive, resp. negative eigenvalues of A around 1, resp. around some negative constant. In particular, it is shown that such indefinite polynomial preconditioners can be obtained as the optimal solutions of a certain two parameter family of Chebyshev approximation problems. Some basic results are established for these approximation problems and a Remez type algorithm is sketched for their numerical solution. The problem of selecting the parameters such that the resulting indefinite polynomial preconditioners speeds up the convergence of minimal residual method optimally is also addressed. An approach is proposed based on the concept of asymptotic convergence factors. Finally, some numerical examples of indefinite polynomial preconditioners are given.

On multiple orthogonal polynomials for discrete Meixner measures

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sorokin, Vladimir N

2010-12-07

The paper examines two examples of multiple orthogonal polynomials generalizing orthogonal polynomials of a discrete variable, meaning thereby the Meixner polynomials. One example is bound up with a discrete Nikishin system, and the other leads to essentially new effects. The limit distribution of the zeros of polynomials is obtained in terms of logarithmic equilibrium potentials and in terms of algebraic curves. Bibliography: 9 titles.

Stochastic Modeling of Flow-Structure Interactions using Generalized Polynomial Chaos

DTIC Science & Technology

2001-09-11

Some basic hypergeometric polynomials that generalize Jacobi polynomials . Memoirs Amer. Math. Soc...scheme, which is represented as a tree structure in figure 1 (following [24]), classifies the hypergeometric orthogonal polynomials and indicates the...2F0(1) 2F0(0) Figure 1: The Askey scheme of orthogonal polynomials The orthogonal polynomials associated with the generalized polynomial chaos,

Gaussian quadrature for multiple orthogonal polynomials

NASA Astrophysics Data System (ADS)

Coussement, Jonathan; van Assche, Walter

2005-06-01

We study multiple orthogonal polynomials of type I and type II, which have orthogonality conditions with respect to r measures. These polynomials are connected by their recurrence relation of order r+1. First we show a relation with the eigenvalue problem of a banded lower Hessenberg matrix Ln, containing the recurrence coefficients. As a consequence, we easily find that the multiple orthogonal polynomials of type I and type II satisfy a generalized Christoffel-Darboux identity. Furthermore, we explain the notion of multiple Gaussian quadrature (for proper multi-indices), which is an extension of the theory of Gaussian quadrature for orthogonal polynomials and was introduced by Borges. In particular, we show that the quadrature points and quadrature weights can be expressed in terms of the eigenvalue problem of Ln.

Dirac(-Pauli), Fokker-Planck equations and exceptional Laguerre polynomials

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ho, Choon-Lin, E-mail: hcl@mail.tku.edu.tw

2011-04-15

Research Highlights: > Physical examples involving exceptional orthogonal polynomials. > Exceptional polynomials as deformations of classical orthogonal polynomials. > Exceptional polynomials from Darboux-Crum transformation. - Abstract: An interesting discovery in the last two years in the field of mathematical physics has been the exceptional X{sub l} Laguerre and Jacobi polynomials. Unlike the well-known classical orthogonal polynomials which start with constant terms, these new polynomials have lowest degree l = 1, 2, and ..., and yet they form complete set with respect to some positive-definite measure. While the mathematical properties of these new X{sub l} polynomials deserve further analysis, it ismore » also of interest to see if they play any role in physical systems. In this paper we indicate some physical models in which these new polynomials appear as the main part of the eigenfunctions. The systems we consider include the Dirac equations coupled minimally and non-minimally with some external fields, and the Fokker-Planck equations. The systems presented here have enlarged the number of exactly solvable physical systems known so far.« less

Graphical Solution of Polynomial Equations

ERIC Educational Resources Information Center

Grishin, Anatole

2009-01-01

Graphing utilities, such as the ubiquitous graphing calculator, are often used in finding the approximate real roots of polynomial equations. In this paper the author offers a simple graphing technique that allows one to find all solutions of a polynomial equation (1) of arbitrary degree; (2) with real or complex coefficients; and (3) possessing…

Approximating smooth functions using algebraic-trigonometric polynomials

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sharapudinov, Idris I

2011-01-14

The problem under consideration is that of approximating classes of smooth functions by algebraic-trigonometric polynomials of the form p{sub n}(t)+{tau}{sub m}(t), where p{sub n}(t) is an algebraic polynomial of degree n and {tau}{sub m}(t)=a{sub 0}+{Sigma}{sub k=1}{sup m}a{sub k} cos k{pi}t + b{sub k} sin k{pi}t is a trigonometric polynomial of order m. The precise order of approximation by such polynomials in the classes W{sup r}{sub {infinity}(}M) and an upper bound for similar approximations in the class W{sup r}{sub p}(M) with 4/3polynomials which the author has introduced andmore » investigated previously. Bibliography: 13 titles.« less

Cosmographic analysis with Chebyshev polynomials

NASA Astrophysics Data System (ADS)

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.

Tutte polynomial in functional magnetic resonance imaging

NASA Astrophysics Data System (ADS)

García-Castillón, Marlly V.

2015-09-01

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

On the derivatives of unimodular polynomials

NASA Astrophysics Data System (ADS)

Nevai, P.; Erdélyi, T.

2016-04-01

Let D be the open unit disk of the complex plane; its boundary, the unit circle of the complex plane, is denoted by \\partial D. Let \\mathscr P_n^c denote the set of all algebraic polynomials of degree at most n with complex coefficients. For λ ≥ 0, let {\\mathscr K}_n^λ \\stackrel{{def}}{=} \\biggl\\{P_n: P_n(z) = \\sumk=0^n{ak k^λ z^k}, ak \\in { C}, |a_k| = 1 \\biggr\\} \\subset {\\mathscr P}_n^c.The class \\mathscr K_n^0 is often called the collection of all (complex) unimodular polynomials of degree n. Given a sequence (\\varepsilon_n) of positive numbers tending to 0, we say that a sequence (P_n) of polynomials P_n\\in\\mathscr K_n^λ is \\{λ, (\\varepsilon_n)\\}-ultraflat if \\displaystyle (1-\\varepsilon_n)\\frac{nλ+1/2}{\\sqrt{2λ+1}}≤\\ve......a +1/2}}{\\sqrt{2λ +1}},\\qquad z \\in \\partial D,\\quad n\\in N_0.Although we do not know, in general, whether or not \\{λ, (\\varepsilon_n)\\}-ultraflat sequences of polynomials P_n\\in\\mathscr K_n^λ exist for each fixed λ>0, we make an effort to prove various interesting properties of them. These allow us to conclude that there are no sequences (P_n) of either conjugate, or plain, or skew reciprocal unimodular polynomials P_n\\in\\mathscr K_n^0 such that (Q_n) with Q_n(z)\\stackrel{{def}}{=} zP_n'(z)+1 is a \\{1,(\\varepsilon_n)\\}-ultraflat sequence of polynomials.Bibliography: 18 titles.

Theoretical Analysis of Microwave Propagation.

DTIC Science & Technology

1984-04-01

effects of the turbulent atmosphere on wave propagation, US Department of Commerce, NTIS, Springfield, VA. * VanVleck, J.H. (1947), "The absorption of... turbulent atmosphere on wave propagation, US Department of Commerce, NTIS, Sprinifield, VA. -. A. Vigants (1975), "Space diversity engineering," BSTJ, Vol... Turbulence ., ...... 2-26 2.5 ATMOSPHERIC ABSORPTION. 2-26 2 .6 RAIN ATTENUATION ....... 2-29 3 TROPOSCATTER PROPAGATION .................... 3-1 3.1

The Gibbs Phenomenon for Series of Orthogonal Polynomials

ERIC Educational Resources Information Center

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

2006-01-01

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

Piecewise polynomial representations of genomic tracks.

PubMed

Tarabichi, Maxime; Detours, Vincent; Konopka, Tomasz

2012-01-01

Genomic data from micro-array and sequencing projects consist of associations of measured values to chromosomal coordinates. These associations can be thought of as functions in one dimension and can thus be stored, analyzed, and interpreted as piecewise-polynomial curves. We present a general framework for building piecewise polynomial representations of genome-scale signals and illustrate some of its applications via examples. We show that piecewise constant segmentation, a typical step in copy-number analyses, can be carried out within this framework for both array and (DNA) sequencing data offering advantages over existing methods in each case. Higher-order polynomial curves can be used, for example, to detect trends and/or discontinuities in transcription levels from RNA-seq data. We give a concrete application of piecewise linear functions to diagnose and quantify alignment quality at exon borders (splice sites). Our software (source and object code) for building piecewise polynomial models is available at http://sourceforge.net/projects/locsmoc/.

A recursive algorithm for Zernike polynomials

NASA Technical Reports Server (NTRS)

Davenport, J. W.

1982-01-01

The analysis of a function defined on a rotationally symmetric system, with either a circular or annular pupil is discussed. In order to numerically analyze such systems it is typical to expand the given function in terms of a class of orthogonal polynomials. Because of their particular properties, the Zernike polynomials are especially suited for numerical calculations. Developed is a recursive algorithm that can be used to generate the Zernike polynomials up to a given order. The algorithm is recursively defined over J where R(J,N) is the Zernike polynomial of degree N obtained by orthogonalizing the sequence R(J), R(J+2), ..., R(J+2N) over (epsilon, 1). The terms in the preceding row - the (J-1) row - up to the N+1 term is needed for generating the (J,N)th term. Thus, the algorith generates an upper left-triangular table. This algorithm was placed in the computer with the necessary support program also included.

Approximating Exponential and Logarithmic Functions Using Polynomial Interpolation

ERIC Educational Resources Information Center

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…

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

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 themore » 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

The Translated Dowling Polynomials and Numbers.

PubMed

Mangontarum, Mahid M; Macodi-Ringia, Amila P; Abdulcarim, Normalah S

2014-01-01

More properties for the translated Whitney numbers of the second kind such as horizontal generating function, explicit formula, and exponential generating function are proposed. Using the translated Whitney numbers of the second kind, we will define the translated Dowling polynomials and numbers. Basic properties such as exponential generating functions and explicit formula for the translated Dowling polynomials and numbers are obtained. Convexity, integral representation, and other interesting identities are also investigated and presented. We show that the properties obtained are generalizations of some of the known results involving the classical Bell polynomials and numbers. Lastly, we established the Hankel transform of the translated Dowling numbers.

Degenerate r-Stirling Numbers and r-Bell Polynomials

NASA Astrophysics Data System (ADS)

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.

Comparative assessment of orthogonal polynomials for wavefront reconstruction over the square aperture.

PubMed

Ye, Jingfei; Gao, Zhishan; Wang, Shuai; Cheng, Jinlong; Wang, Wei; Sun, Wenqing

2014-10-01

Four orthogonal polynomials for reconstructing a wavefront over a square aperture based on the modal method are currently available, namely, the 2D Chebyshev polynomials, 2D Legendre polynomials, Zernike square polynomials and Numerical polynomials. They are all orthogonal over the full unit square domain. 2D Chebyshev polynomials are defined by the product of Chebyshev polynomials in x and y variables, as are 2D Legendre polynomials. Zernike square polynomials are derived by the Gram-Schmidt orthogonalization process, where the integration region across the full unit square is circumscribed outside the unit circle. Numerical polynomials are obtained by numerical calculation. The presented study is to compare these four orthogonal polynomials by theoretical analysis and numerical experiments from the aspects of reconstruction accuracy, remaining errors, and robustness. Results show that the Numerical orthogonal polynomial is superior to the other three polynomials because of its high accuracy and robustness even in the case of a wavefront with incomplete data.

Polynomial solutions of the Monge-Ampère equation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Aminov, Yu A

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 ofmore » such solutions are indicated. An approximation theorem is proved. Bibliography: 10 titles.« less

On Polynomial Solutions of Linear Differential Equations with Polynomial Coefficients

ERIC Educational Resources Information Center

Si, Do Tan

1977-01-01

Demonstrates a method for solving linear differential equations with polynomial coefficients based on the fact that the operators z and D + d/dz are known to be Hermitian conjugates with respect to the Bargman and Louck-Galbraith scalar products. (MLH)

Ricci polynomial gravity

NASA Astrophysics Data System (ADS)

Hao, Xin; Zhao, Liu

2017-12-01

We study a novel class of higher-curvature gravity models in n spacetime dimensions which we call Ricci polynomial gravity. The action consists purely of a polynomial in Ricci curvature of order N . In the absence of the second-order terms in the action, the models are ghost free around the Minkowski vacuum. By appropriately choosing the coupling coefficients in front of each term in the action, it is shown that the models can have multiple vacua with different effective cosmological constants, and can be made free of ghost and scalar degrees of freedom around at least one of the maximally symmetric vacua for any n >2 and any N ≥4 . We also discuss some of the physical implications of the existence of multiple vacua in the contexts of black hole physics and cosmology.

Imaging characteristics of Zernike and annular polynomial aberrations.

PubMed

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.

Orbifold E-functions of dual invertible polynomials

NASA Astrophysics Data System (ADS)

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

2016-08-01

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

Conformal Galilei algebras, symmetric polynomials and singular vectors

NASA Astrophysics Data System (ADS)

Křižka, Libor; Somberg, Petr

2018-01-01

We classify and explicitly describe homomorphisms of Verma modules for conformal Galilei algebras cga_ℓ (d,C) with d=1 for any integer value ℓ \\in N. The homomorphisms are uniquely determined by singular vectors as solutions of certain differential operators of flag type and identified with specific polynomials arising as coefficients in the expansion of a parametric family of symmetric polynomials into power sum symmetric polynomials.

Neck curve polynomials in neck rupture model

DOE Office of Scientific and Technical Information (OSTI.GOV)

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

2012-06-06

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 {sup 280}X{sub 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.

More on rotations as spin matrix polynomials

DOE Office of Scientific and Technical Information (OSTI.GOV)

Curtright, Thomas L.

2015-09-15

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

A FAST POLYNOMIAL TRANSFORM PROGRAM WITH A MODULARIZED STRUCTURE

NASA Technical Reports Server (NTRS)

Truong, T. K.

1994-01-01

This program utilizes a fast polynomial transformation (FPT) algorithm applicable to two-dimensional mathematical convolutions. Two-dimensional convolution has many applications, particularly in image processing. Two-dimensional cyclic convolutions can be converted to a one-dimensional convolution in a polynomial ring. Traditional FPT methods decompose the one-dimensional cyclic polynomial into polynomial convolutions of different lengths. This program will decompose a cyclic polynomial into polynomial convolutions of the same length. Thus, only FPTs and Fast Fourier Transforms of the same length are required. This modular approach can save computational resources. To further enhance its appeal, the program is written in the transportable 'C' language. The steps in the algorithm are: 1) formulate the modulus reduction equations, 2) calculate the polynomial transforms, 3) multiply the transforms using a generalized fast Fourier transformation, 4) compute the inverse polynomial transforms, and 5) reconstruct the final matrices using the Chinese remainder theorem. Input to this program is comprised of the row and column dimensions and the initial two matrices. The matrices are printed out at all steps, ending with the final reconstruction. This program is written in 'C' for batch execution and has been implemented on the IBM PC series of computers under DOS with a central memory requirement of approximately 18K of 8 bit bytes. This program was developed in 1986.

Modeling Uncertainty in Steady State Diffusion Problems via Generalized Polynomial Chaos

DTIC Science & Technology

2002-07-25

Some basic hypergeometric polynomials that generalize Jacobi polynomials . Memoirs Amer. Math. Soc., AMS... orthogonal polynomial functionals from the Askey scheme, as a generalization of the original polynomial chaos idea of Wiener (1938). A Galerkin projection...1) by generalized polynomial chaos expansion, where the uncertainties can be introduced through κ, f , or g, or some combinations. It is worth

Orthonormal aberration polynomials for anamorphic optical imaging systems with circular pupils.

PubMed

Mahajan, Virendra N

2012-06-20

In a recent paper, we considered the classical aberrations of an anamorphic optical imaging system with a rectangular pupil, representing the terms of a power series expansion of its aberration function. These aberrations are inherently separable in the Cartesian coordinates (x,y) of a point on the pupil. Accordingly, there is x-defocus and x-coma, y-defocus and y-coma, and so on. We showed that the aberration polynomials orthonormal over the pupil and representing balanced aberrations for such a system are represented by the products of two Legendre polynomials, one for each of the two Cartesian coordinates of the pupil point; for example, L(l)(x)L(m)(y), where l and m are positive integers (including zero) and L(l)(x), for example, represents an orthonormal Legendre polynomial of degree l in x. The compound two-dimensional (2D) Legendre polynomials, like the classical aberrations, are thus also inherently separable in the Cartesian coordinates of the pupil point. Moreover, for every orthonormal polynomial L(l)(x)L(m)(y), there is a corresponding orthonormal polynomial L(l)(y)L(m)(x) obtained by interchanging x and y. These polynomials are different from the corresponding orthogonal polynomials for a system with rotational symmetry but a rectangular pupil. In this paper, we show that the orthonormal aberration polynomials for an anamorphic system with a circular pupil, obtained by the Gram-Schmidt orthogonalization of the 2D Legendre polynomials, are not separable in the two coordinates. Moreover, for a given polynomial in x and y, there is no corresponding polynomial obtained by interchanging x and y. For example, there are polynomials representing x-defocus, balanced x-coma, and balanced x-spherical aberration, but no corresponding y-aberration polynomials. The missing y-aberration terms are contained in other polynomials. We emphasize that the Zernike circle polynomials, although orthogonal over a circular pupil, are not suitable for an anamorphic system as

From sequences to polynomials and back, via operator orderings

DOE Office of Scientific and Technical Information (OSTI.GOV)

Amdeberhan, Tewodros, E-mail: tamdeber@tulane.edu; Dixit, Atul, E-mail: adixit@tulane.edu; Moll, Victor H., E-mail: vhm@tulane.edu

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.

Inequalities for a polynomial and its derivative

NASA Astrophysics Data System (ADS)

Chanam, Barchand; Dewan, K. K.

2007-12-01

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

Cylinder surface test with Chebyshev polynomial fitting method

NASA Astrophysics Data System (ADS)

Yu, Kui-bang; Guo, Pei-ji; Chen, Xi

2017-10-01

Zernike polynomials fitting method is often applied in the test of optical components and systems, used to represent the wavefront and surface error in circular domain. Zernike polynomials are not orthogonal in rectangular region which results in its unsuitable for the test of optical element with rectangular aperture such as cylinder surface. Applying the Chebyshev polynomials which are orthogonal among the rectangular area as an substitution to the fitting method, can solve the problem. Corresponding to a cylinder surface with diameter of 50 mm and F number of 1/7, a measuring system has been designed in Zemax based on Fizeau Interferometry. The expressions of the two-dimensional Chebyshev polynomials has been given and its relationship with the aberration has been presented. Furthermore, Chebyshev polynomials are used as base items to analyze the rectangular aperture test data. The coefficient of different items are obtained from the test data through the method of least squares. Comparing the Chebyshev spectrum in different misalignment, it show that each misalignment is independence and has a certain relationship with the certain Chebyshev terms. The simulation results show that, through the Legendre polynomials fitting method, it will be a great improvement in the efficient of the detection and adjustment of the cylinder surface test.

Diversity of Tn1546 in vanA-positive Enterococcus faecium clinical isolates with VanA, VanB, and VanD phenotypes and susceptibility to vancomycin.

PubMed

Cha, J O; Yoo, J I; Kim, H K; Kim, H S; Yoo, J S; Lee, Y S; Jung, Y H

2013-10-01

To investigate diversity in the vanA cluster in Enterococcus faecium isolates from nontertiary hospitals. We identified 43 vanA-positive Ent. faecium isolates, including two vancomycin-susceptible isolates, from hospitals between 2003 and 2006. Of these isolates, >85% were resistant to ampicillin, erythromycin and ciprofloxacin. The vanA cluster was classified into six types using overlapping PCR, but the prototype transposon Tn1546 was not found. Most vanA-positive vancomycin-resistant Enterococcus (VRE) carried IS1216V and belonged to Type III (58·1%) or Type II (20·9%). vanY, vanZ and IS1216V were observed in the left and right ends of Type III with long-range PCR. IS1216V was also observed within vanS and vanX in the two vancomycin-susceptible isolates and in two vancomycin-resistant isolates. No VRE isolates with VanB and VanD phenotypes contained point mutations in vanS, unlike in previous reports. Sequence types (STs) of all isolates belonged to clonal complex 17, and ST78 was predominant. Insertion sequences, especially IS1216V, cause structural variation in the vanA cluster. We report the first observation of vanY and vanZ at the left end of Tn1546 in clinical isolates. This is the first report of the frequency of vancomycin resistance and diversity of Tn1546 in vanA-positive Ent. faecium isolates from nontertiary hospitals. © 2013 The Society for Applied Microbiology.

Applications of polynomial optimization in financial risk investment

NASA Astrophysics Data System (ADS)

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.

Optimal Chebyshev polynomials on ellipses in the complex plane

NASA Technical Reports Server (NTRS)

Fischer, Bernd; Freund, Roland

1989-01-01

The design of iterative schemes for sparse matrix computations often leads to constrained polynomial approximation problems on sets in the complex plane. For the case of ellipses, we introduce a new class of complex polynomials which are in general very good approximations to the best polynomials and even optimal in most cases.

Universal Racah matrices and adjoint knot polynomials: Arborescent knots

NASA Astrophysics Data System (ADS)

Mironov, A.; Morozov, A.

2016-04-01

By now it is well established that the quantum dimensions of descendants of the adjoint representation can be described in a universal form, independent of a particular family of simple Lie algebras. The Rosso-Jones formula then implies a universal description of the adjoint knot polynomials for torus knots, which in particular unifies the HOMFLY (SUN) and Kauffman (SON) polynomials. For E8 the adjoint representation is also fundamental. We suggest to extend the universality from the dimensions to the Racah matrices and this immediately produces a unified description of the adjoint knot polynomials for all arborescent (double-fat) knots, including twist, 2-bridge and pretzel. Technically we develop together the universality and the "eigenvalue conjecture", which expresses the Racah and mixing matrices through the eigenvalues of the quantum R-matrix, and for dealing with the adjoint polynomials one has to extend it to the previously unknown 6 × 6 case. The adjoint polynomials do not distinguish between mutants and therefore are not very efficient in knot theory, however, universal polynomials in higher representations can probably be better in this respect.

Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials

NASA Astrophysics Data System (ADS)

Chen, Zhixiang; Fu, Bin

This paper is our third step towards developing a theory of testing monomials in multivariate polynomials and concentrates on two problems: (1) How to compute the coefficients of multilinear monomials; and (2) how to find a maximum multilinear monomial when the input is a ΠΣΠ polynomial. We first prove that the first problem is #P-hard and then devise a O *(3 n s(n)) upper bound for this problem for any polynomial represented by an arithmetic circuit of size s(n). Later, this upper bound is improved to O *(2 n ) for ΠΣΠ polynomials. We then design fully polynomial-time randomized approximation schemes for this problem for ΠΣ polynomials. On the negative side, we prove that, even for ΠΣΠ polynomials with terms of degree ≤ 2, the first problem cannot be approximated at all for any approximation factor ≥ 1, nor "weakly approximated" in a much relaxed setting, unless P=NP. For the second problem, we first give a polynomial time λ-approximation algorithm for ΠΣΠ polynomials with terms of degrees no more a constant λ ≥ 2. On the inapproximability side, we give a n (1 - ɛ)/2 lower bound, for any ɛ> 0, on the approximation factor for ΠΣΠ polynomials. When the degrees of the terms in these polynomials are constrained as ≤ 2, we prove a 1.0476 lower bound, assuming Pnot=NP; and a higher 1.0604 lower bound, assuming the Unique Games Conjecture.

Polynomial solution of quantum Grassmann matrices

NASA Astrophysics Data System (ADS)

Tierz, Miguel

2017-05-01

We study a model of quantum mechanical fermions with matrix-like index structure (with indices N and L) and quartic interactions, recently introduced by Anninos and Silva. We compute the partition function exactly with q-deformed orthogonal polynomials (Stieltjes-Wigert polynomials), for different values of L and arbitrary N. From the explicit evaluation of the thermal partition function, the energy levels and degeneracies are determined. For a given L, the number of states of different energy is quadratic in N, which implies an exponential degeneracy of the energy levels. We also show that at high-temperature we have a Gaussian matrix model, which implies a symmetry that swaps N and L, together with a Wick rotation of the spectral parameter. In this limit, we also write the partition function, for generic L and N, in terms of a single generalized Hermite polynomial.

Social Security Polynomials.

ERIC Educational Resources Information Center

Gordon, Sheldon P.

1992-01-01

Demonstrates how the uniqueness and anonymity of a student's Social Security number can be utilized to create individualized polynomial equations that students can investigate using computers or graphing calculators. Students write reports of their efforts to find and classify all real roots of their equation. (MDH)

Presence of the vancomycin resistance gene cluster vanC1, vanXYc, and vanT in Enterococcus casseliflavus.

PubMed

Hölzel, Christina; Bauer, Johann; Stegherr, Eva-Maria; Schwaiger, Karin

2014-04-01

The three chromosomally located clustered genes vanC1, vanXYc, and vanT confer intrinsic resistance to vancomycin and are used for species identification of Enterococcus gallinarum. In this study, 28 strains belonging to the E. gallinarum/casseliflavus group isolated from cloacal swabs from laying hens were screened for the presence of vanC1. As confirmed by species-specific multiplex PCR, 11 vanC1-positive strains were identified as E. gallinarum. Surprisingly, one yellow pigmented strain, verified as E. casseliflavus by species-specific multiplex PCR, was also vanC1 positive; vanXYc and vanT were additionally detectable in this strain. To our knowledge, this is the first report of vanC1, vanXYc, and vanT in E. casseliflavus. The minimum inhibitory concentration of vancomycin was 4 mg/L. Real-time reverse transcription-PCR revealed that none of the clustered genes was expressed in this strain. Even if the genes seem not to be active, there is a certain risk that they will be transferred to other bacteria where they might be functionally expressed. Therefore, it may be advisable to expand the search for vanC1, vanXYc, and vanT from E. gallinarum to other (enterococcal) species. This study confirms that enterococci live up to their name as being reservoir bacteria and should therefore always be closely monitored.

On a Family of Multivariate Modified Humbert Polynomials

PubMed Central

Aktaş, Rabia; Erkuş-Duman, Esra

2013-01-01

This paper attempts to present a multivariable extension of generalized Humbert polynomials. The results obtained here include various families of multilinear and multilateral generating functions, miscellaneous properties, and also some special cases for these multivariable polynomials. PMID:23935411

Symmetric polynomials in information theory: Entropy and subentropy

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jozsa, Richard; Mitchison, Graeme

2015-06-15

Entropy and other fundamental quantities of information theory are customarily expressed and manipulated as functions of probabilities. Here we study the entropy H and subentropy Q as functions of the elementary symmetric polynomials in the probabilities and reveal a series of remarkable properties. Derivatives of all orders are shown to satisfy a complete monotonicity property. H and Q themselves become multivariate Bernstein functions and we derive the density functions of their Levy-Khintchine representations. We also show that H and Q are Pick functions in each symmetric polynomial variable separately. Furthermore, we see that H and the intrinsically quantum informational quantitymore » Q become surprisingly closely related in functional form, suggesting a special significance for the symmetric polynomials in quantum information theory. Using the symmetric polynomials, we also derive a series of further properties of H and Q.« less

On the Waring problem for polynomial rings

PubMed Central

Fröberg, Ralf; Ottaviani, Giorgio; Shapiro, Boris

2012-01-01

In this note we discuss an analog of the classical Waring problem for . Namely, we show that a general homogeneous polynomial of degree divisible by k≥2 can be represented as a sum of at most kn k-th powers of homogeneous polynomials in . Noticeably, kn coincides with the number obtained by naive dimension count. PMID:22460787

Dual exponential polynomials and linear differential equations

NASA Astrophysics Data System (ADS)

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.

Planar harmonic polynomials of type B

NASA Astrophysics Data System (ADS)

Dunkl, Charles F.

1999-11-01

The hyperoctahedral group acting on icons/Journals/Common/BbbR" ALT="BbbR" ALIGN="TOP"/>N is the Weyl group of type B and is associated with a two-parameter family of differential-difference operators {Ti:1icons/Journals/Common/leq" ALT="leq" ALIGN="TOP"/> iicons/Journals/Common/leq" ALT="leq" ALIGN="TOP"/> N}. These operators are analogous to partial derivative operators. This paper finds all the polynomials h on icons/Journals/Common/BbbR" ALT="BbbR" ALIGN="TOP"/>N which are harmonic, icons/Journals/Common/Delta" ALT="Delta" ALIGN="TOP"/>Bh = 0 and annihilated by Ti for i>2, where the Laplacian 0305-4470/32/46/308/img1" ALT="(sum). They are given explicitly in terms of a novel basis of polynomials, defined by generating functions. The harmonic polynomials can be used to find wavefunctions for the quantum many-body spin Calogero model.

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

PubMed

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.

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

NASA Astrophysics Data System (ADS)

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.

Constructing general partial differential equations using polynomial and neural networks.

PubMed

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.

A note on the zeros of Freud-Sobolev orthogonal polynomials

NASA Astrophysics Data System (ADS)

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.

Computing Galois Groups of Eisenstein Polynomials Over P-adic Fields

NASA Astrophysics Data System (ADS)

Milstead, Jonathan

The most efficient algorithms for computing Galois groups of polynomials over global fields are based on Stauduhar's relative resolvent method. These methods are not directly generalizable to the local field case, since they require a field that contains the global field in which all roots of the polynomial can be approximated. We present splitting field-independent methods for computing the Galois group of an Eisenstein polynomial over a p-adic field. Our approach is to combine information from different disciplines. We primarily, make use of the ramification polygon of the polynomial, which is the Newton polygon of a related polynomial. This allows us to quickly calculate several invariants that serve to reduce the number of possible Galois groups. Algorithms by Greve and Pauli very efficiently return the Galois group of polynomials where the ramification polygon consists of one segment as well as information about the subfields of the stem field. Second, we look at the factorization of linear absolute resolvents to further narrow the pool of possible groups.

Fast beampattern evaluation by polynomial rooting

NASA Astrophysics Data System (ADS)

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.

Numerical solutions for Helmholtz equations using Bernoulli polynomials

NASA Astrophysics Data System (ADS)

Bicer, Kubra Erdem; Yalcinbas, Salih

2017-07-01

This paper reports a new numerical method based on Bernoulli polynomials for the solution of Helmholtz equations. The method uses matrix forms of Bernoulli polynomials and their derivatives by means of collocation points. Aim of this paper is to solve Helmholtz equations using this matrix relations.

Should We Stop Developing Heuristics and Only Rely on Mixed Integer Programming Solvers in Automated Test Assembly? A Rejoinder to van der Linden and Li (2016).

PubMed

Chen, Pei-Hua

2017-05-01

This rejoinder responds to the commentary by van der Linden and Li entiled "Comment on Three-Element Item Selection Procedures for Multiple Forms Assembly: An Item Matching Approach" on the article "Three-Element Item Selection Procedures for Multiple Forms Assembly: An Item Matching Approach" by Chen. Van der Linden and Li made a strong statement calling for the cessation of test assembly heuristics development, and instead encouraged embracing mixed integer programming (MIP). This article points out the nondeterministic polynomial (NP)-hard nature of MIP problems and how solutions found using heuristics could be useful in an MIP context. Although van der Linden and Li provided several practical examples of test assembly supporting their view, the examples ignore the cases in which a slight change of constraints or item pool data might mean it would not be possible to obtain solutions as quickly as before. The article illustrates the use of heuristic solutions to improve both the performance of MIP solvers and the quality of solutions. Additional responses to the commentary by van der Linden and Li are included.

Computing Tutte polynomials of contact networks in classrooms

NASA Astrophysics Data System (ADS)

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

Polynomial interpolation and sums of powers of integers

NASA Astrophysics Data System (ADS)

Cereceda, José Luis

2017-02-01

In this note, we revisit the problem of polynomial interpolation and explicitly construct two polynomials in n of degree k + 1, Pk(n) and Qk(n), such that Pk(n) = Qk(n) = fk(n) for n = 1, 2,… , k, where fk(1), fk(2),… , fk(k) are k arbitrarily chosen (real or complex) values. Then, we focus on the case that fk(n) is given by the sum of powers of the first n positive integers Sk(n) = 1k + 2k + ṡṡṡ + nk, and show that Sk(n) admits the polynomial representations Sk(n) = Pk(n) and Sk(n) = Qk(n) for all n = 1, 2,… , and k ≥ 1, where the first representation involves the Eulerian numbers, and the second one the Stirling numbers of the second kind. Finally, we consider yet another polynomial formula for Sk(n) alternative to the well-known formula of Bernoulli.

Learning polynomial feedforward neural networks by genetic programming and backpropagation.

PubMed

Nikolaev, N Y; Iba, H

2003-01-01

This paper presents an approach to learning polynomial feedforward neural networks (PFNNs). The approach suggests, first, finding the polynomial network structure by means of a population-based search technique relying on the genetic programming paradigm, and second, further adjustment of the best discovered network weights by an especially derived backpropagation algorithm for higher order networks with polynomial activation functions. These two stages of the PFNN learning process enable us to identify networks with good training as well as generalization performance. Empirical results show that this approach finds PFNN which outperform considerably some previous constructive polynomial network algorithms on processing benchmark time series.

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

PubMed

Haglund, J; Haiman, M; Loehr, N

2005-02-22

Haglund recently proposed a combinatorial interpretation of the modified Macdonald polynomials H(mu). We give a combinatorial proof of this conjecture, which establishes the existence and integrality of H(mu). As corollaries, we obtain the cocharge formula of Lascoux and Schutzenberger for Hall-Littlewood polynomials, a formula of Sahi and Knop for Jack's symmetric functions, a generalization of this result to the integral Macdonald polynomials J(mu), a formula for H(mu) in terms of Lascoux-Leclerc-Thibon polynomials, and combinatorial expressions for the Kostka-Macdonald coefficients K(lambda,mu) when mu is a two-column shape.

Higher order derivatives of R-Jacobi polynomials

NASA Astrophysics Data System (ADS)

Das, Sourav; Swaminathan, A.

2016-06-01

In this work, the R-Jacobi polynomials defined on the nonnegative real axis related to F-distribution are considered. Using their Sturm-Liouville system higher order derivatives are constructed. Orthogonality property of these higher ordered R-Jacobi polynomials are obtained besides their normal form, self-adjoint form and hypergeometric representation. Interesting results on the Interpolation formula and Gaussian quadrature formulae are obtained with numerical examples.

Torus Knot Polynomials and Susy Wilson Loops

NASA Astrophysics Data System (ADS)

Giasemidis, Georgios; Tierz, Miguel

2014-12-01

We give, using an explicit expression obtained in (Jones V, Ann Math 126:335, 1987), a basic hypergeometric representation of the HOMFLY polynomial of ( n, m) torus knots, and present a number of equivalent expressions, all related by Heine's transformations. Using this result, the symmetry and the leading polynomial at large N are explicit. We show the latter to be the Wilson loop of 2d Yang-Mills theory on the plane. In addition, after taking one winding to infinity, it becomes the Wilson loop in the zero instanton sector of the 2d Yang-Mills theory, which is known to give averages of Wilson loops in = 4 SYM theory. We also give, using matrix models, an interpretation of the HOMFLY polynomial and the corresponding Jones-Rosso representation in terms of q-harmonic oscillators.

Identities associated with Milne-Thomson type polynomials and special numbers.

PubMed

Simsek, Yilmaz; Cakic, Nenad

2018-01-01

The purpose of this paper is to give identities and relations including the Milne-Thomson polynomials, the Hermite polynomials, the Bernoulli numbers, the Euler numbers, the Stirling numbers, the central factorial numbers, and the Cauchy numbers. By using fermionic and bosonic p -adic integrals, we derive some new relations and formulas related to these numbers and polynomials, and also the combinatorial sums.

On direct theorems for best polynomial approximation

NASA Astrophysics Data System (ADS)

Auad, A. A.; AbdulJabbar, R. S.

2018-05-01

This paper is to obtain similarity for the best approximation degree of functions, which are unbounded in L p,α (A = [0,1]), which called weighted space by algebraic polynomials. {E}nH{(f)}p,α and the best approximation degree in the same space on the interval [0,2π] by trigonometric polynomials {E}nT{(f)}p,α of direct wellknown theorems in forms the average modules.

Maximal aggregation of polynomial dynamical systems

PubMed Central

Cardelli, Luca; Tschaikowski, Max

2017-01-01

Ordinary differential equations (ODEs) with polynomial derivatives are a fundamental tool for understanding the dynamics of systems across many branches of science, but our ability to gain mechanistic insight and effectively conduct numerical evaluations is critically hindered when dealing with large models. Here we propose an aggregation technique that rests on two notions of equivalence relating ODE variables whenever they have the same solution (backward criterion) or if a self-consistent system can be written for describing the evolution of sums of variables in the same equivalence class (forward criterion). A key feature of our proposal is to encode a polynomial ODE system into a finitary structure akin to a formal chemical reaction network. This enables the development of a discrete algorithm to efficiently compute the largest equivalence, building on approaches rooted in computer science to minimize basic models of computation through iterative partition refinements. The physical interpretability of the aggregation is shown on polynomial ODE systems for biochemical reaction networks, gene regulatory networks, and evolutionary game theory. PMID:28878023

Eye aberration analysis with Zernike polynomials

NASA Astrophysics Data System (ADS)

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.

Animating Nested Taylor Polynomials to Approximate a Function

ERIC Educational Resources Information Center

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…

On the coefficients of differentiated expansions of ultraspherical polynomials

NASA Technical Reports Server (NTRS)

Karageorghis, Andreas; Phillips, Timothy N.

1989-01-01

A formula expressing the coefficients of an expression of ultraspherical polynomials which has been differentiated an arbitrary number of times in terms of the coefficients of the original expansion is proved. The particular examples of Chebyshev and Legendre polynomials are considered.

Orthonormal vector polynomials in a unit circle, Part I: Basis set derived from gradients of Zernike polynomials.

PubMed

Zhao, Chunyu; Burge, James H

2007-12-24

Zernike polynomials provide a well known, orthogonal set of scalar functions over a circular domain, and are commonly used to represent wavefront phase or surface irregularity. A related set of orthogonal functions is given here which represent vector quantities, such as mapping distortion or wavefront gradient. These functions are generated from gradients of Zernike polynomials, made orthonormal using the Gram- Schmidt technique. This set provides a complete basis for representing vector fields that can be defined as a gradient of some scalar function. It is then efficient to transform from the coefficients of the vector functions to the scalar Zernike polynomials that represent the function whose gradient was fit. These new vector functions have immediate application for fitting data from a Shack-Hartmann wavefront sensor or for fitting mapping distortion for optical testing. A subsequent paper gives an additional set of vector functions consisting only of rotational terms with zero divergence. The two sets together provide a complete basis that can represent all vector distributions in a circular domain.

Polynomial asymptotes of the second kind

NASA Astrophysics Data System (ADS)

Dobbs, David E.

2011-03-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 conics. Prerequisites include the division algorithm for polynomials with coefficients in the field of real numbers and elementary facts about limits from calculus. This note could be used as enrichment material in courses ranging from Calculus to Real Analysis to Abstract Algebra.

Distortion theorems for polynomials on a circle

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dubinin, V N

2000-12-31

Inequalities for the derivatives with respect to {phi}=arg z the functions ReP(z), |P(z)|{sup 2} and arg P(z) are established for an algebraic polynomial P(z) at points on the circle |z|=1. These estimates depend, in particular, on the constant term and the leading coefficient of the polynomial P(z) and improve the classical Bernstein and Turan inequalities. The method of proof is based on the techniques of generalized reduced moduli.

Quantization of gauge fields, graph polynomials and graph homology

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kreimer, Dirk, E-mail: kreimer@physik.hu-berlin.de; Sars, Matthias; Suijlekom, Walter D. van

2013-09-15

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

From Chebyshev to Bernstein: A Tour of Polynomials Small and Large

ERIC Educational Resources Information Center

Boelkins, Matthew; Miller, Jennifer; Vugteveen, Benjamin

2006-01-01

Consider the family of monic polynomials of degree n having zeros at -1 and +1 and all their other real zeros in between these two values. This article explores the size of these polynomials using the supremum of the absolute value on [-1, 1], showing that scaled Chebyshev and Bernstein polynomials give the extremes.

Polynomial equations for science orbits around Europa

NASA Astrophysics Data System (ADS)

Cinelli, Marco; Circi, Christian; Ortore, Emiliano

2015-07-01

In this paper, the design of science orbits for the observation of a celestial body has been carried out using polynomial equations. The effects related to the main zonal harmonics of the celestial body and the perturbation deriving from the presence of a third celestial body have been taken into account. The third body describes a circular and equatorial orbit with respect to the primary body and, for its disturbing potential, an expansion in Legendre polynomials up to the second order has been considered. These polynomial equations allow the determination of science orbits around Jupiter's satellite Europa, where the third body gravitational attraction represents one of the main forces influencing the motion of an orbiting probe. Thus, the retrieved relationships have been applied to this moon and periodic sun-synchronous and multi-sun-synchronous orbits have been determined. Finally, numerical simulations have been carried out to validate the analytical results.

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

NASA Astrophysics Data System (ADS)

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.

Riemann-Liouville Fractional Calculus of Certain Finite Class of Classical Orthogonal Polynomials

NASA Astrophysics Data System (ADS)

Malik, Pradeep; Swaminathan, A.

2010-11-01

In this work we consider certain class of classical orthogonal polynomials defined on the positive real line. These polynomials have their weight function related to the probability density function of F distribution and are finite in number up to orthogonality. We generalize these polynomials for fractional order by considering the Riemann-Liouville type operator on these polynomials. Various properties like explicit representation in terms of hypergeometric functions, differential equations, recurrence relations are derived.

Generalized Freud's equation and level densities with polynomial potential

NASA Astrophysics Data System (ADS)

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.

Asymptotic formulae for the zeros of orthogonal polynomials

DOE Office of Scientific and Technical Information (OSTI.GOV)

Badkov, V M

2012-09-30

Let p{sub n}(t) be an algebraic polynomial that is orthonormal with weight p(t) on the interval [-1, 1]. When p(t) is a perturbation (in certain limits) of the Chebyshev weight of the first kind, the zeros of the polynomial p{sub n}( cos {tau}) and the differences between pairs of (not necessarily consecutive) zeros are shown to satisfy asymptotic formulae as n{yields}{infinity}, which hold uniformly with respect to the indices of the zeros. Similar results are also obtained for perturbations of the Chebyshev weight of the second kind. First, some preliminary results on the asymptotic behaviour of the difference between twomore » zeros of an orthogonal trigonometric polynomial, which are needed, are established. Bibliography: 15 titles.« less

Zeros and logarithmic asymptotics of Sobolev orthogonal polynomials for exponential weights

NASA Astrophysics Data System (ADS)

Díaz Mendoza, C.; Orive, R.; Pijeira Cabrera, H.

2009-12-01

We obtain the (contracted) weak zero asymptotics for orthogonal polynomials with respect to Sobolev inner products with exponential weights in the real semiaxis, of the form , with [gamma]>0, which include as particular cases the counterparts of the so-called Freud (i.e., when [phi] has a polynomial growth at infinity) and Erdös (when [phi] grows faster than any polynomial at infinity) weights. In addition, the boundness of the distance of the zeros of these Sobolev orthogonal polynomials to the convex hull of the support and, as a consequence, a result on logarithmic asymptotics are derived.

Polynomial compensation, inversion, and approximation of discrete time linear systems

NASA Technical Reports Server (NTRS)

Baram, Yoram

1987-01-01

The least-squares transformation of a discrete-time multivariable linear system into a desired one by convolving the first with a polynomial system yields optimal polynomial solutions to the problems of system compensation, inversion, and approximation. The polynomial coefficients are obtained from the solution to a so-called normal linear matrix equation, whose coefficients are shown to be the weighting patterns of certain linear systems. These, in turn, can be used in the recursive solution of the normal equation.

Distortion theorems for polynomials on a circle

NASA Astrophysics Data System (ADS)

Dubinin, V. N.

2000-12-01

Inequalities for the derivatives with respect to \\varphi=\\arg z the functions \\operatorname{Re}P(z), \\vert P(z)\\vert^2 and \\arg P(z) are established for an algebraic polynomial P(z) at points on the circle \\vert z\\vert=1. These estimates depend, in particular, on the constant term and the leading coefficient of the polynomial P(z) and improve the classical Bernstein and Turan inequalities. The method of proof is based on the techniques of generalized reduced moduli.

Multi-indexed Meixner and little q-Jacobi (Laguerre) polynomials

NASA Astrophysics Data System (ADS)

Odake, Satoru; Sasaki, Ryu

2017-04-01

As the fourth stage of the project multi-indexed orthogonal polynomials, we present the multi-indexed Meixner and little q-Jacobi (Laguerre) polynomials in the framework of ‘discrete quantum mechanics’ with real shifts defined on the semi-infinite lattice in one dimension. They are obtained, in a similar way to the multi-indexed Laguerre and Jacobi polynomials reported earlier, from the quantum mechanical systems corresponding to the original orthogonal polynomials by multiple application of the discrete analogue of the Darboux transformations or the Crum-Krein-Adler deletion of virtual state vectors. The virtual state vectors are the solutions of the matrix Schrödinger equation on all the lattice points having negative energies and infinite norm. This is in good contrast to the (q-)Racah systems defined on a finite lattice, in which the ‘virtual state’ vectors satisfy the matrix Schrödinger equation except for one of the two boundary points.

Staircase tableaux, the asymmetric exclusion process, and Askey-Wilson polynomials

PubMed Central

Corteel, Sylvie; Williams, Lauren K.

2010-01-01

We introduce some combinatorial objects called staircase tableaux, which have cardinality 4nn !, and connect them to both the asymmetric exclusion process (ASEP) and Askey-Wilson polynomials. The ASEP is a model from statistical mechanics introduced in the late 1960s, which describes a system of interacting particles hopping left and right on a one-dimensional lattice of n sites with open boundaries. It has been cited as a model for traffic flow and translation in protein synthesis. In its most general form, particles may enter and exit at the left with probabilities α and γ, and they may exit and enter at the right with probabilities β and δ. In the bulk, the probability of hopping left is q times the probability of hopping right. Our first result is a formula for the stationary distribution of the ASEP with all parameters general, in terms of staircase tableaux. Our second result is a formula for the moments of (the weight function of) Askey-Wilson polynomials, also in terms of staircase tableaux. Since the 1980s there has been a great deal of work giving combinatorial formulas for moments of classical orthogonal polynomials (e.g. Hermite, Charlier, Laguerre); among these polynomials, the Askey-Wilson polynomials are the most important, because they are at the top of the hierarchy of classical orthogonal polynomials. PMID:20348417

Staircase tableaux, the asymmetric exclusion process, and Askey-Wilson polynomials.

PubMed

Corteel, Sylvie; Williams, Lauren K

2010-04-13

We introduce some combinatorial objects called staircase tableaux, which have cardinality 4(n)n!, and connect them to both the asymmetric exclusion process (ASEP) and Askey-Wilson polynomials. The ASEP is a model from statistical mechanics introduced in the late 1960s, which describes a system of interacting particles hopping left and right on a one-dimensional lattice of n sites with open boundaries. It has been cited as a model for traffic flow and translation in protein synthesis. In its most general form, particles may enter and exit at the left with probabilities alpha and gamma, and they may exit and enter at the right with probabilities beta and delta. In the bulk, the probability of hopping left is q times the probability of hopping right. Our first result is a formula for the stationary distribution of the ASEP with all parameters general, in terms of staircase tableaux. Our second result is a formula for the moments of (the weight function of) Askey-Wilson polynomials, also in terms of staircase tableaux. Since the 1980s there has been a great deal of work giving combinatorial formulas for moments of classical orthogonal polynomials (e.g. Hermite, Charlier, Laguerre); among these polynomials, the Askey-Wilson polynomials are the most important, because they are at the top of the hierarchy of classical orthogonal polynomials.

Improved Potential Energy Surface of Ozone Constructed Using the Fitting by Permutationally Invariant Polynomial Function

DOE PAGES

Ayouz, Mehdi; Babikov, Dmitri

2012-01-01

New global potential energy surface for the ground electronic state of ozone is constructed at the complete basis set level of the multireference configuration interaction theory. A method of fitting the data points by analytical permutationally invariant polynomial function is adopted. A small set of 500 points is preoptimized using the old surface of ozone. In this procedure the positions of points in the configuration space are chosen such that the RMS deviation of the fit is minimized. New ab initio calculations are carried out at these points and are used to build new surface. Additional points are added tomore » the vicinity of the minimum energy path in order to improve accuracy of the fit, particularly in the region where the surface of ozone exhibits a shallow van der Waals well. New surface can be used to study formation of ozone at thermal energies and its spectroscopy near the dissociation threshold.« less

DIFFERENTIAL CROSS SECTION ANALYSIS IN KAON PHOTOPRODUCTION USING ASSOCIATED LEGENDRE POLYNOMIALS

DOE Office of Scientific and Technical Information (OSTI.GOV)

P. T. P. HUTAURUK, D. G. IRELAND, G. ROSNER

2009-04-01

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

Orthogonal Polynomials Associated with Complementary Chain Sequences

NASA Astrophysics Data System (ADS)

Behera, Kiran Kumar; Sri Ranga, A.; Swaminathan, A.

2016-07-01

Using the minimal parameter sequence of a given chain sequence, we introduce the concept of complementary chain sequences, which we view as perturbations of chain sequences. Using the relation between these complementary chain sequences and the corresponding Verblunsky coefficients, the para-orthogonal polynomials and the associated Szegő polynomials are analyzed. Two illustrations, one involving Gaussian hypergeometric functions and the other involving Carathéodory functions are also provided. A connection between these two illustrations by means of complementary chain sequences is also observed.

Quasi-kernel polynomials and convergence results for quasi-minimal residual iterations

NASA Technical Reports Server (NTRS)

Freund, Roland W.

1992-01-01

Recently, Freund and Nachtigal have proposed a novel polynominal-based iteration, the quasi-minimal residual algorithm (QMR), for solving general nonsingular non-Hermitian linear systems. Motivated by the QMR method, we have introduced the general concept of quasi-kernel polynomials, and we have shown that the QMR algorithm is based on a particular instance of quasi-kernel polynomials. In this paper, we continue our study of quasi-kernel polynomials. In particular, we derive bounds for the norms of quasi-kernel polynomials. These results are then applied to obtain convergence theorems both for the QMR method and for a transpose-free variant of QMR, the TFQMR algorithm.

Euler polynomials and identities for non-commutative operators

NASA Astrophysics Data System (ADS)

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.

On polynomial selection for the general number field sieve

NASA Astrophysics Data System (ADS)

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.

Calculators and Polynomial Evaluation.

ERIC Educational Resources Information Center

Weaver, J. F.

The intent of this paper is to suggest and illustrate how electronic hand-held calculators, especially non-programmable ones with limited data-storage capacity, can be used to advantage by students in one particular aspect of work with polynomial functions. The basic mathematical background upon which calculator application is built is summarized.…

Polynomial Conjoint Analysis of Similarities: A Model for Constructing Polynomial Conjoint Measurement Algorithms.

ERIC Educational Resources Information Center

Young, Forrest W.

A model permitting construction of algorithms for the polynomial conjoint analysis of similarities is presented. This model, which is based on concepts used in nonmetric scaling, permits one to obtain the best approximate solution. The concepts used to construct nonmetric scaling algorithms are reviewed. Finally, examples of algorithmic models for…

Thermodynamic characterization of networks using graph polynomials

NASA Astrophysics Data System (ADS)

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

2015-09-01

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

Roots of polynomials by ratio of successive derivatives

NASA Technical Reports Server (NTRS)

Crouse, J. E.; Putt, C. W.

1972-01-01

An order of magnitude study of the ratios of successive polynomial derivatives yields information about the number of roots at an approached root point and the approximate location of a root point from a nearby point. The location approximation improves as a root is approached, so a powerful convergence procedure becomes available. These principles are developed into a computer program which finds the roots of polynomials with real number coefficients.

Polynomial Interpolation and Sums of Powers of Integers

ERIC Educational Resources Information Center

Cereceda, José Luis

2017-01-01

In this note, we revisit the problem of polynomial interpolation and explicitly construct two polynomials in n of degree k + 1, P[subscript k](n) and Q[subscript k](n), such that P[subscript k](n) = Q[subscript k](n) = f[subscript k](n) for n = 1, 2,… , k, where f[subscript k](1), f[subscript k](2),… , f[subscript k](k) are k arbitrarily chosen…

Asymptotically extremal polynomials with respect to varying weights and application to Sobolev orthogonality

NASA Astrophysics Data System (ADS)

Díaz Mendoza, C.; Orive, R.; Pijeira Cabrera, H.

2008-10-01

We study the asymptotic behavior of the zeros of a sequence of polynomials whose weighted norms, with respect to a sequence of weight functions, have the same nth root asymptotic behavior as the weighted norms of certain extremal polynomials. This result is applied to obtain the (contracted) weak zero distribution for orthogonal polynomials with respect to a Sobolev inner product with exponential weights of the form e-[phi](x), giving a unified treatment for the so-called Freud (i.e., when [phi] has polynomial growth at infinity) and Erdös (when [phi] grows faster than any polynomial at infinity) cases. In addition, we provide a new proof for the bound of the distance of the zeros to the convex hull of the support for these Sobolev orthogonal polynomials.

A Riemann-Hilbert approach to asymptotic questions for orthogonal polynomials

NASA Astrophysics Data System (ADS)

Deift, P.; Kriecherbauer, T.; McLaughlin, K. T.-R.; Venakides, S.; Zhou, X.

2001-08-01

A few years ago the authors introduced a new approach to study asymptotic questions for orthogonal polynomials. In this paper we give an overview of our method and review the results which have been obtained in Deift et al. (Internat. Math. Res. Notices (1997) 759, Comm. Pure Appl. Math. 52 (1999) 1491, 1335), Deift (Orthogonal Polynomials and Random Matrices: A Riemann-Hilbert Approach, Courant Lecture Notes, Vol. 3, New York University, 1999), Kriecherbauer and McLaughlin (Internat. Math. Res. Notices (1999) 299) and Baik et al. (J. Amer. Math. Soc. 12 (1999) 1119). We mainly consider orthogonal polynomials with respect to weights on the real line which are either (1) Freud-type weights d[alpha](x)=e-Q(x) dx (Q polynomial or Q(x)=x[beta], [beta]>0), or (2) varying weights d[alpha]n(x)=e-nV(x) dx (V analytic, limx-->[infinity] V(x)/logx=[infinity]). We obtain Plancherel-Rotach-type asymptotics in the entire complex plane as well as asymptotic formulae with error estimates for the leading coefficients, for the recurrence coefficients, and for the zeros of the orthogonal polynomials. Our proof starts from an observation of Fokas et al. (Comm. Math. Phys. 142 (1991) 313) that the orthogonal polynomials can be determined as solutions of certain matrix valued Riemann-Hilbert problems. We analyze the Riemann-Hilbert problems by a steepest descent type method introduced by Deift and Zhou (Ann. Math. 137 (1993) 295) and further developed in Deift and Zhou (Comm. Pure Appl. Math. 48 (1995) 277) and Deift et al. (Proc. Nat. Acad. Sci. USA 95 (1998) 450). A crucial step in our analysis is the use of the well-known equilibrium measure which describes the asymptotic distribution of the zeros of the orthogonal polynomials.

Accurate Estimation of Solvation Free Energy Using Polynomial Fitting Techniques

PubMed Central

Shyu, Conrad; Ytreberg, F. Marty

2010-01-01

This report details an approach to improve the accuracy of free energy difference estimates using thermodynamic integration data (slope of the free energy with respect to the switching variable λ) and its application to calculating solvation free energy. The central idea is to utilize polynomial fitting schemes to approximate the thermodynamic integration data to improve the accuracy of the free energy difference estimates. Previously, we introduced the use of polynomial regression technique to fit thermodynamic integration data (Shyu and Ytreberg, J Comput Chem 30: 2297–2304, 2009). In this report we introduce polynomial and spline interpolation techniques. Two systems with analytically solvable relative free energies are used to test the accuracy of the interpolation approach. We also use both interpolation and regression methods to determine a small molecule solvation free energy. Our simulations show that, using such polynomial techniques and non-equidistant λ values, the solvation free energy can be estimated with high accuracy without using soft-core scaling and separate simulations for Lennard-Jones and partial charges. The results from our study suggest these polynomial techniques, especially with use of non-equidistant λ values, improve the accuracy for ΔF estimates without demanding additional simulations. We also provide general guidelines for use of polynomial fitting to estimate free energy. To allow researchers to immediately utilize these methods, free software and documentation is provided via http://www.phys.uidaho.edu/ytreberg/software. PMID:20623657

Kato expansion in quantum canonical perturbation theory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nikolaev, Andrey, E-mail: Andrey.Nikolaev@rdtex.ru

2016-06-15

This work establishes a connection between canonical perturbation series in quantum mechanics and a Kato expansion for the resolvent of the Liouville superoperator. Our approach leads to an explicit expression for a generator of a block-diagonalizing Dyson’s ordered exponential in arbitrary perturbation order. Unitary intertwining of perturbed and unperturbed averaging superprojectors allows for a description of ambiguities in the generator and block-diagonalized Hamiltonian. We compare the efficiency of the corresponding computational algorithm with the efficiencies of the Van Vleck and Magnus methods for high perturbative orders.

Optimum satellite relay positions with application to a TDRS-1 Indian Ocean relay

NASA Technical Reports Server (NTRS)

Jackson, A. H.; Christopher, P.

1994-01-01

An Indian Ocean satellite relay is examined. The relay satellite position is optimized by minimizing the sum of downlink and satellite to satellite link losses. Osculating orbital elements are used for fast intensive orbital computation. Integrated Van Vleck gaseous attenuation and a Crane rain model are used for downlink attenuation. Circular polarization losses on the satellite to satellite link are found dynamically. Space to ground link antenna pointing losses are included as a function of yaw ans spacecraft limits. Relay satellite positions between 90 to 100 degrees East are found attractive for further study.

Using Tutte polynomials to analyze the structure of the benzodiazepines

NASA Astrophysics Data System (ADS)

Cadavid Muñoz, Juan José

2014-05-01

Graph theory in general and Tutte polynomials in particular, are implemented for analyzing the chemical structure of the benzodiazepines. Similarity analysis are used with the Tutte polynomials for finding other molecules that are similar to the benzodiazepines and therefore that might show similar psycho-active actions for medical purpose, in order to evade the drawbacks associated to the benzodiazepines based medicine. For each type of benzodiazepines, Tutte polynomials are computed and some numeric characteristics are obtained, such as the number of spanning trees and the number of spanning forests. Computations are done using the computer algebra Maple's GraphTheory package. The obtained analytical results are of great importance in pharmaceutical engineering. As a future research line, the usage of the chemistry computational program named Spartan, will be used to extent and compare it with the obtained results from the Tutte polynomials of benzodiazepines.

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

PubMed

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.

Evaluation of more general integrals involving universal associated Legendre polynomials

NASA Astrophysics Data System (ADS)

You, Yuan; Chen, Chang-Yuan; Tahir, Farida; Dong, Shi-Hai

2017-05-01

We find that the solution of the polar angular differential equation can be written as the universal associated Legendre polynomials. We present a popular integral formula which includes universal associated Legendre polynomials and we also evaluate some important integrals involving the product of two universal associated Legendre polynomials Pl' m'(x ) , Pk' n'(x ) and x2 a(1-x2 ) -p -1, xb(1±x2 ) -p, and xc(1-x2 ) -p(1±x ) -1, where l'≠k' and m'≠n'. Their selection rules are also mentioned.

Robust stability of fractional order polynomials with complicated uncertainty structure

PubMed Central

Şenol, Bilal; Pekař, Libor

2017-01-01

The main aim of this article is to present a graphical approach to robust stability analysis for families of fractional order (quasi-)polynomials with complicated uncertainty structure. More specifically, the work emphasizes the multilinear, polynomial and general structures of uncertainty and, moreover, the retarded quasi-polynomials with parametric uncertainty are studied. Since the families with these complex uncertainty structures suffer from the lack of analytical tools, their robust stability is investigated by numerical calculation and depiction of the value sets and subsequent application of the zero exclusion condition. PMID:28662173

Polynomial probability distribution estimation using the method of moments

PubMed Central

Mattsson, Lars; Rydén, Jesper

2017-01-01

We suggest a procedure for estimating Nth degree polynomial approximations to unknown (or known) probability density functions (PDFs) based on N statistical moments from each distribution. The procedure is based on the method of moments and is setup algorithmically to aid applicability and to ensure rigor in use. In order to show applicability, polynomial PDF approximations are obtained for the distribution families Normal, Log-Normal, Weibull as well as for a bimodal Weibull distribution and a data set of anonymized household electricity use. The results are compared with results for traditional PDF series expansion methods of Gram–Charlier type. It is concluded that this procedure is a comparatively simple procedure that could be used when traditional distribution families are not applicable or when polynomial expansions of probability distributions might be considered useful approximations. In particular this approach is practical for calculating convolutions of distributions, since such operations become integrals of polynomial expressions. Finally, in order to show an advanced applicability of the method, it is shown to be useful for approximating solutions to the Smoluchowski equation. PMID:28394949

Polynomial probability distribution estimation using the method of moments.

PubMed

Munkhammar, Joakim; Mattsson, Lars; Rydén, Jesper

2017-01-01

We suggest a procedure for estimating Nth degree polynomial approximations to unknown (or known) probability density functions (PDFs) based on N statistical moments from each distribution. The procedure is based on the method of moments and is setup algorithmically to aid applicability and to ensure rigor in use. In order to show applicability, polynomial PDF approximations are obtained for the distribution families Normal, Log-Normal, Weibull as well as for a bimodal Weibull distribution and a data set of anonymized household electricity use. The results are compared with results for traditional PDF series expansion methods of Gram-Charlier type. It is concluded that this procedure is a comparatively simple procedure that could be used when traditional distribution families are not applicable or when polynomial expansions of probability distributions might be considered useful approximations. In particular this approach is practical for calculating convolutions of distributions, since such operations become integrals of polynomial expressions. Finally, in order to show an advanced applicability of the method, it is shown to be useful for approximating solutions to the Smoluchowski equation.

Polynomials to model the growth of young bulls in performance tests.

PubMed

Scalez, D C B; Fragomeni, B O; Passafaro, T L; Pereira, I G; Toral, F L B

2014-03-01

The use of polynomial functions to describe the average growth trajectory and covariance functions of Nellore and MA (21/32 Charolais+11/32 Nellore) young bulls in performance tests was studied. The average growth trajectories and additive genetic and permanent environmental covariance functions were fit with Legendre (linear through quintic) and quadratic B-spline (with two to four intervals) polynomials. In general, the Legendre and quadratic B-spline models that included more covariance parameters provided a better fit with the data. When comparing models with the same number of parameters, the quadratic B-spline provided a better fit than the Legendre polynomials. The quadratic B-spline with four intervals provided the best fit for the Nellore and MA groups. The fitting of random regression models with different types of polynomials (Legendre polynomials or B-spline) affected neither the genetic parameters estimates nor the ranking of the Nellore young bulls. However, fitting different type of polynomials affected the genetic parameters estimates and the ranking of the MA young bulls. Parsimonious Legendre or quadratic B-spline models could be used for genetic evaluation of body weight of Nellore young bulls in performance tests, whereas these parsimonious models were less efficient for animals of the MA genetic group owing to limited data at the extreme ages.

Vector-valued Jack polynomials and wavefunctions on the torus

NASA Astrophysics Data System (ADS)

Dunkl, Charles F.

2017-06-01

The Hamiltonian of the quantum Calogero-Sutherland model of N identical particles on the circle with 1/r 2 interactions has eigenfunctions consisting of Jack polynomials times the base state. By use of the generalized Jack polynomials taking values in modules of the symmetric group and the matrix solution of a system of linear differential equations one constructs novel eigenfunctions of the Hamiltonian. Like the usual wavefunctions each eigenfunction determines a symmetric probability density on the N-torus. The construction applies to any irreducible representation of the symmetric group. The methods depend on the theory of generalized Jack polynomials due to Griffeth, and the Yang-Baxter graph approach of Luque and the author.

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

ERIC Educational Resources Information Center

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…

Hydrodynamics of the VanA-type VanS histidine kinase: an extended solution conformation and first evidence for interactions with vancomycin

PubMed Central

Phillips-Jones, Mary K.; Channell, Guy; Kelsall, Claire J.; Hughes, Charlotte S.; Ashcroft, Alison E.; Patching, Simon G.; Dinu, Vlad; Gillis, Richard B.; Adams, Gary G.; Harding, Stephen E.

2017-01-01

VanA-type resistance to glycopeptide antibiotics in clinical enterococci is regulated by the VanSARA two-component signal transduction system. The nature of the molecular ligand that is recognised by the VanSA sensory component has not hitherto been identified. Here we employ purified, intact and active VanSA membrane protein (henceforth referred to as VanS) in analytical ultracentrifugation experiments to study VanS oligomeric state and conformation in the absence and presence of vancomycin. A combination of sedimentation velocity and sedimentation equilibrium in the analytical ultracentrifuge (SEDFIT, SEDFIT-MSTAR and MULTISIG analysis) showed that VanS in the absence of the ligand is almost entirely monomeric (molar mass M = 45.7 kDa) in dilute aqueous solution with a trace amount of high molar mass material (M ~ 200 kDa). The sedimentation coefficient s suggests the monomer adopts an extended conformation in aqueous solution with an equivalent aspect ratio of ~(12 ± 2). In the presence of vancomycin over a 33% increase in the sedimentation coefficient is observed with the appearance of additional higher s components, demonstrating an interaction, an observation consistent with our circular dichroism measurements. The two possible causes of this increase in s – either a ligand induced dimerization and/or compaction of the monomer are considered. PMID:28397853

Polynomial chaos expansion with random and fuzzy variables

NASA Astrophysics Data System (ADS)

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.

Polynomial algebra of discrete models in systems biology.

PubMed

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.

High degree interpolation polynomial in Newton form

NASA Technical Reports Server (NTRS)

Tal-Ezer, Hillel

1988-01-01

Polynomial interpolation is an essential subject in numerical analysis. Dealing with a real interval, it is well known that even if f(x) is an analytic function, interpolating at equally spaced points can diverge. On the other hand, interpolating at the zeroes of the corresponding Chebyshev polynomial will converge. Using the Newton formula, this result of convergence is true only on the theoretical level. It is shown that the algorithm which computes the divided differences is numerically stable only if: (1) the interpolating points are arranged in a different order, and (2) the size of the interval is 4.

Mathematics of Zernike polynomials: a review.

PubMed

McAlinden, Colm; McCartney, Mark; Moore, Jonathan

2011-11-01

Monochromatic aberrations of the eye principally originate from the cornea and the crystalline lens. Aberrometers operate via differing principles but function by either analysing the reflected wavefront from the retina or by analysing an image on the retina. Aberrations may be described as lower order or higher order aberrations with Zernike polynomials being the most commonly employed fitting method. The complex mathematical aspects with regards the Zernike polynomial expansion series are detailed in this review. Refractive surgery has been a key clinical application of aberrometers; however, more recently aberrometers have been used in a range of other areas ophthalmology including corneal diseases, cataract and retinal imaging. © 2011 The Authors. Clinical and Experimental Ophthalmology © 2011 Royal Australian and New Zealand College of Ophthalmologists.

On the connection coefficients and recurrence relations arising from expansions in series of Laguerre polynomials

NASA Astrophysics Data System (ADS)

Doha, E. H.

2003-05-01

A formula expressing the Laguerre coefficients of a general-order derivative of an infinitely differentiable function in terms of its original coefficients is proved, and a formula expressing explicitly the derivatives of Laguerre polynomials of any degree and for any order as a linear combination of suitable Laguerre polynomials is deduced. A formula for the Laguerre coefficients of the moments of one single Laguerre polynomial of certain degree is given. Formulae for the Laguerre coefficients of the moments of a general-order derivative of an infinitely differentiable function in terms of its Laguerre coefficients are also obtained. A simple approach in order to build and solve recursively for the connection coefficients between Jacobi-Laguerre and Hermite-Laguerre polynomials is described. An explicit formula for these coefficients between Jacobi and Laguerre polynomials is given, of which the ultra-spherical polynomials of the first and second kinds and Legendre polynomials are important special cases. An analytical formula for the connection coefficients between Hermite and Laguerre polynomials is also obtained.

Transfer matrix computation of generalized critical polynomials in percolation

DOE PAGES

Scullard, Christian R.; Jacobsen, Jesper Lykke

2012-09-27

Percolation thresholds have recently been studied by means of a graph polynomial PB(p), henceforth referred to as the critical polynomial, that may be defined on any periodic lattice. The polynomial depends on a finite subgraph B, called the basis, and the way in which the basis is tiled to form the lattice. The unique root of P B(p) in [0, 1] either gives the exact percolation threshold for the lattice, or provides an approximation that becomes more accurate with appropriately increasing size of B. Initially P B(p) was defined by a contraction-deletion identity, similar to that satisfied by the Tuttemore » polynomial. Here, we give an alternative probabilistic definition of P B(p), which allows for much more efficient computations, by using the transfer matrix, than was previously possible with contraction-deletion. We present bond percolation polynomials for the (4, 82), kagome, and (3, 122) lattices for bases of up to respectively 96, 162, and 243 edges, much larger than the previous limit of 36 edges using contraction-deletion. We discuss in detail the role of the symmetries and the embedding of B. For the largest bases, we obtain the thresholds p c(4, 82) = 0.676 803 329 · · ·, p c(kagome) = 0.524 404 998 · · ·, p c(3, 122) = 0.740 420 798 · · ·, comparable to the best simulation results. We also show that the alternative definition of P B(p) can be applied to study site percolation problems.« less

a Unified Matrix Polynomial Approach to Modal Identification

NASA Astrophysics Data System (ADS)

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.

Hermite polynomials and quasi-classical asymptotics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ali, S. Twareque, E-mail: twareque.ali@concordia.ca; Engliš, Miroslav, E-mail: englis@math.cas.cz

2014-04-15

We study an unorthodox variant of the Berezin-Toeplitz type of quantization scheme, on a reproducing kernel Hilbert space generated by the real Hermite polynomials and work out the associated quasi-classical asymptotics.

Co-colonization of vanA and vanB Enterococcus faecium of clonal complex 17 in a patient with bacteremia due to vanA E. faecium.

PubMed

Seol, Chang Ahn; Park, Jeong Su; Sung, Heungsup; Kim, Mi-Na

2014-06-01

A 53-year-old Vietnamese man with liver cirrhosis was transferred from a Vietnamese hospital to our tertiary care hospital in Korea in order to undergo a liver transplantation. Bacteremia due to vanA Enterococcus faecium was diagnosed, and stool surveillance cultures for vancomycin-resistant enterococci (VRE) were positive for both vanA and vanB E. faecium. Pulsed-field gel electrophoresis analysis revealed that the 2 vanA VRE isolates from the blood and stool were clonal, but the vanB VRE was unrelated to the vanA VRE. vanA and vanB VRE were ST64 and ST18, single-allele variations of clonal complex 17, respectively. This is the first case report of vanA VRE bacteremia in a Vietnamese patient and demonstrates the reemergence of vanB VRE since a single outbreak occurred 15years ago in Korea. The reemergence of vanB VRE emphasizes the importance of VRE genotyping to prevent the spread of new VRE strains. Copyright © 2014 Elsevier Inc. All rights reserved.

Polynomial sequences for bond percolation critical thresholds

DOE PAGES

Scullard, Christian R.

2011-09-22

In this paper, I compute the inhomogeneous (multi-probability) bond critical surfaces for the (4, 6, 12) and (3 4, 6) using the linearity approximation described in (Scullard and Ziff, J. Stat. Mech. 03021), implemented as a branching process of lattices. I find the estimates for the bond percolation thresholds, pc(4, 6, 12) = 0.69377849... and p c(3 4, 6) = 0.43437077..., compared with Parviainen’s numerical results of p c = 0.69373383... and p c = 0.43430621... . These deviations are of the order 10 -5, as is standard for this method. Deriving thresholds in this way for a given latticemore » leads to a polynomial with integer coefficients, the root in [0, 1] of which gives the estimate for the bond threshold and I show how the method can be refined, leading to a series of higher order polynomials making predictions that likely converge to the exact answer. Finally, I discuss how this fact hints that for certain graphs, such as the kagome lattice, the exact bond threshold may not be the root of any polynomial with integer coefficients.« less

Weierstrass method for quaternionic polynomial root-finding

NASA Astrophysics Data System (ADS)

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.

Polynomial reduction and evaluation of tree- and loop-level CHY amplitudes

DOE PAGES

Zlotnikov, Michael

2016-08-24

We develop a polynomial reduction procedure that transforms any gauge fixed CHY amplitude integrand for n scattering particles into a σ-moduli multivariate polynomial of what we call the standard form. We show that a standard form polynomial must have a specific ladder type monomial structure, which has finite size at any n, with highest multivariate degree given by (n – 3)(n – 4)/2. This set of monomials spans a complete basis for polynomials with rational coefficients in kinematic data on the support of scattering equations. Subsequently, at tree and one-loop level, we employ the global residue theorem to derive amore » prescription that evaluates any CHY amplitude by means of collecting simple residues at infinity only. Furthermore, the prescription is then applied explicitly to some tree and one-loop amplitude examples.« less

Recurrence relations for orthogonal polynomials for PDEs in polar and cylindrical geometries.

PubMed

Richardson, Megan; Lambers, James V

2016-01-01

This paper introduces two families of orthogonal polynomials on the interval (-1,1), with weight function [Formula: see text]. The first family satisfies the boundary condition [Formula: see text], and the second one satisfies the boundary conditions [Formula: see text]. These boundary conditions arise naturally from PDEs defined on a disk with Dirichlet boundary conditions and the requirement of regularity in Cartesian coordinates. The families of orthogonal polynomials are obtained by orthogonalizing short linear combinations of Legendre polynomials that satisfy the same boundary conditions. Then, the three-term recurrence relations are derived. Finally, it is shown that from these recurrence relations, one can efficiently compute the corresponding recurrences for generalized Jacobi polynomials that satisfy the same boundary conditions.

Algorithms for Solvents and Spectral Factors of Matrix Polynomials

DTIC Science & Technology

1981-01-01

spectral factors of matrix polynomials LEANG S. SHIEHt, YIH T. TSAYt and NORMAN P. COLEMANt A generalized Newton method , based on the contracted gradient...of a matrix poly- nomial, is derived for solving the right (left) solvents and spectral factors of matrix polynomials. Two methods of selecting initial...estimates for rapid convergence of the newly developed numerical method are proposed. Also, new algorithms for solving complete sets of the right

The neighbourhood polynomial of some families of dendrimers

NASA Astrophysics Data System (ADS)

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.

Recurrence approach and higher order polynomial algebras for superintegrable monopole systems

NASA Astrophysics Data System (ADS)

Hoque, Md Fazlul; Marquette, Ian; Zhang, Yao-Zhong

2018-05-01

We revisit the MIC-harmonic oscillator in flat space with monopole interaction and derive the polynomial algebra satisfied by the integrals of motion and its energy spectrum using the ad hoc recurrence approach. We introduce a superintegrable monopole system in a generalized Taub-Newman-Unti-Tamburino (NUT) space. The Schrödinger equation of this model is solved in spherical coordinates in the framework of Stäckel transformation. It is shown that wave functions of the quantum system can be expressed in terms of the product of Laguerre and Jacobi polynomials. We construct ladder and shift operators based on the corresponding wave functions and obtain the recurrence formulas. By applying these recurrence relations, we construct higher order algebraically independent integrals of motion. We show that the integrals form a polynomial algebra. We construct the structure functions of the polynomial algebra and obtain the degenerate energy spectra of the model.

Application of polynomial su(1, 1) algebra to Pöschl-Teller potentials

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Hong-Biao, E-mail: zhanghb017@nenu.edu.cn; Lu, Lu

2013-12-15

Two novel polynomial su(1, 1) algebras for the physical systems with the first and second Pöschl-Teller (PT) potentials are constructed, and their specific representations are presented. Meanwhile, these polynomial su(1, 1) algebras are used as an algebraic technique to solve eigenvalues and eigenfunctions of the Hamiltonians associated with the first and second PT potentials. The algebraic approach explores an appropriate new pair of raising and lowing operators K-circumflex{sub ±} of polynomial su(1, 1) algebra as a pair of shift operators of our Hamiltonians. In addition, two usual su(1, 1) algebras associated with the first and second PT potentials are derivedmore » naturally from the polynomial su(1, 1) algebras built by us.« less

Genetic parameters of legendre polynomials for first parity lactation curves.

PubMed

Pool, M H; Janss, L L; Meuwissen, T H

2000-11-01

Variance components of the covariance function coefficients in a random regression test-day model were estimated by Legendre polynomials up to a fifth order for first-parity records of Dutch dairy cows using Gibbs sampling. Two Legendre polynomials of equal order were used to model the random part of the lactation curve, one for the genetic component and one for permanent environment. Test-day records from cows registered between 1990 to 1996 and collected by regular milk recording were available. For the data set, 23,700 complete lactations were selected from 475 herds sired by 262 sires. Because the application of a random regression model is limited by computing capacity, we investigated the minimum order needed to fit the variance structure in the data sufficiently. Predictions of genetic and permanent environmental variance structures were compared with bivariate estimates on 30-d intervals. A third-order or higher polynomial modeled the shape of variance curves over DIM with sufficient accuracy for the genetic and permanent environment part. Also, the genetic correlation structure was fitted with sufficient accuracy by a third-order polynomial, but, for the permanent environmental component, a fourth order was needed. Because equal orders are suggested in the literature, a fourth-order Legendre polynomial is recommended in this study. However, a rank of three for the genetic covariance matrix and of four for permanent environment allows a simpler covariance function with a reduced number of parameters based on the eigenvalues and eigenvectors.

Efficient computer algebra algorithms for polynomial matrices in control design

NASA Technical Reports Server (NTRS)

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

1989-01-01

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

Generalized clustering conditions of Jack polynomials at negative Jack parameter {alpha}

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bernevig, B. Andrei; Department of Physics, Princeton University, Princeton, New Jersey 08544; Haldane, F. D. M.

We present several conjectures on the behavior and clustering properties of Jack polynomials at a negative parameter {alpha}=-(k+1/r-1), with partitions that violate the (k,r,N)- admissibility rule of [Feigin et al. [Int. Math. Res. Notices 23, 1223 (2002)]. We find that the ''highest weight'' Jack polynomials of specific partitions represent the minimum degree polynomials in N variables that vanish when s distinct clusters of k+1 particles are formed, where s and k are positive integers. Explicit counting formulas are conjectured. The generalized clustering conditions are useful in a forthcoming description of fractional quantum Hall quasiparticles.

Quantum Hurwitz numbers and Macdonald polynomials

NASA Astrophysics Data System (ADS)

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.

Perceptually informed synthesis of bandlimited classical waveforms using integrated polynomial interpolation.

PubMed

Välimäki, Vesa; Pekonen, Jussi; Nam, Juhan

2012-01-01

Digital subtractive synthesis is a popular music synthesis method, which requires oscillators that are aliasing-free in a perceptual sense. It is a research challenge to find computationally efficient waveform generation algorithms that produce similar-sounding signals to analog music synthesizers but which are free from audible aliasing. A technique for approximately bandlimited waveform generation is considered that is based on a polynomial correction function, which is defined as the difference of a non-bandlimited step function and a polynomial approximation of the ideal bandlimited step function. It is shown that the ideal bandlimited step function is equivalent to the sine integral, and that integrated polynomial interpolation methods can successfully approximate it. Integrated Lagrange interpolation and B-spline basis functions are considered for polynomial approximation. The polynomial correction function can be added onto samples around each discontinuity in a non-bandlimited waveform to suppress aliasing. Comparison against previously known methods shows that the proposed technique yields the best tradeoff between computational cost and sound quality. The superior method amongst those considered in this study is the integrated third-order B-spline correction function, which offers perceptually aliasing-free sawtooth emulation up to the fundamental frequency of 7.8 kHz at the sample rate of 44.1 kHz. © 2012 Acoustical Society of America.

Tensor calculus in polar coordinates using Jacobi polynomials

NASA Astrophysics Data System (ADS)

Vasil, Geoffrey M.; Burns, Keaton J.; Lecoanet, Daniel; Olver, Sheehan; Brown, Benjamin P.; Oishi, Jeffrey S.

2016-11-01

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

Gabor-based kernel PCA with fractional power polynomial models for face recognition.

PubMed

Liu, Chengjun

2004-05-01

This paper presents a novel Gabor-based kernel Principal Component Analysis (PCA) method by integrating the Gabor wavelet representation of face images and the kernel PCA method for face recognition. Gabor wavelets first derive desirable facial features characterized by spatial frequency, spatial locality, and orientation selectivity to cope with the variations due to illumination and facial expression changes. The kernel PCA method is then extended to include fractional power polynomial models for enhanced face recognition performance. A fractional power polynomial, however, does not necessarily define a kernel function, as it might not define a positive semidefinite Gram matrix. Note that the sigmoid kernels, one of the three classes of widely used kernel functions (polynomial kernels, Gaussian kernels, and sigmoid kernels), do not actually define a positive semidefinite Gram matrix either. Nevertheless, the sigmoid kernels have been successfully used in practice, such as in building support vector machines. In order to derive real kernel PCA features, we apply only those kernel PCA eigenvectors that are associated with positive eigenvalues. The feasibility of the Gabor-based kernel PCA method with fractional power polynomial models has been successfully tested on both frontal and pose-angled face recognition, using two data sets from the FERET database and the CMU PIE database, respectively. The FERET data set contains 600 frontal face images of 200 subjects, while the PIE data set consists of 680 images across five poses (left and right profiles, left and right half profiles, and frontal view) with two different facial expressions (neutral and smiling) of 68 subjects. The effectiveness of the Gabor-based kernel PCA method with fractional power polynomial models is shown in terms of both absolute performance indices and comparative performance against the PCA method, the kernel PCA method with polynomial kernels, the kernel PCA method with fractional power

On Arithmetic-Geometric-Mean Polynomials

ERIC Educational Resources Information Center

Griffiths, Martin; MacHale, Des

2017-01-01

We study here an aspect of an infinite set "P" of multivariate polynomials, the elements of which are associated with the arithmetic-geometric-mean inequality. In particular, we show in this article that there exist infinite subsets of probability "P" for which every element may be expressed as a finite sum of squares of real…

An algorithmic approach to solving polynomial equations associated with quantum circuits

NASA Astrophysics Data System (ADS)

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

2009-12-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 Gröbner 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 Gröbner 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 Gröbner bases over F 2.

A Formally Verified Conflict Detection Algorithm for Polynomial Trajectories

NASA Technical Reports Server (NTRS)

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.

SAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos

DOE Office of Scientific and Technical Information (OSTI.GOV)

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 matrixmore » 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

SAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos

NASA Astrophysics Data System (ADS)

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

2016-09-01

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

Fast template matching with polynomials.

PubMed

Omachi, Shinichiro; Omachi, Masako

2007-08-01

Template matching is widely used for many applications in image and signal processing. This paper proposes a novel template matching algorithm, called algebraic template matching. Given a template and an input image, algebraic template matching efficiently calculates similarities between the template and the partial images of the input image, for various widths and heights. The partial image most similar to the template image is detected from the input image for any location, width, and height. In the proposed algorithm, a polynomial that approximates the template image is used to match the input image instead of the template image. The proposed algorithm is effective especially when the width and height of the template image differ from the partial image to be matched. An algorithm using the Legendre polynomial is proposed for efficient approximation of the template image. This algorithm not only reduces computational costs, but also improves the quality of the approximated image. It is shown theoretically and experimentally that the computational cost of the proposed algorithm is much smaller than the existing methods.

Bayer Demosaicking with Polynomial Interpolation.

PubMed

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.

Amino acid substitutions in the VanS sensor of the VanA-type vancomycin-resistant Enterococcus strains result in high-level vancomycin resistance and low-level teicoplanin resistance.

PubMed

Hashimoto, Y; Tanimoto, K; Ozawa, Y; Murata, T; Ike, Y

2000-04-15

The vancomycin-resistant enterococci GV1, GV2 and GV3, which were isolated from droppings from broiler farms in Japan have been characterized as VanA-type VRE, which express high-level vancomycin resistance (256 or 512 microg ml(-1), MIC) and low-level teicoplanin resistance (1 or 2 microg ml(-1), MIC). The vancomycin resistances were encoded on plasmids. The vancomycin resistance conjugative plasmid pMG2 was isolated from the GV2 strain. The VanA determinant of pMG2 showed the same genetic organization as that of the VanA genes encoded on the representative transposon Tn1546, which comprises vanRSHAXYZ. The nucleotide sequences of all the genes, except the gene related to the vanS gene on Tn1546, were completely identical to the genes encoded on Tn1546. Three amino acid substitutions in the N-terminal region of the deduced VanS were detected in the nucleotide sequence of vanS encoded on pMG2. There were also three amino acid substitutions in the vanS gene of the GV1 and GV3 strains in the same positions as in the vanS gene of pMG2. Vancomycin induced the increased teicoplanin resistance in these strains.

Polynomial approximation of Poincare maps for Hamiltonian system

NASA Technical Reports Server (NTRS)

Froeschle, Claude; Petit, Jean-Marc

1992-01-01

Different methods are proposed and tested for transforming a non-linear differential system, and more particularly a Hamiltonian one, into a map without integrating the whole orbit as in the well-known Poincare return map technique. We construct piecewise polynomial maps by coarse-graining the phase-space surface of section into parallelograms and using either only values of the Poincare maps at the vertices or also the gradient information at the nearest neighbors to define a polynomial approximation within each cell. The numerical experiments are in good agreement with both the real symplectic and Poincare maps.

Non-stationary component extraction in noisy multicomponent signal using polynomial chirping Fourier transform.

PubMed

Lu, Wenlong; Xie, Junwei; Wang, Heming; Sheng, Chuan

2016-01-01

Inspired by track-before-detection technology in radar, a novel time-frequency transform, namely polynomial chirping Fourier transform (PCFT), is exploited to extract components from noisy multicomponent signal. The PCFT combines advantages of Fourier transform and polynomial chirplet transform to accumulate component energy along a polynomial chirping curve in the time-frequency plane. The particle swarm optimization algorithm is employed to search optimal polynomial parameters with which the PCFT will achieve a most concentrated energy ridge in the time-frequency plane for the target component. The component can be well separated in the polynomial chirping Fourier domain with a narrow-band filter and then reconstructed by inverse PCFT. Furthermore, an iterative procedure, involving parameter estimation, PCFT, filtering and recovery, is introduced to extract components from a noisy multicomponent signal successively. The Simulations and experiments show that the proposed method has better performance in component extraction from noisy multicomponent signal as well as provides more time-frequency details about the analyzed signal than conventional methods.

Principal polynomial analysis.

PubMed

Laparra, Valero; Jiménez, Sandra; Tuia, Devis; Camps-Valls, Gustau; Malo, Jesus

2014-11-01

This paper presents a new framework for manifold learning based on a sequence of principal polynomials that capture the possibly nonlinear nature of the data. The proposed Principal Polynomial Analysis (PPA) generalizes PCA by modeling the directions of maximal variance by means of curves, instead of straight lines. Contrarily to previous approaches, PPA reduces to performing simple univariate regressions, which makes it computationally feasible and robust. Moreover, PPA shows a number of interesting analytical properties. First, PPA is a volume-preserving map, which in turn guarantees the existence of the inverse. Second, such an inverse can be obtained in closed form. Invertibility is an important advantage over other learning methods, because it permits to understand the identified features in the input domain where the data has physical meaning. Moreover, it allows to evaluate the performance of dimensionality reduction in sensible (input-domain) units. Volume preservation also allows an easy computation of information theoretic quantities, such as the reduction in multi-information after the transform. Third, the analytical nature of PPA leads to a clear geometrical interpretation of the manifold: it allows the computation of Frenet-Serret frames (local features) and of generalized curvatures at any point of the space. And fourth, the analytical Jacobian allows the computation of the metric induced by the data, thus generalizing the Mahalanobis distance. These properties are demonstrated theoretically and illustrated experimentally. The performance of PPA is evaluated in dimensionality and redundancy reduction, in both synthetic and real datasets from the UCI repository.

On the coefficients of integrated expansions of Bessel polynomials

NASA Astrophysics Data System (ADS)

Doha, E. H.; Ahmed, H. M.

2006-03-01

A new formula expressing explicitly the integrals of Bessel polynomials of any degree and for any order in terms of the Bessel polynomials themselves is proved. Another new explicit formula relating the Bessel coefficients of an expansion for infinitely differentiable function that has been integrated an arbitrary number of times in terms of the coefficients of the original expansion of the function is also established. An application of these formulae for solving ordinary differential equations with varying coefficients is discussed.

Polynomial time blackbox identity testers for depth-3 circuits : the field doesn't matter.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Seshadhri, Comandur; Saxena, Nitin

Let C be a depth-3 circuit with n variables, degree d and top fanin k (called {Sigma}{Pi}{Sigma}(k, d, n) circuits) over base field F. It is a major open problem to design a deterministic polynomial time blackbox algorithm that tests if C is identically zero. Klivans & Spielman (STOC 2001) observed that the problem is open even when k is a constant. This case has been subjected to a serious study over the past few years, starting from the work of Dvir & Shpilka (STOC 2005). We give the first polynomial time blackbox algorithm for this problem. Our algorithm runsmore » in time poly(n)d{sup k}, regardless of the base field. The only field for which polynomial time algorithms were previously known is F = Q (Kayal & Saraf, FOCS 2009, and Saxena & Seshadhri, FOCS 2010). This is the first blackbox algorithm for depth-3 circuits that does not use the rank based approaches of Karnin & Shpilka (CCC 2008). We prove an important tool for the study of depth-3 identities. We design a blackbox polynomial time transformation that reduces the number of variables in a {Sigma}{Pi}{Sigma}(k, d, n) circuit to k variables, but preserves the identity structure. Polynomial identity testing (PIT) is a major open problem in theoretical computer science. The input is an arithmetic circuit that computes a polynomial p(x{sub 1}, x{sub 2},..., x{sub n}) over a base field F. We wish to check if p is the zero polynomial, or in other words, is identically zero. We may be provided with an explicit circuit, or may only have blackbox access. In the latter case, we can only evaluate the polynomial p at various domain points. The main goal is to devise a deterministic blackbox polynomial time algorithm for PIT.« less

Multivariable Hermite polynomials and phase-space dynamics

NASA Technical Reports Server (NTRS)

Dattoli, G.; Torre, Amalia; Lorenzutta, S.; Maino, G.; Chiccoli, C.

1994-01-01

The phase-space approach to classical and quantum systems demands for advanced analytical tools. Such an approach characterizes the evolution of a physical system through a set of variables, reducing to the canonically conjugate variables in the classical limit. It often happens that phase-space distributions can be written in terms of quadratic forms involving the above quoted variables. A significant analytical tool to treat these problems may come from the generalized many-variables Hermite polynomials, defined on quadratic forms in R(exp n). They form an orthonormal system in many dimensions and seem the natural tool to treat the harmonic oscillator dynamics in phase-space. In this contribution we discuss the properties of these polynomials and present some applications to physical problems.

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

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

2015-01-01

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

Generating the patterns of variation with GeoGebra: the case of polynomial approximations

NASA Astrophysics Data System (ADS)

Attorps, Iiris; Björk, Kjell; Radic, Mirko

2016-01-01

In this paper, we report a teaching experiment regarding the theory of polynomial approximations at the university mathematics teaching in Sweden. The experiment was designed by applying Variation theory and by using the free dynamic mathematics software GeoGebra. The aim of this study was to investigate if the technology-assisted teaching of Taylor polynomials compared with traditional way of work at the university level can support the teaching and learning of mathematical concepts and ideas. An engineering student group (n = 19) was taught Taylor polynomials with the assistance of GeoGebra while a control group (n = 18) was taught in a traditional way. The data were gathered by video recording of the lectures, by doing a post-test concerning Taylor polynomials in both groups and by giving one question regarding Taylor polynomials at the final exam for the course in Real Analysis in one variable. In the analysis of the lectures, we found Variation theory combined with GeoGebra to be a potentially powerful tool for revealing some critical aspects of Taylor Polynomials. Furthermore, the research results indicated that applying Variation theory, when planning the technology-assisted teaching, supported and enriched students' learning opportunities in the study group compared with the control group.

Non-Abelian integrable hierarchies: matrix biorthogonal polynomials and perturbations

NASA Astrophysics Data System (ADS)

Ariznabarreta, Gerardo; García-Ardila, Juan C.; Mañas, Manuel; Marcellán, Francisco

2018-05-01

In this paper, Geronimus–Uvarov perturbations for matrix orthogonal polynomials on the real line are studied and then applied to the analysis of non-Abelian integrable hierarchies. The orthogonality is understood in full generality, i.e. in terms of a nondegenerate continuous sesquilinear form, determined by a quasidefinite matrix of bivariate generalized functions with a well-defined support. We derive Christoffel-type formulas that give the perturbed matrix biorthogonal polynomials and their norms in terms of the original ones. The keystone for this finding is the Gauss–Borel factorization of the Gram matrix. Geronimus–Uvarov transformations are considered in the context of the 2D non-Abelian Toda lattice and noncommutative KP hierarchies. The interplay between transformations and integrable flows is discussed. Miwa shifts, τ-ratio matrix functions and Sato formulas are given. Bilinear identities, involving Geronimus–Uvarov transformations, first for the Baker functions, then secondly for the biorthogonal polynomials and its second kind functions, and finally for the τ-ratio matrix functions, are found.

Recognition of Arabic Sign Language Alphabet Using Polynomial Classifiers

NASA Astrophysics Data System (ADS)

Assaleh, Khaled; Al-Rousan, M.

2005-12-01

Building an accurate automatic sign language recognition system is of great importance in facilitating efficient communication with deaf people. In this paper, we propose the use of polynomial classifiers as a classification engine for the recognition of Arabic sign language (ArSL) alphabet. Polynomial classifiers have several advantages over other classifiers in that they do not require iterative training, and that they are highly computationally scalable with the number of classes. Based on polynomial classifiers, we have built an ArSL system and measured its performance using real ArSL data collected from deaf people. We show that the proposed system provides superior recognition results when compared with previously published results using ANFIS-based classification on the same dataset and feature extraction methodology. The comparison is shown in terms of the number of misclassified test patterns. The reduction in the rate of misclassified patterns was very significant. In particular, we have achieved a 36% reduction of misclassifications on the training data and 57% on the test data.

A general U-block model-based design procedure for nonlinear polynomial control systems

NASA Astrophysics Data System (ADS)

Zhu, Q. M.; Zhao, D. Y.; Zhang, Jianhua

2016-10-01

The proposition of U-model concept (in terms of 'providing concise and applicable solutions for complex problems') and a corresponding basic U-control design algorithm was originated in the first author's PhD thesis. The term of U-model appeared (not rigorously defined) for the first time in the first author's other journal paper, which established a framework for using linear polynomial control system design approaches to design nonlinear polynomial control systems (in brief, linear polynomial approaches → nonlinear polynomial plants). This paper represents the next milestone work - using linear state-space approaches to design nonlinear polynomial control systems (in brief, linear state-space approaches → nonlinear polynomial plants). The overall aim of the study is to establish a framework, defined as the U-block model, which provides a generic prototype for using linear state-space-based approaches to design the control systems with smooth nonlinear plants/processes described by polynomial models. For analysing the feasibility and effectiveness, sliding mode control design approach is selected as an exemplary case study. Numerical simulation studies provide a user-friendly step-by-step procedure for the readers/users with interest in their ad hoc applications. In formality, this is the first paper to present the U-model-oriented control system design in a formal way and to study the associated properties and theorems. The previous publications, in the main, have been algorithm-based studies and simulation demonstrations. In some sense, this paper can be treated as a landmark for the U-model-based research from intuitive/heuristic stage to rigour/formal/comprehensive studies.

A study of the orthogonal polynomials associated with the quantum harmonic oscillator on constant curvature spaces

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vignat, C.; Lamberti, P. W.

2009-10-15

Recently, Carinena, et al. [Ann. Phys. 322, 434 (2007)] introduced a new family of orthogonal polynomials that appear in the wave functions of the quantum harmonic oscillator in two-dimensional constant curvature spaces. They are a generalization of the Hermite polynomials and will be called curved Hermite polynomials in the following. We show that these polynomials are naturally related to the relativistic Hermite polynomials introduced by Aldaya et al. [Phys. Lett. A 156, 381 (1991)], and thus are Jacobi polynomials. Moreover, we exhibit a natural bijection between the solutions of the quantum harmonic oscillator on negative curvature spaces and on positivemore » curvature spaces. At last, we show a maximum entropy property for the ground states of these oscillators.« less

Schur Stability Regions for Complex Quadratic Polynomials

ERIC Educational Resources Information Center

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

Polynomial approximation of the Lense-Thirring rigid precession frequency

NASA Astrophysics Data System (ADS)

De Falco, Vittorio; Motta, Sara

2018-05-01

We propose a polynomial approximation of the global Lense-Thirring rigid precession frequency to study low-frequency quasi-periodic oscillations around spinning black holes. This high-performing approximation allows to determine the expected frequencies of a precessing thick accretion disc with fixed inner radius and variable outer radius around a black hole with given mass and spin. We discuss the accuracy and the applicability regions of our polynomial approximation, showing that the computational times are reduced by a factor of ≈70 in the range of minutes.

A combinatorial model for the Macdonald polynomials.

PubMed

Haglund, J

2004-11-16

We introduce a polynomial C(mu)[Z; q, t], depending on a set of variables Z = z(1), z(2),..., a partition mu, and two extra parameters q, t. The definition of C(mu) involves a pair of statistics (maj(sigma, mu), inv(sigma, mu)) on words sigma of positive integers, and the coefficients of the z(i) are manifestly in N[q,t]. We conjecture that C(mu)[Z; q, t] is none other than the modified Macdonald polynomial H(mu)[Z; q, t]. We further introduce a general family of polynomials F(T)[Z; q, S], where T is an arbitrary set of squares in the first quadrant of the xy plane, and S is an arbitrary subset of T. The coefficients of the F(T)[Z; q, S] are in N[q], and C(mu)[Z; q, t] is a sum of certain F(T)[Z; q, S] times nonnegative powers of t. We prove F(T)[Z; q, S] is symmetric in the z(i) and satisfies other properties consistent with the conjecture. We also show how the coefficient of a monomial in F(T)[Z; q, S] can be expressed recursively. maple calculations indicate the F(T)[Z; q, S] are Schur-positive, and we present a combinatorial conjecture for their Schur coefficients when the set T is a partition with at most three columns.

19 CFR 10.41a - Lift vans, cargo vans, shipping tanks, skids, pallets, and similar instruments of international...

Code of Federal Regulations, 2011 CFR

2011-04-01

... 19 Customs Duties 1 2011-04-01 2011-04-01 false Lift vans, cargo vans, shipping tanks, skids... Traffic § 10.41a Lift vans, cargo vans, shipping tanks, skids, pallets, and similar instruments of international traffic; repair components. (a)(1) Lift vans, cargo vans, shipping tanks, skids, pallets, caul...

19 CFR 10.41a - Lift vans, cargo vans, shipping tanks, skids, pallets, and similar instruments of international...

Code of Federal Regulations, 2010 CFR

2010-04-01

... 19 Customs Duties 1 2010-04-01 2010-04-01 false Lift vans, cargo vans, shipping tanks, skids... Traffic § 10.41a Lift vans, cargo vans, shipping tanks, skids, pallets, and similar instruments of international traffic; repair components. (a)(1) Lift vans, cargo vans, shipping tanks, skids, pallets, caul...

Zernike expansion of derivatives and Laplacians of the Zernike circle polynomials.

PubMed

Janssen, A J E M

2014-07-01

The partial derivatives and Laplacians of the Zernike circle polynomials occur in various places in the literature on computational optics. In a number of cases, the expansion of these derivatives and Laplacians in the circle polynomials are required. For the first-order partial derivatives, analytic results are scattered in the literature. Results start as early as 1942 in Nijboer's thesis and continue until present day, with some emphasis on recursive computation schemes. A brief historic account of these results is given in the present paper. By choosing the unnormalized version of the circle polynomials, with exponential rather than trigonometric azimuthal dependence, and by a proper combination of the two partial derivatives, a concise form of the expressions emerges. This form is appropriate for the formulation and solution of a model wavefront sensing problem of reconstructing a wavefront on the level of its expansion coefficients from (measurements of the expansion coefficients of) the partial derivatives. It turns out that the least-squares estimation problem arising here decouples per azimuthal order m, and per m the generalized inverse solution assumes a concise analytic form so that singular value decompositions are avoided. The preferred version of the circle polynomials, with proper combination of the partial derivatives, also leads to a concise analytic result for the Zernike expansion of the Laplacian of the circle polynomials. From these expansions, the properties of the Laplacian as a mapping from the space of circle polynomials of maximal degree N, as required in the study of the Neumann problem associated with the transport-of-intensity equation, can be read off within a single glance. Furthermore, the inverse of the Laplacian on this space is shown to have a concise analytic form.

Polynomial elimination theory and non-linear stability analysis for the Euler equations

NASA Technical Reports Server (NTRS)

Kennon, S. R.; Dulikravich, G. S.; Jespersen, D. C.

1986-01-01

Numerical methods are presented that exploit the polynomial properties of discretizations of the Euler equations. It is noted that most finite difference or finite volume discretizations of the steady-state Euler equations produce a polynomial system of equations to be solved. These equations are solved using classical polynomial elimination theory, with some innovative modifications. This paper also presents some preliminary results of a new non-linear stability analysis technique. This technique is applicable to determining the stability of polynomial iterative schemes. Results are presented for applying the elimination technique to a one-dimensional test case. For this test case, the exact solution is computed in three iterations. The non-linear stability analysis is applied to determine the optimal time step for solving Burgers' equation using the MacCormack scheme. The estimated optimal time step is very close to the time step that arises from a linear stability analysis.

Georeferencing CAMS data: Polynomial rectification and beyond

NASA Astrophysics Data System (ADS)

Yang, Xinghe

The Calibrated Airborne Multispectral Scanner (CAMS) is a sensor used in the commercial remote sensing program at NASA Stennis Space Center. In geographic applications of the CAMS data, accurate geometric rectification is essential for the analysis of the remotely sensed data and for the integration of the data into Geographic Information Systems (GIS). The commonly used rectification techniques such as the polynomial transformation and ortho rectification have been very successful in the field of remote sensing and GIS for most remote sensing data such as Landsat imagery, SPOT imagery and aerial photos. However, due to the geometric nature of the airborne line scanner which has high spatial frequency distortions, the polynomial model and the ortho rectification technique in current commercial software packages such as Erdas Imagine are not adequate for obtaining sufficient geometric accuracy. In this research, the geometric nature, especially the major distortions, of the CAMS data has been described. An analytical step-by-step geometric preprocessing has been utilized to deal with the potential high frequency distortions of the CAMS data. A generic sensor-independent photogrammetric model has been developed for the ortho-rectification of the CAMS data. Three generalized kernel classes and directional elliptical basis have been formulated into a rectification model of summation of multisurface functions, which is a significant extension to the traditional radial basis functions. The preprocessing mechanism has been fully incorporated into the polynomial, the triangle-based finite element analysis as well as the summation of multisurface functions. While the multisurface functions and the finite element analysis have the characteristics of localization, piecewise logic has been applied to the polynomial and photogrammetric methods, which can produce significant accuracy improvement over the global approach. A software module has been implemented with full

On adaptive weighted polynomial preconditioning for Hermitian positive definite matrices

NASA Technical Reports Server (NTRS)

Fischer, Bernd; Freund, Roland W.

1992-01-01

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

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

NASA Astrophysics Data System (ADS)

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.

A model-based 3D phase unwrapping algorithm using Gegenbauer polynomials.

PubMed

Langley, Jason; Zhao, Qun

2009-09-07

The application of a two-dimensional (2D) phase unwrapping algorithm to a three-dimensional (3D) phase map may result in an unwrapped phase map that is discontinuous in the direction normal to the unwrapped plane. This work investigates the problem of phase unwrapping for 3D phase maps. The phase map is modeled as a product of three one-dimensional Gegenbauer polynomials. The orthogonality of Gegenbauer polynomials and their derivatives on the interval [-1, 1] are exploited to calculate the expansion coefficients. The algorithm was implemented using two well-known Gegenbauer polynomials: Chebyshev polynomials of the first kind and Legendre polynomials. Both implementations of the phase unwrapping algorithm were tested on 3D datasets acquired from a magnetic resonance imaging (MRI) scanner. The first dataset was acquired from a homogeneous spherical phantom. The second dataset was acquired using the same spherical phantom but magnetic field inhomogeneities were introduced by an external coil placed adjacent to the phantom, which provided an additional burden to the phase unwrapping algorithm. Then Gaussian noise was added to generate a low signal-to-noise ratio dataset. The third dataset was acquired from the brain of a human volunteer. The results showed that Chebyshev implementation and the Legendre implementation of the phase unwrapping algorithm give similar results on the 3D datasets. Both implementations of the phase unwrapping algorithm compare well to PRELUDE 3D, 3D phase unwrapping software well recognized for functional MRI.

Long-time uncertainty propagation using generalized polynomial chaos and flow map composition

DOE Office of Scientific and Technical Information (OSTI.GOV)

Luchtenburg, Dirk M., E-mail: dluchten@cooper.edu; Brunton, Steven L.; Rowley, Clarence W.

2014-10-01

We present an efficient and accurate method for long-time uncertainty propagation in dynamical systems. Uncertain initial conditions and parameters are both addressed. The method approximates the intermediate short-time flow maps by spectral polynomial bases, as in the generalized polynomial chaos (gPC) method, and uses flow map composition to construct the long-time flow map. In contrast to the gPC method, this approach has spectral error convergence for both short and long integration times. The short-time flow map is characterized by small stretching and folding of the associated trajectories and hence can be well represented by a relatively low-degree basis. The compositionmore » of these low-degree polynomial bases then accurately describes the uncertainty behavior for long integration times. The key to the method is that the degree of the resulting polynomial approximation increases exponentially in the number of time intervals, while the number of polynomial coefficients either remains constant (for an autonomous system) or increases linearly in the number of time intervals (for a non-autonomous system). The findings are illustrated on several numerical examples including a nonlinear ordinary differential equation (ODE) with an uncertain initial condition, a linear ODE with an uncertain model parameter, and a two-dimensional, non-autonomous double gyre flow.« less

A Set of Orthogonal Polynomials That Generalize the Racah Coefficients or 6 - j Symbols.

DTIC Science & Technology

1978-03-01

Generalized Hypergeometric Functions, Cambridge Univ. Press, Cambridge, 1966. [11] D. Stanton, Some basic hypergeometric polynomials arising from... Some bas ic hypergeometr ic an a logues of the classical orthogonal polynomials and applications , to appear. [3] C. de Boor and G. H. Golub , The...Report #1833 A SET OF ORTHOGONAL POLYNOMIALS THAT GENERALIZE THE RACAR COEFFICIENTS OR 6 — j SYMBOLS Richard Askey and James Wilson •

Lifting q-difference operators for Askey-Wilson polynomials and their weight function

DOE Office of Scientific and Technical Information (OSTI.GOV)

Atakishiyeva, M. K.; Atakishiyev, N. M., E-mail: natig_atakishiyev@hotmail.com

2011-06-15

We determine an explicit form of a q-difference operator that transforms the continuous q-Hermite polynomials H{sub n}(x | q) of Rogers into the Askey-Wilson polynomials p{sub n}(x; a, b, c, d | q) on the top level in the Askey q-scheme. This operator represents a special convolution-type product of four one-parameter q-difference operators of the form {epsilon}{sub q}(c{sub q}D{sub q}) (where c{sub q} are some constants), defined as Exton's q-exponential function {epsilon}{sub q}(z) in terms of the Askey-Wilson divided q-difference operator D{sub q}. We also determine another q-difference operator that lifts the orthogonality weight function for the continuous q-Hermite polynomialsH{submore » n}(x | q) up to the weight function, associated with the Askey-Wilson polynomials p{sub n}(x; a, b, c, d | q).« less

Pointwise convergence of derivatives of Lagrange interpolation polynomials for exponential weights

NASA Astrophysics Data System (ADS)

Damelin, S. B.; Jung, H. S.

2005-01-01

For a general class of exponential weights on the line and on (-1,1), we study pointwise convergence of the derivatives of Lagrange interpolation. Our weights include even weights of smooth polynomial decay near +/-[infinity] (Freud weights), even weights of faster than smooth polynomial decay near +/-[infinity] (Erdos weights) and even weights which vanish strongly near +/-1, for example Pollaczek type weights.

Representing Lumped Markov Chains by Minimal Polynomials over Field GF(q)

NASA Astrophysics Data System (ADS)

Zakharov, V. M.; Shalagin, S. V.; Eminov, B. F.

2018-05-01

A method has been proposed to represent lumped Markov chains by minimal polynomials over a finite field. The accuracy of representing lumped stochastic matrices, the law of lumped Markov chains depends linearly on the minimum degree of polynomials over field GF(q). The method allows constructing the realizations of lumped Markov chains on linear shift registers with a pre-defined “linear complexity”.

Defending commercial surrogate motherhood against Van Niekerk and Van Zyl.

PubMed Central

McLachlan, H V

1997-01-01

The arguments of Van Niekerk and Van Zyl that, on the grounds that it involves an inappropriate commodification and alienation of women's labour, commercial surrogate motherhood (CSM) is morally suspect are discussed and considered to be defective. In addition, doubt is cast on the notion that CSM should be illegal. PMID:9451602

New realisation of Preisach model using adaptive polynomial approximation

NASA Astrophysics Data System (ADS)

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.

Kostant polynomials and the cohomology ring for G/B

PubMed Central

Billey, Sara C.

1997-01-01

The Schubert calculus for G/B can be completely determined by a certain matrix related to the Kostant polynomials introduced in section 5 of Bernstein, Gelfand, and Gelfand [Bernstein, I., Gelfand, I. & Gelfand, S. (1973) Russ. Math. Surv. 28, 1–26]. The polynomials are defined by vanishing properties on the orbit of a regular point under the action of the Weyl group. For each element w in the Weyl group the polynomials also have nonzero values on the orbit points corresponding to elements which are larger in the Bruhat order than w. The main theorem given here is an explicit formula for these values. The matrix of orbit values can be used to determine the cup product for the cohomology ring for G/B, using only linear algebra or as described by Lascoux and Schützenberger [Lascoux, A. & Schützenberger, M.-P. (1982) C. R. Seances Acad. Sci. Ser. A 294, 447–450]. Complete proofs of all the theorems will appear in a forthcoming paper. PMID:11038536

Automatic differentiation for Fourier series and the radii polynomial approach

NASA Astrophysics Data System (ADS)

Lessard, Jean-Philippe; Mireles James, J. D.; Ransford, Julian

2016-11-01

In this work we develop a computer-assisted technique for proving existence of periodic solutions of nonlinear differential equations with non-polynomial nonlinearities. We exploit ideas from the theory of automatic differentiation in order to formulate an augmented polynomial system. We compute a numerical Fourier expansion of the periodic orbit for the augmented system, and prove the existence of a true solution nearby using an a-posteriori validation scheme (the radii polynomial approach). The problems considered here are given in terms of locally analytic vector fields (i.e. the field is analytic in a neighborhood of the periodic orbit) hence the computer-assisted proofs are formulated in a Banach space of sequences satisfying a geometric decay condition. In order to illustrate the use and utility of these ideas we implement a number of computer-assisted existence proofs for periodic orbits of the Planar Circular Restricted Three-Body Problem (PCRTBP).

Interpolation Hermite Polynomials For Finite Element Method

NASA Astrophysics Data System (ADS)

Gusev, Alexander; Vinitsky, Sergue; Chuluunbaatar, Ochbadrakh; Chuluunbaatar, Galmandakh; Gerdt, Vladimir; Derbov, Vladimir; Góźdź, Andrzej; Krassovitskiy, Pavel

2018-02-01

We describe a new algorithm for analytic calculation of high-order Hermite interpolation polynomials of the simplex and give their classification. A typical example of triangle element, to be built in high accuracy finite element schemes, is given.

Phase unwrapping algorithm using polynomial phase approximation and linear Kalman filter.

PubMed

Kulkarni, Rishikesh; Rastogi, Pramod

2018-02-01

A noise-robust phase unwrapping algorithm is proposed based on state space analysis and polynomial phase approximation using wrapped phase measurement. The true phase is approximated as a two-dimensional first order polynomial function within a small sized window around each pixel. The estimates of polynomial coefficients provide the measurement of phase and local fringe frequencies. A state space representation of spatial phase evolution and the wrapped phase measurement is considered with the state vector consisting of polynomial coefficients as its elements. Instead of using the traditional nonlinear Kalman filter for the purpose of state estimation, we propose to use the linear Kalman filter operating directly with the wrapped phase measurement. The adaptive window width is selected at each pixel based on the local fringe density to strike a balance between the computation time and the noise robustness. In order to retrieve the unwrapped phase, either a line-scanning approach or a quality guided strategy of pixel selection is used depending on the underlying continuous or discontinuous phase distribution, respectively. Simulation and experimental results are provided to demonstrate the applicability of the proposed method.

Mixed semiclassical-classical propagators for the Wigner phase space representation

NASA Astrophysics Data System (ADS)

Koda, Shin-ichi

2016-04-01

We formulate mixed semiclassical-classical (SC-Cl) propagators by adding a further approximation to the phase-space SC propagators, which have been formulated in our previous paper [S. Koda, J. Chem. Phys. 143, 244110 (2015)]. We first show that the stationary phase approximation over the operation of the phase-space van Vleck propagator on initial distribution functions results in the classical mechanical time propagation. Then, after dividing the degrees of freedom (DOFs) of the total system into the semiclassical DOFs and the classical DOFs, the SC-Cl van Vleck propagator and the SC-Cl Herman-Kluk (HK) propagator are derived by performing the stationary phase approximation only with respect to the classical DOFs. These SC-Cl propagators are naturally decomposed to products of the phase-space SC propagators and the classical mechanical propagators when the system does not have any interaction between the semiclassical and the classical DOFs. In addition, we also numerically compare the original phase-space HK (full HK) propagator and the SC-Cl HK propagator in terms of accuracy and efficiency to find that the accuracy of the SC-Cl HK propagator can be comparable to that of the full HK propagator although the latter is more accurate than the former in general. On the other hand, we confirm that the convergence speed of the SC-Cl HK propagator is faster than that of the full HK propagator. The present numerical tests indicate that the SC-Cl HK propagator can be more accurate than the full HK propagator when they use a same and finite number of classical trajectories due to the balance of the accuracy and the efficiency.

Mixed semiclassical-classical propagators for the Wigner phase space representation.

PubMed

Koda, Shin-Ichi

2016-04-21

We formulate mixed semiclassical-classical (SC-Cl) propagators by adding a further approximation to the phase-space SC propagators, which have been formulated in our previous paper [S. Koda, J. Chem. Phys. 143, 244110 (2015)]. We first show that the stationary phase approximation over the operation of the phase-space van Vleck propagator on initial distribution functions results in the classical mechanical time propagation. Then, after dividing the degrees of freedom (DOFs) of the total system into the semiclassical DOFs and the classical DOFs, the SC-Cl van Vleck propagator and the SC-Cl Herman-Kluk (HK) propagator are derived by performing the stationary phase approximation only with respect to the classical DOFs. These SC-Cl propagators are naturally decomposed to products of the phase-space SC propagators and the classical mechanical propagators when the system does not have any interaction between the semiclassical and the classical DOFs. In addition, we also numerically compare the original phase-space HK (full HK) propagator and the SC-Cl HK propagator in terms of accuracy and efficiency to find that the accuracy of the SC-Cl HK propagator can be comparable to that of the full HK propagator although the latter is more accurate than the former in general. On the other hand, we confirm that the convergence speed of the SC-Cl HK propagator is faster than that of the full HK propagator. The present numerical tests indicate that the SC-Cl HK propagator can be more accurate than the full HK propagator when they use a same and finite number of classical trajectories due to the balance of the accuracy and the efficiency.

New families of superintegrable systems from Hermite and Laguerre exceptional orthogonal polynomials

DOE Office of Scientific and Technical Information (OSTI.GOV)

Marquette, Ian; Quesne, Christiane

2013-04-15

In recent years, many exceptional orthogonal polynomials (EOP) were introduced and used to construct new families of 1D exactly solvable quantum potentials, some of which are shape invariant. In this paper, we construct from Hermite and Laguerre EOP and their related quantum systems new 2D superintegrable Hamiltonians with higher-order integrals of motion and the polynomial algebras generated by their integrals of motion. We obtain the finite-dimensional unitary representations of the polynomial algebras and the corresponding energy spectrum. We also point out a new type of degeneracies of the energy levels of these systems that is associated with holes in sequencesmore » of EOP.« less

On the construction of recurrence relations for the expansion and connection coefficients in series of Jacobi polynomials

NASA Astrophysics Data System (ADS)

Doha, E. H.

2004-01-01

Formulae expressing explicitly the Jacobi coefficients of a general-order derivative (integral) of an infinitely differentiable function in terms of its original expansion coefficients, and formulae for the derivatives (integrals) of Jacobi polynomials in terms of Jacobi polynomials themselves are stated. A formula for the Jacobi coefficients of the moments of one single Jacobi polynomial of certain degree is proved. Another formula for the Jacobi coefficients of the moments of a general-order derivative of an infinitely differentiable function in terms of its original expanded coefficients is also given. A simple approach in order to construct and solve recursively for the connection coefficients between Jacobi-Jacobi polynomials is described. Explicit formulae for these coefficients between ultraspherical and Jacobi polynomials are deduced, of which the Chebyshev polynomials of the first and second kinds and Legendre polynomials are important special cases. Two analytical formulae for the connection coefficients between Laguerre-Jacobi and Hermite-Jacobi are developed.

A new sampling scheme for developing metamodels with the zeros of Chebyshev polynomials

NASA Astrophysics Data System (ADS)

Wu, Jinglai; Luo, Zhen; Zhang, Nong; Zhang, Yunqing

2015-09-01

The accuracy of metamodelling is determined by both the sampling and approximation. This article proposes a new sampling method based on the zeros of Chebyshev polynomials to capture the sampling information effectively. First, the zeros of one-dimensional Chebyshev polynomials are applied to construct Chebyshev tensor product (CTP) sampling, and the CTP is then used to construct high-order multi-dimensional metamodels using the 'hypercube' polynomials. Secondly, the CTP sampling is further enhanced to develop Chebyshev collocation method (CCM) sampling, to construct the 'simplex' polynomials. The samples of CCM are randomly and directly chosen from the CTP samples. Two widely studied sampling methods, namely the Smolyak sparse grid and Hammersley, are used to demonstrate the effectiveness of the proposed sampling method. Several numerical examples are utilized to validate the approximation accuracy of the proposed metamodel under different dimensions.

Colored knot polynomials for arbitrary pretzel knots and links

DOE PAGES

Galakhov, D.; Melnikov, D.; Mironov, A.; ...

2015-04-01

A very simple expression is conjectured for arbitrary colored Jones and HOMFLY polynomials of a rich (g+1)-parametric family of pretzel knots and links. The answer for the Jones and HOMFLY is fully and explicitly expressed through the Racah matrix of Uq(SU N), and looks related to a modular transformation of toric conformal block. Knot polynomials are among the hottest topics in modern theory. They are supposed to summarize nicely representation theory of quantum algebras and modular properties of conformal blocks. The result reported in the present letter, provides a spectacular illustration and support to this general expectation.

Space Van system update

NASA Astrophysics Data System (ADS)

Cormier, Len

1992-07-01

The Space Van is a proposed commercial launch vehicle that is designed to carry 1150 kg to a space-station orbit for a price of $1,900,000 per flight in 1992 dollars. This price includes return on preoperational investment. Recurring costs are expected to be about $840,000 per flight. The Space Van is a fully reusable, assisted-single-stage-to orbit system. The most innovative new feature of the Space Van system is the assist-stage concept. The assist stage uses only airbreathing engines for vertical takeoff and vertical landing in the horizontal attitude and for launching the rocket-powered orbiter stage at mach 0.8 and an altitude of about 12 km. The primary version of the orbiter is designed for cargo-only without a crew. However, a passenger version of the Space Van should be able to carry a crew of two plus six passengers to a space-station orbit. Since the Space Van is nearly single-stage, performance to polar orbit drops off significantly. The cargo version should be capable of carrying 350 kg to a 400-km polar orbit. In the passenger version, the Space Van should be able to carry two crew members - or one crew member plus a passenger.

Polynomial Asymptotes of the Second Kind

ERIC Educational Resources Information Center

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…

Evaluation of Piecewise Polynomial Equations for Two Types of Thermocouples

PubMed Central

Chen, Andrew; Chen, Chiachung

2013-01-01

Thermocouples are the most frequently used sensors for temperature measurement because of their wide applicability, long-term stability and high reliability. However, one of the major utilization problems is the linearization of the transfer relation between temperature and output voltage of thermocouples. The linear calibration equation and its modules could be improved by using regression analysis to help solve this problem. In this study, two types of thermocouple and five temperature ranges were selected to evaluate the fitting agreement of different-order polynomial equations. Two quantitative criteria, the average of the absolute error values |e|ave and the standard deviation of calibration equation estd, were used to evaluate the accuracy and precision of these calibrations equations. The optimal order of polynomial equations differed with the temperature range. The accuracy and precision of the calibration equation could be improved significantly with an adequate higher degree polynomial equation. The technique could be applied with hardware modules to serve as an intelligent sensor for temperature measurement. PMID:24351627

Semiclassical propagator of the Wigner function.

PubMed

Dittrich, Thomas; Viviescas, Carlos; Sandoval, Luis

2006-02-24

Propagation of the Wigner function is studied on two levels of semiclassical propagation: one based on the Van Vleck propagator, the other on phase-space path integration. Leading quantum corrections to the classical Liouville propagator take the form of a time-dependent quantum spot. Its oscillatory structure depends on whether the underlying classical flow is elliptic or hyperbolic. It can be interpreted as the result of interference of a pair of classical trajectories, indicating how quantum coherences are to be propagated semiclassically in phase space. The phase-space path-integral approach allows for a finer resolution of the quantum spot in terms of Airy functions.

Quadratic polynomial interpolation on triangular domain

NASA Astrophysics Data System (ADS)

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.

Minimizing Higgs potentials via numerical polynomial homotopy continuation

NASA Astrophysics Data System (ADS)

Maniatis, M.; Mehta, D.

2012-08-01

The study of models with extended Higgs sectors requires to minimize the corresponding Higgs potentials, which is in general very difficult. Here, we apply a recently developed method, called numerical polynomial homotopy continuation (NPHC), which guarantees to find all the stationary points of the Higgs potentials with polynomial-like non-linearity. The detection of all stationary points reveals the structure of the potential with maxima, metastable minima, saddle points besides the global minimum. We apply the NPHC method to the most general Higgs potential having two complex Higgs-boson doublets and up to five real Higgs-boson singlets. Moreover the method is applicable to even more involved potentials. Hence the NPHC method allows to go far beyond the limits of the Gröbner basis approach.

Recurrences and explicit formulae for the expansion and connection coefficients in series of Bessel polynomials

NASA Astrophysics Data System (ADS)

Doha, E. H.; Ahmed, H. M.

2004-08-01

A formula expressing explicitly the derivatives of Bessel polynomials of any degree and for any order in terms of the Bessel polynomials themselves is proved. Another explicit formula, which expresses the Bessel expansion coefficients of a general-order derivative of an infinitely differentiable function in terms of its original Bessel coefficients, is also given. A formula for the Bessel coefficients of the moments of one single Bessel polynomial of certain degree is proved. A formula for the Bessel coefficients of the moments of a general-order derivative of an infinitely differentiable function in terms of its Bessel coefficients is also obtained. Application of these formulae for solving ordinary differential equations with varying coefficients, by reducing them to recurrence relations in the expansion coefficients of the solution, is explained. An algebraic symbolic approach (using Mathematica) in order to build and solve recursively for the connection coefficients between Bessel-Bessel polynomials is described. An explicit formula for these coefficients between Jacobi and Bessel polynomials is given, of which the ultraspherical polynomial and its consequences are important special cases. Two analytical formulae for the connection coefficients between Laguerre-Bessel and Hermite-Bessel are also developed.

Polynomial chaos representation of databases on manifolds

DOE Office of Scientific and Technical Information (OSTI.GOV)

Soize, C., E-mail: christian.soize@univ-paris-est.fr; Ghanem, R., E-mail: ghanem@usc.edu

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. Themore » 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.« less

Some Curious Properties and Loci Problems Associated with Cubics and Other Polynomials

ERIC Educational Resources Information Center

de Alwis, Amal

2012-01-01

The article begins with a well-known property regarding tangent lines to a cubic polynomial that has distinct, real zeros. We were then able to generalize this property to any polynomial with distinct, real zeros. We also considered a certain family of cubics with two fixed zeros and one variable zero, and explored the loci of centroids of…

Modeling State-Space Aeroelastic Systems Using a Simple Matrix Polynomial Approach for the Unsteady Aerodynamics

NASA Technical Reports Server (NTRS)

Pototzky, Anthony S.

2008-01-01

A simple matrix polynomial approach is introduced for approximating unsteady aerodynamics in the s-plane and ultimately, after combining matrix polynomial coefficients with matrices defining the structure, a matrix polynomial of the flutter equations of motion (EOM) is formed. A technique of recasting the matrix-polynomial form of the flutter EOM into a first order form is also presented that can be used to determine the eigenvalues near the origin and everywhere on the complex plane. An aeroservoelastic (ASE) EOM have been generalized to include the gust terms on the right-hand side. The reasons for developing the new matrix polynomial approach are also presented, which are the following: first, the "workhorse" methods such as the NASTRAN flutter analysis lack the capability to consistently find roots near the origin, along the real axis or accurately find roots farther away from the imaginary axis of the complex plane; and, second, the existing s-plane methods, such as the Roger s s-plane approximation method as implemented in ISAC, do not always give suitable fits of some tabular data of the unsteady aerodynamics. A method available in MATLAB is introduced that will accurately fit generalized aerodynamic force (GAF) coefficients in a tabular data form into the coefficients of a matrix polynomial form. The root-locus results from the NASTRAN pknl flutter analysis, the ISAC-Roger's s-plane method and the present matrix polynomial method are presented and compared for accuracy and for the number and locations of roots.

Orthonormal aberration polynomials for anamorphic optical imaging systems with rectangular pupils.

PubMed

Mahajan, Virendra N

2010-12-20

The classical aberrations of an anamorphic optical imaging system, representing the terms of a power-series expansion of its aberration function, are separable in the Cartesian coordinates of a point on its pupil. We discuss the balancing of a classical aberration of a certain order with one or more such aberrations of lower order to minimize its variance across a rectangular pupil of such a system. We show that the balanced aberrations are the products of two Legendre polynomials, one for each of the two Cartesian coordinates of the pupil point. The compound Legendre polynomials are orthogonal across a rectangular pupil and, like the classical aberrations, are inherently separable in the Cartesian coordinates of the pupil point. They are different from the balanced aberrations and the corresponding orthogonal polynomials for a system with rotational symmetry but a rectangular pupil.

Derivatives of random matrix characteristic polynomials with applications to elliptic curves

NASA Astrophysics Data System (ADS)

Snaith, N. C.

2005-12-01

The value distribution of derivatives of characteristic polynomials of matrices from SO(N) is calculated at the point 1, the symmetry point on the unit circle of the eigenvalues of these matrices. We consider subsets of matrices from SO(N) that are constrained to have at least n eigenvalues equal to 1 and investigate the first non-zero derivative of the characteristic polynomial at that point. The connection between the values of random matrix characteristic polynomials and values of L-functions in families has been well established. The motivation for this work is the expectation that through this connection with L-functions derived from families of elliptic curves, and using the Birch and Swinnerton-Dyer conjecture to relate values of the L-functions to the rank of elliptic curves, random matrix theory will be useful in probing important questions concerning these ranks.

Fitting by Orthonormal Polynomials of Silver Nanoparticles Spectroscopic Data

NASA Astrophysics Data System (ADS)

Bogdanova, Nina; Koleva, Mihaela

2018-02-01

Our original Orthonormal Polynomial Expansion Method (OPEM) in one-dimensional version is applied for first time to describe the silver nanoparticles (NPs) spectroscopic data. The weights for approximation include experimental errors in variables. In this way we construct orthonormal polynomial expansion for approximating the curve on a non equidistant point grid. The corridors of given data and criteria define the optimal behavior of searched curve. The most important subinterval of spectra data is investigated, where the minimum (surface plasmon resonance absorption) is looking for. This study describes the Ag nanoparticles produced by laser approach in a ZnO medium forming a AgNPs/ZnO nanocomposite heterostructure.

The polynomial form of the scattering equations is an H -basis

NASA Astrophysics Data System (ADS)

Bosma, Jorrit; Søgaard, Mads; Zhang, Yang

2016-08-01

We prove that the polynomial form of the scattering equations is a Macaulay H -basis. We demonstrate that this H -basis facilitates integrand reduction and global residue computations in a way very similar to using a Gröbner basis, but circumvents the heavy computation of the latter. As an example, we apply the H -basis to prove the conjecture that the dual basis of the polynomial scattering equations must contain one constant term.

Laguerre-Freud Equations for the Recurrence Coefficients of Some Discrete Semi-Classical Orthogonal Polynomials of Class Two

NASA Astrophysics Data System (ADS)

Hounga, C.; Hounkonnou, M. N.; Ronveaux, A.

2006-10-01

In this paper, we give Laguerre-Freud equations for the recurrence coefficients of discrete semi-classical orthogonal polynomials of class two, when the polynomials in the Pearson equation are of the same degree. The case of generalized Charlier polynomials is also presented.

Polynomial mixture method of solving ordinary differential equations

NASA Astrophysics Data System (ADS)

Shahrir, Mohammad Shazri; Nallasamy, Kumaresan; Ratnavelu, Kuru; Kamali, M. Z. M.

2017-11-01

In this paper, a numerical solution of fuzzy quadratic Riccati differential equation is estimated using a proposed new approach that provides mixture of polynomials where iteratively the right mixture will be generated. This mixture provide a generalized formalism of traditional Neural Networks (NN). Previous works have shown reliable results using Runge-Kutta 4th order (RK4). This can be achieved by solving the 1st Order Non-linear Differential Equation (ODE) that is found commonly in Riccati differential equation. Research has shown improved results relatively to the RK4 method. It can be said that Polynomial Mixture Method (PMM) shows promising results with the advantage of continuous estimation and improved accuracy that can be produced over Mabood et al, RK-4, Multi-Agent NN and Neuro Method (NM).

Mentale Inzetbaarheid van Teams: Ontwikkeling van een Moden van Teamfunctioneren als Module voor SCOPE (Mental Readiness of Teams - Development of a Team Model as Module for SCOPE)

DTIC Science & Technology

2007-04-01

inzetbaarheid van teams: ontwikkeling van een model van teamfunctioneren als module voor SCOPE Datumn april 2007 Auteur (s) R. de B~ruin C’. Vervvijs A.J...Datum april 2007 Programmaleider Projectleider Auteur (s) dr. W.A. Lotens, TNO Defensie en A.]. van Vijet, TNO Defensie en R. de Bruin Veiligheid...Deelnemers verwachten wel, in lijn met de theorie , dat een lage cohesie samenhangt met een lage effectiviteit. Een hoge cohesie, daarentegen, zou

Mobile Telemetry Van Remote Control Upgrade

DTIC Science & Technology

2012-05-17

Advantages of Remote Control System Upgrade • Summary Overview • Remote control of Telemetry Mobile Ground Support ( TMGS ) Van proposed to allow...NWC) personnel provided valuable data for full-function remote control of telemetry tracking vans Background • TMGS Vans support Flight Test...control capability from main TM site at Building 5790 currently allows support via TMGS Van at nearby C- 15 Site, Plant 42 in Palmdale, and as far

A general method for computing Tutte polynomials of self-similar graphs

NASA Astrophysics Data System (ADS)

Gong, Helin; Jin, Xian'an

2017-10-01

Self-similar graphs were widely studied in both combinatorics and statistical physics. Motivated by the construction of the well-known 3-dimensional Sierpiński gasket graphs, in this paper we introduce a family of recursively constructed self-similar graphs whose inner duals are of the self-similar property. By combining the dual property of the Tutte polynomial and the subgraph-decomposition trick, we show that the Tutte polynomial of this family of graphs can be computed in an iterative way and in particular the exact expression of the formula of the number of their spanning trees is derived. Furthermore, we show our method is a general one that is easily extended to compute Tutte polynomials for other families of self-similar graphs such as Farey graphs, 2-dimensional Sierpiński gasket graphs, Hanoi graphs, modified Koch graphs, Apollonian graphs, pseudofractal scale-free web, fractal scale-free network, etc.

Explicit bounds for the positive root of classes of polynomials with applications

NASA Astrophysics Data System (ADS)

Herzberger, Jürgen

2003-03-01

We consider a certain type of polynomial equations for which there exists--according to Descartes' rule of signs--only one simple positive root. These equations are occurring in Numerical Analysis when calculating or estimating the R-order or Q-order of convergence of certain iterative processes with an error-recursion of special form. On the other hand, these polynomial equations are very common as defining equations for the effective rate of return for certain cashflows like bonds or annuities in finance. The effective rate of interest i* for those cashflows is i*=q*-1, where q* is the unique positive root of such polynomial. We construct bounds for i* for a special problem concerning an ordinary simple annuity which is obtained by changing the conditions of such an annuity with given data applying the German rule (Preisangabeverordnung or short PAngV). Moreover, we consider a number of results for such polynomial roots in Numerical Analysis showing that by a simple variable transformation we can derive several formulas out of earlier results by applying this transformation. The same is possible in finance in order to generalize results to more complicated cashflows.

Members of the Genera Paenibacillus and Rhodococcus Harbor Genes Homologous to Enterococcal Glycopeptide Resistance Genes vanA and vanB

PubMed Central

Guardabassi, L.; Christensen, H.; Hasman, H.; Dalsgaard, A.

2004-01-01

Genes homologous to enterococcal glycopeptide resistance genes vanA and vanB were found in glycopeptide-resistant Paenibacillus and Rhodococcus strains from soil. The putative d-Ala:d-Lac ligase genes in Paenibacillus thiaminolyticus PT-2B1 and Paenibacillus apiarius PA-B2B were closely related to vanA (92 and 87%) and flanked by genes homologous to vanH and vanX in vanA operons. PMID:15561881

Members of the genera Paenibacillus and Rhodococcus harbor genes homologous to enterococcal glycopeptide resistance genes vanA and vanB.

PubMed

Guardabassi, L; Christensen, H; Hasman, H; Dalsgaard, A

2004-12-01

Genes homologous to enterococcal glycopeptide resistance genes vanA and vanB were found in glycopeptide-resistant Paenibacillus and Rhodococcus strains from soil. The putative D-Ala:D-Lac ligase genes in Paenibacillus thiaminolyticus PT-2B1 and Paenibacillus apiarius PA-B2B were closely related to vanA (92 and 87%) and flanked by genes homologous to vanH and vanX in vanA operons.

Equations on knot polynomials and 3d/5d duality

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mironov, A.; Morozov, A.; ITEP, Moscow

2012-09-24

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

A Comparison of Approximation Modeling Techniques: Polynomial Versus Interpolating Models

NASA Technical Reports Server (NTRS)

Giunta, Anthony A.; Watson, Layne T.

1998-01-01

Two methods of creating approximation models are compared through the calculation of the modeling accuracy on test problems involving one, five, and ten independent variables. Here, the test problems are representative of the modeling challenges typically encountered in realistic engineering optimization problems. The first approximation model is a quadratic polynomial created using the method of least squares. This type of polynomial model has seen considerable use in recent engineering optimization studies due to its computational simplicity and ease of use. However, quadratic polynomial models may be of limited accuracy when the response data to be modeled have multiple local extrema. The second approximation model employs an interpolation scheme known as kriging developed in the fields of spatial statistics and geostatistics. This class of interpolating model has the flexibility to model response data with multiple local extrema. However, this flexibility is obtained at an increase in computational expense and a decrease in ease of use. The intent of this study is to provide an initial exploration of the accuracy and modeling capabilities of these two approximation methods.

19 CFR 10.41a - Lift vans, cargo vans, shipping tanks, skids, pallets, and similar instruments of international...

Code of Federal Regulations, 2014 CFR

2014-04-01

... for inspection by Customs officials upon reasonable notice. (3) If the container does not exit the U.S... 19 Customs Duties 1 2014-04-01 2014-04-01 false Lift vans, cargo vans, shipping tanks, skids... Traffic § 10.41a Lift vans, cargo vans, shipping tanks, skids, pallets, and similar instruments of...

19 CFR 10.41a - Lift vans, cargo vans, shipping tanks, skids, pallets, and similar instruments of international...

Code of Federal Regulations, 2012 CFR

2012-04-01

... for inspection by Customs officials upon reasonable notice. (3) If the container does not exit the U.S... 19 Customs Duties 1 2012-04-01 2012-04-01 false Lift vans, cargo vans, shipping tanks, skids... Traffic § 10.41a Lift vans, cargo vans, shipping tanks, skids, pallets, and similar instruments of...

19 CFR 10.41a - Lift vans, cargo vans, shipping tanks, skids, pallets, and similar instruments of international...

Code of Federal Regulations, 2013 CFR

2013-04-01

... for inspection by Customs officials upon reasonable notice. (3) If the container does not exit the U.S... 19 Customs Duties 1 2013-04-01 2013-04-01 false Lift vans, cargo vans, shipping tanks, skids... Traffic § 10.41a Lift vans, cargo vans, shipping tanks, skids, pallets, and similar instruments of...

Segmented Polynomial Models in Quasi-Experimental Research.

ERIC Educational Resources Information Center

Wasik, John L.

1981-01-01

The use of segmented polynomial models is explained. Examples of design matrices of dummy variables are given for the least squares analyses of time series and discontinuity quasi-experimental research designs. Linear combinations of dummy variable vectors appear to provide tests of effects in the two quasi-experimental designs. (Author/BW)

New graph polynomials in parametric QED Feynman integrals

NASA Astrophysics Data System (ADS)

Golz, Marcel

2017-10-01

In recent years enormous progress has been made in perturbative quantum field theory by applying methods of algebraic geometry to parametric Feynman integrals for scalar theories. The transition to gauge theories is complicated not only by the fact that their parametric integrand is much larger and more involved. It is, moreover, only implicitly given as the result of certain differential operators applied to the scalar integrand exp(-ΦΓ /ΨΓ) , where ΨΓ and ΦΓ are the Kirchhoff and Symanzik polynomials of the Feynman graph Γ. In the case of quantum electrodynamics we find that the full parametric integrand inherits a rich combinatorial structure from ΨΓ and ΦΓ. In the end, it can be expressed explicitly as a sum over products of new types of graph polynomials which have a combinatoric interpretation via simple cycle subgraphs of Γ.

Influence of surface error on electromagnetic performance of reflectors based on Zernike polynomials

NASA Astrophysics Data System (ADS)

Li, Tuanjie; Shi, Jiachen; Tang, Yaqiong

2018-04-01

This paper investigates the influence of surface error distribution on the electromagnetic performance of antennas. The normalized Zernike polynomials are used to describe a smooth and continuous deformation surface. Based on the geometrical optics and piecewise linear fitting method, the electrical performance of reflector described by the Zernike polynomials is derived to reveal the relationship between surface error distribution and electromagnetic performance. Then the relation database between surface figure and electric performance is built for ideal and deformed surfaces to realize rapidly calculation of far-field electric performances. The simulation analysis of the influence of Zernike polynomials on the electrical properties for the axis-symmetrical reflector with the axial mode helical antenna as feed is further conducted to verify the correctness of the proposed method. Finally, the influence rules of surface error distribution on electromagnetic performance are summarized. The simulation results show that some terms of Zernike polynomials may decrease the amplitude of main lobe of antenna pattern, and some may reduce the pointing accuracy. This work extracts a new concept for reflector's shape adjustment in manufacturing process.

A Formally-Verified Decision Procedure for Univariate Polynomial Computation Based on Sturm's Theorem

NASA Technical Reports Server (NTRS)

Narkawicz, Anthony J.; Munoz, Cesar A.

2014-01-01

Sturm's Theorem is a well-known result in real algebraic geometry that provides a function that computes the number of roots of a univariate polynomial in a semiopen interval. This paper presents a formalization of this theorem in the PVS theorem prover, as well as a decision procedure that checks whether a polynomial is always positive, nonnegative, nonzero, negative, or nonpositive on any input interval. The soundness and completeness of the decision procedure is proven in PVS. The procedure and its correctness properties enable the implementation of a PVS strategy for automatically proving existential and universal univariate polynomial inequalities. Since the decision procedure is formally verified in PVS, the soundness of the strategy depends solely on the internal logic of PVS rather than on an external oracle. The procedure itself uses a combination of Sturm's Theorem, an interval bisection procedure, and the fact that a polynomial with exactly one root in a bounded interval is always nonnegative on that interval if and only if it is nonnegative at both endpoints.

A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jakeman, John D.; Narayan, Akil; Zhou, Tao

We propose an algorithm for recovering sparse orthogonal polynomial expansions via collocation. A standard sampling approach for recovering sparse polynomials uses Monte Carlo sampling, from the density of orthogonality, which results in poor function recovery when the polynomial degree is high. Our proposed approach aims to mitigate this limitation by sampling with respect to the weighted equilibrium measure of the parametric domain and subsequently solves a preconditionedmore » $$\\ell^1$$-minimization problem, where the weights of the diagonal preconditioning matrix are given by evaluations of the Christoffel function. Our algorithm can be applied to a wide class of orthogonal polynomial families on bounded and unbounded domains, including all classical families. We present theoretical analysis to motivate the algorithm and numerical results that show our method is superior to standard Monte Carlo methods in many situations of interest. In conclusion, numerical examples are also provided to demonstrate that our proposed algorithm leads to comparable or improved accuracy even when compared with Legendre- and Hermite-specific algorithms.« less

A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions

DOE PAGES

Jakeman, John D.; Narayan, Akil; Zhou, Tao

2017-06-22

We propose an algorithm for recovering sparse orthogonal polynomial expansions via collocation. A standard sampling approach for recovering sparse polynomials uses Monte Carlo sampling, from the density of orthogonality, which results in poor function recovery when the polynomial degree is high. Our proposed approach aims to mitigate this limitation by sampling with respect to the weighted equilibrium measure of the parametric domain and subsequently solves a preconditionedmore » $$\\ell^1$$-minimization problem, where the weights of the diagonal preconditioning matrix are given by evaluations of the Christoffel function. Our algorithm can be applied to a wide class of orthogonal polynomial families on bounded and unbounded domains, including all classical families. We present theoretical analysis to motivate the algorithm and numerical results that show our method is superior to standard Monte Carlo methods in many situations of interest. In conclusion, numerical examples are also provided to demonstrate that our proposed algorithm leads to comparable or improved accuracy even when compared with Legendre- and Hermite-specific algorithms.« less

Numerical Solutions of the Nonlinear Fractional-Order Brusselator System by Bernstein Polynomials

PubMed Central

Khan, Rahmat Ali; Tajadodi, Haleh; Johnston, Sarah Jane

2014-01-01

In this paper we propose the Bernstein polynomials to achieve the numerical solutions of nonlinear fractional-order chaotic system known by fractional-order Brusselator system. We use operational matrices of fractional integration and multiplication of Bernstein polynomials, which turns the nonlinear fractional-order Brusselator system to a system of algebraic equations. Two illustrative examples are given in order to demonstrate the accuracy and simplicity of the proposed techniques. PMID:25485293

A unique Austin Chalk reservoir, Van field, Van Zandt County, Texas

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lowe, J.T.

1990-09-01

Significant shallow oil production from the Austin Chalk was established in the Van field, Van Zandt County, in East Texas in the late 1980s. The Van field structure is a complexly faulted domal anticline created by salt intrusion. The Woodbine sands, which underlie the Austin Chalk, have been and continue to be the predominant reservoir rocks in the field. Evidence indicates that faults provided vertical conduits for migration of Woodbine oil into the Austin Chalk where it was trapped along the structural crest. The most prolific Austin Chalk production is on the upthrown side of the main field fault, asmore » is the Woodbine. The Austin Chalk is a soft, white to light gray limestone composed mostly of coccoliths with some pelecypods. Unlike the Austin Chalk in the Giddings and Pearsall fields, the chalk at Van was not as deeply buried and therefore did not become brittle and susceptible to tensional or cryptic fracturing. The shallow burial in the Van field was also important in that it allowed the chalk to retain primary microporosity. The production comes entirely from this primary porosity. In addition to the structural position and underlying oil source from the Woodbine, the depositional environment and associated lithofacies are also keys to the reservoir quality in the Van field as demonstrated by cores from the upthrown and downthrown (less productive) sides of the main field fault. It appears that at the time of Austin Chalk deposition, the main field fault was active and caused the upthrown side to be a structural high and a more agreeable environment for benthonic organisms such as pelecypods and worms. The resulting bioturbation enhanced the reservoir's permeability enough to allow migration and entrapment of the oil. Future success in exploration for analogous Austin Chalk reservoirs will require the combination of a favorable environment of deposition, a nearby Woodbine oil source, and a faulted trap that will provide the conduit for migration.« less

Orthogonal sets of data windows constructed from trigonometric polynomials

NASA Technical Reports Server (NTRS)

Greenhall, C. A.

1989-01-01

Suboptimal, easily computable substitutes for the discrete prolate-spheroidal windows used by Thomson for spectral estimation are given. Trigonometric coefficients and energy leakages of the window polynomials are tabulated.

On Using Homogeneous Polynomials To Design Anisotropic Yield Functions With Tension/Compression Symmetry/Assymetry

DOE Office of Scientific and Technical Information (OSTI.GOV)

Soare, S.; Cazacu, O.; Yoon, J. W.

With few exceptions, non-quadratic homogeneous polynomials have received little attention as possible candidates for yield functions. One reason might be that not every such polynomial is a convex function. In this paper we show that homogeneous polynomials can be used to develop powerful anisotropic yield criteria, and that imposing simple constraints on the identification process leads, aposteriori, to the desired convexity property. It is shown that combinations of such polynomials allow for modeling yielding properties of metallic materials with any crystal structure, i.e. both cubic and hexagonal which display strength differential effects. Extensions of the proposed criteria to 3D stressmore » states are also presented. We apply these criteria to the description of the aluminum alloy AA2090T3. We prove that a sixth order orthotropic homogeneous polynomial is capable of a satisfactory description of this alloy. Next, applications to the deep drawing of a cylindrical cup are presented. The newly proposed criteria were implemented as UMAT subroutines into the commercial FE code ABAQUS. We were able to predict six ears on the AA2090T3 cup's profile. Finally, we show that a tension/compression asymmetry in yielding can have an important effect on the earing profile.« less

On Using Homogeneous Polynomials To Design Anisotropic Yield Functions With Tension/Compression Symmetry/Assymetry

NASA Astrophysics Data System (ADS)

Soare, S.; Yoon, J. W.; Cazacu, O.

2007-05-01

With few exceptions, non-quadratic homogeneous polynomials have received little attention as possible candidates for yield functions. One reason might be that not every such polynomial is a convex function. In this paper we show that homogeneous polynomials can be used to develop powerful anisotropic yield criteria, and that imposing simple constraints on the identification process leads, aposteriori, to the desired convexity property. It is shown that combinations of such polynomials allow for modeling yielding properties of metallic materials with any crystal structure, i.e. both cubic and hexagonal which display strength differential effects. Extensions of the proposed criteria to 3D stress states are also presented. We apply these criteria to the description of the aluminum alloy AA2090T3. We prove that a sixth order orthotropic homogeneous polynomial is capable of a satisfactory description of this alloy. Next, applications to the deep drawing of a cylindrical cup are presented. The newly proposed criteria were implemented as UMAT subroutines into the commercial FE code ABAQUS. We were able to predict six ears on the AA2090T3 cup's profile. Finally, we show that a tension/compression asymmetry in yielding can have an important effect on the earing profile.

Quadratically Convergent Method for Simultaneously Approaching the Roots of Polynomial Solutions of a Class of Differential Equations

NASA Astrophysics Data System (ADS)

Recchioni, Maria Cristina

2001-12-01

This paper investigates the application of the method introduced by L. Pasquini (1989) for simultaneously approaching the zeros of polynomial solutions to a class of second-order linear homogeneous ordinary differential equations with polynomial coefficients to a particular case in which these polynomial solutions have zeros symmetrically arranged with respect to the origin. The method is based on a family of nonlinear equations which is associated with a given class of differential equations. The roots of the nonlinear equations are related to the roots of the polynomial solutions of differential equations considered. Newton's method is applied to find the roots of these nonlinear equations. In (Pasquini, 1994) the nonsingularity of the roots of these nonlinear equations is studied. In this paper, following the lines in (Pasquini, 1994), the nonsingularity of the roots of these nonlinear equations is studied. More favourable results than the ones in (Pasquini, 1994) are proven in the particular case of polynomial solutions with symmetrical zeros. The method is applied to approximate the roots of Hermite-Sobolev type polynomials and Freud polynomials. A lower bound for the smallest positive root of Hermite-Sobolev type polynomials is given via the nonlinear equation. The quadratic convergence of the method is proven. A comparison with a classical method that uses the Jacobi matrices is carried out. We show that the algorithm derived by the proposed method is sometimes preferable to the classical QR type algorithms for computing the eigenvalues of the Jacobi matrices even if these matrices are real and symmetric.

Correlations of RMT characteristic polynomials and integrability: Hermitean matrices

DOE Office of Scientific and Technical Information (OSTI.GOV)

Osipov, Vladimir Al., E-mail: Vladimir.Osipov@uni-due.d; Kanzieper, Eugene, E-mail: Eugene.Kanzieper@hit.ac.i; Department of Physics of Complex Systems, Weizmann Institute of Science, Rehovot 76100

Integrable theory is formulated for correlation functions of characteristic polynomials associated with invariant non-Gaussian ensembles of Hermitean random matrices. By embedding the correlation functions of interest into a more general theory of {tau} functions, we (i) identify a zoo of hierarchical relations satisfied by {tau} functions in an abstract infinite-dimensional space and (ii) present a technology to translate these relations into hierarchically structured nonlinear differential equations describing the correlation functions of characteristic polynomials in the physical, spectral space. Implications of this formalism for fermionic, bosonic, and supersymmetric variations of zero-dimensional replica field theories are discussed at length. A particular emphasismore » is placed on the phenomenon of fermionic-bosonic factorisation of random-matrix-theory correlation functions.« less

Polynomial complexity despite the fermionic sign

NASA Astrophysics Data System (ADS)

Rossi, R.; Prokof'ev, N.; Svistunov, B.; Van Houcke, K.; Werner, F.

2017-04-01

It is commonly believed that in unbiased quantum Monte Carlo approaches to fermionic many-body problems, the infamous sign problem generically implies prohibitively large computational times for obtaining thermodynamic-limit quantities. We point out that for convergent Feynman diagrammatic series evaluated with a recently introduced Monte Carlo algorithm (see Rossi R., arXiv:1612.05184), the computational time increases only polynomially with the inverse error on thermodynamic-limit quantities.

Optimization of Cubic Polynomial Functions without Calculus

ERIC Educational Resources Information Center

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…

The hit problem for symmetric polynomials over the Steenrod algebra

NASA Astrophysics Data System (ADS)

Janfada, A. S.; Wood, R. M. W.

2002-09-01

We cite [18] for references to work on the hit problem for the polynomial algebra P(n) = [open face F]2[x1, ;…, xn] = [oplus B: plus sign in circle]d[gt-or-equal, slanted]0 Pd(n), viewed as a graded left module over the Steenrod algebra [script A] at the prime 2. The grading is by the homogeneous polynomials Pd(n) of degree d in the n variables x1, …, xn of grading 1. The present article investigates the hit problem for the [script A]-submodule of symmetric polynomials B(n) = P(n)[sum L: summation operator]n , where [sum L: summation operator]n denotes the symmetric group on n letters acting on the right of P(n). Among the main results is the symmetric version of the well-known Peterson conjecture. For a positive integer d, let [mu](d) denote the smallest value of k for which d = [sum L: summation operator]ki=1(2[lambda]i[minus sign]1), where [lambda]i [gt-or-equal, slanted] 0.

Stirling Powered Van Progam overview

NASA Technical Reports Server (NTRS)

Shaltens, R. K.

1986-01-01

The Stirling Powered Van Program (SPVP) is a multiyear, multiphase program to evaluate the automotive Stirling engine (ASE) in Air Force vans under realistic conditions. The objective of the SPVP is to transfer to manufacturer and end user(s) (i.e., on the path to commercialization) the second-generation Mod 2 ASE upon completion of the Automotive Stirling Engine Program in 1987. In order to meet this objective, the SPVP must establish Stirling performance, integrity, reliability, durability and maintainability. The ASE program background leading to the van program is reviewed and plans for evaluating the kinematic Stirling engine in Air Force vans examined. Also discussed are the NASA technology transfers to industry that have been accomplished and those which are currently being developed.

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

NASA Astrophysics Data System (ADS)

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.

Polynomial stability of a magneto-thermoelastic Mindlin-Timoshenko plate model

NASA Astrophysics Data System (ADS)

Ferreira, Marcio V.; Muñoz Rivera, Jaime E.

2018-02-01

In this paper, we consider the magneto-thermoelastic interactions in a two-dimensional Mindlin-Timoshenko plate. Our main result is concerned with the strong asymptotic stabilization of the model. In particular, we determine the rate of polynomial decay of the associated energy. In contrast with what was observed in other related articles, geometrical hypotheses on the plate configuration (such as radial symmetry) are not imposed in this study nor any kind of frictional damping mechanism. A suitable multiplier is instrumental in establishing the polynomial stability with the aid of a recent result due to Borichev and Tomilov (Math Ann 347(2):455-478, 2010).

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

PubMed

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.

The first example of erbium triple-stranded helicates displaying SMM behaviour.

PubMed

Gorczyński, Adam; Kubicki, Maciej; Pinkowicz, Dawid; Pełka, Robert; Patroniak, Violetta; Podgajny, Robert

2015-10-14

A series of isostructural C3-symmetrical triple stranded dinuclear lanthanide [Ln2L3](NO3)3 molecules have been synthesized using subcomponent self-assembly of Ln(NO3)3 with 2-(methylhydrazino)benzimidazole and 4-tert-butyl-2,6-diformylphenol, where Ln = Tb (1), Dy (2), Ho (3), Er (4), Tm (5), and Yb (6). The temperature dependent and field dependent magnetic properties of 1-6 were modeled using the van Vleck approximation including the crystal field term HCF, the super-exchange term HSE and the Zeeman term HZE. Ferromagnetic interactions were found in 1, 2, 4 and 6, while antiferromagnetic interactions were found in 3 and 5. The erbium analogue reveals field induced SMM behaviour.

Transfer matrix computation of critical polynomials for two-dimensional Potts models

DOE PAGES

Jacobsen, Jesper Lykke; Scullard, Christian R.

2013-02-04

We showed, In our previous work, that critical manifolds of the q-state Potts model can be studied by means of a graph polynomial P B(q, v), henceforth referred to as the critical polynomial. This polynomial may be defined on any periodic two-dimensional lattice. It depends on a finite subgraph B, called the basis, and the manner in which B is tiled to construct the lattice. The real roots v = e K — 1 of P B(q, v) either give the exact critical points for the lattice, or provide approximations that, in principle, can be made arbitrarily accurate by increasingmore » the size of B in an appropriate way. In earlier work, P B(q, v) was defined by a contraction-deletion identity, similar to that satisfied by the Tutte polynomial. Here, we give a probabilistic definition of P B(q, v), which facilitates its computation, using the transfer matrix, on much larger B than was previously possible.We present results for the critical polynomial on the (4, 8 2), kagome, and (3, 12 2) lattices for bases of up to respectively 96, 162, and 243 edges, compared to the limit of 36 edges with contraction-deletion. We discuss in detail the role of the symmetries and the embedding of B. The critical temperatures v c obtained for ferromagnetic (v > 0) Potts models are at least as precise as the best available results from Monte Carlo simulations or series expansions. For instance, with q = 3 we obtain v c(4, 8 2) = 3.742 489 (4), v c(kagome) = 1.876 459 7 (2), and v c(3, 12 2) = 5.033 078 49 (4), the precision being comparable or superior to the best simulation results. More generally, we trace the critical manifolds in the real (q, v) plane and discuss the intricate structure of the phase diagram in the antiferromagnetic (v < 0) region.« less

Introduction to Real Orthogonal Polynomials

DTIC Science & Technology

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

vanC Cluster of Vancomycin-Resistant Enterococcus gallinarum BM4174

PubMed Central

Arias, Cesar A.; Courvalin, Patrice; Reynolds, Peter E.

2000-01-01

Glycopeptide-resistant enterococci of the VanC type synthesize UDP-muramyl-pentapeptide[d-Ser] for cell wall assembly and prevent synthesis of peptidoglycan precursors ending in d-Ala. The vanC cluster of Enterococcus gallinarum BM4174 consists of five genes: vanC-1, vanXYC, vanT, vanRC, and vanSC. Three genes are sufficient for resistance: vanC-1 encodes a ligase that synthesizes the dipeptide d-Ala-d-Ser for addition to UDP-MurNAc-tripeptide, vanXYC encodes a d,d-dipeptidase–carboxypeptidase that hydrolyzes d-Ala-d-Ala and removes d-Ala from UDP-MurNAc-pentapeptide[d-Ala], and vanT encodes a membrane-bound serine racemase that provides d-Ser for the synthetic pathway. The three genes are clustered: the start codons of vanXYC and vanT overlap the termination codons of vanC-1 and vanXYC, respectively. Two genes which encode proteins with homology to the VanS-VanR two-component regulatory system were present downstream from the resistance genes. The predicted amino acid sequence of VanRC exhibited 50% identity to VanR and 33% identity to VanRB. VanSC had 40% identity to VanS over a region of 308 amino acids and 24% identity to VanSB over a region of 285 amino acids. All residues with important functions in response regulators and histidine kinases were conserved in VanRC and VanSC, respectively. Induction experiments based on the determination of d,d-carboxypeptidase activity in cytoplasmic extracts confirmed that the genes were expressed constitutively. Using a promoter-probing vector, regions upstream from the resistance and regulatory genes were identified that have promoter activity. PMID:10817725

Advanced Stochastic Collocation Methods for Polynomial Chaos in RAVEN

NASA Astrophysics Data System (ADS)

Talbot, Paul W.

As experiment complexity in fields such as nuclear engineering continually increases, so does the demand for robust computational methods to simulate them. In many simulations, input design parameters and intrinsic experiment properties are sources of uncertainty. Often small perturbations in uncertain parameters have significant impact on the experiment outcome. For instance, in nuclear fuel performance, small changes in fuel thermal conductivity can greatly affect maximum stress on the surrounding cladding. The difficulty quantifying input uncertainty impact in such systems has grown with the complexity of numerical models. Traditionally, uncertainty quantification has been approached using random sampling methods like Monte Carlo. For some models, the input parametric space and corresponding response output space is sufficiently explored with few low-cost calculations. For other models, it is computationally costly to obtain good understanding of the output space. To combat the expense of random sampling, this research explores the possibilities of using advanced methods in Stochastic Collocation for generalized Polynomial Chaos (SCgPC) as an alternative to traditional uncertainty quantification techniques such as Monte Carlo (MC) and Latin Hypercube Sampling (LHS) methods for applications in nuclear engineering. We consider traditional SCgPC construction strategies as well as truncated polynomial spaces using Total Degree and Hyperbolic Cross constructions. We also consider applying anisotropy (unequal treatment of different dimensions) to the polynomial space, and offer methods whereby optimal levels of anisotropy can be approximated. We contribute development to existing adaptive polynomial construction strategies. Finally, we consider High-Dimensional Model Reduction (HDMR) expansions, using SCgPC representations for the subspace terms, and contribute new adaptive methods to construct them. We apply these methods on a series of models of increasing

Polynomial expansions of single-mode motions around equilibrium points in the circular restricted three-body problem

NASA Astrophysics Data System (ADS)

Lei, Hanlun; Xu, Bo; Circi, Christian

2018-05-01

In this work, the single-mode motions around the collinear and triangular libration points in the circular restricted three-body problem are studied. To describe these motions, we adopt an invariant manifold approach, which states that a suitable pair of independent variables are taken as modal coordinates and the remaining state variables are expressed as polynomial series of them. Based on the invariant manifold approach, the general procedure on constructing polynomial expansions up to a certain order is outlined. Taking the Earth-Moon system as the example dynamical model, we construct the polynomial expansions up to the tenth order for the single-mode motions around collinear libration points, and up to order eight and six for the planar and vertical-periodic motions around triangular libration point, respectively. The application of the polynomial expansions constructed lies in that they can be used to determine the initial states for the single-mode motions around equilibrium points. To check the validity, the accuracy of initial states determined by the polynomial expansions is evaluated.

Characterisation of the selective binding of antibiotics vancomycin and teicoplanin by the VanS receptor regulating type A vancomycin resistance in the enterococci.

PubMed

Hughes, C S; Longo, E; Phillips-Jones, M K; Hussain, R

2017-08-01

A-type resistance towards "last-line" glycopeptide antibiotic vancomycin in the leading hospital acquired infectious agent, the enterococci, is the most common in the UK. Resistance is regulated by the VanR A S A two-component system, comprising the histidine sensor kinase VanS A and the partner response regulator VanR A . The nature of the activating ligand for VanS A has not been identified, therefore this work sought to identify and characterise ligand(s) for VanS A . In vitro approaches were used to screen the structural and activity effects of a range of potential ligands with purified VanS A protein. Of the screened ligands (glycopeptide antibiotics vancomycin and teicoplanin, and peptidoglycan components N-acetylmuramic acid, D-Ala-D-Ala and Ala-D-y-Glu-Lys-D-Ala-D-Ala) only glycopeptide antibiotics vancomycin and teicoplanin were found to bind VanS A with different affinities (vancomycin 70μM; teicoplanin 30 and 170μM), and were proposed to bind via exposed aromatic residues tryptophan and tyrosine. Furthermore, binding of the antibiotics induced quicker, longer-lived phosphorylation states for VanS A , proposing them as activators of type A vancomycin resistance in the enterococci. Copyright © 2017 Diamond Light Source Ltd. Published by Elsevier B.V. All rights reserved.

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Schulze-Halberg, Axel, E-mail: axgeschu@iun.edu; Department of Physics, Indiana University Northwest, 3400 Broadway, Gary IN 46408; Roy, Pinaki, E-mail: pinaki@isical.ac.in

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.

The Julia sets of basic uniCremer polynomials of arbitrary degree

NASA Astrophysics Data System (ADS)

Blokh, Alexander; Oversteegen, Lex

Let P be a polynomial of degree d with a Cremer point p and no repelling or parabolic periodic bi-accessible points. We show that there are two types of such Julia sets J_P . The red dwarf J_P are nowhere connected im kleinen and such that the intersection of all impressions of external angles is a continuum containing p and the orbits of all critical images. The solar J_P are such that every angle with dense orbit has a degenerate impression disjoint from other impressions and J_P is connected im kleinen at its landing point. We study bi-accessible points and locally connected models of J_P and show that such sets J_P appear through polynomial-like maps for generic polynomials with Cremer points. Since known tools break down for d>2 (if d>2 , it is not known if there are small cycles near p , while if d=2 , this result is due to Yoccoz), we introduce wandering ray continua in J_P and provide a new application of Thurston laminations.

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

NASA Astrophysics Data System (ADS)

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.

An Exactly Solvable Spin Chain Related to Hahn Polynomials

NASA Astrophysics Data System (ADS)

Stoilova, Neli I.; van der Jeugt, Joris

2011-03-01

We study a linear spin chain which was originally introduced by Shi et al. [Phys. Rev. A 71 (2005), 032309, 5 pages], for which the coupling strength contains a parameter α and depends on the parity of the chain site. Extending the model by a second parameter β, it is shown that the single fermion eigenstates of the Hamiltonian can be computed in explicit form. The components of these eigenvectors turn out to be Hahn polynomials with parameters (α,β) and (α+1,β-1). The construction of the eigenvectors relies on two new difference equations for Hahn polynomials. The explicit knowledge of the eigenstates leads to a closed form expression for the correlation function of the spin chain. We also discuss some aspects of a q-extension of this model.

Supersymmetric quantum mechanics: Engineered hierarchies of integrable potentials and related orthogonal polynomials

DOE Office of Scientific and Technical Information (OSTI.GOV)

Balondo Iyela, Daddy; Centre for Cosmology, Particle Physics and Phenomenology; Département de Physique, Université de Kinshasa

2013-09-15

Within the context of supersymmetric quantum mechanics and its related hierarchies of integrable quantum Hamiltonians and potentials, a general programme is outlined and applied to its first two simplest illustrations. Going beyond the usual restriction of shape invariance for intertwined potentials, it is suggested to require a similar relation for Hamiltonians in the hierarchy separated by an arbitrary number of levels, N. By requiring further that these two Hamiltonians be in fact identical up to an overall shift in energy, a periodic structure is installed in the hierarchy which should allow for its resolution. Specific classes of orthogonal polynomials characteristicmore » of such periodic hierarchies are thereby generated, while the methods of supersymmetric quantum mechanics then lead to generalised Rodrigues formulae and recursion relations for such polynomials. The approach also offers the practical prospect of quantum modelling through the engineering of quantum potentials from experimental energy spectra. In this paper, these ideas are presented and solved explicitly for the cases N= 1 and N= 2. The latter case is related to the generalised Laguerre polynomials, for which indeed new results are thereby obtained. In the context of dressing chains and deformed polynomial Heisenberg algebras, some partial results for N⩾ 3 also exist in the literature, which should be relevant to a complete study of the N⩾ 3 general periodic hierarchies.« less

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

PubMed

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.

Chemical Equilibrium and Polynomial Equations: Beware of Roots.

ERIC Educational Resources Information Center

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…

Wilson polynomials/functions and intertwining operators for the generic quantum superintegrable system on the 2-sphere

NASA Astrophysics Data System (ADS)

Miller, W., Jr.; Li, Q.

2015-04-01

The Wilson and Racah polynomials can be characterized as basis functions for irreducible representations of the quadratic symmetry algebra of the quantum superintegrable system on the 2-sphere, HΨ = EΨ, with generic 3-parameter potential. Clearly, the polynomials are expansion coefficients for one eigenbasis of a symmetry operator L2 of H in terms of an eigenbasis of another symmetry operator L1, but the exact relationship appears not to have been made explicit. We work out the details of the expansion to show, explicitly, how the polynomials arise and how the principal properties of these functions: the measure, 3-term recurrence relation, 2nd order difference equation, duality of these relations, permutation symmetry, intertwining operators and an alternate derivation of Wilson functions - follow from the symmetry of this quantum system. This paper is an exercise to show that quantum mechancal concepts and recurrence relations for Gausian hypergeometrc functions alone suffice to explain these properties; we make no assumptions about the structure of Wilson polynomial/functions, but derive them from quantum principles. There is active interest in the relation between multivariable Wilson polynomials and the quantum superintegrable system on the n-sphere with generic potential, and these results should aid in the generalization. Contracting function space realizations of irreducible representations of this quadratic algebra to the other superintegrable systems one can obtain the full Askey scheme of orthogonal hypergeometric polynomials. All of these contractions of superintegrable systems with potential are uniquely induced by Wigner Lie algebra contractions of so(3, C) and e(2,C). All of the polynomials produced are interpretable as quantum expansion coefficients. It is important to extend this process to higher dimensions.

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

PubMed Central

Mahmood, Zahid; Ning, Huansheng; Ghafoor, AtaUllah

2017-01-01

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. PMID:28338632

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

PubMed

Mueller, Axel; Kammoun, Abla; Björnson, Emil; Debbah, Mérouane

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

Local polynomial estimation of heteroscedasticity in a multivariate linear regression model and its applications in economics.

PubMed

Su, Liyun; Zhao, Yanyong; Yan, Tianshun; Li, Fenglan

2012-01-01

Multivariate local polynomial fitting is applied to the multivariate linear heteroscedastic regression model. Firstly, the local polynomial fitting is applied to estimate heteroscedastic function, then the coefficients of regression model are obtained by using generalized least squares method. One noteworthy feature of our approach is that we avoid the testing for heteroscedasticity by improving the traditional two-stage method. Due to non-parametric technique of local polynomial estimation, it is unnecessary to know the form of heteroscedastic function. Therefore, we can improve the estimation precision, when the heteroscedastic function is unknown. Furthermore, we verify that the regression coefficients is asymptotic normal based on numerical simulations and normal Q-Q plots of residuals. Finally, the simulation results and the local polynomial estimation of real data indicate that our approach is surely effective in finite-sample situations.

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

NASA Astrophysics Data System (ADS)

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.

Pseudo spectral collocation with Maxwell polynomials for kinetic equations with energy diffusion

NASA Astrophysics Data System (ADS)

Sánchez-Vizuet, Tonatiuh; Cerfon, Antoine J.

2018-02-01

We study the approximation and stability properties of a recently popularized discretization strategy for the speed variable in kinetic equations, based on pseudo-spectral collocation on a grid defined by the zeros of a non-standard family of orthogonal polynomials called Maxwell polynomials. Taking a one-dimensional equation describing energy diffusion due to Fokker-Planck collisions with a Maxwell-Boltzmann background distribution as the test bench for the performance of the scheme, we find that Maxwell based discretizations outperform other commonly used schemes in most situations, often by orders of magnitude. This provides a strong motivation for their use in high-dimensional gyrokinetic simulations. However, we also show that Maxwell based schemes are subject to a non-modal time stepping instability in their most straightforward implementation, so that special care must be given to the discrete representation of the linear operators in order to benefit from the advantages provided by Maxwell polynomials.

Are Khovanov-Rozansky polynomials consistent with evolution in the space of knots?

NASA Astrophysics Data System (ADS)

Anokhina, A.; Morozov, A.

2018-04-01

R-coloured knot polynomials for m-strand torus knots Torus [ m, n] are described by the Rosso-Jones formula, which is an example of evolution in n with Lyapunov exponents, labelled by Young diagrams from R ⊗ m . This means that they satisfy a finite-difference equation (recursion) of finite degree. For the gauge group SL( N ) only diagrams with no more than N lines can contribute and the recursion degree is reduced. We claim that these properties (evolution/recursion and reduction) persist for Khovanov-Rozansky (KR) polynomials, obtained by additional factorization modulo 1 + t, which is not yet adequately described in quantum field theory. Also preserved is some weakened version of differential expansion, which is responsible at least for a simple relation between reduced and unreduced Khovanov polynomials. However, in the KR case evolution is incompatible with the mirror symmetry under the change n -→ - n, what can signal about an ambiguity in the KR factorization even for torus knots.

On Partial Fraction Decompositions by Repeated Polynomial Divisions

ERIC Educational Resources Information Center

Man, Yiu-Kwong

2017-01-01

We present a method for finding partial fraction decompositions of rational functions with linear or quadratic factors in the denominators by means of repeated polynomial divisions. This method does not involve differentiation or solving linear equations for obtaining the unknown partial fraction coefficients, which is very suitable for either…

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

ERIC Educational Resources Information Center

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.

State-vector formalism and the Legendre polynomial solution for modelling guided waves in anisotropic plates

NASA Astrophysics Data System (ADS)

Zheng, Mingfang; He, Cunfu; Lu, Yan; Wu, Bin

2018-01-01

We presented a numerical method to solve phase dispersion curve in general anisotropic plates. This approach involves an exact solution to the problem in the form of the Legendre polynomial of multiple integrals, which we substituted into the state-vector formalism. In order to improve the efficiency of the proposed method, we made a special effort to demonstrate the analytical methodology. Furthermore, we analyzed the algebraic symmetries of the matrices in the state-vector formalism for anisotropic plates. The basic feature of the proposed method was the expansion of field quantities by Legendre polynomials. The Legendre polynomial method avoid to solve the transcendental dispersion equation, which can only be solved numerically. This state-vector formalism combined with Legendre polynomial expansion distinguished the adjacent dispersion mode clearly, even when the modes were very close. We then illustrated the theoretical solutions of the dispersion curves by this method for isotropic and anisotropic plates. Finally, we compared the proposed method with the global matrix method (GMM), which shows excellent agreement.

Softwaremodule voor het Simuleren van de Gevolgen van Raketonderschepping (The Dutch Program for the Simulation of Missile Intercept Effects)

DTIC Science & Technology

2007-07-01

effects (Softwaremodule voor het simuleren van de gevolgen van raketonderschepping) 11 . AUTHOR(S) Dr E. Abadjieva, MSc R.P. Sterkenburg, MSc F. Bouquet...Softwaremnodule voor het simuleren van de gevolgen van raketonderschepping D)attini Juli 2007 Auteur(s) dr. F. Abadjicva ir. R.P Sterkenburg ir. F. Bouquet ir...P.W. D)ouip Rubricering rapport O)ngerubri ceerd Vastgesteld door Maj R. 11 . Jongkinid Vastgesteld d.d. 12 juni 2007 (Deze nitining mizil-4 sict

Algorithms for computing solvents of unilateral second-order matrix polynomials over prime finite fields using lambda-matrices

NASA Astrophysics Data System (ADS)

Burtyka, Filipp

2018-01-01

The paper considers algorithms for finding diagonalizable and non-diagonalizable roots (so called solvents) of monic arbitrary unilateral second-order matrix polynomial over prime finite field. These algorithms are based on polynomial matrices (lambda-matrices). This is an extension of existing general methods for computing solvents of matrix polynomials over field of complex numbers. We analyze how techniques for complex numbers can be adapted for finite field and estimate asymptotic complexity of the obtained algorithms.

Chebyshev polynomials in the spectral Tau method and applications to Eigenvalue problems

NASA Technical Reports Server (NTRS)

Johnson, Duane

1996-01-01

Chebyshev Spectral methods have received much attention recently as a technique for the rapid solution of ordinary differential equations. This technique also works well for solving linear eigenvalue problems. Specific detail is given to the properties and algebra of chebyshev polynomials; the use of chebyshev polynomials in spectral methods; and the recurrence relationships that are developed. These formula and equations are then applied to several examples which are worked out in detail. The appendix contains an example FORTRAN program used in solving an eigenvalue problem.

Killings, duality and characteristic polynomials

NASA Astrophysics Data System (ADS)

Á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

Least-Squares Adaptive Control Using Chebyshev Orthogonal Polynomials

NASA Technical Reports Server (NTRS)

Nguyen, Nhan T.; Burken, John; Ishihara, Abraham

2011-01-01

This paper presents a new adaptive control approach using Chebyshev orthogonal polynomials as basis functions in a least-squares functional approximation. The use of orthogonal basis functions improves the function approximation significantly and enables better convergence of parameter estimates. Flight control simulations demonstrate the effectiveness of the proposed adaptive control approach.

Beslisbevoegdheden en Verantwoordelijkheden van de Uitgestegen Soldaat. Deel A: Verplaatsen van Beslisbevoegdheden (Authority and Responsibility of the Dismounted Soldier. Part A. Empowering the Dismounted Soldier)

DTIC Science & Technology

2007-04-01

en verantwoordelijkheden van de uitgestegen soldaat Deel A: verplaatsen van beslisbevoegdheden Datumn april 2007 Auteur (s) R. de Bruin ITE. van Bernmel...Admiraal, Bureau SMP Auteur (s) R. de Bruin Program maleider Projectleider I.E. van Bemnmel dr. W.A. Lotens, A.J. van Vliet, A.J. van Vijet TNO Defensie en...Leadership Theory en wordt relevant geacht voor de ontvangers van aanvullende beslisbevoegdheden. 2.1.3 Het oogmerk van de hogere commandant Een ander

Design of polynomial fuzzy observer-controller for nonlinear systems with state delay: sum of squares approach

NASA Astrophysics Data System (ADS)

Gassara, H.; El Hajjaji, A.; Chaabane, M.

2017-07-01

This paper investigates the problem of observer-based control for two classes of polynomial fuzzy systems with time-varying delay. The first class concerns a special case where the polynomial matrices do not depend on the estimated state variables. The second one is the general case where the polynomial matrices could depend on unmeasurable system states that will be estimated. For the last case, two design procedures are proposed. The first one gives the polynomial fuzzy controller and observer gains in two steps. In the second procedure, the designed gains are obtained using a single-step approach to overcome the drawback of a two-step procedure. The obtained conditions are presented in terms of sum of squares (SOS) which can be solved via the SOSTOOLS and a semi-definite program solver. Illustrative examples show the validity and applicability of the proposed results.

Cubic Polynomials, Their Roots and the Perron-Frobenius Theorem

ERIC Educational Resources Information Center

Dealba, Luz Maria

2002-01-01

In this note several cubic polynomials and their roots are examined, in particular, how these roots move as some of the coefficients are modified. The results obtained are applied to eigenvalues of matrices. (Contains 8 figures and 1 footnote.)

The phosphotransferase VanU represses expression of four qrr genes antagonizing VanO-mediated quorum-sensing regulation in Vibrio anguillarum

PubMed Central

Weber, Barbara; Lindell, Kristoffer; El Qaidi, Samir; Hjerde, Erik; Willassen, Nils-Peder

2011-01-01

Vibrio anguillarum utilizes quorum sensing to regulate stress responses required for survival in the aquatic environment. Like other Vibrio species, V. anguillarum contains the gene qrr1, which encodes the ancestral quorum regulatory RNA Qrr1, and phosphorelay quorum-sensing systems that modulate the expression of small regulatory RNAs (sRNAs) that destabilize mRNA encoding the transcriptional regulator VanT. In this study, three additional Qrr sRNAs were identified. All four sRNAs were positively regulated by σ54 and the σ54-dependent response regulator VanO, and showed a redundant activity. The Qrr sRNAs, together with the RNA chaperone Hfq, destabilized vanT mRNA and modulated expression of VanT-regulated genes. Unexpectedly, expression of all four qrr genes peaked at high cell density, and exogenously added N-acylhomoserine lactone molecules induced expression of the qrr genes at low cell density. The phosphotransferase VanU, which phosphorylates and activates VanO, repressed expression of the Qrr sRNAs and stabilized vanT mRNA. A model is presented proposing that VanU acts as a branch point, aiding cross-regulation between two independent phosphorelay systems that activate or repress expression of the Qrr sRNAs, giving flexibility and precision in modulating VanT expression and inducing a quorum-sensing response to stresses found in a constantly changing aquatic environment. PMID:21948044

The phosphotransferase VanU represses expression of four qrr genes antagonizing VanO-mediated quorum-sensing regulation in Vibrio anguillarum.

PubMed

Weber, Barbara; Lindell, Kristoffer; El Qaidi, Samir; Hjerde, Erik; Willassen, Nils-Peder; Milton, Debra L

2011-12-01

Vibrio anguillarum utilizes quorum sensing to regulate stress responses required for survival in the aquatic environment. Like other Vibrio species, V. anguillarum contains the gene qrr1, which encodes the ancestral quorum regulatory RNA Qrr1, and phosphorelay quorum-sensing systems that modulate the expression of small regulatory RNAs (sRNAs) that destabilize mRNA encoding the transcriptional regulator VanT. In this study, three additional Qrr sRNAs were identified. All four sRNAs were positively regulated by σ(54) and the σ(54)-dependent response regulator VanO, and showed a redundant activity. The Qrr sRNAs, together with the RNA chaperone Hfq, destabilized vanT mRNA and modulated expression of VanT-regulated genes. Unexpectedly, expression of all four qrr genes peaked at high cell density, and exogenously added N-acylhomoserine lactone molecules induced expression of the qrr genes at low cell density. The phosphotransferase VanU, which phosphorylates and activates VanO, repressed expression of the Qrr sRNAs and stabilized vanT mRNA. A model is presented proposing that VanU acts as a branch point, aiding cross-regulation between two independent phosphorelay systems that activate or repress expression of the Qrr sRNAs, giving flexibility and precision in modulating VanT expression and inducing a quorum-sensing response to stresses found in a constantly changing aquatic environment.

Quantized vortices in the ideal bose gas: a physical realization of random polynomials.

PubMed

Castin, Yvan; Hadzibabic, Zoran; Stock, Sabine; Dalibard, Jean; Stringari, Sandro

2006-02-03

We propose a physical system allowing one to experimentally observe the distribution of the complex zeros of a random polynomial. We consider a degenerate, rotating, quasi-ideal atomic Bose gas prepared in the lowest Landau level. Thermal fluctuations provide the randomness of the bosonic field and of the locations of the vortex cores. These vortices can be mapped to zeros of random polynomials, and observed in the density profile of the gas.

On the coefficients of integrated expansions and integrals of ultraspherical polynomials and their applications for solving differential equations

NASA Astrophysics Data System (ADS)

Doha, E. H.

2002-02-01

An analytical formula expressing the ultraspherical coefficients of an expansion for an infinitely differentiable function that has been integrated an arbitrary number of times in terms of the coefficients of the original expansion of the function is stated in a more compact form and proved in a simpler way than the formula suggested by Phillips and Karageorghis (27 (1990) 823). A new formula expressing explicitly the integrals of ultraspherical polynomials of any degree that has been integrated an arbitrary number of times of ultraspherical polynomials is given. The tensor product of ultraspherical polynomials is used to approximate a function of more than one variable. Formulae expressing the coefficients of differentiated expansions of double and triple ultraspherical polynomials in terms of the original expansion are stated and proved. Some applications of how to use ultraspherical polynomials for solving ordinary and partial differential equations are described.

Determination of the paraxial focal length using Zernike polynomials over different apertures

NASA Astrophysics Data System (ADS)

Binkele, Tobias; Hilbig, David; Henning, Thomas; Fleischmann, Friedrich

2017-02-01

The paraxial focal length is still the most important parameter in the design of a lens. As presented at the SPIE Optics + Photonics 2016, the measured focal length is a function of the aperture. The paraxial focal length can be found when the aperture approaches zero. In this work, we investigate the dependency of the Zernike polynomials on the aperture size with respect to 3D space. By this, conventional wavefront measurement systems that apply Zernike polynomial fitting (e.g. Shack-Hartmann-Sensor) can be used to determine the paraxial focal length, too. Since the Zernike polynomials are orthogonal over a unit circle, the aperture used in the measurement has to be normalized. By shrinking the aperture and keeping up with the normalization, the Zernike coefficients change. The relation between these changes and the paraxial focal length are investigated. The dependency of the focal length on the aperture size is derived analytically and evaluated by simulation and measurement of a strong focusing lens. The measurements are performed using experimental ray tracing and a Shack-Hartmann-Sensor. Using experimental ray tracing for the measurements, the aperture can be chosen easily. Regarding the measurements with the Shack-Hartmann- Sensor, the aperture size is fixed. Thus, the Zernike polynomials have to be adapted to use different aperture sizes by the proposed method. By doing this, the paraxial focal length can be determined from the measurements in both cases.

Phase demodulation method from a single fringe pattern based on correlation with a polynomial form.

PubMed

Robin, Eric; Valle, Valéry; Brémand, Fabrice

2005-12-01

The method presented extracts the demodulated phase from only one fringe pattern. Locally, this method approaches the fringe pattern morphology with the help of a mathematical model. The degree of similarity between the mathematical model and the real fringe is estimated by minimizing a correlation function. To use an optimization process, we have chosen a polynomial form such as a mathematical model. However, the use of a polynomial form induces an identification procedure with the purpose of retrieving the demodulated phase. This method, polynomial modulated phase correlation, is tested on several examples. Its performance, in terms of speed and precision, is presented on very noised fringe patterns.

Explicit analytical expression for the condition number of polynomials in power form

NASA Astrophysics Data System (ADS)

Rack, Heinz-Joachim

2017-07-01

In his influential papers [1-3] W. Gautschi has defined and reshaped the condition number κ∞ of polynomials Pn of degree ≤ n which are represented in power form on a zero-symmetric interval [-ω, ω]. Basically, κ∞ is expressed as the product of two operator norms: an explicit factor times an implicit one (the l∞-norm of the coefficient vector of the n-th Chebyshev polynomial of the first kind relative to [-ω, ω]). We provide a new proof, economize the second factor and express it by an explicit analytical formula.

Causality and a -theorem constraints on Ricci polynomial and Riemann cubic gravities

NASA Astrophysics Data System (ADS)

Li, Yue-Zhou; Lü, H.; Wu, Jun-Bao

2018-01-01

In this paper, we study Einstein gravity extended with Ricci polynomials and derive the constraints on the coupling constants from the considerations of being ghost-free, exhibiting an a -theorem and maintaining causality. The salient feature is that Einstein metrics with appropriate effective cosmological constants continue to be solutions with the inclusion of such Ricci polynomials and the causality constraint is automatically satisfied. The ghost-free and a -theorem conditions can only be both met starting at the quartic order. We also study these constraints on general Riemann cubic gravities.

The sensitivity of catchment hypsometry and hypsometric properties to DEM resolution and polynomial order

NASA Astrophysics Data System (ADS)

Liffner, Joel W.; Hewa, Guna A.; Peel, Murray C.

2018-05-01

Derivation of the hypsometric curve of a catchment, and properties relating to that curve, requires both use of topographical data (commonly in the form of a Digital Elevation Model - DEM), and the estimation of a functional representation of that curve. An early investigation into catchment hypsometry concluded 3rd order polynomials sufficiently describe the hypsometric curve, without the consideration of higher order polynomials, or the sensitivity of hypsometric properties relating to the curve. Another study concluded the hypsometric integral (HI) is robust against changes in DEM resolution, a conclusion drawn from a very limited sample size. Conclusions from these earlier studies have resulted in the adoption of methods deemed to be "sufficient" in subsequent studies, in addition to assumptions that the robustness of the HI extends to other hypsometric properties. This study investigates and demonstrates the sensitivity of hypsometric properties to DEM resolution, DEM type and polynomial order through assessing differences in hypsometric properties derived from 417 catchments and sub-catchments within South Australia. The sensitivity of hypsometric properties across DEM types and polynomial orders is found to be significant, which suggests careful consideration of the methods chosen to derive catchment hypsometric information is required.

Generalized neurofuzzy network modeling algorithms using Bézier-Bernstein polynomial functions and additive decomposition.

PubMed

Hong, X; Harris, C J

2000-01-01

This paper introduces a new neurofuzzy model construction algorithm for nonlinear dynamic systems based upon basis functions that are Bézier-Bernstein polynomial functions. This paper is generalized in that it copes with n-dimensional inputs by utilising an additive decomposition construction to overcome the curse of dimensionality associated with high n. This new construction algorithm also introduces univariate Bézier-Bernstein polynomial functions for the completeness of the generalized procedure. Like the B-spline expansion based neurofuzzy systems, Bézier-Bernstein polynomial function based neurofuzzy networks hold desirable properties such as nonnegativity of the basis functions, unity of support, and interpretability of basis function as fuzzy membership functions, moreover with the additional advantages of structural parsimony and Delaunay input space partition, essentially overcoming the curse of dimensionality associated with conventional fuzzy and RBF networks. This new modeling network is based on additive decomposition approach together with two separate basis function formation approaches for both univariate and bivariate Bézier-Bernstein polynomial functions used in model construction. The overall network weights are then learnt using conventional least squares methods. Numerical examples are included to demonstrate the effectiveness of this new data based modeling approach.

Synthetic Minor NSR Permit: Van Hook Crude Terminal, LLC - Van Hook Crude Terminal/Rail Loading Facility

EPA Pesticide Factsheets

This page contains the current effective synthetic minor NSR permit for the Van Hook Crude Terminal, LLC, Van Hook Crude Terminal/Rail Loading Facility, located on the Fort Berthold Indian Reservation in Mountrail County, ND.

Combining freeform optics and curved detectors for wide field imaging: a polynomial approach over squared aperture.

PubMed

Muslimov, Eduard; Hugot, Emmanuel; Jahn, Wilfried; Vives, Sebastien; Ferrari, Marc; Chambion, Bertrand; Henry, David; Gaschet, Christophe

2017-06-26

In the recent years a significant progress was achieved in the field of design and fabrication of optical systems based on freeform optical surfaces. They provide a possibility to build fast, wide-angle and high-resolution systems, which are very compact and free of obscuration. However, the field of freeform surfaces design techniques still remains underexplored. In the present paper we use the mathematical apparatus of orthogonal polynomials defined over a square aperture, which was developed before for the tasks of wavefront reconstruction, to describe shape of a mirror surface. Two cases, namely Legendre polynomials and generalization of the Zernike polynomials on a square, are considered. The potential advantages of these polynomials sets are demonstrated on example of a three-mirror unobscured telescope with F/# = 2.5 and FoV = 7.2x7.2°. In addition, we discuss possibility of use of curved detectors in such a design.

New Bernstein type inequalities for polynomials on ellipses

NASA Technical Reports Server (NTRS)

Freund, Roland; Fischer, Bernd

1990-01-01

New and sharp estimates are derived for the growth in the complex plane of polynomials known to have a curved majorant on a given ellipse. These so-called Bernstein type inequalities are closely connected with certain constrained Chebyshev approximation problems on ellipses. Also presented are some new results for approximation problems of this type.

Glycopeptide Resistance vanA Operons in Paenibacillus Strains Isolated from Soil

PubMed Central

Guardabassi, Luca; Perichon, Bruno; van Heijenoort, Jean; Blanot, Didier; Courvalin, Patrice

2005-01-01

The sequence and gene organization of the van operons in vancomycin (MIC of >256 μg/ml)- and teicoplanin (MIC of ≥32 μg/ml)-resistant Paenibacillus thiaminolyticus PT-2B1 and Paenibacillus apiarius PA-B2B isolated from soil were determined. Both operons had regulatory (vanR and vanS), resistance (vanH, vanA, and vanX), and accessory (vanY, vanZ, and vanW) genes homologous to the corresponding genes in enterococcal vanA and vanB operons. The vanAPT operon in P. thiaminolyticus PT-2B1 had the same gene organization as that of vanA operons whereas vanAPA in P. apiarius PA-B2B resembled vanB operons due to the presence of vanW upstream from the vanHAX cluster but was closer to vanA operons in sequence. Reference P. apiarius strains NRRL B-4299 and NRRL B-4188 were found to harbor operons indistinguishable from vanAPA by PCR mapping, restriction fragment length polymorphism, and partial sequencing, suggesting that this operon was species specific. As in enterococci, resistance was inducible by glycopeptides and associated with the synthesis of pentadepsipeptide peptidoglycan precursors ending in d-Ala-d-Lac, as demonstrated by d,d-dipeptidase activities, high-pressure liquid chromatography, and mass spectrometry. The precursors differed from those in enterococci by the presence of diaminopimelic acid instead of lysine in the peptide chain. Altogether, the results are compatible with the notion that van operons in soil Paenibacillus strains and in enterococci have evolved from a common ancestor. PMID:16189102

Glycopeptide resistance vanA operons in Paenibacillus strains isolated from soil.

PubMed

Guardabassi, Luca; Perichon, Bruno; van Heijenoort, Jean; Blanot, Didier; Courvalin, Patrice

2005-10-01

The sequence and gene organization of the van operons in vancomycin (MIC of >256 microg/ml)- and teicoplanin (MIC of > or =32 microg/ml)-resistant Paenibacillus thiaminolyticus PT-2B1 and Paenibacillus apiarius PA-B2B isolated from soil were determined. Both operons had regulatory (vanR and vanS), resistance (vanH, vanA, and vanX), and accessory (vanY, vanZ, and vanW) genes homologous to the corresponding genes in enterococcal vanA and vanB operons. The vanA(PT) operon in P. thiaminolyticus PT-2B1 had the same gene organization as that of vanA operons whereas vanA(PA) in P. apiarius PA-B2B resembled vanB operons due to the presence of vanW upstream from the vanHAX cluster but was closer to vanA operons in sequence. Reference P. apiarius strains NRRL B-4299 and NRRL B-4188 were found to harbor operons indistinguishable from vanA(PA) by PCR mapping, restriction fragment length polymorphism, and partial sequencing, suggesting that this operon was species specific. As in enterococci, resistance was inducible by glycopeptides and associated with the synthesis of pentadepsipeptide peptidoglycan precursors ending in D-Ala-D-Lac, as demonstrated by D,D-dipeptidase activities, high-pressure liquid chromatography, and mass spectrometry. The precursors differed from those in enterococci by the presence of diaminopimelic acid instead of lysine in the peptide chain. Altogether, the results are compatible with the notion that van operons in soil Paenibacillus strains and in enterococci have evolved from a common ancestor.

Filtrations on Springer fiber cohomology and Kostka polynomials

NASA Astrophysics Data System (ADS)

Bellamy, Gwyn; Schedler, Travis

2018-03-01

We prove a conjecture which expresses the bigraded Poisson-de Rham homology of the nilpotent cone of a semisimple Lie algebra in terms of the generalized (one-variable) Kostka polynomials, via a formula suggested by Lusztig. This allows us to construct a canonical family of filtrations on the flag variety cohomology, and hence on irreducible representations of the Weyl group, whose Hilbert series are given by the generalized Kostka polynomials. We deduce consequences for the cohomology of all Springer fibers. In particular, this computes the grading on the zeroth Poisson homology of all classical finite W-algebras, as well as the filtration on the zeroth Hochschild homology of all quantum finite W-algebras, and we generalize to all homology degrees. As a consequence, we deduce a conjecture of Proudfoot on symplectic duality, relating in type A the Poisson homology of Slodowy slices to the intersection cohomology of nilpotent orbit closures. In the last section, we give an analogue of our main theorem in the setting of mirabolic D-modules.

Fibonacci chain polynomials: Identities from self-similarity

NASA Technical Reports Server (NTRS)

Lang, Wolfdieter

1995-01-01

Fibonacci chains are special diatomic, harmonic chains with uniform nearest neighbor interaction and two kinds of atoms (mass-ratio r) arranged according to the self-similar binary Fibonacci sequence ABAABABA..., which is obtained by repeated substitution of A yields AB and B yields A. The implications of the self-similarity of this sequence for the associated orthogonal polynomial systems which govern these Fibonacci chains with fixed mass-ratio r are studied.

Improved multivariate polynomial factoring algorithm

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wang, P.S.

1978-10-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 timingmore » are included.« less

Non-polynomial extensions of solvable potentials à la Abraham-Moses

DOE Office of Scientific and Technical Information (OSTI.GOV)

Odake, Satoru; Sasaki, Ryu; Center for Theoretical Sciences, National Taiwan University, Taipei 10617, Taiwan

2013-10-15

Abraham-Moses transformations, besides Darboux transformations, are well-known procedures to generate extensions of solvable potentials in one-dimensional quantum mechanics. Here we present the explicit forms of infinitely many seed solutions for adding eigenstates at arbitrary real energy through the Abraham-Moses transformations for typical solvable potentials, e.g., the radial oscillator, the Darboux-Pöschl-Teller, and some others. These seed solutions are simple generalisations of the virtual state wavefunctions, which are obtained from the eigenfunctions by discrete symmetries of the potentials. The virtual state wavefunctions have been an essential ingredient for constructing multi-indexed Laguerre and Jacobi polynomials through multiple Darboux-Crum transformations. In contrast to themore » Darboux transformations, the virtual state wavefunctions generate non-polynomial extensions of solvable potentials through the Abraham-Moses transformations.« less

Accurate polynomial expressions for the density and specific volume of seawater using the TEOS-10 standard

NASA Astrophysics Data System (ADS)

Roquet, F.; Madec, G.; McDougall, Trevor J.; Barker, Paul M.

2015-06-01

A new set of approximations to the standard TEOS-10 equation of state are presented. These follow a polynomial form, making it computationally efficient for use in numerical ocean models. Two versions are provided, the first being a fit of density for Boussinesq ocean models, and the second fitting specific volume which is more suitable for compressible models. Both versions are given as the sum of a vertical reference profile (6th-order polynomial) and an anomaly (52-term polynomial, cubic in pressure), with relative errors of ∼0.1% on the thermal expansion coefficients. A 75-term polynomial expression is also presented for computing specific volume, with a better accuracy than the existing TEOS-10 48-term rational approximation, especially regarding the sound speed, and it is suggested that this expression represents a valuable approximation of the TEOS-10 equation of state for hydrographic data analysis. In the last section, practical aspects about the implementation of TEOS-10 in ocean models are discussed.

Jao Van De Lagemaat | NREL

Science.gov Websites

Jao Van De Lagemaat Photo of Jao Vandelagemaat. Jao Van De Lagemaat Center Director: Chemistry and Lagemaat is currently the Center Director of the Chemistry and Nanoscience Center at NREL. He received his university. Education Ph.D. Physical Chemistry, University of Utrecht Featured Publications View all NREL

Application of field dependent polynomial model

NASA Astrophysics Data System (ADS)

Janout, Petr; Páta, Petr; Skala, Petr; Fliegel, Karel; Vítek, Stanislav; Bednář, Jan

2016-09-01

Extremely wide-field imaging systems have many advantages regarding large display scenes whether for use in microscopy, all sky cameras, or in security technologies. The Large viewing angle is paid by the amount of aberrations, which are included with these imaging systems. Modeling wavefront aberrations using the Zernike polynomials is known a longer time and is widely used. Our method does not model system aberrations in a way of modeling wavefront, but directly modeling of aberration Point Spread Function of used imaging system. This is a very complicated task, and with conventional methods, it was difficult to achieve the desired accuracy. Our optimization techniques of searching coefficients space-variant Zernike polynomials can be described as a comprehensive model for ultra-wide-field imaging systems. The advantage of this model is that the model describes the whole space-variant system, unlike the majority models which are partly invariant systems. The issue that this model is the attempt to equalize the size of the modeled Point Spread Function, which is comparable to the pixel size. Issues associated with sampling, pixel size, pixel sensitivity profile must be taken into account in the design. The model was verified in a series of laboratory test patterns, test images of laboratory light sources and consequently on real images obtained by an extremely wide-field imaging system WILLIAM. Results of modeling of this system are listed in this article.

Simulation of aspheric tolerance with polynomial fitting

NASA Astrophysics Data System (ADS)

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.

Laboratory measurements of the microwave and millimeter-wave opacity of gaseous sulfur dioxide (SO2) under simulated conditions for the Venus atmosphere

NASA Technical Reports Server (NTRS)

Fahd, Antoine K.; Steffes, Paul G.

1992-01-01

Laboratory measurements have been conducted of the opacity of gaseous SO2 in a CO2 atmosphere at 12.3 cm, 1.32 cm, and 0.32 cm, with a view to the effects of this gas on the mm-wave emission of the Venus atmosphere. Close agreement is noted between the results obtained and the absorptivity predicted from a Van Vleck-Weisskopf formalism at the two shortest wavelengths, but not at the longest. These results have been incorporated into a radiative transfer model in order to infer an abundance profile for gaseous SO2 in Venus' middle atmosphere, and are also used to ascertain the effects of a SO2/CO2 gaseous mixture on the mm-wavelength spectrum of Venus.

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lu, Fei; Department of Mathematics, University of California, Berkeley; Morzfeld, Matthias, E-mail: mmo@math.lbl.gov

2015-02-01

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

Algebraic calculations for spectrum of superintegrable system from exceptional orthogonal polynomials

NASA Astrophysics Data System (ADS)

Hoque, Md. Fazlul; Marquette, Ian; Post, Sarah; Zhang, Yao-Zhong

2018-04-01

We introduce an extended Kepler-Coulomb quantum model in spherical coordinates. The Schrödinger equation of this Hamiltonian is solved in these coordinates and it is shown that the wave functions of the system can be expressed in terms of Laguerre, Legendre and exceptional Jacobi polynomials (of hypergeometric type). We construct ladder and shift operators based on the corresponding wave functions and obtain their recurrence formulas. These recurrence relations are used to construct higher-order, algebraically independent integrals of motion to prove superintegrability of the Hamiltonian. The integrals form a higher rank polynomial algebra. By constructing the structure functions of the associated deformed oscillator algebras we derive the degeneracy of energy spectrum of the superintegrable system.

Uncertainty Quantification in Simulations of Epidemics Using Polynomial Chaos

PubMed Central

Santonja, F.; Chen-Charpentier, B.

2012-01-01

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. PMID:22927889

Polynomial-time algorithms for building a consensus MUL-tree.

PubMed

Cui, Yun; Jansson, Jesper; Sung, Wing-Kin

2012-09-01

A multi-labeled phylogenetic tree, or MUL-tree, is a generalization of a phylogenetic tree that allows each leaf label to be used many times. MUL-trees have applications in biogeography, the study of host-parasite cospeciation, gene evolution studies, and computer science. Here, we consider the problem of inferring a consensus MUL-tree that summarizes a given set of conflicting MUL-trees, and present the first polynomial-time algorithms for solving it. In particular, we give a straightforward, fast algorithm for building a strict consensus MUL-tree for any input set of MUL-trees with identical leaf label multisets, as well as a polynomial-time algorithm for building a majority rule consensus MUL-tree for the special case where every leaf label occurs at most twice. We also show that, although it is NP-hard to find a majority rule consensus MUL-tree in general, the variant that we call the singular majority rule consensus MUL-tree can be constructed efficiently whenever it exists.

Polynomial modal analysis of slanted lamellar gratings.

PubMed

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

2017-06-01

The problem of diffraction by slanted lamellar dielectric and metallic gratings in classical mounting is formulated as an eigenvalue eigenvector problem. The numerical solution is obtained by using the moment method with Legendre polynomials as expansion and test functions, which allows us to enforce in an exact manner the boundary conditions which determine the eigensolutions. Our method is successfully validated by comparison with other methods including in the case of highly slanted gratings.

Integrand reduction for two-loop scattering amplitudes through multivariate polynomial division

NASA Astrophysics Data System (ADS)

Mastrolia, Pierpaolo; Mirabella, Edoardo; Ossola, Giovanni; Peraro, Tiziano

2013-04-01

We describe the application of a novel approach for the reduction of scattering amplitudes, based on multivariate polynomial division, which we have recently presented. This technique yields the complete integrand decomposition for arbitrary amplitudes, regardless of the number of loops. It allows for the determination of the residue at any multiparticle cut, whose knowledge is a mandatory prerequisite for applying the integrand-reduction procedure. By using the division modulo Gröbner basis, we can derive a simple integrand recurrence relation that generates the multiparticle pole decomposition for integrands of arbitrary multiloop amplitudes. We apply the new reduction algorithm to the two-loop planar and nonplanar diagrams contributing to the five-point scattering amplitudes in N=4 super Yang-Mills and N=8 supergravity in four dimensions, whose numerator functions contain up to rank-two terms in the integration momenta. We determine all polynomial residues parametrizing the cuts of the corresponding topologies and subtopologies. We obtain the integral basis for the decomposition of each diagram from the polynomial form of the residues. Our approach is well suited for a seminumerical implementation, and its general mathematical properties provide an effective algorithm for the generalization of the integrand-reduction method to all orders in perturbation theory.

Functionals of Gegenbauer polynomials and D-dimensional hydrogenic momentum expectation values

NASA Astrophysics Data System (ADS)

Van Assche, W.; Yáñez, R. J.; González-Férez, R.; Dehesa, Jesús S.

2000-09-01

The system of Gegenbauer or ultraspherical polynomials {Cnλ(x);n=0,1,…} is a classical family of polynomials orthogonal with respect to the weight function ωλ(x)=(1-x2)λ-1/2 on the support interval [-1,+1]. Integral functionals of Gegenbauer polynomials with integrand f(x)[Cnλ(x)]2ωλ(x), where f(x) is an arbitrary function which does not depend on n or λ, are considered in this paper. First, a general recursion formula for these functionals is obtained. Then, the explicit expression for some specific functionals of this type is found in a closed and compact form; namely, for the functionals with f(x) equal to (1-x)α(1+x)β, log(1-x2), and (1+x)log(1+x), which appear in numerous physico-mathematical problems. Finally, these functionals are used in the explicit evaluation of the momentum expectation values and of the D-dimensional hydrogenic atom with nuclear charge Z⩾1. The power expectation values are given by means of a terminating 5F4 hypergeometric function with unit argument, which is a considerable improvement with respect to Hey's expression (the only one existing up to now) which requires a double sum.

Generic expansion of the Jastrow correlation factor in polynomials satisfying symmetry and cusp conditions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lüchow, Arne, E-mail: luechow@rwth-aachen.de; Jülich Aachen Research Alliance; Sturm, Alexander

2015-02-28

Jastrow correlation factors play an important role in quantum Monte Carlo calculations. Together with an orbital based antisymmetric function, they allow the construction of highly accurate correlation wave functions. In this paper, a generic expansion of the Jastrow correlation function in terms of polynomials that satisfy both the electron exchange symmetry constraint and the cusp conditions is presented. In particular, an expansion of the three-body electron-electron-nucleus contribution in terms of cuspless homogeneous symmetric polynomials is proposed. The polynomials can be expressed in fairly arbitrary scaling function allowing a generic implementation of the Jastrow factor. It is demonstrated with a fewmore » examples that the new Jastrow factor achieves 85%–90% of the total correlation energy in a variational quantum Monte Carlo calculation and more than 90% of the diffusion Monte Carlo correlation energy.« less

Statistics of Data Fitting: Flaws and Fixes of Polynomial Analysis of Channeled Spectra

NASA Astrophysics Data System (ADS)

Karstens, William; Smith, David

2013-03-01

Starting from general statistical principles, we have critically examined Baumeister's procedure* for determining the refractive index of thin films from channeled spectra. Briefly, the method assumes that the index and interference fringe order may be approximated by polynomials quadratic and cubic in photon energy, respectively. The coefficients of the polynomials are related by differentiation, which is equivalent to comparing energy differences between fringes. However, we find that when the fringe order is calculated from the published IR index for silicon* and then analyzed with Baumeister's procedure, the results do not reproduce the original index. This problem has been traced to 1. Use of unphysical powers in the polynomials (e.g., time-reversal invariance requires that the index is an even function of photon energy), and 2. Use of insufficient terms of the correct parity. Exclusion of unphysical terms and addition of quartic and quintic terms to the index and order polynomials yields significantly better fits with fewer parameters. This represents a specific example of using statistics to determine if the assumed fitting model adequately captures the physics contained in experimental data. The use of analysis of variance (ANOVA) and the Durbin-Watson statistic to test criteria for the validity of least-squares fitting will be discussed. *D.F. Edwards and E. Ochoa, Appl. Opt. 19, 4130 (1980). Supported in part by the US Department of Energy, Office of Nuclear Physics under contract DE-AC02-06CH11357.

Low-Complexity Polynomial Channel Estimation in Large-Scale MIMO With Arbitrary Statistics

NASA Astrophysics Data System (ADS)

Shariati, Nafiseh; Bjornson, Emil; Bengtsson, Mats; Debbah, Merouane

2014-10-01

This paper considers pilot-based channel estimation in large-scale multiple-input multiple-output (MIMO) communication systems, also known as massive MIMO, where there are hundreds of antennas at one side of the link. Motivated by the fact that computational complexity is one of the main challenges in such systems, a set of low-complexity Bayesian channel estimators, coined Polynomial ExpAnsion CHannel (PEACH) estimators, are introduced for arbitrary channel and interference statistics. While the conventional minimum mean square error (MMSE) estimator has cubic complexity in the dimension of the covariance matrices, due to an inversion operation, our proposed estimators significantly reduce this to square complexity by approximating the inverse by a L-degree matrix polynomial. The coefficients of the polynomial are optimized to minimize the mean square error (MSE) of the estimate. We show numerically that near-optimal MSEs are achieved with low polynomial degrees. We also derive the exact computational complexity of the proposed estimators, in terms of the floating-point operations (FLOPs), by which we prove that the proposed estimators outperform the conventional estimators in large-scale MIMO systems of practical dimensions while providing a reasonable MSEs. Moreover, we show that L needs not scale with the system dimensions to maintain a certain normalized MSE. By analyzing different interference scenarios, we observe that the relative MSE loss of using the low-complexity PEACH estimators is smaller in realistic scenarios with pilot contamination. On the other hand, PEACH estimators are not well suited for noise-limited scenarios with high pilot power; therefore, we also introduce the low-complexity diagonalized estimator that performs well in this regime. Finally, we ...

Non-axisymmetric Aberration Patterns from Wide-field Telescopes Using Spin-weighted Zernike Polynomials

NASA Astrophysics Data System (ADS)

Kent, Stephen M.

2018-04-01

If the optical system of a telescope is perturbed from rotational symmetry, the Zernike wavefront aberration coefficients describing that system can be expressed as a function of position in the focal plane using spin-weighted Zernike polynomials. Methodologies are presented to derive these polynomials to arbitrary order. This methodology is applied to aberration patterns produced by a misaligned Ritchey–Chrétien telescope and to distortion patterns at the focal plane of the DESI optical corrector, where it is shown to provide a more efficient description of distortion than conventional expansions.

Non-axisymmetric Aberration Patterns from Wide-field Telescopes Using Spin-weighted Zernike Polynomials

DOE PAGES

Kent, Stephen M.

2018-02-15

If the optical system of a telescope is perturbed from rotational symmetry, the Zernike wavefront aberration coefficients describing that system can be expressed as a function of position in the focal plane using spin-weighted Zernike polynomials. Methodologies are presented to derive these polynomials to arbitrary order. This methodology is applied to aberration patterns produced by a misaligned Ritchey Chretian telescope and to distortion patterns at the focal plane of the DESI optical corrector, where it is shown to provide a more efficient description of distortion than conventional expansions.

The discrete Toda equation revisited: dual β-Grothendieck polynomials, ultradiscretization, and static solitons

NASA Astrophysics Data System (ADS)

Iwao, Shinsuke; Nagai, Hidetomo

2018-04-01

This paper presents a study of the discrete Toda equation that was introduced in 1977. In this paper, it is proved that the determinantal solution of the discrete Toda equation, obtained via the Lax formalism, is naturally related to the dual Grothendieck polynomials, a K-theoretic generalization of the Schur polynomials. A tropical permanent solution to the ultradiscrete Toda equation is also derived. The proposed method gives a tropical algebraic representation of the static solitons. Lastly, a new cellular automaton realization of the ultradiscrete Toda equation is proposed.

Polynomial Supertree Methods Revisited

PubMed Central

Brinkmeyer, Malte; Griebel, Thasso; Böcker, Sebastian

2011-01-01

Supertree methods allow to reconstruct large phylogenetic trees by combining smaller trees with overlapping leaf sets into one, more comprehensive supertree. The most commonly used supertree method, matrix representation with parsimony (MRP), produces accurate supertrees but is rather slow due to the underlying hard optimization problem. In this paper, we present an extensive simulation study comparing the performance of MRP and the polynomial supertree methods MinCut Supertree, Modified MinCut Supertree, Build-with-distances, PhySIC, PhySIC_IST, and super distance matrix. We consider both quality and resolution of the reconstructed supertrees. Our findings illustrate the tradeoff between accuracy and running time in supertree construction, as well as the pros and cons of voting- and veto-based supertree approaches. Based on our results, we make some general suggestions for supertree methods yet to come. PMID:22229028

Estimation of Ordinary Differential Equation Parameters Using Constrained Local Polynomial Regression.

PubMed

Ding, A Adam; Wu, Hulin

2014-10-01

We propose a new method to use a constrained local polynomial regression to estimate the unknown parameters in ordinary differential equation models with a goal of improving the smoothing-based two-stage pseudo-least squares estimate. The equation constraints are derived from the differential equation model and are incorporated into the local polynomial regression in order to estimate the unknown parameters in the differential equation model. We also derive the asymptotic bias and variance of the proposed estimator. Our simulation studies show that our new estimator is clearly better than the pseudo-least squares estimator in estimation accuracy with a small price of computational cost. An application example on immune cell kinetics and trafficking for influenza infection further illustrates the benefits of the proposed new method.

A Fast lattice-based polynomial digital signature system for m-commerce

NASA Astrophysics Data System (ADS)

Wei, Xinzhou; Leung, Lin; Anshel, Michael

2003-01-01

The privacy and data integrity are not guaranteed in current wireless communications due to the security hole inside the Wireless Application Protocol (WAP) version 1.2 gateway. One of the remedies is to provide an end-to-end security in m-commerce by applying application level security on top of current WAP1.2. The traditional security technologies like RSA and ECC applied on enterprise's server are not practical for wireless devices because wireless devices have relatively weak computation power and limited memory compared with server. In this paper, we developed a lattice based polynomial digital signature system based on NTRU's Polynomial Authentication and Signature Scheme (PASS), which enabled the feasibility of applying high-level security on both server and wireless device sides.

Obituary: James Alfred Van Allen, 1914-2006

NASA Astrophysics Data System (ADS)

Ludwig, George H.; McIlwain, Carl Edwin

2006-12-01

James Alfred Van Allen, world-renowned space scientist, died 9 August 2006 at the age of ninety-one. He succumbed to heart failure after a ten-week period of declining health. Van Allen served for his entire sixty-seven-year professional career as an amazingly productive researcher, space science spokesman, inspired teacher, and valued colleague. The realization by him and his associates that charged particles are trapped by the Earth's magnetic field began a whole new field of research, magnetospheric physics. Following that initial discovery, he and his associates quickly extended their observations, first to the inner planets, and then to the rest of the planets and beyond. During his tenure at Iowa, he and his group flew instruments on more than sixty successful Earth satellites and planetary spacecraft, including the first missions to the planets Venus, Mars, Jupiter, Saturn, Uranus, and Neptune. Van Allen's lifetime publication list numbers more than 275, of which many are widely-cited, seminal papers. He was the sole author of more than 125 of those papers. Beyond the research laboratory, Van Allen worked energetically throughout his career in establishing space research as a new branch of human inquiry. He was among the most sought-after as a committee member and adviser, working at the highest levels of government, including the White House and Congress, and at all levels of the national and international research establishments. Many presentations in the non-scientific arena helped to bring the exciting discoveries and challenges of space research to the attention of the general public. James Van Allen (Van to his many friends and colleagues) was born on 7 September 1914 on a small farm near Mount Pleasant, Iowa, the second of four sons of Alfred Morris Van Allen and Alma Olney Van Allen. After high school in Mount Pleasant, he entered Iowa Wesleyan College, majoring in physics and graduating summa cum laude. While there, he was introduced to geophysics

Uncertainty Quantification for Polynomial Systems via Bernstein Expansions

NASA Technical Reports Server (NTRS)

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

2012-01-01

This paper presents a unifying framework to uncertainty quantification for systems having polynomial response metrics that depend on both aleatory and epistemic uncertainties. The approach proposed, which is based on the Bernstein expansions of polynomials, enables bounding the range of moments and failure probabilities of response metrics as well as finding supersets of the extreme epistemic realizations where the limits of such ranges occur. These bounds and supersets, whose analytical structure renders them free of approximation error, can be made arbitrarily tight with additional computational effort. Furthermore, this framework enables determining the importance of particular uncertain parameters according to the extent to which they affect the first two moments of response metrics and failure probabilities. This analysis enables determining the parameters that should be considered uncertain as well as those that can be assumed to be constants without incurring significant error. The analytical nature of the approach eliminates the numerical error that characterizes the sampling-based techniques commonly used to propagate aleatory uncertainties as well as the possibility of under predicting the range of the statistic of interest that may result from searching for the best- and worstcase epistemic values via nonlinear optimization or sampling.

Jack Polynomials as Fractional Quantum Hall States and the Betti Numbers of the ( k + 1)-Equals Ideal

NASA Astrophysics Data System (ADS)

Zamaere, Christine Berkesch; Griffeth, Stephen; Sam, Steven V.

2014-08-01

We show that for Jack parameter α = -( k + 1)/( r - 1), certain Jack polynomials studied by Feigin-Jimbo-Miwa-Mukhin vanish to order r when k + 1 of the coordinates coincide. This result was conjectured by Bernevig and Haldane, who proposed that these Jack polynomials are model wavefunctions for fractional quantum Hall states. Special cases of these Jack polynomials include the wavefunctions of Laughlin and Read-Rezayi. In fact, along these lines we prove several vanishing theorems known as clustering properties for Jack polynomials in the mathematical physics literature, special cases of which had previously been conjectured by Bernevig and Haldane. Motivated by the method of proof, which in the case r = 2 identifies the span of the relevant Jack polynomials with the S n -invariant part of a unitary representation of the rational Cherednik algebra, we conjecture that unitary representations of the type A Cherednik algebra have graded minimal free resolutions of Bernstein-Gelfand-Gelfand type; we prove this for the ideal of the ( k + 1)-equals arrangement in the case when the number of coordinates n is at most 2 k + 1. In general, our conjecture predicts the graded S n -equivariant Betti numbers of the ideal of the ( k + 1)-equals arrangement with no restriction on the number of ambient dimensions.

A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems

DOE PAGES

Li, Ruipeng; Xi, Yuanzhe; Vecharynski, Eugene; ...

2016-08-16

Polynomial filtering can provide a highly effective means of computing all eigenvalues of a real symmetric (or complex Hermitian) matrix that are located in a given interval, anywhere in the spectrum. This paper describes a technique for tackling this problem by combining a thick-restart version of the Lanczos algorithm with deflation ("locking'') and a new type of polynomial filter obtained from a least-squares technique. Furthermore, the resulting algorithm can be utilized in a “spectrum-slicing” approach whereby a very large number of eigenvalues and associated eigenvectors of the matrix are computed by extracting eigenpairs located in different subintervals independently from onemore » another.« less

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

NASA Astrophysics Data System (ADS)

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.

A Ramanujan-type measure for the Askey-Wilson polynomials

NASA Technical Reports Server (NTRS)

Atakishiyev, Natig M.

1995-01-01

A Ramanujan-type representation for the Askey-Wilson q-beta integral, admitting the transformation q to q(exp -1), is obtained. Orthogonality of the Askey-Wilson polynomials with respect to a measure, entering into this representation, is proved. A simple way of evaluating the Askey-Wilson q-beta integral is also given.

Local polynomial chaos expansion for linear differential equations with high dimensional random inputs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chen, Yi; Jakeman, John; Gittelson, Claude

2015-01-08

In this paper we present a localized polynomial chaos expansion for partial differential equations (PDE) with random inputs. In particular, we focus on time independent linear stochastic problems with high dimensional random inputs, where the traditional polynomial chaos methods, and most of the existing methods, incur prohibitively high simulation cost. Furthermore, the local polynomial chaos method employs a domain decomposition technique to approximate the stochastic solution locally. In each subdomain, a subdomain problem is solved independently and, more importantly, in a much lower dimensional random space. In a postprocesing stage, accurate samples of the original stochastic problems are obtained frommore » the samples of the local solutions by enforcing the correct stochastic structure of the random inputs and the coupling conditions at the interfaces of the subdomains. Overall, the method is able to solve stochastic PDEs in very large dimensions by solving a collection of low dimensional local problems and can be highly efficient. In our paper we present the general mathematical framework of the methodology and use numerical examples to demonstrate the properties of the method.« less

Guaranteed cost control of polynomial fuzzy systems via a sum of squares approach.

PubMed

Tanaka, Kazuo; Ohtake, Hiroshi; Wang, Hua O

2009-04-01

This paper presents the guaranteed cost control of polynomial fuzzy systems via a sum of squares (SOS) approach. First, we present a polynomial fuzzy model and controller that are more general representations of the well-known Takagi-Sugeno (T-S) fuzzy model and controller, respectively. Second, we derive a guaranteed cost control design condition based on polynomial Lyapunov functions. Hence, the design approach discussed in this paper is more general than the existing LMI approaches (to T-S fuzzy control system designs) based on quadratic Lyapunov functions. The design condition realizes a guaranteed cost control by minimizing the upper bound of a given performance function. In addition, the design condition in the proposed approach can be represented in terms of SOS and is numerically (partially symbolically) solved via the recent developed SOSTOOLS. To illustrate the validity of the design approach, two design examples are provided. The first example deals with a complicated nonlinear system. The second example presents micro helicopter control. Both the examples show that our approach provides more extensive design results for the existing LMI approach.

Consequences of the Introduction of Insensitive Munitions on Safety, Collateral Damage and Operations (consequenties van de invoering van mkm-munitie op veiligheid, gevolgschade en (internationaal) opereren

DTIC Science & Technology

2006-06-01

van de werkzaamheden In dit rapport worden de gevolgen van initiatie van munitie door een ongewilde externe stimulus beschouwd aan de hand van reele...operationele scenario’s. Dit wordt vergeleken met de gevolgen in dezelfde scenario’s, waarin gebruik is gemaakt van Minder Kwetsbare Munitie (MKM). Naast...de historie van MKM wordt uitgelegd wat Inleiding of terroristische activiteiten, maar ook door MKM is. Vervolgens worden de gevolgen Munitie en de

Ridge Polynomial Neural Network with Error Feedback for Time Series Forecasting

PubMed Central

Ghazali, Rozaida; Herawan, Tutut

2016-01-01

Time series forecasting has gained much attention due to its many practical applications. Higher-order neural network with recurrent feedback is a powerful technique that has been used successfully for time series forecasting. It maintains fast learning and the ability to learn the dynamics of the time series over time. Network output feedback is the most common recurrent feedback for many recurrent neural network models. However, not much attention has been paid to the use of network error feedback instead of network output feedback. In this study, we propose a novel model, called Ridge Polynomial Neural Network with Error Feedback (RPNN-EF) that incorporates higher order terms, recurrence and error feedback. To evaluate the performance of RPNN-EF, we used four univariate time series with different forecasting horizons, namely star brightness, monthly smoothed sunspot numbers, daily Euro/Dollar exchange rate, and Mackey-Glass time-delay differential equation. We compared the forecasting performance of RPNN-EF with the ordinary Ridge Polynomial Neural Network (RPNN) and the Dynamic Ridge Polynomial Neural Network (DRPNN). Simulation results showed an average 23.34% improvement in Root Mean Square Error (RMSE) with respect to RPNN and an average 10.74% improvement with respect to DRPNN. That means that using network errors during training helps enhance the overall forecasting performance for the network. PMID:27959927

Ridge Polynomial Neural Network with Error Feedback for Time Series Forecasting.

PubMed

Waheeb, Waddah; Ghazali, Rozaida; Herawan, Tutut

2016-01-01

Time series forecasting has gained much attention due to its many practical applications. Higher-order neural network with recurrent feedback is a powerful technique that has been used successfully for time series forecasting. It maintains fast learning and the ability to learn the dynamics of the time series over time. Network output feedback is the most common recurrent feedback for many recurrent neural network models. However, not much attention has been paid to the use of network error feedback instead of network output feedback. In this study, we propose a novel model, called Ridge Polynomial Neural Network with Error Feedback (RPNN-EF) that incorporates higher order terms, recurrence and error feedback. To evaluate the performance of RPNN-EF, we used four univariate time series with different forecasting horizons, namely star brightness, monthly smoothed sunspot numbers, daily Euro/Dollar exchange rate, and Mackey-Glass time-delay differential equation. We compared the forecasting performance of RPNN-EF with the ordinary Ridge Polynomial Neural Network (RPNN) and the Dynamic Ridge Polynomial Neural Network (DRPNN). Simulation results showed an average 23.34% improvement in Root Mean Square Error (RMSE) with respect to RPNN and an average 10.74% improvement with respect to DRPNN. That means that using network errors during training helps enhance the overall forecasting performance for the network.

FIT: Computer Program that Interactively Determines Polynomial Equations for Data which are a Function of Two Independent Variables

NASA Technical Reports Server (NTRS)

Arbuckle, P. D.; Sliwa, S. M.; Roy, M. L.; Tiffany, S. H.

1985-01-01

A computer program for interactively developing least-squares polynomial equations to fit user-supplied data is described. The program is characterized by the ability to compute the polynomial equations of a surface fit through data that are a function of two independent variables. The program utilizes the Langley Research Center graphics packages to display polynomial equation curves and data points, facilitating a qualitative evaluation of the effectiveness of the fit. An explanation of the fundamental principles and features of the program, as well as sample input and corresponding output, are included.

Polynomials with Restricted Coefficients and Their Applications

DTIC Science & Technology

1987-01-01

sums of exponentials of quadratics, he reduced such ýzums to exponentials of linears (geometric sums!) by simplg multiplying by their conjugates...n, the same algebraic manipulations as before lead to rn V`-~ v ie ? --8-- el4V’ .fk ts with 𔄃 = a+(2r+l)t, A = a+(2r+2m+l)t. To estimate the right...coefficients. These random polynomials represent the deviation in frequency response of a linear , equispaced antenna array cauised by coefficient

Inelastic scattering with Chebyshev polynomials and preconditioned conjugate gradient minimization.

PubMed

Temel, Burcin; Mills, Greg; Metiu, Horia

2008-03-27

We describe and test an implementation, using a basis set of Chebyshev polynomials, of a variational method for solving scattering problems in quantum mechanics. This minimum error method (MEM) determines the wave function Psi by minimizing the least-squares error in the function (H Psi - E Psi), where E is the desired scattering energy. We compare the MEM to an alternative, the Kohn variational principle (KVP), by solving the Secrest-Johnson model of two-dimensional inelastic scattering, which has been studied previously using the KVP and for which other numerical solutions are available. We use a conjugate gradient (CG) method to minimize the error, and by preconditioning the CG search, we are able to greatly reduce the number of iterations necessary; the method is thus faster and more stable than a matrix inversion, as is required in the KVP. Also, we avoid errors due to scattering off of the boundaries, which presents substantial problems for other methods, by matching the wave function in the interaction region to the correct asymptotic states at the specified energy; the use of Chebyshev polynomials allows this boundary condition to be implemented accurately. The use of Chebyshev polynomials allows for a rapid and accurate evaluation of the kinetic energy. This basis set is as efficient as plane waves but does not impose an artificial periodicity on the system. There are problems in surface science and molecular electronics which cannot be solved if periodicity is imposed, and the Chebyshev basis set is a good alternative in such situations.

Design of reinforced areas of concrete column using quadratic polynomials

NASA Astrophysics Data System (ADS)

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.

From Jack to Double Jack Polynomials via the Supersymmetric Bridge

NASA Astrophysics Data System (ADS)

Lapointe, Luc; Mathieu, Pierre

2015-07-01

The Calogero-Sutherland model occurs in a large number of physical contexts, either directly or via its eigenfunctions, the Jack polynomials. The supersymmetric counterpart of this model, although much less ubiquitous, has an equally rich structure. In particular, its eigenfunctions, the Jack superpolynomials, appear to share the very same remarkable combinatorial and structural properties as their non-supersymmetric version. These super-functions are parametrized by superpartitions with fixed bosonic and fermionic degrees. Now, a truly amazing feature pops out when the fermionic degree is sufficiently large: the Jack superpolynomials stabilize and factorize. Their stability is with respect to their expansion in terms of an elementary basis where, in the stable sector, the expansion coefficients become independent of the fermionic degree. Their factorization is seen when the fermionic variables are stripped off in a suitable way which results in a product of two ordinary Jack polynomials (somewhat modified by plethystic transformations), dubbed the double Jack polynomials. Here, in addition to spelling out these results, which were first obtained in the context of Macdonal superpolynomials, we provide a heuristic derivation of the Jack superpolynomial case by performing simple manipulations on the supersymmetric eigen-operators, rendering them independent of the number of particles and of the fermionic degree. In addition, we work out the expression of the Hamiltonian which characterizes the double Jacks. This Hamiltonian, which defines a new integrable system, involves not only the expected Calogero-Sutherland pieces but also combinations of the generators of an underlying affine {widehat{sl}_2} algebra.

Tsallis p, q-deformed Touchard polynomials and Stirling numbers

NASA Astrophysics Data System (ADS)

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.

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

NASA Astrophysics Data System (ADS)

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.

Chlorhexidine Induces VanA-Type Vancomycin Resistance Genes in Enterococci

PubMed Central

Bhardwaj, Pooja; Ziegler, Elizabeth

2016-01-01

Chlorhexidine is a bisbiguanide antiseptic used for infection control. Vancomycin-resistant E. faecium (VREfm) is among the leading causes of hospital-acquired infections. VREfm may be exposed to chlorhexidine at supra- and subinhibitory concentrations as a result of chlorhexidine bathing and chlorhexidine-impregnated central venous catheter use. We used RNA sequencing to investigate how VREfm responds to chlorhexidine gluconate exposure. Among the 35 genes upregulated ≥10-fold after 15 min of exposure to the MIC of chlorhexidine gluconate were those encoding VanA-type vancomycin resistance (vanHAX) and those associated with reduced daptomycin susceptibility (liaXYZ). We confirmed that vanA upregulation was not strain or species specific by querying other VanA-type VRE. VanB-type genes were not induced. The vanH promoter was found to be responsive to subinhibitory chlorhexidine gluconate in VREfm, as was production of the VanX protein. Using vanH reporter experiments with Bacillus subtilis and deletion analysis in VREfm, we found that this phenomenon is VanR dependent. Deletion of vanR did not result in increased chlorhexidine susceptibility, demonstrating that vanHAX induction is not protective against chlorhexidine. As expected, VanA-type VRE is more susceptible to ceftriaxone in the presence of sub-MIC chlorhexidine. Unexpectedly, VREfm is also more susceptible to vancomycin in the presence of subinhibitory chlorhexidine, suggesting that chlorhexidine-induced gene expression changes lead to additional alterations in cell wall synthesis. We conclude that chlorhexidine induces expression of VanA-type vancomycin resistance genes and genes associated with daptomycin nonsusceptibility. Overall, our results indicate that the impacts of subinhibitory chlorhexidine exposure on hospital-associated pathogens should be further investigated in laboratory studies. PMID:26810654

Polynomial-Time Algorithms for Building a Consensus MUL-Tree

PubMed Central

Cui, Yun; Jansson, Jesper

2012-01-01

Abstract A multi-labeled phylogenetic tree, or MUL-tree, is a generalization of a phylogenetic tree that allows each leaf label to be used many times. MUL-trees have applications in biogeography, the study of host–parasite cospeciation, gene evolution studies, and computer science. Here, we consider the problem of inferring a consensus MUL-tree that summarizes a given set of conflicting MUL-trees, and present the first polynomial-time algorithms for solving it. In particular, we give a straightforward, fast algorithm for building a strict consensus MUL-tree for any input set of MUL-trees with identical leaf label multisets, as well as a polynomial-time algorithm for building a majority rule consensus MUL-tree for the special case where every leaf label occurs at most twice. We also show that, although it is NP-hard to find a majority rule consensus MUL-tree in general, the variant that we call the singular majority rule consensus MUL-tree can be constructed efficiently whenever it exists. PMID:22963134

Evolution method and ``differential hierarchy'' of colored knot polynomials

NASA Astrophysics Data System (ADS)

Mironov, A.; Morozov, A.; Morozov, And.

2013-10-01

We consider braids with repeating patterns inside arbitrary knots which provides a multi-parametric family of knots, depending on the "evolution" parameter, which controls the number of repetitions. The dependence of knot (super)polynomials on such evolution parameters is very easy to find. We apply this evolution method to study of the families of knots and links which include the cases with just two parallel and anti-parallel strands in the braid, like the ordinary twist and 2-strand torus knots/links and counter-oriented 2-strand links. When the answers were available before, they are immediately reproduced, and an essentially new example is added of the "double braid", which is a combination of parallel and anti-parallel 2-strand braids. This study helps us to reveal with the full clarity and partly investigate a mysterious hierarchical structure of the colored HOMFLY polynomials, at least, in (anti)symmetric representations, which extends the original observation for the figure-eight knot to many (presumably all) knots. We demonstrate that this structure is typically respected by the t-deformation to the superpolynomials.

Direct discriminant locality preserving projection with Hammerstein polynomial expansion.

PubMed

Chen, Xi; Zhang, Jiashu; Li, Defang

2012-12-01

Discriminant locality preserving projection (DLPP) is a linear approach that encodes discriminant information into the objective of locality preserving projection and improves its classification ability. To enhance the nonlinear description ability of DLPP, we can optimize the objective function of DLPP in reproducing kernel Hilbert space to form a kernel-based discriminant locality preserving projection (KDLPP). However, KDLPP suffers the following problems: 1) larger computational burden; 2) no explicit mapping functions in KDLPP, which results in more computational burden when projecting a new sample into the low-dimensional subspace; and 3) KDLPP cannot obtain optimal discriminant vectors, which exceedingly optimize the objective of DLPP. To overcome the weaknesses of KDLPP, in this paper, a direct discriminant locality preserving projection with Hammerstein polynomial expansion (HPDDLPP) is proposed. The proposed HPDDLPP directly implements the objective of DLPP in high-dimensional second-order Hammerstein polynomial space without matrix inverse, which extracts the optimal discriminant vectors for DLPP without larger computational burden. Compared with some other related classical methods, experimental results for face and palmprint recognition problems indicate the effectiveness of the proposed HPDDLPP.

LMI-based stability analysis of fuzzy-model-based control systems using approximated polynomial membership functions.

PubMed

Narimani, Mohammand; Lam, H K; Dilmaghani, R; Wolfe, Charles

2011-06-01

Relaxed linear-matrix-inequality-based stability conditions for fuzzy-model-based control systems with imperfect premise matching are proposed. First, the derivative of the Lyapunov function, containing the product terms of the fuzzy model and fuzzy controller membership functions, is derived. Then, in the partitioned operating domain of the membership functions, the relations between the state variables and the mentioned product terms are represented by approximated polynomials in each subregion. Next, the stability conditions containing the information of all subsystems and the approximated polynomials are derived. In addition, the concept of the S-procedure is utilized to release the conservativeness caused by considering the whole operating region for approximated polynomials. It is shown that the well-known stability conditions can be special cases of the proposed stability conditions. Simulation examples are given to illustrate the validity of the proposed approach.

Polynomial approximations of thermodynamic properties of arbitrary gas mixtures over wide pressure and density ranges

NASA Technical Reports Server (NTRS)

Allison, D. O.

1972-01-01

Computer programs for flow fields around planetary entry vehicles require real-gas equilibrium thermodynamic properties in a simple form which can be evaluated quickly. To fill this need, polynomial approximations were found for thermodynamic properties of air and model planetary atmospheres. A coefficient-averaging technique was used for curve fitting in lieu of the usual least-squares method. The polynomials consist of terms up to the ninth degree in each of two variables (essentially pressure and density) including all cross terms. Four of these polynomials can be joined to cover, for example, a range of about 1000 to 11000 K and 0.00001 to 1 atmosphere (1 atm = 1.0133 x 100,000 N/m sq) for a given thermodynamic property. Relative errors of less than 1 percent are found over most of the applicable range.

Estimation of Ordinary Differential Equation Parameters Using Constrained Local Polynomial Regression

PubMed Central

Ding, A. Adam; Wu, Hulin

2015-01-01

We propose a new method to use a constrained local polynomial regression to estimate the unknown parameters in ordinary differential equation models with a goal of improving the smoothing-based two-stage pseudo-least squares estimate. The equation constraints are derived from the differential equation model and are incorporated into the local polynomial regression in order to estimate the unknown parameters in the differential equation model. We also derive the asymptotic bias and variance of the proposed estimator. Our simulation studies show that our new estimator is clearly better than the pseudo-least squares estimator in estimation accuracy with a small price of computational cost. An application example on immune cell kinetics and trafficking for influenza infection further illustrates the benefits of the proposed new method. PMID:26401093

M-Polynomials and topological indices of V-Phenylenic Nanotubes and Nanotori.

PubMed

Kwun, Young Chel; Munir, Mobeen; Nazeer, Waqas; Rafique, Shazia; Min Kang, Shin

2017-08-18

V-Phenylenic nanotubes and nanotori are most comprehensively studied nanostructures due to widespread applications in the production of catalytic, gas-sensing and corrosion-resistant materials. Representing chemical compounds with M-polynomial is a recent idea and it produces nice formulas of degree-based topological indices which correlate chemical properties of the material under investigation. These indices are used in the development of quantitative structure-activity relationships (QSARs) in which the biological activity and other properties of molecules like boiling point, stability, strain energy etc. are correlated with their structures. In this paper, we determine general closed formulae for M-polynomials of V-Phylenic nanotubes and nanotori. We recover important topological degree-based indices. We also give different graphs of topological indices and their relations with the parameters of structures.

Emergence of vanA Enterococcus faecium in Denmark, 2005-15.

PubMed

Hammerum, Anette M; Baig, Sharmin; Kamel, Yasmin; Roer, Louise; Pinholt, Mette; Gumpert, Heidi; Holzknecht, Barbara; Røder, Bent; Justesen, Ulrik S; Samulioniené, Jurgita; Kjærsgaard, Mona; Østergaard, Claus; Holm, Anette; Dzajic, Esad; Søndergaard, Turid Snekloth; Gaini, Shahin; Edquist, Petra; Alm, Erik; Lilje, Berit; Westh, Henrik; Stegger, Marc; Hasman, Henrik

2017-08-01

To describe the changing epidemiology of vancomycin-resistant Enterococcus faecium and Enterococcus faecalis in clinical samples in Denmark 2005-15 according to species and van type, and, furthermore, to investigate the genetic relatedness of the clinical E. faecium isolates from 2015. During 2005-14, all clinical VRE isolates were tested for the presence of vanA/B/C genes by PCR. In 2015, all clinical VRE isolates were whole-genome sequenced. From the WGS data, the presence of van genes and MLST STs were extracted in silico . Core-genome MLST (cgMLST) analysis was performed for the vancomycin-resistant E. faecium isolates. During 2005-15, 1043 vanA E. faecium , 25 vanB E. faecium , 4 vanA E. faecalis and 28 vanB E. faecalis were detected. The number of VRE was <50 isolates/year until 2012 to > 200 isolates/year in 2013-15. In 2015, 368 vanA E. faecium and 1 vanB E. faecium were detected along with 1 vanA E. faecalis and 1 vanB E. faecalis . cgMLST subdivided the 368 vanA E. faecium isolates into 33 cluster types (CTs), whereas the vanB E. faecium isolate belonged to a different CT. ST203-CT859 was most prevalent (51%), followed by ST80-CT14 (22%), ST117-CT24 (6%), ST80-CT866 (4%) and ST80-CT860 (2%). Comparison with the cgMLST.org database, previous studies and personal communications with neighbouring countries revealed that the novel cluster ST203-CT859 emerged in December 2014 and spread to the south of Sweden and the Faroe Islands during 2015. VRE increased in Denmark during 2005-15 due to the emergence of several vanA E. faecium clones. © The Author 2017. Published by Oxford University Press on behalf of the British Society for Antimicrobial Chemotherapy. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

Homogenous polynomially parameter-dependent H∞ filter designs of discrete-time fuzzy systems.

PubMed

Zhang, Huaguang; Xie, Xiangpeng; Tong, Shaocheng

2011-10-01

This paper proposes a novel H(∞) filtering technique for a class of discrete-time fuzzy systems. First, a novel kind of fuzzy H(∞) filter, which is homogenous polynomially parameter dependent on membership functions with an arbitrary degree, is developed to guarantee the asymptotic stability and a prescribed H(∞) performance of the filtering error system. Second, relaxed conditions for H(∞) performance analysis are proposed by using a new fuzzy Lyapunov function and the Finsler lemma with homogenous polynomial matrix Lagrange multipliers. Then, based on a new kind of slack variable technique, relaxed linear matrix inequality-based H(∞) filtering conditions are proposed. Finally, two numerical examples are provided to illustrate the effectiveness of the proposed approach.

New separated polynomial solutions to the Zernike system on the unit disk and interbasis expansion.

PubMed

Pogosyan, George S; Wolf, Kurt Bernardo; Yakhno, Alexander

2017-10-01

The differential equation proposed by Frits Zernike to obtain a basis of polynomial orthogonal solutions on the unit disk to classify wavefront aberrations in circular pupils is shown to have a set of new orthonormal solution bases involving Legendre and Gegenbauer polynomials in nonorthogonal coordinates, close to Cartesian ones. We find the overlaps between the original Zernike basis and a representative of the new set, which turn out to be Clebsch-Gordan coefficients.

A Conversation with William Van Til.

ERIC Educational Resources Information Center

Beineke, John A.

1989-01-01

Reports an interview with William Van Til, Coffman Distinguished Professor Emeritus of Education at Indiana State University (Terre Haute). Van Til reviews his career as a social studies teacher and his writings on curriculum and social foundations. Presents his opinions on progressive education, famous educators, educational history and reform,…

A Compact Formula for Rotations as Spin Matrix Polynomials

DOE PAGES

Curtright, Thomas L.; Fairlie, David B.; Zachos, Cosmas K.

2014-08-12

Group elements of SU(2) are expressed in closed form as finite polynomials of the Lie algebra generators, for all definite spin representations of the rotation group. Here, the simple explicit result exhibits connections between group theory, combinatorics, and Fourier analysis, especially in the large spin limit. Salient intuitive features of the formula are illustrated and discussed.

Additional Value from Road Mapping in Defense Policy Making (meerwaarde van roadmapping bij beleidsontwikkeling van de koninklijke landmacht)

DTIC Science & Technology

2006-05-01

van zogonaamde strategische reserves tot bijvaarbeeld lakaal boschikbare gevechtscapacitoit. 9 11 Joint. Do Nederlandse krijgsmacht ontwikkelt zich tot...8 2 W erkwijze van de KL tot nu toe ............................................................................... 9 2.1 O...ntwikkeling visiedocurnent ....................................................................................... 9 2.2 Opzet beleid- en deelstudies

Supersymmetric Casimir energy and the anomaly polynomial

NASA Astrophysics Data System (ADS)

Bobev, Nikolay; Bullimore, Mathew; Kim, Hee-Cheol

2015-09-01

We conjecture that for superconformal field theories in even dimensions, the supersymmetric Casimir energy on a space with topology S 1 × S D-1 is equal to an equivariant integral of the anomaly polynomial. The equivariant integration is defined with respect to the Cartan subalgebra of the global symmetry algebra that commutes with a given supercharge. We test our proposal extensively by computing the supersymmetric Casimir energy for large classes of superconformal field theories, with and without known Lagrangian descriptions, in two, four and six dimensions.

Polynomial Fitting of DT-MRI Fiber Tracts Allows Accurate Estimation of Muscle Architectural Parameters

PubMed Central

Damon, Bruce M.; Heemskerk, Anneriet M.; Ding, Zhaohua

2012-01-01

Fiber curvature is a functionally significant muscle structural property, but its estimation from diffusion-tensor MRI fiber tracking data may be confounded by noise. The purpose of this study was to investigate the use of polynomial fitting of fiber tracts for improving the accuracy and precision of fiber curvature (κ) measurements. Simulated image datasets were created in order to provide data with known values for κ and pennation angle (θ). Simulations were designed to test the effects of increasing inherent fiber curvature (3.8, 7.9, 11.8, and 15.3 m−1), signal-to-noise ratio (50, 75, 100, and 150), and voxel geometry (13.8 and 27.0 mm3 voxel volume with isotropic resolution; 13.5 mm3 volume with an aspect ratio of 4.0) on κ and θ measurements. In the originally reconstructed tracts, θ was estimated accurately under most curvature and all imaging conditions studied; however, the estimates of κ were imprecise and inaccurate. Fitting the tracts to 2nd order polynomial functions provided accurate and precise estimates of κ for all conditions except very high curvature (κ=15.3 m−1), while preserving the accuracy of the θ estimates. Similarly, polynomial fitting of in vivo fiber tracking data reduced the κ values of fitted tracts from those of unfitted tracts and did not change the θ values. Polynomial fitting of fiber tracts allows accurate estimation of physiologically reasonable values of κ, while preserving the accuracy of θ estimation. PMID:22503094

Explicitly solvable complex Chebyshev approximation problems related to sine polynomials

NASA Technical Reports Server (NTRS)

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.

Computer Algebra Systems and Theorems on Real Roots of Polynomials

ERIC Educational Resources Information Center

Aidoo, Anthony Y.; Manthey, Joseph L.; Ward, Kim Y.

2010-01-01

A computer algebra system is used to derive a theorem on the existence of roots of a quadratic equation on any bounded real interval. This is extended to a cubic polynomial. We discuss how students could be led to derive and prove these theorems. (Contains 1 figure.)

Developing the Polynomial Expressions for Fields in the ITER Tokamak

NASA Astrophysics Data System (ADS)

Sharma, Stephen

2017-10-01

The two most important problems to be solved in the development of working nuclear fusion power plants are: sustained partial ignition and turbulence. These two phenomena are the subject of research and investigation through the development of analytic functions and computational models. Ansatz development through Gaussian wave-function approximations, dielectric quark models, field solutions using new elliptic functions, and better descriptions of the polynomials of the superconducting current loops are the critical theoretical developments that need to be improved. Euler-Lagrange equations of motion in addition to geodesic formulations generate the particle model which should correspond to the Dirac dispersive scattering coefficient calculations and the fluid plasma model. Feynman-Hellman formalism and Heaviside step functional forms are introduced to the fusion equations to produce simple expressions for the kinetic energy and loop currents. Conclusively, a polynomial description of the current loops, the Biot-Savart field, and the Lagrangian must be uncovered before there can be an adequate computational and iterative model of the thermonuclear plasma.

Novel Threshold Changeable Secret Sharing Schemes Based on Polynomial Interpolation.

PubMed

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.

Why High-Order Polynomials Should Not Be Used in Regression Discontinuity Designs. NBER Working Paper No. 20405

ERIC Educational Resources Information Center

Gelman, Andrew; Imbens, Guido

2014-01-01

It is common in regression discontinuity analysis to control for high order (third, fourth, or higher) polynomials of the forcing variable. We argue that estimators for causal effects based on such methods can be misleading, and we recommend researchers do not use them, and instead use estimators based on local linear or quadratic polynomials or…

Explicit formulae for Chern-Simons invariants of the twist-knot orbifolds and edge polynomials of twist knots

NASA Astrophysics Data System (ADS)

Ham, J.-Y.; Lee, J.

2016-09-01

We calculate the Chern-Simons invariants of twist-knot orbifolds using the Schläfli formula for the generalized Chern-Simons function on the family of twist knot cone-manifold structures. Following the general instruction of Hilden, Lozano, and Montesinos-Amilibia, we here present concrete formulae and calculations. We use the Pythagorean Theorem, which was used by Ham, Mednykh and Petrov, to relate the complex length of the longitude and the complex distance between the two axes fixed by two generators. As an application, we calculate the Chern-Simons invariants of cyclic coverings of the hyperbolic twist-knot orbifolds. We also derive some interesting results. The explicit formulae of the A-polynomials of twist knots are obtained from the complex distance polynomials. Hence the edge polynomials corresponding to the edges of the Newton polygons of the A-polynomials of twist knots can be obtained. In particular, the number of boundary components of every incompressible surface corresponding to slope -4n+2 turns out to be 2. Bibliography: 39 titles.

Flat bases of invariant polynomials and P-matrices of E{sub 7} and E{sub 8}

DOE Office of Scientific and Technical Information (OSTI.GOV)

Talamini, Vittorino

2010-02-15

Let G be a compact group of linear transformations of a Euclidean space V. The G-invariant C{sup {infinity}} functions can be expressed as C{sup {infinity}} functions of a finite basic set of G-invariant homogeneous polynomials, sometimes called an integrity basis. The mathematical description of the orbit space V/G depends on the integrity basis too: it is realized through polynomial equations and inequalities expressing rank and positive semidefiniteness conditions of the P-matrix, a real symmetric matrix determined by the integrity basis. The choice of the basic set of G-invariant homogeneous polynomials forming an integrity basis is not unique, so it ismore » not unique the mathematical description of the orbit space too. If G is an irreducible finite reflection group, Saito et al. [Commun. Algebra 8, 373 (1980)] characterized some special basic sets of G-invariant homogeneous polynomials that they called flat. They also found explicitly the flat basic sets of invariant homogeneous polynomials of all the irreducible finite reflection groups except of the two largest groups E{sub 7} and E{sub 8}. In this paper the flat basic sets of invariant homogeneous polynomials of E{sub 7} and E{sub 8} and the corresponding P-matrices are determined explicitly. Using the results here reported one is able to determine easily the P-matrices corresponding to any other integrity basis of E{sub 7} or E{sub 8}. From the P-matrices one may then write down the equations and inequalities defining the orbit spaces of E{sub 7} and E{sub 8} relatively to a flat basis or to any other integrity basis. The results here obtained may be employed concretely to study analytically the symmetry breaking in all theories where the symmetry group is one of the finite reflection groups E{sub 7} and E{sub 8} or one of the Lie groups E{sub 7} and E{sub 8} in their adjoint representations.« less

The expression and comparison of healthy and ptotic upper eyelid contours using a polynomial mathematical function.

PubMed

Mocan, Mehmet C; Ilhan, Hacer; Gurcay, Hasmet; Dikmetas, Ozlem; Karabulut, Erdem; Erdener, Ugur; Irkec, Murat

2014-06-01

To derive a mathematical expression for the healthy upper eyelid (UE) contour and to use this expression to differentiate the normal UE curve from its abnormal configuration in the setting of blepharoptosis. The study was designed as a cross-sectional study. Fifty healthy subjects (26M/24F) and 50 patients with blepharoptosis (28M/22F) with a margin-reflex distance (MRD1) of ≤2.5 mm were recruited. A polynomial interpolation was used to approximate UE curve. The polynomial coefficients were calculated from digital eyelid images of all participants using a set of operator defined points along the UE curve. Coefficients up to the fourth-order polynomial, iris area covered by the UE, iris area covered by the lower eyelid and total iris area covered by both the upper and the lower eyelids were defined using the polynomial function and used in statistical comparisons. The t-test, Mann-Whitney U test and the Spearman's correlation test were used for statistical comparisons. The mathematical expression derived from the data of 50 healthy subjects aged 24.1 ± 2.6 years was defined as y = 22.0915 + (-1.3213)x + 0.0318x(2 )+ (-0.0005x)(3). The fifth and the consecutive coefficients were <0.00001 in all cases and were not included in the polynomial function. None of the first fourth-order coefficients of the equation were found to be significantly different in male versus female subjects. In normal subjects, the percentage of the iris area covered by upper and lower lids was 6.46 ± 5.17% and 0.66% ± 1.62%, respectively. All coefficients and mean iris area covered by the UE were significantly different between healthy and ptotic eyelids. The healthy and abnormal eyelid contour can be defined and differentiated using a polynomial mathematical function.

Transient aerodynamic characteristics of vans during the accelerated overtaking process

NASA Astrophysics Data System (ADS)

Liu, Li-ning; Wang, Xing-shen; Du, Guang-sheng; Liu, Zheng-gang; Lei, Li

2018-04-01

This paper studies the influence of the accelerated overtaking process on the vehicles' transient aerodynamic characteristics, through 3-D numerical simulations with dynamic meshes and sliding interface technique. Numerical accuracy is verified by experimental results. The aerodynamic characteristics of vehicles in the uniform overtaking process and the accelerated overtaking process are compared. It is shown that the speed variation of the overtaking van would influence the aerodynamic characteristics of the two vans, with greater influence on the overtaken van than on the overtaking van. The simulations of three different accelerated overtaking processes show that the greater the acceleration of the overtaking van, the larger the aerodynamic coefficients of the overtaken van. When the acceleration of the overtaking van increases by 1 m/s2, the maximum drag force, side force and yawing moment coefficients of the overtaken van all increase by more than 6%, to seriously affect the power performance and the stability of the vehicles. The analysis of the pressure fields under different accelerated conditions reveals the cause of variations of the aerodynamic characteristics of vehicles.

How many invariant polynomials are needed to decide local unitary equivalence of qubit states?

DOE Office of Scientific and Technical Information (OSTI.GOV)

Maciążek, Tomasz; Faculty of Physics, University of Warsaw, ul. Hoża 69, 00-681 Warszawa; Oszmaniec, Michał

2013-09-15

Given L-qubit states with the fixed spectra of reduced one-qubit density matrices, we find a formula for the minimal number of invariant polynomials needed for solving local unitary (LU) equivalence problem, that is, problem of deciding if two states can be connected by local unitary operations. Interestingly, this number is not the same for every collection of the spectra. Some spectra require less polynomials to solve LU equivalence problem than others. The result is obtained using geometric methods, i.e., by calculating the dimensions of reduced spaces, stemming from the symplectic reduction procedure.

Assessing the suitability of fractional polynomial methods in health services research: a perspective on the categorization epidemic.

PubMed

Williams, Jennifer Stewart

2011-07-01

To show how fractional polynomial methods can usefully replace the practice of arbitrarily categorizing data in epidemiology and health services research. A health service setting is used to illustrate a structured and transparent way of representing non-linear data without arbitrary grouping. When age is a regressor its effects on an outcome will be interpreted differently depending upon the placing of cutpoints or the use of a polynomial transformation. Although it is common practice, categorization comes at a cost. Information is lost, and accuracy and statistical power reduced, leading to spurious statistical interpretation of the data. The fractional polynomial method is widely supported by statistical software programs, and deserves greater attention and use.

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

NASA Astrophysics Data System (ADS)

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

Sylow p-groups of polynomial permutations on the integers mod pn☆

PubMed Central

Frisch, Sophie; Krenn, Daniel

2013-01-01

We enumerate and describe the Sylow p-groups of the groups of polynomial permutations of the integers mod pn for n⩾1 and of the pro-finite group which is the projective limit of these groups. PMID:26869732

Determination of the water vapor continuum absorption by THz-TDS and Molecular Response Theory.

PubMed

Yang, Yihong; Mandehgar, Mahboubeh; Grischkowsky, D

2014-02-24

Determination of the water vapor continuum absorption from 0.35 to 1 THz is reported. The THz pulses propagate though a 137 m long humidity-controlled chamber and are measured by THz time-domain spectroscopy (THz-TDS). The average relative humidity along the entire THz path is precisely obtained by measuring the difference between transit times of the sample and reference THz pulses to an accuracy of 0.1 ps. Using the measured total absorption and the calculated resonance line absorption with the Molecular Response Theory lineshape, based on physical principles and measurements, an accurate continuum absorption is obtained within four THz absorption windows, that agrees well with the empirical theory. The absorption is significantly smaller than that obtained using the van Vleck-Weisskopf lineshape with a 750 GHz cut-off.

The calculation of rare-earth levels in layered cobaltates Rx/3CoO2 (x ≦ 1)

NASA Astrophysics Data System (ADS)

Novák, P.; Knížek, K.; Jirák, Z.; Buršík, J.

2015-05-01

We studied theoretically the crystal field and Zeeman split electronic levels of trivalent rare earths that are distributed over trigonal prismatic sites of the layered Rx/3CoO2 system (closely related to sodium cobaltate NaxCoO2). The calculations were done in the whole basis of 4fn configurations (up to 3000 many-electron determinantal functions) for the ideal trigonal symmetry D3h, as well as for the reduced symmetry C2v that takes into account a more distant neighborhood of the R-sites. Detailed data on the doublet and singlet states for Pr, Nd, Sm, Tb and Dy are presented. The obtained g-factor and the van Vleck susceptibility tensor components are used for calculations of anisotropic magnetic susceptibilities and their temperature dependencies.

Simulation of Ã(2)A(1)←X̃(2)E laser excitation spectrum of CH3O and CD3O.

PubMed

Nagesh, Jayashree; Sibert, Edwin L; Stanton, John F

2014-02-05

A theoretical calculation of the laser-induced fluorescence excitation spectrum from X̃(2)E→Ã(2)A1 is carried out for CH3O and CD3O using a transition dipole moment surface expanded up to second order. The vibronic form of these operators is obtained using symmetry arguments. The Ã(2)A1 vibrational levels are calculated using Van Vleck perturbation theory, and the latter is used to adjust harmonic constants of the potential to match experimental fundamentals. The CH3O fit force field is tested on CD3O. For both molecules the transition energies are well reproduced, but there are systematic differences between experimental and theoretical intensities. The origins of these differences are discussed. Copyright © 2013 Elsevier B.V. All rights reserved.

Polynomial Solutions of Nth Order Non-Homogeneous Differential Equations

ERIC Educational Resources Information Center

Levine, Lawrence E.; Maleh, Ray

2002-01-01

It was shown by Costa and Levine that the homogeneous differential equation (1-x[superscript N])y([superscript N]) + A[subscript N-1]x[superscript N-1)y([superscript N-1]) + A[subscript N-2]x[superscript N-2])y([superscript N-2]) + ... + A[subscript 1]xy[prime] + A[subscript 0]y = 0 has a finite polynomial solution if and only if [for…

The Dramatic Methods of Hans van Dam.

ERIC Educational Resources Information Center

van de Water, Manon

1994-01-01

Interprets for the American reader the untranslated dramatic methods of Hans van Dam, a leading drama theorist in the Netherlands. Discusses the functions of drama as a method, closed dramatic methods, open dramatic methods, and applying van Dam's methods. (SR)

Van der Waals interaction in uniaxial anisotropic media.

PubMed

Kornilovitch, Pavel E

2013-01-23

Van der Waals interactions between flat surfaces in uniaxial anisotropic media are investigated in the nonretarded limit. The main focus is the effect of nonzero tilt between the optical axis and the surface normal on the strength of the van der Waals attraction. General expressions for the van der Waals free energy are derived using the surface mode method and the transfer-matrix formalism. To facilitate numerical calculations a temperature-dependent three-band parameterization of the dielectric tensor of the liquid crystal 5CB is developed. A solid slab immersed in a liquid crystal experiences a van der Waals torque that aligns the surface normal relative to the optical axis of the medium. The preferred orientation is different for different materials. Two solid slabs in close proximity experience a van der Waals attraction that is strongest for homeotropic alignment of the intervening liquid crystal for all the materials studied. The results have implications for the stability of plate-like colloids in liquid crystal hosts.

Margaret Cavendish's materialist critique of van Helmontian chymistry.

PubMed

Clucas, Stephen

2011-03-01

A striking omission in the scholarship on the reception of the chymical philosophy of Jan Baptista van Helmont in England in the seventeenth century is the work of the mid-seventeenth-century natural philosopher Margaret Cavendish, Duchess of Newcastle. In her Philosophical Letters (1664), Cavendish offers an extended critique of Van Helmont's work (whose Ortus Medicince had recently been translated into English by John Sadler). In this paper, I compare Cavendish's criticisms with those of Robert Boyle in his Sceptical Chymist (1661). Both Boyle and Cavendish attacked Van Helmont for the obscurity of his chymical vocabulary and concepts, and attacked his seminalism. Although their critiques had much in common, they diverged in their attitudes to Van Helmont's experiments. As an opponent of the experimental philosophy, Cavendish had little interest in the quality of Van Helmont's experimental claims, whereas Boyle was critical of their unreplicability. I also try to show that the two writers had very different polemical agendas, with Boyle defending his vision of chymistry based on a corpuscularian natural philosophy, and Cavendish being as much concerned with establishing her religious orthodoxy as with defending the truth claims of her own materialist vitalism. For Cavendish, Van Helmont was an example of the dangers of mingling theology and natural philosophy.

Van Go: A Labor of Love

ERIC Educational Resources Information Center

Williams, Jennifer

2012-01-01

Like a tapestry woven with one outstanding thread from beginning to end, the author's forty-year tenure as an art educator has its golden thread in her Van Go art outreach project. Quite literally, she takes students in a "van" and they "go," mostly on dirt roads, taking art to rural schools in Idaho, some of which have no more…

Prediction of zeolite-cement-sand unconfined compressive strength using polynomial neural network

NASA Astrophysics Data System (ADS)

MolaAbasi, H.; Shooshpasha, I.

2016-04-01

The improvement of local soils with cement and zeolite can provide great benefits, including strengthening slopes in slope stability problems, stabilizing problematic soils and preventing soil liquefaction. Recently, dosage methodologies are being developed for improved soils based on a rational criterion as it exists in concrete technology. There are numerous earlier studies showing the possibility of relating Unconfined Compressive Strength (UCS) and Cemented sand (CS) parameters (voids/cement ratio) as a power function fits. Taking into account the fact that the existing equations are incapable of estimating UCS for zeolite cemented sand mixture (ZCS) well, artificial intelligence methods are used for forecasting them. Polynomial-type neural network is applied to estimate the UCS from more simply determined index properties such as zeolite and cement content, porosity as well as curing time. In order to assess the merits of the proposed approach, a total number of 216 unconfined compressive tests have been done. A comparison is carried out between the experimentally measured UCS with the predictions in order to evaluate the performance of the current method. The results demonstrate that generalized polynomial-type neural network has a great ability for prediction of the UCS. At the end sensitivity analysis of the polynomial model is applied to study the influence of input parameters on model output. The sensitivity analysis reveals that cement and zeolite content have significant influence on predicting UCS.

Algebraic invariant curves of plane polynomial differential systems

NASA Astrophysics Data System (ADS)

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.

Genetics Home Reference: van der Woude syndrome

MedlinePlus

... What is the prognosis of a genetic condition? Genetic and Rare Diseases Information Center Frequency Van der Woude syndrome is believed to occur in 1 in 35,000 to 1 in 100,000 people, based on data from Europe and Asia. Van der Woude syndrome ...

On computing closed forms for summations. [polynomials and rational functions

NASA Technical Reports Server (NTRS)

Moenck, R.

1977-01-01

The problem of finding closed forms for a summation involving polynomials and rational functions is considered. A method closely related to Hermite's method for integration of rational functions derived. The method expresses the sum of a rational function as a rational function part and a transcendental part involving derivatives of the gamma function.

Application of overlay modeling and control with Zernike polynomials in an HVM environment

NASA Astrophysics Data System (ADS)

Ju, JaeWuk; Kim, MinGyu; Lee, JuHan; Nabeth, Jeremy; Jeon, Sanghuck; Heo, Hoyoung; Robinson, John C.; Pierson, Bill

2016-03-01

Shrinking technology nodes and smaller process margins require improved photolithography overlay control. Generally, overlay measurement results are modeled with Cartesian polynomial functions for both intra-field and inter-field models and the model coefficients are sent to an advanced process control (APC) system operating in an XY Cartesian basis. Dampened overlay corrections, typically via exponentially or linearly weighted moving average in time, are then retrieved from the APC system to apply on the scanner in XY Cartesian form for subsequent lot exposure. The goal of the above method is to process lots with corrections that target the least possible overlay misregistration in steady state as well as in change point situations. In this study, we model overlay errors on product using Zernike polynomials with same fitting capability as the process of reference (POR) to represent the wafer-level terms, and use the standard Cartesian polynomials to represent the field-level terms. APC calculations for wafer-level correction are performed in Zernike basis while field-level calculations use standard XY Cartesian basis. Finally, weighted wafer-level correction terms are converted to XY Cartesian space in order to be applied on the scanner, along with field-level corrections, for future wafer exposures. Since Zernike polynomials have the property of being orthogonal in the unit disk we are able to reduce the amount of collinearity between terms and improve overlay stability. Our real time Zernike modeling and feedback evaluation was performed on a 20-lot dataset in a high volume manufacturing (HVM) environment. The measured on-product results were compared to POR and showed a 7% reduction in overlay variation including a 22% terms variation. This led to an on-product raw overlay Mean + 3Sigma X&Y improvement of 5% and resulted in 0.1% yield improvement.

UPS Hybrid Electric Delivery Van Testing | Transportation Research | NREL

Science.gov Websites

conventional diesel vans. Publications The following documents provide detailed information about the study the conventional vans during the on-road portion of the study. The two vehicle groups switched route assignments during the study period to provide a balanced review of the vans on the same routes. During

Hermite Polynomials and the Inverse Problem for Collisionless Equilibria

NASA Astrophysics Data System (ADS)

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

Genetics Home Reference: Ellis-van Creveld syndrome

MedlinePlus

... CREVELD SYNDROME Sources for This Page Baujat G, Le Merrer M. Ellis-van Creveld syndrome. Orphanet J Rare Dis. 2007 Jun ... CB, Kochilas L, Schimmenti LA, Moller JH. Ellis-van Creveld syndrome and congenital heart defects: presentation of an additional 32 cases. Pediatr Cardiol. 2011 Oct;32( ...

Evaluate More General Integrals Involving Universal Associated Legendre Polynomials via Taylor’s Theorem

NASA Astrophysics Data System (ADS)

Yañez-Navarro, G.; Sun, Guo-Hua; Sun, Dong-Sheng; Chen, Chang-Yuan; Dong, Shi-Hai

2017-08-01

A few important integrals involving the product of two universal associated Legendre polynomials {P}{l\\prime}{m\\prime}(x), {P}{k\\prime}{n\\prime}(x) and x2a(1 - x2)-p-1, xb(1 ± x)-p-1 and xc(1 -x2)-p-1 (1 ± x) are evaluated using the operator form of Taylor’s theorem and an integral over a single universal associated Legendre polynomial. These integrals are more general since the quantum numbers are unequal, i.e. l‧ ≠ k‧ and m‧ ≠ n‧. Their selection rules are also given. We also verify the correctness of those integral formulas numerically. Supported by 20170938-SIP-IPN, Mexico

CKP Hierarchy, Bosonic Tau Function and Bosonization Formulae

NASA Astrophysics Data System (ADS)

van de Leur, Johan W.; Orlov, Alexander Yu.; Shiota, Takahiro

2012-06-01

We develop the theory of CKP hierarchy introduced in the papers of Kyoto school [Date E., Jimbo M., Kashiwara M., Miwa T., J. Phys. Soc. Japan 50 (1981), 3806-3812] (see also [Kac V.G., van de Leur J.W., Adv. Ser. Math. Phys., Vol. 7, World Sci. Publ., Teaneck, NJ, 1989, 369-406]). We present appropriate bosonization formulae. We show that in the context of the CKP theory certain orthogonal polynomials appear. These polynomials are polynomial both in even and odd (in Grassmannian sense) variables.

Polynomial Chaos Based Acoustic Uncertainty Predictions from Ocean Forecast Ensembles

NASA Astrophysics Data System (ADS)

Dennis, S.

2016-02-01

Most significant ocean acoustic propagation occurs at tens of kilometers, at scales small compared basin and to most fine scale ocean modeling. To address the increased emphasis on uncertainty quantification, for example transmission loss (TL) probability density functions (PDF) within some radius, a polynomial chaos (PC) based method is utilized. In order to capture uncertainty in ocean modeling, Navy Coastal Ocean Model (NCOM) now includes ensembles distributed to reflect the ocean analysis statistics. Since the ensembles are included in the data assimilation for the new forecast ensembles, the acoustic modeling uses the ensemble predictions in a similar fashion for creating sound speed distribution over an acoustically relevant domain. Within an acoustic domain, singular value decomposition over the combined time-space structure of the sound speeds can be used to create Karhunen-Loève expansions of sound speed, subject to multivariate normality testing. These sound speed expansions serve as a basis for Hermite polynomial chaos expansions of derived quantities, in particular TL. The PC expansion coefficients result from so-called non-intrusive methods, involving evaluation of TL at multi-dimensional Gauss-Hermite quadrature collocation points. Traditional TL calculation from standard acoustic propagation modeling could be prohibitively time consuming at all multi-dimensional collocation points. This method employs Smolyak order and gridding methods to allow adaptive sub-sampling of the collocation points to determine only the most significant PC expansion coefficients to within a preset tolerance. Practically, the Smolyak order and grid sizes grow only polynomially in the number of Karhunen-Loève terms, alleviating the curse of dimensionality. The resulting TL PC coefficients allow the determination of TL PDF normality and its mean and standard deviation. In the non-normal case, PC Monte Carlo methods are used to rapidly establish the PDF. This work was

Polynomial Similarity Transformation Theory: A smooth interpolation between coupled cluster doubles and projected BCS applied to the reduced BCS Hamiltonian

DOE Office of Scientific and Technical Information (OSTI.GOV)

Degroote, M.; Henderson, T. M.; Zhao, J.

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

New Formulae for the High-Order Derivatives of Some Jacobi Polynomials: An Application to Some High-Order Boundary Value Problems

PubMed Central

Abd-Elhameed, W. M.

2014-01-01

This paper is concerned with deriving some new formulae expressing explicitly the high-order derivatives of Jacobi polynomials whose parameters difference is one or two of any degree and of any order in terms of their corresponding Jacobi polynomials. The derivatives formulae for Chebyshev polynomials of third and fourth kinds of any degree and of any order in terms of their corresponding Chebyshev polynomials are deduced as special cases. Some new reduction formulae for summing some terminating hypergeometric functions of unit argument are also deduced. As an application, and with the aid of the new introduced derivatives formulae, an algorithm for solving special sixth-order boundary value problems are implemented with the aid of applying Galerkin method. A numerical example is presented hoping to ascertain the validity and the applicability of the proposed algorithms. PMID:25386599

Polynomial interpretation of multipole vectors

NASA Astrophysics Data System (ADS)

Katz, Gabriel; Weeks, Jeff

2004-09-01

Copi, Huterer, Starkman, and Schwarz introduced multipole vectors in a tensor context and used them to demonstrate that the first-year Wilkinson microwave anisotropy probe (WMAP) quadrupole and octopole planes align at roughly the 99.9% confidence level. In the present article, the language of polynomials provides a new and independent derivation of the multipole vector concept. Bézout’s theorem supports an elementary proof that the multipole vectors exist and are unique (up to rescaling). The constructive nature of the proof leads to a fast, practical algorithm for computing multipole vectors. We illustrate the algorithm by finding exact solutions for some simple toy examples and numerical solutions for the first-year WMAP quadrupole and octopole. We then apply our algorithm to Monte Carlo skies to independently reconfirm the estimate that the WMAP quadrupole and octopole planes align at the 99.9% level.

Predicting Physical Time Series Using Dynamic Ridge Polynomial Neural Networks

PubMed Central

Al-Jumeily, Dhiya; Ghazali, Rozaida; Hussain, Abir

2014-01-01

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. PMID:25157950

Novel Threshold Changeable Secret Sharing Schemes Based on Polynomial Interpolation

PubMed Central

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. PMID:27792784

Predicting physical time series using dynamic ridge polynomial neural networks.

PubMed

Al-Jumeily, Dhiya; Ghazali, Rozaida; Hussain, Abir

2014-01-01

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.

Heath Van Essen

EPA Pesticide Factsheets

The EPA is providing notice of a proposed Administrative Penalty Assessment against Heath Van Essen, Respondent, an individual who owns or operates an animal feeding operation (“Facility”) that is located in Section 27 of Township 98 North, Range 47 West,

The Use of Generalized Laguerre Polynomials in Spectral Methods for Solving Fractional Delay Differential Equations.

PubMed

Khader, M M

2013-10-01

In this paper, an efficient numerical method for solving the fractional delay differential equations (FDDEs) is considered. The fractional derivative is described in the Caputo sense. The proposed method is based on the derived approximate formula of the Laguerre polynomials. The properties of Laguerre polynomials are utilized to reduce FDDEs to a linear or nonlinear system of algebraic equations. Special attention is given to study the error and the convergence analysis of the proposed method. Several numerical examples are provided to confirm that the proposed method is in excellent agreement with the exact solution.

77 FR 14583 - Notice to Manufacturers of Alternative Fuel Vans

Federal Register 2010, 2011, 2012, 2013, 2014

2012-03-12

... Alternative Fuel Vans AGENCY: Federal Aviation Administration (FAA), U.S. DOT. ACTION: Notice to Manufacturers of Alternative Fuel Vans. SUMMARY: Projects funded under the Airport Improvement Program (AIP) must... (FAA) is considering issuing waivers to foreign manufacturers of alternative fuel vans. This notice...

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

ERIC Educational Resources Information Center

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…

Cubic Polynomials with Real or Complex Coefficients: The Full Picture

ERIC Educational Resources Information Center

Bardell, Nicholas S.

2016-01-01

The cubic polynomial with real coefficients has a rich and interesting history primarily associated with the endeavours of great mathematicians like del Ferro, Tartaglia, Cardano or Vieta who sought a solution for the roots (Katz, 1998; see Chapter 12.3: The Solution of the Cubic Equation). Suffice it to say that since the times of renaissance…

Obituary: Thomas C. Van Flandern (1940-2009)

NASA Astrophysics Data System (ADS)

Dunham, David; Slabinski, Victor

2011-12-01

Dr. Thomas Charles Van Flandern, an expert in celestial mechanics and cosmology, died January 9, 2009 in Seattle, Washington, of colon cancer. He was 68. Van Flandern was an astronomer at the U.S. Naval Observatory from 1963 to 1983. He developed software to predict and analyze lunar occultations to improve lunar orbital and fundamental star catalog data. In later years he championed increasingly controversial theories. But his 1978 prediction that some asteroids have natural satellites, which was almost universally rejected, was verified when the Galileo spacecraft photographed Dactyl, a satellite of (243) Ida, during its flyby in 1993. Besides astronomy and computers, he had strong interests in biochemistry and nutrition, and he ran a business selling personal computers in the 1980s. Tom Van Flandern was born June 26, 1940 in Cleveland, Ohio, the first child of Robert F. Van Flandern and Anna Mary Haley. His father, a police officer, left the family when Tom Van Flandern was 5. His mother died when he was 16; he and his siblings then lived with their grandmother, Margery Jobe, until he went to college. Tom Van Flandern became interested in astronomy as a child. He used his first telescope, purchased with newspaper delivery earnings, to observe lunar occultations, and then learned how to predict them, sparking a life-long passion for dynamical astronomy. While attending St. Ignatius High School, Van Flandern and fellow student Thomas Petrie organized the Cleveland Moonwatch team to observe the first artificial satellites, the only team without an adult organizer. In 1958, Tom Van Flandern entered Xavier University where he led the Cincinnati Moonwatch team. He learned computer programming at a summer job with General Electric and wrote software to calculate "look angles" from orbital elements. The Cincinnati team became a top producer of observations using these predictions. Tom obtained a B.S. in mathematics from Xavier in 1962. He spent the next year at

The Fixed-Links Model in Combination with the Polynomial Function as a Tool for Investigating Choice Reaction Time Data

ERIC Educational Resources Information Center

Schweizer, Karl

2006-01-01

A model with fixed relations between manifest and latent variables is presented for investigating choice reaction time data. The numbers for fixation originate from the polynomial function. Two options are considered: the component-based (1 latent variable for each component of the polynomial function) and composite-based options (1 latent…

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

PubMed Central

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

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

PubMed

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.

A method for fitting regression splines with varying polynomial order in the linear mixed model.

PubMed

Edwards, Lloyd J; Stewart, Paul W; MacDougall, James E; Helms, Ronald W

2006-02-15

The linear mixed model has become a widely used tool for longitudinal analysis of continuous variables. The use of regression splines in these models offers the analyst additional flexibility in the formulation of descriptive analyses, exploratory analyses and hypothesis-driven confirmatory analyses. We propose a method for fitting piecewise polynomial regression splines with varying polynomial order in the fixed effects and/or random effects of the linear mixed model. The polynomial segments are explicitly constrained by side conditions for continuity and some smoothness at the points where they join. By using a reparameterization of this explicitly constrained linear mixed model, an implicitly constrained linear mixed model is constructed that simplifies implementation of fixed-knot regression splines. The proposed approach is relatively simple, handles splines in one variable or multiple variables, and can be easily programmed using existing commercial software such as SAS or S-plus. The method is illustrated using two examples: an analysis of longitudinal viral load data from a study of subjects with acute HIV-1 infection and an analysis of 24-hour ambulatory blood pressure profiles.

Constructing a polynomial whose nodal set is the three-twist knot 52

NASA Astrophysics Data System (ADS)

Dennis, Mark R.; Bode, Benjamin

2017-06-01

We describe a procedure that creates an explicit complex-valued polynomial function of three-dimensional space, whose nodal lines are the three-twist knot 52. The construction generalizes a similar approach for lemniscate knots: a braid representation is engineered from finite Fourier series and then considered as the nodal set of a certain complex polynomial which depends on an additional parameter. For sufficiently small values of this parameter, the nodal lines form the three-twist knot. Further mathematical properties of this map are explored, including the relationship of the phase critical points with the Morse-Novikov number, which is nonzero as this knot is not fibred. We also find analogous functions for other simple knots and links. The particular function we find, and the general procedure, should be useful for designing knotted fields of particular knot types in various physical systems.

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

NASA Technical Reports Server (NTRS)

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

2012-01-01

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

Arnoldus Van Rhijn on aphasia: a forgotten thesis.

PubMed

Eling, Paul

2011-01-01

Aphasia formed a central topic in the discussion on localization of function in the nineteenth century, in particular in France, Germany and Great Brittain. Little is known on contributions from the Netherlands. This paper aims to discuss the contents of Arnoldus Van Rhijn's dissertation on aphasia, written in 1868 and one of the very few Dutch contributions to aphasiology in the nineteenth century. Added to this paper is a translation of the "Physiological Part" of Van Rhijn's dissertation. Van Rhijn discussed three cases with acquired aphasia. He rejected Broca's notion of a cortical center for the articulation of speech and instead regarded the cortex as the site where the will exerted its influence. He argued that there is a certain form of specialization: the will to say something is localized at a different place than the will to write. According to Van Rhijn, the highest motor centers are localized in the subcortical gray areas. Van Rhijn concluded that aphasia may result from lesions to the cortical centers involved in speaking, or from a disconnection of the cortical and subcortical centers. Very little work was done on aphasia in the 19th century in the Netherlands. Van Rhijn's thesis, from an aphasiological point of view of limited value, does show that the notions of "centers", "connections", and "disorders due to disconnections" were generally known before Wernicke, also in the Netherlands. Copyright © 2011 Elsevier Srl. All rights reserved.

Online Removal of Baseline Shift with a Polynomial Function for Hemodynamic Monitoring Using Near-Infrared Spectroscopy.

PubMed

Zhao, Ke; Ji, Yaoyao; Li, Yan; Li, Ting

2018-01-21

Near-infrared spectroscopy (NIRS) has become widely accepted as a valuable tool for noninvasively monitoring hemodynamics for clinical and diagnostic purposes. Baseline shift has attracted great attention in the field, but there has been little quantitative study on baseline removal. Here, we aimed to study the baseline characteristics of an in-house-built portable medical NIRS device over a long time (>3.5 h). We found that the measured baselines all formed perfect polynomial functions on phantom tests mimicking human bodies, which were identified by recent NIRS studies. More importantly, our study shows that the fourth-order polynomial function acted to distinguish performance with stable and low-computation-burden fitting calibration (R-square >0.99 for all probes) among second- to sixth-order polynomials, evaluated by the parameters R-square, sum of squares due to error, and residual. This study provides a straightforward, efficient, and quantitatively evaluated solution for online baseline removal for hemodynamic monitoring using NIRS devices.

On the Numerical Formulation of Parametric Linear Fractional Transformation (LFT) Uncertainty Models for Multivariate Matrix Polynomial Problems

NASA Technical Reports Server (NTRS)

Belcastro, Christine M.

1998-01-01

Robust control system analysis and design is based on an uncertainty description, called a linear fractional transformation (LFT), which separates the uncertain (or varying) part of the system from the nominal system. These models are also useful in the design of gain-scheduled control systems based on Linear Parameter Varying (LPV) methods. Low-order LFT models are difficult to form for problems involving nonlinear parameter variations. This paper presents a numerical computational method for constructing and LFT model for a given LPV model. The method is developed for multivariate polynomial problems, and uses simple matrix computations to obtain an exact low-order LFT representation of the given LPV system without the use of model reduction. Although the method is developed for multivariate polynomial problems, multivariate rational problems can also be solved using this method by reformulating the rational problem into a polynomial form.

Current advances on polynomial resultant formulations

NASA Astrophysics Data System (ADS)

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.

Moment tensor inversion of recent local moderate sized Van Earthquakes: seismicity and active tectonics of the Van region : Eastern Turkey

NASA Astrophysics Data System (ADS)

Kalafat, D.; Suvarikli, M.; Ogutcu, Z.; Kekovali, K.; Ocal, M. F.; Gunes, Y.; Pinar, A.

2013-12-01

The study area of the present research, the Van Region is located at the norththern end of the collision zone between the Anatolia and Arabian plates. Therefore, the southeast border of the Anatolian plate collides with the Arabian plate along the Bitlis Suture Zone. This zone is formed by collision of Arabian and in large scale Eurasian plates at mid-Miocen age. This type of thrust generation as a result of compressional regime extends east-west. The largest recorded earthquakes have all taken place along Southern Turkey (e.g. Lice, 1971; Varto, 1966; Caldiran, 1976). On the 23th of October 2011, an earthquake shook the Van Lake, Eastern Turkey, following a seismic sequence of more than three months in an unprecedented episode for this region characterized by null or low seismicity. The October 23, 2011 Van-Ercis Earthquake (Mw=7.1) was the most devastating resulting in loss of life and destruction. In order to study the aftershocks' activity of this main event, we installed and kept a seismic network of 10 broad-band (BB) stations in the area for an interval of nearly fifteen months. We characterized the seismogenic structure of the zone by calculating a minimum 1-D local velocity model and obtaining precise hypocentre locations. We also calculated fault plane solutions for more than 200 moderate sized earthquakes based on first motion polarities and commonly Moment Tensor Inversion Methods. The seismogenic zone would be localized at aproximately 10 km depth. Generally, the distribution of the important moderate earthquakes and the aftershock distribution shows that the E-W and NE-SW oriented fault segments cause the earthquake activities. Aftershock events are located along the eastern border of Lake Van and mainly between 5 and 10 km depth and disposed in two alignments: a ~E-W-trending alignment that matches with the trace of the Van Trust fault Zone and a NE-trending which could correspond to an structure not previously seen. Selected focal mechanisms show a

A gradient-based model parametrization using Bernstein polynomials in Bayesian inversion of surface wave dispersion

NASA Astrophysics Data System (ADS)

Gosselin, Jeremy M.; Dosso, Stan E.; Cassidy, John F.; Quijano, Jorge E.; Molnar, Sheri; Dettmer, Jan

2017-10-01

This paper develops and applies a Bernstein-polynomial parametrization to efficiently represent general, gradient-based profiles in nonlinear geophysical inversion, with application to ambient-noise Rayleigh-wave dispersion data. Bernstein polynomials provide a stable parametrization in that small perturbations to the model parameters (basis-function coefficients) result in only small perturbations to the geophysical parameter profile. A fully nonlinear Bayesian inversion methodology is applied to estimate shear wave velocity (VS) profiles and uncertainties from surface wave dispersion data extracted from ambient seismic noise. The Bayesian information criterion is used to determine the appropriate polynomial order consistent with the resolving power of the data. Data error correlations are accounted for in the inversion using a parametric autoregressive model. The inversion solution is defined in terms of marginal posterior probability profiles for VS as a function of depth, estimated using Metropolis-Hastings sampling with parallel tempering. This methodology is applied to synthetic dispersion data as well as data processed from passive array recordings collected on the Fraser River Delta in British Columbia, Canada. Results from this work are in good agreement with previous studies, as well as with co-located invasive measurements. The approach considered here is better suited than `layered' modelling approaches in applications where smooth gradients in geophysical parameters are expected, such as soil/sediment profiles. Further, the Bernstein polynomial representation is more general than smooth models based on a fixed choice of gradient type (e.g. power-law gradient) because the form of the gradient is determined objectively by the data, rather than by a subjective parametrization choice.

[Implementation of vanA and vanB genes by PCR technique research interest in system (Xpert vanA/vanB CepheidR) closed in a laboratory of microbiology in managing an outbreak to Enterococcus faecium resistant glycopeptide (EfRG)].

PubMed

Dekeyser, S; Beclin, E; Descamps, D

2011-04-01

The closed system PCR for the rapid detection of vanA and vanB genes (Xpert vanA/vanB Cepheid(®)) was evaluated in our laboratory, to improve the rapidity of the response and thus the management of patients and isolation measures during two GRE outbreaks. From March to December2009, 565 samples were analysed by PCR associated to bacterial culture initially for all samples for 2months (n = 75), and thereafter for PCR-positive samples only. In this study, sensitivity and negative predictive values of the PCR were 100%. Specificity was evaluated in the presence and absence of outbreak: 69.3 and 76.8% respectively. The variability of false positive rates between units were lower in nonepidemic than during epidemic phase. The global false positive rate was 23.9%. This easy-to-use technology provides rapid results… four samples are tested in 1h versus 72h for culture. Despite its reagent cost, it represents an important hospital diagnostic tool: improvement of the management of cohorting areas and patient transfer between units, adaptation of isolation measures and treatments. However, culture remains necessary to confirm any positive result obtained by PCR and for epidemiological surveillance. Copyright © 2010 Elsevier Masson SAS. All rights reserved.

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kersaudy, Pierric, E-mail: pierric.kersaudy@orange.com; Whist Lab, 38 avenue du Général Leclerc, 92130 Issy-les-Moulineaux; ESYCOM, Université Paris-Est Marne-la-Vallée, 5 boulevard Descartes, 77700 Marne-la-Vallée

2015-04-01

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

Polynomial modal analysis of lamellar diffraction gratings in conical mounting.

PubMed

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.

The Coulomb problem on a 3-sphere and Heun polynomials

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bellucci, Stefano; Yeghikyan, Vahagn; Yerevan State University, Alex-Manoogian st. 1, 00025 Yerevan

2013-08-15

The paper studies the quantum mechanical Coulomb problem on a 3-sphere. We present a special parametrization of the ellipto-spheroidal coordinate system suitable for the separation of variables. After quantization we get the explicit form of the spectrum and present an algebraic equation for the eigenvalues of the Runge-Lentz vector. We also present the wave functions expressed via Heun polynomials.

Closed-form estimates of the domain of attraction for nonlinear systems via fuzzy-polynomial models.

PubMed

Pitarch, José Luis; Sala, Antonio; Ariño, Carlos Vicente

2014-04-01

In this paper, the domain of attraction of the origin of a nonlinear system is estimated in closed form via level sets with polynomial boundaries, iteratively computed. In particular, the domain of attraction is expanded from a previous estimate, such as a classical Lyapunov level set. With the use of fuzzy-polynomial models, the domain of attraction analysis can be carried out via sum of squares optimization and an iterative algorithm. The result is a function that bounds the domain of attraction, free from the usual restriction of being positive and decrescent in all the interior of its level sets.

Compressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Huan, Xun; Safta, Cosmin; Sargsyan, Khachik

Compressive sensing is a powerful technique for recovering sparse solutions of underdetermined linear systems, which is often encountered in uncertainty quanti cation analysis of expensive and high-dimensional physical models. We perform numerical investigations employing several com- pressive sensing solvers that target the unconstrained LASSO formulation, with a focus on linear systems that arise in the construction of polynomial chaos expansions. With core solvers of l1 ls, SpaRSA, CGIST, FPC AS, and ADMM, we develop techniques to mitigate over tting through an automated selection of regularization constant based on cross-validation, and a heuristic strategy to guide the stop-sampling decision. Practical recommendationsmore » on parameter settings for these tech- niques are provided and discussed. The overall method is applied to a series of numerical examples of increasing complexity, including large eddy simulations of supersonic turbulent jet-in-cross flow involving a 24-dimensional input. Through empirical phase-transition diagrams and convergence plots, we illustrate sparse recovery performance under structures induced by polynomial chaos, accuracy and computational tradeoffs between polynomial bases of different degrees, and practi- cability of conducting compressive sensing for a realistic, high-dimensional physical application. Across test cases studied in this paper, we find ADMM to have demonstrated empirical advantages through consistent lower errors and faster computational times.« less

Uncertainty Quantification in CO 2 Sequestration Using Surrogate Models from Polynomial Chaos Expansion

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Yan; Sahinidis, Nikolaos V.

2013-03-06

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

Effective field theories for van der Waals interactions

NASA Astrophysics Data System (ADS)

Brambilla, Nora; Shtabovenko, Vladyslav; Tarrús Castellà, Jaume; Vairo, Antonio

2017-06-01

Van der Waals interactions between two neutral but polarizable systems at a separation R much larger than the typical size of the systems are at the core of a broad sweep of contemporary problems in settings ranging from atomic, molecular and condensed matter physics to strong interactions and gravity. In this paper, we reexamine the dispersive van der Waals interactions between two hydrogen atoms. The novelty of the analysis resides in the usage of nonrelativistic effective field theories of quantum electrodynamics. In this framework, the van der Waals potential acquires the meaning of a matching coefficient in an effective field theory, dubbed van der Waals effective field theory, suited to describe the low-energy dynamics of an atom pair. It may be computed systematically as a series in R times some typical atomic scale and in the fine-structure constant α . The van der Waals potential gets short-range contributions and radiative corrections, which we compute in dimensional regularization and renormalize here for the first time. Results are given in d space-time dimensions. One can distinguish among different regimes depending on the relative size between 1 /R and the typical atomic bound-state energy, which is of order m α2. Each regime is characterized by a specific hierarchy of scales and a corresponding tower of effective field theories. The short-distance regime is characterized by 1 /R ≫m α2 and the leading-order van der Waals potential is the London potential. We also compute next-to-next-to-next-to-leading-order corrections. In the long-distance regime we have 1 /R ≪m α2. In this regime, the van der Waals potential contains contact terms, which are parametrically larger than the Casimir-Polder potential that describes the potential at large distances. In the effective field theory, the Casimir-Polder potential counts as a next-to-next-to-next-to-leading-order effect. In the intermediate-distance regime, 1 /R ˜m α2, a significantly more complex

Magnetism and structural chemistry of ternary borides RE2MB 6 ( RE = rare earth, M = Ru, Os)

NASA Astrophysics Data System (ADS)

Hiebl, K.; Rogl, P.; Nowotny, H.

1984-10-01

The magnetic behavior of the ternary borides RE2RuB 6 and RE2OsB 6 ( RE = Y, Gd, Tb, Dy, Ho, Er, Tm, Yb, Lu) was studied in the temperature range 1.5 K < T < 1100 K. All compounds crystallize with the Y 2ReB 6-type structure and are characterized by direct RE- RE contacts and the formation of planar infinite two-dimensional rigid boron nets. The magnetic properties reveal a typical Van Vleck paramagnetism of free RE3+-ions at temperatures higher than 200 K with ferromagnetic interaction in the low-temperature range T < 55 K. The ferromagnetic ordering temperatures vary with the De Gennes factor. There is no indication for a magnetic contribution from the Ru(Os)-sublattice. Above 1.8 K none of the samples were found to be superconducting.

VizieR Online Data Catalog: Positions of 502 Stars in Pleiades Region (Eichhorn+ 1970)

NASA Astrophysics Data System (ADS)

Eichhorn, H.; Googe, W. D.; Lukac, C. F.; Murphy, J. K.

1996-01-01

The catalog contains the positions (equinox B1900.0 and epoch B1955.0) of 502 stars in a region of about 1.5 degrees square in the Pleiades cluster, centered on Eta Tau. These coordinates have been derived from measurements of stellar images obtained with 65 exposures of various durations on 14 photographic plates with two telescopes at McCormick Observatory and Van Vleck Observatory. The plates were reduced by the plate overlap method, which resulted in a high degree of systematic accuracy in the final positions. Data in the machine version include Hertzsprung number, color index, photovisual magnitude, right ascension and declination and their standard errors, proper motion, and differences between the present position and previous works. Data for exposures, plates, and images measured, present in the published catalog, are not included in the machine version. (1 data file).

Semiclassical propagation: Hilbert space vs. Wigner representation

NASA Astrophysics Data System (ADS)

Gottwald, Fabian; Ivanov, Sergei D.

2018-03-01

A unified viewpoint on the van Vleck and Herman-Kluk propagators in Hilbert space and their recently developed counterparts in Wigner representation is presented. Based on this viewpoint, the Wigner Herman-Kluk propagator is conceptually the most general one. Nonetheless, the respective semiclassical expressions for expectation values in terms of the density matrix and the Wigner function are mathematically proven here to coincide. The only remaining difference is a mere technical flexibility of the Wigner version in choosing the Gaussians' width for the underlying coherent states beyond minimal uncertainty. This flexibility is investigated numerically on prototypical potentials and it turns out to provide neither qualitative nor quantitative improvements. Given the aforementioned generality, utilizing the Wigner representation for semiclassical propagation thus leads to the same performance as employing the respective most-developed (Hilbert-space) methods for the density matrix.

Schur polynomials and biorthogonal random matrix ensembles

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tierz, Miguel

The study of the average of Schur polynomials over a Stieltjes-Wigert ensemble has been carried out by Dolivet and Tierz [J. Math. Phys. 48, 023507 (2007); e-print arXiv:hep-th/0609167], where it was shown that it is equal to quantum dimensions. Using the same approach, we extend the result to the biorthogonal case. We also study, using the Littlewood-Richardson rule, some particular cases of the quantum dimension result. Finally, we show that the notion of Giambelli compatibility of Schur averages, introduced by Borodin et al. [Adv. Appl. Math. 37, 209 (2006); e-print arXiv:math-ph/0505021], also holds in the biorthogonal setting.

Quantitative Boltzmann-Gibbs Principles via Orthogonal Polynomial Duality

NASA Astrophysics Data System (ADS)

Ayala, Mario; Carinci, Gioia; Redig, Frank

2018-06-01

We study fluctuation fields of orthogonal polynomials in the context of particle systems with duality. We thereby obtain a systematic orthogonal decomposition of the fluctuation fields of local functions, where the order of every term can be quantified. This implies a quantitative generalization of the Boltzmann-Gibbs principle. In the context of independent random walkers, we complete this program, including also fluctuation fields in non-stationary context (local equilibrium). For other interacting particle systems with duality such as the symmetric exclusion process, similar results can be obtained, under precise conditions on the n particle dynamics.

The Economics of van der Waals Force Engineering

NASA Astrophysics Data System (ADS)

Pinto, Fabrizio

2008-01-01

As micro-electro-mechanical system (MEMS) fabrication continues on an ever-decreasing scale, new technological challenges must be successfully negotiated if Moore's Law is to be an even approximately valid model of the future of device miniaturization. Among the most significant obstacles is the existence of strong surface forces related to quantum mechanical van der Waals interatomic interactions, which rapidly diverge as the distance between any two neutral boundaries decreases. The van der Waals force is a contributing factor in several device failures and limitations, including, for instance, stiction and oscillator non-linearities. In the last decade, however, it has been conclusively shown that van der Waals forces are not just a MEMS limitation but can be engineered in both magnitude and sign so as to enable classes of proprietary inventions which either deliver novel capabilities or improve upon existing ones. The evolution of van der Waals force research from an almost exclusively theoretical field in quantum-electro-dynamics to an enabling nanotechnology discipline represents a useful example of the ongoing paradigm shift from government-centered to private-capital funded R&D in cutting-edge physics leading to potentially profitable products. In this paper, we discuss the reasons van der Waals force engineering may lead to the creation of thriving markets both in the short and medium terms by highlighting technical challenges that can be competitively addressed by this novel approach. We also discuss some notable obstacles to the cultural transformation of the academic research community required for the emergence of a functional van der Waals force engineering industry worldwide.

Arthur van Gehuchten takes neurology to the movies.

PubMed

Aubert, Geneviève

2002-11-26

To present the cinematographic production of Arthur Van Gehuchten (1861-1914) and to put this collection into its medical and sociocultural context. The arrival of Edison's Kinetoscope (1891) and Lumière's Cinématographe (1895) provoked the immediate interest of neurologists who foresaw the potential of motion pictures for illustration, research, and teaching. Arthur Van Gehuchten, professor of anatomy and neurology at the Catholic University of Louvain, was trained as a microscopist and a cytologist. From neuroanatomy, he progressively broadened his interest to neurology. Van Gehuchten was an avant-garde teacher, eager to adopt new visual aids. In 1895, he attended the first cinematographic screenings. Medical cinematography was soon brought into disrepute in European academic circles, when films made by the French surgeon Doyen were copied and shown on fairgrounds. Nevertheless, in 1905, Van Gehuchten began to film neurologic patients. He used this technique extensively to demonstrate clinical signs, to illustrate neurologic diseases, and to document functional evolution following surgery. For decades, these films were screened for medical students by Van Gehuchten's successors to the chair of neurology. The original nitrate films (more than 2 hours) have been recently rediscovered. They have been restored by the Royal Belgian Film Archive, where they are the oldest Belgian films. At the beginning of the 20th century, Van Gehuchten built up a collection of moving pictures for teaching purposes. This was one of the first such undertakings. This unique set of films has miraculously survived, and serves as an important archive of nervous diseases and their manifestations prior to the advent of modern therapies.

Higher-order Multivariable Polynomial Regression to Estimate Human Affective States

NASA Astrophysics Data System (ADS)

Wei, Jie; Chen, Tong; Liu, Guangyuan; Yang, Jiemin

2016-03-01

From direct observations, facial, vocal, gestural, physiological, and central nervous signals, estimating human affective states through computational models such as multivariate linear-regression analysis, support vector regression, and artificial neural network, have been proposed in the past decade. In these models, linear models are generally lack of precision because of ignoring intrinsic nonlinearities of complex psychophysiological processes; and nonlinear models commonly adopt complicated algorithms. To improve accuracy and simplify model, we introduce a new computational modeling method named as higher-order multivariable polynomial regression to estimate human affective states. The study employs standardized pictures in the International Affective Picture System to induce thirty subjects’ affective states, and obtains pure affective patterns of skin conductance as input variables to the higher-order multivariable polynomial model for predicting affective valence and arousal. Experimental results show that our method is able to obtain efficient correlation coefficients of 0.98 and 0.96 for estimation of affective valence and arousal, respectively. Moreover, the method may provide certain indirect evidences that valence and arousal have their brain’s motivational circuit origins. Thus, the proposed method can serve as a novel one for efficiently estimating human affective states.

Methods in Symbolic Computation and p-Adic Valuations of Polynomials

NASA Astrophysics Data System (ADS)

Guan, Xiao

Symbolic computation has widely appear in many mathematical fields such as combinatorics, number theory and stochastic processes. The techniques created in the area of experimental mathematics provide us efficient ways of symbolic computing and verification of complicated relations. Part I consists of three problems. The first one focuses on a unimodal sequence derived from a quartic integral. Many of its properties are explored with the help of hypergeometric representations and automatic proofs. The second problem tackles the generating function of the reciprocal of Catalan number. It springs from the closed form given by Mathematica. Furthermore, three methods in special functions are used to justify this result. The third issue addresses the closed form solutions for the moments of products of generalized elliptic integrals , which combines the experimental mathematics and classical analysis. Part II concentrates on the p-adic valuations of polynomials from the perspective of trees. For a given polynomial f( n) indexed in positive integers, the package developed in Mathematica will create certain tree structure following a couple of rules. The evolution of such trees are studied both rigorously and experimentally from the view of field extension, nonparametric statistics and random matrix.

Primordial black holes from polynomial potentials in single field inflation

NASA Astrophysics Data System (ADS)

Hertzberg, Mark P.; Yamada, Masaki

2018-04-01

Within canonical single field inflation models, we provide a method to reverse engineer and reconstruct the inflaton potential from a given power spectrum. This is not only a useful tool to find a potential from observational constraints, but also gives insight into how to generate a large amplitude spike in density perturbations, especially those that may lead to primordial black holes (PBHs). In accord with other works, we find that the usual slow-roll conditions need to be violated in order to generate a significant spike in the spectrum. We find that a way to achieve a very large amplitude spike in single field models is for the classical roll of the inflaton to overshoot a local minimum during inflation. We provide an example of a quintic polynomial potential that implements this idea and leads to the observed spectral index, observed amplitude of fluctuations on large scales, significant PBH formation on small scales, and is compatible with other observational constraints. We quantify how much fine-tuning is required to achieve this in a family of random polynomial potentials, which may be useful to estimate the probability of PBH formation in the string landscape.

Regression-based adaptive sparse polynomial dimensional decomposition for sensitivity analysis

NASA Astrophysics Data System (ADS)

Tang, Kunkun; Congedo, Pietro; Abgrall, Remi

2014-11-01

Polynomial dimensional decomposition (PDD) is employed in this work for global sensitivity analysis and uncertainty quantification of stochastic systems subject to a large number of random input variables. Due to the intimate structure between PDD and Analysis-of-Variance, PDD is able to provide simpler and more direct evaluation of the Sobol' sensitivity indices, when compared to polynomial chaos (PC). Unfortunately, the number of PDD terms grows exponentially with respect to the size of the input random vector, which makes the computational cost of the standard method unaffordable for real engineering applications. In order to address this problem of curse of dimensionality, this work proposes a variance-based adaptive strategy aiming to build a cheap meta-model by sparse-PDD with PDD coefficients computed by regression. During this adaptive procedure, the model representation by PDD only contains few terms, so that the cost to resolve repeatedly the linear system of the least-square regression problem is negligible. The size of the final sparse-PDD representation is much smaller than the full PDD, since only significant terms are eventually retained. Consequently, a much less number of calls to the deterministic model is required to compute the final PDD coefficients.

Higher-order Multivariable Polynomial Regression to Estimate Human Affective States

PubMed Central

Wei, Jie; Chen, Tong; Liu, Guangyuan; Yang, Jiemin

2016-01-01

From direct observations, facial, vocal, gestural, physiological, and central nervous signals, estimating human affective states through computational models such as multivariate linear-regression analysis, support vector regression, and artificial neural network, have been proposed in the past decade. In these models, linear models are generally lack of precision because of ignoring intrinsic nonlinearities of complex psychophysiological processes; and nonlinear models commonly adopt complicated algorithms. To improve accuracy and simplify model, we introduce a new computational modeling method named as higher-order multivariable polynomial regression to estimate human affective states. The study employs standardized pictures in the International Affective Picture System to induce thirty subjects’ affective states, and obtains pure affective patterns of skin conductance as input variables to the higher-order multivariable polynomial model for predicting affective valence and arousal. Experimental results show that our method is able to obtain efficient correlation coefficients of 0.98 and 0.96 for estimation of affective valence and arousal, respectively. Moreover, the method may provide certain indirect evidences that valence and arousal have their brain’s motivational circuit origins. Thus, the proposed method can serve as a novel one for efficiently estimating human affective states. PMID:26996254

Vehicle test report: Jet Industries Electra Van 600

NASA Technical Reports Server (NTRS)

Price, T. W.; Wirth, V. A., Jr.

1982-01-01

The Electra Van 600, an electric vehicle, was tested. Tests were performed to characterize parameters of the Electra Van 600 and to provide baseline data to be used for comparison of improved batteries and to which will be incorporated into the vehicle. The vehicle tests concentrated on the electrical drive subsystem, the batteries, controller, and motor; coastdowns to characterize the road load and range evaluation for cyclic and constant speed conditions; and qualitative performance was evaluated. It is found that the Electra Van 600 range performance is approximately equal to the majority of the vehicles tested previously.

Minimal Polynomial Method for Estimating Parameters of Signals Received by an Antenna Array

NASA Astrophysics Data System (ADS)

Ermolaev, V. T.; Flaksman, A. G.; Elokhin, A. V.; Kuptsov, V. V.

2018-01-01

The effectiveness of the projection minimal polynomial method for solving the problem of determining the number of sources of signals acting on an antenna array (AA) with an arbitrary configuration and their angular directions has been studied. The method proposes estimating the degree of the minimal polynomial of the correlation matrix (CM) of the input process in the AA on the basis of a statistically validated root-mean-square criterion. Special attention is paid to the case of the ultrashort sample of the input process when the number of samples is considerably smaller than the number of AA elements, which is important for multielement AAs. It is shown that the proposed method is more effective in this case than methods based on the AIC (Akaike's Information Criterion) or minimum description length (MDL) criterion.

Adaptive polynomial chaos techniques for uncertainty quantification of a gas cooled fast reactor transient

DOE Office of Scientific and Technical Information (OSTI.GOV)

Perko, Z.; Gilli, L.; Lathouwers, D.

2013-07-01

Uncertainty quantification plays an increasingly important role in the nuclear community, especially with the rise of Best Estimate Plus Uncertainty methodologies. Sensitivity analysis, surrogate models, Monte Carlo sampling and several other techniques can be used to propagate input uncertainties. In recent years however polynomial chaos expansion has become a popular alternative providing high accuracy at affordable computational cost. This paper presents such polynomial chaos (PC) methods using adaptive sparse grids and adaptive basis set construction, together with an application to a Gas Cooled Fast Reactor transient. Comparison is made between a new sparse grid algorithm and the traditionally used techniquemore » proposed by Gerstner. An adaptive basis construction method is also introduced and is proved to be advantageous both from an accuracy and a computational point of view. As a demonstration the uncertainty quantification of a 50% loss of flow transient in the GFR2400 Gas Cooled Fast Reactor design was performed using the CATHARE code system. The results are compared to direct Monte Carlo sampling and show the superior convergence and high accuracy of the polynomial chaos expansion. Since PC techniques are easy to implement, they can offer an attractive alternative to traditional techniques for the uncertainty quantification of large scale problems. (authors)« less

Scaling laws for van der Waals interactions in nanostructured materials.

PubMed

Gobre, Vivekanand V; Tkatchenko, Alexandre

2013-01-01

Van der Waals interactions have a fundamental role in biology, physics and chemistry, in particular in the self-assembly and the ensuing function of nanostructured materials. Here we utilize an efficient microscopic method to demonstrate that van der Waals interactions in nanomaterials act at distances greater than typically assumed, and can be characterized by different scaling laws depending on the dimensionality and size of the system. Specifically, we study the behaviour of van der Waals interactions in single-layer and multilayer graphene, fullerenes of varying size, single-wall carbon nanotubes and graphene nanoribbons. As a function of nanostructure size, the van der Waals coefficients follow unusual trends for all of the considered systems, and deviate significantly from the conventionally employed pairwise-additive picture. We propose that the peculiar van der Waals interactions in nanostructured materials could be exploited to control their self-assembly.

Rater Biases in Genetically Informative Research Designs: Comment on Bartels, Boomsma, Hudziak, van Beijsterveldt, and van den Oord (2007)

ERIC Educational Resources Information Center

Hoyt, William T.

2007-01-01

Rater biases are of interest to behavior genetic researchers, who often use ratings data as a basis for studying heritability. Inclusion of multiple raters for each sibling pair (M. Bartels, D. I. Boomsma, J. J. Hudziak, T. C. E. M. van Beijsterveldt, & E. J. C. G. van den Oord, 2007) is a promising strategy for controlling bias variance and may…

SO(N) restricted Schur polynomials

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kemp, Garreth, E-mail: garreth.kemp@students.wits.ac.za

2015-02-15

We focus on the 1/4-BPS sector of free super Yang-Mills theory with an SO(N) gauge group. This theory has an AdS/CFT (an equivalence between a conformal field theory in d-1 dimensions and type II string theory defined on an AdS space in d-dimensions) dual in the form of type IIB string theory with AdS{sub 5}×RP{sup 5} geometry. With the aim of studying excited giant graviton dynamics, we construct an orthogonal basis for this sector of the gauge theory in this work. First, we demonstrate that the counting of states, as given by the partition function, and the counting of restrictedmore » Schur polynomials match by restricting to a particular class of Young diagram labels. We then give an explicit construction of these gauge invariant operators and evaluate their two-point function exactly. This paves the way to studying the spectral problem of these operators and their D-brane duals.« less

Polynomial Monogamy Relations for Entanglement Negativity.

PubMed

Allen, Grant W; Meyer, David A

2017-02-24

The notion of nonclassical correlations is a powerful contrivance for explaining phenomena exhibited in quantum systems. It is well known, however, that quantum systems are not free to explore arbitrary correlations-the church of the smaller Hilbert space only accepts monogamous congregants. We demonstrate how to characterize the limits of what is quantum mechanically possible with a computable measure, entanglement negativity. We show that negativity only saturates the standard linear monogamy inequality in trivial cases implied by its monotonicity under local operations and classical communication, and derive a necessary and sufficient inequality which, for the first time, is a nonlinear higher degree polynomial. For very large quantum systems, we prove that the negativity can be distributed at least linearly for the tightest constraint and conjecture that it is at most linear.

Polynomial Monogamy Relations for Entanglement Negativity

NASA Astrophysics Data System (ADS)

Allen, Grant W.; Meyer, David A.

2017-02-01

The notion of nonclassical correlations is a powerful contrivance for explaining phenomena exhibited in quantum systems. It is well known, however, that quantum systems are not free to explore arbitrary correlations—the church of the smaller Hilbert space only accepts monogamous congregants. We demonstrate how to characterize the limits of what is quantum mechanically possible with a computable measure, entanglement negativity. We show that negativity only saturates the standard linear monogamy inequality in trivial cases implied by its monotonicity under local operations and classical communication, and derive a necessary and sufficient inequality which, for the first time, is a nonlinear higher degree polynomial. For very large quantum systems, we prove that the negativity can be distributed at least linearly for the tightest constraint and conjecture that it is at most linear.

Application of the polynomial chaos expansion to approximate the homogenised response of the intervertebral disc.

PubMed

Karajan, N; Otto, D; Oladyshkin, S; Ehlers, W

2014-10-01

A possibility to simulate the mechanical behaviour of the human spine is given by modelling the stiffer structures, i.e. the vertebrae, as a discrete multi-body system (MBS), whereas the softer connecting tissue, i.e. the softer intervertebral discs (IVD), is represented in a continuum-mechanical sense using the finite-element method (FEM). From a modelling point of view, the mechanical behaviour of the IVD can be included into the MBS in two different ways. They can either be computed online in a so-called co-simulation of a MBS and a FEM or offline in a pre-computation step, where a representation of the discrete mechanical response of the IVD needs to be defined in terms of the applied degrees of freedom (DOF) of the MBS. For both methods, an appropriate homogenisation step needs to be applied to obtain the discrete mechanical response of the IVD, i.e. the resulting forces and moments. The goal of this paper was to present an efficient method to approximate the mechanical response of an IVD in an offline computation. In a previous paper (Karajan et al. in Biomech Model Mechanobiol 12(3):453-466, 2012), it was proven that a cubic polynomial for the homogenised forces and moments of the FE model is a suitable choice to approximate the purely elastic response as a coupled function of the DOF of the MBS. In this contribution, the polynomial chaos expansion (PCE) is applied to generate these high-dimensional polynomials. Following this, the main challenge is to determine suitable deformation states of the IVD for pre-computation, such that the polynomials can be constructed with high accuracy and low numerical cost. For the sake of a simple verification, the coupling method and the PCE are applied to the same simplified motion segment of the spine as was used in the previous paper, i.e. two cylindrical vertebrae and a cylindrical IVD in between. In a next step, the loading rates are included as variables in the polynomial response functions to account for a more

Generalized closed form solutions for feasible dimension limit and pull-in characteristics of nanocantilever under the Influences of van der Waals and Casimir forces

NASA Astrophysics Data System (ADS)

Mukherjee, Banibrata; Sen, Siddhartha

2018-04-01

This paper presents generalized closed form expressions for determining the dimension limit for the basic design parameters as well as the pull-in characteristics of a nanocantilever beam under the influences of van der Waals and Casimir forces. The coupled nonlinear electromechanical problem of electrostatic nanocantilever is formulated in nondimensional form with Galerkin’s approximation considering the effects of these intermolecular forces and fringe field. The resulting integrals and higher order polynomials are solved numerically to derive the closed form expressions for maximum permissible detachment length, minimum feasible gap spacing and critical pull-in limit. The derived expressions are compared and validated as well with several reported literature showing reasonable agreement. The major advantages of the proposed closed form expressions are that, they do not contain any complex mathematical term or operation unlike in reported literature and thus they will serve as convenient tools for the NEMS community in successful design of various electrostatically actuated nanosystems.

RpoS induces expression of the Vibrio anguillarum quorum-sensing regulator VanT.

PubMed

Weber, Barbara; Croxatto, Antony; Chen, Chang; Milton, Debra L

2008-03-01

In vibrios, regulation of the Vibrio harveyi-like LuxR transcriptional activators occurs post-transcriptionally via small regulatory RNAs (sRNAs) that destabilize the luxR mRNA at a low cell population, eliminating expression of LuxR. Expression of the sRNAs is modulated by the vibrio quorum-sensing phosphorelay systems. However, vanT mRNA, which encodes a LuxR homologue in Vibrio anguillarum, is abundant at low and high cell density, indicating that VanT expression may be regulated via additional mechanisms. In this study, Western analyses showed that VanT was expressed throughout growth with a peak of expression during late exponential growth. VanO induced partial destabilization of vanT mRNA via activation of at least one Qrr sRNA. Interestingly, the sigma factor RpoS significantly stabilized vanT mRNA and induced VanT expression during late exponential growth. This induction was in part due to RpoS repressing expression of Hfq, an RNA chaperone. RpoS is not part of the quorum-sensing regulatory cascade since RpoS did not regulate expression or activity of VanO, and RpoS was not regulated by VanO or VanT. VanT and RpoS were needed for survival following UV irradiation and for pigment and metalloprotease production, suggesting that RpoS works with the quorum-sensing systems to modulate expression of VanT, which regulates survival and stress responses.

van Manen's method and reduction in a phenomenological hermeneutic study.

PubMed

Heinonen, Kristiina

2015-03-01

To describe van Manen's method and concept of reduction in a study that used a phenomenological hermeneutic approach. Nurse researchers have used van Manen's method in different ways. Participants' lifeworlds are described in depth, but descriptions of reduction have been brief. The literature and knowledge review and manual search of research articles. Databases Web Science, PubMed, CINAHL and PsycINFO, without applying a time period, to identify uses of van Manen's method. This paper shows how van Manen's method has been used in nursing research and gives some examples of van Manen's reduction. Reduction enables us to conduct in-depth phenomenological hermeneutic research and understand people's lifeworlds. As there are many variations in adapting reduction, it is complex and confusing. This paper contributes to the discussion of phenomenology, hermeneutic study and reduction. It opens up reduction as a method for researchers to exploit.

Tisserand's polynomials and inclination functions in the theory of artificial earth satellites

NASA Astrophysics Data System (ADS)

Aksenov, E. P.

1986-03-01

The connection between Tisserand's polynomials and inclination functions in the theory of motion of artificial earth satellites is established in the paper. The most important properties of these special functions of celestial mechanics are presented. The problem of expanding the perturbation function in satellite problems is discussed.

Polynomial expressions of electron depth dose as a function of energy in various materials: application to thermoluminescence (TL) dosimetry

NASA Astrophysics Data System (ADS)

Deogracias, E. C.; Wood, J. L.; Wagner, E. C.; Kearfott, K. J.

1999-02-01

The CEPXS/ONEDANT code package was used to produce a library of depth-dose profiles for monoenergetic electrons in various materials for energies ranging from 500 keV to 5 MeV in 10 keV increments. The various materials for which depth-dose functions were derived include: lithium fluoride (LiF), aluminum oxide (Al 2O 3), beryllium oxide (BeO), calcium sulfate (CaSO 4), calcium fluoride (CaF 2), lithium boron oxide (LiBO), soft tissue, lens of the eye, adiopose, muscle, skin, glass and water. All materials data sets were fit to five polynomials, each covering a different range of electron energies, using a least squares method. The resultant three dimensional, fifth-order polynomials give the dose as a function of depth and energy for the monoenergetic electrons in each material. The polynomials can be used to describe an energy spectrum by summing the doses at a given depth for each energy, weighted by the spectral intensity for that energy. An application of the polynomial is demonstrated by explaining the energy dependence of thermoluminescent detectors (TLDs) and illustrating the relationship between TLD signal and actual shallow dose due to beta particles.

Genomic and expression analysis of the vanG-like gene cluster of Clostridium difficile.

PubMed

Peltier, Johann; Courtin, Pascal; El Meouche, Imane; Catel-Ferreira, Manuella; Chapot-Chartier, Marie-Pierre; Lemée, Ludovic; Pons, Jean-Louis

2013-07-01

Primary antibiotic treatment of Clostridium difficile intestinal diseases requires metronidazole or vancomycin therapy. A cluster of genes homologous to enterococcal glycopeptides resistance vanG genes was found in the genome of C. difficile 630, although this strain remains sensitive to vancomycin. This vanG-like gene cluster was found to consist of five ORFs: the regulatory region consisting of vanR and vanS and the effector region consisting of vanG, vanXY and vanT. We found that 57 out of 83 C. difficile strains, representative of the main lineages of the species, harbour this vanG-like cluster. The cluster is expressed as an operon and, when present, is found at the same genomic location in all strains. The vanG, vanXY and vanT homologues in C. difficile 630 are co-transcribed and expressed to a low level throughout the growth phases in the absence of vancomycin. Conversely, the expression of these genes is strongly induced in the presence of subinhibitory concentrations of vancomycin, indicating that the vanG-like operon is functional at the transcriptional level in C. difficile. Hydrophilic interaction liquid chromatography (HILIC-HPLC) and MS analysis of cytoplasmic peptidoglycan precursors of C. difficile 630 grown without vancomycin revealed the exclusive presence of a UDP-MurNAc-pentapeptide with an alanine at the C terminus. UDP-MurNAc-pentapeptide [d-Ala] was also the only peptidoglycan precursor detected in C. difficile grown in the presence of vancomycin, corroborating the lack of vancomycin resistance. Peptidoglycan structures of a vanG-like mutant strain and of a strain lacking the vanG-like cluster did not differ from the C. difficile 630 strain, indicating that the vanG-like cluster also has no impact on cell-wall composition.

Van der waals forces on thin liquid films in capillary tubes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Herdt, G.C.; Swanson, L.W.

1993-10-01

A theory of the van der Waals attraction between a thin liquid films and a capillary tube is presented assuming the presence of a vapor-liquid interface. The model is based on the surface mode analysis method of van Kampen et al. Values for the van der Waals interaction energy per unit area were calculated for liquid films of pentane on a gold substrate assuming a thin liquid film. Results indicate that the effect of capillary curvature on the van der Waals interaction increases as the ratio of the liquid film thickness to the capillary radius is increased. This trend ismore » consistent with predictions based on the Hamaker theory. Deviations from results based on the Hamaker theory are easily explained in terms of retardation of the van der Waals interaction. Because the effect of capillary curvature increases in the regime where retardation effects become important, curvature effects constitute a small correction to the van der Waals forces in a capillary tube.« less

Disconjugacy, regularity of multi-indexed rationally extended potentials, and Laguerre exceptional polynomials

DOE Office of Scientific and Technical Information (OSTI.GOV)

Grandati, Y.; Quesne, C.

2013-07-15

The power of the disconjugacy properties of second-order differential equations of Schrödinger type to check the regularity of rationally extended quantum potentials connected with exceptional orthogonal polynomials is illustrated by re-examining the extensions of the isotonic oscillator (or radial oscillator) potential derived in kth-order supersymmetric quantum mechanics or multistep Darboux-Bäcklund transformation method. The function arising in the potential denominator is proved to be a polynomial with a nonvanishing constant term, whose value is calculated by induction over k. The sign of this term being the same as that of the already known highest degree term, the potential denominator has themore » same sign at both extremities of the definition interval, a property that is shared by the seed eigenfunction used in the potential construction. By virtue of disconjugacy, such a property implies the nodeless character of both the eigenfunction and the resulting potential.« less

Polynomial dual energy inverse functions for bone Calcium/Phosphorus ratio determination and experimental evaluation.

PubMed

Sotiropoulou, P; Fountos, G; Martini, N; Koukou, V; Michail, C; Kandarakis, I; Nikiforidis, G

2016-12-01

An X-ray dual energy (XRDE) method was examined, using polynomial nonlinear approximation of inverse functions for the determination of the bone Calcium-to-Phosphorus (Ca/P) mass ratio. Inverse fitting functions with the least-squares estimation were used, to determine calcium and phosphate thicknesses. The method was verified by measuring test bone phantoms with a dedicated dual energy system and compared with previously published dual energy data. The accuracy in the determination of the calcium and phosphate thicknesses improved with the polynomial nonlinear inverse function method, introduced in this work, (ranged from 1.4% to 6.2%), compared to the corresponding linear inverse function method (ranged from 1.4% to 19.5%). Copyright © 2016 Elsevier Ltd. All rights reserved.

Matrix of moments of the Legendre polynomials and its application to problems of electrostatics

NASA Astrophysics Data System (ADS)

Savchenko, A. O.

2017-01-01

In this work, properties of the matrix of moments of the Legendre polynomials are presented and proven. In particular, the explicit form of the elements of the matrix inverse to the matrix of moments is found and theorems of the linear combination and orthogonality are proven. On the basis of these properties, the total charge and the dipole moment of a conducting ball in a nonuniform electric field, the charge distribution over the surface of the conducting ball, its multipole moments, and the force acting on a conducting ball situated on the axis of a nonuniform axisymmetric electric field are determined. All assertions are formulated in theorems, the proofs of which are based on the properties of the matrix of moments of the Legendre polynomials.

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

PubMed

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

2014-04-01

The Boltzmann equation with the Bhatnagar-Gross-Krook collision operator is considered for the Bose-Einstein and Fermi-Dirac equilibrium distribution functions. We show that the expansion of the microscopic velocity in terms of Hermite polynomials must be carried to the fourth order to correctly describe the energy equation. The viscosity and thermal coefficients, previously obtained by Yang et al. [Shi and Yang, J. Comput. Phys. 227, 9389 (2008); Yang and Hung, Phys. Rev. E 79, 056708 (2009)] through the Uehling-Uhlenbeck approach, are also derived here. Thus the construction of a lattice Boltzmann method for the quantum fluid is possible provided that the Bose-Einstein and Fermi-Dirac equilibrium distribution functions are expanded to fourth order in the Hermite polynomials.

Waardering en Analyse van Simulatieresultaten (Valuation and Analysis of Simulation Results)

DTIC Science & Technology

1991-12-01

is uit de tabel van de Students T-verdeling te halen . Deze wordt aangeduid met t,(v), waarin a de overschrijdingskans en v bet aantal vrijheidsgraden...2 vrijheidsgraden. Uit de tabol van de Student’s t-verdeling zija nu de kritieke waardon R, on R2 to halen zodanig dat P(t >R2 ) = i Wordt or eon...analyse van simnulatieresultaten - TDCnaK RAPPORTE1CENTRALE Frederikkazerne, Geb. 140 AD-A25 470van den Burchlaan 31AD-A25 470Telefoon: 070-3166394

Martin Van Buren National Historic Site transportation analysis report

DOT National Transportation Integrated Search

2010-10-01

The Volpe Transportation Systems Center (Volpe Center) is providing transportation support to Martin Van Buren National Historic Site's (NHS) first General Management Plan (GMP), which will be complete in 2010 or 2011. Currently, Martin Van Buren NHS...

USING THE HERMITE POLYNOMIALS IN RADIOLOGICAL MONITORING NETWORKS.

PubMed

Benito, G; Sáez, J C; Blázquez, J B; Quiñones, J

2018-03-15

The most interesting events in Radiological Monitoring Network correspond to higher values of H*(10). The higher doses cause skewness in the probability density function (PDF) of the records, which there are not Gaussian anymore. Within this work the probability of having a dose >2 standard deviations is proposed as surveillance of higher doses. Such probability is estimated by using the Hermite polynomials for reconstructing the PDF. The result is that the probability is ~6 ± 1%, much >2.5% corresponding to Gaussian PDFs, which may be of interest in the design of alarm level for higher doses.

Generalised quasiprobability distribution for Hermite polynomial squeezed states

NASA Astrophysics Data System (ADS)

Datta, Sunil; D'Souza, Richard

1996-02-01

Generalized quasiprobability distributions (QPD) for Hermite polynomial states are presented. These states are solutions of an eigenvalue equation which is quadratic in creation and annihilation operators. Analytical expressions for the QPD are presented for some special cases of the eigenvalues. For large squeezing these analytical expressions for the QPD take the form of a finite series in even Hermite functions. These expressions very transparently exhibit the transition between, P, Q and W functions corresponding to the change of the s-parameter of the QPD. Further, they clearly show the two-photon nature of the processes involved in the generation of these states.

A. E. van Vogt: In Search of Meaning.

ERIC Educational Resources Information Center

Drake, H. L.

A general semantics perspective of science fiction writer A. E. van Vogt is presented in this paper. The first major section of the paper contains a biographical sketch of van Vogt and traces the influence of A. Korzybski's work on general semantics, "Science and Sanity," on his writing, while the second major section provides an…

Van Driest transformation and compressible wall-bounded flows

NASA Technical Reports Server (NTRS)

Huang, P. G.; Coleman, G. N.

1994-01-01

The transformation validity question utilizing resulting data from direct numerical simulations (DNS) of supersonic, isothermal cold wall channel flow was investigated. The DNS results stood for a wide scope of parameter and were suitable for the purpose of examining the generality of Van Driest transformation. The Van Driest law of the wall can be obtained from the inner-layer similarity arguments. It was demonstrated that the Van Driest transformation cannot be incorporated to collapse the sublayer and log-layer velocity profiles simultaneously. Velocity and temperature predictions according to the preceding composite mixing-length model were presented. Despite satisfactory congruity with the DNS data, the model must be perceived as an engineering guide and not as a rigorous analysis.

Chain mapping approach of Hamiltonian for FMO complex using associated, generalized and exceptional Jacobi polynomials

NASA Astrophysics Data System (ADS)

Mahdian, M.; Arjmandi, M. B.; Marahem, F.

2016-06-01

The excitation energy transfer (EET) in photosynthesis complex has been widely investigated in recent years. However, one of the main problems is simulation of this complex under realistic condition. In this paper by using the associated, generalized and exceptional Jacobi polynomials, firstly, we introduce the spectral density of Fenna-Matthews-Olson (FMO) complex. Afterward, we obtain a map that transforms the Hamiltonian of FMO complex as an open quantum system to a one-dimensional chain of oscillatory modes with only nearest neighbor interaction in which the system is coupled only to first mode of chain. The frequency and coupling strength of each mode can be analytically obtained from recurrence coefficient of mentioned orthogonal polynomials.

Alternative Fuels Data Center: Natural Gas Delivery Vans Support McShan

Science.gov Websites

FloristA> Natural Gas Delivery Vans Support McShan Florist to someone by E-mail Share Alternative Natural Gas Delivery Vans Support McShan Florist Watch how a Dallas, Texas, florist reduces emissions and saves money fueling delivery vans with compressed natural gas. For information about this project

Van de Hulst Essay: Light Scattering, Aerosols, Clouds, Climate, Hendrik van de Hulst, and I

DOE PAGES

Chylek, Petr

2017-12-06

It is not often that I have the opportunity to write something that is not a scientific study, and I am thankful for this opportunity to express my thoughts with regard to pursuits that are greater than those of science. In this van de Hulst assay, to honor Hendrik van de Hulst, I briefly summarize a few points from Hendrik's life that I find especially interesting, including his interests in spiritual (or religious) aspects of life, and his decision to avoid involvement in nucleation problems, a critical and basic uncertainty of current climate models. Finally, after that, I present brieflymore » a few episodes from my own experiences as an apprentice of science and life.« less

Van de Hulst Essay: Light Scattering, Aerosols, Clouds, Climate, Hendrik van de Hulst, and I

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chylek, Petr

It is not often that I have the opportunity to write something that is not a scientific study, and I am thankful for this opportunity to express my thoughts with regard to pursuits that are greater than those of science. In this van de Hulst assay, to honor Hendrik van de Hulst, I briefly summarize a few points from Hendrik's life that I find especially interesting, including his interests in spiritual (or religious) aspects of life, and his decision to avoid involvement in nucleation problems, a critical and basic uncertainty of current climate models. Finally, after that, I present brieflymore » a few episodes from my own experiences as an apprentice of science and life.« less

Multiple Voices in Charles Van Riper's Desensitization Therapy

ERIC Educational Resources Information Center

Leahy, Margaret M.

2008-01-01

Background: Charles Van Riper (1905-94) author, researcher and practitioner, was one of the major contributors to the field of stuttering in the 20th century. His series of Action Therapy videotapes provide a useful model of how therapy was implemented by a master clinician. Aims: Van Riper's session with a client is analysed to reveal how voices…

Militaire Toepassingen Van Adaptieve Optiek (Military Applications of Adaptive Optics)

DTIC Science & Technology

2006-09-01

dat op dit moment met de beschikbare theorie mogelijk is. Een ander interessant aspect is de mate waarin de turbulentie effecten het jam patroon...systemen In WEAG studie JP8. 11 is aangetoond dat in theorie adaptieve technieken een verbetering van de prestaties van een DIRCM systeem kunnen...Molenaar; Theorie van de laserscintillometer; TNO repot PHL 1978-16 (1978). TNO-rapport I TNO-DV 2006 A336 35/35 6 Ondertekening Den Haag, september 2006

Van Gogh from Space

NASA Image and Video Library

2017-12-08

Van Gogh from Space - July 13th, 2005 Description: In the style of Van Gogh's painting "Starry Night," massive congregations of greenish phytoplankton swirl in the dark water around Gotland, a Swedish island in the Baltic Sea. Phytoplankton are microscopic marine plants that form the first link in nearly all ocean food chains. Population explosions, or blooms, of phytoplankton, like the one shown here, occur when deep currents bring nutrients up to sunlit surface waters, fueling the growth and reproduction of these tiny plants. Credit: USGS/NASA/Landsat 7 To learn more about the Landsat satellite go to: landsat.gsfc.nasa.gov/ NASA Goddard Space Flight Center enables NASA’s mission through four scientific endeavors: Earth Science, Heliophysics, Solar System Exploration, and Astrophysics. Goddard plays a leading role in NASA’s accomplishments by contributing compelling scientific knowledge to advance the Agency’s mission. Follow us on Twitter Join us on Facebook

Multilevel population genetic analysis of vanA and vanB Enterococcus faecium causing nosocomial outbreaks in 27 countries (1986-2012).

PubMed

Freitas, Ana R; Tedim, Ana P; Francia, Maria V; Jensen, Lars B; Novais, Carla; Peixe, Luísa; Sánchez-Valenzuela, Antonio; Sundsfjord, Arnfinn; Hegstad, Kristin; Werner, Guido; Sadowy, Ewa; Hammerum, Anette M; Garcia-Migura, Lourdes; Willems, Rob J; Baquero, Fernando; Coque, Teresa M

2016-12-01

Vancomycin-resistant Enterococcus faecium (VREfm) have been increasingly reported since the 1980s. Despite the high number of published studies about VRE epidemiology, the dynamics and evolvability of these microorganisms are still not fully understood. A multilevel population genetic analysis of VREfm outbreak strains since 1986, representing the first comprehensive characterization of plasmid content in E. faecium, was performed to provide a detailed view of potential transmissible units. From a comprehensive MeSH search, we identified VREfm strains causing hospital outbreaks (1986-2012). In total, 53 VanA and 18 VanB isolates (27 countries, 5 continents) were analysed and 82 vancomycin-susceptible E. faecium (VSEfm) were included for comparison. Clonal relatedness was established by PFGE and MLST (goeBURST/Bayesian Analysis of Population Structure, BAPS). Characterization of van transposons (PCR mapping, RFLP, sequencing), plasmids (transfer, ClaI-RFLP, PCR typing of relaxases, replication-initiation proteins and toxin-antitoxin systems, hybridization, sequencing), bacteriocins and virulence determinants (PCR, hybridization, sequencing) was performed. VREfm were mainly associated with major human lineages ST17, ST18 and ST78. VREfm and VSEfm harboured plasmids of different families [RCR, small theta plasmids, RepA_N (pRUM/pLG1) and Inc18] able to yield mosaic elements. Tn1546-vanA was mainly located on pRUM/Axe-Txe (USA) and Inc18-pIP186 (Europe) plasmids. The VanB2 type (Tn5382/Tn1549) was predominant among VanB strains (chromosome and plasmids). Both strains and plasmids contributed to the spread and persistence of vancomycin resistance among E. faecium. Horizontal gene transfer events among genetic elements from different clonal lineages (same or different species) result in chimeras with different stability and host range, complicating the surveillance of epidemic plasmids. © The Author 2016. Published by Oxford University Press on behalf of the British

Crossover ensembles of random matrices and skew-orthogonal polynomials

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kumar, Santosh, E-mail: skumar.physics@gmail.com; Pandey, Akhilesh, E-mail: ap0700@mail.jnu.ac.in

2011-08-15

Highlights: > We study crossover ensembles of Jacobi family of random matrices. > We consider correlations for orthogonal-unitary and symplectic-unitary crossovers. > We use the method of skew-orthogonal polynomials and quaternion determinants. > We prove universality of spectral correlations in crossover ensembles. > We discuss applications to quantum conductance and communication theory problems. - Abstract: In a recent paper (S. Kumar, A. Pandey, Phys. Rev. E, 79, 2009, p. 026211) we considered Jacobi family (including Laguerre and Gaussian cases) of random matrix ensembles and reported exact solutions of crossover problems involving time-reversal symmetry breaking. In the present paper we givemore » details of the work. We start with Dyson's Brownian motion description of random matrix ensembles and obtain universal hierarchic relations among the unfolded correlation functions. For arbitrary dimensions we derive the joint probability density (jpd) of eigenvalues for all transitions leading to unitary ensembles as equilibrium ensembles. We focus on the orthogonal-unitary and symplectic-unitary crossovers and give generic expressions for jpd of eigenvalues, two-point kernels and n-level correlation functions. This involves generalization of the theory of skew-orthogonal polynomials to crossover ensembles. We also consider crossovers in the circular ensembles to show the generality of our method. In the large dimensionality limit, correlations in spectra with arbitrary initial density are shown to be universal when expressed in terms of a rescaled symmetry breaking parameter. Applications of our crossover results to communication theory and quantum conductance problems are also briefly discussed.« less

Image distortion analysis using polynomial series expansion.

PubMed

Baggenstoss, Paul M

2004-11-01

In this paper, we derive a technique for analysis of local distortions which affect data in real-world applications. In the paper, we focus on image data, specifically handwritten characters. Given a reference image and a distorted copy of it, the method is able to efficiently determine the rotations, translations, scaling, and any other distortions that have been applied. Because the method is robust, it is also able to estimate distortions for two unrelated images, thus determining the distortions that would be required to cause the two images to resemble each other. The approach is based on a polynomial series expansion using matrix powers of linear transformation matrices. The technique has applications in pattern recognition in the presence of distortions.

Modeling Source Water TOC Using Hydroclimate Variables and Local Polynomial Regression.

PubMed

Samson, Carleigh C; Rajagopalan, Balaji; Summers, R Scott

2016-04-19

To control disinfection byproduct (DBP) formation in drinking water, an understanding of the source water total organic carbon (TOC) concentration variability can be critical. Previously, TOC concentrations in water treatment plant source waters have been modeled using streamflow data. However, the lack of streamflow data or unimpaired flow scenarios makes it difficult to model TOC. In addition, TOC variability under climate change further exacerbates the problem. Here we proposed a modeling approach based on local polynomial regression that uses climate, e.g. temperature, and land surface, e.g., soil moisture, variables as predictors of TOC concentration, obviating the need for streamflow. The local polynomial approach has the ability to capture non-Gaussian and nonlinear features that might be present in the relationships. The utility of the methodology is demonstrated using source water quality and climate data in three case study locations with surface source waters including river and reservoir sources. The models show good predictive skill in general at these locations, with lower skills at locations with the most anthropogenic influences in their streams. Source water TOC predictive models can provide water treatment utilities important information for making treatment decisions for DBP regulation compliance under future climate scenarios.

Modelling the breeding of Aedes Albopictus species in an urban area in Pulau Pinang using polynomial regression

NASA Astrophysics Data System (ADS)

Salleh, Nur Hanim Mohd; Ali, Zalila; Noor, Norlida Mohd.; Baharum, Adam; Saad, Ahmad Ramli; Sulaiman, Husna Mahirah; Ahmad, Wan Muhamad Amir W.

2014-07-01

Polynomial regression is used to model a curvilinear relationship between a response variable and one or more predictor variables. It is a form of a least squares linear regression model that predicts a single response variable by decomposing the predictor variables into an nth order polynomial. In a curvilinear relationship, each curve has a number of extreme points equal to the highest order term in the polynomial. A quadratic model will have either a single maximum or minimum, whereas a cubic model has both a relative maximum and a minimum. This study used quadratic modeling techniques to analyze the effects of environmental factors: temperature, relative humidity, and rainfall distribution on the breeding of Aedes albopictus, a type of Aedes mosquito. Data were collected at an urban area in south-west Penang from September 2010 until January 2011. The results indicated that the breeding of Aedes albopictus in the urban area is influenced by all three environmental characteristics. The number of mosquito eggs is estimated to reach a maximum value at a medium temperature, a medium relative humidity and a high rainfall distribution.

A new numerical treatment based on Lucas polynomials for 1D and 2D sinh-Gordon equation

NASA Astrophysics Data System (ADS)

Oruç, Ömer

2018-04-01

In this paper, a new mixed method based on Lucas and Fibonacci polynomials is developed for numerical solutions of 1D and 2D sinh-Gordon equations. Firstly time variable discretized by central finite difference and then unknown function and its derivatives are expanded to Lucas series. With the help of these series expansion and Fibonacci polynomials, matrices for differentiation are derived. With this approach, finding the solution of sinh-Gordon equation transformed to finding the solution of an algebraic system of equations. Lucas series coefficients are acquired by solving this system of algebraic equations. Then by plugginging these coefficients into Lucas series expansion numerical solutions can be obtained consecutively. The main objective of this paper is to demonstrate that Lucas polynomial based method is convenient for 1D and 2D nonlinear problems. By calculating L2 and L∞ error norms of some 1D and 2D test problems efficiency and performance of the proposed method is monitored. Acquired accurate results confirm the applicability of the method.

Low-temperature anomalies in the dynamic elastic moduli of cubic AIIBVI crystals with 3d-transition metal impurities

NASA Astrophysics Data System (ADS)

Lonchakov, A. T.

2011-04-01

A negative paramagnetic contribution to the dynamic elastic moduli is identified in AIIBVI:3d wide band-gap compounds for the first time. It appears as a paramagnetic elastic, or, briefly, paraelastic, susceptibility. These compounds are found to have a linear temperature dependence for the inverse paraelastic susceptibility. This is explained by a contribution from the diagonal matrix elements of the orbit-lattice interaction operators in the energy of the spin-orbital states of the 3d-ion as a function of applied stress (by analogy with the Curie contribution to the magnetic susceptibility). The inverse paraelastic susceptibility of AIIBVI crystals containing non-Kramers 3d-ions is found to deviate from linearity with decreasing temperature and reaches saturation. This effect is explained by a contribution from nondiagonal matrix elements (analogous to the well known van Vleck contribution to the magnetic susceptibility of paramagnets).