Global Monte Carlo Simulation with High Order Polynomial Expansions
William R. Martin; James Paul Holloway; Kaushik Banerjee; Jesse Cheatham; Jeremy Conlin
2007-01-01
The functional expansion technique (FET) was recently developed for Monte Carlo simulation. The basic idea of the FET is to expand a Monte Carlo tally in terms of a high order expansion, the coefficients of which can be estimated via the usual random walk process in a conventional Monte Carlo code. If the expansion basis is chosen carefully, the lowest order coefficient is simply the conventional histogram tally, corresponding to a flat mode. This research project studied the applicability of using the FET to estimate the fission source, from which fission sites can be sampled for the next generation. The idea is that individual fission sites contribute to expansion modes that may span the geometry being considered, possibly increasing the communication across a loosely coupled system and thereby improving convergence over the conventional fission bank approach used in most production Monte Carlo codes. The project examined a number of basis functions, including global Legendre polynomials as well as 'local' piecewise polynomials such as finite element hat functions and higher order versions. The global FET showed an improvement in convergence over the conventional fission bank approach. The local FET methods showed some advantages versus global polynomials in handling geometries with discontinuous material properties. The conventional finite element hat functions had the disadvantage that the expansion coefficients could not be estimated directly but had to be obtained by solving a linear system whose matrix elements were estimated. An alternative fission matrix-based response matrix algorithm was formulated. Studies were made of two alternative applications of the FET, one based on the kernel density estimator and one based on Arnoldi's method of minimized iterations. Preliminary results for both methods indicate improvements in fission source convergence. These developments indicate that the FET has promise for speeding up Monte Carlo fission source convergence
A high-order q-difference equation for q-Hahn multiple orthogonal polynomials
Arvesú, J.; Esposito, Chiara
2012-01-01
A high-order linear q-difference equation with polynomial coefficients having q-Hahn multiple orthogonal polynomials as eigenfunctions is given. The order of the equation coincides with the number of orthogonality conditions that these polynomials satisfy. Some limiting situations when are studie....... Indeed, the difference equation for Hahn multiple orthogonal polynomials given in Lee [J. Approx. Theory (2007), ), doi: 10.1016/j.jat.2007.06.002] is obtained as a limiting case....
A comparison of high-order polynomial and wave-based methods for Helmholtz problems
Lieu, Alice; Gabard, Gwénaël; Bériot, Hadrien
2016-09-01
The application of computational modelling to wave propagation problems is hindered by the dispersion error introduced by the discretisation. Two common strategies to address this issue are to use high-order polynomial shape functions (e.g. hp-FEM), or to use physics-based, or Trefftz, methods where the shape functions are local solutions of the problem (typically plane waves). Both strategies have been actively developed over the past decades and both have demonstrated their benefits compared to conventional finite-element methods, but they have yet to be compared. In this paper a high-order polynomial method (p-FEM with Lobatto polynomials) and the wave-based discontinuous Galerkin method are compared for two-dimensional Helmholtz problems. A number of different benchmark problems are used to perform a detailed and systematic assessment of the relative merits of these two methods in terms of interpolation properties, performance and conditioning. It is generally assumed that a wave-based method naturally provides better accuracy compared to polynomial methods since the plane waves or Bessel functions used in these methods are exact solutions of the Helmholtz equation. Results indicate that this expectation does not necessarily translate into a clear benefit, and that the differences in performance, accuracy and conditioning are more nuanced than generally assumed. The high-order polynomial method can in fact deliver comparable, and in some cases superior, performance compared to the wave-based DGM. In addition to benchmarking the intrinsic computational performance of these methods, a number of practical issues associated with realistic applications are also discussed.
Matrix form of Legendre polynomials for solving linear integro-differential equations of high order
Kammuji, M.; Eshkuvatov, Z. K.; Yunus, Arif A. M.
2017-04-01
This paper presents an effective approximate solution of high order of Fredholm-Volterra integro-differential equations (FVIDEs) with boundary condition. Legendre truncated series is used as a basis functions to estimate the unknown function. Matrix operation of Legendre polynomials is used to transform FVIDEs with boundary conditions into matrix equation of Fredholm-Volterra type. Gauss Legendre quadrature formula and collocation method are applied to transfer the matrix equation into system of linear algebraic equations. The latter equation is solved by Gauss elimination method. The accuracy and validity of this method are discussed by solving two numerical examples and comparisons with wavelet and methods.
Planar real polynomial differential systems of degree n > 3 having a weak focus of high order
Llibre, J.; Rabanal, R.
2008-06-01
We construct planar polynomial differential systems of even (respectively odd) degree n > 3, of the form linear plus a nonlinear homogeneous part of degree n having a weak focus of order n 2 -1 (respectively (n 2 -1)/2 ) at the origin. As far as we know this provides the highest order known until now for a weak focus of a polynomial differential system of arbitrary degree n. (author)
Kruglyakov, Mikhail; Kuvshinov, Alexey
2018-05-01
3-D interpretation of electromagnetic (EM) data of different origin and scale becomes a common practice worldwide. However, 3-D EM numerical simulations (modeling)—a key part of any 3-D EM data analysis—with realistic levels of complexity, accuracy and spatial detail still remains challenging from the computational point of view. We present a novel, efficient 3-D numerical solver based on a volume integral equation (IE) method. The efficiency is achieved by using a high-order polynomial (HOP) basis instead of the zero-order (piecewise constant) basis that is invoked in all routinely used IE-based solvers. We demonstrate that usage of the HOP basis allows us to decrease substantially the number of unknowns (preserving the same accuracy), with corresponding speed increase and memory saving.
From sequences to polynomials and back, via operator orderings
Amdeberhan, Tewodros, E-mail: tamdeber@tulane.edu; Dixit, Atul, E-mail: adixit@tulane.edu; Moll, Victor H., E-mail: vhm@tulane.edu [Department of Mathematics, Tulane University, New Orleans, Louisiana 70118 (United States); De Angelis, Valerio, E-mail: vdeangel@xula.edu [Department of Mathematics, Xavier University of Louisiana, New Orleans, Louisiana 70125 (United States); Vignat, Christophe, E-mail: vignat@tulane.edu [Department of Mathematics, Tulane University, New Orleans, Louisiana 70118, USA and L.S.S. Supelec, Universite d' Orsay (France)
2013-12-15
Bender and Dunne [“Polynomials and operator orderings,” J. Math. Phys. 29, 1727–1731 (1988)] showed that linear combinations of words q{sup k}p{sup n}q{sup n−k}, where p and q are subject to the relation qp − pq = ı, may be expressed as a polynomial in the symbol z=1/2 (qp+pq). Relations between such polynomials and linear combinations of the transformed coefficients are explored. In particular, examples yielding orthogonal polynomials are provided.
Higher order branching of periodic orbits from polynomial isochrones
B. Toni
1999-09-01
Full Text Available We discuss the higher order local bifurcations of limit cycles from polynomial isochrones (linearizable centers when the linearizing transformation is explicitly known and yields a polynomial perturbation one-form. Using a method based on the relative cohomology decomposition of polynomial one-forms complemented with a step reduction process, we give an explicit formula for the overall upper bound of branch points of limit cycles in an arbitrary $n$ degree polynomial perturbation of the linear isochrone, and provide an algorithmic procedure to compute the upper bound at successive orders. We derive a complete analysis of the nonlinear cubic Hamiltonian isochrone and show that at most nine branch points of limit cycles can bifurcate in a cubic polynomial perturbation. Moreover, perturbations with exactly two, three, four, six, and nine local families of limit cycles may be constructed.
Fractional order differentiation by integration with Jacobi polynomials
Liu, Dayan
2012-12-01
The differentiation by integration method with Jacobi polynomials was originally introduced by Mboup, Join and Fliess [22], [23]. This paper generalizes this method from the integer order to the fractional order for estimating the fractional order derivatives of noisy signals. The proposed fractional order differentiator is deduced from the Jacobi orthogonal polynomial filter and the Riemann-Liouville fractional order derivative definition. Exact and simple formula for this differentiator is given where an integral formula involving Jacobi polynomials and the noisy signal is used without complex mathematical deduction. Hence, it can be used both for continuous-time and discrete-time models. The comparison between our differentiator and the recently introduced digital fractional order Savitzky-Golay differentiator is given in numerical simulations so as to show its accuracy and robustness with respect to corrupting noises. © 2012 IEEE.
Fractional order differentiation by integration with Jacobi polynomials
Liu, Dayan; Gibaru, O.; Perruquetti, Wilfrid; Laleg-Kirati, Taous-Meriem
2012-01-01
The differentiation by integration method with Jacobi polynomials was originally introduced by Mboup, Join and Fliess [22], [23]. This paper generalizes this method from the integer order to the fractional order for estimating the fractional order derivatives of noisy signals. The proposed fractional order differentiator is deduced from the Jacobi orthogonal polynomial filter and the Riemann-Liouville fractional order derivative definition. Exact and simple formula for this differentiator is given where an integral formula involving Jacobi polynomials and the noisy signal is used without complex mathematical deduction. Hence, it can be used both for continuous-time and discrete-time models. The comparison between our differentiator and the recently introduced digital fractional order Savitzky-Golay differentiator is given in numerical simulations so as to show its accuracy and robustness with respect to corrupting noises. © 2012 IEEE.
Need for higher order polynomial basis for polynomial nodal methods employed in LWR calculations
Taiwo, T.A.; Palmiotti, G.
1997-01-01
The paper evaluates the accuracy and efficiency of sixth order polynomial solutions and the use of one radial node per core assembly for pressurized water reactor (PWR) core power distributions and reactivities. The computer code VARIANT was modified to calculate sixth order polynomial solutions for a hot zero power benchmark problem in which a control assembly along a core axis is assumed to be out of the core. Results are presented for the VARIANT, DIF3D-NODAL, and DIF3D-finite difference codes. The VARIANT results indicate that second order expansion of the within-node source and linear representation of the node surface currents are adequate for this problem. The results also demonstrate the improvement in the VARIANT solution when the order of the polynomial expansion of the within-node flux is increased from fourth to sixth order. There is a substantial saving in computational time for using one radial node per assembly with the sixth order expansion compared to using four or more nodes per assembly and fourth order polynomial solutions. 11 refs., 1 tab
First-Order Polynomial Heisenberg Algebras and Coherent States
Castillo-Celeita, M; Fernández C, D J
2016-01-01
The polynomial Heisenberg algebras (PHA) are deformations of the Heisenberg- Weyl algebra characterizing the underlying symmetry of the supersymmetric partners of the Harmonic oscillator. When looking for the simplest system ruled by PHA, however, we end up with the harmonic oscillator. In this paper we are going to realize the first-order PHA through the harmonic oscillator. The associated coherent states will be also constructed, which turn out to be the well known even and odd coherent states. (paper)
Positive polynomials and robust stabilization with fixed-order controllers
Henrion, Didier; Šebek, M.; Kučera, V.
2003-01-01
Roč. 48, č. 7 (2003), s. 1178-1186 ISSN 0018-9286 R&D Projects: GA ČR GA102/02/0709; GA MŠk ME 496 Institutional research plan: CEZ:AV0Z1075907 Keywords : fixed-order control lers * linear matrix inequality * polynomials, robust control Subject RIV: BC - Control Systems Theory Impact factor: 1.896, year: 2003
Yasa, F.; Anli, F.; Guengoer, S.
2007-01-01
We present analytical calculations of spherically symmetric radioactive transfer and neutron transport using a hypothesis of P1 and T1 low order polynomial approximation for diffusion coefficient D. Transport equation in spherical geometry is considered as the pseudo slab equation. The validity of polynomial expansionion in transport theory is investigated through a comparison with classic diffusion theory. It is found that for causes when the fluctuation of the scattering cross section dominates, the quantitative difference between the polynomial approximation and diffusion results was physically acceptable in general
Avellar, J.; Claudino, A. L. G. C.; Duarte, L. G. S.; da Mota, L. A. C. P.
2015-10-01
For the Darbouxian methods we are studying here, in order to solve first order rational ordinary differential equations (1ODEs), the most costly (computationally) step is the finding of the needed Darboux polynomials. This can be so grave that it can render the whole approach unpractical. Hereby we introduce a simple heuristics to speed up this process for a class of 1ODEs.
On Sequences of Numbers and Polynomials Defined by Linear Recurrence Relations of Order 2
Tian-Xiao He
2009-01-01
Full Text Available Here we present a new method to construct the explicit formula of a sequence of numbers and polynomials generated by a linear recurrence relation of order 2. The applications of the method to the Fibonacci and Lucas numbers, Chebyshev polynomials, the generalized Gegenbauer-Humbert polynomials are also discussed. The derived idea provides a general method to construct identities of number or polynomial sequences defined by linear recurrence relations. The applications using the method to solve some algebraic and ordinary differential equations are presented.
Generation of high order modes
Ngcobo, S
2012-07-01
Full Text Available with the location of the Laguerre polynomial zeros. The Diffractive optical element is used to shape the TEM00 Gassian beam and force the laser to operate on a higher order TEMp0 Laguerre-Gaussian modes or high order superposition of Laguerre-Gaussian modes...
S. Vukotic
2016-08-01
Full Text Available Digital polynomial-based interpolation filters implemented using the Farrow structure are used in Digital Signal Processing (DSP to calculate the signal between its discrete samples. The two basic design parameters for these filters are number of polynomial-segments defining the finite length of impulse response, and order of polynomials in each polynomial segment. The complexity of the implementation structure and the frequency domain performance depend on these two parameters. This contribution presents estimation formulae for length and polynomial order of polynomial-based filters for various types of requirements including attenuation in stopband, width of transitions band, deviation in passband, weighting in passband/stopband.
Special polynomials associated with the fourth order analogue to the Painleve equations
Kudryashov, Nikolai A.; Demina, Maria V.
2007-01-01
Rational solutions of the fourth order analogue to the Painleve equations are classified. Special polynomials associated with the rational solutions are introduced. The structure of the polynomials is found. Formulae for their coefficients and degrees are derived. It is shown that special solutions of the Fordy-Gibbons, the Caudrey-Dodd-Gibbon and the Kaup-Kupershmidt equations can be expressed through solutions of the equation studied
Numerical solutions of multi-order fractional differential equations by Boubaker polynomials
Bolandtalat A.
2016-01-01
Full Text Available In this paper, we have applied a numerical method based on Boubaker polynomials to obtain approximate numerical solutions of multi-order fractional differential equations. We obtain an operational matrix of fractional integration based on Boubaker polynomials. Using this operational matrix, the given problem is converted into a set of algebraic equations. Illustrative examples are are given to demonstrate the efficiency and simplicity of this technique.
Recurrence approach and higher order polynomial algebras for superintegrable monopole systems
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.
Method of applying single higher order polynomial basis function over multiple domains
Lysko, AA
2010-03-01
Full Text Available A novel method has been devised where one set of higher order polynomial-based basis functions can be applied over several wire segments, thus permitting to decouple the number of unknowns from the number of segments, and so from the geometrical...
Khataybeh, S. N.; Hashim, I.
2018-04-01
In this paper, we propose for the first time a method based on Bernstein polynomials for solving directly a class of third-order ordinary differential equations (ODEs). This method gives a numerical solution by converting the equation into a system of algebraic equations which is solved directly. Some numerical examples are given to show the applicability of the method.
High-order finite volume advection
Shaw, James
2018-01-01
The cubicFit advection scheme is limited to second-order convergence because it uses a polynomial reconstruction fitted to point values at cell centres. The highOrderFit advection scheme achieves higher than second order by calculating high-order moments over the mesh geometry.
Higher-order Cauchy of the second kind and poly-Cauchy of the second kind mixed type polynomials
Kim, Dae San; Kim, Taekyun
2013-01-01
In this paper, we investigate some properties of higher-order Cauchy of the second kind and poly-Cauchy of the second mixed type polynomials with umbral calculus viewpoint. From our investigation, we derive many interesting identities of higher-order Cauchy of the second kind and poly-Cauchy of the second kind mixed type polynomials.
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.
Lattice Boltzmann method for bosons and fermions and the fourth-order Hermite polynomial expansion.
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.
Variational Iteration Method for Fifth-Order Boundary Value Problems Using He's Polynomials
Muhammad Aslam Noor
2008-01-01
Full Text Available We apply the variational iteration method using He's polynomials (VIMHP for solving the fifth-order boundary value problems. The proposed method is an elegant combination of variational iteration and the homotopy perturbation methods and is mainly due to Ghorbani (2007. The suggested algorithm is quite efficient and is practically well suited for use in these problems. The proposed iterative scheme finds the solution without any discritization, linearization, or restrictive assumptions. Several examples are given to verify the reliability and efficiency of the method. The fact that the proposed technique solves nonlinear problems without using Adomian's polynomials can be considered as a clear advantage of this algorithm over the decomposition method.
You, Qiang; Xu, JinXin; Wang, Gang; Zhang, Zhonghua
2016-01-01
The ordinary least-square fitting with polynomial is used in both the dynamic phase of the watt balance method and the weighting phase of joule balance method but few researches have been conducted to evaluate the uncertainty of the fitting data in the electrical balance methods. In this paper, a matrix-calculation method for evaluating the uncertainty of the polynomial fitting data is derived and the properties of this method are studied by simulation. Based on this, another two derived methods are proposed. One is used to find the optimal fitting order for the watt or joule balance methods. Accuracy and effective factors of this method are experimented with simulations. The other is used to evaluate the uncertainty of the integral of the fitting data for joule balance, which is demonstrated with an experiment from the NIM-1 joule balance. (paper)
A method for fitting regression splines with varying polynomial order in the linear mixed model.
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.
Higher order polynomial expansion nodal method for hexagonal core neutronics analysis
Jin, Young Cho; Chang, Hyo Kim
1998-01-01
A higher-order polynomial expansion nodal(PEN) method is newly formulated as a means to improve the accuracy of the conventional PEN method solutions to multi-group diffusion equations in hexagonal core geometry. The new method is applied to solving various hexagonal core neutronics benchmark problems. The computational accuracy of the higher order PEN method is then compared with that of the conventional PEN method, the analytic function expansion nodal (AFEN) method, and the ANC-H method. It is demonstrated that the higher order PEN method improves the accuracy of the conventional PEN method and that it compares very well with the other nodal methods like the AFEN and ANC-H methods in accuracy
Higher-order Multivariable Polynomial Regression to Estimate Human Affective States
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.
Sulbhewar, Litesh N; Raveendranath, P
2014-01-01
An efficient piezoelectric smart beam finite element based on Reddy’s third-order displacement field and layerwise linear potential is presented here. The present formulation is based on the coupled polynomial field interpolation of variables, unlike conventional piezoelectric beam formulations that use independent polynomials. Governing equations derived using a variational formulation are used to establish the relationship between field variables. The resulting expressions are used to formulate coupled shape functions. Starting with an assumed cubic polynomial for transverse displacement (w) and a linear polynomial for electric potential (φ), coupled polynomials for axial displacement (u) and section rotation (θ) are found. This leads to a coupled quadratic polynomial representation for axial displacement (u) and section rotation (θ). The formulation allows accommodation of extension–bending, shear–bending and electromechanical couplings at the interpolation level itself, in a variationally consistent manner. The proposed interpolation scheme is shown to eliminate the locking effects exhibited by conventional independent polynomial field interpolations and improve the convergence characteristics of HSDT based piezoelectric beam elements. Also, the present coupled formulation uses only three mechanical degrees of freedom per node, one less than the conventional formulations. Results from numerical test problems prove the accuracy and efficiency of the present formulation. (paper)
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.
Third-order polynomial model for analyzing stickup state laminated structure in flexible electronics
Meng, Xianhong; Wang, Zihao; Liu, Boya; Wang, Shuodao
2018-02-01
Laminated hard-soft integrated structures play a significant role in the fabrication and development of flexible electronics devices. Flexible electronics have advantageous characteristics such as soft and light-weight, can be folded, twisted, flipped inside-out, or be pasted onto other surfaces of arbitrary shapes. In this paper, an analytical model is presented to study the mechanics of laminated hard-soft structures in flexible electronics under a stickup state. Third-order polynomials are used to describe the displacement field, and the principle of virtual work is adopted to derive the governing equations and boundary conditions. The normal strain and the shear stress along the thickness direction in the bi-material region are obtained analytically, which agree well with the results from finite element analysis. The analytical model can be used to analyze stickup state laminated structures, and can serve as a valuable reference for the failure prediction and optimal design of flexible electronics in the future.
Monomiality principle, Sheffer-type polynomials and the normal ordering problem
Penson, K A; Blasiak, P; Dattoli, G; Duchamp, G H E; Horzela, A; Solomon, A I
2006-01-01
We solve the boson normal ordering problem for (q(a † )a + v(a † )) n with arbitrary functions q(x) and v(x) and integer n, where a and a † are boson annihilation and creation operators, satisfying [a, a † ] = 1. This consequently provides the solution for the exponential e λ(q(a † )a+v(a † )) generalizing the shift operator. In the course of these considerations we define and explore the monomiality principle and find its representations. We exploit the properties of Sheffer-type polynomials which constitute the inherent structure of this problem. In the end we give some examples illustrating the utility of the method and point out the relation to combinatorial structures
Dattoli, G.; Lorenzutta, S.; Cesarano, C.; Sacchetti, D.
2000-01-01
Operational methods are used to provide a different point of view on the theory of Kampe' de Feriet-Bell polynomials. The method here proposed can be exploited to simplify the formalism associated with this family of polynomials and may provide advantages in computation. It suggests their extension to classes of multi-index families, whole role in application is discussed [it
Exact polynomial solutions of second order differential equations and their applications
Zhang Yaozhong
2012-01-01
We find all polynomials Z(z) such that the differential equation where X(z), Y(z), Z(z) are polynomials of degree at most 4, 3, 2, respectively, has polynomial solutions S(z) = ∏ n i=1 (z − z i ) of degree n with distinct roots z i . We derive a set of n algebraic equations which determine these roots. We also find all polynomials Z(z) which give polynomial solutions to the differential equation when the coefficients of X(z) and Y(z) are algebraically dependent. As applications to our general results, we obtain the exact (closed-form) solutions of the Schrödinger-type differential equations describing: (1) two Coulombically repelling electrons on a sphere; (2) Schrödinger equation from the kink stability analysis of φ 6 -type field theory; (3) static perturbations for the non-extremal Reissner–Nordström solution; (4) planar Dirac electron in Coulomb and magnetic fields; and (5) O(N) invariant decatic anharmonic oscillator. (paper)
Wei Wei
2013-01-01
Full Text Available Since Wireless sensor networks (WSNs are dramatically being arranged in mission-critical applications,it changes into necessary that we consider application requirements in Internet of Things. We try to use WSNs to assist information query and navigation within a practical parking spaces environment. Integrated with high-performance OFDM by piece-wise polynomial approximation, we present a new method that is based on a diffusion equation and a position equation to accomplish the navigation process conveniently and efficiently. From the point of view of theoretical analysis, our jobs hold the lower constraint condition and several inappropriate navigation can be amended. Information diffusion and potential field are introduced to reach the goal of accurate navigation and gradient descent method is applied in the algorithm. Formula derivations and simulations manifest that the method facilitates the solution of typical sensor network configuration information navigation. Concurrently, we also treat channel estimation and ICI mitigation for very high mobility OFDM systems, and the communication is between a BS and mobile target at a terrible scenario. The scheme proposed here combines the piece-wise polynomial expansion to approximate timevariations of multipath channels. Two near symbols are applied to estimate the first-and second-order parameters. So as to improve the estimation accuracy and mitigate the ICI caused by pilot-aided estimation, the multipath channel parameters were reestimated in timedomain employing the decided OFDM symbol. Simulation results show that this method would improve system performance in a complex environment.
High Resolution of the ECG Signal by Polynomial Approximation
G. Rozinaj
2006-04-01
Full Text Available Averaging techniques as temporal averaging and space averaging have been successfully used in many applications for attenuating interference [6], [7], [8], [9], [10]. In this paper we introduce interference removing of the ECG signal by polynomial approximation, with smoothing discrete dependencies, to make up for averaging methods. The method is suitable for low-level signals of the electrical activity of the heart often less than 10 m V. Most low-level signals arising from PR, ST and TP segments which can be detected eventually and their physiologic meaning can be appreciated. Of special importance for the diagnostic of the electrical activity of the heart is the activity bundle of His between P and R waveforms. We have established an artificial sine wave to ECG signal between P and R wave. The aim focus is to verify the smoothing method by polynomial approximation if the SNR (signal-to-noise ratio is negative (i.e. a signal is lower than noise.
Saber, Ahmed Yousuf; Chakraborty, Shantanu; Abdur Razzak, S.M.; Senjyu, Tomonobu
2009-01-01
This paper presents a modified particle swarm optimization (MPSO) for constrained economic load dispatch (ELD) problem. Real cost functions are more complex than conventional second order cost functions when multi-fuel operations, valve-point effects, accurate curve fitting, etc., are considering in deregulated changing market. The proposed modified particle swarm optimization (PSO) consists of problem dependent variable number of promising values (in velocity vector), unit vector and error-iteration dependent step length. It reliably and accurately tracks a continuously changing solution of the complex cost function and no extra concentration/effort is needed for the complex higher order cost polynomials in ELD. Constraint management is incorporated in the modified PSO. The modified PSO has balance between local and global searching abilities, and an appropriate fitness function helps to converge it quickly. To avoid the method to be frozen, stagnated/idle particles are reset. Sensitivity of the higher order cost polynomials is also analyzed visually to realize the importance of the higher order cost polynomials for the optimization of ELD. Finally, benchmark data sets and methods are used to show the effectiveness of the proposed method. (author)
Ernest G. Kalnins
2013-10-01
Full Text Available We show explicitly that all 2nd order superintegrable systems in 2 dimensions are limiting cases of a single system: the generic 3-parameter potential on the 2-sphere, S9 in our listing. We extend the Wigner-Inönü method of Lie algebra contractions to contractions of quadratic algebras and show that all of the quadratic symmetry algebras of these systems are contractions of that of S9. Amazingly, all of the relevant contractions of these superintegrable systems on flat space and the sphere are uniquely induced by the well known Lie algebra contractions of e(2 and so(3. By contracting function space realizations of irreducible representations of the S9 algebra (which give the structure equations for Racah/Wilson polynomials to the other superintegrable systems, and using Wigner's idea of ''saving'' a representation, we obtain the full Askey scheme of hypergeometric orthogonal polynomials. This relationship directly ties the polynomials and their structure equations to physical phenomena. It is more general because it applies to all special functions that arise from these systems via separation of variables, not just those of hypergeometric type, and it extends to higher dimensions.
Intra-cavity generation of high order LGpl modes
Ngcobo, S
2012-08-01
Full Text Available with the location of the Laguerre polynomial zeros. The Diffractive optical element is used to shape the TEM00 Gaussian beam and force the laser to operate on a higher order LGpl Laguerre-Gaussian modes or high order superposition of Laguerre-Gaussian modes...
Superiority of legendre polynomials to Chebyshev polynomial in ...
In this paper, we proved the superiority of Legendre polynomial to Chebyshev polynomial in solving first order ordinary differential equation with rational coefficient. We generated shifted polynomial of Chebyshev, Legendre and Canonical polynomials which deal with solving differential equation by first choosing Chebyshev ...
Time-Frequency Analysis Using Warped-Based High-Order Phase Modeling
Ioana Cornel
2005-01-01
Full Text Available The high-order ambiguity function (HAF was introduced for the estimation of polynomial-phase signals (PPS embedded in noise. Since the HAF is a nonlinear operator, it suffers from noise-masking effects and from the appearance of undesired cross-terms when multicomponents PPS are analyzed. In order to improve the performances of the HAF, the multi-lag HAF concept was proposed. Based on this approach, several advanced methods (e.g., product high-order ambiguity function (PHAF have been recently proposed. Nevertheless, performances of these new methods are affected by the error propagation effect which drastically limits the order of the polynomial approximation. This phenomenon acts especially when a high-order polynomial modeling is needed: representation of the digital modulation signals or the acoustic transient signals. This effect is caused by the technique used for polynomial order reduction, common for existing approaches: signal multiplication with the complex conjugated exponentials formed with the estimated coefficients. In this paper, we introduce an alternative method to reduce the polynomial order, based on the successive unitary signal transformation, according to each polynomial order. We will prove that this method reduces considerably the effect of error propagation. Namely, with this order reduction method, the estimation error at a given order will depend only on the performances of the estimation method.
Method of applying single higher order polynomial basis function over multiple domains
Lysko, AA
2010-03-01
Full Text Available . Derivation of the computational complexity in terms of oating point operations (FLOP) showed a possible speed gain nearly an order of the number of unknowns of direct MoM. 1. INTRODUCTION The process of numerical electromagnetic modeling may be split... into several stages [1], including geometry representation/modeling, representation/modeling of the current distribution, solution of the equations, and computation of the radiation and other parameters. A dominant majority of existing theoretical frameworks...
A generalized polynomial chaos based ensemble Kalman filter with high accuracy
Li Jia; Xiu Dongbin
2009-01-01
As one of the most adopted sequential data assimilation methods in many areas, especially those involving complex nonlinear dynamics, the ensemble Kalman filter (EnKF) has been under extensive investigation regarding its properties and efficiency. Compared to other variants of the Kalman filter (KF), EnKF is straightforward to implement, as it employs random ensembles to represent solution states. This, however, introduces sampling errors that affect the accuracy of EnKF in a negative manner. Though sampling errors can be easily reduced by using a large number of samples, in practice this is undesirable as each ensemble member is a solution of the system of state equations and can be time consuming to compute for large-scale problems. In this paper we present an efficient EnKF implementation via generalized polynomial chaos (gPC) expansion. The key ingredients of the proposed approach involve (1) solving the system of stochastic state equations via the gPC methodology to gain efficiency; and (2) sampling the gPC approximation of the stochastic solution with an arbitrarily large number of samples, at virtually no additional computational cost, to drastically reduce the sampling errors. The resulting algorithm thus achieves a high accuracy at reduced computational cost, compared to the classical implementations of EnKF. Numerical examples are provided to verify the convergence property and accuracy improvement of the new algorithm. We also prove that for linear systems with Gaussian noise, the first-order gPC Kalman filter method is equivalent to the exact Kalman filter.
Polynomial Heisenberg algebras
Carballo, Juan M; C, David J Fernandez; Negro, Javier; Nieto, Luis M
2004-01-01
Polynomial deformations of the Heisenberg algebra are studied in detail. Some of their natural realizations are given by the higher order susy partners (and not only by those of first order, as is already known) of the harmonic oscillator for even-order polynomials. Here, it is shown that the susy partners of the radial oscillator play a similar role when the order of the polynomial is odd. Moreover, it will be proved that the general systems ruled by such kinds of algebras, in the quadratic and cubic cases, involve Painleve transcendents of types IV and V, respectively
Freud, Géza
1971-01-01
Orthogonal Polynomials contains an up-to-date survey of the general theory of orthogonal polynomials. It deals with the problem of polynomials and reveals that the sequence of these polynomials forms an orthogonal system with respect to a non-negative m-distribution defined on the real numerical axis. Comprised of five chapters, the book begins with the fundamental properties of orthogonal polynomials. After discussing the momentum problem, it then explains the quadrature procedure, the convergence theory, and G. Szegő's theory. This book is useful for those who intend to use it as referenc
Jianping Liu
2016-01-01
Full Text Available An operational matrix technique is proposed to solve variable order fractional differential-integral equation based on the second kind of Chebyshev polynomials in this paper. The differential operational matrix and integral operational matrix are derived based on the second kind of Chebyshev polynomials. Using two types of operational matrixes, the original equation is transformed into the arithmetic product of several dependent matrixes, which can be viewed as an algebraic system after adopting the collocation points. Further, numerical solution of original equation is obtained by solving the algebraic system. Finally, several examples show that the numerical algorithm is computationally efficient.
Liu, Y.; Zheng, L.; Pau, G. S. H.
2016-12-01
A careful assessment of the risk associated with geologic CO2 storage is critical to the deployment of large-scale storage projects. While numerical modeling is an indispensable tool for risk assessment, there has been increasing need in considering and addressing uncertainties in the numerical models. However, uncertainty analyses have been significantly hindered by the computational complexity of the model. As a remedy, reduced-order models (ROM), which serve as computationally efficient surrogates for high-fidelity models (HFM), have been employed. The ROM is constructed at the expense of an initial set of HFM simulations, and afterwards can be relied upon to predict the model output values at minimal cost. The ROM presented here is part of National Risk Assessment Program (NRAP) and intends to predict the water quality change in groundwater in response to hypothetical CO2 and brine leakage. The HFM based on which the ROM is derived is a multiphase flow and reactive transport model, with 3-D heterogeneous flow field and complex chemical reactions including aqueous complexation, mineral dissolution/precipitation, adsorption/desorption via surface complexation and cation exchange. Reduced-order modeling techniques based on polynomial basis expansion, such as polynomial chaos expansion (PCE), are widely used in the literature. However, the accuracy of such ROMs can be affected by the sparse structure of the coefficients of the expansion. Failing to identify vanishing polynomial coefficients introduces unnecessary sampling errors, the accumulation of which deteriorates the accuracy of the ROMs. To address this issue, we treat the PCE as a sparse Bayesian learning (SBL) problem, and the sparsity is obtained by detecting and including only the non-zero PCE coefficients one at a time by iteratively selecting the most contributing coefficients. The computational complexity due to predicting the entire 3-D concentration fields is further mitigated by a dimension
Ohtani, H; Ito, A M; Hagita, K; Kato, T; Saitoh, T; Takeda, T
2013-01-01
We propose in this paper a data compression scheme for large-scale particle simulations, which has favorable prospects for scientific visualization of particle systems. Our data compression concepts deal with the data of particle orbits obtained by simulation directly and have the following features: (i) Through control over the compression scheme, the difference between the simulation variables and the reconstructed values for the visualization from the compressed data becomes smaller than a given constant. (ii) The particles in the simulation are regarded as independent particles and the time-series data for each particle is compressed with an independent time-step for the particle. (iii) A particle trajectory is approximated by a polynomial function based on the characteristic motion of the particle. It is reconstructed as a continuous curve through interpolation from the values of the function for intermediate values of the sample data. We name this concept ''TOKI (Time-Order Kinetic Irreversible compression)''. In this paper, we present an example of an implementation of a data-compression scheme with the above features. Several application results are shown for plasma and galaxy formation simulation data
Spline-based high-accuracy piecewise-polynomial phase-to-sinusoid amplitude converters.
Petrinović, Davor; Brezović, Marko
2011-04-01
We propose a method for direct digital frequency synthesis (DDS) using a cubic spline piecewise-polynomial model for a phase-to-sinusoid amplitude converter (PSAC). This method offers maximum smoothness of the output signal. Closed-form expressions for the cubic polynomial coefficients are derived in the spectral domain and the performance analysis of the model is given in the time and frequency domains. We derive the closed-form performance bounds of such DDS using conventional metrics: rms and maximum absolute errors (MAE) and maximum spurious free dynamic range (SFDR) measured in the discrete time domain. The main advantages of the proposed PSAC are its simplicity, analytical tractability, and inherent numerical stability for high table resolutions. Detailed guidelines for a fixed-point implementation are given, based on the algebraic analysis of all quantization effects. The results are verified on 81 PSAC configurations with the output resolutions from 5 to 41 bits by using a bit-exact simulation. The VHDL implementation of a high-accuracy DDS based on the proposed PSAC with 28-bit input phase word and 32-bit output value achieves SFDR of its digital output signal between 180 and 207 dB, with a signal-to-noise ratio of 192 dB. Its implementation requires only one 18 kB block RAM and three 18-bit embedded multipliers in a typical field-programmable gate array (FPGA) device. © 2011 IEEE
Stochastic Estimation via Polynomial Chaos
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
Fan Hong-Yi; Wang Zhen
2014-01-01
For directly normalizing the photon non-Gaussian states (e.g., photon added and subtracted squeezed states), we use the method of integration within an ordered product (IWOP) of operators to derive some new bosonic operator-ordering identities. We also derive some new integration transformation formulas about one- and two-variable Hermite polynomials in complex function space. These operator identities and associative integration formulas provide much convenience for constructing non-Gaussian states in quantum engineering. (general)
Symmetric integrable-polynomial factorization for symplectic one-turn-map tracking
Shi, Jicong
1993-01-01
It was found that any homogeneous polynomial can be written as a sum of integrable polynomials of the same degree which Lie transformations can be evaluated exactly. By utilizing symplectic integrators, an integrable-polynomial factorization is developed to convert a symplectic map in the form of Dragt-Finn factorization into a product of Lie transformations associated with integrable polynomials. A small number of factorization bases of integrable polynomials enable one to use high order symplectic integrators so that the high-order spurious terms can be greatly suppressed. A symplectic map can thus be evaluated with desired accuracy
Ren, Zhengyong; Zhong, Yiyuan; Chen, Chaojian; Tang, Jingtian; Kalscheuer, Thomas; Maurer, Hansruedi; Li, Yang
2018-03-01
During the last 20 years, geophysicists have developed great interest in using gravity gradient tensor signals to study bodies of anomalous density in the Earth. Deriving exact solutions of the gravity gradient tensor signals has become a dominating task in exploration geophysics or geodetic fields. In this study, we developed a compact and simple framework to derive exact solutions of gravity gradient tensor measurements for polyhedral bodies, in which the density contrast is represented by a general polynomial function. The polynomial mass contrast can continuously vary in both horizontal and vertical directions. In our framework, the original three-dimensional volume integral of gravity gradient tensor signals is transformed into a set of one-dimensional line integrals along edges of the polyhedral body by sequentially invoking the volume and surface gradient (divergence) theorems. In terms of an orthogonal local coordinate system defined on these edges, exact solutions are derived for these line integrals. We successfully derived a set of unified exact solutions of gravity gradient tensors for constant, linear, quadratic and cubic polynomial orders. The exact solutions for constant and linear cases cover all previously published vertex-type exact solutions of the gravity gradient tensor for a polygonal body, though the associated algorithms may differ in numerical stability. In addition, to our best knowledge, it is the first time that exact solutions of gravity gradient tensor signals are derived for a polyhedral body with a polynomial mass contrast of order higher than one (that is quadratic and cubic orders). Three synthetic models (a prismatic body with depth-dependent density contrasts, an irregular polyhedron with linear density contrast and a tetrahedral body with horizontally and vertically varying density contrasts) are used to verify the correctness and the efficiency of our newly developed closed-form solutions. Excellent agreements are obtained
High order depletion sensitivity analysis
Naguib, K.; Adib, M.; Morcos, H.N.
2002-01-01
A high order depletion sensitivity method was applied to calculate the sensitivities of build-up of actinides in the irradiated fuel due to cross-section uncertainties. An iteration method based on Taylor series expansion was applied to construct stationary principle, from which all orders of perturbations were calculated. The irradiated EK-10 and MTR-20 fuels at their maximum burn-up of 25% and 65% respectively were considered for sensitivity analysis. The results of calculation show that, in case of EK-10 fuel (low burn-up), the first order sensitivity was found to be enough to perform an accuracy of 1%. While in case of MTR-20 (high burn-up) the fifth order was found to provide 3% accuracy. A computer code SENS was developed to provide the required calculations
Tu Gaoqiao
2016-01-01
Full Text Available Using maximum expansion pressure of n-decane, the aeroengine burner-inner-liner combustion pressure load is computed. Aerodynamic loads are obtained from internal gas pressure load and gas momentum. Multi-load second-order Taylor series equations are established using multi-variant polynomials and their sensitivities. Optimal designs are carried out using various performance index constraints. When 0.25 to 0.8 rectifications of different design variants are implemented, they converge under 5×10‒4 d-norm difference ratio.
Efficiency of High Order Spectral Element Methods on Petascale Architectures
Hutchinson, Maxwell; Heinecke, Alexander; Pabst, Hans; Henry, Greg; Parsani, Matteo; Keyes, David E.
2016-01-01
High order methods for the solution of PDEs expose a tradeoff between computational cost and accuracy on a per degree of freedom basis. In many cases, the cost increases due to higher arithmetic intensity while affecting data movement minimally. As architectures tend towards wider vector instructions and expect higher arithmetic intensities, the best order for a particular simulation may change. This study highlights preferred orders by identifying the high order efficiency frontier of the spectral element method implemented in Nek5000 and NekBox: the set of orders and meshes that minimize computational cost at fixed accuracy. First, we extract Nek’s order-dependent computational kernels and demonstrate exceptional hardware utilization by hardware-aware implementations. Then, we perform productionscale calculations of the nonlinear single mode Rayleigh-Taylor instability on BlueGene/Q and Cray XC40-based supercomputers to highlight the influence of the architecture. Accuracy is defined with respect to physical observables, and computational costs are measured by the corehour charge of the entire application. The total number of grid points needed to achieve a given accuracy is reduced by increasing the polynomial order. On the XC40 and BlueGene/Q, polynomial orders as high as 31 and 15 come at no marginal cost per timestep, respectively. Taken together, these observations lead to a strong preference for high order discretizations that use fewer degrees of freedom. From a performance point of view, we demonstrate up to 60% full application bandwidth utilization at scale and achieve ≈1PFlop/s of compute performance in Nek’s most flop-intense methods.
Efficiency of High Order Spectral Element Methods on Petascale Architectures
Hutchinson, Maxwell
2016-06-14
High order methods for the solution of PDEs expose a tradeoff between computational cost and accuracy on a per degree of freedom basis. In many cases, the cost increases due to higher arithmetic intensity while affecting data movement minimally. As architectures tend towards wider vector instructions and expect higher arithmetic intensities, the best order for a particular simulation may change. This study highlights preferred orders by identifying the high order efficiency frontier of the spectral element method implemented in Nek5000 and NekBox: the set of orders and meshes that minimize computational cost at fixed accuracy. First, we extract Nek’s order-dependent computational kernels and demonstrate exceptional hardware utilization by hardware-aware implementations. Then, we perform productionscale calculations of the nonlinear single mode Rayleigh-Taylor instability on BlueGene/Q and Cray XC40-based supercomputers to highlight the influence of the architecture. Accuracy is defined with respect to physical observables, and computational costs are measured by the corehour charge of the entire application. The total number of grid points needed to achieve a given accuracy is reduced by increasing the polynomial order. On the XC40 and BlueGene/Q, polynomial orders as high as 31 and 15 come at no marginal cost per timestep, respectively. Taken together, these observations lead to a strong preference for high order discretizations that use fewer degrees of freedom. From a performance point of view, we demonstrate up to 60% full application bandwidth utilization at scale and achieve ≈1PFlop/s of compute performance in Nek’s most flop-intense methods.
High order spectral difference lattice Boltzmann method for incompressible hydrodynamics
Li, Weidong
2017-09-01
This work presents a lattice Boltzmann equation (LBE) based high order spectral difference method for incompressible flows. In the present method, the spectral difference (SD) method is adopted to discretize the convection and collision term of the LBE to obtain high order (≥3) accuracy. Because the SD scheme represents the solution as cell local polynomials and the solution polynomials have good tensor-product property, the present spectral difference lattice Boltzmann method (SD-LBM) can be implemented on arbitrary unstructured quadrilateral meshes for effective and efficient treatment of complex geometries. Thanks to only first oder PDEs involved in the LBE, no special techniques, such as hybridizable discontinuous Galerkin method (HDG), local discontinuous Galerkin method (LDG) and so on, are needed to discrete diffusion term, and thus, it simplifies the algorithm and implementation of the high order spectral difference method for simulating viscous flows. The proposed SD-LBM is validated with four incompressible flow benchmarks in two-dimensions: (a) the Poiseuille flow driven by a constant body force; (b) the lid-driven cavity flow without singularity at the two top corners-Burggraf flow; and (c) the unsteady Taylor-Green vortex flow; (d) the Blasius boundary-layer flow past a flat plate. Computational results are compared with analytical solutions of these cases and convergence studies of these cases are also given. The designed accuracy of the proposed SD-LBM is clearly verified.
Kawakami, H [Kyushu Univ., Beppu, Oita (Japan). Inst. of Balneotherapeutics
1980-09-01
A computer program written in FORTRAN is described for determining the secondary energy of the electron beam which passed through a flattening foil, using a time-sharing computer service. The procedure of this program is first to fit the specific higher order polynomial to the measured percentage depth dose curve. Next, the practical range is evaluated by the point of intersection R of the line tangent to the fitted curve at the inflection point P and the given dose E, as shown in Fig. 2. Finally, the secondary energy corresponded to the determined practical range can be obtained by the experimental equation (2.1) between the practial range R (g/cm/sup 2/) and the electron energy T (MeV). A graph for the fitted polynomial with the inflection points and the practical range can be plotted on a teletype machine by request of user. In order to estimate the shapes of percentage depth dose curves correspond to the electron beams of different energies, we tried to find some specific functional relationships between each coefficient of the fitted seventh-degree equation and the incident electron energies. However, exact relationships could not be obtained for irreguarity among these coefficients.
High-order computer-assisted estimates of topological entropy
Grote, Johannes
The concept of Taylor Models is introduced, which offers highly accurate C0-estimates for the enclosures of functional dependencies, combining high-order Taylor polynomial approximation of functions and rigorous estimates of the truncation error, performed using verified interval arithmetic. The focus of this work is on the application of Taylor Models in algorithms for strongly nonlinear dynamical systems. A method to obtain sharp rigorous enclosures of Poincare maps for certain types of flows and surfaces is developed and numerical examples are presented. Differential algebraic techniques allow the efficient and accurate computation of polynomial approximations for invariant curves of certain planar maps around hyperbolic fixed points. Subsequently we introduce a procedure to extend these polynomial curves to verified Taylor Model enclosures of local invariant manifolds with C0-errors of size 10-10--10 -14, and proceed to generate the global invariant manifold tangle up to comparable accuracy through iteration in Taylor Model arithmetic. Knowledge of the global manifold structure up to finite iterations of the local manifold pieces enables us to find all homoclinic and heteroclinic intersections in the generated manifold tangle. Combined with the mapping properties of the homoclinic points and their ordering we are able to construct a subshift of finite type as a topological factor of the original planar system to obtain rigorous lower bounds for its topological entropy. This construction is fully automatic and yields homoclinic tangles with several hundred homoclinic points. As an example rigorous lower bounds for the topological entropy of the Henon map are computed, which to the best knowledge of the authors yield the largest such estimates published so far.
Miller, Willard Jr
2014-01-01
We describe a contraction theory for 2nd order superintegrable systems, showing that all such systems in 2 dimensions are limiting cases of a single system: the generic 3-parameter potential on the 2-sphere, S9 in our listing. Analogously, all of the quadratic symmetry algebras of these systems can be obtained by a sequence of contractions starting from S9. By contracting function space realizations of irreducible representations of the S9 algebra (which give the structure equations for Racah/Wilson polynomials) to the other superintegrable systems one obtains the full Askey scheme of orthogonal hypergeometric polynomials.This relates the scheme directly to explicitly solvable quantum mechanical systems. Amazingly, 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). The present paper concentrates on describing this intimate link between Lie algebra and superintegrable system contractions, with the detailed calculations presented elsewhere. Joint work with E. Kalnins, S. Post, E. Subag and R. Heinonen.
Martin, P.; Zamudio-Cristi, J.
1982-01-01
A method is described to obtain fractional approximations for linear first order differential equations with polynomial coefficients. This approximation can give good accuracy in a large region of the complex variable plane that may include all the real axis. The parameters of the approximation are solutions of algebraic equations obtained through the coefficients of the highest and lowest power of the variable after the sustitution of the fractional approximation in the differential equation. The method is more general than the asymptotical Pade method, and it is not required to determine the power series or asymptotical expansion. A simple approximation for the exponential integral is found, which give three exact digits for most of the real values of the variable. Approximations of higher accuracy and of the same degree than other authors are also obtained. (Author) [pt
High Order Finite Element Method for the Lambda modes problem on hexagonal geometry
Gonzalez-Pintor, S.; Ginestar, D.; Verdu, G.
2009-01-01
A High Order Finite Element Method to approximate the Lambda modes problem for reactors with hexagonal geometry has been developed. This method is based on the expansion of the neutron flux in terms of the modified Dubiner's polynomials on a triangular mesh. This mesh is fixed and the accuracy of the method is improved increasing the degree of the polynomial expansions without the necessity of remeshing. The performance of method has been tested obtaining the dominant Lambda modes of different 2D reactor benchmark problems.
Dobrev, Veselin A. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Kolev, Tzanio V. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Rieben, Robert N. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2012-09-20
The numerical approximation of the Euler equations of gas dynamics in a movingLagrangian frame is at the heart of many multiphysics simulation algorithms. Here, we present a general framework for high-order Lagrangian discretization of these compressible shock hydrodynamics equations using curvilinear finite elements. This method is an extension of the approach outlined in [Dobrev et al., Internat. J. Numer. Methods Fluids, 65 (2010), pp. 1295--1310] and can be formulated for any finite dimensional approximation of the kinematic and thermodynamic fields, including generic finite elements on two- and three-dimensional meshes with triangular, quadrilateral, tetrahedral, or hexahedral zones. We discretize the kinematic variables of position and velocity using a continuous high-order basis function expansion of arbitrary polynomial degree which is obtained via a corresponding high-order parametric mapping from a standard reference element. This enables the use of curvilinear zone geometry, higher-order approximations for fields within a zone, and a pointwise definition of mass conservation which we refer to as strong mass conservation. Moreover, we discretize the internal energy using a piecewise discontinuous high-order basis function expansion which is also of arbitrary polynomial degree. This facilitates multimaterial hydrodynamics by treating material properties, such as equations of state and constitutive models, as piecewise discontinuous functions which vary within a zone. To satisfy the Rankine--Hugoniot jump conditions at a shock boundary and generate the appropriate entropy, we introduce a general tensor artificial viscosity which takes advantage of the high-order kinematic and thermodynamic information available in each zone. Finally, we apply a generic high-order time discretization process to the semidiscrete equations to develop the fully discrete numerical algorithm. Our method can be viewed as the high-order generalization of the so-called staggered
High order P-G finite elements for convection-dominated problems
Carmo, E.D. do; Galeao, A.C.
1989-06-01
From the error analysis presented in this paper it is shown that de CCAU method derived by Dutra do Carmo and Galeao [3] preserves the same order of approximation obtained with SUPH (cf. Books and Hughes [2]) when advection-diffusion regular solutions are considered, and improves the accuracy of the approximate boundary layer solution when high order interpolating polynomials are used near sharp layers [pt
High-Order Hamilton's Principle and the Hamilton's Principle of High-Order Lagrangian Function
Zhao Hongxia; Ma Shanjun
2008-01-01
In this paper, based on the theorem of the high-order velocity energy, integration and variation principle, the high-order Hamilton's principle of general holonomic systems is given. Then, three-order Lagrangian equations and four-order Lagrangian equations are obtained from the high-order Hamilton's principle. Finally, the Hamilton's principle of high-order Lagrangian function is given.
Multiscale high-order/low-order (HOLO) algorithms and applications
Chacón, L.; Chen, G.; Knoll, D.A.; Newman, C.; Park, H.; Taitano, W.; Willert, J.A.; Womeldorff, G.
2017-01-01
We review the state of the art in the formulation, implementation, and performance of so-called high-order/low-order (HOLO) algorithms for challenging multiscale problems. HOLO algorithms attempt to couple one or several high-complexity physical models (the high-order model, HO) with low-complexity ones (the low-order model, LO). The primary goal of HOLO algorithms is to achieve nonlinear convergence between HO and LO components while minimizing memory footprint and managing the computational complexity in a practical manner. Key to the HOLO approach is the use of the LO representations to address temporal stiffness, effectively accelerating the convergence of the HO/LO coupled system. The HOLO approach is broadly underpinned by the concept of nonlinear elimination, which enables segregation of the HO and LO components in ways that can effectively use heterogeneous architectures. The accuracy and efficiency benefits of HOLO algorithms are demonstrated with specific applications to radiation transport, gas dynamics, plasmas (both Eulerian and Lagrangian formulations), and ocean modeling. Across this broad application spectrum, HOLO algorithms achieve significant accuracy improvements at a fraction of the cost compared to conventional approaches. It follows that HOLO algorithms hold significant potential for high-fidelity system scale multiscale simulations leveraging exascale computing.
Multiscale high-order/low-order (HOLO) algorithms and applications
Chacón, L., E-mail: chacon@lanl.gov [Los Alamos National Laboratory, Los Alamos, NM 87545 (United States); Chen, G.; Knoll, D.A.; Newman, C.; Park, H.; Taitano, W. [Los Alamos National Laboratory, Los Alamos, NM 87545 (United States); Willert, J.A. [Institute for Defense Analyses, Alexandria, VA 22311 (United States); Womeldorff, G. [Los Alamos National Laboratory, Los Alamos, NM 87545 (United States)
2017-02-01
We review the state of the art in the formulation, implementation, and performance of so-called high-order/low-order (HOLO) algorithms for challenging multiscale problems. HOLO algorithms attempt to couple one or several high-complexity physical models (the high-order model, HO) with low-complexity ones (the low-order model, LO). The primary goal of HOLO algorithms is to achieve nonlinear convergence between HO and LO components while minimizing memory footprint and managing the computational complexity in a practical manner. Key to the HOLO approach is the use of the LO representations to address temporal stiffness, effectively accelerating the convergence of the HO/LO coupled system. The HOLO approach is broadly underpinned by the concept of nonlinear elimination, which enables segregation of the HO and LO components in ways that can effectively use heterogeneous architectures. The accuracy and efficiency benefits of HOLO algorithms are demonstrated with specific applications to radiation transport, gas dynamics, plasmas (both Eulerian and Lagrangian formulations), and ocean modeling. Across this broad application spectrum, HOLO algorithms achieve significant accuracy improvements at a fraction of the cost compared to conventional approaches. It follows that HOLO algorithms hold significant potential for high-fidelity system scale multiscale simulations leveraging exascale computing.
On Generalisation of Polynomials in Complex Plane
Maslina Darus
2010-01-01
Full Text Available The generalised Bell and Laguerre polynomials of fractional-order in complex z-plane are defined. Some properties are studied. Moreover, we proved that these polynomials are univalent solutions for second order differential equations. Also, the Laguerre-type of some special functions are introduced.
Dual exponential polynomials and linear differential equations
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.
Dirichlet polynomials, majorization, and trumping
Pereira, Rajesh; Plosker, Sarah
2013-01-01
Majorization and trumping are two partial orders which have proved useful in quantum information theory. We show some relations between these two partial orders and generalized Dirichlet polynomials, Mellin transforms, and completely monotone functions. These relations are used to prove a succinct generalization of Turgut’s characterization of trumping. (paper)
High-Order Frequency-Locked Loops
Golestan, Saeed; Guerrero, Josep M.; Quintero, Juan Carlos Vasquez
2017-01-01
In very recent years, some attempts for designing high-order frequency-locked loops (FLLs) have been made. Nevertheless, the advantages and disadvantages of these structures, particularly in comparison with a standard FLL and high-order phase-locked loops (PLLs), are rather unclear. This lack...... study, and its small-signal modeling, stability analysis, and parameter tuning are presented. Finally, to gain insight about advantages and disadvantages of high-order FLLs, a theoretical and experimental performance comparison between the designed second-order FLL and a standard FLL (first-order FLL...
On polynomial solutions of the Heun equation
Gurappa, N; Panigrahi, Prasanta K
2004-01-01
By making use of a recently developed method to solve linear differential equations of arbitrary order, we find a wide class of polynomial solutions to the Heun equation. We construct the series solution to the Heun equation before identifying the polynomial solutions. The Heun equation extended by the addition of a term, -σ/x, is also amenable for polynomial solutions. (letter to the editor)
Hybrid High-Order methods for finite deformations of hyperelastic materials
Abbas, Mickaël; Ern, Alexandre; Pignet, Nicolas
2018-01-01
We devise and evaluate numerically Hybrid High-Order (HHO) methods for hyperelastic materials undergoing finite deformations. The HHO methods use as discrete unknowns piecewise polynomials of order k≥1 on the mesh skeleton, together with cell-based polynomials that can be eliminated locally by static condensation. The discrete problem is written as the minimization of a broken nonlinear elastic energy where a local reconstruction of the displacement gradient is used. Two HHO methods are considered: a stabilized method where the gradient is reconstructed as a tensor-valued polynomial of order k and a stabilization is added to the discrete energy functional, and an unstabilized method which reconstructs a stable higher-order gradient and circumvents the need for stabilization. Both methods satisfy the principle of virtual work locally with equilibrated tractions. We present a numerical study of the two HHO methods on test cases with known solution and on more challenging three-dimensional test cases including finite deformations with strong shear layers and cavitating voids. We assess the computational efficiency of both methods, and we compare our results to those obtained with an industrial software using conforming finite elements and to results from the literature. The two HHO methods exhibit robust behavior in the quasi-incompressible regime.
Irreducible multivariate polynomials obtained from polynomials in ...
Hall, 1409 W. Green Street, Urbana, IL 61801, USA. E-mail: Nicolae. ... Theorem A. If we write an irreducible polynomial f ∈ K[X] as a sum of polynomials a0,..., an ..... This shows us that deg ai = (n − i) deg f2 for each i = 0,..., n, so min k>0.
Ghosh, Shubhrangshu
2017-09-01
The correlated and coupled dynamics of accretion and outflow around black holes (BHs) are essentially governed by the fundamental laws of conservation as outflow extracts matter, momentum and energy from the accretion region. Here we analyze a robust form of 2.5-dimensional viscous, resistive, advective magnetized accretion-outflow coupling in BH systems. We solve the complete set of coupled MHD conservation equations self-consistently, through invoking a generalized polynomial expansion in two dimensions. We perform a critical analysis of the accretion-outflow region and provide a complete quasi-analytical family of solutions for advective flows. We obtain the physically plausible outflow solutions at high turbulent viscosity parameter α (≳ 0.3), and at a reduced scale-height, as magnetic stresses compress or squeeze the flow region. We found that the value of the large-scale poloidal magnetic field B P is enhanced with the increase of the geometrical thickness of the accretion flow. On the other hand, differential magnetic torque (-{r}2{\\bar{B}}\\varphi {\\bar{B}}z) increases with the increase in \\dot{M}. {\\bar{B}}{{P}}, -{r}2{\\bar{B}}\\varphi {\\bar{B}}z as well as the plasma beta β P get strongly augmented with the increase in the value of α, enhancing the transport of vertical flux outwards. Our solutions indicate that magnetocentrifugal acceleration plausibly plays a dominant role in effusing out plasma from the radial accretion flow in a moderately advective paradigm which is more centrifugally dominated. However in a strongly advective paradigm it is likely that the thermal pressure gradient would play a more contributory role in the vertical transport of plasma.
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.
Branched polynomial covering maps
Hansen, Vagn Lundsgaard
1999-01-01
A Weierstrass polynomial with multiple roots in certain points leads to a branched covering map. With this as the guiding example, we formally define and study the notion of a branched polynomial covering map. We shall prove that many finite covering maps are polynomial outside a discrete branch...... set. Particular studies are made of branched polynomial covering maps arising from Riemann surfaces and from knots in the 3-sphere....
Bai , Shi; Bouvier , Cyril; Kruppa , Alexander; Zimmermann , Paul
2016-01-01
International audience; The general number field sieve (GNFS) is the most efficient algo-rithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The quality of the selected polynomials can be modelled in terms of size and root properties. We propose a new kind of polynomials for GNFS: with a new degree of freedom, we further improve the size property. We demonstrate the efficiency of our algorithm by exhibiting a better polynomial tha...
New polynomial-based molecular descriptors with low degeneracy.
Matthias Dehmer
Full Text Available In this paper, we introduce a novel graph polynomial called the 'information polynomial' of a graph. This graph polynomial can be derived by using a probability distribution of the vertex set. By using the zeros of the obtained polynomial, we additionally define some novel spectral descriptors. Compared with those based on computing the ordinary characteristic polynomial of a graph, we perform a numerical study using real chemical databases. We obtain that the novel descriptors do have a high discrimination power.
Recursive regularization step for high-order lattice Boltzmann methods
Coreixas, Christophe; Wissocq, Gauthier; Puigt, Guillaume; Boussuge, Jean-François; Sagaut, Pierre
2017-09-01
A lattice Boltzmann method (LBM) with enhanced stability and accuracy is presented for various Hermite tensor-based lattice structures. The collision operator relies on a regularization step, which is here improved through a recursive computation of nonequilibrium Hermite polynomial coefficients. In addition to the reduced computational cost of this procedure with respect to the standard one, the recursive step allows to considerably enhance the stability and accuracy of the numerical scheme by properly filtering out second- (and higher-) order nonhydrodynamic contributions in under-resolved conditions. This is first shown in the isothermal case where the simulation of the doubly periodic shear layer is performed with a Reynolds number ranging from 104 to 106, and where a thorough analysis of the case at Re=3 ×104 is conducted. In the latter, results obtained using both regularization steps are compared against the Bhatnagar-Gross-Krook LBM for standard (D2Q9) and high-order (D2V17 and D2V37) lattice structures, confirming the tremendous increase of stability range of the proposed approach. Further comparisons on thermal and fully compressible flows, using the general extension of this procedure, are then conducted through the numerical simulation of Sod shock tubes with the D2V37 lattice. They confirm the stability increase induced by the recursive approach as compared with the standard one.
Zeros and uniqueness of Q-difference polynomials of meromorphic ...
Meromorphic functions; Nevanlinna theory; logarithmic order; uniqueness problem; difference-differential polynomial. Abstract. In this paper, we investigate the value distribution of -difference polynomials of meromorphic function of finite logarithmic order, and study the zero distribution of difference-differential polynomials ...
Cosmographic analysis with Chebyshev polynomials
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.
Contributions to fuzzy polynomial techniques for stability analysis and control
Pitarch Pérez, José Luis
2014-01-01
The present thesis employs fuzzy-polynomial control techniques in order to improve the stability analysis and control of nonlinear systems. Initially, it reviews the more extended techniques in the field of Takagi-Sugeno fuzzy systems, such as the more relevant results about polynomial and fuzzy polynomial systems. The basic framework uses fuzzy polynomial models by Taylor series and sum-of-squares techniques (semidefinite programming) in order to obtain stability guarantees...
A Polynomial Optimization Approach to Constant Rebalanced Portfolio Selection
Takano, Y.; Sotirov, R.
2010-01-01
We address the multi-period portfolio optimization problem with the constant rebalancing strategy. This problem is formulated as a polynomial optimization problem (POP) by using a mean-variance criterion. In order to solve the POPs of high degree, we develop a cutting-plane algorithm based on
A polynomial optimization approach to constant rebalanced portfolio selection
Takano, Y.; Sotirov, R.
2012-01-01
We address the multi-period portfolio optimization problem with the constant rebalancing strategy. This problem is formulated as a polynomial optimization problem (POP) by using a mean-variance criterion. In order to solve the POPs of high degree, we develop a cutting-plane algorithm based on
Branched polynomial covering maps
Hansen, Vagn Lundsgaard
2002-01-01
A Weierstrass polynomial with multiple roots in certain points leads to a branched covering map. With this as the guiding example, we formally define and study the notion of a branched polynomial covering map. We shall prove that many finite covering maps are polynomial outside a discrete branch ...... set. Particular studies are made of branched polynomial covering maps arising from Riemann surfaces and from knots in the 3-sphere. (C) 2001 Elsevier Science B.V. All rights reserved.......A Weierstrass polynomial with multiple roots in certain points leads to a branched covering map. With this as the guiding example, we formally define and study the notion of a branched polynomial covering map. We shall prove that many finite covering maps are polynomial outside a discrete branch...
High-order passive photonic temporal integrators.
Asghari, Mohammad H; Wang, Chao; Yao, Jianping; Azaña, José
2010-04-15
We experimentally demonstrate, for the first time to our knowledge, an ultrafast photonic high-order (second-order) complex-field temporal integrator. The demonstrated device uses a single apodized uniform-period fiber Bragg grating (FBG), and it is based on a general FBG design approach for implementing optimized arbitrary-order photonic passive temporal integrators. Using this same design approach, we also fabricate and test a first-order passive temporal integrator offering an energetic-efficiency improvement of more than 1 order of magnitude as compared with previously reported passive first-order temporal integrators. Accurate and efficient first- and second-order temporal integrations of ultrafast complex-field optical signals (with temporal features as fast as approximately 2.5ps) are successfully demonstrated using the fabricated FBG devices.
High-order beam optics - an overview
Heighway, E.A.
1989-01-01
Beam-transport codes have been around for as long as thirty years and high order codes, second-order at least, for close to twenty years. Before this period of design-code development, there was considerable high-order treatment, but it was almost entirely analytical. History has a way of repeating itself, and the current excitement in the field of high-order optics is based on the application of Lie algebra and the so-called differential algebra to beam-transport codes, both of which are highly analytical in foundation. The author will describe some of the main design tools available today, giving a little of their history, and will conclude by trying to convey some of the excitement in the field through a brief description of Lie and differential algebra. 30 refs., 7 figs., 1 tab
Polynomial regression analysis and significance test of the regression function
Gao Zhengming; Zhao Juan; He Shengping
2012-01-01
In order to analyze the decay heating power of a certain radioactive isotope per kilogram with polynomial regression method, the paper firstly demonstrated the broad usage of polynomial function and deduced its parameters with ordinary least squares estimate. Then significance test method of polynomial regression function is derived considering the similarity between the polynomial regression model and the multivariable linear regression model. Finally, polynomial regression analysis and significance test of the polynomial function are done to the decay heating power of the iso tope per kilogram in accord with the authors' real work. (authors)
Bioinspired Nanocomposite Hydrogels with Highly Ordered Structures.
Zhao, Ziguang; Fang, Ruochen; Rong, Qinfeng; Liu, Mingjie
2017-12-01
In the human body, many soft tissues with hierarchically ordered composite structures, such as cartilage, skeletal muscle, the corneas, and blood vessels, exhibit highly anisotropic mechanical strength and functionality to adapt to complex environments. In artificial soft materials, hydrogels are analogous to these biological soft tissues due to their "soft and wet" properties, their biocompatibility, and their elastic performance. However, conventional hydrogel materials with unordered homogeneous structures inevitably lack high mechanical properties and anisotropic functional performances; thus, their further application is limited. Inspired by biological soft tissues with well-ordered structures, researchers have increasingly investigated highly ordered nanocomposite hydrogels as functional biological engineering soft materials with unique mechanical, optical, and biological properties. These hydrogels incorporate long-range ordered nanocomposite structures within hydrogel network matrixes. Here, the critical design criteria and the state-of-the-art fabrication strategies of nanocomposite hydrogels with highly ordered structures are systemically reviewed. Then, recent progress in applications in the fields of soft actuators, tissue engineering, and sensors is highlighted. The future development and prospective application of highly ordered nanocomposite hydrogels are also discussed. © 2017 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Chromatic polynomials of random graphs
Van Bussel, Frank; Fliegner, Denny; Timme, Marc; Ehrlich, Christoph; Stolzenberg, Sebastian
2010-01-01
Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very small, very sparse or highly structured. Recent algorithmic advances (Timme et al 2009 New J. Phys. 11 023001) now make it possible to compute chromatic polynomials for moderately sized graphs of arbitrary structure and number of edges. Here we present chromatic polynomials of ensembles of random graphs with up to 30 vertices, over the entire range of edge density. We specifically focus on the locations of the zeros of the polynomial in the complex plane. The results indicate that the chromatic zeros of random graphs have a very consistent layout. In particular, the crossing point, the point at which the chromatic zeros with non-zero imaginary part approach the real axis, scales linearly with the average degree over most of the density range. While the scaling laws obtained are purely empirical, if they continue to hold in general there are significant implications: the crossing points of chromatic zeros in the thermodynamic limit separate systems with zero ground state entropy from systems with positive ground state entropy, the latter an exception to the third law of thermodynamics.
Mojtaba Rasouli Gandomani
2016-06-01
Full Text Available In this paper, the model of HIV infection of CD4+ T cells is considered as a system of fractional differential equations. Then, a numerical method by using collocation method based on the Müntz-Legendre polynomials to approximate solution of the model is presented. The application of the proposed numerical method causes fractional differential equations system to convert into the algebraic equations system. The new system can be solved by one of the existing methods. Finally, we compare the result of this numerical method with the result of the methods have already been presented in the literature.
Uniqueness and zeros of q-shift difference polynomials
In this paper, we consider the zero distributions of -shift difference polynomials of meromorphic functions with zero order, and obtain two theorems that extend the classical Hayman results on the zeros of differential polynomials to -shift difference polynomials. We also investigate the uniqueness problem of -shift ...
Degenerate r-Stirling Numbers and r-Bell Polynomials
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.
High order Poisson Solver for unbounded flows
Hejlesen, Mads Mølholm; Rasmussen, Johannes Tophøj; Chatelain, Philippe
2015-01-01
This paper presents a high order method for solving the unbounded Poisson equation on a regular mesh using a Green’s function solution. The high order convergence was achieved by formulating mollified integration kernels, that were derived from a filter regularisation of the solution field....... The method was implemented on a rectangular domain using fast Fourier transforms (FFT) to increase computational efficiency. The Poisson solver was extended to directly solve the derivatives of the solution. This is achieved either by including the differential operator in the integration kernel...... the equations of fluid mechanics as an example, but can be used in many physical problems to solve the Poisson equation on a rectangular unbounded domain. For the two-dimensional case we propose an infinitely smooth test function which allows for arbitrary high order convergence. Using Gaussian smoothing...
A High Order Theory for Linear Thermoelastic Shells: Comparison with Classical Theories
V. V. Zozulya
2013-01-01
Full Text Available A high order theory for linear thermoelasticity and heat conductivity of shells has been developed. The proposed theory is based on expansion of the 3-D equations of theory of thermoelasticity and heat conductivity into Fourier series in terms of Legendre polynomials. The first physical quantities that describe thermodynamic state have been expanded into Fourier series in terms of Legendre polynomials with respect to a thickness coordinate. Thereby all equations of elasticity and heat conductivity including generalized Hooke's and Fourier's laws have been transformed to the corresponding equations for coefficients of the polynomial expansion. Then in the same way as in the 3D theories system of differential equations in terms of displacements and boundary conditions for Fourier coefficients has been obtained. First approximation theory is considered in more detail. The obtained equations for the first approximation theory are compared with the corresponding equations for Timoshenko's and Kirchhoff-Love's theories. Special case of plates and cylindrical shell is also considered, and corresponding equations in displacements are presented.
Nodal DG-FEM solution of high-order Boussinesq-type equations
Engsig-Karup, Allan Peter; Hesthaven, Jan S.; Bingham, Harry B.
2006-01-01
We present a discontinuous Galerkin finite element method (DG-FEM) solution to a set of high-order Boussinesq-type equations for modelling highly nonlinear and dispersive water waves in one and two horizontal dimensions. The continuous equations are discretized using nodal polynomial basis...... functions of arbitrary order in space on each element of an unstructured computational domain. A fourth order explicit Runge-Kutta scheme is used to advance the solution in time. Methods for introducing artificial damping to control mild nonlinear instabilities are also discussed. The accuracy...... and convergence of the model with both h (grid size) and p (order) refinement are verified for the linearized equations, and calculations are provided for two nonlinear test cases in one horizontal dimension: harmonic generation over a submerged bar; and reflection of a steep solitary wave from a vertical wall...
High-order nonlinear susceptibilities of He
Liu, W.C.; Clark, C.W.
1996-01-01
High-order nonlinear optical response of noble gases to intense laser radiation is of considerable experimental interest, but is difficult to measure or calculate accurately. The authors have begun a set of calculations of frequency-dependent nonlinear susceptibilities of He 1s, within the framework of Rayleigh=Schroedinger perturbation theory at lowest applicable order, with the goal of providing critically evaluated atomic data for modelling high harmonic generation processes. The atomic Hamiltonian is decomposed in term of Hylleraas coordinates and spherical harmonics using the formalism of Ponte and Shakeshaft, and the hierarchy of inhomogeneous equations of perturbation theory is solved iteratively. A combination of Hylleraas and Frankowski basis functions is used; the compact Hylleraas basis provides a highly accurate representation of the ground state wavefunction, whereas the diffuse Frankowski basis functions efficiently reproduce the correct asymptotic structure of the perturbed orbitals
Weierstrass polynomials for links
Hansen, Vagn Lundsgaard
1997-01-01
There is a natural way of identifying links in3-space with polynomial covering spaces over thecircle. Thereby any link in 3-space can be definedby a Weierstrass polynomial over the circle. Theequivalence relation for covering spaces over thecircle is, however, completely different from...
Nonnegativity of uncertain polynomials
iljak Dragoslav D.
1998-01-01
Full Text Available The purpose of this paper is to derive tests for robust nonnegativity of scalar and matrix polynomials, which are algebraic, recursive, and can be completed in finite number of steps. Polytopic families of polynomials are considered with various characterizations of parameter uncertainty including affine, multilinear, and polynomic structures. The zero exclusion condition for polynomial positivity is also proposed for general parameter dependencies. By reformulating the robust stability problem of complex polynomials as positivity of real polynomials, we obtain new sufficient conditions for robust stability involving multilinear structures, which can be tested using only real arithmetic. The obtained results are applied to robust matrix factorization, strict positive realness, and absolute stability of multivariable systems involving parameter dependent transfer function matrices.
Many-body orthogonal polynomial systems
Witte, N.S.
1997-03-01
The fundamental methods employed in the moment problem, involving orthogonal polynomial systems, the Lanczos algorithm, continued fraction analysis and Pade approximants has been combined with a cumulant approach and applied to the extensive many-body problem in physics. This has yielded many new exact results for many-body systems in the thermodynamic limit - for the ground state energy, for excited state gaps, for arbitrary ground state avenges - and are of a nonperturbative nature. These results flow from a confluence property of the three-term recurrence coefficients arising and define a general class of many-body orthogonal polynomials. These theorems constitute an analytical solution to the Lanczos algorithm in that they are expressed in terms of the three-term recurrence coefficients α and β. These results can also be applied approximately for non-solvable models in the form of an expansion, in a descending series of the system size. The zeroth order order this expansion is just the manifestation of the central limit theorem in which a Gaussian measure and hermite polynomials arise. The first order represents the first non-trivial order, in which classical distribution functions like the binomial distributions arise and the associated class of orthogonal polynomials are Meixner polynomials. Amongst examples of systems which have infinite order in the expansion are q-orthogonal polynomials where q depends on the system size in a particular way. (author)
Neck curve polynomials in neck rupture model
Kurniadi, Rizal; Perkasa, Yudha S.; Waris, Abdul
2012-01-01
The Neck Rupture Model is a model that explains the scission process which has smallest radius in liquid drop at certain position. Old fashion of rupture position is determined randomly so that has been called as Random Neck Rupture Model (RNRM). The neck curve polynomials have been employed in the Neck Rupture Model for calculation the fission yield of neutron induced fission reaction of 280 X 90 with changing of order of polynomials as well as temperature. The neck curve polynomials approximation shows the important effects in shaping of fission yield curve.
High-order nonuniformly correlated beams
Wu, Dan; Wang, Fei; Cai, Yangjian
2018-02-01
We have introduced a class of partially coherent beams with spatially varying correlations named high-order nonuniformly correlated (HNUC) beams, as an extension of conventional nonuniformly correlated (NUC) beams. Such beams bring a new parameter (mode order) which is used to tailor the spatial coherence properties. The behavior of the spectral density of the HNUC beams on propagation has been investigated through numerical examples with the help of discrete model decomposition and fast Fourier transform (FFT) algorithm. Our results reveal that by selecting the mode order appropriately, the more sharpened intensity maxima can be achieved at a certain propagation distance compared to that of the NUC beams, and the lateral shift of the intensity maxima on propagation is closed related to the mode order. Furthermore, analytical expressions for the r.m.s width and the propagation factor of the HNUC beams on free-space propagation are derived by means of Wigner distribution function. The influence of initial beam parameters on the evolution of the r.m.s width and the propagation factor, and the relation between the r.m.s width and the occurring of the sharpened intensity maxima on propagation have been studied and discussed in detail.
High order corrections to the renormalon
Faleev, S.V.
1997-01-01
High order corrections to the renormalon are considered. Each new type of insertion into the renormalon chain of graphs generates a correction to the asymptotics of perturbation theory of the order of ∝1. However, this series of corrections to the asymptotics is not the asymptotic one (i.e. the mth correction does not grow like m.). The summation of these corrections for the UV renormalon may change the asymptotics by a factor N δ . For the traditional IR renormalon the mth correction diverges like (-2) m . However, this divergence has no infrared origin and may be removed by a proper redefinition of the IR renormalon. On the other hand, for IR renormalons in hadronic event shapes one should naturally expect these multiloop contributions to decrease like (-2) -m . Some problems expected upon reaching the best accuracy of perturbative QCD are also discussed. (orig.)
Generalizations of orthogonal polynomials
Bultheel, A.; Cuyt, A.; van Assche, W.; van Barel, M.; Verdonk, B.
2005-07-01
We give a survey of recent generalizations of orthogonal polynomials. That includes multidimensional (matrix and vector orthogonal polynomials) and multivariate versions, multipole (orthogonal rational functions) variants, and extensions of the orthogonality conditions (multiple orthogonality). Most of these generalizations are inspired by the applications in which they are applied. We also give a glimpse of these applications, which are usually generalizations of applications where classical orthogonal polynomials also play a fundamental role: moment problems, numerical quadrature, rational approximation, linear algebra, recurrence relations, and random matrices.
High order harmonic generation from plasma mirror
Thaury, C.
2008-09-01
When an intense laser beam is focused on a solid target, its surface is rapidly ionized and forms a dense plasma that reflects the incident field. For laser intensities above few 10 15 W/cm 2 , high order harmonics of the laser frequency, associated in the time domain to a train of atto-second pulses (1 as = 10 18 s), can be generated upon this reflection. Because such a plasma mirror can be used with arbitrarily high laser intensities, this process should eventually lead to the production of very intense pulses in the X-ray domain. In this thesis, we demonstrate that for laser intensities about 10 19 W/cm 2 , two mechanisms can contribute to the generation of high order harmonics: the coherent wake emission and the relativistic emission. These two mechanisms are studied both theoretically and experimentally. In particular, we show that, thanks to very different properties, the harmonics generated by these two processes can be unambiguously distinguished experimentally. We then investigate the phase properties of the harmonic, in the spectral and in the spatial domain. Finally, we illustrate how to exploit the coherence of the generation mechanisms to get information on the dynamics of the plasma electrons. (author)
Extended biorthogonal matrix polynomials
Ayman Shehata
2017-01-01
Full Text Available The pair of biorthogonal matrix polynomials for commutative matrices were first introduced by Varma and Tasdelen in [22]. The main aim of this paper is to extend the properties of the pair of biorthogonal matrix polynomials of Varma and Tasdelen and certain generating matrix functions, finite series, some matrix recurrence relations, several important properties of matrix differential recurrence relations, biorthogonality relations and matrix differential equation for the pair of biorthogonal matrix polynomials J(A,B n (x, k and K(A,B n (x, k are discussed. For the matrix polynomials J(A,B n (x, k, various families of bilinear and bilateral generating matrix functions are constructed in the sequel.
High Order Semi-Lagrangian Advection Scheme
Malaga, Carlos; Mandujano, Francisco; Becerra, Julian
2014-11-01
In most fluid phenomena, advection plays an important roll. A numerical scheme capable of making quantitative predictions and simulations must compute correctly the advection terms appearing in the equations governing fluid flow. Here we present a high order forward semi-Lagrangian numerical scheme specifically tailored to compute material derivatives. The scheme relies on the geometrical interpretation of material derivatives to compute the time evolution of fields on grids that deform with the material fluid domain, an interpolating procedure of arbitrary order that preserves the moments of the interpolated distributions, and a nonlinear mapping strategy to perform interpolations between undeformed and deformed grids. Additionally, a discontinuity criterion was implemented to deal with discontinuous fields and shocks. Tests of pure advection, shock formation and nonlinear phenomena are presented to show performance and convergence of the scheme. The high computational cost is considerably reduced when implemented on massively parallel architectures found in graphic cards. The authors acknowledge funding from Fondo Sectorial CONACYT-SENER Grant Number 42536 (DGAJ-SPI-34-170412-217).
Golden, Ryan; Cho, Ilwoo
2015-01-01
In this paper, we study structure theorems of algebras of symmetric functions. Based on a certain relation on elementary symmetric polynomials generating such algebras, we consider perturbation in the algebras. In particular, we understand generators of the algebras as perturbations. From such perturbations, define injective maps on generators, which induce algebra-monomorphisms (or embeddings) on the algebras. They provide inductive structure theorems on algebras of symmetric polynomials. As...
High-Order Model and Dynamic Filtering for Frame Rate Up-Conversion.
Bao, Wenbo; Zhang, Xiaoyun; Chen, Li; Ding, Lianghui; Gao, Zhiyong
2018-08-01
This paper proposes a novel frame rate up-conversion method through high-order model and dynamic filtering (HOMDF) for video pixels. Unlike the constant brightness and linear motion assumptions in traditional methods, the intensity and position of the video pixels are both modeled with high-order polynomials in terms of time. Then, the key problem of our method is to estimate the polynomial coefficients that represent the pixel's intensity variation, velocity, and acceleration. We propose to solve it with two energy objectives: one minimizes the auto-regressive prediction error of intensity variation by its past samples, and the other minimizes video frame's reconstruction error along the motion trajectory. To efficiently address the optimization problem for these coefficients, we propose the dynamic filtering solution inspired by video's temporal coherence. The optimal estimation of these coefficients is reformulated into a dynamic fusion of the prior estimate from pixel's temporal predecessor and the maximum likelihood estimate from current new observation. Finally, frame rate up-conversion is implemented using motion-compensated interpolation by pixel-wise intensity variation and motion trajectory. Benefited from the advanced model and dynamic filtering, the interpolated frame has much better visual quality. Extensive experiments on the natural and synthesized videos demonstrate the superiority of HOMDF over the state-of-the-art methods in both subjective and objective comparisons.
Chromatic polynomials for simplicial complexes
Møller, Jesper Michael; Nord, Gesche
2016-01-01
In this note we consider s s -chromatic polynomials for finite simplicial complexes. When s=1 s=1 , the 1 1 -chromatic polynomial is just the usual graph chromatic polynomial of the 1 1 -skeleton. In general, the s s -chromatic polynomial depends on the s s -skeleton and its value at r...
Mir Mustafizur Rahman
2014-11-01
Full Text Available Thermal Infrared (TIR remote sensing images of urban environments are increasingly available from airborne and satellite platforms. However, limited access to high-spatial resolution (H-res: ~1 m TIR satellite images requires the use of TIR airborne sensors for mapping large complex urban surfaces, especially at micro-scales. A critical limitation of such H-res mapping is the need to acquire a large scene composed of multiple flight lines and mosaic them together. This results in the same scene components (e.g., roads, buildings, green space and water exhibiting different temperatures in different flight lines. To mitigate these effects, linear relative radiometric normalization (RRN techniques are often applied. However, the Earth’s surface is composed of features whose thermal behaviour is characterized by complexity and non-linearity. Therefore, we hypothesize that non-linear RRN techniques should demonstrate increased radiometric agreement over similar linear techniques. To test this hypothesis, this paper evaluates four (linear and non-linear RRN techniques, including: (i histogram matching (HM; (ii pseudo-invariant feature-based polynomial regression (PIF_Poly; (iii no-change stratified random sample-based linear regression (NCSRS_Lin; and (iv no-change stratified random sample-based polynomial regression (NCSRS_Poly; two of which (ii and iv are newly proposed non-linear techniques. When applied over two adjacent flight lines (~70 km2 of TABI-1800 airborne data, visual and statistical results show that both new non-linear techniques improved radiometric agreement over the previously evaluated linear techniques, with the new fully-automated method, NCSRS-based polynomial regression, providing the highest improvement in radiometric agreement between the master and the slave images, at ~56%. This is ~5% higher than the best previously evaluated linear technique (NCSRS-based linear regression.
High order harmonic generation from plasma mirrors
George, H.
2010-01-01
When an intense laser beam is focused on a solid target, the target's surface is rapidly ionized and forms dense plasma that reflects the incident field. For laser intensities above few 10 to the power of 15 Wcm -2 , high order harmonics of the laser frequency, associated in the time domain to a train of atto-second pulses (1 as 10 -18 s), can be generated upon this reflection. In this thesis, we developed numerical tools to reveal original aspects of harmonic generation mechanisms in three different interaction regime: the coherent wake emission, the relativistic emission and the resonant absorption. In particular, we established the role of these mechanisms when the target is a very thin foil (thickness of the order of 100 nm). Then we study experimentally the spectral, spatial and coherence properties of the emitted light. We illustrate how to exploit these measurements to get information on the plasma mirror dynamics on the femtosecond and atto-second time scales. Last, we propose a technique for the single-shot complete characterization of the temporal structure of the harmonic light emission from the laser-plasma mirror interaction. (author)
A new class of generalized polynomials associated with Hermite and Bernoulli polynomials
M. A. Pathan
2015-05-01
Full Text Available In this paper, we introduce a new class of generalized polynomials associated with the modified Milne-Thomson's polynomials Φ_{n}^{(α}(x,ν of degree n and order α introduced by Derre and Simsek.The concepts of Bernoulli numbers B_n, Bernoulli polynomials B_n(x, generalized Bernoulli numbers B_n(a,b, generalized Bernoulli polynomials B_n(x;a,b,c of Luo et al, Hermite-Bernoulli polynomials {_HB}_n(x,y of Dattoli et al and {_HB}_n^{(α} (x,y of Pathan are generalized to the one {_HB}_n^{(α}(x,y,a,b,c which is called the generalized polynomial depending on three positive real parameters. Numerous properties of these polynomials and some relationships between B_n, B_n(x, B_n(a,b, B_n(x;a,b,c and {}_HB_n^{(α}(x,y;a,b,c are established. Some implicit summation formulae and general symmetry identities are derived by using different analytical means and applying generating functions. These results extend some known summations and identities of generalized Bernoulli numbers and polynomials
Compressive sampling of polynomial chaos expansions: Convergence analysis and sampling strategies
Hampton, Jerrad; Doostan, Alireza
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 ℓ 1 -minimization problem. Utilizing results for orthogonal polynomials, we bound the coherence parameter for polynomials of Hermite and Legendre type under their respective natural sampling distribution. In both polynomial bases we identify an importance sampling distribution which yields a bound with weaker dependence on the order of the approximation. For more general orthonormal bases, we propose the coherence-optimal sampling: a Markov Chain Monte Carlo sampling, which directly uses the basis functions under consideration to achieve a statistical optimality among all sampling schemes with identical support. We demonstrate these different sampling strategies numerically in both high-order and high-dimensional, manufactured PC expansions. In addition, the quality of each sampling method is compared in the identification of solutions to two differential equations, one with a high-dimensional random input and the other with a high-order PC expansion. In both cases, the coherence-optimal sampling scheme leads to similar or considerably improved accuracy
Compressive sampling of polynomial chaos expansions: Convergence analysis and sampling strategies
Hampton, Jerrad; Doostan, Alireza
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 ℓ1-minimization problem. Utilizing results for orthogonal polynomials, we bound the coherence parameter for polynomials of Hermite and Legendre type under their respective natural sampling distribution. In both polynomial bases we identify an importance sampling distribution which yields a bound with weaker dependence on the order of the approximation. For more general orthonormal bases, we propose the coherence-optimal sampling: a Markov Chain Monte Carlo sampling, which directly uses the basis functions under consideration to achieve a statistical optimality among all sampling schemes with identical support. We demonstrate these different sampling strategies numerically in both high-order and high-dimensional, manufactured PC expansions. In addition, the quality of each sampling method is compared in the identification of solutions to two differential equations, one with a high-dimensional random input and the other with a high-order PC expansion. In both cases, the coherence-optimal sampling scheme leads to similar or considerably improved accuracy.
SAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos
Ahlfeld, R., E-mail: r.ahlfeld14@imperial.ac.uk; Belkouchi, B.; Montomoli, F.
2016-09-01
A new arbitrary Polynomial Chaos (aPC) method is presented for moderately high-dimensional problems characterised by limited input data availability. The proposed methodology improves the algorithm of aPC and extends the method, that was previously only introduced as tensor product expansion, to moderately high-dimensional stochastic problems. The fundamental idea of aPC is to use the statistical moments of the input random variables to develop the polynomial chaos expansion. This approach provides the possibility to propagate continuous or discrete probability density functions and also histograms (data sets) as long as their moments exist, are finite and the determinant of the moment matrix is strictly positive. For cases with limited data availability, this approach avoids bias and fitting errors caused by wrong assumptions. In this work, an alternative way to calculate the aPC is suggested, which provides the optimal polynomials, Gaussian quadrature collocation points and weights from the moments using only a handful of matrix operations on the Hankel matrix of moments. It can therefore be implemented without requiring prior knowledge about statistical data analysis or a detailed understanding of the mathematics of polynomial chaos expansions. The extension to more input variables suggested in this work, is an anisotropic and adaptive version of Smolyak's algorithm that is solely based on the moments of the input probability distributions. It is referred to as SAMBA (PC), which is short for Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos. It is illustrated that for moderately high-dimensional problems (up to 20 different input variables or histograms) SAMBA can significantly simplify the calculation of sparse Gaussian quadrature rules. SAMBA's efficiency for multivariate functions with regard to data availability is further demonstrated by analysing higher order convergence and accuracy for a set of nonlinear test functions with 2, 5
SAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos
Ahlfeld, R.; Belkouchi, B.; Montomoli, F.
2016-01-01
A new arbitrary Polynomial Chaos (aPC) method is presented for moderately high-dimensional problems characterised by limited input data availability. The proposed methodology improves the algorithm of aPC and extends the method, that was previously only introduced as tensor product expansion, to moderately high-dimensional stochastic problems. The fundamental idea of aPC is to use the statistical moments of the input random variables to develop the polynomial chaos expansion. This approach provides the possibility to propagate continuous or discrete probability density functions and also histograms (data sets) as long as their moments exist, are finite and the determinant of the moment matrix is strictly positive. For cases with limited data availability, this approach avoids bias and fitting errors caused by wrong assumptions. In this work, an alternative way to calculate the aPC is suggested, which provides the optimal polynomials, Gaussian quadrature collocation points and weights from the moments using only a handful of matrix operations on the Hankel matrix of moments. It can therefore be implemented without requiring prior knowledge about statistical data analysis or a detailed understanding of the mathematics of polynomial chaos expansions. The extension to more input variables suggested in this work, is an anisotropic and adaptive version of Smolyak's algorithm that is solely based on the moments of the input probability distributions. It is referred to as SAMBA (PC), which is short for Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos. It is illustrated that for moderately high-dimensional problems (up to 20 different input variables or histograms) SAMBA can significantly simplify the calculation of sparse Gaussian quadrature rules. SAMBA's efficiency for multivariate functions with regard to data availability is further demonstrated by analysing higher order convergence and accuracy for a set of nonlinear test functions with 2, 5 and 10
Discriminants and functional equations for polynomials orthogonal on the unit circle
Ismail, M.E.H.; Witte, N.S.
2000-01-01
We derive raising and lowering operators for orthogonal polynomials on the unit circle and find second order differential and q-difference equations for these polynomials. A general functional equation is found which allows one to relate the zeros of the orthogonal polynomials to the stationary values of an explicit quasi-energy and implies recurrences on the orthogonal polynomial coefficients. We also evaluate the discriminants and quantized discriminants of polynomials orthogonal on the unit circle
High order discrete ordinates transport in two dimensions
Arkuszewski, J.J.
1980-01-01
A two-dimensional neutron transport equation in (x,y) geometry is solved by the subdomain version of the weighted residual method. The weight functions are chosen to be characteristic functions of computational boxes (subdomains). In the case of bilinear interpolant the conventional diamond relations are obtained, while the quadratic one produces generalized diamond relations containing first derivatives of the solution. The balance equation remains the same. The derivation yields also additional relations for extrapolating boundary values of derivatives and leaves the room for supplementing the interpolant with specially curtailed higher order polynomials. The method requires only slight modifications in inner iteration process used by conventional discrete ordinates programs, and has been introduced as an option into the program DOT2. The paper contains comparisons of the proposed method with conventional one based on calculations of IAEA-CRP transport theory benchmarks. (author)
Machine Learning Control For Highly Reconfigurable High-Order Systems
2015-01-02
calibration and applications,” Mechatronics and Embedded Systems and Applications (MESA), 2010 IEEE/ASME International Conference on, IEEE, 2010, pp. 38–43...AFRL-OSR-VA-TR-2015-0012 MACHINE LEARNING CONTROL FOR HIGHLY RECONFIGURABLE HIGH-ORDER SYSTEMS John Valasek TEXAS ENGINEERING EXPERIMENT STATION...DIMENSIONAL RECONFIGURABLE SYSTEMS FA9550-11-1-0302 Period of Performance 1 July 2011 – 29 September 2014 John Valasek Aerospace Engineering
Colouring and knot polynomials
Welsh, D.J.A.
1991-01-01
These lectures will attempt to explain a connection between the recent advances in knot theory using the Jones and related knot polynomials with classical problems in combinatorics and statistical mechanics. The difficulty of some of these problems will be analysed in the context of their computational complexity. In particular we shall discuss colourings and groups valued flows in graphs, knots and the Jones and Kauffman polynomials, the Ising, Potts and percolation problems of statistical physics, computational complexity of the above problems. (author). 20 refs, 9 figs
Additive and polynomial representations
Krantz, David H; Suppes, Patrick
1971-01-01
Additive and Polynomial Representations deals with major representation theorems in which the qualitative structure is reflected as some polynomial function of one or more numerical functions defined on the basic entities. Examples are additive expressions of a single measure (such as the probability of disjoint events being the sum of their probabilities), and additive expressions of two measures (such as the logarithm of momentum being the sum of log mass and log velocity terms). The book describes the three basic procedures of fundamental measurement as the mathematical pivot, as the utiliz
High order harmonic generation in rare gases
Budil, Kimberly Susan [Univ. of California, Davis, CA (United States)
1994-05-01
The process of high order harmonic generation in atomic gases has shown great promise as a method of generating extremely short wavelength radiation, extending far into the extreme ultraviolet (XUV). The process is conceptually simple. A very intense laser pulse (I ~10^{13}-10^{14} W/cm^{2}) is focused into a dense (~10^{17} particles/cm^{3}) atomic medium, causing the atoms to become polarized. These atomic dipoles are then coherently driven by the laser field and begin to radiate at odd harmonics of the laser field. This dissertation is a study of both the physical mechanism of harmonic generation as well as its development as a source of coherent XUV radiation. Recently, a semiclassical theory has been proposed which provides a simple, intuitive description of harmonic generation. In this picture the process is treated in two steps. The atom ionizes via tunneling after which its classical motion in the laser field is studied. Electron trajectories which return to the vicinity of the nucleus may recombine and emit a harmonic photon, while those which do not return will ionize. An experiment was performed to test the validity of this model wherein the trajectory of the electron as it orbits the nucleus or ion core is perturbed by driving the process with elliptically, rather than linearly, polarized laser radiation. The semiclassical theory predicts a rapid turn-off of harmonic production as the ellipticity of the driving field is increased. This decrease in harmonic production is observed experimentally and a simple quantum mechanical theory is used to model the data. The second major focus of this work was on development of the harmonic "source". A series of experiments were performed examining the spatial profiles of the harmonics. The quality of the spatial profile is crucial if the harmonics are to be used as the source for experiments, particularly if they must be refocused.
Killings, duality and characteristic polynomials
Á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
Effective high-order solver with thermally perfect gas model for hypersonic heating prediction
Jiang, Zhenhua; Yan, Chao; Yu, Jian; Qu, Feng; Ma, Libin
2016-01-01
Highlights: • Design proper numerical flux for thermally perfect gas. • Line-implicit LUSGS enhances efficiency without extra memory consumption. • Develop unified framework for both second-order MUSCL and fifth-order WENO. • The designed gas model can be applied to much wider temperature range. - Abstract: Effective high-order solver based on the model of thermally perfect gas has been developed for hypersonic heat transfer computation. The technique of polynomial curve fit coupling to thermodynamics equation is suggested to establish the current model and particular attention has been paid to the design of proper numerical flux for thermally perfect gas. We present procedures that unify five-order WENO (Weighted Essentially Non-Oscillatory) scheme in the existing second-order finite volume framework and a line-implicit method that improves the computational efficiency without increasing memory consumption. A variety of hypersonic viscous flows are performed to examine the capability of the resulted high order thermally perfect gas solver. Numerical results demonstrate its superior performance compared to low-order calorically perfect gas method and indicate its potential application to hypersonic heating predictions for real-life problem.
Micropolar curved rods. 2-D, high order, Timoshenko’s and Euler-Bernoulli models
Zozulya V.V.
2017-01-01
Full Text Available New models for micropolar plane curved rods have been developed. 2-D theory is developed from general 2-D equations of linear micropolar elasticity using a special curvilinear system of coordinates related to the middle line of the rod and special hypothesis based on assumptions that take into account the fact that the rod is thin.High order theory is based on the expansion of the equations of the theory of elasticity into Fourier series in terms of Legendre polynomials. First stress and strain tensors,vectors of displacements and rotation and body force shave been expanded into Fourier series in terms of Legendre polynomials with respect to a thickness coordinate.Thereby all equations of elasticity including Hooke’s law have been transformed to the corresponding equations for Fourier coefficients. Then in the same way as in the theory of elasticity, system of differential equations in term of displacements and boundary conditions for Fourier coefficients have been obtained. The Timoshenko’s and Euler-Bernoulli theories are based on the classical hypothesis and 2-D equations of linear micropolar elasticity in a special curvilinear system. The obtained equations can be used to calculate stress-strain and to model thin walled structures in macro, micro and nano scale when taking in to account micropolar couple stress and rotation effects.
Computing derivative-based global sensitivity measures using polynomial chaos expansions
Sudret, B.; Mai, C.V.
2015-01-01
In the field of computer experiments sensitivity analysis aims at quantifying the relative importance of each input parameter (or combinations thereof) of a computational model with respect to the model output uncertainty. Variance decomposition methods leading to the well-known Sobol' indices are recognized as accurate techniques, at a rather high computational cost though. The use of polynomial chaos expansions (PCE) to compute Sobol' indices has allowed to alleviate the computational burden though. However, when dealing with large dimensional input vectors, it is good practice to first use screening methods in order to discard unimportant variables. The derivative-based global sensitivity measures (DGSMs) have been developed recently in this respect. In this paper we show how polynomial chaos expansions may be used to compute analytically DGSMs as a mere post-processing. This requires the analytical derivation of derivatives of the orthonormal polynomials which enter PC expansions. Closed-form expressions for Hermite, Legendre and Laguerre polynomial expansions are given. The efficiency of the approach is illustrated on two well-known benchmark problems in sensitivity analysis. - Highlights: • Derivative-based global sensitivity measures (DGSM) have been developed for screening purpose. • Polynomial chaos expansions (PC) are used as a surrogate model of the original computational model. • From a PC expansion the DGSM can be computed analytically. • The paper provides the derivatives of Hermite, Legendre and Laguerre polynomials for this purpose
A high performance totally ordered multicast protocol
Montgomery, Todd; Whetten, Brian; Kaplan, Simon
1995-01-01
This paper presents the Reliable Multicast Protocol (RMP). RMP provides a totally ordered, reliable, atomic multicast service on top of an unreliable multicast datagram service such as IP Multicasting. RMP is fully and symmetrically distributed so that no site bears un undue portion of the communication load. RMP provides a wide range of guarantees, from unreliable delivery to totally ordered delivery, to K-resilient, majority resilient, and totally resilient atomic delivery. These QoS guarantees are selectable on a per packet basis. RMP provides many communication options, including virtual synchrony, a publisher/subscriber model of message delivery, an implicit naming service, mutually exclusive handlers for messages, and mutually exclusive locks. It has commonly been held that a large performance penalty must be paid in order to implement total ordering -- RMP discounts this. On SparcStation 10's on a 1250 KB/sec Ethernet, RMP provides totally ordered packet delivery to one destination at 842 KB/sec throughput and with 3.1 ms packet latency. The performance stays roughly constant independent of the number of destinations. For two or more destinations on a LAN, RMP provides higher throughput than any protocol that does not use multicast or broadcast.
On the Laurent polynomial rings
Stefanescu, D.
1985-02-01
We describe some properties of the Laurent polynomial rings in a finite number of indeterminates over a commutative unitary ring. We study some subrings of the Laurent polynomial rings. We finally obtain two cancellation properties. (author)
Computing the Alexander Polynomial Numerically
Hansen, Mikael Sonne
2006-01-01
Explains how to construct the Alexander Matrix and how this can be used to compute the Alexander polynomial numerically.......Explains how to construct the Alexander Matrix and how this can be used to compute the Alexander polynomial numerically....
Fast beampattern evaluation by polynomial rooting
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.
High order dark wavefront sensing simulations
Ragazzoni, Roberto; Arcidiacono, Carmelo; Farinato, Jacopo; Viotto, Valentina; Bergomi, Maria; Dima, Marco; Magrin, Demetrio; Marafatto, Luca; Greggio, Davide; Carolo, Elena; Vassallo, Daniele
2016-07-01
Dark wavefront sensing takes shape following quantum mechanics concepts in which one is able to "see" an object in one path of a two-arm interferometer using an as low as desired amount of light actually "hitting" the occulting object. A theoretical way to achieve such a goal, but in the realm of wavefront sensing, is represented by a combination of two unequal beams interferometer sharing the same incoming light, and whose difference in path length is continuously adjusted in order to show different signals for different signs of the incoming perturbation. Furthermore, in order to obtain this in white light, the path difference should be properly adjusted vs the wavelength used. While we incidentally describe how this could be achieved in a true optomechanical setup, we focus our attention to the simulation of a hypothetical "perfect" dark wavefront sensor of this kind in which white light compensation is accomplished in a perfect manner and the gain is selectable in a numerical fashion. Although this would represent a sort of idealized dark wavefront sensor that would probably be hard to match in the real glass and metal, it would also give a firm indication of the maximum achievable gain or, in other words, of the prize for achieving such device. Details of how the simulation code works and first numerical results are outlined along with the perspective for an in-depth analysis of the performances and its extension to more realistic situations, including various sources of additional noise.
Polynomial optimization : Error analysis and applications
Sun, Zhao
2015-01-01
Polynomial optimization is the problem of minimizing a polynomial function subject to polynomial inequality constraints. In this thesis we investigate several hierarchies of relaxations for polynomial optimization problems. Our main interest lies in understanding their performance, in particular how
Computational Performance of a Parallelized Three-Dimensional High-Order Spectral Element Toolbox
Bosshard, Christoph; Bouffanais, Roland; Clémençon, Christian; Deville, Michel O.; Fiétier, Nicolas; Gruber, Ralf; Kehtari, Sohrab; Keller, Vincent; Latt, Jonas
In this paper, a comprehensive performance review of an MPI-based high-order three-dimensional spectral element method C++ toolbox is presented. The focus is put on the performance evaluation of several aspects with a particular emphasis on the parallel efficiency. The performance evaluation is analyzed with help of a time prediction model based on a parameterization of the application and the hardware resources. A tailor-made CFD computation benchmark case is introduced and used to carry out this review, stressing the particular interest for clusters with up to 8192 cores. Some problems in the parallel implementation have been detected and corrected. The theoretical complexities with respect to the number of elements, to the polynomial degree, and to communication needs are correctly reproduced. It is concluded that this type of code has a nearly perfect speed up on machines with thousands of cores, and is ready to make the step to next-generation petaflop machines.
A high-order time-accurate interrogation method for time-resolved PIV
Lynch, Kyle; Scarano, Fulvio
2013-01-01
A novel method is introduced for increasing the accuracy and extending the dynamic range of time-resolved particle image velocimetry (PIV). The approach extends the concept of particle tracking velocimetry by multiple frames to the pattern tracking by cross-correlation analysis as employed in PIV. The working principle is based on tracking the patterned fluid element, within a chosen interrogation window, along its individual trajectory throughout an image sequence. In contrast to image-pair interrogation methods, the fluid trajectory correlation concept deals with variable velocity along curved trajectories and non-zero tangential acceleration during the observed time interval. As a result, the velocity magnitude and its direction are allowed to evolve in a nonlinear fashion along the fluid element trajectory. The continuum deformation (namely spatial derivatives of the velocity vector) is accounted for by adopting local image deformation. The principle offers important reductions of the measurement error based on three main points: by enlarging the temporal measurement interval, the relative error becomes reduced; secondly, the random and peak-locking errors are reduced by the use of least-squares polynomial fits to individual trajectories; finally, the introduction of high-order (nonlinear) fitting functions provides the basis for reducing the truncation error. Lastly, the instantaneous velocity is evaluated as the temporal derivative of the polynomial representation of the fluid parcel position in time. The principal features of this algorithm are compared with a single-pair iterative image deformation method. Synthetic image sequences are considered with steady flow (translation, shear and rotation) illustrating the increase of measurement precision. An experimental data set obtained by time-resolved PIV measurements of a circular jet is used to verify the robustness of the method on image sequences affected by camera noise and three-dimensional motions. In
High order QED corrections in Z physics
Marck, S.C. van der.
1991-01-01
In this thesis a number of calculations of higher order QED corrections are presented, all applying to the standard LEP/SLC processes e + e - → f-bar f, where f stands for any fermion. In cases where f≠ e - , ν e , the above process is only possible via annihilation of the incoming electron positron pair. At LEP/SLC this mainly occurs via the production and the subsequent decay of a Z boson, i.e. the cross section is heavily dominated by the Z resonance. These processes and the corrections to them, treated in a semi-analytical way, are discussed (ch. 2). In the case f = e - (Bhabha scattering) the process can also occur via the exchange of a virtual photon in the t-channel. Since the latter contribution is dominant at small scattering angles one has to exclude these angles if one is interested in Z physics. Having excluded that region one has to recalculate all QED corrections (ch. 3). The techniques introduced there enables for the calculation the difference between forward and backward scattering, the forward backward symmetry, for the cases f ≠ e - , ν e (ch. 4). At small scattering angles, where Bhabha scattering is dominated by photon exchange in the t-channel, this process is used in experiments to determine the luminosity of the e + e - accelerator. hence an accurate theoretical description of this process at small angles is of vital interest to the overall normalization of all measurements at LEP/SLC. Ch. 5 gives such a description in a semi-analytical way. The last two chapters discuss Monte Carlo techniques that are used for the cases f≠ e - , ν e . Ch. 6 describes the simulation of two photon bremsstrahlung, which is a second order QED correction effect. The results are compared with results of the semi-analytical treatment in ch. 2. Finally ch. 7 reviews several techniques that have been used to simulate higher order QED corrections for the cases f≠ e - , ν e . (author). 132 refs.; 10 figs.; 16 tabs
Complex Polynomial Vector Fields
Dias, Kealey
vector fields. Since the class of complex polynomial vector fields in the plane is natural to consider, it is remarkable that its study has only begun very recently. There are numerous fundamental questions that are still open, both in the general classification of these vector fields, the decomposition...... of parameter spaces into structurally stable domains, and a description of the bifurcations. For this reason, the talk will focus on these questions for complex polynomial vector fields.......The two branches of dynamical systems, continuous and discrete, correspond to the study of differential equations (vector fields) and iteration of mappings respectively. In holomorphic dynamics, the systems studied are restricted to those described by holomorphic (complex analytic) functions...
Roots of the Chromatic Polynomial
Perrett, Thomas
The chromatic polynomial of a graph G is a univariate polynomial whose evaluation at any positive integer q enumerates the proper q-colourings of G. It was introduced in connection with the famous four colour theorem but has recently found other applications in the field of statistical physics...... extend Thomassen’s technique to the Tutte polynomial and as a consequence, deduce a density result for roots of the Tutte polynomial. This partially answers a conjecture of Jackson and Sokal. Finally, we refocus our attention on the chromatic polynomial and investigate the density of chromatic roots...
Polynomials in algebraic analysis
Multarzyński, Piotr
2012-01-01
The concept of polynomials in the sense of algebraic analysis, for a single right invertible linear operator, was introduced and studied originally by D. Przeworska-Rolewicz \\cite{DPR}. One of the elegant results corresponding with that notion is a purely algebraic version of the Taylor formula, being a generalization of its usual counterpart, well known for functions of one variable. In quantum calculus there are some specific discrete derivations analyzed, which are right invertible linear ...
Complex centers of polynomial differential equations
Mohamad Ali M. Alwash
2007-07-01
Full Text Available We present some results on the existence and nonexistence of centers for polynomial first order ordinary differential equations with complex coefficients. In particular, we show that binomial differential equations without linear terms do not have complex centers. Classes of polynomial differential equations, with more than two terms, are presented that do not have complex centers. We also study the relation between complex centers and the Pugh problem. An algorithm is described to solve the Pugh problem for equations without complex centers. The method of proof involves phase plane analysis of the polar equations and a local study of periodic solutions.
Differential recurrence formulae for orthogonal polynomials
Anton L. W. von Bachhaus
1995-11-01
Full Text Available Part I - By combining a general 2nd-order linear homogeneous ordinary differential equation with the three-term recurrence relation possessed by all orthogonal polynomials, it is shown that sequences of orthogonal polynomials which satisfy a differential equation of the above mentioned type necessarily have a differentiation formula of the type: gn(xY'n(x=fn(xYn(x+Yn-1(x. Part II - A recurrence formula of the form: rn(xY'n(x+sn(xY'n+1(x+tn(xY'n-1(x=0, is derived using the result of Part I.
General Reducibility and Solvability of Polynomial Equations ...
General Reducibility and Solvability of Polynomial Equations. ... Unlike quadratic, cubic, and quartic polynomials, the general quintic and higher degree polynomials cannot be solved algebraically in terms of finite number of additions, ... Galois Theory, Solving Polynomial Systems, Polynomial factorization, Polynomial Ring ...
Polynomial chaos functions and stochastic differential equations
Williams, M.M.R.
2006-01-01
The Karhunen-Loeve procedure and the associated polynomial chaos expansion have been employed to solve a simple first order stochastic differential equation which is typical of transport problems. Because the equation has an analytical solution, it provides a useful test of the efficacy of polynomial chaos. We find that the convergence is very rapid in some cases but that the increased complexity associated with many random variables can lead to very long computational times. The work is illustrated by exact and approximate solutions for the mean, variance and the probability distribution itself. The usefulness of a white noise approximation is also assessed. Extensive numerical results are given which highlight the weaknesses and strengths of polynomial chaos. The general conclusion is that the method is promising but requires further detailed study by application to a practical problem in transport theory
Parallel multigrid smoothing: polynomial versus Gauss-Seidel
Adams, Mark; Brezina, Marian; Hu, Jonathan; Tuminaro, Ray
2003-01-01
Gauss-Seidel is often the smoother of choice within multigrid applications. In the context of unstructured meshes, however, maintaining good parallel efficiency is difficult with multiplicative iterative methods such as Gauss-Seidel. This leads us to consider alternative smoothers. We discuss the computational advantages of polynomial smoothers within parallel multigrid algorithms for positive definite symmetric systems. Two particular polynomials are considered: Chebyshev and a multilevel specific polynomial. The advantages of polynomial smoothing over traditional smoothers such as Gauss-Seidel are illustrated on several applications: Poisson's equation, thin-body elasticity, and eddy current approximations to Maxwell's equations. While parallelizing the Gauss-Seidel method typically involves a compromise between a scalable convergence rate and maintaining high flop rates, polynomial smoothers achieve parallel scalable multigrid convergence rates without sacrificing flop rates. We show that, although parallel computers are the main motivation, polynomial smoothers are often surprisingly competitive with Gauss-Seidel smoothers on serial machines
Parallel multigrid smoothing: polynomial versus Gauss-Seidel
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.
Reliability-based design optimization via high order response surface method
Li, Hong Shuang
2013-01-01
To reduce the computational effort of reliability-based design optimization (RBDO), the response surface method (RSM) has been widely used to evaluate reliability constraints. We propose an efficient methodology for solving RBDO problems based on an improved high order response surface method (HORSM) that takes advantage of an efficient sampling method, Hermite polynomials and uncertainty contribution concept to construct a high order response surface function with cross terms for reliability analysis. The sampling method generates supporting points from Gauss-Hermite quadrature points, which can be used to approximate response surface function without cross terms, to identify the highest order of each random variable and to determine the significant variables connected with point estimate method. The cross terms between two significant random variables are added to the response surface function to improve the approximation accuracy. Integrating the nested strategy, the improved HORSM is explored in solving RBDO problems. Additionally, a sampling based reliability sensitivity analysis method is employed to reduce the computational effort further when design variables are distributional parameters of input random variables. The proposed methodology is applied on two test problems to validate its accuracy and efficiency. The proposed methodology is more efficient than first order reliability method based RBDO and Monte Carlo simulation based RBDO, and enables the use of RBDO as a practical design tool.
A note on some identities of derangement polynomials.
Kim, Taekyun; Kim, Dae San; Jang, Gwan-Woo; Kwon, Jongkyum
2018-01-01
The problem of counting derangements was initiated by Pierre Rémond de Montmort in 1708 (see Carlitz in Fibonacci Q. 16(3):255-258, 1978, Clarke and Sved in Math. Mag. 66(5):299-303, 1993, Kim, Kim and Kwon in Adv. Stud. Contemp. Math. (Kyungshang) 28(1):1-11 2018. A derangement is a permutation that has no fixed points, and the derangement number [Formula: see text] is the number of fixed-point-free permutations on an n element set. In this paper, we study the derangement polynomials and investigate some interesting properties which are related to derangement numbers. Also, we study two generalizations of derangement polynomials, namely higher-order and r -derangement polynomials, and show some relations between them. In addition, we express several special polynomials in terms of the higher-order derangement polynomials by using umbral calculus.
Polynomial approximation on polytopes
Totik, Vilmos
2014-01-01
Polynomial approximation on convex polytopes in \\mathbf{R}^d is considered in uniform and L^p-norms. For an appropriate modulus of smoothness matching direct and converse estimates are proven. In the L^p-case so called strong direct and converse results are also verified. The equivalence of the moduli of smoothness with an appropriate K-functional follows as a consequence. The results solve a problem that was left open since the mid 1980s when some of the present findings were established for special, so-called simple polytopes.
Milks, Matthew M; Guise, Hubert de
2005-01-01
The construction of su(2) intelligent states is simplified using a polynomial representation of su(2). The cornerstone of the new construction is the diagonalization of a 2 x 2 matrix. The method is sufficiently simple to be easily extended to su(3), where one is required to diagonalize a single 3 x 3 matrix. For two perfectly general su(3) operators, this diagonalization is technically possible but the procedure loses much of its simplicity owing to the algebraic form of the roots of a cubic equation. Simplified expressions can be obtained by specializing the choice of su(3) operators. This simpler construction will be discussed in detail
Vargas, L.
1988-01-01
The numerical approximate solution of the space-time nuclear reactor kinetics equation is investigated using a finite-element discretization of the space variable and a high order integration scheme for the resulting semi-discretized parabolic equation. The Galerkin method with spatial piecewise polynomial Lagrange basis functions are used to obtained a continuous time semi-discretized form of the space-time reactor kinetics equation. A temporal discretization is then carried out with a numerical scheme based on the Iterated Defect Correction (IDC) method using piecewise quadratic polynomials or exponential functions. The kinetics equations are thus solved with in a general finite element framework with respect to space as well as time variables in which the order of convergence of the spatial and temporal discretizations is consistently high. A computer code GALFEM/IDC is developed, to implement the numerical schemes described above. This issued to solve a one space dimensional benchmark problem. The results of the numerical experiments confirm the theoretical arguments and show that the convergence is very fast and the overall procedure is quite efficient. This is due to the good asymptotic properties of the numerical scheme which is of third order in the time interval
Airfoil noise computation use high-order schemes
Zhu, Wei Jun; Shen, Wen Zhong; Sørensen, Jens Nørkær
2007-01-01
High-order finite difference schemes with at least 4th-order spatial accuracy are used to simulate aerodynamically generated noise. The aeroacoustic solver with 4th-order up to 8th-order accuracy is implemented into the in-house flow solver, EllipSys2D/3D. Dispersion-Relation-Preserving (DRP) fin...
Describing Quadratic Cremer Point Polynomials by Parabolic Perturbations
Sørensen, Dan Erik Krarup
1996-01-01
We describe two infinite order parabolic perturbation proceduresyielding quadratic polynomials having a Cremer fixed point. The main ideais to obtain the polynomial as the limit of repeated parabolic perturbations.The basic tool at each step is to control the behaviour of certain externalrays.......Polynomials of the Cremer type correspond to parameters at the boundary of ahyperbolic component of the Mandelbrot set. In this paper we concentrate onthe main cardioid component. We investigate the differences between two-sided(i.e. alternating) and one-sided parabolic perturbations.In the two-sided case, we prove...... the existence of polynomials having an explicitlygiven external ray accumulating both at the Cremer point and at its non-periodicpreimage. We think of the Julia set as containing a "topologists double comb".In the one-sided case we prove a weaker result: the existence of polynomials havingan explicitly given...
q-analogue of the Krawtchouk and Meixner orthogonal polynomials
Campigotto, C.; Smirnov, Yu.F.; Enikeev, S.G.
1993-06-01
The comparative analysis of Krawtchouk polynomials on a uniform grid with Wigner D-functions for the SU(2) group is presented. As a result the partnership between corresponding properties of the polynomials and D-functions is established giving the group-theoretical interpretation of the Krawtchouk polynomials properties. In order to extend such an analysis on the quantum groups SU q (2) and SU q (1,1), q-analogues of Krawtchouk and Meixner polynomials of a discrete variable are studied. The total set of characteristics of these polynomials is calculated, including the orthogonality condition, normalization factor, recurrent relation, the explicit analytic expression, the Rodrigues formula, the difference derivative formula and various particular cases and values. (R.P.) 22 refs.; 2 tabs
Orthogonal polynomials derived from the tridiagonal representation approach
Alhaidari, A. D.
2018-01-01
The tridiagonal representation approach is an algebraic method for solving second order differential wave equations. Using this approach in the solution of quantum mechanical problems, we encounter two new classes of orthogonal polynomials whose properties give the structure and dynamics of the corresponding physical system. For a certain range of parameters, one of these polynomials has a mix of continuous and discrete spectra making it suitable for describing physical systems with both scattering and bound states. In this work, we define these polynomials by their recursion relations and highlight some of their properties using numerical means. Due to the prime significance of these polynomials in physics, we hope that our short expose will encourage experts in the field of orthogonal polynomials to study them and derive their properties (weight functions, generating functions, asymptotics, orthogonality relations, zeros, etc.) analytically.
Polynomial fuzzy model-based approach for underactuated surface vessels
Khooban, Mohammad Hassan; Vafamand, Navid; Dragicevic, Tomislav
2018-01-01
The main goal of this study is to introduce a new polynomial fuzzy model-based structure for a class of marine systems with non-linear and polynomial dynamics. The suggested technique relies on a polynomial Takagi–Sugeno (T–S) fuzzy modelling, a polynomial dynamic parallel distributed compensation...... surface vessel (USV). Additionally, in order to overcome the USV control challenges, including the USV un-modelled dynamics, complex nonlinear dynamics, external disturbances and parameter uncertainties, the polynomial fuzzy model representation is adopted. Moreover, the USV-based control structure...... and a sum-of-squares (SOS) decomposition. The new proposed approach is a generalisation of the standard T–S fuzzy models and linear matrix inequality which indicated its effectiveness in decreasing the tracking time and increasing the efficiency of the robust tracking control problem for an underactuated...
Nonlinear magnetohydrodynamics simulation using high-order finite elements
Plimpton, Steven James; Schnack, D.D.; Tarditi, A.; Chu, M.S.; Gianakon, T.A.; Kruger, S.E.; Nebel, R.A.; Barnes, D.C.; Sovinec, C.R.; Glasser, A.H.
2005-01-01
A conforming representation composed of 2D finite elements and finite Fourier series is applied to 3D nonlinear non-ideal magnetohydrodynamics using a semi-implicit time-advance. The self-adjoint semi-implicit operator and variational approach to spatial discretization are synergistic and enable simulation in the extremely stiff conditions found in high temperature plasmas without sacrificing the geometric flexibility needed for modeling laboratory experiments. Growth rates for resistive tearing modes with experimentally relevant Lundquist number are computed accurately with time-steps that are large with respect to the global Alfven time and moderate spatial resolution when the finite elements have basis functions of polynomial degree (p) two or larger. An error diffusion method controls the generation of magnetic divergence error. Convergence studies show that this approach is effective for continuous basis functions with p (ge) 2, where the number of test functions for the divergence control terms is less than the number of degrees of freedom in the expansion for vector fields. Anisotropic thermal conduction at realistic ratios of parallel to perpendicular conductivity (x(parallel)/x(perpendicular)) is computed accurately with p (ge) 3 without mesh alignment. A simulation of tearing-mode evolution for a shaped toroidal tokamak equilibrium demonstrates the effectiveness of the algorithm in nonlinear conditions, and its results are used to verify the accuracy of the numerical anisotropic thermal conduction in 3D magnetic topologies.
Polynomial Digital Control of a Series Equal Liquid Tanks
Bobála Vladimír
2016-01-01
Full Text Available Time-delays are mainly caused by the time required to transport mass, energy or information, but they can also be caused by processing time or accumulation. Typical examples of such processes are e.g. pumps, liquid storing tanks, distillation columns or some types of chemical reactors. In many cases time-delay is caused by the effect produced by the accumulation of a large number of low-order systems. Several industrial processes have the time-delay effect produced by the accumulation of a great number of low-order systems with the identical dynamic. The dynamic behavior of series these low-order systems is expressed by high-order system. One of possibilities of control of such processes is their approximation by low-order model with time-delay. The paper is focused on the design of the digital polynomial control of a set of equal liquid cylinder atmospheric tanks. The designed control algorithms are realized using the digital Smith Predictor (SP based on polynomial approach – by minimization of the Linear Quadratic (LQ criterion. The LQ criterion was combined with pole assignment.
Interpretation of stream programs: characterizing type 2 polynomial time complexity
Férée , Hugo; Hainry , Emmanuel; Hoyrup , Mathieu; Péchoux , Romain
2010-01-01
International audience; We study polynomial time complexity of type 2 functionals. For that purpose, we introduce a first order functional stream language. We give criteria, named well-founded, on such programs relying on second order interpretation that characterize two variants of type 2 polynomial complexity including the Basic Feasible Functions (BFF). These charac- terizations provide a new insight on the complexity of stream programs. Finally, we adapt these results to functions over th...
Complex Polynomial Vector Fields
The two branches of dynamical systems, continuous and discrete, correspond to the study of differential equations (vector fields) and iteration of mappings respectively. In holomorphic dynamics, the systems studied are restricted to those described by holomorphic (complex analytic) functions...... or meromorphic (allowing poles as singularities) functions. There already exists a well-developed theory for iterative holomorphic dynamical systems, and successful relations found between iteration theory and flows of vector fields have been one of the main motivations for the recent interest in holomorphic...... vector fields. Since the class of complex polynomial vector fields in the plane is natural to consider, it is remarkable that its study has only begun very recently. There are numerous fundamental questions that are still open, both in the general classification of these vector fields, the decomposition...
Polynomial methods in combinatorics
Guth, Larry
2016-01-01
This book explains some recent applications of the theory of polynomials and algebraic geometry to combinatorics and other areas of mathematics. One of the first results in this story is a short elegant solution of the Kakeya problem for finite fields, which was considered a deep and difficult problem in combinatorial geometry. The author also discusses in detail various problems in incidence geometry associated to Paul Erdős's famous distinct distances problem in the plane from the 1940s. The proof techniques are also connected to error-correcting codes, Fourier analysis, number theory, and differential geometry. Although the mathematics discussed in the book is deep and far-reaching, it should be accessible to first- and second-year graduate students and advanced undergraduates. The book contains approximately 100 exercises that further the reader's understanding of the main themes of the book. Some of the greatest advances in geometric combinatorics and harmonic analysis in recent years have been accompl...
Polynomial representations of GLn
Green, James A; Erdmann, Karin
2007-01-01
The first half of this book contains the text of the first edition of LNM volume 830, Polynomial Representations of GLn. This classic account of matrix representations, the Schur algebra, the modular representations of GLn, and connections with symmetric groups, has been the basis of much research in representation theory. The second half is an Appendix, and can be read independently of the first. It is an account of the Littelmann path model for the case gln. In this case, Littelmann's 'paths' become 'words', and so the Appendix works with the combinatorics on words. This leads to the repesentation theory of the 'Littelmann algebra', which is a close analogue of the Schur algebra. The treatment is self- contained; in particular complete proofs are given of classical theorems of Schensted and Knuth.
Polynomial representations of GLN
Green, James A
1980-01-01
The first half of this book contains the text of the first edition of LNM volume 830, Polynomial Representations of GLn. This classic account of matrix representations, the Schur algebra, the modular representations of GLn, and connections with symmetric groups, has been the basis of much research in representation theory. The second half is an Appendix, and can be read independently of the first. It is an account of the Littelmann path model for the case gln. In this case, Littelmann's 'paths' become 'words', and so the Appendix works with the combinatorics on words. This leads to the repesentation theory of the 'Littelmann algebra', which is a close analogue of the Schur algebra. The treatment is self- contained; in particular complete proofs are given of classical theorems of Schensted and Knuth.
A high-order Petrov-Galerkin method for the Boltzmann transport equation
Pain, C.C.; Candy, A.S.; Piggott, M.D.; Buchan, A.; Eaton, M.D.; Goddard, A.J.H.; Oliveira, C.R.E. de
2005-01-01
We describe a new Petrov-Galerkin method using high-order terms to introduce dissipation in a residual-free formulation. The method is developed following both a Taylor series analysis and a variational principle, and the result has much in common with traditional Petrov-Galerkin, Self Adjoint Angular Flux (SAAF) and Even Parity forms of the Boltzmann transport equation. In addition, we consider the subtleties in constructing appropriate boundary conditions. In sub-grid scale (SGS) modelling of fluids the advantages of high-order dissipation are well known. Fourth-order terms, for example, are commonly used as a turbulence model with uniform dissipation. They have been shown to have superior properties to SGS models based upon second-order dissipation or viscosity. Even higher-order forms of dissipation (e.g. 16.-order) can offer further advantages, but are only easily realised by spectral methods because of the solution continuity requirements that these higher-order operators demand. Higher-order operators are more effective, bringing a higher degree of representation to the solution locally. Second-order operators, for example, tend to relax the solution to a linear variation locally, whereas a high-order operator will tend to relax the solution to a second-order polynomial locally. The form of the dissipation is also important. For example, the dissipation may only be applied (as it is in this work) in the streamline direction. While for many problems, for example Large Eddy Simulation (LES), simply adding a second or fourth-order dissipation term is a perfectly satisfactory SGS model, it is well known that a consistent residual-free formulation is required for radiation transport problems. This motivated the consideration of a new Petrov-Galerkin method that is residual-free, but also benefits from the advantageous features that SGS modelling introduces. We close with a demonstration of the advantages of this new discretization method over standard Petrov
Efficient computation of Laguerre polynomials
A. Gil (Amparo); J. Segura (Javier); N.M. Temme (Nico)
2017-01-01
textabstractAn efficient algorithm and a Fortran 90 module (LaguerrePol) for computing Laguerre polynomials . Ln(α)(z) are presented. The standard three-term recurrence relation satisfied by the polynomials and different types of asymptotic expansions valid for . n large and . α small, are used
Optimization over polynomials : Selected topics
Laurent, M.; Jang, Sun Young; Kim, Young Rock; Lee, Dae-Woong; Yie, Ikkwon
2014-01-01
Minimizing a polynomial function over a region defined by polynomial inequalities models broad classes of hard problems from combinatorics, geometry and optimization. New algorithmic approaches have emerged recently for computing the global minimum, by combining tools from real algebra (sums of
HIGHLY-ACCURATE MODEL ORDER REDUCTION TECHNIQUE ON A DISCRETE DOMAIN
L. D. Ribeiro
2015-09-01
Full Text Available AbstractIn this work, we present a highly-accurate technique of model order reduction applied to staged processes. The proposed method reduces the dimension of the original system based on null values of moment-weighted sums of heat and mass balance residuals on real stages. To compute these sums of weighted residuals, a discrete form of Gauss-Lobatto quadrature was developed, allowing a high degree of accuracy in these calculations. The locations where the residuals are cancelled vary with time and operating conditions, characterizing a desirable adaptive nature of this technique. Balances related to upstream and downstream devices (such as condenser, reboiler, and feed tray of a distillation column are considered as boundary conditions of the corresponding difference-differential equations system. The chosen number of moments is the dimension of the reduced model being much lower than the dimension of the complete model and does not depend on the size of the original model. Scaling of the discrete independent variable related with the stages was crucial for the computational implementation of the proposed method, avoiding accumulation of round-off errors present even in low-degree polynomial approximations in the original discrete variable. Dynamical simulations of distillation columns were carried out to check the performance of the proposed model order reduction technique. The obtained results show the superiority of the proposed procedure in comparison with the orthogonal collocation method.
A high-order multiscale finite-element method for time-domain acoustic-wave modeling
Gao, Kai; Fu, Shubin; Chung, Eric T.
2018-05-01
Accurate and efficient wave equation modeling is vital for many applications in such as acoustics, electromagnetics, and seismology. However, solving the wave equation in large-scale and highly heterogeneous models is usually computationally expensive because the computational cost is directly proportional to the number of grids in the model. We develop a novel high-order multiscale finite-element method to reduce the computational cost of time-domain acoustic-wave equation numerical modeling by solving the wave equation on a coarse mesh based on the multiscale finite-element theory. In contrast to existing multiscale finite-element methods that use only first-order multiscale basis functions, our new method constructs high-order multiscale basis functions from local elliptic problems which are closely related to the Gauss-Lobatto-Legendre quadrature points in a coarse element. Essentially, these basis functions are not only determined by the order of Legendre polynomials, but also by local medium properties, and therefore can effectively convey the fine-scale information to the coarse-scale solution with high-order accuracy. Numerical tests show that our method can significantly reduce the computation time while maintain high accuracy for wave equation modeling in highly heterogeneous media by solving the corresponding discrete system only on the coarse mesh with the new high-order multiscale basis functions.
Waleed M. Abd-Elhameed
2016-09-01
Full Text Available Herein, two numerical algorithms for solving some linear and nonlinear fractional-order differential equations are presented and analyzed. For this purpose, a novel operational matrix of fractional-order derivatives of Fibonacci polynomials was constructed and employed along with the application of the tau and collocation spectral methods. The convergence and error analysis of the suggested Fibonacci expansion were carefully investigated. Some numerical examples with comparisons are presented to ensure the efficiency, applicability and high accuracy of the proposed algorithms. Two accurate semi-analytic polynomial solutions for linear and nonlinear fractional differential equations are the result.
Nonlocal theory of curved rods. 2-D, high order, Timoshenko’s and Euler-Bernoulli models
Zozulya V.V.
2017-09-01
Full Text Available New models for plane curved rods based on linear nonlocal theory of elasticity have been developed. The 2-D theory is developed from general 2-D equations of linear nonlocal elasticity using a special curvilinear system of coordinates related to the middle line of the rod along with special hypothesis based on assumptions that take into account the fact that the rod is thin. High order theory is based on the expansion of the equations of the theory of elasticity into Fourier series in terms of Legendre polynomials. First, stress and strain tensors, vectors of displacements and body forces have been expanded into Fourier series in terms of Legendre polynomials with respect to a thickness coordinate. Thereby, all equations of elasticity including nonlocal constitutive relations have been transformed to the corresponding equations for Fourier coefficients. Then, in the same way as in the theory of local elasticity, a system of differential equations in terms of displacements for Fourier coefficients has been obtained. First and second order approximations have been considered in detail. Timoshenko’s and Euler-Bernoulli theories are based on the classical hypothesis and the 2-D equations of linear nonlocal theory of elasticity which are considered in a special curvilinear system of coordinates related to the middle line of the rod. The obtained equations can be used to calculate stress-strain and to model thin walled structures in micro- and nanoscales when taking into account size dependent and nonlocal effects.
Zhu, Jun; Shu, Chi-Wang
2017-11-01
A new class of high order weighted essentially non-oscillatory (WENO) schemes (Zhu and Qiu, 2016, [50]) is applied to solve Euler equations with steady state solutions. It is known that the classical WENO schemes (Jiang and Shu, 1996, [23]) might suffer from slight post-shock oscillations. Even though such post-shock oscillations are small enough in magnitude and do not visually affect the essentially non-oscillatory property, they are truly responsible for the residue to hang at a truncation error level instead of converging to machine zero. With the application of this new class of WENO schemes, such slight post-shock oscillations are essentially removed and the residue can settle down to machine zero in steady state simulations. This new class of WENO schemes uses a convex combination of a quartic polynomial with two linear polynomials on unequal size spatial stencils in one dimension and is extended to two dimensions in a dimension-by-dimension fashion. By doing so, such WENO schemes use the same information as the classical WENO schemes in Jiang and Shu (1996) [23] and yield the same formal order of accuracy in smooth regions, yet they could converge to steady state solutions with very tiny residue close to machine zero for our extensive list of test problems including shocks, contact discontinuities, rarefaction waves or their interactions, and with these complex waves passing through the boundaries of the computational domain.
Primitive polynomials selection method for pseudo-random number generator
Anikin, I. V.; Alnajjar, Kh
2018-01-01
In this paper we suggested the method for primitive polynomials selection of special type. This kind of polynomials can be efficiently used as a characteristic polynomials for linear feedback shift registers in pseudo-random number generators. The proposed method consists of two basic steps: finding minimum-cost irreducible polynomials of the desired degree and applying primitivity tests to get the primitive ones. Finally two primitive polynomials, which was found by the proposed method, used in pseudorandom number generator based on fuzzy logic (FRNG) which had been suggested before by the authors. The sequences generated by new version of FRNG have low correlation magnitude, high linear complexity, less power consumption, is more balanced and have better statistical properties.
On the solution of high order stable time integration methods
Axelsson, Owe; Blaheta, Radim; Sysala, Stanislav; Ahmad, B.
2013-01-01
Roč. 108, č. 1 (2013), s. 1-22 ISSN 1687-2770 Institutional support: RVO:68145535 Keywords : evolution equations * preconditioners for quadratic matrix polynomials * a stiffly stable time integration method Subject RIV: BA - General Mathematics Impact factor: 0.836, year: 2013 http://www.boundaryvalueproblems.com/content/2013/1/108
Generalized Freud's equation and level densities with polynomial potential
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.
High-order discrete ordinate transport in non-conforming 2D Cartesian meshes
Gastaldo, L.; Le Tellier, R.; Suteau, C.; Fournier, D.; Ruggieri, J. M.
2009-01-01
We present in this paper a numerical scheme for solving the time-independent first-order form of the Boltzmann equation in non-conforming 2D Cartesian meshes. The flux solution technique used here is the discrete ordinate method and the spatial discretization is based on discontinuous finite elements. In order to have p-refinement capability, we have chosen a hierarchical polynomial basis based on Legendre polynomials. The h-refinement capability is also available and the element interface treatment has been simplified by the use of special functions decomposed over the mesh entities of an element. The comparison to a classical S N method using the Diamond Differencing scheme as spatial approximation confirms the good behaviour of the method. (authors)
On generalized Fibonacci and Lucas polynomials
Nalli, Ayse [Department of Mathematics, Faculty of Sciences, Selcuk University, 42075 Campus-Konya (Turkey)], E-mail: aysenalli@yahoo.com; Haukkanen, Pentti [Department of Mathematics, Statistics and Philosophy, 33014 University of Tampere (Finland)], E-mail: mapehau@uta.fi
2009-12-15
Let h(x) be a polynomial with real coefficients. We introduce h(x)-Fibonacci polynomials that generalize both Catalan's Fibonacci polynomials and Byrd's Fibonacci polynomials and also the k-Fibonacci numbers, and we provide properties for these h(x)-Fibonacci polynomials. We also introduce h(x)-Lucas polynomials that generalize the Lucas polynomials and present properties of these polynomials. In the last section we introduce the matrix Q{sub h}(x) that generalizes the Q-matrix whose powers generate the Fibonacci numbers.
Generation of intense high-order vortex harmonics.
Zhang, Xiaomei; Shen, Baifei; Shi, Yin; Wang, Xiaofeng; Zhang, Lingang; Wang, Wenpeng; Xu, Jiancai; Yi, Longqiong; Xu, Zhizhan
2015-05-01
This Letter presents for the first time a scheme to generate intense high-order optical vortices that carry orbital angular momentum in the extreme ultraviolet region based on relativistic harmonics from the surface of a solid target. In the three-dimensional particle-in-cell simulation, the high-order harmonics of the high-order vortex mode is generated in both reflected and transmitted light beams when a linearly polarized Laguerre-Gaussian laser pulse impinges on a solid foil. The azimuthal mode of the harmonics scales with its order. The intensity of the high-order vortex harmonics is close to the relativistic region, with the pulse duration down to attosecond scale. The obtained intense vortex beam possesses the combined properties of fine transversal structure due to the high-order mode and the fine longitudinal structure due to the short wavelength of the high-order harmonics. In addition to the application in high-resolution detection in both spatial and temporal scales, it also presents new opportunities in the intense vortex required fields, such as the inner shell ionization process and high energy twisted photons generation by Thomson scattering of such an intense vortex beam off relativistic electrons.
Parallel Construction of Irreducible Polynomials
Frandsen, Gudmund Skovbjerg
Let arithmetic pseudo-NC^k denote the problems that can be solved by log space uniform arithmetic circuits over the finite prime field GF(p) of depth O(log^k (n + p)) and size polynomial in (n + p). We show that the problem of constructing an irreducible polynomial of specified degree over GF(p) ...... of polynomials is in arithmetic NC^3. Our algorithm works over any field and compared to other known algorithms it does not assume the ability to take p'th roots when the field has characteristic p....
Orthogonal polynomials in transport theories
Dehesa, J.S.
1981-01-01
The asymptotical (k→infinity) behaviour of zeros of the polynomials gsub(k)sup((m)(ν)) encountered in the treatment of direct and inverse problems of scattering in neutron transport as well as radiative transfer theories is investigated in terms of the amplitude antiwsub(k) of the kth Legendre polynomial needed in the expansion of the scattering function. The parameters antiwsub(k) describe the anisotropy of scattering of the medium considered. In particular, it is shown that the asymptotical density of zeros of the polynomials gsub(k)sup(m)(ν) is an inverted semicircle for the anisotropic non-multiplying scattering medium
Approximate tensor-product preconditioners for very high order discontinuous Galerkin methods
Pazner, Will; Persson, Per-Olof
2018-02-01
In this paper, we develop a new tensor-product based preconditioner for discontinuous Galerkin methods with polynomial degrees higher than those typically employed. This preconditioner uses an automatic, purely algebraic method to approximate the exact block Jacobi preconditioner by Kronecker products of several small, one-dimensional matrices. Traditional matrix-based preconditioners require O (p2d) storage and O (p3d) computational work, where p is the degree of basis polynomials used, and d is the spatial dimension. Our SVD-based tensor-product preconditioner requires O (p d + 1) storage, O (p d + 1) work in two spatial dimensions, and O (p d + 2) work in three spatial dimensions. Combined with a matrix-free Newton-Krylov solver, these preconditioners allow for the solution of DG systems in linear time in p per degree of freedom in 2D, and reduce the computational complexity from O (p9) to O (p5) in 3D. Numerical results are shown in 2D and 3D for the advection, Euler, and Navier-Stokes equations, using polynomials of degree up to p = 30. For many test cases, the preconditioner results in similar iteration counts when compared with the exact block Jacobi preconditioner, and performance is significantly improved for high polynomial degrees p.
Constructing general partial differential equations using polynomial and neural networks.
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.
Families of superintegrable Hamiltonians constructed from exceptional polynomials
Post, Sarah; Tsujimoto, Satoshi; Vinet, Luc
2012-01-01
We introduce a family of exactly-solvable two-dimensional Hamiltonians whose wave functions are given in terms of Laguerre and exceptional Jacobi polynomials. The Hamiltonians contain purely quantum terms which vanish in the classical limit leaving only a previously known family of superintegrable systems. Additional, higher-order integrals of motion are constructed from ladder operators for the considered orthogonal polynomials proving the quantum system to be superintegrable. (paper)
Efficient Unsteady Flow Visualization with High-Order Access Dependencies
Zhang, Jiang; Guo, Hanqi; Yuan, Xiaoru
2016-04-19
We present a novel high-order access dependencies based model for efficient pathline computation in unsteady flow visualization. By taking longer access sequences into account to model more sophisticated data access patterns in particle tracing, our method greatly improves the accuracy and reliability in data access prediction. In our work, high-order access dependencies are calculated by tracing uniformly-seeded pathlines in both forward and backward directions in a preprocessing stage. The effectiveness of our proposed approach is demonstrated through a parallel particle tracing framework with high-order data prefetching. Results show that our method achieves higher data locality and hence improves the efficiency of pathline computation.
Julia Sets of Orthogonal Polynomials
Christiansen, Jacob Stordal; Henriksen, Christian; Petersen, Henrik Laurberg
2018-01-01
For a probability measure with compact and non-polar support in the complex plane we relate dynamical properties of the associated sequence of orthogonal polynomials fPng to properties of the support. More precisely we relate the Julia set of Pn to the outer boundary of the support, the lled Julia...... set to the polynomial convex hull K of the support, and the Green's function associated with Pn to the Green's function for the complement of K....
An introduction to orthogonal polynomials
Chihara, Theodore S
1978-01-01
Assuming no further prerequisites than a first undergraduate course in real analysis, this concise introduction covers general elementary theory related to orthogonal polynomials. It includes necessary background material of the type not usually found in the standard mathematics curriculum. Suitable for advanced undergraduate and graduate courses, it is also appropriate for independent study. Topics include the representation theorem and distribution functions, continued fractions and chain sequences, the recurrence formula and properties of orthogonal polynomials, special functions, and some
Scattering theory and orthogonal polynomials
Geronimo, J.S.
1977-01-01
The application of the techniques of scattering theory to the study of polynomials orthogonal on the unit circle and a finite segment of the real line is considered. The starting point is the recurrence relations satisfied by the polynomials instead of the orthogonality condition. A set of two two terms recurrence relations for polynomials orthogonal on the real line is presented and used. These recurrence relations play roles analogous to those satisfied by polynomials orthogonal on unit circle. With these recurrence formulas a Wronskian theorem is proved and the Christoffel-Darboux formula is derived. In scattering theory a fundamental role is played by the Jost function. An analogy is deferred of this function and its analytic properties and the locations of its zeros investigated. The role of the analog Jost function in various properties of these orthogonal polynomials is investigated. The techniques of inverse scattering theory are also used. The discrete analogues of the Gelfand-Levitan and Marchenko equations are derived and solved. These techniques are used to calculate asymptotic formulas for the orthogonal polynomials. Finally Szego's theorem on toeplitz and Hankel determinants is proved using the recurrence formulas and some properties of the Jost function. The techniques of inverse scattering theory are used to calculate the correction terms
Couple stress theory of curved rods. 2-D, high order, Timoshenko’s and Euler-Bernoulli models
Zozulya V.V.
2017-01-01
Full Text Available New models for plane curved rods based on linear couple stress theory of elasticity have been developed.2-D theory is developed from general 2-D equations of linear couple stress elasticity using a special curvilinear system of coordinates related to the middle line of the rod as well as special hypothesis based on assumptions that take into account the fact that the rod is thin. High order theory is based on the expansion of the equations of the theory of elasticity into Fourier series in terms of Legendre polynomials. First, stress and strain tensors, vectors of displacements and rotation along with body forces have been expanded into Fourier series in terms of Legendre polynomials with respect to a thickness coordinate.Thereby, all equations of elasticity including Hooke’s law have been transformed to the corresponding equations for Fourier coefficients. Then, in the same way as in the theory of elasticity, a system of differential equations in terms of displacements and boundary conditions for Fourier coefficients have been obtained. Timoshenko’s and Euler-Bernoulli theories are based on the classical hypothesis and the 2-D equations of linear couple stress theory of elasticity in a special curvilinear system. The obtained equations can be used to calculate stress-strain and to model thin walled structures in macro, micro and nano scales when taking into account couple stress and rotation effects.
Bannai-Ito polynomials and dressing chains
Derevyagin, Maxim; Tsujimoto, Satoshi; Vinet, Luc; Zhedanov, Alexei
2012-01-01
Schur-Delsarte-Genin (SDG) maps and Bannai-Ito polynomials are studied. SDG maps are related to dressing chains determined by quadratic algebras. The Bannai-Ito polynomials and their kernel polynomials -- the complementary Bannai-Ito polynomials -- are shown to arise in the framework of the SDG maps.
Birth-death processes and associated polynomials
van Doorn, Erik A.
2003-01-01
We consider birth-death processes on the nonnegative integers and the corresponding sequences of orthogonal polynomials called birth-death polynomials. The sequence of associated polynomials linked with a sequence of birth-death polynomials and its orthogonalizing measure can be used in the analysis
Fehn, Niklas; Wall, Wolfgang A.; Kronbichler, Martin
2017-12-01
The present paper deals with the numerical solution of the incompressible Navier-Stokes equations using high-order discontinuous Galerkin (DG) methods for discretization in space. For DG methods applied to the dual splitting projection method, instabilities have recently been reported that occur for small time step sizes. Since the critical time step size depends on the viscosity and the spatial resolution, these instabilities limit the robustness of the Navier-Stokes solver in case of complex engineering applications characterized by coarse spatial resolutions and small viscosities. By means of numerical investigation we give evidence that these instabilities are related to the discontinuous Galerkin formulation of the velocity divergence term and the pressure gradient term that couple velocity and pressure. Integration by parts of these terms with a suitable definition of boundary conditions is required in order to obtain a stable and robust method. Since the intermediate velocity field does not fulfill the boundary conditions prescribed for the velocity, a consistent boundary condition is derived from the convective step of the dual splitting scheme to ensure high-order accuracy with respect to the temporal discretization. This new formulation is stable in the limit of small time steps for both equal-order and mixed-order polynomial approximations. Although the dual splitting scheme itself includes inf-sup stabilizing contributions, we demonstrate that spurious pressure oscillations appear for equal-order polynomials and small time steps highlighting the necessity to consider inf-sup stability explicitly.
A high order solver for the unbounded Poisson equation
Hejlesen, Mads Mølholm; Rasmussen, Johannes Tophøj; Chatelain, Philippe
In mesh-free particle methods a high order solution to the unbounded Poisson equation is usually achieved by constructing regularised integration kernels for the Biot-Savart law. Here the singular, point particles are regularised using smoothed particles to obtain an accurate solution with an order...... of convergence consistent with the moments conserved by the applied smoothing function. In the hybrid particle-mesh method of Hockney and Eastwood (HE) the particles are interpolated onto a regular mesh where the unbounded Poisson equation is solved by a discrete non-cyclic convolution of the mesh values...... and the integration kernel. In this work we show an implementation of high order regularised integration kernels in the HE algorithm for the unbounded Poisson equation to formally achieve an arbitrary high order convergence. We further present a quantitative study of the convergence rate to give further insight...
On fully multidimensional and high order non oscillatory finite volume methods, I
Lafon, F.
1992-11-01
A fully multidimensional flux formulation for solving nonlinear conservation laws of hyperbolic type is introduced to perform calculations on unstructured grids made of triangular or quadrangular cells. Fluxes are computed across dual median cells with a multidimensional 2D Riemann Solver (R2D Solver) whose intermediate states depend on either a three (on triangle R2DT solver) of four (on quadrangle, R2DQ solver) state solutions prescribed on the three or four sides of a gravity cell. Approximate Riemann solutions are computed via a linearization process of Roe's type involving multidimensional effects. Moreover, a monotonous scheme using stencil and central Lax-Friedrichs corrections on sonic curves are built in. Finally, high order accurate ENO-like (Essentially Non Oscillatory) reconstructions using plane and higher degree polynomial limitations are defined in the set up of finite element Lagrange spaces P k and Q k for k≥0, on triangles and quadrangles, respectively. Numerical experiments involving both linear and nonlinear conservation laws to be solved on unstructured grids indicate the ability of our techniques when dealing with strong multidimensional effects. An application to Euler's equations for the Mach three step problem illustrates the robustness and usefulness of our techniques using triangular and quadrangular grids. (Author). 33 refs., 13 figs
On Multiple Polynomials of Capelli Type
S.Y. Antonov
2016-03-01
Full Text Available This paper deals with the class of Capelli polynomials in free associative algebra F{Z} (where F is an arbitrary field, Z is a countable set generalizing the construction of multiple Capelli polynomials. The fundamental properties of the introduced Capelli polynomials are provided. In particular, decomposition of the Capelli polynomials by means of the same type of polynomials is shown. Furthermore, some relations between their T -ideals are revealed. A connection between double Capelli polynomials and Capelli quasi-polynomials is established.
Skew-orthogonal polynomials and random matrix theory
Ghosh, Saugata
2009-01-01
Orthogonal polynomials satisfy a three-term recursion relation irrespective of the weight function with respect to which they are defined. This gives a simple formula for the kernel function, known in the literature as the Christoffel-Darboux sum. The availability of asymptotic results of orthogonal polynomials and the simple structure of the Christoffel-Darboux sum make the study of unitary ensembles of random matrices relatively straightforward. In this book, the author develops the theory of skew-orthogonal polynomials and obtains recursion relations which, unlike orthogonal polynomials, depend on weight functions. After deriving reduced expressions, called the generalized Christoffel-Darboux formulas (GCD), he obtains universal correlation functions and non-universal level densities for a wide class of random matrix ensembles using the GCD. The author also shows that once questions about higher order effects are considered (questions that are relevant in different branches of physics and mathematics) the ...
Analysis and Design of High-Order Parallel Resonant Converters
Batarseh, Issa Eid
1990-01-01
In this thesis, a special state variable transformation technique has been derived for the analysis of high order dc-to-dc resonant converters. Converters comprised of high order resonant tanks have the advantage of utilizing the parasitic elements by making them part of the resonant tank. A new set of state variables is defined in order to make use of two-dimensional state-plane diagrams in the analysis of high order converters. Such a method has been successfully used for the analysis of the conventional Parallel Resonant Converters (PRC). Consequently, two -dimensional state-plane diagrams are used to analyze the steady state response for third and fourth order PRC's when these converters are operated in the continuous conduction mode. Based on this analysis, a set of control characteristic curves for the LCC-, LLC- and LLCC-type PRC are presented from which various converter design parameters are obtained. Various design curves for component value selections and device ratings are given. This analysis of high order resonant converters shows that the addition of the reactive components to the resonant tank results in converters with better performance characteristics when compared with the conventional second order PRC. Complete design procedure along with design examples for 2nd, 3rd and 4th order converters are presented. Practical power supply units, normally used for computer applications, were built and tested by using the LCC-, LLC- and LLCC-type commutation schemes. In addition, computer simulation results are presented for these converters in order to verify the theoretical results.
Enhanced high-order harmonic generation from Argon-clusters
Tao, Yin; Hagmeijer, Rob; Bastiaens, Hubertus M.J.; Goh, S.J.; van der Slot, P.J.M.; Biedron, S.; Milton, S.; Boller, Klaus J.
2017-01-01
High-order harmonic generation (HHG) in clusters is of high promise because clusters appear to offer an increased optical nonlinearity. We experimentally investigate HHG from Argon clusters in a supersonic gas jet that can generate monomer-cluster mixtures with varying atomic number density and
A rigorous analysis of high-order electromagnetic invisibility cloaks
Weder, Ricardo
2008-01-01
There is currently a great deal of interest in the invisibility cloaks recently proposed by Pendry et al that are based on the transformation approach. They obtained their results using first-order transformations. In recent papers, Hendi et al and Cai et al considered invisibility cloaks with high-order transformations. In this paper, we study high-order electromagnetic invisibility cloaks in transformation media obtained by high-order transformations from general anisotropic media. We consider the case where there is a finite number of spherical cloaks located in different points in space. We prove that for any incident plane wave, at any frequency, the scattered wave is identically zero. We also consider the scattering of finite-energy wave packets. We prove that the scattering matrix is the identity, i.e., that for any incoming wave packet the outgoing wave packet is the same as the incoming one. This proves that the invisibility cloaks cannot be detected in any scattering experiment with electromagnetic waves in high-order transformation media, and in particular in the first-order transformation media of Pendry et al. We also prove that the high-order invisibility cloaks, as well as the first-order ones, cloak passive and active devices. The cloaked objects completely decouple from the exterior. Actually, the cloaking outside is independent of what is inside the cloaked objects. The electromagnetic waves inside the cloaked objects cannot leave the concealed regions and vice versa, the electromagnetic waves outside the cloaked objects cannot go inside the concealed regions. As we prove our results for media that are obtained by transformation from general anisotropic materials, we prove that it is possible to cloak objects inside general crystals
High Order Differential Frequency Hopping: Design and Analysis
Yong Li
2015-01-01
Full Text Available This paper considers spectrally efficient differential frequency hopping (DFH system design. Relying on time-frequency diversity over large spectrum and high speed frequency hopping, DFH systems are robust against hostile jamming interference. However, the spectral efficiency of conventional DFH systems is very low due to only using the frequency of each channel. To improve the system capacity, in this paper, we propose an innovative high order differential frequency hopping (HODFH scheme. Unlike in traditional DFH where the message is carried by the frequency relationship between the adjacent hops using one order differential coding, in HODFH, the message is carried by the frequency and phase relationship using two-order or higher order differential coding. As a result, system efficiency is increased significantly since the additional information transmission is achieved by the higher order differential coding at no extra cost on either bandwidth or power. Quantitative performance analysis on the proposed scheme demonstrates that transmission through the frequency and phase relationship using two-order or higher order differential coding essentially introduces another dimension to the signal space, and the corresponding coding gain can increase the system efficiency.
Polynomial chaos representation of databases on manifolds
Soize, C., E-mail: christian.soize@univ-paris-est.fr [Université Paris-Est, Laboratoire Modélisation et Simulation Multi-Echelle, MSME UMR 8208 CNRS, 5 bd Descartes, 77454 Marne-La-Vallée, Cedex 2 (France); Ghanem, R., E-mail: ghanem@usc.edu [University of Southern California, 210 KAP Hall, Los Angeles, CA 90089 (United States)
2017-04-15
Characterizing the polynomial chaos expansion (PCE) of a vector-valued random variable with probability distribution concentrated on a manifold is a relevant problem in data-driven settings. The probability distribution of such random vectors is multimodal in general, leading to potentially very slow convergence of the PCE. In this paper, we build on a recent development for estimating and sampling from probabilities concentrated on a diffusion manifold. The proposed methodology constructs a PCE of the random vector together with an associated generator that samples from the target probability distribution which is estimated from data concentrated in the neighborhood of the manifold. The method is robust and remains efficient for high dimension and large datasets. The resulting polynomial chaos construction on manifolds permits the adaptation of many uncertainty quantification and statistical tools to emerging questions motivated by data-driven queries.
Venu Gopal
2014-07-01
Full Text Available In this paper, we propose a new three-level implicit nine point compact finite difference formulation of O(k2 + h4 based on non-polynomial tension spline approximation in r-direction and finite difference approximation in t-direction for the numerical solution of one dimensional wave equation in polar co-ordinates. We describe the mathematical formulation procedure in details and also discuss the stability of the method. Numerical results are provided to justify the usefulness of the proposed method.
Dynamic Stability Analysis Using High-Order Interpolation
Juarez-Toledo C.
2012-10-01
Full Text Available A non-linear model with robust precision for transient stability analysis in multimachine power systems is proposed. The proposed formulation uses the interpolation of Lagrange and Newton's Divided Difference. The High-Order Interpolation technique developed can be used for evaluation of the critical conditions of the dynamic system.The technique is applied to a 5-area 45-machine model of the Mexican interconnected system. As a particular case, this paper shows the application of the High-Order procedure for identifying the slow-frequency mode for a critical contingency. Numerical examples illustrate the method and demonstrate the ability of the High-Order technique to isolate and extract temporal modal behavior.
Electrochemical Hydrogen Storage in a Highly Ordered Mesoporous Carbon
Dan eLiu
2014-10-01
Full Text Available A highly order mesoporous carbon has been synthesized through a strongly acidic, aqueous cooperative assembly route. The structure and morphology of the carbon material were investigated using TEM, SEM and nitrogen adsorption-desorption isotherms. The carbon was proven to be meso-structural and consisted of graphitic micro-domain with larger interlayer space. AC impedance and electrochemical measurements reveal that the synthesized highly ordered mesoporous carbon exhibits a promoted electrochemical hydrogen insertion process and improved capacitance and hydrogen storage stability. The meso-structure and enlarged interlayer distance within the highly ordered mesoporous carbon are suggested as possible causes for the enhancement in hydrogen storage. Both hydrogen capacity in the carbon and mass diffusion within the matrix were improved.
A high order solver for the unbounded Poisson equation
Hejlesen, Mads Mølholm; Rasmussen, Johannes Tophøj; Chatelain, Philippe
2013-01-01
. The method is extended to directly solve the derivatives of the solution to Poissonʼs equation. In this way differential operators such as the divergence or curl of the solution field can be solved to the same high order convergence without additional computational effort. The method, is applied......A high order converging Poisson solver is presented, based on the Greenʼs function solution to Poissonʼs equation subject to free-space boundary conditions. The high order convergence is achieved by formulating regularised integration kernels, analogous to a smoothing of the solution field...... and validated, however not restricted, to the equations of fluid mechanics, and can be used in many applications to solve Poissonʼs equation on a rectangular unbounded domain....
Retrieval of high-order susceptibilities of nonlinear metamaterials
Wang Zhi-Yu; Qiu Jin-Peng; Chen Hua; Mo Jiong-Jiong; Yu Fa-Xin
2017-01-01
Active metamaterials embedded with nonlinear elements are able to exhibit strong nonlinearity in microwave regime. However, existing S -parameter based parameter retrieval approaches developed for linear metamaterials do not apply in nonlinear cases. In this paper, a retrieval algorithm of high-order susceptibilities for nonlinear metamaterials is derived. Experimental demonstration shows that, by measuring the power level of each harmonic while sweeping the incident power, high-order susceptibilities of a thin-layer nonlinear metamaterial can be effectively retrieved. The proposedapproach can be widely used in the research of active metamaterials. (paper)
High-order harmonic generation with short-pulse lasers
Schafer, K.J.; Krause, J.L.; Kulander, K.C.
1992-12-01
Recent progress in the understanding of high-order harmonic conversion from atoms and ions exposed to high-intensity, short-pulse optical lasers is reviewed. We find that ions can produce harmonics comparable in strength to those obtained from neutral atoms, and that the emission extends to much higher order. Simple scaling laws for the strength of the harmonic emission and the maximium observable harmonic are suggested. These results imply that the photoemission observed in recent experiments in helium and neon contains contributions from ions as well as neutrals
Liu, Chain T.; Inouye, Henry
1979-01-01
Malleable long range ordered alloys having high critical ordering temperatures exist in the V(Fe, Co).sub.3 and V(Fe, Co, Ni).sub.3 systems. These alloys have the following compositions comprising by weight: 22-23% V, 14-30% Fe, and the remainder Co or Co and Ni with an electron density no more than 7.85. The maximum combination of high temperature strength, ductility and creep resistance are manifested in the alloy comprising by weight 22-23% V, 14-20% Fe and the remainder Co and having an atomic composition of V(Fe .sub.0.20-0.26 C Co.sub.0.74-0.80).sub.3. The alloy comprising by weight 22-23% V, 16-17% Fe and 60-62% Co has excellent high temperature properties. The alloys are fabricable into wrought articles by casting, deforming, and annealing for sufficient time to provide ordered structure.
Polynomial weights and code constructions
Massey, J; Costello, D; Justesen, Jørn
1973-01-01
polynomial included. This fundamental property is then used as the key to a variety of code constructions including 1) a simplified derivation of the binary Reed-Muller codes and, for any primepgreater than 2, a new extensive class ofp-ary "Reed-Muller codes," 2) a new class of "repeated-root" cyclic codes...... of long constraint length binary convolutional codes derived from2^r-ary Reed-Solomon codes, and 6) a new class ofq-ary "repeated-root" constacyclic codes with an algebraic decoding algorithm.......For any nonzero elementcof a general finite fieldGF(q), it is shown that the polynomials(x - c)^i, i = 0,1,2,cdots, have the "weight-retaining" property that any linear combination of these polynomials with coefficients inGF(q)has Hamming weight at least as great as that of the minimum degree...
Orthogonal Polynomials and Special Functions
Assche, Walter
2003-01-01
The set of lectures from the Summer School held in Leuven in 2002 provide an up-to-date account of recent developments in orthogonal polynomials and special functions, in particular for algorithms for computer algebra packages, 3nj-symbols in representation theory of Lie groups, enumeration, multivariable special functions and Dunkl operators, asymptotics via the Riemann-Hilbert method, exponential asymptotics and the Stokes phenomenon. The volume aims at graduate students and post-docs working in the field of orthogonal polynomials and special functions, and in related fields interacting with orthogonal polynomials, such as combinatorics, computer algebra, asymptotics, representation theory, harmonic analysis, differential equations, physics. The lectures are self-contained requiring only a basic knowledge of analysis and algebra, and each includes many exercises.
An overview on polynomial approximation of NP-hard problems
Paschos Vangelis Th.
2009-01-01
Full Text Available The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the NP-hard problems strongly motivates both the researchers and the practitioners to try to solve such problems heuristically, by making a trade-off between computational time and solution's quality. In other words, heuristic computation consists of trying to find not the best solution but one solution which is 'close to' the optimal one in reasonable time. Among the classes of heuristic methods for NP-hard problems, the polynomial approximation algorithms aim at solving a given NP-hard problem in poly-nomial time by computing feasible solutions that are, under some predefined criterion, as near to the optimal ones as possible. The polynomial approximation theory deals with the study of such algorithms. This survey first presents and analyzes time approximation algorithms for some classical examples of NP-hard problems. Secondly, it shows how classical notions and tools of complexity theory, such as polynomial reductions, can be matched with polynomial approximation in order to devise structural results for NP-hard optimization problems. Finally, it presents a quick description of what is commonly called inapproximability results. Such results provide limits on the approximability of the problems tackled.
Polynomial asymptotic stability of damped stochastic differential equations
John Appleby
2004-08-01
Full Text Available The paper studies the polynomial convergence of solutions of a scalar nonlinear It\\^{o} stochastic differential equation\\[dX(t = -f(X(t\\,dt + \\sigma(t\\,dB(t\\] where it is known, {\\it a priori}, that $\\lim_{t\\rightarrow\\infty} X(t=0$, a.s. The intensity of the stochastic perturbation $\\sigma$ is a deterministic, continuous and square integrable function, which tends to zero more quickly than a polynomially decaying function. The function $f$ obeys $\\lim_{x\\rightarrow 0}\\mbox{sgn}(xf(x/|x|^\\beta = a$, for some $\\beta>1$, and $a>0$.We study two asymptotic regimes: when $\\sigma$ tends to zero sufficiently quickly the polynomial decay rate of solutions is the same as for the deterministic equation (when $\\sigma\\equiv0$. When $\\sigma$ decays more slowly, a weaker almost sure polynomial upper bound on the decay rate of solutions is established. Results which establish the necessity for $\\sigma$ to decay polynomially in order to guarantee the almost sure polynomial decay of solutions are also proven.
Hybrid RANS-LES using high order numerical methods
Henry de Frahan, Marc; Yellapantula, Shashank; Vijayakumar, Ganesh; Knaus, Robert; Sprague, Michael
2017-11-01
Understanding the impact of wind turbine wake dynamics on downstream turbines is particularly important for the design of efficient wind farms. Due to their tractable computational cost, hybrid RANS/LES models are an attractive framework for simulating separation flows such as the wake dynamics behind a wind turbine. High-order numerical methods can be computationally efficient and provide increased accuracy in simulating complex flows. In the context of LES, high-order numerical methods have shown some success in predictions of turbulent flows. However, the specifics of hybrid RANS-LES models, including the transition region between both modeling frameworks, pose unique challenges for high-order numerical methods. In this work, we study the effect of increasing the order of accuracy of the numerical scheme in simulations of canonical turbulent flows using RANS, LES, and hybrid RANS-LES models. We describe the interactions between filtering, model transition, and order of accuracy and their effect on turbulence quantities such as kinetic energy spectra, boundary layer evolution, and dissipation rate. This work was funded by the U.S. Department of Energy, Exascale Computing Project, under Contract No. DE-AC36-08-GO28308 with the National Renewable Energy Laboratory.
Eliminating high-order scattering effects in optical microbubble sizing.
Qiu, Huihe
2003-04-01
Measurements of bubble size and velocity in multiphase flows are important in much research and many industrial applications. It has been found that high-order refractions have great impact on microbubble sizing by use of phase-Doppler anemometry (PDA). The problem has been investigated, and a model of phase-size correlation, which also takes high-order refractions into consideration, is introduced to improve the accuracy of bubble sizing. Hence the model relaxes the assumption of a single-scattering mechanism in a conventional PDA system. The results of simulation based on this new model are compared with those based on a single-scattering-mechanism approach or a first-order approach. An optimization method for accurately sizing air bubbles in water has been suggested.
Symmetric functions and orthogonal polynomials
Macdonald, I G
1997-01-01
One of the most classical areas of algebra, the theory of symmetric functions and orthogonal polynomials has long been known to be connected to combinatorics, representation theory, and other branches of mathematics. Written by perhaps the most famous author on the topic, this volume explains some of the current developments regarding these connections. It is based on lectures presented by the author at Rutgers University. Specifically, he gives recent results on orthogonal polynomials associated with affine Hecke algebras, surveying the proofs of certain famous combinatorial conjectures.
International Conference on Spectral and High-Order Methods
Dumont, Ney; Hesthaven, Jan
2017-01-01
This book features a selection of high-quality papers chosen from the best presentations at the International Conference on Spectral and High-Order Methods (2016), offering an overview of the depth and breadth of the activities within this important research area. The carefully reviewed papers provide a snapshot of the state of the art, while the extensive bibliography helps initiate new research directions.
A high order solver for the unbounded Poisson equation
Hejlesen, Mads Mølholm; Rasmussen, Johannes Tophøj; Chatelain, Philippe
2012-01-01
This work improves upon Hockney and Eastwood's Fourier-based algorithm for the unbounded Poisson equation to formally achieve arbitrary high order of convergence without any additional computational cost. We assess the methodology on the kinematic relations between the velocity and vorticity fields....
factor high order fuzzy time series with applications to temperature
HOD
In this paper, a novel two – factor high – order fuzzy time series forecasting method based on .... to balance between local and global exploitations of the swarms. While, .... Although, there were a number of outliers but, the spread at the spot in ...
Riesz transforms and Lie groups of polynomial growth
Elst, ter A.F.M.; Robinson, D.W.; Sikora, A.
1999-01-01
Let G be a Lie group of polynomial growth. We prove that the second-order Riesz transforms onL2(G; dg) are bounded if, and only if, the group is a direct product of a compact group and a nilpotent group, in which case the transforms of all orders are bounded.
High-order perturbations of a spherical collapsing star
Brizuela, David; Martin-Garcia, Jose M.; Sperhake, Ulrich; Kokkotas, Kostas D.
2010-01-01
A formalism to deal with high-order perturbations of a general spherical background was developed in earlier work [D. Brizuela, J. M. Martin-Garcia, and G. A. Mena Marugan, Phys. Rev. D 74, 044039 (2006); D. Brizuela, J. M. Martin-Garcia, and G. A. Mena Marugan, Phys. Rev. D 76, 024004 (2007)]. In this paper, we apply it to the particular case of a perfect fluid background. We have expressed the perturbations of the energy-momentum tensor at any order in terms of the perturbed fluid's pressure, density, and velocity. In general, these expressions are not linear and have sources depending on lower-order perturbations. For the second-order case we make the explicit decomposition of these sources in tensor spherical harmonics. Then, a general procedure is given to evolve the perturbative equations of motions of the perfect fluid for any value of the harmonic label. Finally, with the problem of a spherical collapsing star in mind, we discuss the high-order perturbative matching conditions across a timelike surface, in particular, the surface separating the perfect fluid interior from the exterior vacuum.
On Linear Combinations of Two Orthogonal Polynomial Sequences on the Unit Circle
Suárez C
2010-01-01
Full Text Available Let be a monic orthogonal polynomial sequence on the unit circle. We define recursively a new sequence of polynomials by the following linear combination: , , . In this paper, we give necessary and sufficient conditions in order to make be an orthogonal polynomial sequence too. Moreover, we obtain an explicit representation for the Verblunsky coefficients and in terms of and . Finally, we show the relation between their corresponding Carathéodory functions and their associated linear functionals.
HOKF: High Order Kalman Filter for Epilepsy Forecasting Modeling.
Nguyen, Ngoc Anh Thi; Yang, Hyung-Jeong; Kim, Sunhee
2017-08-01
Epilepsy forecasting has been extensively studied using high-order time series obtained from scalp-recorded electroencephalography (EEG). An accurate seizure prediction system would not only help significantly improve patients' quality of life, but would also facilitate new therapeutic strategies to manage epilepsy. This paper thus proposes an improved Kalman Filter (KF) algorithm to mine seizure forecasts from neural activity by modeling three properties in the high-order EEG time series: noise, temporal smoothness, and tensor structure. The proposed High-Order Kalman Filter (HOKF) is an extension of the standard Kalman filter, for which higher-order modeling is limited. The efficient dynamic of HOKF system preserves the tensor structure of the observations and latent states. As such, the proposed method offers two main advantages: (i) effectiveness with HOKF results in hidden variables that capture major evolving trends suitable to predict neural activity, even in the presence of missing values; and (ii) scalability in that the wall clock time of the HOKF is linear with respect to the number of time-slices of the sequence. The HOKF algorithm is examined in terms of its effectiveness and scalability by conducting forecasting and scalability experiments with a real epilepsy EEG dataset. The results of the simulation demonstrate the superiority of the proposed method over the original Kalman Filter and other existing methods. Copyright © 2017 Elsevier B.V. All rights reserved.
On high-order perturbative calculations at finite density
Ghisoiu, Ioan; Kurkela, Aleksi; Romatschke, Paul; Säppi, Matias; Vuorinen, Aleksi
2017-01-01
We discuss the prospects of performing high-order perturbative calculations in systems characterized by a vanishing temperature but finite density. In particular, we show that the determination of generic Feynman integrals containing fermionic chemical potentials can be reduced to the evaluation of three-dimensional phase space integrals over vacuum on-shell amplitudes. Applications of these rules will be discussed in the context of the thermodynamics of cold and dense QCD, where it is argued that they facilitate an extension of the Equation of State of cold quark matter to higher perturbative orders.
On high-order perturbative calculations at finite density
Ghişoiu, Ioan, E-mail: ioan.ghisoiu@helsinki.fi [Helsinki Institute of Physics and Department of Physics, University of Helsinki (Finland); Gorda, Tyler, E-mail: tyler.gorda@helsinki.fi [Helsinki Institute of Physics and Department of Physics, University of Helsinki (Finland); Department of Physics, University of Colorado Boulder, Boulder, CO (United States); Kurkela, Aleksi, E-mail: aleksi.kurkela@cern.ch [Theoretical Physics Department, CERN, Geneva (Switzerland); Faculty of Science and Technology, University of Stavanger, Stavanger (Norway); Romatschke, Paul, E-mail: paul.romatschke@colorado.edu [Department of Physics, University of Colorado Boulder, Boulder, CO (United States); Center for Theory of Quantum Matter, University of Colorado, Boulder, CO (United States); Säppi, Matias, E-mail: matias.sappi@helsinki.fi [Helsinki Institute of Physics and Department of Physics, University of Helsinki (Finland); Vuorinen, Aleksi, E-mail: aleksi.vuorinen@helsinki.fi [Helsinki Institute of Physics and Department of Physics, University of Helsinki (Finland)
2017-02-15
We discuss the prospects of performing high-order perturbative calculations in systems characterized by a vanishing temperature but finite density. In particular, we show that the determination of generic Feynman integrals containing fermionic chemical potentials can be reduced to the evaluation of three-dimensional phase space integrals over vacuum on-shell amplitudes — a result reminiscent of a previously proposed “naive real-time formalism” for vacuum diagrams. Applications of these rules are discussed in the context of the thermodynamics of cold and dense QCD, where it is argued that they facilitate an extension of the Equation of State of cold quark matter to higher perturbative orders.
Theoretical description of high-order harmonic generation in solids
Kemper, A F; Moritz, B; Devereaux, T P; Freericks, J K
2013-01-01
We consider several aspects of high-order harmonic generation in solids: the effects of elastic and inelastic scattering, varying pulse characteristics and inclusion of material-specific parameters through a realistic band structure. We reproduce many observed characteristics of high harmonic generation experiments in solids including the formation of only odd harmonics in inversion-symmetric materials, and the nonlinear formation of high harmonics with increasing field. We find that the harmonic spectra are fairly robust against elastic and inelastic scattering. Furthermore, we find that the pulse characteristics can play an important role in determining the harmonic spectra. (paper)
Goncalves, Glenio A.; Orengo, Gilberto; Vilhena, Marco Tullio M.B. de; Graca, Claudio O.
2002-01-01
In this work we present the LTS N solution of the adjoint transport equation for an arbitrary source, testing the aptness of this analytical solution for high order of quadrature in transport problems and comparing some preliminary results with the ANISN computations in a homogeneneous slab geometry. In order to do that we apply the new formulation for the LTS N method based on the invariance projection property, becoming possible to handle problems with arbitrary sources and demanding high order of quadrature or deep penetration. This new approach for the LTS N method is important both for direct and adjoint transport calculations and its development was inspired by the necessity of using generalized adjoint sources for important calculations. Although the mathematical convergence has been proved for an arbitrary source, when the quadrature order or deep penetration is required the LTS N method presents computational overflow even for simple sources (sin, cos, exp, polynomial). With the new formulation we eliminate this drawback and in this work we report the numerical simulations testing the new approach
STABILITY SYSTEMS VIA HURWITZ POLYNOMIALS
BALTAZAR AGUIRRE HERNÁNDEZ
2017-01-01
Full Text Available To analyze the stability of a linear system of differential equations ẋ = Ax we can study the location of the roots of the characteristic polynomial pA(t associated with the matrix A. We present various criteria - algebraic and geometric - that help us to determine where the roots are located without calculating them directly.
On Modular Counting with Polynomials
Hansen, Kristoffer Arnsfelt
2006-01-01
For any integers m and l, where m has r sufficiently large (depending on l) factors, that are powers of r distinct primes, we give a construction of a (symmetric) polynomial over Z_m of degree O(\\sqrt n) that is a generalized representation (commonly also called weak representation) of the MODl f...
Global Polynomial Kernel Hazard Estimation
Hiabu, Munir; Miranda, Maria Dolores Martínez; Nielsen, Jens Perch
2015-01-01
This paper introduces a new bias reducing method for kernel hazard estimation. The method is called global polynomial adjustment (GPA). It is a global correction which is applicable to any kernel hazard estimator. The estimator works well from a theoretical point of view as it asymptotically redu...
Congruences concerning Legendre polynomials III
Sun, Zhi-Hong
2010-01-01
Let $p>3$ be a prime, and let $R_p$ be the set of rational numbers whose denominator is coprime to $p$. Let $\\{P_n(x)\\}$ be the Legendre polynomials. In this paper we mainly show that for $m,n,t\\in R_p$ with $m\
Two polynomial division inequalities in
Goetgheluck P
1998-01-01
Full Text Available This paper is a first attempt to give numerical values for constants and , in classical estimates and where is an algebraic polynomial of degree at most and denotes the -metric on . The basic tools are Markov and Bernstein inequalities.
Very high order lattice perturbation theory for Wilson loops
Horsley, R.
2010-10-01
We calculate perturbativeWilson loops of various sizes up to loop order n=20 at different lattice sizes for pure plaquette and tree-level improved Symanzik gauge theories using the technique of Numerical Stochastic Perturbation Theory. This allows us to investigate the behavior of the perturbative series at high orders. We observe differences in the behavior of perturbative coefficients as a function of the loop order. Up to n=20 we do not see evidence for the often assumed factorial growth of the coefficients. Based on the observed behavior we sum this series in a model with hypergeometric functions. Alternatively we estimate the series in boosted perturbation theory. Subtracting the estimated perturbative series for the average plaquette from the non-perturbative Monte Carlo result we estimate the gluon condensate. (orig.)
High order spectral volume and spectral difference methods on unstructured grids
Kannan, Ravishekar
The spectral volume (SV) and the spectral difference (SD) methods were developed by Wang and Liu and their collaborators for conservation laws on unstructured grids. They were introduced to achieve high-order accuracy in an efficient manner. Recently, these methods were extended to three-dimensional systems and to the Navier Stokes equations. The simplicity and robustness of these methods have made them competitive against other higher order methods such as the discontinuous Galerkin and residual distribution methods. Although explicit TVD Runge-Kutta schemes for the temporal advancement are easy to implement, they suffer from small time step limited by the Courant-Friedrichs-Lewy (CFL) condition. When the polynomial order is high or when the grid is stretched due to complex geometries or boundary layers, the convergence rate of explicit schemes slows down rapidly. Solution strategies to remedy this problem include implicit methods and multigrid methods. A novel implicit lower-upper symmetric Gauss-Seidel (LU-SGS) relaxation method is employed as an iterative smoother. It is compared to the explicit TVD Runge-Kutta smoothers. For some p-multigrid calculations, combining implicit and explicit smoothers for different p-levels is also studied. The multigrid method considered is nonlinear and uses Full Approximation Scheme (FAS). An overall speed-up factor of up to 150 is obtained using a three-level p-multigrid LU-SGS approach in comparison with the single level explicit method for the Euler equations for the 3rd order SD method. A study of viscous flux formulations was carried out for the SV method. Three formulations were used to discretize the viscous fluxes: local discontinuous Galerkin (LDG), a penalty method and the 2nd method of Bassi and Rebay. Fourier analysis revealed some interesting advantages for the penalty method. These were implemented in the Navier Stokes solver. An implicit and p-multigrid method was also implemented for the above. An overall speed
Ohwada, Taku; Shibata, Yuki; Kato, Takuma; Nakamura, Taichi
2018-06-01
Developed is a high-order accurate shock-capturing scheme for the compressible Euler/Navier-Stokes equations; the formal accuracy is 5th order in space and 4th order in time. The performance and efficiency of the scheme are validated in various numerical tests. The main ingredients of the scheme are nothing special; they are variants of the standard numerical flux, MUSCL, the usual Lagrange's polynomial and the conventional Runge-Kutta method. The scheme can compute a boundary layer accurately with a rational resolution and capture a stationary contact discontinuity sharply without inner points. And yet it is endowed with high resistance against shock anomalies (carbuncle phenomenon, post-shock oscillations, etc.). A good balance between high robustness and low dissipation is achieved by blending three types of numerical fluxes according to physical situation in an intuitively easy-to-understand way. The performance of the scheme is largely comparable to that of WENO5-Rusanov, while its computational cost is 30-40% less than of that of the advanced scheme.
High-Order Modulation for Optical Fiber Transmission
Seimetz, Matthias
2009-01-01
Catering to the current interest in increasing the spectral efficiency of optical fiber networks by the deployment of high-order modulation formats, this monograph describes transmitters, receivers and performance of optical systems with high-order phase and quadrature amplitude modulation. In the first part of the book, the author discusses various transmitter implementation options as well as several receiver concepts based on direct and coherent detection, including designs of new structures. Hereby, both optical and electrical parts are considered, allowing the assessment of practicability and complexity. In the second part, a detailed characterization of optical fiber transmission systems is presented, regarding a wide range of modulation formats. It provides insight in the fundamental behavior of different formats with respect to relevant performance degradation effects and identifies the major trends in system performance.
High-order harmonic generation in laser plasma plumes
Ganeev, Rashid A
2013-01-01
This book represents the first comprehensive treatment of high-order harmonic generation in laser-produced plumes, covering the principles, past and present experimental status and important applications. It shows how this method of frequency conversion of laser radiation towards the extreme ultraviolet range matured over the course of multiple studies and demonstrated new approaches in the generation of strong coherent short-wavelength radiation for various applications. Significant discoveries and pioneering contributions of researchers in this field carried out in various laser scientific centers worldwide are included in this first attempt to describe the important findings in this area of nonlinear spectroscopy. "High-Order Harmonic Generation in Laser Plasma Plumes" is a self-contained and unified review of the most recent achievements in the field, such as the application of clusters (fullerenes, nanoparticles, nanotubes) for efficient harmonic generation of ultrashort laser pulses in cluster-containin...
Gottlieb, Sigal; Grant, Zachary; Higgs, Daniel
2015-01-01
High order spatial discretizations with monotonicity properties are often desirable for the solution of hyperbolic PDEs. These methods can advantageously be coupled with high order strong stability preserving time discretizations. The search
Discrete nonlinear Schrodinger equations with arbitrarily high-order nonlinearities
Khare, A.; Rasmussen, Kim Ø; Salerno, M.
2006-01-01
-Ladik equation. As a common property, these equations possess three kinds of exact analytical stationary solutions for which the Peierls-Nabarro barrier is zero. Several properties of these solutions, including stability, discrete breathers, and moving solutions, are investigated.......A class of discrete nonlinear Schrodinger equations with arbitrarily high-order nonlinearities is introduced. These equations are derived from the same Hamiltonian using different Poisson brackets and include as particular cases the saturable discrete nonlinear Schrodinger equation and the Ablowitz...
High order modes in Project-X linac
Sukhanov, A., E-mail: ais@fnal.gov; Lunin, A.; Yakovlev, V.; Awida, M.; Champion, M.; Ginsburg, C.; Gonin, I.; Grimm, C.; Khabiboulline, T.; Nicol, T.; Orlov, Yu.; Saini, A.; Sergatskov, D.; Solyak, N.; Vostrikov, A.
2014-01-11
Project-X, a multi-MW proton source, is now under development at Fermilab. In this paper we present study of high order modes (HOM) excited in continues-wave (CW) superconducting linac of Project-X. We investigate effects of cryogenic losses caused by HOMs and influence of HOMs on beam dynamics. We find that these effects are small. We conclude that HOM couplers/dampers are not needed in the Project-X SC RF cavities.
Conditional High-Order Boltzmann Machines for Supervised Relation Learning.
Huang, Yan; Wang, Wei; Wang, Liang; Tan, Tieniu
2017-09-01
Relation learning is a fundamental problem in many vision tasks. Recently, high-order Boltzmann machine and its variants have shown their great potentials in learning various types of data relation in a range of tasks. But most of these models are learned in an unsupervised way, i.e., without using relation class labels, which are not very discriminative for some challenging tasks, e.g., face verification. In this paper, with the goal to perform supervised relation learning, we introduce relation class labels into conventional high-order multiplicative interactions with pairwise input samples, and propose a conditional high-order Boltzmann Machine (CHBM), which can learn to classify the data relation in a binary classification way. To be able to deal with more complex data relation, we develop two improved variants of CHBM: 1) latent CHBM, which jointly performs relation feature learning and classification, by using a set of latent variables to block the pathway from pairwise input samples to output relation labels and 2) gated CHBM, which untangles factors of variation in data relation, by exploiting a set of latent variables to multiplicatively gate the classification of CHBM. To reduce the large number of model parameters generated by the multiplicative interactions, we approximately factorize high-order parameter tensors into multiple matrices. Then, we develop efficient supervised learning algorithms, by first pretraining the models using joint likelihood to provide good parameter initialization, and then finetuning them using conditional likelihood to enhance the discriminant ability. We apply the proposed models to a series of tasks including invariant recognition, face verification, and action similarity labeling. Experimental results demonstrate that by exploiting supervised relation labels, our models can greatly improve the performance.
The modified Gauss diagonalization of polynomial matrices
Saeed, K.
1982-10-01
The Gauss algorithm for diagonalization of constant matrices is modified for application to polynomial matrices. Due to this modification the diagonal elements become pure polynomials rather than rational functions. (author)
Sheffer and Non-Sheffer Polynomial Families
G. Dattoli
2012-01-01
Full Text Available By using the integral transform method, we introduce some non-Sheffer polynomial sets. Furthermore, we show how to compute the connection coefficients for particular expressions of Appell polynomials.
The finite Fourier transform of classical polynomials
Dixit, Atul; Jiu, Lin; Moll, Victor H.; Vignat, Christophe
2014-01-01
The finite Fourier transform of a family of orthogonal polynomials $A_{n}(x)$, is the usual transform of the polynomial extended by $0$ outside their natural domain. Explicit expressions are given for the Legendre, Jacobi, Gegenbauer and Chebyshev families.
A Summation Formula for Macdonald Polynomials
de Gier, Jan; Wheeler, Michael
2016-03-01
We derive an explicit sum formula for symmetric Macdonald polynomials. Our expression contains multiple sums over the symmetric group and uses the action of Hecke generators on the ring of polynomials. In the special cases {t = 1} and {q = 0}, we recover known expressions for the monomial symmetric and Hall-Littlewood polynomials, respectively. Other specializations of our formula give new expressions for the Jack and q-Whittaker polynomials.
A New Generalisation of Macdonald Polynomials
Garbali, Alexandr; de Gier, Jan; Wheeler, Michael
2017-06-01
We introduce a new family of symmetric multivariate polynomials, whose coefficients are meromorphic functions of two parameters ( q, t) and polynomial in a further two parameters ( u, v). We evaluate these polynomials explicitly as a matrix product. At u = v = 0 they reduce to Macdonald polynomials, while at q = 0, u = v = s they recover a family of inhomogeneous symmetric functions originally introduced by Borodin.
Solving the interval type-2 fuzzy polynomial equation using the ranking method
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.
Random polynomials and expected complexity of bisection methods for real solving
Emiris, Ioannis Z.; Galligo, André; Tsigaridas, Elias
2010-01-01
, and by Edelman and Kostlan in order to estimate the real root separation of degree d polynomials with i.i.d. coefficients that follow two zero-mean normal distributions: for SO(2) polynomials, the i-th coefficient has variance (d/i), whereas for Weyl polynomials its variance is 1/i!. By applying results from....... The second part of the paper shows that the expected number of real roots of a degree d polynomial in the Bernstein basis is √2d ± O(1), when the coefficients are i.i.d. variables with moderate standard deviation. Our paper concludes with experimental results which corroborate our analysis....
Associated polynomials and birth-death processes
van Doorn, Erik A.
2001-01-01
We consider sequences of orthogonal polynomials with positive zeros, and pursue the question of how (partial) knowledge of the orthogonalizing measure for the {\\it associated polynomials} can lead to information about the orthogonalizing measure for the original polynomials, with a view to
High-order harmonic conversion efficiency in helium
Crane, J.K.
1992-01-01
Calculated results are presented for the energy, number of photons, and conversion efficiency for high-order harmonic generation in helium. The results show the maximum values that we should expect to achieve experimentally with our current apparatus and the important parameters for scaling this source to higher output. In the desired operating regime where the coherence length, given by L coh =πb/(q-1), is greater than the gas column length, l, the harmonic output can be summarized by a single equation: N q =[(π z n z b 3 τ q |d q | z )/4h]{(p/q)(2l/b) z }. N q - numbers of photons of q-th harmonic; n - atom density; b - laser confocal parameter; τ q - pulse width of harmonic radiation; q - harmonic order; p - effective order of nonlinearity. (Note the term in brackets, the phase-matching function, has been separated from the rest of the expression in order to be consistent with the relevant literature)
Takashi Ito
2016-01-01
Full Text Available Terms in the analytic expansion of the doubly averaged disturbing function for the circular restricted three-body problem using the Legendre polynomial are explicitly calculated up to the fourteenth order of semimajor axis ratio (α between perturbed and perturbing bodies in the inner case (α1. The expansion outcome is compared with results from numerical quadrature on an equipotential surface. Comparison with direct numerical integration of equations of motion is also presented. Overall, the high-order analytic expansion of the doubly averaged disturbing function yields a result that agrees well with the numerical quadrature and with the numerical integration. Local extremums of the doubly averaged disturbing function are quantitatively reproduced by the high-order analytic expansion even when α is large. Although the analytic expansion is not applicable in some circumstances such as when orbits of perturbed and perturbing bodies cross or when strong mean motion resonance is at work, our expansion result will be useful for analytically understanding the long-term dynamical behavior of perturbed bodies in circular restricted three-body systems.
ISAR Imaging of Maneuvering Targets Based on the Modified Discrete Polynomial-Phase Transform
Yong Wang
2015-09-01
Full Text Available Inverse synthetic aperture radar (ISAR imaging of a maneuvering target is a challenging task in the field of radar signal processing. The azimuth echo can be characterized as a multi-component polynomial phase signal (PPS after the translational compensation, and the high quality ISAR images can be obtained by the parameters estimation of it combined with the Range-Instantaneous-Doppler (RID technique. In this paper, a novel parameters estimation algorithm of the multi-component PPS with order three (cubic phase signal-CPS based on the modified discrete polynomial-phase transform (MDPT is proposed, and the corresponding new ISAR imaging algorithm is presented consequently. This algorithm is efficient and accurate to generate a focused ISAR image, and the results of real data demonstrate the effectiveness of it.
Wilson loops in very high order lattice perturbation theory
Ilgenfritz, E.M.; Nakamura, Y.; Perlt, H.; Schiller, A.; Rakow, P.E.L.; Schierholz, G.; Regensburg Univ.
2009-10-01
We calculate Wilson loops of various sizes up to loop order n=20 for lattice sizes of L 4 (L=4,6,8,12) using the technique of Numerical Stochastic Perturbation Theory in quenched QCD. This allows to investigate the behaviour of the perturbative series at high orders. We discuss three models to estimate the perturbative series: a renormalon inspired fit, a heuristic fit based on an assumed power-law singularity and boosted perturbation theory. We have found differences in the behavior of the perturbative series for smaller and larger Wilson loops at moderate n. A factorial growth of the coefficients could not be confirmed up to n=20. From Monte Carlo measured plaquette data and our perturbative result we estimate a value of the gluon condensate left angle (α)/(π)GG right angle. (orig.)
A high-order SPH method by introducing inverse kernels
Le Fang
2017-02-01
Full Text Available The smoothed particle hydrodynamics (SPH method is usually expected to be an efficient numerical tool for calculating the fluid-structure interactions in compressors; however, an endogenetic restriction is the problem of low-order consistency. A high-order SPH method by introducing inverse kernels, which is quite easy to be implemented but efficient, is proposed for solving this restriction. The basic inverse method and the special treatment near boundary are introduced with also the discussion of the combination of the Least-Square (LS and Moving-Least-Square (MLS methods. Then detailed analysis in spectral space is presented for people to better understand this method. Finally we show three test examples to verify the method behavior.
High-order harmonics generation from overdense plasmas
Quere, F.; Thaury, C.; Monot, P.; Martin, Ph.; Geindre, J.P.; Audebert, P.; Marjoribanks, R.
2006-01-01
Complete test of publication follows. When an intense laser beam reflects on an overdense plasma generated on a solid target, high-order harmonics of the incident laser frequency are observed in the reflected beam. This process provides a way to produce XUV femtosecond and attosecond pulses in the μJ range from ultrafast ultraintense lasers. Studying the mechanisms responsible for this harmonic emission is also of strong fundamental interest: just as HHG in gases has been instrumental in providing a comprehensive understanding of basic intense laser-atom interactions, HHG from solid-density plasmas is likely to become a unique tool to investigate many key features of laser-plasma interactions at high intensities. We will present both experimental and theoretical evidence that two mechanisms contribute to this harmonic emission: - Coherent Wake Emission: in this process, harmonics are emitted by plasma oscillations in te overdense plasma, triggered in the wake of jets of Brunel electrons generated by the laser field. - The relativistic oscillating mirror: in this process, the intense laser field drives a relativistic oscillation of the plasma surface, which in turn gives rise to a periodic phase modulation of the reflected beam, and hence to the generation of harmonics of the incident frequency. Left graph: experimental harmonic spectrum from a polypropylene target, obtained with 60 fs laser pulses at 10 19 W/cm 2 , with a very high temporal contrast (10 10 ). The plasma frequency of this target corresponds to harmonics 15-16, thus excluding the CWE mechanism for the generation of harmonics of higher orders. Images on the right: harmonic spectra from orders 13 et 18, for different distances z between the target and the best focus. At the highest intensity (z=0), harmonics emitted by the ROM mechanism are observed above the 15th order. These harmonics have a much smaller spectral width then those due to CWE (below the 15th order). These ROM harmonics vanish as soon
Hybrid overlay metrology for high order correction by using CDSEM
Leray, Philippe; Halder, Sandip; Lorusso, Gian; Baudemprez, Bart; Inoue, Osamu; Okagawa, Yutaka
2016-03-01
Overlay control has become one of the most critical issues for semiconductor manufacturing. Advanced lithographic scanners use high-order corrections or correction per exposure to reduce the residual overlay. It is not enough in traditional feedback of overlay measurement by using ADI wafer because overlay error depends on other process (etching process and film stress, etc.). It needs high accuracy overlay measurement by using AEI wafer. WIS (Wafer Induced Shift) is the main issue for optical overlay, IBO (Image Based Overlay) and DBO (Diffraction Based Overlay). We design dedicated SEM overlay targets for dual damascene process of N10 by i-ArF multi-patterning. The pattern is same as device-pattern locally. Optical overlay tools select segmented pattern to reduce the WIS. However segmentation has limit, especially the via-pattern, for keeping the sensitivity and accuracy. We evaluate difference between the viapattern and relaxed pitch gratings which are similar to optical overlay target at AEI. CDSEM can estimate asymmetry property of target from image of pattern edge. CDSEM can estimate asymmetry property of target from image of pattern edge. We will compare full map of SEM overlay to full map of optical overlay for high order correction ( correctables and residual fingerprints).
High-order space charge effects using automatic differentiation
Reusch, Michael F.; Bruhwiler, David L.
1997-01-01
The Northrop Grumman Topkark code has been upgraded to Fortran 90, making use of operator overloading, so the same code can be used to either track an array of particles or construct a Taylor map representation of the accelerator lattice. We review beam optics and beam dynamics simulations conducted with TOPKARK in the past and we present a new method for modeling space charge forces to high-order with automatic differentiation. This method generates an accurate, high-order, 6-D Taylor map of the phase space variable trajectories for a bunched, high-current beam. The spatial distribution is modeled as the product of a Taylor Series times a Gaussian. The variables in the argument of the Gaussian are normalized to the respective second moments of the distribution. This form allows for accurate representation of a wide range of realistic distributions, including any asymmetries, and allows for rapid calculation of the space charge fields with free space boundary conditions. An example problem is presented to illustrate our approach
High-order space charge effects using automatic differentiation
Reusch, M.F.; Bruhwiler, D.L.; Computer Accelerator Physics Conference Williamsburg, Virginia 1996)
1997-01-01
The Northrop Grumman Topkark code has been upgraded to Fortran 90, making use of operator overloading, so the same code can be used to either track an array of particles or construct a Taylor map representation of the accelerator lattice. We review beam optics and beam dynamics simulations conducted with TOPKARK in the past and we present a new method for modeling space charge forces to high-order with automatic differentiation. This method generates an accurate, high-order, 6-D Taylor map of the phase space variable trajectories for a bunched, high-current beam. The spatial distribution is modeled as the product of a Taylor Series times a Gaussian. The variables in the argument of the Gaussian are normalized to the respective second moments of the distribution. This form allows for accurate representation of a wide range of realistic distributions, including any asymmetries, and allows for rapid calculation of the space charge fields with free space boundary conditions. An example problem is presented to illustrate our approach. copyright 1997 American Institute of Physics
BSDEs with polynomial growth generators
Philippe Briand
2000-01-01
Full Text Available In this paper, we give existence and uniqueness results for backward stochastic differential equations when the generator has a polynomial growth in the state variable. We deal with the case of a fixed terminal time, as well as the case of random terminal time. The need for this type of extension of the classical existence and uniqueness results comes from the desire to provide a probabilistic representation of the solutions of semilinear partial differential equations in the spirit of a nonlinear Feynman-Kac formula. Indeed, in many applications of interest, the nonlinearity is polynomial, e.g, the Allen-Cahn equation or the standard nonlinear heat and Schrödinger equations.
Quantum entanglement via nilpotent polynomials
Mandilara, Aikaterini; Akulin, Vladimir M.; Smilga, Andrei V.; Viola, Lorenza
2006-01-01
We propose a general method for introducing extensive characteristics of quantum entanglement. The method relies on polynomials of nilpotent raising operators that create entangled states acting on a reference vacuum state. By introducing the notion of tanglemeter, the logarithm of the state vector represented in a special canonical form and expressed via polynomials of nilpotent variables, we show how this description provides a simple criterion for entanglement as well as a universal method for constructing the invariants characterizing entanglement. We compare the existing measures and classes of entanglement with those emerging from our approach. We derive the equation of motion for the tanglemeter and, in representative examples of up to four-qubit systems, show how the known classes appear in a natural way within our framework. We extend our approach to qutrits and higher-dimensional systems, and make contact with the recently introduced idea of generalized entanglement. Possible future developments and applications of the method are discussed
Reduction of the number of parameters needed for a polynomial random regression test-day model
Pool, M.H.; Meuwissen, T.H.E.
2000-01-01
Legendre polynomials were used to describe the (co)variance matrix within a random regression test day model. The goodness of fit depended on the polynomial order of fit, i.e., number of parameters to be estimated per animal but is limited by computing capacity. Two aspects: incomplete lactation
A Kantorovich Type of Szasz Operators Including Brenke-Type Polynomials
Fatma Taşdelen
2012-01-01
convergence properties of these operators by using Korovkin's theorem. We also present the order of convergence with the help of a classical approach, the second modulus of continuity, and Peetre's -functional. Furthermore, an example of Kantorovich type of the operators including Gould-Hopper polynomials is presented and Voronovskaya-type result is given for these operators including Gould-Hopper polynomials.
High-order harmonic generation in a capillary discharge
Rocca, Jorge J.; Kapteyn, Henry C.; Mumane, Margaret M.; Gaudiosi, David; Grisham, Michael E.; Popmintchev, Tenio V.; Reagan, Brendan A.
2010-06-01
A pre-ionized medium created by a capillary discharge results in more efficient use of laser energy in high-order harmonic generation (HHG) from ions. It extends the cutoff photon energy, and reduces the distortion of the laser pulse as it propagates down the waveguide. The observed enhancements result from a combination of reduced ionization energy loss and reduced ionization-induced defocusing of the driving laser as well as waveguiding of the driving laser pulse. The discharge plasma also provides a means to spectrally tune the harmonics by tailoring the initial level of ionization of the medium.
Analysis of the performance of a H-Darrieus rotor under uncertainty using Polynomial Chaos Expansion
Daróczy, László; Janiga, Gábor; Thévenin, Dominique
2016-01-01
Due to the growing importance of wind energy, improving the efficiency of energy conversion is essential. Horizontal Axis Wind Turbines are the most well-spread, but H-Darrieus turbines are becoming popular as well due to their simple design and easier integration. Due to the high efficiency of existing wind turbines, further improvements require numerical optimization. One important aspect is to find a better configuration that is also robust, i.e., a configuration that retains its performance under uncertainties. For this purpose, forward uncertainty propagation has to be applied. In the present work, an Uncertainty Quantification (UQ) method, Polynomial Chaos Expansion, is applied to transient, turbulent flow simulations of a variable-speed H-Darrieus turbine, taking into account uncertainty in the preset pitch angle and in the angular velocity. The resulting uncertainty of the performance coefficient and of the quasi-periodic torque curve are quantified. In the presence of stall the instantaneous torque coefficients tend to show asymmetric distributions, meaning that error bars cannot be correctly reconstructed using only mean value and standard deviation. The expected performance was always found to be smaller than in computations without UQ techniques, corresponding to up to 10% of relative losses for λ = 2.5. - Highlights: • Uncertainty Quantification/Polynomial Chaos Expansion successfully applied to H-rotor. • Accounting simultaneously for uncertainty in pitch angle and angular velocity. • Performance coefficient decreases by up to 10% when accounting for uncertainty. • For low tip-speed-ratio, high-order polynomials are needed. • Polynomial order 4 is sufficient to reconstruct distribution at higher TSR.
Special polynomials associated with some hierarchies
Kudryashov, Nikolai A.
2008-01-01
Special polynomials associated with rational solutions of a hierarchy of equations of Painleve type are introduced. The hierarchy arises by similarity reduction from the Fordy-Gibbons hierarchy of partial differential equations. Some relations for these special polynomials are given. Differential-difference hierarchies for finding special polynomials are presented. These formulae allow us to obtain special polynomials associated with the hierarchy studied. It is shown that rational solutions of members of the Schwarz-Sawada-Kotera, the Schwarz-Kaup-Kupershmidt, the Fordy-Gibbons, the Sawada-Kotera and the Kaup-Kupershmidt hierarchies can be expressed through special polynomials of the hierarchy studied
Space complexity in polynomial calculus
Filmus, Y.; Lauria, M.; Nordström, J.; Ron-Zewi, N.; Thapen, Neil
2015-01-01
Roč. 44, č. 4 (2015), s. 1119-1153 ISSN 0097-5397 R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061 Institutional support: RVO:67985840 Keywords : proof complexity * polynomial calculus * lower bounds Subject RIV: BA - General Mathematics Impact factor: 0.841, year: 2015 http://epubs.siam.org/doi/10.1137/120895950
Codimensions of generalized polynomial identities
Gordienko, Aleksei S
2010-01-01
It is proved that for every finite-dimensional associative algebra A over a field of characteristic zero there are numbers C element of Q + and t element of Z + such that gc n (A)∼Cn t d n as n→∞, where d=PI exp(A) element of Z + . Thus, Amitsur's and Regev's conjectures hold for the codimensions gc n (A) of the generalized polynomial identities. Bibliography: 6 titles.
De Basabe, Jonás D.
2010-04-01
We investigate the stability of some high-order finite element methods, namely the spectral element method and the interior-penalty discontinuous Galerkin method (IP-DGM), for acoustic or elastic wave propagation that have become increasingly popular in the recent past. We consider the Lax-Wendroff method (LWM) for time stepping and show that it allows for a larger time step than the classical leap-frog finite difference method, with higher-order accuracy. In particular the fourth-order LWM allows for a time step 73 per cent larger than that of the leap-frog method; the computational cost is approximately double per time step, but the larger time step partially compensates for this additional cost. Necessary, but not sufficient, stability conditions are given for the mentioned methods for orders up to 10 in space and time. The stability conditions for IP-DGM are approximately 20 and 60 per cent more restrictive than those for SEM in the acoustic and elastic cases, respectively. © 2010 The Authors Journal compilation © 2010 RAS.
High order effects in cross section sensitivity analysis
Greenspan, E.; Karni, Y.; Gilai, D.
1978-01-01
Two types of high order effects associated with perturbations in the flux shape are considered: Spectral Fine Structure Effects (SFSE) and non-linearity between changes in performance parameters and data uncertainties. SFSE are investigated in Part I using a simple single resonance model. Results obtained for each of the resolved and for representative unresolved resonances of 238 U in a ZPR-6/7 like environment indicate that SFSE can have a significant contribution to the sensitivity of group constants to resonance parameters. Methods to account for SFSE both for the propagation of uncertainties and for the adjustment of nuclear data are discussed. A Second Order Sensitivity Theory (SOST) is presented, and its accuracy relative to that of the first order sensitivity theory and of the direct substitution method is investigated in Part II. The investigation is done for the non-linear problem of the effect of changes in the 297 keV sodium minimum cross section on the transport of neutrons in a deep-penetration problem. It is found that the SOST provides a satisfactory accuracy for cross section uncertainty analysis. For the same degree of accuracy, the SOST can be significantly more efficient than the direct substitution method
Design and high order optimization of the ATF2 lattices
Marin, E; Woodley, M; Kubo, K; Okugi, T; Tauchi, T; Urakawa, J; Tomas, R
2013-01-01
The next generation of future linear colliders (LC) demands nano-meter beam sizes at the interaction point (IP) in order to reach the required luminosity. The final focus system (FFS) of a LC is meant to deliver such small beam sizes. The Accelerator Test Facility (ATF) aims to test the feasibility of the new local chromaticity correction scheme which the future LCs are based on. To this end the ATF2 nominal and ultra-low beta* lattices are design to vertically focus the beam at the IP to 37nm and 23nm, respectively if error-free lattices are considered. However simulations show that the measured field errors of the ATF2 magnets preclude to reach the mentioned spot sizes. This paper describes the optimization of high order aberrations of the ATF2 lattices in order to minimize the detrimental effect of the measured multipole components for both ATF2 lattices. Specifically three solutions are studied, the replacement of the last focusing quadrupole (QF1FF), insertion of octupole magnets and optics modification....
Chen, S J; Perng, S Y; Kuan, C K; Tseng, T C; Wang, D J
2001-01-01
An active polynomial grating has been designed for use in synchrotron radiation soft-X-ray monochromators and spectrometers. The grating can be dynamically adjusted to obtain the third-order-polynomial surface needed to eliminate the defocus and coma aberrations at any photon energy. Ray-tracing results confirm that a monochromator or spectrometer based on this active grating has nearly no aberration limit to the overall spectral resolution in the entire soft-X-ray region. The grating substrate is made of a precisely milled 17-4 PH stainless steel parallel plate, which is joined to a flexure-hinge bender shaped by wire electrical discharge machining. The substrate is grounded into a concave cylindrical shape with a nominal radius and then polished to achieve a roughness of 0.45 nm and a slope error of 1.2 mu rad rms. The long trace profiler measurements show that the active grating can reach the desired third-order polynomial with a high degree of figure accuracy.
Stable piecewise polynomial vector fields
Claudio Pessoa
2012-09-01
Full Text Available Let $N={y>0}$ and $S={y<0}$ be the semi-planes of $mathbb{R}^2$ having as common boundary the line $D={y=0}$. Let $X$ and $Y$ be polynomial vector fields defined in $N$ and $S$, respectively, leading to a discontinuous piecewise polynomial vector field $Z=(X,Y$. This work pursues the stability and the transition analysis of solutions of $Z$ between $N$ and $S$, started by Filippov (1988 and Kozlova (1984 and reformulated by Sotomayor-Teixeira (1995 in terms of the regularization method. This method consists in analyzing a one parameter family of continuous vector fields $Z_{epsilon}$, defined by averaging $X$ and $Y$. This family approaches $Z$ when the parameter goes to zero. The results of Sotomayor-Teixeira and Sotomayor-Machado (2002 providing conditions on $(X,Y$ for the regularized vector fields to be structurally stable on planar compact connected regions are extended to discontinuous piecewise polynomial vector fields on $mathbb{R}^2$. Pertinent genericity results for vector fields satisfying the above stability conditions are also extended to the present case. A procedure for the study of discontinuous piecewise vector fields at infinity through a compactification is proposed here.
Gottlieb, Sigal
2015-04-10
High order spatial discretizations with monotonicity properties are often desirable for the solution of hyperbolic PDEs. These methods can advantageously be coupled with high order strong stability preserving time discretizations. The search for high order strong stability time-stepping methods with large allowable strong stability coefficient has been an active area of research over the last two decades. This research has shown that explicit SSP Runge-Kutta methods exist only up to fourth order. However, if we restrict ourselves to solving only linear autonomous problems, the order conditions simplify and this order barrier is lifted: explicit SSP Runge-Kutta methods of any linear order exist. These methods reduce to second order when applied to nonlinear problems. In the current work we aim to find explicit SSP Runge-Kutta methods with large allowable time-step, that feature high linear order and simultaneously have the optimal fourth order nonlinear order. These methods have strong stability coefficients that approach those of the linear methods as the number of stages and the linear order is increased. This work shows that when a high linear order method is desired, it may still be worthwhile to use methods with higher nonlinear order.
High-order quantum algorithm for solving linear differential equations
Berry, Dominic W
2014-01-01
Linear differential equations are ubiquitous in science and engineering. Quantum computers can simulate quantum systems, which are described by a restricted type of linear differential equations. Here we extend quantum simulation algorithms to general inhomogeneous sparse linear differential equations, which describe many classical physical systems. We examine the use of high-order methods (where the error over a time step is a high power of the size of the time step) to improve the efficiency. These provide scaling close to Δt 2 in the evolution time Δt. As with other algorithms of this type, the solution is encoded in amplitudes of the quantum state, and it is possible to extract global features of the solution. (paper)
Weighted Polynomial Approximation for Automated Detection of Inspiratory Flow Limitation
Sheng-Cheng Huang
2017-01-01
Full Text Available Inspiratory flow limitation (IFL is a critical symptom of sleep breathing disorders. A characteristic flattened flow-time curve indicates the presence of highest resistance flow limitation. This study involved investigating a real-time algorithm for detecting IFL during sleep. Three categories of inspiratory flow shape were collected from previous studies for use as a development set. Of these, 16 cases were labeled as non-IFL and 78 as IFL which were further categorized into minor level (20 cases and severe level (58 cases of obstruction. In this study, algorithms using polynomial functions were proposed for extracting the features of IFL. Methods using first- to third-order polynomial approximations were applied to calculate the fitting curve to obtain the mean absolute error. The proposed algorithm is described by the weighted third-order (w.3rd-order polynomial function. For validation, a total of 1,093 inspiratory breaths were acquired as a test set. The accuracy levels of the classifications produced by the presented feature detection methods were analyzed, and the performance levels were compared using a misclassification cobweb. According to the results, the algorithm using the w.3rd-order polynomial approximation achieved an accuracy of 94.14% for IFL classification. We concluded that this algorithm achieved effective automatic IFL detection during sleep.
Differentiation by integration using orthogonal polynomials, a survey
Diekema, E.; Koornwinder, T.H.
2012-01-01
This survey paper discusses the history of approximation formulas for n-th order derivatives by integrals involving orthogonal polynomials. There is a large but rather disconnected corpus of literature on such formulas. We give some results in greater generality than in the literature. Notably we
on the performance of Autoregressive Moving Average Polynomial
Timothy Ademakinwa
estimated using least squares and Newton Raphson iterative methods. To determine the order of the ... r is the degree of polynomial while j is the number of lag of the ..... use a real time series dataset, monthly rainfall and temperature series ...
Benchmarking with high-order nodal diffusion methods
Tomasevic, D.; Larsen, E.W.
1993-01-01
Significant progress in the solution of multidimensional neutron diffusion problems was made in the late 1970s with the introduction of nodal methods. Modern nodal reactor analysis codes provide significant improvements in both accuracy and computing speed over earlier codes based on fine-mesh finite difference methods. In the past, the performance of advanced nodal methods was determined by comparisons with fine-mesh finite difference codes. More recently, the excellent spatial convergence of nodal methods has permitted their use in establishing reference solutions for some important bench-mark problems. The recent development of the self-consistent high-order nodal diffusion method and its subsequent variational formulation has permitted the calculation of reference solutions with one node per assembly mesh size. In this paper, we compare results for four selected benchmark problems to those obtained by high-order response matrix methods and by two well-known state-of-the-art nodal methods (the open-quotes analyticalclose quotes and open-quotes nodal expansionclose quotes methods)
A High-Order CFS Algorithm for Clustering Big Data
Fanyu Bu
2016-01-01
Full Text Available With the development of Internet of Everything such as Internet of Things, Internet of People, and Industrial Internet, big data is being generated. Clustering is a widely used technique for big data analytics and mining. However, most of current algorithms are not effective to cluster heterogeneous data which is prevalent in big data. In this paper, we propose a high-order CFS algorithm (HOCFS to cluster heterogeneous data by combining the CFS clustering algorithm and the dropout deep learning model, whose functionality rests on three pillars: (i an adaptive dropout deep learning model to learn features from each type of data, (ii a feature tensor model to capture the correlations of heterogeneous data, and (iii a tensor distance-based high-order CFS algorithm to cluster heterogeneous data. Furthermore, we verify our proposed algorithm on different datasets, by comparison with other two clustering schemes, that is, HOPCM and CFS. Results confirm the effectiveness of the proposed algorithm in clustering heterogeneous data.
Local polynomial Whittle estimation of perturbed fractional processes
Frederiksen, Per; Nielsen, Frank; Nielsen, Morten Ørregaard
We propose a semiparametric local polynomial Whittle with noise (LPWN) estimator of the memory parameter in long memory time series perturbed by a noise term which may be serially correlated. The estimator approximates the spectrum of the perturbation as well as that of the short-memory component...... of the signal by two separate polynomials. Including these polynomials we obtain a reduction in the order of magnitude of the bias, but also in‡ate the asymptotic variance of the long memory estimate by a multiplicative constant. We show that the estimator is consistent for d 2 (0; 1), asymptotically normal...... for d ε (0, 3/4), and if the spectral density is infinitely smooth near frequency zero, the rate of convergence can become arbitrarily close to the parametric rate, pn. A Monte Carlo study reveals that the LPWN estimator performs well in the presence of a serially correlated perturbation term...
The Kauffman bracket and the Jones polynomial in quantum gravity
Griego, J.
1996-01-01
In the loop representation the quantum states of gravity are given by knot invariants. From general arguments concerning the loop transform of the exponential of the Chern-Simons form, a certain expansion of the Kauffman bracket knot polynomial can be formally viewed as a solution of the Hamiltonian constraint with a cosmological constant in the loop representation. The Kauffman bracket is closely related to the Jones polynomial. In this paper the operation of the Hamiltonian on the power expansions of the Kauffman bracket and Jones polynomials is analyzed. It is explicitly shown that the Kauffman bracket is a formal solution of the Hamiltonian constraint to third order in the cosmological constant. We make use of the extended loop representation of quantum gravity where the analytic calculation can be thoroughly accomplished. Some peculiarities of the extended loop calculus are considered and the significance of the results to the case of the conventional loop representation is discussed. (orig.)
Real zeros of classes of random algebraic polynomials
K. Farahmand
2003-01-01
Full Text Available There are many known asymptotic estimates for the expected number of real zeros of an algebraic polynomial a0+a1x+a2x2+⋯+an−1xn−1 with identically distributed random coefficients. Under different assumptions for the distribution of the coefficients {aj}j=0n−1 it is shown that the above expected number is asymptotic to O(logn. This order for the expected number of zeros remains valid for the case when the coefficients are grouped into two, each group with a different variance. However, it was recently shown that if the coefficients are non-identically distributed such that the variance of the jth term is (nj the expected number of zeros of the polynomial increases to O(n. The present paper provides the value for this asymptotic formula for the polynomials with the latter variances when they are grouped into three with different patterns for their variances.
a Unified Matrix Polynomial Approach to Modal Identification
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.
Rapid removal of bisphenol A on highly ordered mesoporous carbon.
Sui, Qian; Huang, Jun; Liu, Yousong; Chang, Xiaofeng; Ji, Guangbin; Deng, Shubo; Xie, Tao; Yu, Gang
2011-01-01
Bisphenol A (BPA) is of global concern due to its disruption of endocrine systems and ubiquity in the aquatic environment. It is important, therefore, that efforts are made to remove it from the aqueous phase. A novel adsorbent, mesoporous carbon CMK-3, prepared from hexagonal SBA-15 mesoporous silica was studied for BPA removal from aqueous phase, and compared with conventional powdered activated carbon (PAC). Characterization of CMK-3 by transmission electron microscopy (TEM), X-ray diffraction, and nitrogen adsorption indicated that prepared CMK-3 had an ordered mesoporous structure with a high specific surface area of 920 m2/g and a pore-size of about 4.9 nm. The adsorption of BPA on CMK-3 followed a pseudo second-order kinetic model. The kinetic constant was 0.00049 g/(mg x min), much higher than the adsorption of BPA on PAC. The adsorption isotherm fitted slightly better with the Freundlich model than the Langmuir model, and adsorption capacity decreased as temperature increased from 10 to 40 degrees C. No significant influence of pH on adsorption was observed at pH 3 to 9; however, adsorption capacity decreased dramatically from pH 9 to 13.
RCS Leak Rate Calculation with High Order Least Squares Method
Lee, Jeong Hun; Kang, Young Kyu; Kim, Yang Ki
2010-01-01
As a part of action items for Application of Leak before Break(LBB), RCS Leak Rate Calculation Program is upgraded in Kori unit 3 and 4. For real time monitoring of operators, periodic calculation is needed and corresponding noise reduction scheme is used. This kind of study was issued in Korea, so there have upgraded and used real time RCS Leak Rate Calculation Program in UCN unit 3 and 4 and YGN unit 1 and 2. For reduction of the noise in signals, Linear Regression Method was used in those programs. Linear Regression Method is powerful method for noise reduction. But the system is not static with some alternative flow paths and this makes mixed trend patterns of input signal values. In this condition, the trend of signal and average of Linear Regression are not entirely same pattern. In this study, high order Least squares Method is used to follow the trend of signal and the order of calculation is rearranged. The result of calculation makes reasonable trend and the procedure is physically consistence
High-Order Sparse Linear Predictors for Audio Processing
Giacobello, Daniele; van Waterschoot, Toon; Christensen, Mads Græsbøll
2010-01-01
Linear prediction has generally failed to make a breakthrough in audio processing, as it has done in speech processing. This is mostly due to its poor modeling performance, since an audio signal is usually an ensemble of different sources. Nevertheless, linear prediction comes with a whole set...... of interesting features that make the idea of using it in audio processing not far fetched, e.g., the strong ability of modeling the spectral peaks that play a dominant role in perception. In this paper, we provide some preliminary conjectures and experiments on the use of high-order sparse linear predictors...... in audio processing. These predictors, successfully implemented in modeling the short-term and long-term redundancies present in speech signals, will be used to model tonal audio signals, both monophonic and polyphonic. We will show how the sparse predictors are able to model efﬁciently the different...
High-order hydrodynamic algorithms for exascale computing
Morgan, Nathaniel Ray [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2016-02-05
Hydrodynamic algorithms are at the core of many laboratory missions ranging from simulating ICF implosions to climate modeling. The hydrodynamic algorithms commonly employed at the laboratory and in industry (1) typically lack requisite accuracy for complex multi- material vortical flows and (2) are not well suited for exascale computing due to poor data locality and poor FLOP/memory ratios. Exascale computing requires advances in both computer science and numerical algorithms. We propose to research the second requirement and create a new high-order hydrodynamic algorithm that has superior accuracy, excellent data locality, and excellent FLOP/memory ratios. This proposal will impact a broad range of research areas including numerical theory, discrete mathematics, vorticity evolution, gas dynamics, interface instability evolution, turbulent flows, fluid dynamics and shock driven flows. If successful, the proposed research has the potential to radically transform simulation capabilities and help position the laboratory for computing at the exascale.
High-Order Wave Propagation Algorithms for Hyperbolic Systems
Ketcheson, David I.
2013-01-22
We present a finite volume method that is applicable to hyperbolic PDEs including spatially varying and semilinear nonconservative systems. The spatial discretization, like that of the well-known Clawpack software, is based on solving Riemann problems and calculating fluctuations (not fluxes). The implementation employs weighted essentially nonoscillatory reconstruction in space and strong stability preserving Runge--Kutta integration in time. The method can be extended to arbitrarily high order of accuracy and allows a well-balanced implementation for capturing solutions of balance laws near steady state. This well-balancing is achieved through the $f$-wave Riemann solver and a novel wave-slope WENO reconstruction procedure. The wide applicability and advantageous properties of the method are demonstrated through numerical examples, including problems in nonconservative form, problems with spatially varying fluxes, and problems involving near-equilibrium solutions of balance laws.
High-order multiphoton ionization photoelectron spectroscopy of NO
Carman, H.S. Jr.; Compton, R.N.
1987-01-01
Photoelectron energy angular distributions of NO following three different high-order multiphoton ionization (MPI) schemes have been measured. The 3 + 3 resonantly enhanced multiphoton ionization (REMPI) via the A 2 Σ + (v=O) level yielded a distribution of electron energies corresponding to all accessible vibrational levels (v + =O-6) of the nascent ion. Angular distributions of electrons corresponding to v + =O and v + =3 were significantly different. The 3 + 2 REMPI via the A 2 Σ + (v=1) level produced only one low-energy electron peak (v + =1). Nonresonant MPI at 532 nm yielded a distribution of electron energies corresponding to both four- and five-photon ionization. Prominent peaks in the five-photon photoelectron spectrum (PES) suggest contributions from near-resonant states at the three-photon level. 4 refs., 3 figs
Field emission from the surface of highly ordered pyrolytic graphite
Knápek, Alexandr, E-mail: knapek@isibrno.cz [Institute of Scientific Instruments of the ASCR, v.v.i., Královopolská 147, Brno (Czech Republic); Sobola, Dinara; Tománek, Pavel [Department of Physics, FEEC, Brno University of Technology, Technická 8, Brno (Czech Republic); Pokorná, Zuzana; Urbánek, Michal [Institute of Scientific Instruments of the ASCR, v.v.i., Královopolská 147, Brno (Czech Republic)
2017-02-15
Highlights: • HOPG shreds were created and analyzed in the UHV conditions. • Current-voltage measurements have been done to confirm electron tunneling, based on the Fowler-Nordheim theory. • Surface was characterized by other surface evaluation methods, in particular by: SNOM, SEM and AFM. - Abstract: This paper deals with the electrical characterization of highly ordered pyrolytic graphite (HOPG) surface based on field emission of electrons. The effect of field emission occurs only at disrupted surface, i.e. surface containing ripped and warped shreds of the uppermost layers of graphite. These deformations provide the necessary field gradients which are required for measuring tunneling current caused by field electron emission. Results of the field emission measurements are correlated with other surface characterization methods such as scanning near-field optical microscopy (SNOM) or atomic force microscopy.
Reduced order surrogate modelling (ROSM) of high dimensional deterministic simulations
Mitry, Mina
Often, computationally expensive engineering simulations can prohibit the engineering design process. As a result, designers may turn to a less computationally demanding approximate, or surrogate, model to facilitate their design process. However, owing to the the curse of dimensionality, classical surrogate models become too computationally expensive for high dimensional data. To address this limitation of classical methods, we develop linear and non-linear Reduced Order Surrogate Modelling (ROSM) techniques. Two algorithms are presented, which are based on a combination of linear/kernel principal component analysis and radial basis functions. These algorithms are applied to subsonic and transonic aerodynamic data, as well as a model for a chemical spill in a channel. The results of this thesis show that ROSM can provide a significant computational benefit over classical surrogate modelling, sometimes at the expense of a minor loss in accuracy.
Field emission from the surface of highly ordered pyrolytic graphite
Knápek, Alexandr; Sobola, Dinara; Tománek, Pavel; Pokorná, Zuzana; Urbánek, Michal
2017-01-01
Highlights: • HOPG shreds were created and analyzed in the UHV conditions. • Current-voltage measurements have been done to confirm electron tunneling, based on the Fowler-Nordheim theory. • Surface was characterized by other surface evaluation methods, in particular by: SNOM, SEM and AFM. - Abstract: This paper deals with the electrical characterization of highly ordered pyrolytic graphite (HOPG) surface based on field emission of electrons. The effect of field emission occurs only at disrupted surface, i.e. surface containing ripped and warped shreds of the uppermost layers of graphite. These deformations provide the necessary field gradients which are required for measuring tunneling current caused by field electron emission. Results of the field emission measurements are correlated with other surface characterization methods such as scanning near-field optical microscopy (SNOM) or atomic force microscopy.
Guo, Zhongyi; Zhu, Lie; Guo, Kai; Shen, Fei; Yin, Zhiping
2017-08-01
In this paper, a high-order dielectric metasurface based on silicon nanobrick array is proposed and investigated. By controlling the length and width of the nanobricks, the metasurfaces could supply two different incremental transmission phases for the X-linear-polarized (XLP) and Y-linear-polarized (YLP) light with extremely high efficiency over 88%. Based on the designed metasurface, two polarization beam splitters working in high-order diffraction modes have been designed successfully, which demonstrated a high transmitted efficiency. In addition, we have also designed two vortex-beam generators working in high-order diffraction modes to create vortex beams with the topological charges of 2 and 3. The employment of dielectric metasurfaces operating in high-order diffraction modes could pave the way for a variety of new ultra-efficient optical devices.
Solving the Rational Polynomial Coefficients Based on L Curve
Zhou, G.; Li, X.; Yue, T.; Huang, W.; He, C.; Huang, Y.
2018-05-01
The rational polynomial coefficients (RPC) model is a generalized sensor model, which can achieve high approximation accuracy. And it is widely used in the field of photogrammetry and remote sensing. Least square method is usually used to determine the optimal parameter solution of the rational function model. However the distribution of control points is not uniform or the model is over-parameterized, which leads to the singularity of the coefficient matrix of the normal equation. So the normal equation becomes ill conditioned equation. The obtained solutions are extremely unstable and even wrong. The Tikhonov regularization can effectively improve and solve the ill conditioned equation. In this paper, we calculate pathological equations by regularization method, and determine the regularization parameters by L curve. The results of the experiments on aerial format photos show that the accuracy of the first-order RPC with the equal denominators has the highest accuracy. The high order RPC model is not necessary in the processing of dealing with frame images, as the RPC model and the projective model are almost the same. The result shows that the first-order RPC model is basically consistent with the strict sensor model of photogrammetry. Orthorectification results both the firstorder RPC model and Camera Model (ERDAS9.2 platform) are similar to each other, and the maximum residuals of X and Y are 0.8174 feet and 0.9272 feet respectively. This result shows that RPC model can be used in the aerial photographic compensation replacement sensor model.
Algebraic polynomials with random coefficients
K. Farahmand
2002-01-01
Full Text Available This paper provides an asymptotic value for the mathematical expected number of points of inflections of a random polynomial of the form a0(ω+a1(ω(n11/2x+a2(ω(n21/2x2+…an(ω(nn1/2xn when n is large. The coefficients {aj(w}j=0n, w∈Ω are assumed to be a sequence of independent normally distributed random variables with means zero and variance one, each defined on a fixed probability space (A,Ω,Pr. A special case of dependent coefficients is also studied.
Improved multivariate polynomial factoring algorithm
Wang, P.S.
1978-01-01
A new algorithm for factoring multivariate polynomials over the integers based on an algorithm by Wang and Rothschild is described. The new algorithm has improved strategies for dealing with the known problems of the original algorithm, namely, the leading coefficient problem, the bad-zero problem and the occurrence of extraneous factors. It has an algorithm for correctly predetermining leading coefficients of the factors. A new and efficient p-adic algorithm named EEZ is described. Bascially it is a linearly convergent variable-by-variable parallel construction. The improved algorithm is generally faster and requires less store then the original algorithm. Machine examples with comparative timing are included
Fourier series and orthogonal polynomials
Jackson, Dunham
2004-01-01
This text for undergraduate and graduate students illustrates the fundamental simplicity of the properties of orthogonal functions and their developments in related series. Starting with a definition and explanation of the elements of Fourier series, the text follows with examinations of Legendre polynomials and Bessel functions. Boundary value problems consider Fourier series in conjunction with Laplace's equation in an infinite strip and in a rectangle, with a vibrating string, in three dimensions, in a sphere, and in other circumstances. An overview of Pearson frequency functions is followe
Orthogonal polynomials and random matrices
Deift, Percy
2000-01-01
This volume expands on a set of lectures held at the Courant Institute on Riemann-Hilbert problems, orthogonal polynomials, and random matrix theory. The goal of the course was to prove universality for a variety of statistical quantities arising in the theory of random matrix models. The central question was the following: Why do very general ensembles of random n {\\times} n matrices exhibit universal behavior as n {\\rightarrow} {\\infty}? The main ingredient in the proof is the steepest descent method for oscillatory Riemann-Hilbert problems.
Introduction to Real Orthogonal Polynomials
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
Banks, H T; Birch, Malcolm J; Brewin, Mark P; Greenwald, Stephen E; Hu, Shuhua; Kenz, Zackary R; Kruse, Carola; Maischak, Matthias; Shaw, Simon; Whiteman, John R
2014-04-13
We revisit a method originally introduced by Werder et al. (in Comput. Methods Appl. Mech. Engrg., 190:6685-6708, 2001) for temporally discontinuous Galerkin FEMs applied to a parabolic partial differential equation. In that approach, block systems arise because of the coupling of the spatial systems through inner products of the temporal basis functions. If the spatial finite element space is of dimension D and polynomials of degree r are used in time, the block system has dimension ( r + 1) D and is usually regarded as being too large when r > 1. Werder et al. found that the space-time coupling matrices are diagonalizable over [Formula: see text] for r ⩽ 100, and this means that the time-coupled computations within a time step can actually be decoupled. By using either continuous Galerkin or spectral element methods in space, we apply this DG-in-time methodology, for the first time, to second-order wave equations including elastodynamics with and without Kelvin-Voigt and Maxwell-Zener viscoelasticity. An example set of numerical results is given to demonstrate the favourable effect on error and computational work of the moderately high-order (up to degree 7) temporal and spatio-temporal approximations, and we also touch on an application of this method to an ambitious problem related to the diagnosis of coronary artery disease. Copyright © 2014 The Authors. International Journal for Numerical Methods in Engineering published by John Wiley & Sons Ltd.
Tsugio Fukuchi
2014-06-01
Full Text Available The finite difference method (FDM based on Cartesian coordinate systems can be applied to numerical analyses over any complex domain. A complex domain is usually taken to mean that the geometry of an immersed body in a fluid is complex; here, it means simply an analytical domain of arbitrary configuration. In such an approach, we do not need to treat the outer and inner boundaries differently in numerical calculations; both are treated in the same way. Using a method that adopts algebraic polynomial interpolations in the calculation around near-wall elements, all the calculations over irregular domains reduce to those over regular domains. Discretization of the space differential in the FDM is usually derived using the Taylor series expansion; however, if we use the polynomial interpolation systematically, exceptional advantages are gained in deriving high-order differences. In using the polynomial interpolations, we can numerically solve the Poisson equation freely over any complex domain. Only a particular type of partial differential equation, Poisson's equations, is treated; however, the arguments put forward have wider generality in numerical calculations using the FDM.
A companion matrix for 2-D polynomials
Boudellioua, M.S.
1995-08-01
In this paper, a matrix form analogous to the companion matrix which is often encountered in the theory of one dimensional (1-D) linear systems is suggested for a class of polynomials in two indeterminates and real coefficients, here referred to as two dimensional (2-D) polynomials. These polynomials arise in the context of 2-D linear systems theory. Necessary and sufficient conditions are also presented under which a matrix is equivalent to this companion form. (author). 6 refs
A new Arnoldi approach for polynomial eigenproblems
Raeven, F.A.
1996-12-31
In this paper we introduce a new generalization of the method of Arnoldi for matrix polynomials. The new approach is compared with the approach of rewriting the polynomial problem into a linear eigenproblem and applying the standard method of Arnoldi to the linearised problem. The algorithm that can be applied directly to the polynomial eigenproblem turns out to be more efficient, both in storage and in computation.
M-Polynomial and Related Topological Indices of Nanostar Dendrimers
Mobeen Munir
2016-09-01
Full Text Available Dendrimers are highly branched organic macromolecules with successive layers of branch units surrounding a central core. The M-polynomial of nanotubes has been vastly investigated as it produces many degree-based topological indices. These indices are invariants of the topology of graphs associated with molecular structure of nanomaterials to correlate certain physicochemical properties like boiling point, stability, strain energy, etc. of chemical compounds. In this paper, we first determine M-polynomials of some nanostar dendrimers and then recover many degree-based topological indices.
Bayer Demosaicking with Polynomial Interpolation.
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.
High-order adaptive secondary mirrors: where are we?
Salinari, Piero; Sandler, David G.
1998-09-01
We discuss the current developments and the perspective performances of adaptive secondary mirrors for high order adaptive a correction on large ground based telescopes. The development of the basic techniques involved a large collaborative effort of public research Institutes and of private companies is now essentially complete. The next crucial step will be the construction of an adaptive secondary mirror for the 6.5 m MMT. Problems such as the fabrication of very thin mirrors, the low cost implementation of fast position sensors, of efficient and compact electromagnetic actuators, of the control and communication electronics, of the actuator control system, of the thermal control and of the mechanical layout can be considered as solved, in some cases with more than one viable solution. To verify performances at system level two complete prototypes have been built and tested, one at ThermoTrex and the other at Arcetri. The two prototypes adopt the same basic approach concerning actuators, sensor and support of the thin mirror, but differ in a number of aspects such as the material of the rigid back plate used as reference for the thin mirror, the number and surface density of the actuators, the solution adopted for the removal of the heat, and the design of the electronics. We discuss how the results obtained by of the two prototypes and by numerical simulations will guide the design of full size adaptive secondary units.
Analytical and experimental study of high phase order induction motors
Klingshirn, Eugene A.
1989-01-01
Induction motors having more than three phases were investigated to determine their suitability for electric vehicle applications. The objective was to have a motor with a current rating lower than that of a three-phase motor. The name chosen for these is high phase order (HPO) motors. Motors having six phases and nine phases were given the most attention. It was found that HPO motors are quite suitable for electric vehicles, and for many other applications as well. They have characteristics which are as good as or better than three-phase motors for practically all applications where polyphase induction motors are appropriate. Some of the analysis methods are presented, and several of the equivalent circuits which facilitate the determination of harmonic currents and losses, or currents with unbalanced sources, are included. The sometimes large stator currents due to harmonics in the source voltages are pointed out. Filters which can limit these currents were developed. An analysis and description of these filters is included. Experimental results which confirm and illustrate much of the theory are also included. These include locked rotor test results and full-load performance with an open phase. Also shown are oscillograms which display the reduction in harmonic currents when a filter is used with the experimental motor supplied by a non-sinusoidal source.
Application of high-order uncertainty for severe accident management
Yu, Donghan; Ha, Jaejoo
1998-01-01
The use of probability distribution to represent uncertainty about point-valued probabilities has been a controversial subject. Probability theorists have argued that it is inherently meaningless to be uncertain about a probability since this appears to violate the subjectivists' assumption that individual can develop unique and precise probability judgments. However, many others have found the concept of uncertainty about the probability to be both intuitively appealing and potentially useful. Especially, high-order uncertainty, i.e., the uncertainty about the probability, can be potentially relevant to decision-making when expert's judgment is needed under very uncertain data and imprecise knowledge and where the phenomena and events are frequently complicated and ill-defined. This paper presents two approaches for evaluating the uncertainties inherent in accident management strategies: 'a fuzzy probability' and 'an interval-valued subjective probability'. At first, this analysis considers accident management as a decision problem (i.e., 'applying a strategy' vs. 'do nothing') and uses an influence diagram. Then, the analysis applies two approaches above to evaluate imprecise node probabilities in the influence diagram. For the propagation of subjective probabilities, the analysis uses the Monte-Carlo simulation. In case of fuzzy probabilities, the fuzzy logic is applied to propagate them. We believe that these approaches can allow us to understand uncertainties associated with severe accident management strategy since they offer not only information similar to the classical approach using point-estimate values but also additional information regarding the impact from imprecise input data
Delay induced high order locking effects in semiconductor lasers
Kelleher, B.; Wishon, M. J.; Locquet, A.; Goulding, D.; Tykalewicz, B.; Huyet, G.; Viktorov, E. A.
2017-11-01
Multiple time scales appear in many nonlinear dynamical systems. Semiconductor lasers, in particular, provide a fertile testing ground for multiple time scale dynamics. For solitary semiconductor lasers, the two fundamental time scales are the cavity repetition rate and the relaxation oscillation frequency which is a characteristic of the field-matter interaction in the cavity. Typically, these two time scales are of very different orders, and mutual resonances do not occur. Optical feedback endows the system with a third time scale: the external cavity repetition rate. This is typically much longer than the device cavity repetition rate and suggests the possibility of resonances with the relaxation oscillations. We show that for lasers with highly damped relaxation oscillations, such resonances can be obtained and lead to spontaneous mode-locking. Two different laser types-—a quantum dot based device and a quantum well based device—are analysed experimentally yielding qualitatively identical dynamics. A rate equation model is also employed showing an excellent agreement with the experimental results.
High-Density Quantum Sensing with Dissipative First Order Transitions.
Raghunandan, Meghana; Wrachtrup, Jörg; Weimer, Hendrik
2018-04-13
The sensing of external fields using quantum systems is a prime example of an emergent quantum technology. Generically, the sensitivity of a quantum sensor consisting of N independent particles is proportional to sqrt[N]. However, interactions invariably occurring at high densities lead to a breakdown of the assumption of independence between the particles, posing a severe challenge for quantum sensors operating at the nanoscale. Here, we show that interactions in quantum sensors can be transformed from a nuisance into an advantage when strong interactions trigger a dissipative phase transition in an open quantum system. We demonstrate this behavior by analyzing dissipative quantum sensors based upon nitrogen-vacancy defect centers in diamond. Using both a variational method and a numerical simulation of the master equation describing the open quantum many-body system, we establish the existence of a dissipative first order transition that can be used for quantum sensing. We investigate the properties of this phase transition for two- and three-dimensional setups, demonstrating that the transition can be observed using current experimental technology. Finally, we show that quantum sensors based on dissipative phase transitions are particularly robust against imperfections such as disorder or decoherence, with the sensitivity of the sensor not being limited by the T_{2} coherence time of the device. Our results can readily be applied to other applications in quantum sensing and quantum metrology where interactions are currently a limiting factor.
High-order above-threshold dissociation of molecules
Lu, Peifen; Wang, Junping; Li, Hui; Lin, Kang; Gong, Xiaochun; Song, Qiying; Ji, Qinying; Zhang, Wenbin; Ma, Junyang; Li, Hanxiao; Zeng, Heping; He, Feng; Wu, Jian
2018-03-01
Electrons bound to atoms or molecules can simultaneously absorb multiple photons via the above-threshold ionization featured with discrete peaks in the photoelectron spectrum on account of the quantized nature of the light energy. Analogously, the above-threshold dissociation of molecules has been proposed to address the multiple-photon energy deposition in the nuclei of molecules. In this case, nuclear energy spectra consisting of photon-energy spaced peaks exceeding the binding energy of the molecular bond are predicted. Although the observation of such phenomena is difficult, this scenario is nevertheless logical and is based on the fundamental laws. Here, we report conclusive experimental observation of high-order above-threshold dissociation of H2 in strong laser fields where the tunneling-ionized electron transfers the absorbed multiphoton energy, which is above the ionization threshold to the nuclei via the field-driven inelastic rescattering. Our results provide an unambiguous evidence that the electron and nuclei of a molecule as a whole absorb multiple photons, and thus above-threshold ionization and above-threshold dissociation must appear simultaneously, which is the cornerstone of the nowadays strong-field molecular physics.
High-Density Quantum Sensing with Dissipative First Order Transitions
Raghunandan, Meghana; Wrachtrup, Jörg; Weimer, Hendrik
2018-04-01
The sensing of external fields using quantum systems is a prime example of an emergent quantum technology. Generically, the sensitivity of a quantum sensor consisting of N independent particles is proportional to √{N }. However, interactions invariably occurring at high densities lead to a breakdown of the assumption of independence between the particles, posing a severe challenge for quantum sensors operating at the nanoscale. Here, we show that interactions in quantum sensors can be transformed from a nuisance into an advantage when strong interactions trigger a dissipative phase transition in an open quantum system. We demonstrate this behavior by analyzing dissipative quantum sensors based upon nitrogen-vacancy defect centers in diamond. Using both a variational method and a numerical simulation of the master equation describing the open quantum many-body system, we establish the existence of a dissipative first order transition that can be used for quantum sensing. We investigate the properties of this phase transition for two- and three-dimensional setups, demonstrating that the transition can be observed using current experimental technology. Finally, we show that quantum sensors based on dissipative phase transitions are particularly robust against imperfections such as disorder or decoherence, with the sensitivity of the sensor not being limited by the T2 coherence time of the device. Our results can readily be applied to other applications in quantum sensing and quantum metrology where interactions are currently a limiting factor.
Mode of conception of triplets and high order multiple pregnancies.
Basit, I
2012-03-01
A retrospective audit was performed of all high order multiple pregnancies (HOMPs) delivered in three maternity hospitals in Dublin between 1999 and 2008. The mode of conception for each pregnancy was established with a view to determining means of reducing their incidence. A total of 101 HOMPs occurred, 93 triplet, 7 quadruplet and 1 quintuplet. Information regarding the mode of conception was available for 78 (81%) pregnancies. Twenty eight (27.7%) were spontaneous, 34 (33.7%) followedlVF\\/ICSI\\/FET treatment (in-vitro fertilisation, intracytoplasmic sperm injection, frozen embryo transfer), 16 (15.8%) resulted from Clomiphene Citrate treatment and 6 (6%) followed ovulation induction with gonadotrophins. Triplet and HOMPs are a major cause of maternal, feta land neonatal morbidity. Many are iatrogenic, arising from fertility treatments including Clomiphene. Reducing the numbers of embryos transferred will address IVF\\/ICSI\\/FET-related multiple pregnancy rates and this is currently happening in Ireland. Clomiphene and gonadotrophins should only be prescribed when appropriate resources are available to monitor patients adequately.
High orders of perturbation theory. Are renormalons significant?
Suslov, I.M.
1999-01-01
According to Lipatov [Sov. Phys. JETP 45, 216 (1977)], the high orders of perturbation theory are determined by saddle-point configurations, i.e., instantons, which correspond to functional integrals. According to another opinion, the contributions of individual large diagrams, i.e., renormalons, which, according to t'Hooft [The Whys of Subnuclear Physics: Proceedings of the 1977 International School of Subnuclear Physics (Erice, Trapani, Sicily, 1977), A. Zichichi (Ed.), Plenum Press, New York (1979)], are not contained in the Lipatov contribution, are also significant. The history of the conception of renormalons is presented, and the arguments in favor of and against their existence are discussed. The analytic properties of the Borel transforms of functional integrals, Green's functions, vertex parts, and scaling functions are investigated in the case of φ 4 theory. Their analyticity in a complex plane with a cut from the first instanton singularity to infinity (the Le Guillou-Zinn-Justin hypothesis [Phys. Rev. Lett. 39, 95 (1977); Phys. Rev. B 21, 3976 (1980)] is proved. It rules out the existence of the renormalon singularities pointed out by t'Hooft and demonstrates the nonconstructiveness of the conception of renormalons as a whole. The results can be interpreted as an indication of the internal consistency of φ 4 theory
Fermionic formula for double Kostka polynomials
Liu, Shiyuan
2016-01-01
The $X=M$ conjecture asserts that the $1D$ sum and the fermionic formula coincide up to some constant power. In the case of type $A,$ both the $1D$ sum and the fermionic formula are closely related to Kostka polynomials. Double Kostka polynomials $K_{\\Bla,\\Bmu}(t),$ indexed by two double partitions $\\Bla,\\Bmu,$ are polynomials in $t$ introduced as a generalization of Kostka polynomials. In the present paper, we consider $K_{\\Bla,\\Bmu}(t)$ in the special case where $\\Bmu=(-,\\mu'').$ We formula...
Polynomial sequences generated by infinite Hessenberg matrices
Verde-Star Luis
2017-01-01
Full Text Available We show that an infinite lower Hessenberg matrix generates polynomial sequences that correspond to the rows of infinite lower triangular invertible matrices. Orthogonal polynomial sequences are obtained when the Hessenberg matrix is tridiagonal. We study properties of the polynomial sequences and their corresponding matrices which are related to recurrence relations, companion matrices, matrix similarity, construction algorithms, and generating functions. When the Hessenberg matrix is also Toeplitz the polynomial sequences turn out to be of interpolatory type and we obtain additional results. For example, we show that every nonderogative finite square matrix is similar to a unique Toeplitz-Hessenberg matrix.
High-brightness high-order harmonic generation at 13 nm with a long gas jet
Kim, Hyung Taek; Kim, I Jong; Lee, Dong Gun; Park, Jong Ju; Hong, Kyung Han; Nam, Chang Hee
2002-01-01
The generation of high-order harmonics is well-known method producing coherent extreme-ultraviolet radiation with pulse duration in the femtosecond regime. High-order harmonics have attracted much attention due to their unique features such as coherence, ultrashort pulse duration, and table-top scale system. Due to these unique properties, high-order harmonics have many applications of atomic and molecular spectroscopy, plasma diagnostics and solid-state physics. Bright generation of high-order harmonics is important for actual applications. Especially, the generation of strong well-collimated harmonics at 13 nm can be useful for the metrology of EUV lithography optics because of the high reflectivity of Mo-Si mirrors at this wavelength. The generation of bright high-order harmonics is rather difficult in the wavelength region below 15nm. Though argon and xenon gases have large conversion efficiency, harmonic generation from these gases is restricted to wavelengths over 20 nm due to low ionization potential. Hence, we choose neon for the harmonic generation around 13 nm; it has larger conversion efficiency than helium and higher ionization potential than argon. In this experiment, we have observed enhanced harmonic generation efficiency and low beam divergence of high-order harmonics from a elongated neon gas jet by the enhancement of laser propagation in an elongated gas jet. A uniform plasma column was produced when the gas jet was exposed to converging laser pulses.
Order Reduction in High-Order Runge-Kutta Methods for Initial Boundary Value Problems
Rosales, Rodolfo Ruben; Seibold, Benjamin; Shirokoff, David; Zhou, Dong
2017-01-01
This paper studies the order reduction phenomenon for initial-boundary-value problems that occurs with many Runge-Kutta time-stepping schemes. First, a geometric explanation of the mechanics of the phenomenon is provided: the approximation error develops boundary layers, induced by a mismatch between the approximation error in the interior and at the boundaries. Second, an analysis of the modes of the numerical scheme is conducted, which explains under which circumstances boundary layers pers...
Cheap arbitrary high order methods for single integrand SDEs
Debrabant, Kristian; Kværnø, Anne
2017-01-01
For a particular class of Stratonovich SDE problems, here denoted as single integrand SDEs, we prove that by applying a deterministic Runge-Kutta method of order $p_d$ we obtain methods converging in the mean-square and weak sense with order $\\lfloor p_d/2\\rfloor$. The reason is that the B-series...
High-order noise filtering in nontrivial quantum logic gates
Green, T
2012-07-01
Full Text Available composed of arbitrary control sequences. We present a general method to calculate the ensemble-averaged entanglement fidelity to arbitrary order in terms of noise filter functions, and provide explicit expressions to fourth order in the noise strength...
Optimized low-order explicit Runge-Kutta schemes for high- order spectral difference method
Parsani, Matteo
2012-01-01
Optimal explicit Runge-Kutta (ERK) schemes with large stable step sizes are developed for method-of-lines discretizations based on the spectral difference (SD) spatial discretization on quadrilateral grids. These methods involve many stages and provide the optimal linearly stable time step for a prescribed SD spectrum and the minimum leading truncation error coefficient, while admitting a low-storage implementation. Using a large number of stages, the new ERK schemes lead to efficiency improvements larger than 60% over standard ERK schemes for 4th- and 5th-order spatial discretization.
Root and critical point behaviors of certain sums of polynomials
Seon-Hong Kim
2018-04-24
Apr 24, 2018 ... Root and critical point behaviors of certain sums of polynomials. SEON-HONG KIM1,∗. , SUNG YOON KIM2, TAE HYUNG KIM2 and SANGHEON LEE2. 1Department of Mathematics, Sookmyung Women's University, Seoul 140-742, Korea. 2Gyeonggi Science High School, Suwon 440-800, Korea.
Fabrication of highly ordered nanoporous alumina films by stable high-field anodization
Li Yanbo; Zheng Maojun; Ma Li; Shen Wenzhong
2006-01-01
Stable high-field anodization (1500-4000 A m -2 ) for the fabrication of highly ordered porous anodic alumina films has been realized in a H 3 PO 4 -H 2 O-C 2 H 5 OH system. By maintaining the self-ordering voltage and adjusting the anodizing current density, high-quality self-ordered alumina films with a controllable inter-pore distance over a large range are achieved. The high anodizing current densities lead to high-speed film growth (4-10 μm min -1 ). The inter-pore distance is not solely dependent on the anodizing voltage, but is also influenced by the anodizing current density. This approach is simple and cost-effective, and is of great value for applications in diverse areas of nanotechnology
Inverse kinematics algorithm for a six-link manipulator using a polynomial expression
Sasaki, Shinobu
1987-01-01
This report is concerned with the forward and inverse kinematics problem relevant to a six-link robot manipulator. In order to derive the kinematic relationships between links, the vector rotation operator was applied instead of the conventional homogeneous transformation. The exact algorithm for solving the inverse problem was obtained by transforming kinematics equations into a polynomial. As shown in test calculations, the accuracies of numerical solutions obtained by means of the present approach are found to be quite high. The algorithm proposed permits to find out all feasible solutions for the given inverse problem. (author)
Fluctuations of order parameters in the high Tc superconductors
Das, M.P.; Saif, A.G.
1987-07-01
Recently we have proposed a phenomenological approach in terms of two coexisting macroscopic order parameters corresponding to the superconducting and insulating states and have discussed the electrodynamical responses of the superconducting ceramics. In this paper we discuss the fluctuations of the order parameters both in the static and in the dynamical situations in the mean field approach and obtain results for the electrical conductivity which possesses anomalies as in granular materials. (author). 22 refs
Polynomials formalism of quantum numbers
Kazakov, K.V.
2005-01-01
Theoretical aspects of the recently suggested perturbation formalism based on the method of quantum number polynomials are considered in the context of the general anharmonicity problem. Using a biatomic molecule by way of example, it is demonstrated how the theory can be extrapolated to the case of vibrational-rotational interactions. As a result, an exact expression for the first coefficient of the Herman-Wallis factor is derived. In addition, the basic notions of the formalism are phenomenologically generalized and expanded to the problem of spin interaction. The concept of magneto-optical anharmonicity is introduced. As a consequence, an exact analogy is drawn with the well-known electro-optical theory of molecules, and a nonlinear dependence of the magnetic dipole moment of the system on the spin and wave variables is established [ru
Polynomial solutions of nonlinear integral equations
Dominici, Diego
2009-01-01
We analyze the polynomial solutions of a nonlinear integral equation, generalizing the work of Bender and Ben-Naim (2007 J. Phys. A: Math. Theor. 40 F9, 2008 J. Nonlinear Math. Phys. 15 (Suppl. 3) 73). We show that, in some cases, an orthogonal solution exists and we give its general form in terms of kernel polynomials
Sibling curves of quadratic polynomials | Wiggins | Quaestiones ...
Sibling curves were demonstrated in [1, 2] as a novel way to visualize the zeroes of real valued functions. In [3] it was shown that a polynomial of degree n has n sibling curves. This paper focuses on the algebraic and geometric properites of the sibling curves of real and complex quadratic polynomials. Key words: Quadratic ...
Topological string partition functions as polynomials
Yamaguchi, Satoshi; Yau Shingtung
2004-01-01
We investigate the structure of the higher genus topological string amplitudes on the quintic hypersurface. It is shown that the partition functions of the higher genus than one can be expressed as polynomials of five generators. We also compute the explicit polynomial forms of the partition functions for genus 2, 3, and 4. Moreover, some coefficients are written down for all genus. (author)
Polynomial solutions of nonlinear integral equations
Dominici, Diego [Department of Mathematics, State University of New York at New Paltz, 1 Hawk Dr. Suite 9, New Paltz, NY 12561-2443 (United States)], E-mail: dominicd@newpaltz.edu
2009-05-22
We analyze the polynomial solutions of a nonlinear integral equation, generalizing the work of Bender and Ben-Naim (2007 J. Phys. A: Math. Theor. 40 F9, 2008 J. Nonlinear Math. Phys. 15 (Suppl. 3) 73). We show that, in some cases, an orthogonal solution exists and we give its general form in terms of kernel polynomials.
A generalization of the Bernoulli polynomials
Pierpaolo Natalini
2003-01-01
Full Text Available A generalization of the Bernoulli polynomials and, consequently, of the Bernoulli numbers, is defined starting from suitable generating functions. Furthermore, the differential equations of these new classes of polynomials are derived by means of the factorization method introduced by Infeld and Hull (1951.
The Bessel polynomials and their differential operators
Onyango Otieno, V.P.
1987-10-01
Differential operators associated with the ordinary and the generalized Bessel polynomials are defined. In each case the commutator bracket is constructed and shows that the differential operators associated with the Bessel polynomials and their generalized form are not commutative. Some applications of these operators to linear differential equations are also discussed. (author). 4 refs
Large degree asymptotics of generalized Bessel polynomials
J.L. López; N.M. Temme (Nico)
2011-01-01
textabstractAsymptotic expansions are given for large values of $n$ of the generalized Bessel polynomials $Y_n^\\mu(z)$. The analysis is based on integrals that follow from the generating functions of the polynomials. A new simple expansion is given that is valid outside a compact neighborhood of the
Exceptional polynomials and SUSY quantum mechanics
Abstract. We show that for the quantum mechanical problem which admit classical Laguerre/. Jacobi polynomials as solutions for the Schrödinger equations (SE), will also admit exceptional. Laguerre/Jacobi polynomials as solutions having the same eigenvalues but with the ground state missing after a modification of the ...
Connections between the matching and chromatic polynomials
E. J. Farrell
1992-01-01
Full Text Available The main results established are (i a connection between the matching and chromatic polynomials and (ii a formula for the matching polynomial of a general complement of a subgraph of a graph. Some deductions on matching and chromatic equivalence and uniqueness are made.
Laguerre polynomials by a harmonic oscillator
Baykal, Melek; Baykal, Ahmet
2014-09-01
The study of an isotropic harmonic oscillator, using the factorization method given in Ohanian's textbook on quantum mechanics, is refined and some collateral extensions of the method related to the ladder operators and the associated Laguerre polynomials are presented. In particular, some analytical properties of the associated Laguerre polynomials are derived using the ladder operators.
Laguerre polynomials by a harmonic oscillator
Baykal, Melek; Baykal, Ahmet
2014-01-01
The study of an isotropic harmonic oscillator, using the factorization method given in Ohanian's textbook on quantum mechanics, is refined and some collateral extensions of the method related to the ladder operators and the associated Laguerre polynomials are presented. In particular, some analytical properties of the associated Laguerre polynomials are derived using the ladder operators. (paper)
Technique for image interpolation using polynomial transforms
Escalante Ramírez, B.; Martens, J.B.; Haskell, G.G.; Hang, H.M.
1993-01-01
We present a new technique for image interpolation based on polynomial transforms. This is an image representation model that analyzes an image by locally expanding it into a weighted sum of orthogonal polynomials. In the discrete case, the image segment within every window of analysis is
Factoring polynomials over arbitrary finite fields
Lange, T.; Winterhof, A.
2000-01-01
We analyse an extension of Shoup's (Inform. Process. Lett. 33 (1990) 261–267) deterministic algorithm for factoring polynomials over finite prime fields to arbitrary finite fields. In particular, we prove the existence of a deterministic algorithm which completely factors all monic polynomials of
Application of polynomial preconditioners to conservation laws
Geurts, Bernardus J.; van Buuren, R.; Lu, H.
2000-01-01
Polynomial preconditioners which are suitable in implicit time-stepping methods for conservation laws are reviewed and analyzed. The preconditioners considered are either based on a truncation of a Neumann series or on Chebyshev polynomials for the inverse of the system-matrix. The latter class of
De Basabe, Joná s D.; Sen, Mrinal K.
2010-01-01
popular in the recent past. We consider the Lax-Wendroff method (LWM) for time stepping and show that it allows for a larger time step than the classical leap-frog finite difference method, with higher-order accuracy. In particular the fourth-order LWM
Current advances on polynomial resultant formulations
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.
On the number of polynomial solutions of Bernoulli and Abel polynomial differential equations
Cima, A.; Gasull, A.; Mañosas, F.
2017-12-01
In this paper we determine the maximum number of polynomial solutions of Bernoulli differential equations and of some integrable polynomial Abel differential equations. As far as we know, the tools used to prove our results have not been utilized before for studying this type of questions. We show that the addressed problems can be reduced to know the number of polynomial solutions of a related polynomial equation of arbitrary degree. Then we approach to these equations either applying several tools developed to study extended Fermat problems for polynomial equations, or reducing the question to the computation of the genus of some associated planar algebraic curves.
Matrix product formula for Macdonald polynomials
Cantini, Luigi; de Gier, Jan; Wheeler, Michael
2015-09-01
We derive a matrix product formula for symmetric Macdonald polynomials. Our results are obtained by constructing polynomial solutions of deformed Knizhnik-Zamolodchikov equations, which arise by considering representations of the Zamolodchikov-Faddeev and Yang-Baxter algebras in terms of t-deformed bosonic operators. These solutions are generalized probabilities for particle configurations of the multi-species asymmetric exclusion process, and form a basis of the ring of polynomials in n variables whose elements are indexed by compositions. For weakly increasing compositions (anti-dominant weights), these basis elements coincide with non-symmetric Macdonald polynomials. Our formulas imply a natural combinatorial interpretation in terms of solvable lattice models. They also imply that normalizations of stationary states of multi-species exclusion processes are obtained as Macdonald polynomials at q = 1.
Matrix product formula for Macdonald polynomials
Cantini, Luigi; Gier, Jan de; Michael Wheeler
2015-01-01
We derive a matrix product formula for symmetric Macdonald polynomials. Our results are obtained by constructing polynomial solutions of deformed Knizhnik–Zamolodchikov equations, which arise by considering representations of the Zamolodchikov–Faddeev and Yang–Baxter algebras in terms of t-deformed bosonic operators. These solutions are generalized probabilities for particle configurations of the multi-species asymmetric exclusion process, and form a basis of the ring of polynomials in n variables whose elements are indexed by compositions. For weakly increasing compositions (anti-dominant weights), these basis elements coincide with non-symmetric Macdonald polynomials. Our formulas imply a natural combinatorial interpretation in terms of solvable lattice models. They also imply that normalizations of stationary states of multi-species exclusion processes are obtained as Macdonald polynomials at q = 1. (paper)
Arabic text classification using Polynomial Networks
Mayy M. Al-Tahrawi
2015-10-01
Full Text Available In this paper, an Arabic statistical learning-based text classification system has been developed using Polynomial Neural Networks. Polynomial Networks have been recently applied to English text classification, but they were never used for Arabic text classification. In this research, we investigate the performance of Polynomial Networks in classifying Arabic texts. Experiments are conducted on a widely used Arabic dataset in text classification: Al-Jazeera News dataset. We chose this dataset to enable direct comparisons of the performance of Polynomial Networks classifier versus other well-known classifiers on this dataset in the literature of Arabic text classification. Results of experiments show that Polynomial Networks classifier is a competitive algorithm to the state-of-the-art ones in the field of Arabic text classification.
Rodriguez, A. [Electrical Engineering Doctoral Program, Mechanical and Electrical Engineering Faculty, Autonomous University of Nuevo Leon, 66450 San Nicolas de los Garza, N.L. (Mexico)], E-mail: angelrdz@gmail.com; De Leon, J. [Electrical Engineering Doctoral Program, Mechanical and Electrical Engineering Faculty, Autonomous University of Nuevo Leon, 66450 San Nicolas de los Garza, N.L. (Mexico)], E-mail: drjleon@gmail.com; Fridman, L. [Department of Control, Division of Electrical Engineering, Engineering Faculty, National Autonomous University of Mexico, 04510 Mexico City (Mexico)], E-mail: lfridman@servidor.unam.mx
2009-12-15
The reduced-order synchronization problem of two chaotic systems (master-slave) with different dimension and relative degree is considered. A control scheme based on a high-order sliding-mode observer-identifier and a feedback state controller is proposed, where the trajectories of slave can be synchronized with a canonical projection of the master. Thus, the reduced-order synchronization is achieved in spite of master/slave mismatches. Simulation results are provided in order to illustrate the performance of the proposed synchronization scheme.
Rodriguez, A.; De Leon, J.; Fridman, L.
2009-01-01
The reduced-order synchronization problem of two chaotic systems (master-slave) with different dimension and relative degree is considered. A control scheme based on a high-order sliding-mode observer-identifier and a feedback state controller is proposed, where the trajectories of slave can be synchronized with a canonical projection of the master. Thus, the reduced-order synchronization is achieved in spite of master/slave mismatches. Simulation results are provided in order to illustrate the performance of the proposed synchronization scheme.
High-order noise filtering in nontrivial quantum logic gates.
Green, Todd; Uys, Hermann; Biercuk, Michael J
2012-07-13
Treating the effects of a time-dependent classical dephasing environment during quantum logic operations poses a theoretical challenge, as the application of noncommuting control operations gives rise to both dephasing and depolarization errors that must be accounted for in order to understand total average error rates. We develop a treatment based on effective Hamiltonian theory that allows us to efficiently model the effect of classical noise on nontrivial single-bit quantum logic operations composed of arbitrary control sequences. We present a general method to calculate the ensemble-averaged entanglement fidelity to arbitrary order in terms of noise filter functions, and provide explicit expressions to fourth order in the noise strength. In the weak noise limit we derive explicit filter functions for a broad class of piecewise-constant control sequences, and use them to study the performance of dynamically corrected gates, yielding good agreement with brute-force numerics.
Fabrication of high quality ordered porous anodic aluminum oxide templates
Liu Kai; Du Kai; Chen Jing; Zhou Lan; Zhang Lin; Fang Yu
2010-01-01
The preparation of porous anodic aluminum oxide (AAO) templates has been studied with oxalic acid as electrolyte. The morphology of the as-prepared templates has been characterized by field-emission scanning electron microscope (FE-SEM). The pores distributed orderly and uniformly with the diameter ranging from 40 nm to 70 nm. The experimental results indicate that electrolyte concentration, oxidation voltage, oxidation temperature and oxidation time affect the structure of AAO templates. Ordered porous AAO templates can be derived without annealing and finishing. X-ray diffraction (XRD) analysis indicates that the aluminum oxide film is mainly composed of amorphous Al 2 O 3 . (authors)
Angel, Jordan B.; Banks, Jeffrey W.; Henshaw, William D.
2018-01-01
High-order accurate upwind approximations for the wave equation in second-order form on overlapping grids are developed. Although upwind schemes are well established for first-order hyperbolic systems, it was only recently shown by Banks and Henshaw [1] how upwinding could be incorporated into the second-order form of the wave equation. This new upwind approach is extended here to solve the time-domain Maxwell's equations in second-order form; schemes of arbitrary order of accuracy are formulated for general curvilinear grids. Taylor time-stepping is used to develop single-step space-time schemes, and the upwind dissipation is incorporated by embedding the exact solution of a local Riemann problem into the discretization. Second-order and fourth-order accurate schemes are implemented for problems in two and three space dimensions, and overlapping grids are used to treat complex geometry and problems with multiple materials. Stability analysis of the upwind-scheme on overlapping grids is performed using normal mode theory. The stability analysis and computations confirm that the upwind scheme remains stable on overlapping grids, including the difficult case of thin boundary grids when the traditional non-dissipative scheme becomes unstable. The accuracy properties of the scheme are carefully evaluated on a series of classical scattering problems for both perfect conductors and dielectric materials in two and three space dimensions. The upwind scheme is shown to be robust and provide high-order accuracy.
Model order reduction for complex high-tech systems
Lutowska, A.; Hochstenbach, M.E.; Schilders, W.H.A.; Michielsen, B.; Poirier, J.R.
2012-01-01
This paper presents a computationally efficient model order reduction (MOR) technique for interconnected systems. This MOR technique preserves block structures and zero blocks and exploits separate MOR approximations for the individual sub-systems in combination with low rank approximations for the
High-order harmonics from bow wave caustics driven by a high-intensity laser
Pirozhkov, A.S.; Kando, M.; Esirkepov, T.Zh.
2012-01-01
We propose a new mechanism of high-order harmonic generation during an interaction of a high-intensity laser pulse with underdense plasma. A tightly focused laser pulse creates a cavity in plasma pushing electrons aside and exciting the wake wave and the bow wave. At the joint of the cavity wall and the bow wave boundary, an annular spike of electron density is formed. This spike surrounds the cavity and moves together with the laser pulse. Collective motion of electrons in the spike driven by the laser field generates high-order harmonics. A strong localization of the electron spike, its robustness to oscillations imposed by the laser field and, consequently, its ability to produce high-order harmonics is explained by catastrophe theory. The proposed mechanism explains the experimental observations of high-order harmonics with the 9 TW J-KAREN laser (JAEA, Japan) and the 120 TW Astra Gemini laser (CLF RAL, UK) [A. S. Pirozhkov, et al., arXiv:1004.4514 (2010); A. S. Pirozhkov et al, AIP Proceedings, this volume]. The theory is corroborated by high-resolution two-and three-dimensional particle-in-cell simulations.
FEA identification of high order generalized equivalent circuits for MF high voltage transformers
Candolfi, Sylvain; Cros, Jérôme; Aguglia, Davide
2015-01-01
This paper presents a specific methodology to derive high order generalized equivalent circuits from electromagnetic finite element analysis for high voltage medium frequency and pulse transformers by splitting the main windings in an arbitrary number of elementary windings. With this modeling approach, the dynamic model of the transformer over a large bandwidth is improved and the order of the generalized equivalent circuit can be adapted to a specified bandwidth. This efficient tool can be used by the designer to quantify the influence of the local structure of transformers on their dynamic behavior. The influence of different topologies and winding configurations is investigated. Several application examples and an experimental validation are also presented.
Fabrication and structural characterization of highly ordered titania nanotube arrays
Shi, Hongtao; Ordonez, Rosita
Titanium (Ti) dioxide nanotubes have drawn much attention in the past decade due to the fact that titania is an extremely versatile material with a variety of technological applications. Anodizing Ti in different electrolytes has proved to be quite successful so far in creating the nanotubes, however, their degree of order is still not nearly as good as nanoporous anodic alumina. In this work, we first deposit a thin layer of aluminum (Al) onto electropolished Ti substrates, using thermal evaporation. Such an Al layer is then anodized in 0.3 M oxalic acid, forming an ordered nanoporous alumina mask on top of Ti. Afterwards, the anodization of Ti is accomplished at 20 V in solutions containing 1 M NaH2PO4 and 0.5% HF or H2SO4, which results in the creation of ordered titania nanotube arrays. The inner pore diameter of the nanotubes can be tuned from ~50 nm to ~75 nm, depending on the anodization voltage applied to Al or Ti. X-ray diffractometry shows the as-grown titania nanotubes are amorphous. Samples annealed at different temperatures in ambient atmosphere will be also reported.
New high order FDTD method to solve EMC problems
N. Deymier
2015-10-01
Full Text Available In electromagnetic compatibility (EMC context, we are interested in developing new ac- curate methods to solve efficiently and accurately Maxwell’s equations in the time domain. Indeed, usual methods such as FDTD or FVTD present im- portant dissipative and/or dispersive errors which prevent to obtain a good numerical approximation of the physical solution for a given industrial scene unless we use a mesh with a very small cell size. To avoid this problem, schemes like the Discontinuous Galerkin (DG method, based on higher order spa- tial approximations, have been introduced and stud- ied on unstructured meshes. However the cost of this kind of method can become prohibitive accord- ing to the mesh used. In this paper, we first present a higher order spatial approximation method on carte- sian meshes. It is based on a finite element ap- proach and recovers at the order 1 the well-known Yee’s schema. Next, to deal with EMC problem, a non-oriented thin wire formalism is proposed for this method. Finally, several examples are given to present the benefits of this new method by compar- ison with both Yee’s schema and DG approaches.
Aguirre-Hernández, B.; Campos-Cantón, E.; López-Renteria, J.A.; Díaz González, E.C.
2015-01-01
In this paper, we consider characteristic polynomials of n-dimensional systems that determine a segment of polynomials. One parameter is used to characterize this segment of polynomials in order to determine the maximal interval of dissipativity and unstability. Then we apply this result to the generation of a family of attractors based on a class of unstable dissipative systems (UDS) of type affine linear systems. This class of systems is comprised of switched linear systems yielding strange attractors. A family of these chaotic switched systems is determined by the maximal interval of perturbation of the matrix that governs the dynamics for still having scroll attractors
Global sensitivity analysis using sparse grid interpolation and polynomial chaos
Buzzard, Gregery T.
2012-01-01
Sparse grid interpolation is widely used to provide good approximations to smooth functions in high dimensions based on relatively few function evaluations. By using an efficient conversion from the interpolating polynomial provided by evaluations on a sparse grid to a representation in terms of orthogonal polynomials (gPC representation), we show how to use these relatively few function evaluations to estimate several types of sensitivity coefficients and to provide estimates on local minima and maxima. First, we provide a good estimate of the variance-based sensitivity coefficients of Sobol' (1990) [1] and then use the gradient of the gPC representation to give good approximations to the derivative-based sensitivity coefficients described by Kucherenko and Sobol' (2009) [2]. Finally, we use the package HOM4PS-2.0 given in Lee et al. (2008) [3] to determine the critical points of the interpolating polynomial and use these to determine the local minima and maxima of this polynomial. - Highlights: ► Efficient estimation of variance-based sensitivity coefficients. ► Efficient estimation of derivative-based sensitivity coefficients. ► Use of homotopy methods for approximation of local maxima and minima.
High-Order Entropy Stable Formulations for Computational Fluid Dynamics
Carpenter, Mark H.; Fisher, Travis C.
2013-01-01
A systematic approach is presented for developing entropy stable (SS) formulations of any order for the Navier-Stokes equations. These SS formulations discretely conserve mass, momentum, energy and satisfy a mathematical entropy inequality. They are valid for smooth as well as discontinuous flows provided sufficient dissipation is added at shocks and discontinuities. Entropy stable formulations exist for all diagonal norm, summation-by-parts (SBP) operators, including all centered finite-difference operators, Legendre collocation finite-element operators, and certain finite-volume operators. Examples are presented using various entropy stable formulations that demonstrate the current state-of-the-art of these schemes.
on the performance of Autoregressive Moving Average Polynomial
Timothy Ademakinwa
Distributed Lag (PDL) model, Autoregressive Polynomial Distributed Lag ... Moving Average Polynomial Distributed Lag (ARMAPDL) model. ..... Global Journal of Mathematics and Statistics. Vol. 1. ... Business and Economic Research Center.
A comparison of companion matrix methods to find roots of a trigonometric polynomial
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
High order mode damping in a pill box cavity
Voelker, F.; Lambertson, G.; Rimmer, R.
1991-04-01
We have substantially damped the higher order modes (HOM's) in a pill box cavity with attached beam pipe, while reducing the Q of the principal mode by less that 10%. This was accomplished by cutting slots in the cavity end wall at a radius at which the magnetic field of the lowest frequency HOM's is large. The slots couple energy from the cavity into waveguides which are below cut off for the principal mode, but which propagate energy at the HOM frequencies. Three slots 120 degrees apart couple HOM energy to three waveguides. We are concerned primarily with accelerating and deflecting modes: i.e. the TM mnp modes of order m=0 and m=1. For the strongest damping, only three m=0 and m=1 modes were detectable. These were the principal TM 010 mode, the TM 011 longitudinal mode, and the TM 110 deflecting mode. In addition the HOM Q's and the reduction of Q for the principal mode were determined by computer calculation. The principal mode Q for an actual rf cavity could not be measured because the bolted joints used in the construction of the cavity were not sufficiently good to support Q's above 6000. The measured Q of the first longitudinal mode was 31 and of the first transverse mode 37. Our maximum damping was limited by how well we could terminated the waveguides, and indeed, the computer calculations for the TM 011 and TM 110 modes give values in the range we measured. 2 refs., 2 figs
Doha, E H; Ahmed, H M
2004-01-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
An adaptive N-body algorithm of optimal order
Pruett, C. David.; Rudmin, Joseph W.; Lacy, Justin M.
2003-01-01
Picard iteration is normally considered a theoretical tool whose primary utility is to establish the existence and uniqueness of solutions to first-order systems of ordinary differential equations (ODEs). However, in 1996, Parker and Sochacki [Neural, Parallel, Sci. Comput. 4 (1996)] published a practical numerical method for a certain class of ODEs, based upon modified Picard iteration, that generates the Maclaurin series of the solution to arbitrarily high order. The applicable class of ODEs consists of first-order, autonomous systems whose right-hand side functions (generators) are projectively polynomial; that is, they can be written as polynomials in the unknowns. The class is wider than might be expected. The method is ideally suited to the classical N-body problem, which is projectively polynomial. Here, we recast the N-body problem in polynomial form and develop a Picard-based algorithm for its solution. The algorithm is highly accurate, parameter-free, and simultaneously adaptive in time and order. Test cases for both benign and chaotic N-body systems reveal that optimal order is dynamic. That is, in addition to dependency upon N and the desired accuracy, optimal order depends upon the configuration of the bodies at any instant
High Order Tensor Formulation for Convolutional Sparse Coding
Bibi, Adel Aamer
2017-12-25
Convolutional sparse coding (CSC) has gained attention for its successful role as a reconstruction and a classification tool in the computer vision and machine learning community. Current CSC methods can only reconstruct singlefeature 2D images independently. However, learning multidimensional dictionaries and sparse codes for the reconstruction of multi-dimensional data is very important, as it examines correlations among all the data jointly. This provides more capacity for the learned dictionaries to better reconstruct data. In this paper, we propose a generic and novel formulation for the CSC problem that can handle an arbitrary order tensor of data. Backed with experimental results, our proposed formulation can not only tackle applications that are not possible with standard CSC solvers, including colored video reconstruction (5D- tensors), but it also performs favorably in reconstruction with much fewer parameters as compared to naive extensions of standard CSC to multiple features/channels.
High level waste facilities - Continuing operation or orderly shutdown
Decker, L.A.
1998-04-01
Two options for Environmental Impact Statement No action alternatives describe operation of the radioactive liquid waste facilities at the Idaho Chemical Processing Plant at the Idaho National Engineering and Environmental Laboratory. The first alternative describes continued operation of all facilities as planned and budgeted through 2020. Institutional control for 100 years would follow shutdown of operational facilities. Alternatively, the facilities would be shut down in an orderly fashion without completing planned activities. The facilities and associated operations are described. Remaining sodium bearing liquid waste will be converted to solid calcine in the New Waste Calcining Facility (NWCF) or will be left in the waste tanks. The calcine solids will be stored in the existing Calcine Solids Storage Facilities (CSSF). Regulatory and cost impacts are discussed
Variational methods for high-order multiphoton processes
Gao, B.; Pan, C.; Liu, C.; Starace, A.F.
1990-01-01
Methods for applying the variationally stable procedure for Nth-order perturbative transition matrix elements of Gao and Starace [Phys. Rev. Lett. 61, 404 (1988); Phys. Rev. A 39, 4550 (1989)] to multiphoton processes involving systems other than atomic H are presented. Three specific cases are discussed: one-electron ions or atoms in which the electron--ion interaction is described by a central potential; two-electron ions or atoms in which the electronic states are described by the adiabatic hyperspherical representation; and closed-shell ions or atoms in which the electronic states are described by the multiconfiguration Hartree--Fock representation. Applications are made to the dynamic polarizability of He and the two-photon ionization cross section of Ar
Importance of high order momentum terms in SLC optics
Kozanecki, W.
1985-01-01
The evaluation of background levels at the SLC relies, in several cases, on the proper representation of how low momentum electrons propagate through the Arcs and the Final Focus System (FFS). For example, beam - gas bremsstrahlung in the arcs causes electrons of up to 6% energy loss to be transported through to the IP; secondary showers on edges of masks and collimators yield debris with a very wide momentum spectrum. This note is a naive attempt at checking the validity of TRANSPORT and TURTLE calculations, by evaluating the contributions of the momentum terms to increasingly higher order, and checking the mutual consistency of the results produced by the two methods on a beam of wide momentum spread. 8 refs., 4 figs., 1 tab
High-resolution x-ray scattering studies of charge ordering in highly correlated electron systems
Ghazi, M.E.
2002-01-01
Many important properties of transition metal oxides such as, copper oxide high-temperature superconductivity and colossal magnetoresistance (CMR) in manganites are due to strong electron-electron interactions, and hence these systems are called highly correlated systems. These materials are characterised by the coexistence of different kinds of order, including charge, orbital, and magnetic moment. This thesis contains high-resolution X-ray scattering studies of charge ordering in such systems namely the high-T C copper oxides isostructural system, La 2-x Sr x NiO 4 with various Sr concentrations (x = 0.33 - 0.2), and the CMR manganite system, Nd 1/2 Sr 1/2 MnO 3 . It also includes a review of charge ordering in a large variety of transition metal oxides, such as ferrates, vanadates, cobaltates, nickelates, manganites, and cuprates systems, which have been reported to date in the scientific literature. Using high-resolution synchrotron X-ray scattering, it has been demonstrated that the charge stripes exist in a series of single crystals of La 2-x Sr x NiO 4 with Sr concentrations (x = 0.33 - 0.2) at low temperatures. Satellite reflections due to the charge ordering were found with the wavevector (2ε, 0, 1) below the charge ordering transition temperature, T CO , where 2ε is the amount of separation from the corresponding Bragg peak. The charge stripes are shown to be two-dimensional in nature both by measurements of their correlation lengths and by measurement of the critical exponents of the charge stripe melting transition with an anomaly at x = 0.25. The results show by decreasing the hole concentration from the x = 0.33 to 0.2, the well-correlated charge stripes change to a glassy state at x = 0.25. The electronic transition into the charge stripe phase is second-order without any corresponding structural transition. Above the second-order transition critical scattering was observed due to fluctuations into the charge stripe phase. In a single-crystal of Nd
Quantum-path control in high-order harmonic generation at high photon energies
Zhang Xiaoshi; Lytle, Amy L; Cohen, Oren; Murnane, Margaret M; Kapteyn, Henry C
2008-01-01
We show through experiment and calculations how all-optical quasi-phase-matching of high-order harmonic generation can be used to selectively enhance emission from distinct quantum trajectories at high photon energies. Electrons rescattered in a strong field can traverse short and long quantum trajectories that exhibit differing coherence lengths as a result of variations in intensity of the driving laser along the direction of propagation. By varying the separation of the pulses in a counterpropagating pulse train, we selectively enhance either the long or the short quantum trajectory, and observe distinct spectral signatures in each case. This demonstrates a new type of coupling between the coherence of high-order harmonic beams and the attosecond time-scale quantum dynamics inherent in the process
Konakli, Katerina, E-mail: konakli@ibk.baug.ethz.ch; Sudret, Bruno
2016-09-15
The growing need for uncertainty analysis of complex computational models has led to an expanding use of meta-models across engineering and sciences. The efficiency of meta-modeling techniques relies on their ability to provide statistically-equivalent analytical representations based on relatively few evaluations of the original model. Polynomial chaos expansions (PCE) have proven a powerful tool for developing meta-models in a wide range of applications; the key idea thereof is to expand the model response onto a basis made of multivariate polynomials obtained as tensor products of appropriate univariate polynomials. The classical PCE approach nevertheless faces the “curse of dimensionality”, namely the exponential increase of the basis size with increasing input dimension. To address this limitation, the sparse PCE technique has been proposed, in which the expansion is carried out on only a few relevant basis terms that are automatically selected by a suitable algorithm. An alternative for developing meta-models with polynomial functions in high-dimensional problems is offered by the newly emerged low-rank approximations (LRA) approach. By exploiting the tensor–product structure of the multivariate basis, LRA can provide polynomial representations in highly compressed formats. Through extensive numerical investigations, we herein first shed light on issues relating to the construction of canonical LRA with a particular greedy algorithm involving a sequential updating of the polynomial coefficients along separate dimensions. Specifically, we examine the selection of optimal rank, stopping criteria in the updating of the polynomial coefficients and error estimation. In the sequel, we confront canonical LRA to sparse PCE in structural-mechanics and heat-conduction applications based on finite-element solutions. Canonical LRA exhibit smaller errors than sparse PCE in cases when the number of available model evaluations is small with respect to the input
Konakli, Katerina; Sudret, Bruno
2016-01-01
The growing need for uncertainty analysis of complex computational models has led to an expanding use of meta-models across engineering and sciences. The efficiency of meta-modeling techniques relies on their ability to provide statistically-equivalent analytical representations based on relatively few evaluations of the original model. Polynomial chaos expansions (PCE) have proven a powerful tool for developing meta-models in a wide range of applications; the key idea thereof is to expand the model response onto a basis made of multivariate polynomials obtained as tensor products of appropriate univariate polynomials. The classical PCE approach nevertheless faces the “curse of dimensionality”, namely the exponential increase of the basis size with increasing input dimension. To address this limitation, the sparse PCE technique has been proposed, in which the expansion is carried out on only a few relevant basis terms that are automatically selected by a suitable algorithm. An alternative for developing meta-models with polynomial functions in high-dimensional problems is offered by the newly emerged low-rank approximations (LRA) approach. By exploiting the tensor–product structure of the multivariate basis, LRA can provide polynomial representations in highly compressed formats. Through extensive numerical investigations, we herein first shed light on issues relating to the construction of canonical LRA with a particular greedy algorithm involving a sequential updating of the polynomial coefficients along separate dimensions. Specifically, we examine the selection of optimal rank, stopping criteria in the updating of the polynomial coefficients and error estimation. In the sequel, we confront canonical LRA to sparse PCE in structural-mechanics and heat-conduction applications based on finite-element solutions. Canonical LRA exhibit smaller errors than sparse PCE in cases when the number of available model evaluations is small with respect to the input
XU Xiu-Wei; REN Ting-Qi; LIU Shu-Yan; MA Qiu-Ming; LIU Sheng-Dian
2007-01-01
Making use of the transformation relation among usual, normal, and antinormal ordering for the multimode boson exponential quadratic polynomial operators (BEQPO's), we present the analytic expression of arbitrary matrix elements for BEQPO's. As a preliminary application, we obtain the exact expressions of partition function about the boson quadratic polynomial system, matrix elements in particle-number, coordinate, and momentum representation, and P representation for the BEQPO's.
Effects of high-order deformation on high-K isomers in superheavy nuclei
Liu, H. L.; Bertulani, C. A.; Xu, F. R.; Walker, P. M.
2011-01-01
Using, for the first time, configuration-constrained potential-energy-surface calculations with the inclusion of β 6 deformation, we find remarkable effects of the high-order deformation on the high-K isomers in 254 No, the focus of recent spectroscopy experiments on superheavy nuclei. For shapes with multipolarity six, the isomers are more tightly bound and, microscopically, have enhanced deformed shell gaps at N=152 and Z=100. The inclusion of β 6 deformation significantly improves the description of the very heavy high-K isomers.
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.
High order resonances in the evolution of the lunar orbit
Kovalevsky, J.
1983-01-01
This paper deals with the long term evolution of the motion of the Moon or any other natural satellite under the combined influence of gravitational forces (lunar theory) and the tidal effects. The author studied the equations that are left when all the periodic non-resonant terms are eliminated. They describe the evolution of the mean elements of the Moon. Only the equations involving the variation of the semi-major axis are considered here. Simplified equations, preserving the Hamiltonian form of the lunar theory are first considered and solved. It is shown that librations exist only for those terms which have a coefficient in the lunar theory larger than a quantity A which is a function of the magnitude of the tidal effects. The solution of the general case can be derived from a Hamiltonian solution by a method of variation of constants. The crossing of a libration region causes a retardation in the increase of the semi-major axis. These results are confirmed by numerical integration and orders of magnitude of this retardation are given. (Auth.)
Detection of Doppler Microembolic Signals Using High Order Statistics
Maroun Geryes
2016-01-01
Full Text Available Robust detection of the smallest circulating cerebral microemboli is an efficient way of preventing strokes, which is second cause of mortality worldwide. Transcranial Doppler ultrasound is widely considered the most convenient system for the detection of microemboli. The most common standard detection is achieved through the Doppler energy signal and depends on an empirically set constant threshold. On the other hand, in the past few years, higher order statistics have been an extensive field of research as they represent descriptive statistics that can be used to detect signal outliers. In this study, we propose new types of microembolic detectors based on the windowed calculation of the third moment skewness and fourth moment kurtosis of the energy signal. During energy embolus-free periods the distribution of the energy is not altered and the skewness and kurtosis signals do not exhibit any peak values. In the presence of emboli, the energy distribution is distorted and the skewness and kurtosis signals exhibit peaks, corresponding to the latter emboli. Applied on real signals, the detection of microemboli through the skewness and kurtosis signals outperformed the detection through standard methods. The sensitivities and specificities reached 78% and 91% and 80% and 90% for the skewness and kurtosis detectors, respectively.
Ordered Functionalized Silica Materials with High Proton Conductivity
Marschall, R.; Rathouský, Jiří; Wark, M.
2007-01-01
Roč. 19, č. 26 (2007), s. 6401-6407 ISSN 0897-4756 R&D Projects: GA MŠk 1M0577 Grant - others:Deutsche Forschungsgemeinschaft(DE) CA 147/13-1, SPP1181 Institutional research plan: CEZ:AV0Z40400503 Source of funding: R - rámcový projekt EK Keywords : silica * high proton conductivity * Si-MCM-41 Subject RIV: CF - Physical ; Theoretical Chemistry Impact factor: 4.883, year: 2007
Higher-Order Hierarchical Legendre Basis Functions in Applications
Kim, Oleksiy S.; Jørgensen, Erik; Meincke, Peter
2007-01-01
The higher-order hierarchical Legendre basis functions have been developed for eﬀective solution of integral equations with the method of moments. They are derived from orthogonal Legendre polynomials modiﬁed to enforce normal continuity between neighboring mesh elements, while preserving a high...
Uncertainty Quantification in Simulations of Epidemics Using Polynomial Chaos
F. Santonja
2012-01-01
Full Text Available Mathematical models based on ordinary differential equations are a useful tool to study the processes involved in epidemiology. Many models consider that the parameters are deterministic variables. But in practice, the transmission parameters present large variability and it is not possible to determine them exactly, and it is necessary to introduce randomness. In this paper, we present an application of the polynomial chaos approach to epidemiological mathematical models based on ordinary differential equations with random coefficients. Taking into account the variability of the transmission parameters of the model, this approach allows us to obtain an auxiliary system of differential equations, which is then integrated numerically to obtain the first-and the second-order moments of the output stochastic processes. A sensitivity analysis based on the polynomial chaos approach is also performed to determine which parameters have the greatest influence on the results. As an example, we will apply the approach to an obesity epidemic model.
Multilevel weighted least squares polynomial approximation
Haji-Ali, Abdul-Lateef; Nobile, Fabio; Tempone, Raul; Wolfers, Sö ren
2017-01-01
, obtaining polynomial approximations with a single level method can become prohibitively expensive, as it requires a sufficiently large number of samples, each computed with a sufficiently small discretization error. As a solution to this problem, we propose
Polynomials in finite geometries and combinatorics
Blokhuis, A.; Walker, K.
1993-01-01
It is illustrated how elementary properties of polynomials can be used to attack extremal problems in finite and euclidean geometry, and in combinatorics. Also a new result, related to the problem of neighbourly cylinders is presented.
Polynomial analysis of ambulatory blood pressure measurements
Zwinderman, A. H.; Cleophas, T. A.; Cleophas, T. J.; van der Wall, E. E.
2001-01-01
In normotensive subjects blood pressures follow a circadian rhythm. A circadian rhythm in hypertensive patients is less well established, and may be clinically important, particularly with rigorous treatments of daytime blood pressures. Polynomial analysis of ambulatory blood pressure monitoring
Handbook on semidefinite, conic and polynomial optimization
Anjos, Miguel F
2012-01-01
This book offers the reader a snapshot of the state-of-the-art in the growing and mutually enriching areas of semidefinite optimization, conic optimization and polynomial optimization. It covers theory, algorithms, software and applications.
Transversals of Complex Polynomial Vector Fields
Dias, Kealey
Vector fields in the complex plane are defined by assigning the vector determined by the value P(z) to each point z in the complex plane, where P is a polynomial of one complex variable. We consider special families of so-called rotated vector fields that are determined by a polynomial multiplied...... by rotational constants. Transversals are a certain class of curves for such a family of vector fields that represent the bifurcation states for this family of vector fields. More specifically, transversals are curves that coincide with a homoclinic separatrix for some rotation of the vector field. Given...... a concrete polynomial, it seems to take quite a bit of work to prove that it is generic, i.e. structurally stable. This has been done for a special class of degree d polynomial vector fields having simple equilibrium points at the d roots of unity, d odd. In proving that such vector fields are generic...
Generalized catalan numbers, sequences and polynomials
KOÇ, Cemal; GÜLOĞLU, İsmail; ESİN, Songül
2010-01-01
In this paper we present an algebraic interpretation for generalized Catalan numbers. We describe them as dimensions of certain subspaces of multilinear polynomials. This description is of utmost importance in the investigation of annihilators in exterior algebras.
Schur Stability Regions for Complex Quadratic Polynomials
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.)
About the solvability of matrix polynomial equations
Netzer, Tim; Thom, Andreas
2016-01-01
We study self-adjoint matrix polynomial equations in a single variable and prove existence of self-adjoint solutions under some assumptions on the leading form. Our main result is that any self-adjoint matrix polynomial equation of odd degree with non-degenerate leading form can be solved in self-adjoint matrices. We also study equations of even degree and equations in many variables.
Two polynomial representations of experimental design
Notari, Roberto; Riccomagno, Eva; Rogantin, Maria-Piera
2007-01-01
In the context of algebraic statistics an experimental design is described by a set of polynomials called the design ideal. This, in turn, is generated by finite sets of polynomials. Two types of generating sets are mostly used in the literature: Groebner bases and indicator functions. We briefly describe them both, how they are used in the analysis and planning of a design and how to switch between them. Examples include fractions of full factorial designs and designs for mixture experiments.
Rotation of 2D orthogonal polynomials
Yang, B.; Flusser, Jan; Kautský, J.
2018-01-01
Roč. 102, č. 1 (2018), s. 44-49 ISSN 0167-8655 R&D Projects: GA ČR GA15-16928S Institutional support: RVO:67985556 Keywords : Rotation invariants * Orthogonal polynomials * Recurrent relation * Hermite-like polynomials * Hermite moments Subject RIV: JD - Computer Applications, Robotics Impact factor: 1.995, year: 2016 http://library.utia.cas.cz/separaty/2017/ZOI/flusser-0483250.pdf
vs. a polynomial chaos-based MCMC
Siripatana, Adil
2014-08-01
Bayesian Inference of Manning\\'s n coefficient in a Storm Surge Model Framework: comparison between Kalman lter and polynomial based method Adil Siripatana Conventional coastal ocean models solve the shallow water equations, which describe the conservation of mass and momentum when the horizontal length scale is much greater than the vertical length scale. In this case vertical pressure gradients in the momentum equations are nearly hydrostatic. The outputs of coastal ocean models are thus sensitive to the bottom stress terms de ned through the formulation of Manning\\'s n coefficients. This thesis considers the Bayesian inference problem of the Manning\\'s n coefficient in the context of storm surge based on the coastal ocean ADCIRC model. In the first part of the thesis, we apply an ensemble-based Kalman filter, the singular evolutive interpolated Kalman (SEIK) filter to estimate both a constant Manning\\'s n coefficient and a 2-D parameterized Manning\\'s coefficient on one ideal and one of more realistic domain using observation system simulation experiments (OSSEs). We study the sensitivity of the system to the ensemble size. we also access the benefits from using an in ation factor on the filter performance. To study the limitation of the Guassian restricted assumption on the SEIK lter, 5 we also implemented in the second part of this thesis a Markov Chain Monte Carlo (MCMC) method based on a Generalized Polynomial chaos (gPc) approach for the estimation of the 1-D and 2-D Mannning\\'s n coe cient. The gPc is used to build a surrogate model that imitate the ADCIRC model in order to make the computational cost of implementing the MCMC with the ADCIRC model reasonable. We evaluate the performance of the MCMC-gPc approach and study its robustness to di erent OSSEs scenario. we also compare its estimates with those resulting from SEIK in term of parameter estimates and full distributions. we present a full analysis of the solution of these two methods, of the
Tomita, Yasuo; Matsushima, Shun-suke; Yamagami, Ryu-ichi; Jinzenji, Taka-aki; Sakuma, Shohei; Liu, Xiangming; Izuishi, Takuya; Shen, Qing
2017-01-01
We describe the nonlinear optical properties of inorganic-organic nanocomposite films in which semiconductor CdSe quantum dots as high as 6.8 vol.% are dispersed. Open/closed Z-scan measurements, degenerate multi-wave mixing and femtosecond pump-probe/transient grating measurements are conducted. It is shown that the observed fifth-order optical nonlinearity has the cascaded third-order contribution that becomes prominent at high concentrations of CdSe QDs. It is also shown that there are picosecond-scale intensity-dependent and nanosecond-scale intensity-independent decay components in absorptive and refractive nonlinearities. The former is caused by the Auger process, while the latter comes from the electron-hole recombination process. (paper)
Global sensitivity analysis using polynomial chaos expansions
Sudret, Bruno
2008-01-01
Global sensitivity analysis (SA) aims at quantifying the respective effects of input random variables (or combinations thereof) onto the variance of the response of a physical or mathematical model. Among the abundant literature on sensitivity measures, the Sobol' indices have received much attention since they provide accurate information for most models. The paper introduces generalized polynomial chaos expansions (PCE) to build surrogate models that allow one to compute the Sobol' indices analytically as a post-processing of the PCE coefficients. Thus the computational cost of the sensitivity indices practically reduces to that of estimating the PCE coefficients. An original non intrusive regression-based approach is proposed, together with an experimental design of minimal size. Various application examples illustrate the approach, both from the field of global SA (i.e. well-known benchmark problems) and from the field of stochastic mechanics. The proposed method gives accurate results for various examples that involve up to eight input random variables, at a computational cost which is 2-3 orders of magnitude smaller than the traditional Monte Carlo-based evaluation of the Sobol' indices
Global sensitivity analysis using polynomial chaos expansions
Sudret, Bruno [Electricite de France, R and D Division, Site des Renardieres, F 77818 Moret-sur-Loing Cedex (France)], E-mail: bruno.sudret@edf.fr
2008-07-15
Global sensitivity analysis (SA) aims at quantifying the respective effects of input random variables (or combinations thereof) onto the variance of the response of a physical or mathematical model. Among the abundant literature on sensitivity measures, the Sobol' indices have received much attention since they provide accurate information for most models. The paper introduces generalized polynomial chaos expansions (PCE) to build surrogate models that allow one to compute the Sobol' indices analytically as a post-processing of the PCE coefficients. Thus the computational cost of the sensitivity indices practically reduces to that of estimating the PCE coefficients. An original non intrusive regression-based approach is proposed, together with an experimental design of minimal size. Various application examples illustrate the approach, both from the field of global SA (i.e. well-known benchmark problems) and from the field of stochastic mechanics. The proposed method gives accurate results for various examples that involve up to eight input random variables, at a computational cost which is 2-3 orders of magnitude smaller than the traditional Monte Carlo-based evaluation of the Sobol' indices.
Stability analysis of polynomial fuzzy models via polynomial fuzzy Lyapunov functions
Bernal Reza, Miguel Ángel; Sala, Antonio; JAADARI, ABDELHAFIDH; Guerra, Thierry-Marie
2011-01-01
In this paper, the stability of continuous-time polynomial fuzzy models by means of a polynomial generalization of fuzzy Lyapunov functions is studied. Fuzzy Lyapunov functions have been fruitfully used in the literature for local analysis of Takagi-Sugeno models, a particular class of the polynomial fuzzy ones. Based on a recent Taylor-series approach which allows a polynomial fuzzy model to exactly represent a nonlinear model in a compact set of the state space, it is shown that a refinemen...
Vertex models, TASEP and Grothendieck polynomials
Motegi, Kohei; Sakai, Kazumitsu
2013-01-01
We examine the wavefunctions and their scalar products of a one-parameter family of integrable five-vertex models. At a special point of the parameter, the model investigated is related to an irreversible interacting stochastic particle system—the so-called totally asymmetric simple exclusion process (TASEP). By combining the quantum inverse scattering method with a matrix product representation of the wavefunctions, the on-/off-shell wavefunctions of the five-vertex models are represented as a certain determinant form. Up to some normalization factors, we find that the wavefunctions are given by Grothendieck polynomials, which are a one-parameter deformation of Schur polynomials. Introducing a dual version of the Grothendieck polynomials, and utilizing the determinant representation for the scalar products of the wavefunctions, we derive a generalized Cauchy identity satisfied by the Grothendieck polynomials and their duals. Several representation theoretical formulae for the Grothendieck polynomials are also presented. As a byproduct, the relaxation dynamics such as Green functions for the periodic TASEP are found to be described in terms of the Grothendieck polynomials. (paper)
Ji, Xing; Zhao, Fengxiang; Shyy, Wei; Xu, Kun
2018-03-01
Most high order computational fluid dynamics (CFD) methods for compressible flows are based on Riemann solver for the flux evaluation and Runge-Kutta (RK) time stepping technique for temporal accuracy. The advantage of this kind of space-time separation approach is the easy implementation and stability enhancement by introducing more middle stages. However, the nth-order time accuracy needs no less than n stages for the RK method, which can be very time and memory consuming due to the reconstruction at each stage for a high order method. On the other hand, the multi-stage multi-derivative (MSMD) method can be used to achieve the same order of time accuracy using less middle stages with the use of the time derivatives of the flux function. For traditional Riemann solver based CFD methods, the lack of time derivatives in the flux function prevents its direct implementation of the MSMD method. However, the gas kinetic scheme (GKS) provides such a time accurate evolution model. By combining the second-order or third-order GKS flux functions with the MSMD technique, a family of high order gas kinetic methods can be constructed. As an extension of the previous 2-stage 4th-order GKS, the 5th-order schemes with 2 and 3 stages will be developed in this paper. Based on the same 5th-order WENO reconstruction, the performance of gas kinetic schemes from the 2nd- to the 5th-order time accurate methods will be evaluated. The results show that the 5th-order scheme can achieve the theoretical order of accuracy for the Euler equations, and present accurate Navier-Stokes solutions as well due to the coupling of inviscid and viscous terms in the GKS formulation. In comparison with Riemann solver based 5th-order RK method, the high order GKS has advantages in terms of efficiency, accuracy, and robustness, for all test cases. The 4th- and 5th-order GKS have the same robustness as the 2nd-order scheme for the capturing of discontinuous solutions. The current high order MSMD GKS is a
V. P. Gribkova
2014-01-01
Full Text Available The paper offers a new method for approximate solution of one type of singular integral equations for elasticity theory which have been studied by other authors. The approximate solution is found in the form of asymptotic polynomial function of a low degree (first approximation based on the Chebyshev second order polynomial. Other authors have obtained a solution (only in separate points using a method of mechanical quadrature and though they used also the Chebyshev polynomial of the second order they applied another system of junctures which were used for the creation of the required formulas.The suggested method allows not only to find an approximate solution for the whole interval in the form of polynomial, but it also makes it possible to obtain a remainder term in the form of infinite expansion where coefficients are linear functional of the given integral equation and basis functions are the Chebyshev polynomial of the second order. Such presentation of the remainder term of the first approximation permits to find a summand of the infinite series, which will serve as a start for fulfilling the given solution accuracy. This number is a degree of the asymptotic polynomial (second approximation, which will give the approximation to the exact solution with the given accuracy. The examined polynomial functions tend asymptotically to the polynomial of the best uniform approximation in the space C, created for the given operator.The paper demonstrates a convergence of the approximate solution to the exact one and provides an error estimation. The proposed algorithm for obtaining of the approximate solution and error estimation is easily realized with the help of computing technique and does not require considerable preliminary preparation during programming.
Pont, Grégoire; Brenner, Pierre; Cinnella, Paola; Maugars, Bruno; Robinet, Jean-Christophe
2017-12-01
A Godunov's type unstructured finite volume method suitable for highly compressible turbulent scale-resolving simulations around complex geometries is constructed by using a successive correction technique. First, a family of k-exact Godunov schemes is developed by recursively correcting the truncation error of the piecewise polynomial representation of the primitive variables. The keystone of the proposed approach is a quasi-Green gradient operator which ensures consistency on general meshes. In addition, a high-order single-point quadrature formula, based on high-order approximations of the successive derivatives of the solution, is developed for flux integration along cell faces. The proposed family of schemes is compact in the algorithmic sense, since it only involves communications between direct neighbors of the mesh cells. The numerical properties of the schemes up to fifth-order are investigated, with focus on their resolvability in terms of number of mesh points required to resolve a given wavelength accurately. Afterwards, in the aim of achieving the best possible trade-off between accuracy, computational cost and robustness in view of industrial flow computations, we focus more specifically on the third-order accurate scheme of the family, and modify locally its numerical flux in order to reduce the amount of numerical dissipation in vortex-dominated regions. This is achieved by switching from the upwind scheme, mostly applied in highly compressible regions, to a fourth-order centered one in vortex-dominated regions. An analytical switch function based on the local grid Reynolds number is adopted in order to warrant numerical stability of the recentering process. Numerical applications demonstrate the accuracy and robustness of the proposed methodology for compressible scale-resolving computations. In particular, supersonic RANS/LES computations of the flow over a cavity are presented to show the capability of the scheme to predict flows with shocks
Cheng, Jian; Zhang, Fan; Liu, Tiegang
2018-06-01
In this paper, a class of new high order reconstructed DG (rDG) methods based on the compact least-squares (CLS) reconstruction [23,24] is developed for simulating the two dimensional steady-state compressible flows on hybrid grids. The proposed method combines the advantages of the DG discretization with the flexibility of the compact least-squares reconstruction, which exhibits its superior potential in enhancing the level of accuracy and reducing the computational cost compared to the underlying DG methods with respect to the same number of degrees of freedom. To be specific, a third-order compact least-squares rDG(p1p2) method and a fourth-order compact least-squares rDG(p2p3) method are developed and investigated in this work. In this compact least-squares rDG method, the low order degrees of freedom are evolved through the underlying DG(p1) method and DG(p2) method, respectively, while the high order degrees of freedom are reconstructed through the compact least-squares reconstruction, in which the constitutive relations are built by requiring the reconstructed polynomial and its spatial derivatives on the target cell to conserve the cell averages and the corresponding spatial derivatives on the face-neighboring cells. The large sparse linear system resulted by the compact least-squares reconstruction can be solved relatively efficient when it is coupled with the temporal discretization in the steady-state simulations. A number of test cases are presented to assess the performance of the high order compact least-squares rDG methods, which demonstrates their potential to be an alternative approach for the high order numerical simulations of steady-state compressible flows.
Relations between Möbius and coboundary polynomials
Jurrius, R.P.M.J.
2012-01-01
It is known that, in general, the coboundary polynomial and the Möbius polynomial of a matroid do not determine each other. Less is known about more specific cases. In this paper, we will investigate if it is possible that the Möbius polynomial of a matroid, together with the Möbius polynomial of
The s-Ordered Fock Space Projectors Gained by the General Ordering Theorem
Shähandeh Farid; Bazrafkan Mohammad Reza; Ashrafi Mahmoud
2012-01-01
Employing the general ordering theorem (GOT), operational methods and incomplete 2-D Hermite polynomials, we derive the t-ordered expansion of Fock space projectors. Using the result, the general ordered form of the coherent state projectors is obtained. This indeed gives a new integration formula regarding incomplete 2-D Hermite polynomials. In addition, the orthogonality relation of the incomplete 2-D Hermite polynomials is derived to resolve Dattoli's failure
A high order multi-resolution solver for the Poisson equation with application to vortex methods
Hejlesen, Mads Mølholm; Spietz, Henrik Juul; Walther, Jens Honore
A high order method is presented for solving the Poisson equation subject to mixed free-space and periodic boundary conditions by using fast Fourier transforms (FFT). The high order convergence is achieved by deriving mollified Green’s functions from a high order regularization function which...
Moosavifard, Seyyed E; El-Kady, Maher F; Rahmanifar, Mohammad S; Kaner, Richard B; Mousavi, Mir F
2015-03-04
The increasing demand for energy has triggered tremendous research efforts for the development of lightweight and durable energy storage devices. Herein, we report a simple, yet effective, strategy for high-performance supercapacitors by building three-dimensional pseudocapacitive CuO frameworks with highly ordered and interconnected bimodal nanopores, nanosized walls (∼4 nm) and large specific surface area of 149 m(2) g(-1). This interesting electrode structure plays a key role in providing facilitated ion transport, short ion and electron diffusion pathways and more active sites for electrochemical reactions. This electrode demonstrates excellent electrochemical performance with a specific capacitance of 431 F g(-1) (1.51 F cm(-2)) at 3.5 mA cm(-2) and retains over 70% of this capacitance when operated at an ultrafast rate of 70 mA cm(-2). When this highly ordered CuO electrode is assembled in an asymmetric cell with an activated carbon electrode, the as-fabricated device demonstrates remarkable performance with an energy density of 19.7 W h kg(-1), power density of 7 kW kg(-1), and excellent cycle life. This work presents a new platform for high-performance asymmetric supercapacitors for the next generation of portable electronics and electric vehicles.
High-Intensity High-order Harmonics Generated from Low-Density Plasma
Ozaki, T.; Bom, L. B. Elouga; Abdul-Hadi, J.; Ganeev, R. A.; Haessler, S.; Salieres, P.
2009-01-01
We study the generation of high-order harmonics from lowly ionized plasma, using the 10 TW, 10 Hz laser of the Advanced Laser Light Source (ALLS). We perform detailed studies on the enhancement of a single order of the high-order harmonic spectrum generated in plasma using the fundamental and second harmonic of the ALLS beam line. We observe quasi-monochromatic harmonics for various targets, including Mn, Cr, Sn, and In. We identify most of the ionic/neutral transitions responsible for the enhancement, which all have strong oscillator strengths. We demonstrate intensity enhancements of the 13th, 17th, 29th, and 33rd harmonics from these targets using the 800 nm pump laser and varying its chirp. We also characterized the attosecond nature of such plasma harmonics, measuring attosecond pulse trains with 360 as duration for chromium plasma, using the technique of ''Reconstruction of Attosecond Beating by Interference of Two-photon Transitions''(RABBIT). These results show that plasma harmonics are intense source of ultrashort coherent soft x-rays.
New realisation of Preisach model using adaptive polynomial approximation
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.
Rooms, F.; Camet, S.; Curis, J. F.
2010-02-01
A new technology of deformable mirror will be presented. Based on magnetic actuators, these deformable mirrors feature record strokes (more than +/- 45μm of astigmatism and focus correction) with an optimized temporal behavior. Furthermore, the development has been made in order to have a large density of actuators within a small clear aperture (typically 52 actuators within a diameter of 9.0mm). We will present the key benefits of this technology for vision science: simultaneous correction of low and high order aberrations, AO-SLO image without artifacts due to the membrane vibration, optimized control, etc. Using recent papers published by Doble, Thibos and Miller, we show the performances that can be achieved by various configurations using statistical approach. The typical distribution of wavefront aberrations (both the low order aberration (LOA) and high order aberration (HOA)) have been computed and the correction applied by the mirror. We compare two configurations of deformable mirrors (52 and 97 actuators) and highlight the influence of the number of actuators on the fitting error, the photon noise error and the effective bandwidth of correction.
High-order shock-fitted detonation propagation in high explosives
Romick, Christopher M.; Aslam, Tariq D.
2017-03-01
A highly accurate numerical shock and material interface fitting scheme composed of fifth-order spatial and third- or fifth-order temporal discretizations is applied to the two-dimensional reactive Euler equations in both slab and axisymmetric geometries. High rates of convergence are not typically possible with shock-capturing methods as the Taylor series analysis breaks down in the vicinity of discontinuities. Furthermore, for typical high explosive (HE) simulations, the effects of material interfaces at the charge boundary can also cause significant computational errors. Fitting a computational boundary to both the shock front and material interface (i.e. streamline) alleviates the computational errors associated with captured shocks and thus opens up the possibility of high rates of convergence for multi-dimensional shock and detonation flows. Several verification tests, including a Sedov blast wave, a Zel'dovich-von Neumann-Döring (ZND) detonation wave, and Taylor-Maccoll supersonic flow over a cone, are utilized to demonstrate high rates of convergence to nontrivial shock and reaction flows. Comparisons to previously published shock-capturing multi-dimensional detonations in a polytropic fluid with a constant adiabatic exponent (PF-CAE) are made, demonstrating significantly lower computational error for the present shock and material interface fitting method. For an error on the order of 10 m /s, which is similar to that observed in experiments, shock-fitting offers a computational savings on the order of 1000. In addition, the behavior of the detonation phase speed is examined for several slab widths to evaluate the detonation performance of PBX 9501 while utilizing the Wescott-Stewart-Davis (WSD) model, which is commonly used in HE modeling. It is found that the thickness effect curve resulting from this equation of state and reaction model using published values is dramatically more steep than observed in recent experiments. Utilizing the present fitting
Special polynomials associated with rational solutions of some hierarchies
Kudryashov, Nikolai A.
2009-01-01
New special polynomials associated with rational solutions of the Painleve hierarchies are introduced. The Hirota relations for these special polynomials are found. Differential-difference hierarchies to find special polynomials are presented. These formulae allow us to search special polynomials associated with the hierarchies. It is shown that rational solutions of the Caudrey-Dodd-Gibbon, the Kaup-Kupershmidt and the modified hierarchy for these ones can be obtained using new special polynomials.
On the Connection Coefficients of the Chebyshev-Boubaker Polynomials
Paul Barry
2013-01-01
Full Text Available The Chebyshev-Boubaker polynomials are the orthogonal polynomials whose coefficient arrays are defined by ordinary Riordan arrays. Examples include the Chebyshev polynomials of the second kind and the Boubaker polynomials. We study the connection coefficients of this class of orthogonal polynomials, indicating how Riordan array techniques can lead to closed-form expressions for these connection coefficients as well as recurrence relations that define them.
An adaptive N-body algorithm of optimal order
Pruett, C D; Lacy, J M
2003-01-01
Picard iteration is normally considered a theoretical tool whose primary utility is to establish the existence and uniqueness of solutions to first-order systems of ordinary differential equations (ODEs). However, in 1996, Parker and Sochacki [Neural, Parallel, Sci. Comput. 4 (1996)] published a practical numerical method for a certain class of ODEs, based upon modified Picard iteration, that generates the Maclaurin series of the solution to arbitrarily high order. The applicable class of ODEs consists of first-order, autonomous systems whose right-hand side functions (generators) are projectively polynomial; that is, they can be written as polynomials in the unknowns. The class is wider than might be expected. The method is ideally suited to the classical N-body problem, which is projectively polynomial. Here, we recast the N-body problem in polynomial form and develop a Picard-based algorithm for its solution. The algorithm is highly accurate, parameter-free, and simultaneously adaptive in time and order. T...
Shen, Xiang; Liu, Bin; Li, Qing-Quan
2017-03-01
The Rational Function Model (RFM) has proven to be a viable alternative to the rigorous sensor models used for geo-processing of high-resolution satellite imagery. Because of various errors in the satellite ephemeris and instrument calibration, the Rational Polynomial Coefficients (RPCs) supplied by image vendors are often not sufficiently accurate, and there is therefore a clear need to correct the systematic biases in order to meet the requirements of high-precision topographic mapping. In this paper, we propose a new RPC bias-correction method using the thin-plate spline modeling technique. Benefiting from its excellent performance and high flexibility in data fitting, the thin-plate spline model has the potential to remove complex distortions in vendor-provided RPCs, such as the errors caused by short-period orbital perturbations. The performance of the new method was evaluated by using Ziyuan-3 satellite images and was compared against the recently developed least-squares collocation approach, as well as the classical affine-transformation and quadratic-polynomial based methods. The results show that the accuracies of the thin-plate spline and the least-squares collocation approaches were better than the other two methods, which indicates that strong non-rigid deformations exist in the test data because they cannot be adequately modeled by simple polynomial-based methods. The performance of the thin-plate spline method was close to that of the least-squares collocation approach when only a few Ground Control Points (GCPs) were used, and it improved more rapidly with an increase in the number of redundant observations. In the test scenario using 21 GCPs (some of them located at the four corners of the scene), the correction residuals of the thin-plate spline method were about 36%, 37%, and 19% smaller than those of the affine transformation method, the quadratic polynomial method, and the least-squares collocation algorithm, respectively, which demonstrates
Best polynomial degree reduction on q-lattices with applications to q-orthogonal polynomials
Ait-Haddou, Rachid; Goldman, Ron
2015-01-01
We show that a weighted least squares approximation of q-Bézier coefficients provides the best polynomial degree reduction in the q-L2-norm. We also provide a finite analogue of this result with respect to finite q-lattices and we present applications of these results to q-orthogonal polynomials. © 2015 Elsevier Inc. All rights reserved.
Certain non-linear differential polynomials sharing a non zero polynomial
Majumder Sujoy
2015-10-01
functions sharing a nonzero polynomial and obtain two results which improves and generalizes the results due to L. Liu [Uniqueness of meromorphic functions and differential polynomials, Comput. Math. Appl., 56 (2008, 3236-3245.] and P. Sahoo [Uniqueness and weighted value sharing of meromorphic functions, Applied. Math. E-Notes., 11 (2011, 23-32.].
Best polynomial degree reduction on q-lattices with applications to q-orthogonal polynomials
Ait-Haddou, Rachid
2015-06-07
We show that a weighted least squares approximation of q-Bézier coefficients provides the best polynomial degree reduction in the q-L2-norm. We also provide a finite analogue of this result with respect to finite q-lattices and we present applications of these results to q-orthogonal polynomials. © 2015 Elsevier Inc. All rights reserved.
Formal Solutions for Polarized Radiative Transfer. II. High-order Methods
Janett, Gioele; Steiner, Oskar; Belluzzi, Luca, E-mail: gioele.janett@irsol.ch [Istituto Ricerche Solari Locarno (IRSOL), 6605 Locarno-Monti (Switzerland)
2017-08-20
When integrating the radiative transfer equation for polarized light, the necessity of high-order numerical methods is well known. In fact, well-performing high-order formal solvers enable higher accuracy and the use of coarser spatial grids. Aiming to provide a clear comparison between formal solvers, this work presents different high-order numerical schemes and applies the systematic analysis proposed by Janett et al., emphasizing their advantages and drawbacks in terms of order of accuracy, stability, and computational cost.
Dynamical evolution of space debris on high-elliptical orbits near high-order resonance zones
Kuznetsov, Eduard; Zakharova, Polina
Orbital evolution of objects on Molniya-type orbits is considered near high-order resonance zones. Initial conditions correspond to high-elliptical orbits with the critical inclination 63.4 degrees. High-order resonances are analyzed. Resonance orders are more than 5 and less than 50. Frequencies of perturbations caused by the effect of sectorial and tesseral harmonics of the Earth's gravitational potential are linear combinations of the mean motion of a satellite, angular velocities of motion of the pericenter and node of its orbit, and the angular velocity of the Earth. Frequencies of perturbations were calculated by taking into account secular perturbations from the Earth oblateness, the Moon, the Sun, and a solar radiation pressure. Resonance splitting effect leads to three sub-resonances. The study of dynamical evolution on long time intervals was performed on the basis of the results of numerical simulation. We used "A Numerical Model of the Motion of Artificial Earth's Satellites", developed by the Research Institute of Applied Mathematics and Mechanics of the Tomsk State University. The model of disturbing forces taken into account the main perturbing factors: the gravitational field of the Earth, the attraction of the Moon and the Sun, the tides in the Earth’s body, the solar radiation pressure, taking into account the shadow of the Earth, the Poynting-Robertson effect, and the atmospheric drag. Area-to-mass ratio varied from small values corresponding to satellites to big ones corresponding to space debris. The locations and sizes of resonance zones were refined from numerical simulation. The Poynting-Robertson effect results in a secular decrease in the semi-major axis of a spherically symmetrical satellite. In resonance regions the effect weakens slightly. Reliable estimates of secular perturbations of the semi-major axis were obtained from the numerical simulation. Under the Poynting-Robertson effect objects pass through the regions of high-order
Liu, Changying; Iserles, Arieh; Wu, Xinyuan
2018-03-01
The Klein-Gordon equation with nonlinear potential occurs in a wide range of application areas in science and engineering. Its computation represents a major challenge. The main theme of this paper is the construction of symmetric and arbitrarily high-order time integrators for the nonlinear Klein-Gordon equation by integrating Birkhoff-Hermite interpolation polynomials. To this end, under the assumption of periodic boundary conditions, we begin with the formulation of the nonlinear Klein-Gordon equation as an abstract second-order ordinary differential equation (ODE) and its operator-variation-of-constants formula. We then derive a symmetric and arbitrarily high-order Birkhoff-Hermite time integration formula for the nonlinear abstract ODE. Accordingly, the stability, convergence and long-time behaviour are rigorously analysed once the spatial differential operator is approximated by an appropriate positive semi-definite matrix, subject to suitable temporal and spatial smoothness. A remarkable characteristic of this new approach is that the requirement of temporal smoothness is reduced compared with the traditional numerical methods for PDEs in the literature. Numerical results demonstrate the advantage and efficiency of our time integrators in comparison with the existing numerical approaches.
A Novel Method for Decoding Any High-Order Hidden Markov Model
Fei Ye
2014-01-01
Full Text Available This paper proposes a novel method for decoding any high-order hidden Markov model. First, the high-order hidden Markov model is transformed into an equivalent first-order hidden Markov model by Hadar’s transformation. Next, the optimal state sequence of the equivalent first-order hidden Markov model is recognized by the existing Viterbi algorithm of the first-order hidden Markov model. Finally, the optimal state sequence of the high-order hidden Markov model is inferred from the optimal state sequence of the equivalent first-order hidden Markov model. This method provides a unified algorithm framework for decoding hidden Markov models including the first-order hidden Markov model and any high-order hidden Markov model.
Polynomial Chaos Surrogates for Bayesian Inference
Le Maitre, Olivier
2016-01-06
The Bayesian inference is a popular probabilistic method to solve inverse problems, such as the identification of field parameter in a PDE model. The inference rely on the Bayes rule to update the prior density of the sought field, from observations, and derive its posterior distribution. In most cases the posterior distribution has no explicit form and has to be sampled, for instance using a Markov-Chain Monte Carlo method. In practice the prior field parameter is decomposed and truncated (e.g. by means of Karhunen- Lo´eve decomposition) to recast the inference problem into the inference of a finite number of coordinates. Although proved effective in many situations, the Bayesian inference as sketched above faces several difficulties requiring improvements. First, sampling the posterior can be a extremely costly task as it requires multiple resolutions of the PDE model for different values of the field parameter. Second, when the observations are not very much informative, the inferred parameter field can highly depends on its prior which can be somehow arbitrary. These issues have motivated the introduction of reduced modeling or surrogates for the (approximate) determination of the parametrized PDE solution and hyperparameters in the description of the prior field. Our contribution focuses on recent developments in these two directions: the acceleration of the posterior sampling by means of Polynomial Chaos expansions and the efficient treatment of parametrized covariance functions for the prior field. We also discuss the possibility of making such approach adaptive to further improve its efficiency.
Image Compression Based On Wavelet, Polynomial and Quadtree
Bushra A. SULTAN
2011-01-01
Full Text Available In this paper a simple and fast image compression scheme is proposed, it is based on using wavelet transform to decompose the image signal and then using polynomial approximation to prune the smoothing component of the image band. The architect of proposed coding scheme is high synthetic where the error produced due to polynomial approximation in addition to the detail sub-band data are coded using both quantization and Quadtree spatial coding. As a last stage of the encoding process shift encoding is used as a simple and efficient entropy encoder to compress the outcomes of the previous stage.The test results indicate that the proposed system can produce a promising compression performance while preserving the image quality level.
Firefly Algorithm for Polynomial Bézier Surface Parameterization
Akemi Gálvez
2013-01-01
reality, medical imaging, computer graphics, computer animation, and many others. Very often, the preferred approximating surface is polynomial, usually described in parametric form. This leads to the problem of determining suitable parametric values for the data points, the so-called surface parameterization. In real-world settings, data points are generally irregularly sampled and subjected to measurement noise, leading to a very difficult nonlinear continuous optimization problem, unsolvable with standard optimization techniques. This paper solves the parameterization problem for polynomial Bézier surfaces by applying the firefly algorithm, a powerful nature-inspired metaheuristic algorithm introduced recently to address difficult optimization problems. The method has been successfully applied to some illustrative examples of open and closed surfaces, including shapes with singularities. Our results show that the method performs very well, being able to yield the best approximating surface with a high degree of accuracy.
Discrete-time state estimation for stochastic polynomial systems over polynomial observations
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.
Stabilisation of discrete-time polynomial fuzzy systems via a polynomial lyapunov approach
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.
Vortices and polynomials: non-uniqueness of the Adler–Moser polynomials for the Tkachenko equation
Demina, Maria V; Kudryashov, Nikolai A
2012-01-01
Stationary and translating relative equilibria of point vortices in the plane are studied. It is shown that stationary equilibria of any system containing point vortices with arbitrary choice of circulations can be described with the help of the Tkachenko equation. It is also obtained that translating relative equilibria of point vortices with arbitrary circulations can be constructed using a generalization of the Tkachenko equation. Roots of any pair of polynomials solving the Tkachenko equation and the generalized Tkachenko equation are proved to give positions of point vortices in stationary and translating relative equilibria accordingly. These results are valid even if the polynomials in a pair have multiple or common roots. It is obtained that the Adler–Moser polynomial provides non-unique polynomial solutions of the Tkachenko equation. It is shown that the generalized Tkachenko equation possesses polynomial solutions with degrees that are not triangular numbers. (paper)
Global sensitivity analysis by polynomial dimensional decomposition
Rahman, Sharif, E-mail: rahman@engineering.uiowa.ed [College of Engineering, The University of Iowa, Iowa City, IA 52242 (United States)
2011-07-15
This paper presents a polynomial dimensional decomposition (PDD) method for global sensitivity analysis of stochastic systems subject to independent random input following arbitrary probability distributions. The method involves Fourier-polynomial expansions of lower-variate component functions of a stochastic response by measure-consistent orthonormal polynomial bases, analytical formulae for calculating the global sensitivity indices in terms of the expansion coefficients, and dimension-reduction integration for estimating the expansion coefficients. Due to identical dimensional structures of PDD and analysis-of-variance decomposition, the proposed method facilitates simple and direct calculation of the global sensitivity indices. Numerical results of the global sensitivity indices computed for smooth systems reveal significantly higher convergence rates of the PDD approximation than those from existing methods, including polynomial chaos expansion, random balance design, state-dependent parameter, improved Sobol's method, and sampling-based methods. However, for non-smooth functions, the convergence properties of the PDD solution deteriorate to a great extent, warranting further improvements. The computational complexity of the PDD method is polynomial, as opposed to exponential, thereby alleviating the curse of dimensionality to some extent.
Remarks on determinants and the classical polynomials
Henning, J.J.; Kranold, H.U.; Louw, D.F.B.
1986-01-01
As motivation for this formal analysis the problem of Landau damping of Bernstein modes is discussed. It is shown that in the case of a weak but finite constant external magnetic field, the analytical structure of the dispersion relations is of such a nature that longitudinal waves propagating orthogonal to the external magnetic field are also damped, contrary to normal belief. In the treatment of the linearized Vlasov equation it is found convenient to generate certain polynomials by the problem at hand and to explicitly write down expressions for these polynomials. In the course of this study methods are used that relate to elementary but fairly unknown functional relationships between power sums and coefficients of polynomials. These relationships, also called Waring functions, are derived. They are then used in other applications to give explicit expressions for the generalized Laguerre polynomials in terms of determinant functions. The properties of polynomials generated by a wide class of generating functions are investigated. These relationships are also used to obtain explicit forms for the cumulants of a distribution in terms of its moments. It is pointed out that cumulants (or moments, for that matter) do not determine a distribution function
Multilevel weighted least squares polynomial approximation
Haji-Ali, Abdul-Lateef
2017-06-30
Weighted least squares polynomial approximation uses random samples to determine projections of functions onto spaces of polynomials. It has been shown that, using an optimal distribution of sample locations, the number of samples required to achieve quasi-optimal approximation in a given polynomial subspace scales, up to a logarithmic factor, linearly in the dimension of this space. However, in many applications, the computation of samples includes a numerical discretization error. Thus, obtaining polynomial approximations with a single level method can become prohibitively expensive, as it requires a sufficiently large number of samples, each computed with a sufficiently small discretization error. As a solution to this problem, we propose a multilevel method that utilizes samples computed with different accuracies and is able to match the accuracy of single-level approximations with reduced computational cost. We derive complexity bounds under certain assumptions about polynomial approximability and sample work. Furthermore, we propose an adaptive algorithm for situations where such assumptions cannot be verified a priori. Finally, we provide an efficient algorithm for the sampling from optimal distributions and an analysis of computationally favorable alternative distributions. Numerical experiments underscore the practical applicability of our method.
Chudnovsky, D V; Chudnovsky, G V
1999-10-26
The mathematical underpinning of the pulse width modulation (PWM) technique lies in the attempt to represent "accurately" harmonic waveforms using only square forms of a fixed height. The accuracy can be measured using many norms, but the quality of the approximation of the analog signal (a harmonic form) by a digital one (simple pulses of a fixed high voltage level) requires the elimination of high order harmonics in the error term. The most important practical problem is in "accurate" reproduction of sine-wave using the same number of pulses as the number of high harmonics eliminated. We describe in this paper a complete solution of the PWM problem using Pade approximations, orthogonal polynomials, and solitons. The main result of the paper is the characterization of discrete pulses answering the general PWM problem in terms of the manifold of all rational solutions to Korteweg-de Vries equations.
Highly ordered macroporous woody biochar with ultra-high carbon content as supercapacitor electrodes
Jiang, Junhua; Zhang, Lei; Wang, Xinying; Holm, Nancy; Rajagopalan, Kishore; Chen, Fanglin; Ma, Shuguo
2013-01-01
Woody biochar monolith with ultra-high carbon content and highly ordered macropores has been prepared via one-pot pyrolysis and carbonization of red cedar wood at 750 °C without the need of post-treatment. Energy-dispersive spectroscope (EDX) and scanning electron microscope (SEM) studies show that the original biochar has a carbon content of 98 wt% with oxygen as the only detectable impurity and highly ordered macroporous texture characterized by alternating regular macroporous regions and narrow porous regions. Moreover, the hierarchically porous biochar monolith has a high BET specific surface area of approximately 400 m 2 g −1 . We have studied the monolith material as supercapacitor electrodes under acidic environment using electrochemical and surface characterization techniques. Electrochemical measurements show that the original biochar electrodes have a potential window of about 1.3 V and exhibit typical rectangular-shape voltammetric responses and fast charging–discharging behavior with a gravimetric capacitance of about 14 F g −1 . Simple activation of biochar in diluted nitric acid at room temperature leads to 7 times increase in the capacitance (115 F g −1 ). Because the HNO 3 -activation slightly decreases rather than increases the BET surface area of the biochar, an increase in the coverage of surface oxygen groups is the most likely origin of the substantial capacitance improvement. This is supported by EDX, X-ray photoelectron spectroscopy (XPS), and Raman measurements. Preliminary life-time studies show that biochar supercapacitors using the original and HNO 3 -activated electrodes are stable over 5000 cycles without performance decays. These facts indicate that the use of woody biochar is promising for its low cost and it can be a good performance electrode with low environmental impacts for supercapacitor applications
Convergency analysis of the high-order mimetic finite difference method
Lipnikov, Konstantin [Los Alamos National Laboratory; Veiga Da Beirao, L [UNIV DEGLI STUDI; Manzini, G [NON LANL
2008-01-01
We prove second-order convergence of the conservative variable and its flux in the high-order MFD method. The convergence results are proved for unstructured polyhedral meshes and full tensor diffusion coefficients. For the case of non-constant coefficients, we also develop a new family of high-order MFD methods. Theoretical result are confirmed through numerical experiments.
Detection of Crossing White Matter Fibers with High-Order Tensors and Rank-k Decompositions
Jiao, Fangxiang; Gur, Yaniv; Johnson, Chris R.; Joshi, Sarang
2011-01-01
Fundamental to high angular resolution diffusion imaging (HARDI), is the estimation of a positive-semidefinite orientation distribution function (ODF) and extracting the diffusion properties (e.g., fiber directions). In this work we show that these two goals can be achieved efficiently by using homogeneous polynomials to represent the ODF in the spherical deconvolution approach, as was proposed in the Cartesian Tensor-ODF (CT-ODF) formulation. Based on this formulation we first suggest an estimation method for positive-semidefinite ODF by solving a linear programming problem that does not require special parameterization of the ODF. We also propose a rank-k tensor decomposition, known as CP decomposition, to extract the fibers information from the estimated ODF. We show that this decomposition is superior to the fiber direction estimation via ODF maxima detection as it enables one to reach the full fiber separation resolution of the estimation technique. We assess the accuracy of this new framework by applying it to synthetic and experimentally obtained HARDI data. © 2011 Springer-Verlag.
Song, Ningning; Wang, Wucong; Wu, Yue; Xiao, Ding; Zhao, Yaping
2018-04-01
The hybrids of pristine graphene with polyaniline were synthesized by in situ polymerizations for making a high-performance supercapacitor. The formed high-ordered PANI nanocones were vertically aligned on the graphene sheets. The length of the PANI nanocones increased with the concentration of aniline monomer. The specific capacitance of the hybrids electrode in the three-electrode system was measured as high as 481 F/g at a current density of 0.1 A/g, and its stability remained 87% after constant charge-discharge 10000 cycles at a current density of 1 A/g. This outstanding performance is attributed to the coupling effects of the pristine graphene and the hierarchical structure of the PANI possessing high specific surface area. The unique structure of the PANI provided more charge transmission pathways and fast charge-transfer speed of electrons to the pristine graphene because of its large specific area exposed to the electrolyte. The hybrid is expected to have potential applications in supercapacitor electrodes.
Minimal residual method stronger than polynomial preconditioning
Faber, V.; Joubert, W.; Knill, E. [Los Alamos National Lab., NM (United States)] [and others
1994-12-31
Two popular methods for solving symmetric and nonsymmetric systems of equations are the minimal residual method, implemented by algorithms such as GMRES, and polynomial preconditioning methods. In this study results are given on the convergence rates of these methods for various classes of matrices. It is shown that for some matrices, such as normal matrices, the convergence rates for GMRES and for the optimal polynomial preconditioning are the same, and for other matrices such as the upper triangular Toeplitz matrices, it is at least assured that if one method converges then the other must converge. On the other hand, it is shown that matrices exist for which restarted GMRES always converges but any polynomial preconditioning of corresponding degree makes no progress toward the solution for some initial error. The implications of these results for these and other iterative methods are discussed.
Quasi-topological Ricci polynomial gravities
Li, Yue-Zhou; Liu, Hai-Shan; Lü, H.
2018-02-01
Quasi-topological terms in gravity can be viewed as those that give no contribution to the equations of motion for a special subclass of metric ansätze. They therefore play no rôle in constructing these solutions, but can affect the general perturbations. We consider Einstein gravity extended with Ricci tensor polynomial invariants, which admits Einstein metrics with appropriate effective cosmological constants as its vacuum solutions. We construct three types of quasi-topological gravities. The first type is for the most general static metrics with spherical, toroidal or hyperbolic isometries. The second type is for the special static metrics where g tt g rr is constant. The third type is the linearized quasitopological gravities on the Einstein metrics. We construct and classify results that are either dependent on or independent of dimensions, up to the tenth order. We then consider a subset of these three types and obtain Lovelock-like quasi-topological gravities, that are independent of the dimensions. The linearized gravities on Einstein metrics on all dimensions are simply Einstein and hence ghost free. The theories become quasi-topological on static metrics in one specific dimension, but non-trivial in others. We also focus on the quasi-topological Ricci cubic invariant in four dimensions as a specific example to study its effect on holography, including shear viscosity, thermoelectric DC conductivities and butterfly velocity. In particular, we find that the holographic diffusivity bounds can be violated by the quasi-topological terms, which can induce an extra massive mode that yields a butterfly velocity unbound above.
Zuo-Hua Li
2017-01-01
Full Text Available Time-delays of control force calculation, data acquisition, and actuator response will degrade the performance of Active Mass Damper (AMD control systems. To reduce the influence, model reduction method is used to deal with the original controlled structure. However, during the procedure, the related hierarchy information of small eigenvalues will be directly discorded. As a result, the reduced-order model ignores the information of high-order mode, which will reduce the design accuracy of an AMD control system. In this paper, a new reduced-order controller based on the improved Balanced Truncation (BT method is designed to reduce the calculation time and to retain the abandoned high-order modal information. It includes high-order natural frequency, damping ratio, and vibration modal information of the original structure. Then, a control gain design method based on Guaranteed Cost Control (GCC algorithm is presented to eliminate the adverse effects of data acquisition and actuator response time-delays in the design process of the reduced-order controller. To verify its effectiveness, the proposed methodology is applied to a numerical example of a ten-storey frame and an experiment of a single-span four-storey steel frame. Both numerical and experimental results demonstrate that the reduced-order controller with GCC algorithm has an excellent control effect; meanwhile it can compensate time-delays effectively.
Twisted Polynomials and Forgery Attacks on GCM
Abdelraheem, Mohamed Ahmed A. M. A.; Beelen, Peter; Bogdanov, Andrey
2015-01-01
Polynomial hashing as an instantiation of universal hashing is a widely employed method for the construction of MACs and authenticated encryption (AE) schemes, the ubiquitous GCM being a prominent example. It is also used in recent AE proposals within the CAESAR competition which aim at providing...... in an improved key recovery algorithm. As cryptanalytic applications of our twisted polynomials, we develop the first universal forgery attacks on GCM in the weak-key model that do not require nonce reuse. Moreover, we present universal weak-key forgeries for the nonce-misuse resistant AE scheme POET, which...
Polynomial Vector Fields in One Complex Variable
Branner, Bodil
In recent years Adrien Douady was interested in polynomial vector fields, both in relation to iteration theory and as a topic on their own. This talk is based on his work with Pierrette Sentenac, work of Xavier Buff and Tan Lei, and my own joint work with Kealey Dias.......In recent years Adrien Douady was interested in polynomial vector fields, both in relation to iteration theory and as a topic on their own. This talk is based on his work with Pierrette Sentenac, work of Xavier Buff and Tan Lei, and my own joint work with Kealey Dias....
The chromatic polynomial and list colorings
Thomassen, Carsten
2009-01-01
We prove that, if a graph has a list of k available colors at every vertex, then the number of list-colorings is at least the chromatic polynomial evaluated at k when k is sufficiently large compared to the number of vertices of the graph.......We prove that, if a graph has a list of k available colors at every vertex, then the number of list-colorings is at least the chromatic polynomial evaluated at k when k is sufficiently large compared to the number of vertices of the graph....
Recognition of Arabic Sign Language Alphabet Using Polynomial Classifiers
M. Al-Rousan
2005-08-01
Full Text Available 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.
Piecewise Polynomial Fitting with Trend Item Removal and Its Application in a Cab Vibration Test
Wu Ren
2018-01-01
Full Text Available The trend item of a long-term vibration signal is difficult to remove. This paper proposes a piecewise integration method to remove trend items. Examples of direct integration without trend item removal, global integration after piecewise polynomial fitting with trend item removal, and direct integration after piecewise polynomial fitting with trend item removal were simulated. The results showed that direct integration of the fitted piecewise polynomial provided greater acceleration and displacement precision than the other two integration methods. A vibration test was then performed on a special equipment cab. The results indicated that direct integration by piecewise polynomial fitting with trend item removal was highly consistent with the measured signal data. However, the direct integration method without trend item removal resulted in signal distortion. The proposed method can help with frequency domain analysis of vibration signals and modal parameter identification for such equipment.
Kaporin, I. E.
2012-02-01
In order to precondition a sparse symmetric positive definite matrix, its approximate inverse is examined, which is represented as the product of two sparse mutually adjoint triangular matrices. In this way, the solution of the corresponding system of linear algebraic equations (SLAE) by applying the preconditioned conjugate gradient method (CGM) is reduced to performing only elementary vector operations and calculating sparse matrix-vector products. A method for constructing the above preconditioner is described and analyzed. The triangular factor has a fixed sparsity pattern and is optimal in the sense that the preconditioned matrix has a minimum K-condition number. The use of polynomial preconditioning based on Chebyshev polynomials makes it possible to considerably reduce the amount of scalar product operations (at the cost of an insignificant increase in the total number of arithmetic operations). The possibility of an efficient massively parallel implementation of the resulting method for solving SLAEs is discussed. For a sequential version of this method, the results obtained by solving 56 test problems from the Florida sparse matrix collection (which are large-scale and ill-conditioned) are presented. These results show that the method is highly reliable and has low computational costs.
Colored Kauffman homology and super-A-polynomials
Nawata, Satoshi; Ramadevi, P.; Zodinmawia
2014-01-01
We study the structural properties of colored Kauffman homologies of knots. Quadruple-gradings play an essential role in revealing the differential structure of colored Kauffman homology. Using the differential structure, the Kauffman homologies carrying the symmetric tensor products of the vector representation for the trefoil and the figure-eight are determined. In addition, making use of relations from representation theory, we also obtain the HOMFLY homologies colored by rectangular Young tableaux with two rows for these knots. Furthermore, the notion of super-A-polynomials is extended in order to encompass two-parameter deformations of PSL(2,ℂ) character varieties
Poincare map for some polynomial systems of differential equations
Varin, V P
2004-01-01
One approach to the classical problem of distinguishing between a centre and a focus for a system of differential equations with polynomial right-hand sides in the plane is discussed. For a broad class of such systems necessary and sufficient conditions for a centre are expressed in terms of equations in variations of higher order. By contrast with the existing methods of investigation, attention is concentrated on the explicit calculation of the asymptotic behaviour of the Poincare map rather than on finding sufficient centre conditions as such; this also enables one to study bifurcations of birth of arbitrarily strongly degenerate cycles.
Quantitative Boltzmann-Gibbs Principles via Orthogonal Polynomial Duality
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.
Gais, Zakkina; Afriansyah, Ekasatya Aldila
2017-01-01
This research aims to know the effect of prior mathematical students ability to solve on high order thinking questions looked by analysis question, evaluation question, creating question and genera question.This research also aims to know about students ability in solving high order thinking question and to know about the factors that cause students to be wrong in solving high order thinking questions. The research method that used is mixed method with embedded concurrent type. From the resu...
Practical aspects of spherical near-field antenna measurements using a high-order probe
Laitinen, Tommi; Pivnenko, Sergey; Nielsen, Jeppe Majlund
2006-01-01
Two practical aspects related to accurate antenna pattern characterization by probe-corrected spherical near-field antenna measurements with a high-order probe are examined. First, the requirements set by an arbitrary high-order probe on the scanning technique are pointed out. Secondly, a channel...... balance calibration procedure for a high-order dual-port probe with non-identical ports is presented, and the requirements set by this procedure for the probe are discussed....
Predicting physical time series using dynamic ridge polynomial neural networks.
Dhiya Al-Jumeily
Full Text Available Forecasting naturally occurring phenomena is a common problem in many domains of science, and this has been addressed and investigated by many scientists. The importance of time series prediction stems from the fact that it has wide range of applications, including control systems, engineering processes, environmental systems and economics. From the knowledge of some aspects of the previous behaviour of the system, the aim of the prediction process is to determine or predict its future behaviour. In this paper, we consider a novel application of a higher order polynomial neural network architecture called Dynamic Ridge Polynomial Neural Network that combines the properties of higher order and recurrent neural networks for the prediction of physical time series. In this study, four types of signals have been used, which are; The Lorenz attractor, mean value of the AE index, sunspot number, and heat wave temperature. The simulation results showed good improvements in terms of the signal to noise ratio in comparison to a number of higher order and feedforward neural networks in comparison to the benchmarked techniques.
Self-similarity of higher-order moving averages
Arianos, Sergio; Carbone, Anna; Türk, Christian
2011-10-01
In this work, higher-order moving average polynomials are defined by straightforward generalization of the standard moving average. The self-similarity of the polynomials is analyzed for fractional Brownian series and quantified in terms of the Hurst exponent H by using the detrending moving average method. We prove that the exponent H of the fractional Brownian series and of the detrending moving average variance asymptotically agree for the first-order polynomial. Such asymptotic values are compared with the results obtained by the simulations. The higher-order polynomials correspond to trend estimates at shorter time scales as the degree of the polynomial increases. Importantly, the increase of polynomial degree does not require to change the moving average window. Thus trends at different time scales can be obtained on data sets with the same size. These polynomials could be interesting for those applications relying on trend estimates over different time horizons (financial markets) or on filtering at different frequencies (image analysis).
Nonclassical Orthogonal Polynomials and Corresponding Quadratures
Fukuda, H; Alt, E O; Matveenko, A V
2004-01-01
We construct nonclassical orthogonal polynomials and calculate abscissas and weights of Gaussian quadrature for arbitrary weight and interval. The program is written by Mathematica and it works if moment integrals are given analytically. The result is a FORTRAN subroutine ready to utilize the quadrature.
Intrinsic Diophantine approximation on general polynomial surfaces
Tiljeset, Morten Hein
2017-01-01
We study the Hausdorff measure and dimension of the set of intrinsically simultaneously -approximable points on a curve, surface, etc, given as a graph of integer polynomials. We obtain complete answers to these questions for algebraically “nice” manifolds. This generalizes earlier work done...
Quantum Hilbert matrices and orthogonal polynomials
Andersen, Jørgen Ellegaard; Berg, Christian
2009-01-01
Using the notion of quantum integers associated with a complex number q≠0 , we define the quantum Hilbert matrix and various extensions. They are Hankel matrices corresponding to certain little q -Jacobi polynomials when |q|<1 , and for the special value they are closely related to Hankel matrice...
Algebraic polynomial system solving and applications
Bleylevens, I.W.M.
2010-01-01
The problem of computing the solutions of a system of multivariate polynomial equations can be approached by the Stetter-Möller matrix method which casts the problem into a large eigenvalue problem. This Stetter-Möller matrix method forms the starting point for the development of computational
Information-theoretic lengths of Jacobi polynomials
Guerrero, A; Dehesa, J S [Departamento de Fisica Atomica, Molecular y Nuclear, Universidad de Granada, Granada (Spain); Sanchez-Moreno, P, E-mail: agmartinez@ugr.e, E-mail: pablos@ugr.e, E-mail: dehesa@ugr.e [Instituto ' Carlos I' de Fisica Teorica y Computacional, Universidad de Granada, Granada (Spain)
2010-07-30
The information-theoretic lengths of the Jacobi polynomials P{sup ({alpha}, {beta})}{sub n}(x), which are information-theoretic measures (Renyi, Shannon and Fisher) of their associated Rakhmanov probability density, are investigated. They quantify the spreading of the polynomials along the orthogonality interval [- 1, 1] in a complementary but different way as the root-mean-square or standard deviation because, contrary to this measure, they do not refer to any specific point of the interval. The explicit expressions of the Fisher length are given. The Renyi lengths are found by the use of the combinatorial multivariable Bell polynomials in terms of the polynomial degree n and the parameters ({alpha}, {beta}). The Shannon length, which cannot be exactly calculated because of its logarithmic functional form, is bounded from below by using sharp upper bounds to general densities on [- 1, +1] given in terms of various expectation values; moreover, its asymptotics is also pointed out. Finally, several computational issues relative to these three quantities are carefully analyzed.
Indecomposability of polynomials via Jacobian matrix
Cheze, G.; Najib, S.
2007-12-01
Uni-multivariate decomposition of polynomials is a special case of absolute factorization. Recently, thanks to the Ruppert's matrix some effective results about absolute factorization have been improved. Here we show that with a jacobian matrix we can get sharper bounds for the special case of uni-multivariate decomposition. (author)
On selfadjoint functors satisfying polynomial relations
Agerholm, Troels; Mazorchuk, Volodomyr
2011-01-01
We study selfadjoint functors acting on categories of finite dimen- sional modules over finite dimensional algebras with an emphasis on functors satisfying some polynomial relations. Selfadjoint func- tors satisfying several easy relations, in particular, idempotents and square roots of a sum...
Polynomial Variables and the Jacobian Problem
algebra and algebraic geometry, and ... algebraically, to making the change of variables (X, Y) r--t. (X +p, Y ... aX + bY + p and eX + dY + q are linear polynomials in X, Y. ..... [5] T T Moh, On the Jacobian conjecture and the confipration of roots,.
Function approximation with polynomial regression slines
Urbanski, P.
1996-01-01
Principles of the polynomial regression splines as well as algorithms and programs for their computation are presented. The programs prepared using software package MATLAB are generally intended for approximation of the X-ray spectra and can be applied in the multivariate calibration of radiometric gauges. (author)
Polynomial stabilization of some dissipative hyperbolic systems
Ammari, K.; Feireisl, Eduard; Nicaise, S.
2014-01-01
Roč. 34, č. 11 (2014), s. 4371-4388 ISSN 1078-0947 R&D Projects: GA ČR GA201/09/0917 Institutional support: RVO:67985840 Keywords : exponential stability * polynomial stability * observability inequality Subject RIV: BA - General Mathematics Impact factor: 0.826, year: 2014 http://www.aimsciences.org/journals/displayArticlesnew.jsp?paperID=9924
Polynomial Asymptotes of the Second Kind
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…
Characteristic polynomials of linear polyacenes and their ...
Coefficients of characteristic polynomials (CP) of linear polyacenes (LP) have been shown to be obtainable from Pascal's triangle by using a graph factorisation and squaring technique. Strong subspectrality existing among the members of the linear polyacene series has been shown from the derivation of the CP's. Thus it ...
Coherent states for polynomial su(2) algebra
Sadiq, Muhammad; Inomata, Akira
2007-01-01
A class of generalized coherent states is constructed for a polynomial su(2) algebra in a group-free manner. As a special case, the coherent states for the cubic su(2) algebra are discussed. The states so constructed reduce to the usual SU(2) coherent states in the linear limit
Bernoulli Polynomials, Fourier Series and Zeta Numbers
Scheufens, Ernst E
2013-01-01
Fourier series for Bernoulli polynomials are used to obtain information about values of the Riemann zeta function for integer arguments greater than one. If the argument is even we recover the well-known exact values, if the argument is odd we find integral representations and rapidly convergent...
Euler Polynomials, Fourier Series and Zeta Numbers
Scheufens, Ernst E
2012-01-01
Fourier series for Euler polynomials is used to obtain information about values of the Riemann zeta function for integer arguments greater than one. If the argument is even we recover the well-known exact values, if the argument is odd we find integral representations and rapidly convergent series....
Automatic Control Systems Modeling by Volterra Polynomials
S. V. Solodusha
2012-01-01
Full Text Available The problem of the existence of the solutions of polynomial Volterra integral equations of the first kind of the second degree is considered. An algorithm of the numerical solution of one class of Volterra nonlinear systems of the first kind is developed. Numerical results for test examples are presented.
Spectral properties of birth-death polynomials
van Doorn, Erik A.
2015-01-01
We consider sequences of polynomials that are defined by a three-terms recurrence relation and orthogonal with respect to a positive measure on the nonnegative axis. By a famous result of Karlin and McGregor such sequences are instrumental in the analysis of birth-death processes. Inspired by
Spectral properties of birth-death polynomials
van Doorn, Erik A.
We consider sequences of polynomials that are defined by a three-terms recurrence relation and orthogonal with respect to a positive measure on the nonnegative axis. By a famous result of Karlin and McGregor such sequences are instrumental in the analysis of birth-death processes. Inspired by
Optimization of Cubic Polynomial Functions without Calculus
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…
transformation of independent variables in polynomial regression ...
Ada
preferable when possible to work with a simple functional form in transformed variables rather than with a more complicated form in the original variables. In this paper, it is shown that linear transformations applied to independent variables in polynomial regression models affect the t ratio and hence the statistical ...
Inequalities for a Polynomial and its Derivative
Annual Meetings · Mid Year Meetings · Discussion Meetings · Public Lectures · Lecture Workshops · Refresher Courses · Symposia · Live Streaming. Home; Journals; Proceedings – Mathematical Sciences; Volume 110; Issue 2. Inequalities for a Polynomial and its Derivative. V K Jain. Volume 110 Issue 2 May 2000 pp 137- ...
Integral Inequalities for Self-Reciprocal Polynomials
Annual Meetings · Mid Year Meetings · Discussion Meetings · Public Lectures · Lecture Workshops · Refresher Courses · Symposia · Live Streaming. Home; Journals; Proceedings – Mathematical Sciences; Volume 120; Issue 2. Integral Inequalities for Self-Reciprocal Polynomials. Horst Alzer. Volume 120 Issue 2 April 2010 ...
ANALYTICAL SOLUTION OF THE K-TH ORDER AUTONOMOUS ORDINARY DIFFERENTIAL EQUATION
Ronald Orozco López
2017-04-01
Full Text Available The main objective of this paper is to find the analytical solution of the autonomous equation y(k = f (y and prove its convergence using autonomous polynomials of order k, define here in addition of the formula of Faá di Bruno for composition of functions and Bell polynomials. Autonomous polynomials of order k are defined in terms of the boundary values of the equation. Also special values of autonomous polynomials of order 1 are given.
P A M Dirac meets M G Krein: matrix orthogonal polynomials and Dirac's equation
Duran, Antonio J; Gruenbaum, F Alberto
2006-01-01
The solution of several instances of the Schroedinger equation (1926) is made possible by using the well-known orthogonal polynomials associated with the names of Hermite, Legendre and Laguerre. A relativistic alternative to this equation was proposed by Dirac (1928) involving differential operators with matrix coefficients. In 1949 Krein developed a theory of matrix-valued orthogonal polynomials without any reference to differential equations. In Duran A J (1997 Matrix inner product having a matrix symmetric second order differential operator Rocky Mt. J. Math. 27 585-600), one of us raised the question of determining instances of these matrix-valued polynomials going along with second order differential operators with matrix coefficients. In Duran A J and Gruenbaum F A (2004 Orthogonal matrix polynomials satisfying second order differential equations Int. Math. Res. Not. 10 461-84), we developed a method to produce such examples and observed that in certain cases there is a connection with the instance of Dirac's equation with a central potential. We observe that the case of the central Coulomb potential discussed in the physics literature in Darwin C G (1928 Proc. R. Soc. A 118 654), Nikiforov A F and Uvarov V B (1988 Special Functions of Mathematical Physics (Basle: Birkhauser) and Rose M E 1961 Relativistic Electron Theory (New York: Wiley)), and its solution, gives rise to a matrix weight function whose orthogonal polynomials solve a second order differential equation. To the best of our knowledge this is the first instance of a connection between the solution of the first order matrix equation of Dirac and the theory of matrix-valued orthogonal polynomials initiated by M G Krein
Efficient modeling of photonic crystals with local Hermite polynomials
Boucher, C. R.; Li, Zehao; Albrecht, J. D.; Ram-Mohan, L. R.
2014-01-01
Developing compact algorithms for accurate electrodynamic calculations with minimal computational cost is an active area of research given the increasing complexity in the design of electromagnetic composite structures such as photonic crystals, metamaterials, optical interconnects, and on-chip routing. We show that electric and magnetic (EM) fields can be calculated using scalar Hermite interpolation polynomials as the numerical basis functions without having to invoke edge-based vector finite elements to suppress spurious solutions or to satisfy boundary conditions. This approach offers several fundamental advantages as evidenced through band structure solutions for periodic systems and through waveguide analysis. Compared with reciprocal space (plane wave expansion) methods for periodic systems, advantages are shown in computational costs, the ability to capture spatial complexity in the dielectric distributions, the demonstration of numerical convergence with scaling, and variational eigenfunctions free of numerical artifacts that arise from mixed-order real space basis sets or the inherent aberrations from transforming reciprocal space solutions of finite expansions. The photonic band structure of a simple crystal is used as a benchmark comparison and the ability to capture the effects of spatially complex dielectric distributions is treated using a complex pattern with highly irregular features that would stress spatial transform limits. This general method is applicable to a broad class of physical systems, e.g., to semiconducting lasers which require simultaneous modeling of transitions in quantum wells or dots together with EM cavity calculations, to modeling plasmonic structures in the presence of EM field emissions, and to on-chip propagation within monolithic integrated circuits
Duru, Kenneth; Virta, Kristoffer
2014-01-01
to be discontinuous. The key feature is the highly accurate and provably stable treatment of interfaces where media discontinuities arise. We discretize in space using high order accurate finite difference schemes that satisfy the summation by parts rule. Conditions
High-Order Calderón Preconditioned Time Domain Integral Equation Solvers
Valdes, Felipe
2013-05-01
Two high-order accurate Calderón preconditioned time domain electric field integral equation (TDEFIE) solvers are presented. In contrast to existing Calderón preconditioned time domain solvers, the proposed preconditioner allows for high-order surface representations and current expansions by using a novel set of fully-localized high-order div-and quasi curl-conforming (DQCC) basis functions. Numerical results demonstrate that the linear systems of equations obtained using the proposed basis functions converge rapidly, regardless of the mesh density and of the order of the current expansion. © 1963-2012 IEEE.
High-Order Calderón Preconditioned Time Domain Integral Equation Solvers
Valdes, Felipe; Ghaffari-Miab, Mohsen; Andriulli, Francesco P.; Cools, Kristof; Michielssen,
2013-01-01
Two high-order accurate Calderón preconditioned time domain electric field integral equation (TDEFIE) solvers are presented. In contrast to existing Calderón preconditioned time domain solvers, the proposed preconditioner allows for high-order surface representations and current expansions by using a novel set of fully-localized high-order div-and quasi curl-conforming (DQCC) basis functions. Numerical results demonstrate that the linear systems of equations obtained using the proposed basis functions converge rapidly, regardless of the mesh density and of the order of the current expansion. © 1963-2012 IEEE.
Density of Real Zeros of the Tutte Polynomial
Ok, Seongmin; Perrett, Thomas
2018-01-01
The Tutte polynomial of a graph is a two-variable polynomial whose zeros and evaluations encode many interesting properties of the graph. In this article we investigate the real zeros of the Tutte polynomials of graphs, and show that they form a dense subset of certain regions of the plane. This ....... This is the first density result for the real zeros of the Tutte polynomial in a region of positive volume. Our result almost confirms a conjecture of Jackson and Sokal except for one region which is related to an open problem on flow polynomials.......The Tutte polynomial of a graph is a two-variable polynomial whose zeros and evaluations encode many interesting properties of the graph. In this article we investigate the real zeros of the Tutte polynomials of graphs, and show that they form a dense subset of certain regions of the plane...
Density of Real Zeros of the Tutte Polynomial
Ok, Seongmin; Perrett, Thomas
2017-01-01
The Tutte polynomial of a graph is a two-variable polynomial whose zeros and evaluations encode many interesting properties of the graph. In this article we investigate the real zeros of the Tutte polynomials of graphs, and show that they form a dense subset of certain regions of the plane. This ....... This is the first density result for the real zeros of the Tutte polynomial in a region of positive volume. Our result almost confirms a conjecture of Jackson and Sokal except for one region which is related to an open problem on flow polynomials.......The Tutte polynomial of a graph is a two-variable polynomial whose zeros and evaluations encode many interesting properties of the graph. In this article we investigate the real zeros of the Tutte polynomials of graphs, and show that they form a dense subset of certain regions of the plane...
Some Polynomials Associated with the r-Whitney Numbers
26
Abstract. In the present article we study three families of polynomials associated with ... [29, 39] for their relations with the Bernoulli and generalized Bernoulli polynomials and ... generating functions in a similar way as in the classical cases.
On an Inequality Concerning the Polar Derivative of a Polynomial
Abstract. In this paper, we present a correct proof of an -inequality concerning the polar derivative of a polynomial with restricted zeros. We also extend Zygmund's inequality to the polar derivative of a polynomial.
A Design-Adaptive Local Polynomial Estimator for the Errors-in-Variables Problem
Delaigle, Aurore
2009-03-01
Local polynomial estimators are popular techniques for nonparametric regression estimation and have received great attention in the literature. Their simplest version, the local constant estimator, can be easily extended to the errors-in-variables context by exploiting its similarity with the deconvolution kernel density estimator. The generalization of the higher order versions of the estimator, however, is not straightforward and has remained an open problem for the last 15 years. We propose an innovative local polynomial estimator of any order in the errors-in-variables context, derive its design-adaptive asymptotic properties and study its finite sample performance on simulated examples. We provide not only a solution to a long-standing open problem, but also provide methodological contributions to error-invariable regression, including local polynomial estimation of derivative functions.
Learning High-Order Filters for Efficient Blind Deconvolution of Document Photographs
Xiao, Lei; Wang, Jue; Heidrich, Wolfgang; Hirsch, Michael
2016-01-01
by small-scale high-order structures, we propose to learn a multi-scale, interleaved cascade of shrinkage fields model, which contains a series of high-order filters to facilitate joint recovery of blur kernel and latent image. With extensive experiments
Reduced-order LPV model of flexible wind turbines from high fidelity aeroelastic codes
Adegas, Fabiano Daher; Sønderby, Ivan Bergquist; Hansen, Morten Hartvig
2013-01-01
of high-order linear time invariant (LTI) models. Firstly, the high-order LTI models are locally approximated using modal and balanced truncation and residualization. Then, an appropriate coordinate transformation is applied to allow interpolation of the model matrices between points on the parameter...
2-variable Laguerre matrix polynomials and Lie-algebraic techniques
Khan, Subuhi; Hassan, Nader Ali Makboul
2010-01-01
The authors introduce 2-variable forms of Laguerre and modified Laguerre matrix polynomials and derive their special properties. Further, the representations of the special linear Lie algebra sl(2) and the harmonic oscillator Lie algebra G(0,1) are used to derive certain results involving these polynomials. Furthermore, the generating relations for the ordinary as well as matrix polynomials related to these matrix polynomials are derived as applications.
Algebraic limit cycles in polynomial systems of differential equations
Llibre, Jaume; Zhao Yulin
2007-01-01
Using elementary tools we construct cubic polynomial systems of differential equations with algebraic limit cycles of degrees 4, 5 and 6. We also construct a cubic polynomial system of differential equations having an algebraic homoclinic loop of degree 3. Moreover, we show that there are polynomial systems of differential equations of arbitrary degree that have algebraic limit cycles of degree 3, as well as give an example of a cubic polynomial system of differential equations with two algebraic limit cycles of degree 4
The generalized Yablonskii-Vorob'ev polynomials and their properties
Kudryashov, Nikolai A.; Demina, Maria V.
2008-01-01
Rational solutions of the generalized second Painleve hierarchy are classified. Representation of the rational solutions in terms of special polynomials, the generalized Yablonskii-Vorob'ev polynomials, is introduced. Differential-difference relations satisfied by the polynomials are found. Hierarchies of differential equations related to the generalized second Painleve hierarchy are derived. One of these hierarchies is a sequence of differential equations satisfied by the generalized Yablonskii-Vorob'ev polynomials
Polynomial selection in number field sieve for integer factorization
Gireesh Pandey
2016-09-01
Full Text Available The general number field sieve (GNFS is the fastest algorithm for factoring large composite integers which is made up by two prime numbers. Polynomial selection is an important step of GNFS. The asymptotic runtime depends on choice of good polynomial pairs. In this paper, we present polynomial selection algorithm that will be modelled with size and root properties. The correlations between polynomial coefficient and number of relations have been explored with experimental findings.
Bhalla, Amneet Pal Singh; Johansen, Hans; Graves, Dan; Martin, Dan; Colella, Phillip; Applied Numerical Algorithms Group Team
2017-11-01
We present a consistent cell-averaged discretization for incompressible Navier-Stokes equations on complex domains using embedded boundaries. The embedded boundary is allowed to freely cut the locally-refined background Cartesian grid. Implicit-function representation is used for the embedded boundary, which allows us to convert the required geometric moments in the Taylor series expansion (upto arbitrary order) of polynomials into an algebraic problem in lower dimensions. The computed geometric moments are then used to construct stencils for various operators like the Laplacian, divergence, gradient, etc., by solving a least-squares system locally. We also construct the inter-level data-transfer operators like prolongation and restriction for multi grid solvers using the same least-squares system approach. This allows us to retain high-order of accuracy near coarse-fine interface and near embedded boundaries. Canonical problems like Taylor-Green vortex flow and flow past bluff bodies will be presented to demonstrate the proposed method. U.S. Department of Energy, Office of Science, ASCR (Award Number DE-AC02-05CH11231).
High-order fractional partial differential equation transform for molecular surface construction.
Hu, Langhua; Chen, Duan; Wei, Guo-Wei
2013-01-01
Fractional derivative or fractional calculus plays a significant role in theoretical modeling of scientific and engineering problems. However, only relatively low order fractional derivatives are used at present. In general, it is not obvious what role a high fractional derivative can play and how to make use of arbitrarily high-order fractional derivatives. This work introduces arbitrarily high-order fractional partial differential equations (PDEs) to describe fractional hyperdiffusions. The fractional PDEs are constructed via fractional variational principle. A fast fractional Fourier transform (FFFT) is proposed to numerically integrate the high-order fractional PDEs so as to avoid stringent stability constraints in solving high-order evolution PDEs. The proposed high-order fractional PDEs are applied to the surface generation of proteins. We first validate the proposed method with a variety of test examples in two and three-dimensional settings. The impact of high-order fractional derivatives to surface analysis is examined. We also construct fractional PDE transform based on arbitrarily high-order fractional PDEs. We demonstrate that the use of arbitrarily high-order derivatives gives rise to time-frequency localization, the control of the spectral distribution, and the regulation of the spatial resolution in the fractional PDE transform. Consequently, the fractional PDE transform enables the mode decomposition of images, signals, and surfaces. The effect of the propagation time on the quality of resulting molecular surfaces is also studied. Computational efficiency of the present surface generation method is compared with the MSMS approach in Cartesian representation. We further validate the present method by examining some benchmark indicators of macromolecular surfaces, i.e., surface area, surface enclosed volume, surface electrostatic potential and solvation free energy. Extensive numerical experiments and comparison with an established surface model
Polynomial Chaos Expansion Approach to Interest Rate Models
Luca Di Persio
2015-01-01
Full Text Available The Polynomial Chaos Expansion (PCE technique allows us to recover a finite second-order random variable exploiting suitable linear combinations of orthogonal polynomials which are functions of a given stochastic quantity ξ, hence acting as a kind of random basis. The PCE methodology has been developed as a mathematically rigorous Uncertainty Quantification (UQ method which aims at providing reliable numerical estimates for some uncertain physical quantities defining the dynamic of certain engineering models and their related simulations. In the present paper, we use the PCE approach in order to analyze some equity and interest rate models. In particular, we take into consideration those models which are based on, for example, the Geometric Brownian Motion, the Vasicek model, and the CIR model. We present theoretical as well as related concrete numerical approximation results considering, without loss of generality, the one-dimensional case. We also provide both an efficiency study and an accuracy study of our approach by comparing its outputs with the ones obtained adopting the Monte Carlo approach, both in its standard and its enhanced version.
Tawancy, H.M.; Aboelfotoh, M.O.
2014-01-01
We have studied the effect of atom arrangements in the ground state structures of substitutional ordered alloys on their mechanical properties using nickel–molybdenum-based alloys as model systems. Three alloys with nominal compositions of Ni–19.43 at% Mo, Ni–18.53 at% Mo–15.21 at% Cr and Ni–18.72 at% Mo–6.14 at% Nb are included in the study. In agreement with theoretical predictions, the closely related Pt 2 Mo-type, DO 22 and D1 a superlattices with similar energies are identified by electron diffraction of ground state structures, which can directly be derived from the parent disordered fcc structure by minor atom rearrangements on {420} fcc planes. The three superlattices are observed to coexist during the disorder–order transformation at 700 °C with the most stable superlattice being determined by the exact chemical composition. Although most of the slip systems in the parent disordered fcc structure are suppressed, many of the twinning systems remain operative in the superlattices favoring deformation by twinning, which leads to considerable strengthening while maintaining high ductility levels. Both the Pt 2 Mo-type and DO 22 superlattices are distinguished by high strength and high ductility due to their nanoscale microstructures, which have high thermal stability. However, the D1 a superlattice is found to exhibit poor thermal stability leading to considerable loss of ductility, which has been correlated with self-induced recrystallization by migration of grain boundaries
Cox, Christopher
Low-order numerical methods are widespread in academic solvers and ubiquitous in industrial solvers due to their robustness and usability. High-order methods are less robust and more complicated to implement; however, they exhibit low numerical dissipation and have the potential to improve the accuracy of flow simulations at a lower computational cost when compared to low-order methods. This motivates our development of a high-order compact method using Huynh's flux reconstruction scheme for solving unsteady incompressible flow on unstructured grids. We use Chorin's classic artificial compressibility formulation with dual time stepping to solve unsteady flow problems. In 2D, an implicit non-linear lower-upper symmetric Gauss-Seidel scheme with backward Euler discretization is used to efficiently march the solution in pseudo time, while a second-order backward Euler discretization is used to march in physical time. We verify and validate implementation of the high-order method coupled with our implicit time stepping scheme using both steady and unsteady incompressible flow problems. The current implicit time stepping scheme is proven effective in satisfying the divergence-free constraint on the velocity field in the artificial compressibility formulation. The high-order solver is extended to 3D and parallelized using MPI. Due to its simplicity, time marching for 3D problems is done explicitly. The feasibility of using the current implicit time stepping scheme for large scale three-dimensional problems with high-order polynomial basis still remains to be seen. We directly use the aforementioned numerical solver to simulate pulsatile flow of a Newtonian blood-analog fluid through a rigid 180-degree curved artery model. One of the most physiologically relevant forces within the cardiovascular system is the wall shear stress. This force is important because atherosclerotic regions are strongly correlated with curvature and branching in the human vasculature, where the
Interlacing of zeros of quasi-orthogonal meixner polynomials | Driver ...
... interlacing of zeros of quasi-orthogonal Meixner polynomials Mn(x;β; c) with the zeros of their nearest orthogonal counterparts Mt(x;β + k; c), l; n ∈ ℕ, k ∈ {1; 2}; is also discussed. Mathematics Subject Classication (2010): 33C45, 42C05. Key words: Discrete orthogonal polynomials, quasi-orthogonal polynomials, Meixner
Strong result for real zeros of random algebraic polynomials
T. Uno
2001-01-01
Full Text Available An estimate is given for the lower bound of real zeros of random algebraic polynomials whose coefficients are non-identically distributed dependent Gaussian random variables. Moreover, our estimated measure of the exceptional set, which is independent of the degree of the polynomials, tends to zero as the degree of the polynomial tends to infinity.
On the Lorentz degree of a product of polynomials
Ait-Haddou, Rachid
2015-01-01
In this note, we negatively answer two questions of T. Erdélyi (1991, 2010) on possible lower bounds on the Lorentz degree of product of two polynomials. We show that the correctness of one question for degree two polynomials is a direct consequence of a result of Barnard et al. (1991) on polynomials with nonnegative coefficients.
A Determinant Expression for the Generalized Bessel Polynomials
Sheng-liang Yang
2013-01-01
Full Text Available Using the exponential Riordan arrays, we show that a variation of the generalized Bessel polynomial sequence is of Sheffer type, and we obtain a determinant formula for the generalized Bessel polynomials. As a result, the Bessel polynomial is represented as determinant the entries of which involve Catalan numbers.
On the estimation of the degree of regression polynomial
Toeroek, Cs.
1997-01-01
The mathematical functions most commonly used to model curvature in plots are polynomials. Generally, the higher the degree of the polynomial, the more complex is the trend that its graph can represent. We propose a new statistical-graphical approach based on the discrete projective transformation (DPT) to estimating the degree of polynomial that adequately describes the trend in the plot