Chebyshev polynomial functions based locally recurrent neuro-fuzzy information system for prediction of financial and energy market data

Directory of Open Access Journals (Sweden)

A.K. Parida

2016-09-01

Full Text Available In this paper Chebyshev polynomial functions based locally recurrent neuro-fuzzy information system is presented for the prediction and analysis of financial and electrical energy market data. The normally used TSK-type feedforward fuzzy neural network is unable to take the full advantage of the use of the linear fuzzy rule base in accurate input–output mapping and hence the consequent part of the rule base is made nonlinear using polynomial or arithmetic basis functions. Further the Chebyshev polynomial functions provide an expanded nonlinear transformation to the input space thereby increasing its dimension for capturing the nonlinearities and chaotic variations in financial or energy market data streams. Also the locally recurrent neuro-fuzzy information system (LRNFIS includes feedback loops both at the firing strength layer and the output layer to allow signal flow both in forward and backward directions, thereby making the LRNFIS mimic a dynamic system that provides fast convergence and accuracy in predicting time series fluctuations. Instead of using forward and backward least mean square (FBLMS learning algorithm, an improved Firefly-Harmony search (IFFHS learning algorithm is used to estimate the parameters of the consequent part and feedback loop parameters for better stability and convergence. Several real world financial and energy market time series databases are used for performance validation of the proposed LRNFIS model.

High-performance implementation of Chebyshev filter diagonalization for interior eigenvalue computations

Energy Technology Data Exchange (ETDEWEB)

Pieper, Andreas [Ernst-Moritz-Arndt-Universität Greifswald (Germany); Kreutzer, Moritz [Friedrich-Alexander-Universität Erlangen-Nürnberg (Germany); Alvermann, Andreas, E-mail: alvermann@physik.uni-greifswald.de [Ernst-Moritz-Arndt-Universität Greifswald (Germany); Galgon, Martin [Bergische Universität Wuppertal (Germany); Fehske, Holger [Ernst-Moritz-Arndt-Universität Greifswald (Germany); Hager, Georg [Friedrich-Alexander-Universität Erlangen-Nürnberg (Germany); Lang, Bruno [Bergische Universität Wuppertal (Germany); Wellein, Gerhard [Friedrich-Alexander-Universität Erlangen-Nürnberg (Germany)

2016-11-15

We study Chebyshev filter diagonalization as a tool for the computation of many interior eigenvalues of very large sparse symmetric matrices. In this technique the subspace projection onto the target space of wanted eigenvectors is approximated with filter polynomials obtained from Chebyshev expansions of window functions. After the discussion of the conceptual foundations of Chebyshev filter diagonalization we analyze the impact of the choice of the damping kernel, search space size, and filter polynomial degree on the computational accuracy and effort, before we describe the necessary steps towards a parallel high-performance implementation. Because Chebyshev filter diagonalization avoids the need for matrix inversion it can deal with matrices and problem sizes that are presently not accessible with rational function methods based on direct or iterative linear solvers. To demonstrate the potential of Chebyshev filter diagonalization for large-scale problems of this kind we include as an example the computation of the 10{sup 2} innermost eigenpairs of a topological insulator matrix with dimension 10{sup 9} derived from quantum physics applications.

Accelerated solution of non-linear flow problems using Chebyshev iteration polynomial based RK recursions

Energy Technology Data Exchange (ETDEWEB)

Lorber, A.A.; Carey, G.F.; Bova, S.W.; Harle, C.H. [Univ. of Texas, Austin, TX (United States)

1996-12-31

The connection between the solution of linear systems of equations by iterative methods and explicit time stepping techniques is used to accelerate to steady state the solution of ODE systems arising from discretized PDEs which may involve either physical or artificial transient terms. Specifically, a class of Runge-Kutta (RK) time integration schemes with extended stability domains has been used to develop recursion formulas which lead to accelerated iterative performance. The coefficients for the RK schemes are chosen based on the theory of Chebyshev iteration polynomials in conjunction with a local linear stability analysis. We refer to these schemes as Chebyshev Parameterized Runge Kutta (CPRK) methods. CPRK methods of one to four stages are derived as functions of the parameters which describe an ellipse {Epsilon} which the stability domain of the methods is known to contain. Of particular interest are two-stage, first-order CPRK and four-stage, first-order methods. It is found that the former method can be identified with any two-stage RK method through the correct choice of parameters. The latter method is found to have a wide range of stability domains, with a maximum extension of 32 along the real axis. Recursion performance results are presented below for a model linear convection-diffusion problem as well as non-linear fluid flow problems discretized by both finite-difference and finite-element methods.

Using Chebyshev polynomials and approximate inverse triangular factorizations for preconditioning the conjugate gradient method

Science.gov (United States)

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.

Derivation of reduced model for control system design using Chebyshev techniques

International Nuclear Information System (INIS)

Bistritz, Y.

1978-07-01

New methods are developed for reduced-order modelling of high-order, linear, time-invariant systems characterized by a transfer function. The first method is based on manipulating two Chebyshev polynomial series, one representing the frequency characteristics of the high-order system and the other representing the approximating low-order model. The proposed method can be viewed as generalizing the classical Pade approximation problem, with Chebyshev polynomial series being over a desired frequency interval instead of a power series about a single frequency point. The second method is based on approximating the high-order transfer function in terms of best Chebyshev approximation on a desired domain in the complex plane. An algorithm to find for a complex function best Chebyshev rational approximations in the complex plane is suggested and its theoretical basis confirmed. The algorithm is based on a complex version of Lawson algorithm that is applied to a complex version of a rational least square approximation program. (author)

Pseudo-random bit generator based on Chebyshev map

Science.gov (United States)

Stoyanov, B. P.

2013-10-01

In this paper, we study a pseudo-random bit generator based on two Chebyshev polynomial maps. The novel derivative algorithm shows perfect statistical properties established by number of statistical tests.

A Fast, Simple, and Stable Chebyshev--Legendre Transform Using an Asymptotic Formula

KAUST Repository

Hale, Nicholas; Townsend, Alex

2014-01-01

-known asymptotic formula for Legendre polynomials of large degree as a weighted linear combination of Chebyshev polynomials, which can then be evaluated by using the discrete cosine transform. Numerical results are provided to demonstrate the efficiency

and chebyshev functions

Directory of Open Access Journals (Sweden)

Mohsen Razzaghi

2000-01-01

Full Text Available A direct method for finding the solution of variational problems using a hybrid function is discussed. The hybrid functions which consist of block-pulse functions plus Chebyshev polynomials are introduced. An operational matrix of integration and the integration of the cross product of two hybrid function vectors are presented and are utilized to reduce a variational problem to the solution of an algebraic equation. Illustrative examples are included to demonstrate the validity and applicability of the technique.

A New Six-Parameter Model Based on Chebyshev Polynomials for Solar Cells

Directory of Open Access Journals (Sweden)

Shu-xian Lun

2015-01-01

Full Text Available This paper presents a new current-voltage (I-V model for solar cells. It has been proved that series resistance of a solar cell is related to temperature. However, the existing five-parameter model ignores the temperature dependence of series resistance and then only accurately predicts the performance of monocrystalline silicon solar cells. Therefore, this paper uses Chebyshev polynomials to describe the relationship between series resistance and temperature. This makes a new parameter called temperature coefficient for series resistance introduced into the single-diode model. Then, a new six-parameter model for solar cells is established in this paper. This new model can improve the accuracy of the traditional single-diode model and reflect the temperature dependence of series resistance. To validate the accuracy of the six-parameter model in this paper, five kinds of silicon solar cells with different technology types, that is, monocrystalline silicon, polycrystalline silicon, thin film silicon, and tripe-junction amorphous silicon, are tested at different irradiance and temperature conditions. Experiment results show that the six-parameter model proposed in this paper is an I-V model with moderate computational complexity and high precision.

The finite Fourier transform of classical polynomials

OpenAIRE

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

2014-01-01

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

Application of polynomial preconditioners to conservation laws

NARCIS (Netherlands)

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

2000-01-01

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

Chebyshev Finite Difference Method for Fractional Boundary Value Problems

Directory of Open Access Journals (Sweden)

Boundary

2015-09-01

Full Text Available This paper presents a numerical method for fractional differential equations using Chebyshev finite difference method. The fractional derivatives are described in the Caputo sense. Numerical results show that this method is of high accuracy and is more convenient and efficient for solving boundary value problems involving fractional ordinary differential equations. AMS Subject Classification: 34A08 Keywords and Phrases: Chebyshev polynomials, Gauss-Lobatto points, fractional differential equation, finite difference 1. Introduction The idea of a derivative which interpolates between the familiar integer order derivatives was introduced many years ago and has gained increasing importance only in recent years due to the development of mathematical models of a certain situations in engineering, materials science, control theory, polymer modelling etc. For example see [20, 22, 25, 26]. Most fractional order differential equations describing real life situations, in general do not have exact analytical solutions. Several numerical and approximate analytical methods for ordinary differential equation Received: December 2014; Accepted: March 2015 57 Journal of Mathematical Extension Vol. 9, No. 3, (2015, 57-71 ISSN: 1735-8299 URL: http://www.ijmex.com Chebyshev Finite Difference Method for Fractional Boundary Value Problems H. Azizi Taft Branch, Islamic Azad University Abstract. This paper presents a numerical method for fractional differential equations using Chebyshev finite difference method. The fractional derivative

Modeling Belt-Servomechanism by Chebyshev Functional Recurrent Neuro-Fuzzy Network

Science.gov (United States)

Huang, Yuan-Ruey; Kang, Yuan; Chu, Ming-Hui; Chang, Yeon-Pun

A novel Chebyshev functional recurrent neuro-fuzzy (CFRNF) network is developed from a combination of the Takagi-Sugeno-Kang (TSK) fuzzy model and the Chebyshev recurrent neural network (CRNN). The CFRNF network can emulate the nonlinear dynamics of a servomechanism system. The system nonlinearity is addressed by enhancing the input dimensions of the consequent parts in the fuzzy rules due to functional expansion of a Chebyshev polynomial. The back propagation algorithm is used to adjust the parameters of the antecedent membership functions as well as those of consequent functions. To verify the performance of the proposed CFRNF, the experiment of the belt servomechanism is presented in this paper. Both of identification methods of adaptive neural fuzzy inference system (ANFIS) and recurrent neural network (RNN) are also studied for modeling of the belt servomechanism. The analysis and comparison results indicate that CFRNF makes identification of complex nonlinear dynamic systems easier. It is verified that the accuracy and convergence of the CFRNF are superior to those of ANFIS and RNN by the identification results of a belt servomechanism.

A multidomain chebyshev pseudo-spectral method for fluid flow and heat transfer from square cylinders

KAUST Repository

Wang, Zhiheng; Huang, Zhu; Zhang, Wei; Xi, Guang

2015-01-01

of the computational domain. The velocities and pressure are discretized with the same order of Chebyshev polynomials, i.e., the PN-PN method. The Projection method is applied in coupling the pressure with the velocity. The present method is first validated

SOLUTION OF SINGULAR INTEGRAL EQUATION FOR ELASTICITY THEORY WITH THE HELP OF ASYMPTOTIC POLYNOMIAL FUNCTION

Directory of Open Access Journals (Sweden)

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.

An embedded formula of the Chebyshev collocation method for stiff problems

Science.gov (United States)

Piao, Xiangfan; Bu, Sunyoung; Kim, Dojin; Kim, Philsu

2017-12-01

In this study, we have developed an embedded formula of the Chebyshev collocation method for stiff problems, based on the zeros of the generalized Chebyshev polynomials. A new strategy for the embedded formula, using a pair of methods to estimate the local truncation error, as performed in traditional embedded Runge-Kutta schemes, is proposed. The method is performed in such a way that not only the stability region of the embedded formula can be widened, but by allowing the usage of larger time step sizes, the total computational costs can also be reduced. In terms of concrete convergence and stability analysis, the constructed algorithm turns out to have an 8th order convergence and it exhibits A-stability. Through several numerical experimental results, we have demonstrated that the proposed method is numerically more efficient, compared to several existing implicit methods.

Parallel multigrid smoothing: polynomial versus Gauss-Seidel

International Nuclear Information System (INIS)

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

2003-01-01

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

Parallel multigrid smoothing: polynomial versus Gauss-Seidel

Science.gov (United States)

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

2003-07-01

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

A multidomain chebyshev pseudo-spectral method for fluid flow and heat transfer from square cylinders

KAUST Repository

Wang, Zhiheng

2015-01-01

A simple multidomain Chebyshev pseudo-spectral method is developed for two-dimensional fluid flow and heat transfer over square cylinders. The incompressible Navier-Stokes equations with primitive variables are discretized in several subdomains of the computational domain. The velocities and pressure are discretized with the same order of Chebyshev polynomials, i.e., the PN-PN method. The Projection method is applied in coupling the pressure with the velocity. The present method is first validated by benchmark problems of natural convection in a square cavity. Then the method based on multidomains is applied to simulate fluid flow and heat transfer from square cylinders. The numerical results agree well with the existing results. © Taylor & Francis Group, LLC.

On Sequences of Numbers and Polynomials Defined by Linear Recurrence Relations of Order 2

Directory of Open Access Journals (Sweden)

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.

A NEW TOOL FOR IMAGE ANALYSIS BASED ON CHEBYSHEV RATIONAL FUNCTIONS: CHEF FUNCTIONS

International Nuclear Information System (INIS)

Jiménez-Teja, Y.; Benítez, N.

2012-01-01

We introduce a new approach to the modeling of the light distribution of galaxies, an orthonormal polar basis formed by a combination of Chebyshev rational functions and Fourier polynomials that we call CHEF functions, or CHEFs. We have developed an orthonormalization process to apply this basis to pixelized images, and implemented the method as a Python pipeline. The new basis displays remarkable flexibility, being able to accurately fit all kinds of galaxy shapes, including irregulars, spirals, ellipticals, highly compact, and highly elongated galaxies. It does this while using fewer components than similar methods, as shapelets, and without producing artifacts, due to the efficiency of the rational Chebyshev polynomials to fit quickly decaying functions like galaxy profiles. The method is linear and very stable, and therefore is capable of processing large numbers of galaxies in a fast and automated way. Due to the high quality of the fits in the central parts of the galaxies, and the efficiency of the CHEF basis modeling galaxy profiles up to very large distances, the method provides highly accurate estimates of total galaxy fluxes and ellipticities. Future papers will explore in more detail the application of the method to perform multiband photometry, morphological classification, and weak shear measurements.

Discrete-Time Filter Synthesis using Product of Gegenbauer Polynomials

Directory of Open Access Journals (Sweden)

N. Stojanovic

2016-09-01

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

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

International Nuclear Information System (INIS)

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

2007-01-01

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

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

Science.gov (United States)

Rack, Heinz-Joachim

2017-07-01

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

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

Science.gov (United States)

Boyd, John P.

2013-08-01

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

Mapped Chebyshev Pseudo-Spectral Method for Dynamic Aero-Elastic Problem of Limit Cycle Oscillation

Science.gov (United States)

Im, Dong Kyun; Kim, Hyun Soon; Choi, Seongim

2018-05-01

A mapped Chebyshev pseudo-spectral method is developed as one of the Fourier-spectral approaches and solves nonlinear PDE systems for unsteady flows and dynamic aero-elastic problem in a given time interval, where the flows or elastic motions can be periodic, nonperiodic, or periodic with an unknown frequency. The method uses the Chebyshev polynomials of the first kind for the basis function and redistributes the standard Chebyshev-Gauss-Lobatto collocation points more evenly by a conformal mapping function for improved numerical stability. Contributions of the method are several. It can be an order of magnitude more efficient than the conventional finite difference-based, time-accurate computation, depending on the complexity of solutions and the number of collocation points. The method reformulates the dynamic aero-elastic problem in spectral form for coupled analysis of aerodynamics and structures, which can be effective for design optimization of unsteady and dynamic problems. A limit cycle oscillation (LCO) is chosen for the validation and a new method to determine the LCO frequency is introduced based on the minimization of a second derivative of the aero-elastic formulation. Two examples of the limit cycle oscillation are tested: nonlinear, one degree-of-freedom mass-spring-damper system and two degrees-of-freedom oscillating airfoil under pitch and plunge motions. Results show good agreements with those of the conventional time-accurate simulations and wind tunnel experiments.

All-Pole Recursive Digital Filters Design Based on Ultraspherical Polynomials

OpenAIRE

N. Stojanovic; N. Stamenkovic; V. Stojanovic

2014-01-01

A simple method for approximation of all-pole recursive digital filters, directly in digital domain, is described. Transfer function of these filters, referred to as Ultraspherical filters, is controlled by order of the Ultraspherical polynomial, nu. Parameter nu, restricted to be a nonnegative real number (nu ≥ 0), controls ripple peaks in the passband of the magnitude response and enables a trade-off between the passband loss and the group delay response of the resulting filter. Chebyshev f...

Chebyshev approximations for the transmission integral for one single line in Moessbauer spectroscopy

International Nuclear Information System (INIS)

Flores-Lamas, H.

1994-01-01

An analytic expansion, to arbitrary accuracy, of the transmission integral (TI) for a single Moessbauer line is presented. This serves for calculating the effective thickness (T a ) of an absorber in Moessbauer spectroscopy even for T a >10. The new analytic expansion arises from substituting in the TI expression the exponential function by a Chebyshev polynomials series. A very fast converging series for TI is obtained and used as a test function in a least squares fit to a simulated spectrum. The test yields satisfactory results. The area and height parameters calculated were found to be in good agreement with earlier results. The present analytic method assumes that the source and absorber widths are different. ((orig.))

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

Science.gov (United States)

Abd-Elhameed, W. M.

2017-07-01

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

Cosine and sine operators related to orthogonal polynomial sets on the interval [-1, 1

International Nuclear Information System (INIS)

Appl, Thomas; Schiller, Diethard H

2005-01-01

The quantization of phase is still an open problem. In the approach of Susskind and Glogower, the so-called cosine and sine operators play a fundamental role. Their eigenstates in the Fock representation are related to the Chebyshev polynomials of the second kind. Here we introduce more general cosine and sine operators whose eigenfunctions in the Fock basis are related in a similar way to arbitrary orthogonal polynomial sets on the interval [-1, 1]. To each polynomial set defined in terms of a weight function there corresponds a pair of cosine and sine operators. Depending on the symmetry of the weight function, we distinguish generalized or extended operators. Their eigenstates are used to define cosine and sine representations and probability distributions. We also consider the arccosine and arcsine operators and use their eigenstates to define cosine-phase and sine-phase distributions, respectively. Specific, numerical and graphical results are given for the classical orthogonal polynomials and for particular Fock and coherent states

Radar and Lidar Radar DEM

Science.gov (United States)

Liskovich, Diana; Simard, Marc

2011-01-01

Using radar and lidar data, the aim is to improve 3D rendering of terrain, including digital elevation models (DEM) and estimates of vegetation height and biomass in a variety of forest types and terrains. The 3D mapping of vegetation structure and the analysis are useful to determine the role of forest in climate change (carbon cycle), in providing habitat and as a provider of socio-economic services. This in turn will lead to potential for development of more effective land-use management. The first part of the project was to characterize the Shuttle Radar Topography Mission DEM error with respect to ICESat/GLAS point estimates of elevation. We investigated potential trends with latitude, canopy height, signal to noise ratio (SNR), number of LiDAR waveform peaks, and maximum peak width. Scatter plots were produced for each variable and were fitted with 1st and 2nd degree polynomials. Higher order trends were visually inspected through filtering with a mean and median filter. We also assessed trends in the DEM error variance. Finally, a map showing how DEM error was geographically distributed globally was created.

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

International Nuclear Information System (INIS)

Ramazanov, A.-R K

2005-01-01

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

Computer programme for the derivation of transfer functions for multivariable systems (solutions of determinants with polynomial elements)

International Nuclear Information System (INIS)

Guppy, C.B.

1962-03-01

In the methods adopted in this report transfer functions in the form of the ratio of two polynomials of the complex variable s are derived from sets of laplace transformed simultaneous differential equations. The set of algebraic simultaneous equations are solved using Cramer's Rule and this gives rise to determinants having polynomial elements. It is shown how the determinants are formed when transfer functions are specified. The procedure for finding the polynomial coefficients from a given determinant is fully described. The first method adopted is a direct one and reduces a determinant with first degree polynomial elements to secular form and follows this by an application of the similarity transformation to reduce the determinant to a form from which the polynomial coefficients can be read out directly. The programme is able to solve a single determinant with polynomial elements and this can be used to reduce an eigenvalue problem in the form of a secular determinant to polynomial form if the need arises. A description is given of the way in which the data is to be set out for solution by the programme. A description is also given of a method used in an earlier programme for solving polynomial determinants by curve fitting techniques using Chebyshev Polynomials. In this method determinants with polynomial elements of any degree can be solved. (author)

Two-Level Chebyshev Filter Based Complementary Subspace Method: Pushing the Envelope of Large-Scale Electronic Structure Calculations.

Science.gov (United States)

Banerjee, Amartya S; Lin, Lin; Suryanarayana, Phanish; Yang, Chao; Pask, John E

2018-06-12

We describe a novel iterative strategy for Kohn-Sham density functional theory calculations aimed at large systems (>1,000 electrons), applicable to metals and insulators alike. In lieu of explicit diagonalization of the Kohn-Sham Hamiltonian on every self-consistent field (SCF) iteration, we employ a two-level Chebyshev polynomial filter based complementary subspace strategy to (1) compute a set of vectors that span the occupied subspace of the Hamiltonian; (2) reduce subspace diagonalization to just partially occupied states; and (3) obtain those states in an efficient, scalable manner via an inner Chebyshev filter iteration. By reducing the necessary computation to just partially occupied states and obtaining these through an inner Chebyshev iteration, our approach reduces the cost of large metallic calculations significantly, while eliminating subspace diagonalization for insulating systems altogether. We describe the implementation of the method within the framework of the discontinuous Galerkin (DG) electronic structure method and show that this results in a computational scheme that can effectively tackle bulk and nano systems containing tens of thousands of electrons, with chemical accuracy, within a few minutes or less of wall clock time per SCF iteration on large-scale computing platforms. We anticipate that our method will be instrumental in pushing the envelope of large-scale ab initio molecular dynamics. As a demonstration of this, we simulate a bulk silicon system containing 8,000 atoms at finite temperature, and obtain an average SCF step wall time of 51 s on 34,560 processors; thus allowing us to carry out 1.0 ps of ab initio molecular dynamics in approximately 28 h (of wall time).

Research on a dem Coregistration Method Based on the SAR Imaging Geometry

Science.gov (United States)

Niu, Y.; Zhao, C.; Zhang, J.; Wang, L.; Li, B.; Fan, L.

2018-04-01

Due to the systematic error, especially the horizontal deviation that exists in the multi-source, multi-temporal DEMs (Digital Elevation Models), a method for high precision coregistration is needed. This paper presents a new fast DEM coregistration method based on a given SAR (Synthetic Aperture Radar) imaging geometry to overcome the divergence and time-consuming problem of the conventional DEM coregistration method. First, intensity images are simulated for two DEMs under the given SAR imaging geometry. 2D (Two-dimensional) offsets are estimated in the frequency domain using the intensity cross-correlation operation in the FFT (Fast Fourier Transform) tool, which can greatly accelerate the calculation process. Next, the transformation function between two DEMs is achieved via the robust least-square fitting of 2D polynomial operation. Accordingly, two DEMs can be precisely coregistered. Last, two DEMs, i.e., one high-resolution LiDAR (Light Detection and Ranging) DEM and one low-resolution SRTM (Shutter Radar Topography Mission) DEM, covering the Yangjiao landslide region of Chongqing are taken as an example to test the new method. The results indicate that, in most cases, this new method can achieve not only a result as much as 80 times faster than the minimum elevation difference (Least Z-difference, LZD) DEM registration method, but also more accurate and more reliable results.

Antireflection coatings with Chebyshev or Butterworth response - Design

Science.gov (United States)

Baumeister, Philip

1986-12-01

The approximation of Kard (1971) is used to find values for the refractive indices of nonabsorbing layers with equal optical thickness to produce an antireflection (AR) coating for a dielectric substrate that has a Chebyshev spectral response, with application to the design of bandpass filters. The method is numerically demonstrated with the example of four-layer Chebyshev AR coatings with narrow, medium and wide bandwidths, and substrates of indices 2, 5, and 10. Approximate indices are also given for the case when the radiant reflectance/transmittance of the coating vs frequency is maximally flat (Butterworth response).

All-Pole Recursive Digital Filters Design Based on Ultraspherical Polynomials

Directory of Open Access Journals (Sweden)

N. Stojanovic

2014-09-01

Full Text Available A simple method for approximation of all-pole recursive digital filters, directly in digital domain, is described. Transfer function of these filters, referred to as Ultraspherical filters, is controlled by order of the Ultraspherical polynomial, nu. Parameter nu, restricted to be a nonnegative real number (nu ≥ 0, controls ripple peaks in the passband of the magnitude response and enables a trade-off between the passband loss and the group delay response of the resulting filter. Chebyshev filters of the first and of the second kind, and also Legendre and Butterworth filters are shown to be special cases of these allpole recursive digital filters. Closed form equations for the computation of the filter coefficients are provided. The design technique is illustrated with examples.

Chebyshev and Fourier spectral methods

CERN Document Server

Boyd, John P

2001-01-01

Completely revised text focuses on use of spectral methods to solve boundary value, eigenvalue, and time-dependent problems, but also covers Hermite, Laguerre, rational Chebyshev, sinc, and spherical harmonic functions, as well as cardinal functions, linear eigenvalue problems, matrix-solving methods, coordinate transformations, methods for unbounded intervals, spherical and cylindrical geometry, and much more. 7 Appendices. Glossary. Bibliography. Index. Over 160 text figures.

Chebyshev blossoming in Müntz spaces: Toward shaping with Young diagrams

KAUST Repository

Ait-Haddou, Rachid

2013-08-01

The notion of a blossom in extended Chebyshev spaces offers adequate generalizations and extra-utilities to the tools for free-form design schemes. Unfortunately, such advantages are often overshadowed by the complexity of the resulting algorithms. In this work, we show that for the case of Müntz spaces with integer exponents, the notion of a Chebyshev blossom leads to elegant algorithms whose complexities are embedded in the combinatorics of Schur functions. We express the blossom and the pseudo-affinity property in Müntz spaces in terms of Schur functions. We derive an explicit expression for the Chebyshev-Bernstein basis via an inductive argument on nested Müntz spaces. We also reveal a simple algorithm for dimension elevation. Free-form design schemes in Müntz spaces with Young diagrams as shape parameters are discussed. © 2013 Elsevier Ltd. All rights reserved.

Chebyshev blossoming in Müntz spaces: Toward shaping with Young diagrams

KAUST Repository

Ait-Haddou, Rachid; Sakane, Yusuke; Nomura, Taishin

2013-01-01

The notion of a blossom in extended Chebyshev spaces offers adequate generalizations and extra-utilities to the tools for free-form design schemes. Unfortunately, such advantages are often overshadowed by the complexity of the resulting algorithms. In this work, we show that for the case of Müntz spaces with integer exponents, the notion of a Chebyshev blossom leads to elegant algorithms whose complexities are embedded in the combinatorics of Schur functions. We express the blossom and the pseudo-affinity property in Müntz spaces in terms of Schur functions. We derive an explicit expression for the Chebyshev-Bernstein basis via an inductive argument on nested Müntz spaces. We also reveal a simple algorithm for dimension elevation. Free-form design schemes in Müntz spaces with Young diagrams as shape parameters are discussed. © 2013 Elsevier Ltd. All rights reserved.

Comparison of matrix exponential methods for fuel burnup calculations

International Nuclear Information System (INIS)

Oh, Hyung Suk; Yang, Won Sik

1999-01-01

Series expansion methods to compute the exponential of a matrix have been compared by applying them to fuel depletion calculations. Specifically, Taylor, Pade, Chebyshev, and rational Chebyshev approximations have been investigated by approximating the exponentials of bum matrices by truncated series of each method with the scaling and squaring algorithm. The accuracy and efficiency of these methods have been tested by performing various numerical tests using one thermal reactor and two fast reactor depletion problems. The results indicate that all the four series methods are accurate enough to be used for fuel depletion calculations although the rational Chebyshev approximation is relatively less accurate. They also show that the rational approximations are more efficient than the polynomial approximations. Considering the computational accuracy and efficiency, the Pade approximation appears to be better than the other methods. Its accuracy is better than the rational Chebyshev approximation, while being comparable to the polynomial approximations. On the other hand, its efficiency is better than the polynomial approximations and is similar to the rational Chebyshev approximation. In particular, for fast reactor depletion calculations, it is faster than the polynomial approximations by a factor of ∼ 1.7. (author). 11 refs., 4 figs., 2 tabs

Chebyshev super spectral viscosity method for water hammer analysis

Directory of Open Access Journals (Sweden)

Hongyu Chen

2013-09-01

Full Text Available In this paper, a new fast and efficient algorithm, Chebyshev super spectral viscosity (SSV method, is introduced to solve the water hammer equations. Compared with standard spectral method, the method's advantage essentially consists in adding a super spectral viscosity to the equations for the high wave numbers of the numerical solution. It can stabilize the numerical oscillation (Gibbs phenomenon and improve the computational efficiency while discontinuities appear in the solution. Results obtained from the Chebyshev super spectral viscosity method exhibit greater consistency with conventional water hammer calculations. It shows that this new numerical method offers an alternative way to investigate the behavior of the water hammer in propellant pipelines.

Stable Numerical Approach for Fractional Delay Differential Equations

Science.gov (United States)

Singh, Harendra; Pandey, Rajesh K.; Baleanu, D.

2017-12-01

In this paper, we present a new stable numerical approach based on the operational matrix of integration of Jacobi polynomials for solving fractional delay differential equations (FDDEs). The operational matrix approach converts the FDDE into a system of linear equations, and hence the numerical solution is obtained by solving the linear system. The error analysis of the proposed method is also established. Further, a comparative study of the approximate solutions is provided for the test examples of the FDDE by varying the values of the parameters in the Jacobi polynomials. As in special case, the Jacobi polynomials reduce to the well-known polynomials such as (1) Legendre polynomial, (2) Chebyshev polynomial of second kind, (3) Chebyshev polynomial of third and (4) Chebyshev polynomial of fourth kind respectively. Maximum absolute error and root mean square error are calculated for the illustrated examples and presented in form of tables for the comparison purpose. Numerical stability of the presented method with respect to all four kind of polynomials are discussed. Further, the obtained numerical results are compared with some known methods from the literature and it is observed that obtained results from the proposed method is better than these methods.

An Efficient Algorithm for Perturbed Orbit Integration Combining Analytical Continuation and Modified Chebyshev Picard Iteration

Science.gov (United States)

Elgohary, T.; Kim, D.; Turner, J.; Junkins, J.

2014-09-01

Several methods exist for integrating the motion in high order gravity fields. Some recent methods use an approximate starting orbit, and an efficient method is needed for generating warm starts that account for specific low order gravity approximations. By introducing two scalar Lagrange-like invariants and employing Leibniz product rule, the perturbed motion is integrated by a novel recursive formulation. The Lagrange-like invariants allow exact arbitrary order time derivatives. Restricting attention to the perturbations due to the zonal harmonics J2 through J6, we illustrate an idea. The recursively generated vector-valued time derivatives for the trajectory are used to develop a continuation series-based solution for propagating position and velocity. Numerical comparisons indicate performance improvements of ~ 70X over existing explicit Runge-Kutta methods while maintaining mm accuracy for the orbit predictions. The Modified Chebyshev Picard Iteration (MCPI) is an iterative path approximation method to solve nonlinear ordinary differential equations. The MCPI utilizes Picard iteration with orthogonal Chebyshev polynomial basis functions to recursively update the states. The key advantages of the MCPI are as follows: 1) Large segments of a trajectory can be approximated by evaluating the forcing function at multiple nodes along the current approximation during each iteration. 2) It can readily handle general gravity perturbations as well as non-conservative forces. 3) Parallel applications are possible. The Picard sequence converges to the solution over large time intervals when the forces are continuous and differentiable. According to the accuracy of the starting solutions, however, the MCPI may require significant number of iterations and function evaluations compared to other integrators. In this work, we provide an efficient methodology to establish good starting solutions from the continuation series method; this warm start improves the performance of the

Free vibration of Euler and Timoshenko nanobeams using boundary characteristic orthogonal polynomials

Science.gov (United States)

Behera, Laxmi; Chakraverty, S.

2014-03-01

Vibration analysis of nonlocal nanobeams based on Euler-Bernoulli and Timoshenko beam theories is considered. Nonlocal nanobeams are important in the bending, buckling and vibration analyses of beam-like elements in microelectromechanical or nanoelectromechanical devices. Expressions for free vibration of Euler-Bernoulli and Timoshenko nanobeams are established within the framework of Eringen's nonlocal elasticity theory. The problem has been solved previously using finite element method, Chebyshev polynomials in Rayleigh-Ritz method and using other numerical methods. In this study, numerical results for free vibration of nanobeams have been presented using simple polynomials and orthonormal polynomials in the Rayleigh-Ritz method. The advantage of the method is that one can easily handle the specified boundary conditions at the edges. To validate the present analysis, a comparison study is carried out with the results of the existing literature. The proposed method is also validated by convergence studies. Frequency parameters are found for different scaling effect parameters and boundary conditions. The study highlights that small scale effects considerably influence the free vibration of nanobeams. Nonlocal frequency parameters of nanobeams are smaller when compared to the corresponding local ones. Deflection shapes of nonlocal clamped Euler-Bernoulli nanobeams are also incorporated for different scaling effect parameters, which are affected by the small scale effect. Obtained numerical solutions provide a better representation of the vibration behavior of short and stubby micro/nanobeams where the effects of small scale, transverse shear deformation and rotary inertia are significant.

Automatic relative RPC image model bias compensation through hierarchical image matching for improving DEM quality

Science.gov (United States)

Noh, Myoung-Jong; Howat, Ian M.

2018-02-01

The quality and efficiency of automated Digital Elevation Model (DEM) extraction from stereoscopic satellite imagery is critically dependent on the accuracy of the sensor model used for co-locating pixels between stereo-pair images. In the absence of ground control or manual tie point selection, errors in the sensor models must be compensated with increased matching search-spaces, increasing both the computation time and the likelihood of spurious matches. Here we present an algorithm for automatically determining and compensating the relative bias in Rational Polynomial Coefficients (RPCs) between stereo-pairs utilizing hierarchical, sub-pixel image matching in object space. We demonstrate the algorithm using a suite of image stereo-pairs from multiple satellites over a range stereo-photogrammetrically challenging polar terrains. Besides providing a validation of the effectiveness of the algorithm for improving DEM quality, experiments with prescribed sensor model errors yield insight into the dependence of DEM characteristics and quality on relative sensor model bias. This algorithm is included in the Surface Extraction through TIN-based Search-space Minimization (SETSM) DEM extraction software package, which is the primary software used for the U.S. National Science Foundation ArcticDEM and Reference Elevation Model of Antarctica (REMA) products.

Further development of Chebyshev type inequalities for Sugeno integrals and T-(S-)evaluators

Czech Academy of Sciences Publication Activity Database

Agahi, H.; Mesiar, Radko; Ouyang, Y.

2010-01-01

Roč. 46, č. 1 (2010), s. 83-95 ISSN 0023-5954 R&D Projects: GA ČR GA402/08/0618 Institutional research plan: CEZ:AV0Z10750506 Keywords : Sugeno integral * fuzzy measure * comonotone functions * Chebyshev's inequality Subject RIV: BA - General Mathematics Impact factor: 0.461, year: 2010 http://library.utia.cas.cz/separaty/2010/E/mesiar-further development of chebyshev type inequalities for sugeno integrals and t-(s-)evaluators.pdf

Enhanced ASTER DEMs for Decadal Measurements of Glacier Elevation Changes

Science.gov (United States)

Girod, L.; Nuth, C.; Kääb, A.

2016-12-01

Elevation change data is critical to the understanding of a number of geophysical processes, including glaciers through the measurement their volume change. The Advanced Spaceborne Thermal Emission and Reflection Radiometer (ASTER) system on-board the Terra (EOS AM-1) satellite has been a unique source of systematic stereoscopic images covering the whole globe at 15m resolution and at a consistent quality for over 15 years. While satellite stereo sensors with significantly improved radiometric and spatial resolution are available today, the potential of ASTER data lies in its long consistent time series that is unrivaled, though not fully exploited for change analysis due to lack of data accuracy and precision. ASTER data are strongly affected by attitude jitter, mainly of approximately 4 and 30 km wavelength, and improving the generation of ASTER DEMs requires removal of this effect. We developed MMASTER, an improved method for ASTER DEM generation and implemented it in the open source photogrammetric library and software suite MicMac. The method relies on the computation of a rational polynomial coefficients (RPC) model and the detection and correction of cross-track sensor jitter in order to compute DEMs. Our sensor modeling does not require ground control points and thus potentially allows for automatic processing of large data volumes. When compared to ground truth data, we have assessed a ±5m accuracy in DEM differencing when using our processing method, improved from the ±30m when using the AST14DMO DEM product. We demonstrate and discuss this improved ASTER DEM quality for a number of glaciers in Greenland (See figure attached), Alaska, and Svalbard. The quality of our measurements promises to further unlock the underused potential of ASTER DEMs for glacier volume change time series on a global scale. The data produced by our method will thus help to better understand the response of glaciers to climate change and their influence on runoff and sea level.

Polynomial hybrid Monte Carlo algorithm for lattice QCD with an odd number of flavors

International Nuclear Information System (INIS)

Aoki, S.; Burkhalter, R.; Ishikawa, K-I.; Tominaga, S.; Fukugita, M.; Hashimoto, S.; Kaneko, T.; Kuramashi, Y.; Okawa, M.; Tsutsui, N.; Yamada, N.; Ishizuka, N.; Iwasaki, Y.; Kanaya, K.; Ukawa, A.; Yoshie, T.; Onogi, T.

2002-01-01

We present a polynomial hybrid Monte Carlo (PHMC) algorithm for lattice QCD with odd numbers of flavors of O(a)-improved Wilson quark action. The algorithm makes use of the non-Hermitian Chebyshev polynomial to approximate the inverse square root of the fermion matrix required for an odd number of flavors. The systematic error from the polynomial approximation is removed by a noisy Metropolis test for which a new method is developed. Investigating the property of our PHMC algorithm in the N f =2 QCD case, we find that it is as efficient as the conventional HMC algorithm for a moderately large lattice size (16 3 x48) with intermediate quark masses (m PS /m V ∼0.7-0.8). We test our odd-flavor algorithm through extensive simulations of two-flavor QCD treated as an N f =1+1 system, and comparing the results with those of the established algorithms for N f =2 QCD. These tests establish that our PHMC algorithm works on a moderately large lattice size with intermediate quark masses (16 3 x48,m PS /m V ∼0.7-0.8). Finally we experiment with the (2+1)-flavor QCD simulation on small lattices (4 3 x8 and 8 3 x16), and confirm the agreement of our results with those obtained with the R algorithm and extrapolated to a zero molecular dynamics step size

Non-standard finite difference and Chebyshev collocation methods for solving fractional diffusion equation

Science.gov (United States)

Agarwal, P.; El-Sayed, A. A.

2018-06-01

In this paper, a new numerical technique for solving the fractional order diffusion equation is introduced. This technique basically depends on the Non-Standard finite difference method (NSFD) and Chebyshev collocation method, where the fractional derivatives are described in terms of the Caputo sense. The Chebyshev collocation method with the (NSFD) method is used to convert the problem into a system of algebraic equations. These equations solved numerically using Newton's iteration method. The applicability, reliability, and efficiency of the presented technique are demonstrated through some given numerical examples.

The Fundamental Blossoming Inequality in Chebyshev Spaces—I: Applications to Schur Functions

KAUST Repository

Ait-Haddou, Rachid

2016-10-19

A classical theorem by Chebyshev says how to obtain the minimum and maximum values of a symmetric multiaffine function of n variables with a prescribed sum. We show that, given two functions in an Extended Chebyshev space good for design, a similar result can be stated for the minimum and maximum values of the blossom of the first function with a prescribed value for the blossom of the second one. We give a simple geometric condition on the control polygon of the planar parametric curve defined by the pair of functions ensuring the uniqueness of the solution to the corresponding optimization problem. This provides us with a fundamental blossoming inequality associated with each Extended Chebyshev space good for design. This inequality proves to be a very powerful tool to derive many classical or new interesting inequalities. For instance, applied to Müntz spaces and to rational Müntz spaces, it provides us with new inequalities involving Schur functions which generalize the classical MacLaurin’s and Newton’s inequalities. This work definitely demonstrates that, via blossoms, CAGD techniques can have important implications in other mathematical domains, e.g., combinatorics.

Application of Rational Second Kind Chebyshev Functions for System of Integrodifferential Equations on Semi-Infinite Intervals

Directory of Open Access Journals (Sweden)

M. Tavassoli Kajani

2012-01-01

Full Text Available Rational Chebyshev bases and Galerkin method are used to obtain the approximate solution of a system of high-order integro-differential equations on the interval [0,∞. This method is based on replacement of the unknown functions by their truncated series of rational Chebyshev expansion. Test examples are considered to show the high accuracy, simplicity, and efficiency of this method.

Urban DEM generation, analysis and enhancements using TanDEM-X

Science.gov (United States)

Rossi, Cristian; Gernhardt, Stefan

2013-11-01

This paper analyzes the potential of the TanDEM-X mission for the generation of urban Digital Elevation Models (DEMs). The high resolution of the sensors and the absence of temporal decorrelation are exploited. The interferometric chain and the problems encountered for correct mapping of urban areas are analyzed first. The operational Integrated TanDEM-X Processor (ITP) algorithms are taken as reference. The ITP main product is called the raw DEM. Whereas the ITP coregistration stage is demonstrated to be robust enough, large improvements in the raw DEM such as fewer percentages of phase unwrapping errors, can be obtained by using adaptive fringe filters instead of the conventional ones in the interferogram generation stage. The shape of the raw DEM in the layover area is also shown and determined to be regular for buildings with vertical walls. Generally, in the presence of layover, the raw DEM exhibits a height ramp, resulting in a height underestimation for the affected structure. Examples provided confirm the theoretical background. The focus is centered on high resolution DEMs produced using spotlight acquisitions. In particular, a raw DEM over Berlin (Germany) with a 2.5 m raster is generated and validated. For this purpose, ITP is modified in its interferogram generation stage by adopting the Intensity Driven Adaptive Neighbourhood (IDAN) algorithm. The height Root Mean Square Error (RMSE) between the raw DEM and a reference is about 8 m for the two classes defining the urban DEM: structures and non-structures. The result can be further improved for the structure class using a DEM generated with Persistent Scatterer Interferometry. A DEM fusion is thus proposed and a drop of about 20% in the RMSE is reported.

Glacier Volume Change Estimation Using Time Series of Improved Aster Dems

Science.gov (United States)

Girod, Luc; Nuth, Christopher; Kääb, Andreas

2016-06-01

Volume change data is critical to the understanding of glacier response to climate change. The Advanced Spaceborne Thermal Emission and Reflection Radiometer (ASTER) system embarked on the Terra (EOS AM-1) satellite has been a unique source of systematic stereoscopic images covering the whole globe at 15m resolution and at a consistent quality for over 15 years. While satellite stereo sensors with significantly improved radiometric and spatial resolution are available to date, the potential of ASTER data lies in its long consistent time series that is unrivaled, though not fully exploited for change analysis due to lack of data accuracy and precision. Here, we developed an improved method for ASTER DEM generation and implemented it in the open source photogrammetric library and software suite MicMac. The method relies on the computation of a rational polynomial coefficients (RPC) model and the detection and correction of cross-track sensor jitter in order to compute DEMs. ASTER data are strongly affected by attitude jitter, mainly of approximately 4 km and 30 km wavelength, and improving the generation of ASTER DEMs requires removal of this effect. Our sensor modeling does not require ground control points and allows thus potentially for the automatic processing of large data volumes. As a proof of concept, we chose a set of glaciers with reference DEMs available to assess the quality of our measurements. We use time series of ASTER scenes from which we extracted DEMs with a ground sampling distance of 15m. Our method directly measures and accounts for the cross-track component of jitter so that the resulting DEMs are not contaminated by this process. Since the along-track component of jitter has the same direction as the stereo parallaxes, the two cannot be separated and the elevations extracted are thus contaminated by along-track jitter. Initial tests reveal no clear relation between the cross-track and along-track components so that the latter seems not to be

Algorithm for Compressing Time-Series Data

Science.gov (United States)

Hawkins, S. Edward, III; Darlington, Edward Hugo

2012-01-01

An algorithm based on Chebyshev polynomials effects lossy compression of time-series data or other one-dimensional data streams (e.g., spectral data) that are arranged in blocks for sequential transmission. The algorithm was developed for use in transmitting data from spacecraft scientific instruments to Earth stations. In spite of its lossy nature, the algorithm preserves the information needed for scientific analysis. The algorithm is computationally simple, yet compresses data streams by factors much greater than two. The algorithm is not restricted to spacecraft or scientific uses: it is applicable to time-series data in general. The algorithm can also be applied to general multidimensional data that have been converted to time-series data, a typical example being image data acquired by raster scanning. However, unlike most prior image-data-compression algorithms, this algorithm neither depends on nor exploits the two-dimensional spatial correlations that are generally present in images. In order to understand the essence of this compression algorithm, it is necessary to understand that the net effect of this algorithm and the associated decompression algorithm is to approximate the original stream of data as a sequence of finite series of Chebyshev polynomials. For the purpose of this algorithm, a block of data or interval of time for which a Chebyshev polynomial series is fitted to the original data is denoted a fitting interval. Chebyshev approximation has two properties that make it particularly effective for compressing serial data streams with minimal loss of scientific information: The errors associated with a Chebyshev approximation are nearly uniformly distributed over the fitting interval (this is known in the art as the "equal error property"); and the maximum deviations of the fitted Chebyshev polynomial from the original data have the smallest possible values (this is known in the art as the "min-max property").

CHEBYSHEV ACCELERATION TECHNIQUE FOR SOLVING FUZZY LINEAR SYSTEM

Directory of Open Access Journals (Sweden)

S.H. Nasseri

2011-07-01

Full Text Available In this paper, Chebyshev acceleration technique is used to solve the fuzzy linear system (FLS. This method is discussed in details and followed by summary of some other acceleration techniques. Moreover, we show that in some situations that the methods such as Jacobi, Gauss-Sidel, SOR and conjugate gradient is divergent, our proposed method is applicable and the acquired results are illustrated by some numerical examples.

CHEBYSHEV ACCELERATION TECHNIQUE FOR SOLVING FUZZY LINEAR SYSTEM

Directory of Open Access Journals (Sweden)

S.H. Nasseri

2009-10-01

Full Text Available In this paper, Chebyshev acceleration technique is used to solve the fuzzy linear system (FLS. This method is discussed in details and followed by summary of some other acceleration techniques. Moreover, we show that in some situations that the methods such as Jacobi, Gauss-Sidel, SOR and conjugate gradient is divergent, our proposed method is applicable and the acquired results are illustrated by some numerical examples.

Hybrid Lanczos-type product methods

Energy Technology Data Exchange (ETDEWEB)

Ressel, K.J. [Swiss Center for Scientific Computing, Zuerich (Switzerland)

1996-12-31

A general framework is proposed to construct hybrid iterative methods for the solution of large nonsymmetric systems of linear equations. This framework is based on Lanczos-type product methods, whose iteration polynomial consists of the Lanczos polynomial multiplied by some other arbitrary, {open_quotes}shadow{close_quotes} polynomial. By using for the shadow polynomial Chebyshev (more general Faber) polynomials or L{sup 2}-optimal polynomials, hybrid (Chebyshev-like) methods are incorporated into Lanczos-type product methods. In addition, to acquire spectral information on the system matrix, which is required for such a choice of shadow polynomials, the Lanczos-process can be employed either directly or in an QMR-like approach. The QMR like approach allows the cheap computation of the roots of the B-orthogonal polynomials and the residual polynomials associated with the QMR iteration. These roots can be used as a good approximation for the spectrum of the system matrix. Different choices for the shadow polynomials and their construction are analyzed. The resulting hybrid methods are compared with standard Lanczos-type product methods, like BiOStab, BiOStab({ell}) and BiOS.

GLACIER VOLUME CHANGE ESTIMATION USING TIME SERIES OF IMPROVED ASTER DEMS

Directory of Open Access Journals (Sweden)

L. Girod

2016-06-01

Full Text Available Volume change data is critical to the understanding of glacier response to climate change. The Advanced Spaceborne Thermal Emission and Reflection Radiometer (ASTER system embarked on the Terra (EOS AM-1 satellite has been a unique source of systematic stereoscopic images covering the whole globe at 15m resolution and at a consistent quality for over 15 years. While satellite stereo sensors with significantly improved radiometric and spatial resolution are available to date, the potential of ASTER data lies in its long consistent time series that is unrivaled, though not fully exploited for change analysis due to lack of data accuracy and precision. Here, we developed an improved method for ASTER DEM generation and implemented it in the open source photogrammetric library and software suite MicMac. The method relies on the computation of a rational polynomial coefficients (RPC model and the detection and correction of cross-track sensor jitter in order to compute DEMs. ASTER data are strongly affected by attitude jitter, mainly of approximately 4 km and 30 km wavelength, and improving the generation of ASTER DEMs requires removal of this effect. Our sensor modeling does not require ground control points and allows thus potentially for the automatic processing of large data volumes. As a proof of concept, we chose a set of glaciers with reference DEMs available to assess the quality of our measurements. We use time series of ASTER scenes from which we extracted DEMs with a ground sampling distance of 15m. Our method directly measures and accounts for the cross-track component of jitter so that the resulting DEMs are not contaminated by this process. Since the along-track component of jitter has the same direction as the stereo parallaxes, the two cannot be separated and the elevations extracted are thus contaminated by along-track jitter. Initial tests reveal no clear relation between the cross-track and along-track components so that the latter

On Closed Form Calculation of Line Spectral Frequencies (LSF)

DEFF Research Database (Denmark)

Dalsgaard, Paul; Andersen, Ove

2014-01-01

of characteristic polynomial zeros. The theoretical analysis is based on decomposition of sequences into symmetric and anti-symmetric polynomials defined as a series expansion of reduced Chebyshev polynomials of the first kind. Two variants of closed form functions are presented — each characterised by using...

Afrika Statistika ISSN 2316-090X Jump Resonance in Wind-Felled ...

African Journals Online (AJOL)

jump function. Duffing's model, describing function and Chebyshev polynomials were used .... this study to develop polynomial growth equation for plantains and plantain jump resonance ..... New technologies to increase root health and crop.

Fast conjugate phase image reconstruction based on a Chebyshev approximation to correct for B0 field inhomogeneity and concomitant gradients.

Science.gov (United States)

Chen, Weitian; Sica, Christopher T; Meyer, Craig H

2008-11-01

Off-resonance effects can cause image blurring in spiral scanning and various forms of image degradation in other MRI methods. Off-resonance effects can be caused by both B0 inhomogeneity and concomitant gradient fields. Previously developed off-resonance correction methods focus on the correction of a single source of off-resonance. This work introduces a computationally efficient method of correcting for B0 inhomogeneity and concomitant gradients simultaneously. The method is a fast alternative to conjugate phase reconstruction, with the off-resonance phase term approximated by Chebyshev polynomials. The proposed algorithm is well suited for semiautomatic off-resonance correction, which works well even with an inaccurate or low-resolution field map. The proposed algorithm is demonstrated using phantom and in vivo data sets acquired by spiral scanning. Semiautomatic off-resonance correction alone is shown to provide a moderate amount of correction for concomitant gradient field effects, in addition to B0 imhomogeneity effects. However, better correction is provided by the proposed combined method. The best results were produced using the semiautomatic version of the proposed combined method.

Application of Chebyshev Formalism to Identify Nonlinear Magnetic Field Components in Beam Transport Systems

Energy Technology Data Exchange (ETDEWEB)

Spata, Michael [Old Dominion Univ., Norfolk, VA (United States)

2012-08-01

An experiment was conducted at Jefferson Lab's Continuous Electron Beam Accelerator Facility to develop a beam-based technique for characterizing the extent of the nonlinearity of the magnetic fields of a beam transport system. Horizontally and vertically oriented pairs of air-core kicker magnets were simultaneously driven at two different frequencies to provide a time-dependent transverse modulation of the beam orbit relative to the unperturbed reference orbit. Fourier decomposition of the position data at eight different points along the beamline was then used to measure the amplitude of these frequencies. For a purely linear transport system one expects to find solely the frequencies that were applied to the kickers with amplitudes that depend on the phase advance of the lattice. In the presence of nonlinear fields one expects to also find harmonics of the driving frequencies that depend on the order of the nonlinearity. Chebyshev polynomials and their unique properties allow one to directly quantify the magnitude of the nonlinearity with the minimum error. A calibration standard was developed using one of the sextupole magnets in a CEBAF beamline. The technique was then applied to a pair of Arc 1 dipoles and then to the magnets in the Transport Recombiner beamline to measure their multipole content as a function of transverse position within the magnets.

Orthogonal polynomials

CERN Document Server

Freud, Géza

1971-01-01

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

Efficient Galerkin solution of stochastic fractional differential equations using second kind Chebyshev wavelets

Directory of Open Access Journals (Sweden)

Fakhrodin Mohammadi

2017-10-01

Full Text Available ‎Stochastic fractional differential equations (SFDEs have been used for modeling many physical problems in the fields of turbulance‎, ‎heterogeneous‎, ‎flows and matrials‎, ‎viscoelasticity and electromagnetic theory‎. ‎In this paper‎, ‎an‎ efficient wavelet Galerkin method based on the second kind Chebyshev wavelets are proposed for approximate solution of SFDEs‎. ‎In ‎this ‎app‎roach‎‎, ‎o‎perational matrices of the second kind Chebyshev wavelets ‎are used ‎for reducing SFDEs to a linear system of algebraic equations that can be solved easily‎. ‎C‎onvergence and error analysis of the proposed method is ‎considered‎.‎ ‎Some numerical examples are performed to confirm the applicability and efficiency of the proposed method‎.

An automated, open-source pipeline for mass production of digital elevation models (DEMs) from very-high-resolution commercial stereo satellite imagery

Science.gov (United States)

Shean, David E.; Alexandrov, Oleg; Moratto, Zachary M.; Smith, Benjamin E.; Joughin, Ian R.; Porter, Claire; Morin, Paul

2016-06-01

We adapted the automated, open source NASA Ames Stereo Pipeline (ASP) to generate digital elevation models (DEMs) and orthoimages from very-high-resolution (VHR) commercial imagery of the Earth. These modifications include support for rigorous and rational polynomial coefficient (RPC) sensor models, sensor geometry correction, bundle adjustment, point cloud co-registration, and significant improvements to the ASP code base. We outline a processing workflow for ˜0.5 m ground sample distance (GSD) DigitalGlobe WorldView-1 and WorldView-2 along-track stereo image data, with an overview of ASP capabilities, an evaluation of ASP correlator options, benchmark test results, and two case studies of DEM accuracy. Output DEM products are posted at ˜2 m with direct geolocation accuracy of process individual stereo pairs on a local workstation, the methods presented here were developed for large-scale batch processing in a high-performance computing environment. We are leveraging these resources to produce dense time series and regional mosaics for the Earth's polar regions.

Simulation of electrically driven jet using Chebyshev collocation method

Institute of Scientific and Technical Information of China (English)

无

2011-01-01

The model of electrically driven jet is governed by a series of quasi 1D dimensionless partial differential equations(PDEs).Following the method of lines,the Chebyshev collocation method is employed to discretize the PDEs and obtain a system of differential-algebraic equations(DAEs).By differentiating constrains in DAEs twice,the system is transformed into a set of ordinary differential equations(ODEs) with invariants.Then the implicit differential equations solver "ddaskr" is used to solve the ODEs and ...

Rational Chebyshev spectral transform for the dynamics of broad-area laser diodes

International Nuclear Information System (INIS)

Javaloyes, J.; Balle, S.

2015-01-01

This manuscript details the use of the rational Chebyshev transform for describing the transverse dynamics of broad-area laser diodes and amplifiers. This spectral method can be used in combination with the delay algebraic equations approach developed in [1], which substantially reduces the computation time. The theory is presented in such a way that it encompasses the case of the Fourier spectral transform presented in [2] as a particular case. It is also extended to the consideration of index guiding with an arbitrary transverse profile. Because their domain of definition is infinite, the convergence properties of the Chebyshev rational functions allow handling the boundary conditions with higher accuracy than with the previously studied Fourier transform method. As practical examples, we solve the beam propagation problem with and without index guiding: we obtain excellent results and an improvement of the integration time between one and two orders of magnitude as compared with a fully distributed two dimensional model

Rigorous Integration of Non-Linear Ordinary Differential Equations in Chebyshev Basis

Czech Academy of Sciences Publication Activity Database

Dzetkulič, Tomáš

2015-01-01

Roč. 69, č. 1 (2015), s. 183-205 ISSN 1017-1398 R&D Projects: GA MŠk OC10048; GA ČR GD201/09/H057 Institutional research plan: CEZ:AV0Z10300504 Keywords : Initial value problem * Rigorous integration * Taylor model * Chebyshev basis Subject RIV: IN - Informatics, Computer Science Impact factor: 1.366, year: 2015

Experimental dem Extraction from Aster Stereo Pairs and 3d Registration Based on Icesat Laser Altimetry Data in Upstream Area of Lambert Glacier, Antarctica

Science.gov (United States)

Hai, G.; Xie, H.; Chen, J.; Chen, L.; Li, R.; Tong, X.

2017-09-01

DEM Extraction from ASTER stereo pairs and three-dimensional registration by reference to ICESat laser altimetry data are carried out in upstream area of Lambert Glacier, East Antarctica. Since the study area is located in inland of East Antarctica where few textures exist, registration between DEM and ICESat data is performed. Firstly, the ASTER DEM generation is based on rational function model (RFM) and the procedure includes: a) rational polynomial coefficient (RPC) computation from ASTER metadata, b) L1A image product de-noise and destriping, c) local histogram equalization and matching, d) artificial collection of tie points and bundle adjustment, and e) coarse-to-fine hierarchical matching of five levels and grid matching. The matching results are filtered semi-automatically. Hereafter, DEM is interpolated using spline method with ground points converted from matching points. Secondly, the generated ASTER DEM is registered to ICESat data in three-dimensional space after Least-squares rigid transformation using singular value decomposition (SVD). The process is stated as: a) correspondence selection of terrain feature points from ICESat and DEM profiles, b) rigid transformation of generated ASTER DEM using selected feature correspondences based on least squares technique. The registration shows a good result that the elevation difference between DEM and ICESat data is low with a mean value less than 2 meters and the standard deviation around 7 meters. This DEM is generated and specially registered in Antarctic typical region without obvious ground rock control points and serves as true terrain input for further radar altimetry simulation.

Solutions of several coupled discrete models in terms of Lamé ...

Indian Academy of Sciences (India)

The models discussed are: coupled Salerno model,; coupled Ablowitz–Ladik model,; coupled 4 model and; coupled 6 model. In all these cases we show that the coefficients of the Lamé polynomials are such that the Lamé polynomials can be re-expressed in terms of Chebyshev polynomials of the relevant Jacobi elliptic ...

Pseudospectral methods on a semi-infinite interval with application to the hydrogen atom: a comparison of the mapped Fourier-sine method with Laguerre series and rational Chebyshev expansions

International Nuclear Information System (INIS)

Boyd, John P.; Rangan, C.; Bucksbaum, P.H.

2003-01-01

The Fourier-sine-with-mapping pseudospectral algorithm of Fattal et al. [Phys. Rev. E 53 (1996) 1217] has been applied in several quantum physics problems. Here, we compare it with pseudospectral methods using Laguerre functions and rational Chebyshev functions. We show that Laguerre and Chebyshev expansions are better suited for solving problems in the interval r in R set of [0,∞] (for example, the Coulomb-Schroedinger equation), than the Fourier-sine-mapping scheme. All three methods give similar accuracy for the hydrogen atom when the scaling parameter L is optimum, but the Laguerre and Chebyshev methods are less sensitive to variations in L. We introduce a new variant of rational Chebyshev functions which has a more uniform spacing of grid points for large r, and gives somewhat better results than the rational Chebyshev functions of Boyd [J. Comp. Phys. 70 (1987) 63

Dynamics of a new family of iterative processes for quadratic polynomials

Science.gov (United States)

Gutiérrez, J. M.; Hernández, M. A.; Romero, N.

2010-03-01

In this work we show the presence of the well-known Catalan numbers in the study of the convergence and the dynamical behavior of a family of iterative methods for solving nonlinear equations. In fact, we introduce a family of methods, depending on a parameter . These methods reach the order of convergence m+2 when they are applied to quadratic polynomials with different roots. Newton's and Chebyshev's methods appear as particular choices of the family appear for m=0 and m=1, respectively. We make both analytical and graphical studies of these methods, which give rise to rational functions defined in the extended complex plane. Firstly, we prove that the coefficients of the aforementioned family of iterative processes can be written in terms of the Catalan numbers. Secondly, we make an incursion into its dynamical behavior. In fact, we show that the rational maps related to these methods can be written in terms of the entries of the Catalan triangle. Next we analyze its general convergence, by including some computer plots showing the intricate structure of the Universal Julia sets associated with the methods.

SOLUTION OF A MULTIVARIATE STRATIFIED SAMPLING PROBLEM THROUGH CHEBYSHEV GOAL PROGRAMMING

Directory of Open Access Journals (Sweden)

Mohd. Vaseem Ismail

2010-12-01

Full Text Available In this paper, we consider the problem of minimizing the variances for the various characters with fixed (given budget. Each convex objective function is first linearised at its minimal point where it meets the linear cost constraint. The resulting multiobjective linear programming problem is then solved by Chebyshev goal programming. A numerical example is given to illustrate the procedure.

Statistical Average of Spin Operators for Calculation of Three-Component Magnetization (II): Solution of Equation

International Nuclear Information System (INIS)

Wang Huaiyu; Long Yao; Chen Nanxian

2006-01-01

In this paper, the solution of Chebyshev equation with its argument being greater than 1 is obtained. The initial value of the derivative of the solution is the expression of magnetization, which is valid for any spin quantum number S. The Chebyshev equation is transformed from an ordinary differential equation obtained when we dealt with Heisenberg model, in order to calculate all three components of magnetization, by many-body Green's function under random phase approximation. The Chebyshev functions with argument being greater than 1 are discussed. This paper shows that the Chebyshev polynomials with their argument being greater than 1 have their physical application.

Irreducible multivariate polynomials obtained from polynomials in ...

Indian Academy of Sciences (India)

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

Wind Turbine Driving a PM Synchronous Generator Using Novel Recurrent Chebyshev Neural Network Control with the Ideal Learning Rate

Directory of Open Access Journals (Sweden)

Chih-Hong Lin

2016-06-01

Full Text Available A permanent magnet (PM synchronous generator system driven by wind turbine (WT, connected with smart grid via AC-DC converter and DC-AC converter, are controlled by the novel recurrent Chebyshev neural network (NN and amended particle swarm optimization (PSO to regulate output power and output voltage in two power converters in this study. Because a PM synchronous generator system driven by WT is an unknown non-linear and time-varying dynamic system, the on-line training novel recurrent Chebyshev NN control system is developed to regulate DC voltage of the AC-DC converter and AC voltage of the DC-AC converter connected with smart grid. Furthermore, the variable learning rate of the novel recurrent Chebyshev NN is regulated according to discrete-type Lyapunov function for improving the control performance and enhancing convergent speed. Finally, some experimental results are shown to verify the effectiveness of the proposed control method for a WT driving a PM synchronous generator system in smart grid.

Branched polynomial covering maps

DEFF Research Database (Denmark)

Hansen, Vagn Lundsgaard

2002-01-01

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

New template family for the detection of gravitational waves from comparable-mass black hole binaries

International Nuclear Information System (INIS)

Porter, Edward K.

2007-01-01

In order to improve the phasing of the comparable-mass waveform as we approach the last stable orbit for a system, various resummation methods have been used to improve the standard post-Newtonian waveforms. In this work we present a new family of templates for the detection of gravitational waves from the inspiral of two comparable-mass black hole binaries. These new adiabatic templates are based on reexpressing the derivative of the binding energy and the gravitational wave flux functions in terms of shifted Chebyshev polynomials. The Chebyshev polynomials are a useful tool in numerical methods as they display the fastest convergence of any of the orthogonal polynomials. In this case they are also particularly useful as they eliminate one of the features that plagues the post-Newtonian expansion. The Chebyshev binding energy now has information at all post-Newtonian orders, compared to the post-Newtonian templates which only have information at full integer orders. In this work, we compare both the post-Newtonian and Chebyshev templates against a fiducially exact waveform. This waveform is constructed from a hybrid method of using the test-mass results combined with the mass dependent parts of the post-Newtonian expansions for the binding energy and flux functions. Our results show that the Chebyshev templates achieve extremely high fitting factors at all post-Newtonian orders and provide excellent parameter extraction. We also show that this new template family has a faster Cauchy convergence, gives a better prediction of the position of the last stable orbit and in general recovers higher Signal-to-Noise ratios than the post-Newtonian templates

Chebyshev super spectral viscosity method for a fluidized bed model

International Nuclear Information System (INIS)

Sarra, Scott A.

2003-01-01

A Chebyshev super spectral viscosity method and operator splitting are used to solve a hyperbolic system of conservation laws with a source term modeling a fluidized bed. The fluidized bed displays a slugging behavior which corresponds to shocks in the solution. A modified Gegenbauer postprocessing procedure is used to obtain a solution which is free of oscillations caused by the Gibbs-Wilbraham phenomenon in the spectral viscosity solution. Conservation is maintained by working with unphysical negative particle concentrations

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

Science.gov (United States)

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

2018-07-01

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

Stability analysis of polynomial fuzzy models via polynomial fuzzy Lyapunov functions

OpenAIRE

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

2011-01-01

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

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

Directory of Open Access Journals (Sweden)

M. A. Pathan

2015-05-01

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

Operation analysis of a Chebyshev-Pantograph leg mechanism for a single DOF biped robot

Science.gov (United States)

Liang, Conghui; Ceccarelli, Marco; Takeda, Yukio

2012-12-01

In this paper, operation analysis of a Chebyshev-Pantograph leg mechanism is presented for a single degree of freedom (DOF) biped robot. The proposed leg mechanism is composed of a Chebyshev four-bar linkage and a pantograph mechanism. In contrast to general fully actuated anthropomorphic leg mechanisms, the proposed leg mechanism has peculiar features like compactness, low-cost, and easy-operation. Kinematic equations of the proposed leg mechanism are formulated for a computer oriented simulation. Simulation results show the operation performance of the proposed leg mechanism with suitable characteristics. A parametric study has been carried out to evaluate the operation performance as function of design parameters. A prototype of a single DOF biped robot equipped with two proposed leg mechanisms has been built at LARM (Laboratory of Robotics and Mechatronics). Experimental test shows practical feasible walking ability of the prototype, as well as drawbacks are discussed for the mechanical design.

Branched polynomial covering maps

DEFF Research Database (Denmark)

Hansen, Vagn Lundsgaard

1999-01-01

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

Coastal DEMs with Cross-Track Interferometry

NARCIS (Netherlands)

Greidanus, H.S.F.; Huising, E.J.; Platschorre, Y.; Bree, R.J.P. van; Halsema, D. van; Vaessen, E.M.J.

1999-01-01

Digital elevation models (DEMs) are produced from airborne radar cross-track interferometric measurements. Radar DEMs recorded from perpendicular orientations are intercompared, and compared to DEMs derived from airborne laser altimetry

Eine Analyse des Zusammenhangs zwischen dem Konsum von Alkopops und dem Problemverhalten von Jugendlichen

OpenAIRE

Metzner, Cornelia Beate Isabel

2007-01-01

Zielsetzung: In dieser Arbeit wird untersucht, ob bei Jugendlichen ein Zusammenhang zwischen dem Konsum von Alkopops einerseits und dem sonstigen Alkoholtrinkverhalten, dem Konsum von Zigaretten und illegalen Drogen sowie weiteren Risikoverhaltensweisen andererseits besteht, ferner ob sich Unterschiede im Verhalten von Jungen und Mädchen ergeben. Theoretischer und empirischer Hintergrund: �Alkopops�, d. h. Mischgetränke diverser Hersteller aus Likör bzw. Schnaps und Limonade sowie wein- ...

ArcticDEM Validation and Accuracy Assessment

Science.gov (United States)

Candela, S. G.; Howat, I.; Noh, M. J.; Porter, C. C.; Morin, P. J.

2017-12-01

ArcticDEM comprises a growing inventory Digital Elevation Models (DEMs) covering all land above 60°N. As of August, 2017, ArcticDEM had openly released 2-m resolution, individual DEM covering over 51 million km2, which includes areas of repeat coverage for change detection, as well as over 15 million km2 of 5-m resolution seamless mosaics. By the end of the project, over 80 million km2 of 2-m DEMs will be produced, averaging four repeats of the 20 million km2 Arctic landmass. ArcticDEM is produced from sub-meter resolution, stereoscopic imagery using open source software (SETSM) on the NCSA Blue Waters supercomputer. These DEMs have known biases of several meters due to errors in the sensor models generated from satellite positioning. These systematic errors are removed through three-dimensional registration to high-precision Lidar or other control datasets. ArcticDEM is registered to seasonally-subsetted ICESat elevations due its global coverage and high report accuracy ( 10 cm). The vertical accuracy of ArcticDEM is then obtained from the statistics of the fit to the ICESat point cloud, which averages -0.01 m ± 0.07 m. ICESat, however, has a relatively coarse measurement footprint ( 70 m) which may impact the precision of the registration. Further, the ICESat data predates the ArcticDEM imagery by a decade, so that temporal changes in the surface may also impact the registration. Finally, biases may exist between different the different sensors in the ArcticDEM constellation. Here we assess the accuracy of ArcticDEM and the ICESat registration through comparison to multiple high-resolution airborne lidar datasets that were acquired within one year of the imagery used in ArcticDEM. We find the ICESat dataset is performing as anticipated, introducing no systematic bias during the coregistration process, and reducing vertical errors to within the uncertainty of the airborne Lidars. Preliminary sensor comparisons show no significant difference post coregistration

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

Science.gov (United States)

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

2017-12-01

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

On generalized Fibonacci and Lucas polynomials

Energy Technology Data Exchange (ETDEWEB)

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

2009-12-15

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

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

Science.gov (United States)

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

2018-02-01

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

Better polynomials for GNFS

OpenAIRE

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

2016-01-01

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

Nonnegativity of uncertain polynomials

Directory of Open Access Journals (Sweden)

Šiljak Dragoslav D.

1998-01-01

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

Numerical solution of matrix exponential in burn-up equation using mini-max polynomial approximation

International Nuclear Information System (INIS)

Kawamoto, Yosuke; Chiba, Go; Tsuji, Masashi; Narabayashi, Tadashi

2015-01-01

Highlights: • We propose a new numerical solution of matrix exponential in burn-up depletion calculations. • The depletion calculation with extremely short half-lived nuclides can be done numerically stable with this method. • The computational time is shorter than the other conventional methods. - Abstract: Nuclear fuel burn-up depletion calculations are essential to compute the nuclear fuel composition transition. In the burn-up calculations, the matrix exponential method has been widely used. In the present paper, we propose a new numerical solution of the matrix exponential, a Mini-Max Polynomial Approximation (MMPA) method. This method is numerically stable for burn-up matrices with extremely short half-lived nuclides as the Chebyshev Rational Approximation Method (CRAM), and it has several advantages over CRAM. We also propose a multi-step calculation, a computational time reduction scheme of the MMPA method, which can perform simultaneously burn-up calculations with several time periods. The applicability of these methods has been theoretically and numerically proved for general burn-up matrices. The numerical verification has been performed, and it has been shown that these methods have high precision equivalent to CRAM

Landbrugets trædemølle

DEFF Research Database (Denmark)

Hansen, Henning Otte

2016-01-01

Teorien om landbrugets trædemølle siger, at teknologi medfører stigende produktivitet, stigende udbud og dermed faldende priser. Dermed øges behovet for ny teknologi. Det vedvarende teknologipres gavner de innovative landmænd, mens de mere afventende landmænd kun oplever de negative virkninger i...... form af prisfald. I denne artikel beskrives nærmere de enkelte elementer i trædemøllen. Samtidig vurderes trædemøllens betydning og mulige påvirkning. Det konkluderes, at trædemøllen, dens forudsætninger og afledte virkninger stadig er fuldt gældende. Det er ikke muligt for et enkelt land eller region...... af bremse trædemøllen på lang sigt. På lokalt plan kan man løse nogle sociale og økonomiske problemer skabt af trædemøllen gennem nemmere afvandring....

On Multiple Polynomials of Capelli Type

Directory of Open Access Journals (Sweden)

S.Y. Antonov

2016-03-01

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

Chromatic polynomials for simplicial complexes

DEFF Research Database (Denmark)

Møller, Jesper Michael; Nord, Gesche

2016-01-01

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

Roots of the Chromatic Polynomial

DEFF Research Database (Denmark)

Perrett, Thomas

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

General Reducibility and Solvability of Polynomial Equations ...

African Journals Online (AJOL)

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

Improvements to the Chebyshev expansion of attenuation correction factors for cylindrical samples

International Nuclear Information System (INIS)

Mildner, D.F.R.; Carpenter, J.M.

1990-01-01

The accuracy of the Chebyshev expansion coefficients used for the calculation of attenuation correction factors for cylinderical samples has been improved. An increased order of expansion allows the method to be useful over a greater range of attenuation. It is shown that many of these coefficients are exactly zero, others are rational numbers, and others are rational frations of π -1 . The assumptions of Sears in his asymptotic expression of the attenuation correction factor are also examined. (orig.)

Certain non-linear differential polynomials sharing a non zero polynomial

Directory of Open Access Journals (Sweden)

Majumder Sujoy

2015-10-01

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

Efficient Computation of Sparse Matrix Functions for Large-Scale Electronic Structure Calculations: The CheSS Library.

Science.gov (United States)

Mohr, Stephan; Dawson, William; Wagner, Michael; Caliste, Damien; Nakajima, Takahito; Genovese, Luigi

2017-10-10

We present CheSS, the "Chebyshev Sparse Solvers" library, which has been designed to solve typical problems arising in large-scale electronic structure calculations using localized basis sets. The library is based on a flexible and efficient expansion in terms of Chebyshev polynomials and presently features the calculation of the density matrix, the calculation of matrix powers for arbitrary powers, and the extraction of eigenvalues in a selected interval. CheSS is able to exploit the sparsity of the matrices and scales linearly with respect to the number of nonzero entries, making it well-suited for large-scale calculations. The approach is particularly adapted for setups leading to small spectral widths of the involved matrices and outperforms alternative methods in this regime. By coupling CheSS to the DFT code BigDFT, we show that such a favorable setup is indeed possible in practice. In addition, the approach based on Chebyshev polynomials can be massively parallelized, and CheSS exhibits excellent scaling up to thousands of cores even for relatively small matrix sizes.

Coastal Digital Elevation Models (DEMs)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — Digital elevation models (DEMs) of U.S. and other coasts that typically integrate ocean bathymetry and land topography. The DEMs support NOAA's mission to understand...

Definite Integrals using Orthogonality and Integral Transforms

Directory of Open Access Journals (Sweden)

Howard S. Cohl

2012-10-01

Full Text Available We obtain definite integrals for products of associated Legendre functions with Bessel functions, associated Legendre functions, and Chebyshev polynomials of the first kind using orthogonality and integral transforms.

Polynomial Heisenberg algebras

International Nuclear Information System (INIS)

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

2004-01-01

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

Polynomial optimization : Error analysis and applications

NARCIS (Netherlands)

Sun, Zhao

2015-01-01

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

A New Method to Estimate Changes in Glacier Surface Elevation Based on Polynomial Fitting of Sparse ICESat—GLAS Footprints

Directory of Open Access Journals (Sweden)

Tianjin Huang

2017-08-01

Full Text Available We present in this paper a polynomial fitting method applicable to segments of footprints measured by the Geoscience Laser Altimeter System (GLAS to estimate glacier thickness change. Our modification makes the method applicable to complex topography, such as a large mountain glacier. After a full analysis of the planar fitting method to characterize errors of estimates due to complex topography, we developed an improved fitting method by adjusting a binary polynomial surface to local topography. The improved method and the planar fitting method were tested on the accumulation areas of the Naimona’nyi glacier and Yanong glacier on along-track facets with lengths of 1000 m, 1500 m, 2000 m, and 2500 m, respectively. The results show that the improved method gives more reliable estimates of changes in elevation than planar fitting. The improved method was also tested on Guliya glacier with a large and relatively flat area and the Chasku Muba glacier with very complex topography. The results in these test sites demonstrate that the improved method can give estimates of glacier thickness change on glaciers with a large area and a complex topography. Additionally, the improved method based on GLAS Data and Shuttle Radar Topography Mission-Digital Elevation Model (SRTM-DEM can give estimates of glacier thickness change from 2000 to 2008/2009, since it takes the 2000 SRTM-DEM as a reference, which is a longer period than 2004 to 2008/2009, when using the GLAS data only and the planar fitting method.

Birth-death processes and associated polynomials

NARCIS (Netherlands)

van Doorn, Erik A.

2003-01-01

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

Extended biorthogonal matrix polynomials

Directory of Open Access Journals (Sweden)

Ayman Shehata

2017-01-01

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

UNCOUPLING LAMINAR CONJUGATE HEAT TRANSFER THROUGH CHEBYSHEV POLYNOMIAL

Directory of Open Access Journals (Sweden)

ANTONIO J. BULA

2010-01-01

verificados con la solución obtenida por medio de software CFD comercial, FIDAP ®. La solución ncluyo el cálculo del coeficiente de transferencia de calor, el número de Nusselt, el número de Biot, todos tanto local como promedio. La distribución de temperatura en la interface también fue obtenida.

Bannai-Ito polynomials and dressing chains

OpenAIRE

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

2012-01-01

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

A Chebyshev method for state-to-state reactive scattering using reactant-product decoupling: OH + H2 → H2O + H.

Science.gov (United States)

Cvitaš, Marko T; Althorpe, Stuart C

2013-08-14

We extend a recently developed wave packet method for computing the state-to-state quantum dynamics of AB + CD → ABC + D reactions [M. T. Cvitaš and S. C. Althorpe, J. Phys. Chem. A 113, 4557 (2009)] to include the Chebyshev propagator. The method uses the further partitioned approach to reactant-product decoupling, which uses artificial decoupling potentials to partition the coordinate space of the reaction into separate reactant, product, and transition-state regions. Separate coordinates and basis sets can then be used that are best adapted to each region. We derive improved Chebyshev partitioning formulas which include Mandelshtam-and-Taylor-type decoupling potentials, and which are essential for the non-unitary discrete variable representations that must be used in 4-atom reactive scattering calculations. Numerical tests on the fully dimensional OH + H2 → H2O + H reaction for J = 0 show that the new version of the method is as efficient as the previously developed split-operator version. The advantages of the Chebyshev propagator (most notably the ease of parallelization for J > 0) can now be fully exploited in state-to-state reactive scattering calculations on 4-atom reactions.

Special functions for scientists and engineers

CERN Document Server

Bell, William Wallace

1968-01-01

Clear and comprehensive, this text provides undergraduates with a straightforward guide to special functions. It is equally suitable as a reference volume for professionals, and readers need no higher level of mathematical knowledge beyond elementary calculus. Topics include the solution of second-order differential equations in terms of power series; gamma and beta functions; Legendre polynomials and functions; Bessel functions; Hermite, Laguerre, and Chebyshev polynomials; Gegenbauer and Jacobi polynomials; and hypergeometric and other special functions. Three appendices offer convenient t

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

International Nuclear Information System (INIS)

Demina, Maria V; Kudryashov, Nikolai A

2012-01-01

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

Afrika Statistika ISSN 2316-090X Jump Resonance in Wind-Felled ...

African Journals Online (AJOL)

Duffing's model, describing function and Chebyshev polynomials were used to obtain the .... (1988) showed that every real measure is uniquely decomposed into an atomic measure and a diffuse ... Experimental evidence has shown that jump ...

Generalizations of orthogonal polynomials

Science.gov (United States)

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

2005-07-01

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

Stochastic Estimation via Polynomial Chaos

Science.gov (United States)

2015-10-01

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

Small catchments DEM creation using Unmanned Aerial Vehicles

Science.gov (United States)

Gafurov, A. M.

2018-01-01

Digital elevation models (DEM) are an important source of information on the terrain, allowing researchers to evaluate various exogenous processes. The higher the accuracy of DEM the better the level of the work possible. An important source of data for the construction of DEMs are point clouds obtained with terrestrial laser scanning (TLS) and unmanned aerial vehicles (UAV). In this paper, we present the results of constructing a DEM on small catchments using UAVs. Estimation of the UAV DEM showed comparable accuracy with the TLS if real time kinematic Global Positioning System (RTK-GPS) ground control points (GCPs) and check points (CPs) were used. In this case, the main source of errors in the construction of DEMs are the errors in the referencing of survey results.

Implementing Families of Implicit Chebyshev Methods with Exact Coefficients for the Numerical Integration of First- and Second-Order Differential Equations

National Research Council Canada - National Science Library

Mitchell, Jason

2002-01-01

A method is presented for the generation of exact numerical coefficients found in two families of implicit Chebyshev methods for the numerical integration of first- and second-order ordinary differential equations...

A New Generalisation of Macdonald Polynomials

Science.gov (United States)

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

2017-06-01

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

Special polynomials associated with some hierarchies

International Nuclear Information System (INIS)

Kudryashov, Nikolai A.

2008-01-01

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

Comparison of Two-Block Decomposition Method and Chebyshev Rational Approximation Method for Depletion Calculation

International Nuclear Information System (INIS)

Lee, Yoon Hee; Cho, Nam Zin

2016-01-01

The code gives inaccurate results of nuclides for evaluation of source term analysis, e.g., Sr- 90, Ba-137m, Cs-137, etc. A Krylov Subspace method was suggested by Yamamoto et al. The method is based on the projection of solution space of Bateman equation to a lower dimension of Krylov subspace. It showed good accuracy in the detailed burnup chain calculation if dimension of the Krylov subspace is high enough. In this paper, we will compare the two methods in terms of accuracy and computing time. In this paper, two-block decomposition (TBD) method and Chebyshev rational approximation method (CRAM) are compared in the depletion calculations. In the two-block decomposition method, according to the magnitude of effective decay constant, the system of Bateman equation is decomposed into short- and longlived blocks. The short-lived block is calculated by the general Bateman solution and the importance concept. Matrix exponential with smaller norm is used in the long-lived block. In the Chebyshev rational approximation, there is no decomposition of the Bateman equation system, and the accuracy of the calculation is determined by the order of expansion in the partial fraction decomposition of the rational form. The coefficients in the partial fraction decomposition are determined by a Remez-type algorithm.

Comparison of Two-Block Decomposition Method and Chebyshev Rational Approximation Method for Depletion Calculation

Energy Technology Data Exchange (ETDEWEB)

Lee, Yoon Hee; Cho, Nam Zin [KAERI, Daejeon (Korea, Republic of)

2016-05-15

The code gives inaccurate results of nuclides for evaluation of source term analysis, e.g., Sr- 90, Ba-137m, Cs-137, etc. A Krylov Subspace method was suggested by Yamamoto et al. The method is based on the projection of solution space of Bateman equation to a lower dimension of Krylov subspace. It showed good accuracy in the detailed burnup chain calculation if dimension of the Krylov subspace is high enough. In this paper, we will compare the two methods in terms of accuracy and computing time. In this paper, two-block decomposition (TBD) method and Chebyshev rational approximation method (CRAM) are compared in the depletion calculations. In the two-block decomposition method, according to the magnitude of effective decay constant, the system of Bateman equation is decomposed into short- and longlived blocks. The short-lived block is calculated by the general Bateman solution and the importance concept. Matrix exponential with smaller norm is used in the long-lived block. In the Chebyshev rational approximation, there is no decomposition of the Bateman equation system, and the accuracy of the calculation is determined by the order of expansion in the partial fraction decomposition of the rational form. The coefficients in the partial fraction decomposition are determined by a Remez-type algorithm.

A Summation Formula for Macdonald Polynomials

Science.gov (United States)

de Gier, Jan; Wheeler, Michael

2016-03-01

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

Digitial Elevation Model (DEM) 100K

Data.gov (United States)

Kansas Data Access and Support Center — Digital Elevation Model (DEM) is the terminology adopted by the USG to describe terrain elevation data sets in a digital raster form. The standard DEM consists of a...

Digtial Elevation Model (DEM) 250K

Data.gov (United States)

Kansas Data Access and Support Center — Digital Elevation Model (DEM) is the terminology adopted by the USGS to describe terrain elevation data sets in a digital raster form. The standard DEM consists of a...

Digital Elevation Model (DEM) 24K

Data.gov (United States)

Kansas Data Access and Support Center — Digital Elevation Model (DEM) is the terminology adopted by the USGS to describe terrain elevation data sets in a digital raster form. The standard DEM consists of a...

Browse Title Index

African Journals Online (AJOL)

Items 151 - 200 of 985 ... Vol 15 (2009), Application of Neuro-Fuzzy to palm oil production ... the Strength of Users Passwords in Computing Systems in Nigeria, Abstract ... of the Chebyshev polynomials for the Tau numerical method, Abstract.

Weierstrass polynomials for links

DEFF Research Database (Denmark)

Hansen, Vagn Lundsgaard

1997-01-01

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

On Symmetric Polynomials

OpenAIRE

Golden, Ryan; Cho, Ilwoo

2015-01-01

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

Associated polynomials and birth-death processes

NARCIS (Netherlands)

van Doorn, Erik A.

2001-01-01

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

New class of filter functions generated most directly by Christoffel-Darboux formula for Gegenbauer orthogonal polynomials

Science.gov (United States)

Ilić, Aleksandar D.; Pavlović, Vlastimir D.

2011-01-01

A new original formulation of all pole low-pass filter functions is proposed in this article. The starting point in solving the approximation problem is a direct application of the Christoffel-Darboux formula for the set of orthogonal polynomials, including Gegenbauer orthogonal polynomials in the finite interval [-1, +1] with the application of a weighting function with a single free parameter. A general solution for the filter functions is obtained in a compact explicit form, which is shown to enable generation of the Gegenbauer filter functions in a simple way by choosing the value of the free parameter. Moreover, the proposed solution with the same criterion of approximation could be used to generate Legendre and Chebyshev filter functions of the first and second kind as well. The examples of proposed filter functions of even (10th) and odd (11th) order are illustrated. The approximation is shown to yield a good compromise solution with respect to the filter frequency characteristics (magnitude as well as phase characteristics). The influence of tolerance of the filter critical component (inductor) on the proposed magnitude and group delay characteristics of a resistively terminated LC lossless ladder filter is analysed as well. The proposed filter functions are superior in terms of the excellent magnitude characteristic, which approximates an ideal filter almost perfectly over the entire pass-band range and exhibits the summed sensitivity function better than that of a Butterworth filter. In the article, we present the filter function solution that exhibits optimum amplitude as well as optimum group delay characteristics that are of crucial importance for implementation of digital processing as well as RF analogue parts of communication networks. Derivation of the other band range filter functions, which could be realised either by continuous or digital filters, is also generally possible with the procedure proposed in this article.

Scattering theory and orthogonal polynomials

International Nuclear Information System (INIS)

Geronimo, J.S.

1977-01-01

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

Estimating Coastal Digital Elevation Model (DEM) Uncertainty

Science.gov (United States)

Amante, C.; Mesick, S.

2017-12-01

Integrated bathymetric-topographic digital elevation models (DEMs) are representations of the Earth's solid surface and are fundamental to the modeling of coastal processes, including tsunami, storm surge, and sea-level rise inundation. Deviations in elevation values from the actual seabed or land surface constitute errors in DEMs, which originate from numerous sources, including: (i) the source elevation measurements (e.g., multibeam sonar, lidar), (ii) the interpolative gridding technique (e.g., spline, kriging) used to estimate elevations in areas unconstrained by source measurements, and (iii) the datum transformation used to convert bathymetric and topographic data to common vertical reference systems. The magnitude and spatial distribution of the errors from these sources are typically unknown, and the lack of knowledge regarding these errors represents the vertical uncertainty in the DEM. The National Oceanic and Atmospheric Administration (NOAA) National Centers for Environmental Information (NCEI) has developed DEMs for more than 200 coastal communities. This study presents a methodology developed at NOAA NCEI to derive accompanying uncertainty surfaces that estimate DEM errors at the individual cell-level. The development of high-resolution (1/9th arc-second), integrated bathymetric-topographic DEMs along the southwest coast of Florida serves as the case study for deriving uncertainty surfaces. The estimated uncertainty can then be propagated into the modeling of coastal processes that utilize DEMs. Incorporating the uncertainty produces more reliable modeling results, and in turn, better-informed coastal management decisions.

Fermionic formula for double Kostka polynomials

OpenAIRE

Liu, Shiyuan

2016-01-01

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

Relations between Möbius and coboundary polynomials

NARCIS (Netherlands)

Jurrius, R.P.M.J.

2012-01-01

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

Matrix product formula for Macdonald polynomials

Science.gov (United States)

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

2015-09-01

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

Matrix product formula for Macdonald polynomials

International Nuclear Information System (INIS)

Cantini, Luigi; Gier, Jan de; Michael Wheeler

2015-01-01

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

Arabic text classification using Polynomial Networks

Directory of Open Access Journals (Sweden)

Mayy M. Al-Tahrawi

2015-10-01

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

Many-body orthogonal polynomial systems

International Nuclear Information System (INIS)

Witte, N.S.

1997-03-01

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

THE GLOBAL TANDEM-X DEM: PRODUCTION STATUS AND FIRST VALIDATION RESULTS

Directory of Open Access Journals (Sweden)

M. Huber

2012-07-01

Full Text Available The TanDEM-X mission will derive a global digital elevation model (DEM with satellite SAR interferometry. Two radar satellites (TerraSAR-X and TanDEM-X will map the Earth in a resolution and accuracy with an absolute height error of 10m and a relative height error of 2m for 90% of the data. In order to fulfill the height requirements in general two global coverages are acquired and processed. Besides the final TanDEM-X DEM, an intermediate DEM with reduced accuracy is produced after the first coverage is completed. The last step in the whole workflow for generating the TanDEM-X DEM is the calibration of remaining systematic height errors and the merge of single acquisitions to 1°x1° DEM tiles. In this paper the current status of generating the intermediate DEM and first validation results based on GPS tracks, laser scanning DEMs, SRTM data and ICESat points are shown for different test sites.

Vertex models, TASEP and Grothendieck polynomials

International Nuclear Information System (INIS)

Motegi, Kohei; Sakai, Kazumitsu

2013-01-01

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

On the Laurent polynomial rings

International Nuclear Information System (INIS)

Stefanescu, D.

1985-02-01

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

kawaihae_dem.grd

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — NGDC builds and distributes high-resolution, coastal digital elevation models (DEMs) that integrate ocean bathymetry and land topography to support NOAA's mission to...

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

KAUST Repository

Ait-Haddou, Rachid

2015-06-07

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

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

KAUST Repository

Ait-Haddou, Rachid; Goldman, Ron

2015-01-01

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

Computing the Alexander Polynomial Numerically

DEFF Research Database (Denmark)

Hansen, Mikael Sonne

2006-01-01

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

Density of Real Zeros of the Tutte Polynomial

DEFF Research Database (Denmark)

Ok, Seongmin; Perrett, Thomas

2018-01-01

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

Density of Real Zeros of the Tutte Polynomial

DEFF Research Database (Denmark)

Ok, Seongmin; Perrett, Thomas

2017-01-01

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

Parallel Construction of Irreducible Polynomials

DEFF Research Database (Denmark)

Frandsen, Gudmund Skovbjerg

Let arithmetic pseudo-NC^k denote the problems that can be solved by log space uniform arithmetic circuits over the finite prime field GF(p) of depth O(log^k (n + p)) and size polynomial in (n + p). We show that the problem of constructing an irreducible polynomial of specified degree over GF(p) ...... of polynomials is in arithmetic NC^3. Our algorithm works over any field and compared to other known algorithms it does not assume the ability to take p'th roots when the field has characteristic p....

Rapid expansion method (REM) for time‐stepping in reverse time migration (RTM)

KAUST Repository

Pestana, Reynam C.; Stoffa, Paul L.

2009-01-01

an analytical approximation for the Bessel function where we assume that the time step is sufficiently small. From this derivation we find that if we consider only the first two Chebyshev polynomials terms in the rapid expansion method we can obtain the second

A linear stability analysis of thermal convection in spherical shells with variable radial gravity based on the Tau-Chebyshev method

International Nuclear Information System (INIS)

Avila, Ruben; Cabello-González, Ares; Ramos, Eduardo

2013-01-01

Highlights: • The Tau-Chebyshev method solves the linear fluid flow equations in spherical shells. • The fluid motion is driven by a central force proportional to the radial position. • The full Navier–Stokes equations are solved by the spectral element method. • The linear results are verified with the solution of the Navier–Stokes equations. • The solution of the linear problems is used to initiate non-linear calculations. -- Abstract: The onset of thermal convection in a non-rotating spherical shell is investigated using linear theory. The Tau-Chebyshev spectral method is used to integrate the linearized equations. We investigate the onset of thermal convection by considering two cases of the radial gravitational field (i) a local acceleration, acting radially inward, that is proportional to the distance from the center r, and (ii) a radial gravitational central force that is proportional to r −n . The former case has been widely analyzed in the literature, because it constitutes a simplified model that is usually used, in astrophysics and geophysics, and is studied here to validate the numerical method. The latter case was analyzed since the case n = 5 has been experimentally realized (by means of the dielectrophoretic effect) under microgravity condition, in the experimental container called GeoFlow, inside the International Space Station. Our study is aimed to clarify the role of (i) a radially inward central force (either proportional to r or to r −n ), (ii) a base conductive temperature distribution provided by either a uniform heat source or an imposed temperature difference between outer and inner spheres, and (iii) the aspect ratio η (ratio of the radii of the inner and outer spheres), on the critical Rayleigh number. In all cases the surface of the spheres has been assumed to be rigid. The results obtained with the linear theory based on the Tau-Chebyshev spectral method are compared with those of the integration of the full non

Optimization over polynomials : Selected topics

NARCIS (Netherlands)

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

2014-01-01

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

The Importance of Precise Digital Elevation Models (DEM) in Modelling Floods

Science.gov (United States)

Demir, Gokben; Akyurek, Zuhal

2016-04-01

Digital elevation Models (DEM) are important inputs for topography for the accurate modelling of floodplain hydrodynamics. Floodplains have a key role as natural retarding pools which attenuate flood waves and suppress flood peaks. GPS, LIDAR and bathymetric surveys are well known surveying methods to acquire topographic data. It is not only time consuming and expensive to obtain topographic data through surveying but also sometimes impossible for remote areas. In this study it is aimed to present the importance of accurate modelling of topography for flood modelling. The flood modelling for Samsun-Terme in Blacksea region of Turkey is done. One of the DEM is obtained from the point observations retrieved from 1/5000 scaled orthophotos and 1/1000 scaled point elevation data from field surveys at x-sections. The river banks are corrected by using the orthophotos and elevation values. This DEM is named as scaled DEM. The other DEM is obtained from bathymetric surveys. 296 538 number of points and the left/right bank slopes were used to construct the DEM having 1 m spatial resolution and this DEM is named as base DEM. Two DEMs were compared by using 27 x-sections. The maximum difference at thalweg of the river bed is 2m and the minimum difference is 20 cm between two DEMs. The channel conveyance capacity in base DEM is larger than the one in scaled DEM and floodplain is modelled in detail in base DEM. MIKE21 with flexible grid is used in 2- dimensional shallow water flow modelling. The model by using two DEMs were calibrated for a flood event (July 9, 2012). The roughness is considered as the calibration parameter. From comparison of input hydrograph at the upstream of the river and output hydrograph at the downstream of the river, the attenuation is obtained as 91% and 84% for the base DEM and scaled DEM, respectively. The time lag in hydrographs does not show any difference for two DEMs and it is obtained as 3 hours. Maximum flood extents differ for the two DEMs

Discrete Chebyshev nets and a universal permutability theorem

International Nuclear Information System (INIS)

Schief, W K

2007-01-01

The Pohlmeyer-Lund-Regge system which was set down independently in the contexts of Lagrangian field theories and the relativistic motion of a string and which played a key role in the development of a geometric interpretation of soliton theory is known to appear in a variety of important guises such as the vectorial Lund-Regge equation, the O(4) nonlinear σ-model and the SU(2) chiral model. Here, it is demonstrated that these avatars may be discretized in such a manner that both integrability and equivalence are preserved. The corresponding discretization procedure is geometric and algebraic in nature and based on discrete Chebyshev nets and generalized discrete Lelieuvre formulae. In connection with the derivation of associated Baecklund transformations, it is shown that a generalized discrete Lund-Regge equation may be interpreted as a universal permutability theorem for integrable equations which admit commuting matrix Darboux transformations acting on su(2) linear representations. Three-dimensional coordinate systems and lattices of 'Lund-Regge' type related to particular continuous and discrete Zakharov-Manakov systems are obtained as a by-product of this analysis

Efficient computation of Laguerre polynomials

NARCIS (Netherlands)

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

2017-01-01

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

Orthogonal polynomials in transport theories

International Nuclear Information System (INIS)

Dehesa, J.S.

1981-01-01

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

Chromatic polynomials of random graphs

International Nuclear Information System (INIS)

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

2010-01-01

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

Initial Design and Quick Analysis of SAW Ultra–Wideband HFM Transducers

Directory of Open Access Journals (Sweden)

A. Janeliauskas

2017-09-01

Full Text Available This paper presents techniques for initial design and quick fundamental and harmonic operation analysis of surface acoustic waves ultra–wideband hyperbolically frequency modulated (HFM interdigital transducer (IDT. The primary analysis is based on the quasi–static method. Quasi–electrostatic charge's density distribution was approximated by Chebyshev polynomials and the method of Green’s function. It assesses the non uniform charge distribution of electrodes, electric field interaction and the end effects of a whole transducer. It was found that numerical integration (e.g. Romberg, Gauss–Chebyshev requires a lot of machine time for calculation of the Chebyshev polynomial and the Green’s function convolution when integration includes coordinates of a large number of neighboring electrodes. In order to accelerate the charge density calculation, the analytic expressions are derived. Evaluation of HFM transducer fundamental and harmonics' operation amplitude response with simulation single–dispersive interdigital chirp filter structure is presented. Elapsed time of HFM IDT with 589 electrodes simulations and 2000 frequency response point is only 54 seconds (0.027 s/point on PC with CPU Intel Core I7–4770S. Amplitude response is compared with linear frequency modulated (LFM IDT response. It was determined that the HFM transducer characteristic is less distorted in comparison with LFM transducer.

New polynomial-based molecular descriptors with low degeneracy.

Directory of Open Access Journals (Sweden)

Matthias Dehmer

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

Research on the method of extracting DEM based on GBInSAR

Science.gov (United States)

Yue, Jianping; Yue, Shun; Qiu, Zhiwei; Wang, Xueqin; Guo, Leping

2016-05-01

Precise topographical information has a very important role in geology, hydrology, natural resources survey and deformation monitoring. The extracting DEM technology based on synthetic aperture radar interferometry (InSAR) obtains the three-dimensional elevation of the target area through the phase information of the radar image data. The technology has large-scale, high-precision, all-weather features. By changing track in the location of the ground radar system up and down, it can form spatial baseline. Then we can achieve the DEM of the target area by acquiring image data from different angles. Three-dimensional laser scanning technology can quickly, efficiently and accurately obtain DEM of target area, which can verify the accuracy of DEM extracted by GBInSAR. But research on GBInSAR in extracting DEM of the target area is a little. For lack of theory and lower accuracy problems in extracting DEM based on GBInSAR now, this article conducted research and analysis on its principle deeply. The article extracted the DEM of the target area, combined with GBInSAR data. Then it compared the DEM obtained by GBInSAR with the DEM obtained by three-dimensional laser scan data and made statistical analysis and normal distribution test. The results showed the DEM obtained by GBInSAR was broadly consistent with the DEM obtained by three-dimensional laser scanning. And its accuracy is high. The difference of both DEM approximately obeys normal distribution. It indicated that extracting the DEM of target area based on GBInSAR is feasible and provided the foundation for the promotion and application of GBInSAR.

Computational Error Estimate for the Power Series Solution of Odes ...

African Journals Online (AJOL)

This paper compares the error estimation of power series solution with recursive Tau method for solving ordinary differential equations. From the computational viewpoint, the power series using zeros of Chebyshevpolunomial is effective, accurate and easy to use. Keywords: Lanczos Tau method, Chebyshev polynomial, ...

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

International Nuclear Information System (INIS)

Taiwo, T.A.; Palmiotti, G.

1997-01-01

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

Study of a Biparametric Family of Iterative Methods

Directory of Open Access Journals (Sweden)

B. Campos

2014-01-01

Full Text Available The dynamics of a biparametric family for solving nonlinear equations is studied on quadratic polynomials. This biparametric family includes the c-iterative methods and the well-known Chebyshev-Halley family. We find the analytical expressions for the fixed and critical points by solving 6-degree polynomials. We use the free critical points to get the parameter planes and, by observing them, we specify some values of (α, c with clear stable and unstable behaviors.

Automated Quality Control for Ortholmages and DEMs

DEFF Research Database (Denmark)

Höhle, Joachim; Potucková, Marketa

2005-01-01

The checking of geometric accurancy of orthoimages and digital elevation models (DEMs) is discussed. As a reference, an existing orthoimage and a second orthoimage derived from an overlapping aerial image, are used. The proposed automated procedures for checking the orthoimages and DEMs are based...

Sheffer and Non-Sheffer Polynomial Families

Directory of Open Access Journals (Sweden)

G. Dattoli

2012-01-01

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

Generalized Pseudospectral Method and Zeros of Orthogonal Polynomials

Directory of Open Access Journals (Sweden)

Oksana Bihun

2018-01-01

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

Estimating River Surface Elevation From ArcticDEM

Science.gov (United States)

Dai, Chunli; Durand, Michael; Howat, Ian M.; Altenau, Elizabeth H.; Pavelsky, Tamlin M.

2018-04-01

ArcticDEM is a collection of 2-m resolution, repeat digital surface models created from stereoscopic satellite imagery. To demonstrate the potential of ArcticDEM for measuring river stages and discharges, we estimate river surface heights along a reach of Tanana River near Fairbanks, Alaska, by the precise detection of river shorelines and mapping of shorelines to land surface elevation. The river height profiles over a 15-km reach agree with in situ measurements to a standard deviation less than 30 cm. The time series of ArcticDEM-derived river heights agree with the U.S. Geological Survey gage measurements with a standard deviation of 32 cm. Using the rating curve for that gage, we obtain discharges with a validation accuracy (root-mean-square error) of 234 m3/s (23% of the mean discharge). Our results demonstrate that ArcticDEM can accurately measure spatial and temporal variations of river surfaces, providing a new and powerful data set for hydrologic analysis.

Algumas anedotas sobre Demóstenes: uma releitura

Directory of Open Access Journals (Sweden)

Maddalena Vallozza

2013-06-01

Full Text Available Muitas das anedotas sobre Demóstenes estão relacionados a seus problemas de voz e a suas dificuldades no momento da hypokrisis. Eu proponho uma reinterpretação das páginas em que eles nos são transmitidos: de Quintiliano (11, 3, a principal testemunha, a Cícero (Orator 26 e 56-58, Brutus 142, De Oratore I 261 e III 213, do autor da seção sobre Demóstenes nas Vidas dos Dez Oradores (844 d-845 b à Vida de Demóstene, de Plutarco. Com base nisso, particularmente graças a Plutarco, que cita Hermipo e Demétrio de Fáleros, é possível formular a hipótese de que a tradição nasceu no Perípato, na área de interesses pela hypokrisis que demonstram o perdido Perì hypokríseos de Teofrasto e os fragmentos da Retórica de Demétrio de Fáleros.

ASTER Orthorectified Digital Elevation Model (DEM) V003

Data.gov (United States)

National Aeronautics and Space Administration — The ASTER L3 DEM and Orthorectified Images form a multi-file product that contains both the Digital Elevation Model (DEM), and the Orthorectified Image products....

Polynomial sequences generated by infinite Hessenberg matrices

Directory of Open Access Journals (Sweden)

Verde-Star Luis

2017-01-01

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

Special polynomials associated with rational solutions of some hierarchies

International Nuclear Information System (INIS)

Kudryashov, Nikolai A.

2009-01-01

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

TecLines: A MATLAB-Based Toolbox for Tectonic Lineament Analysis from Satellite Images and DEMs, Part 2: Line Segments Linking and Merging

Directory of Open Access Journals (Sweden)

Mehdi Rahnama

2014-11-01

Full Text Available Extraction and interpretation of tectonic lineaments is one of the routines for mapping large areas using remote sensing data. However, this is a subjective and time-consuming process. It is difficult to choose an optimal lineament extraction method in order to reduce subjectivity and obtain vectors similar to what an analyst would manually extract. The objective of this study is the implementation, evaluation and comparison of Hough transform, segment merging and polynomial fitting methods towards automated tectonic lineament mapping. For this purpose we developed a new MATLAB-based toolbox (TecLines. The proposed toolbox capabilities were validated using a synthetic Digital Elevation Model (DEM and tested along in the Andarab fault zone (Afghanistan where specific fault structures are known. In this study, we used filters in both frequency and spatial domains and the tensor voting framework to produce binary edge maps. We used the Hough transform to extract linear image discontinuities. We used B-spline as a polynomial curve fitting method to eliminate artificial line segments that are out of interest and to link discontinuous segments with similar trends. We performed statistical analyses in order to compare the final image discontinuities maps with existing references map.

Multilevel weighted least squares polynomial approximation

KAUST Repository

Haji-Ali, Abdul-Lateef

2017-06-30

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

Envolving the Operations of the TerraSAR-X/TanDEM-X Mission Planning System during the TanDEM-X Science Phase

OpenAIRE

Stathopoulos, Fotios; Guillermin, Guillaume; Garcia Acero, Carlos; Reich, Karin; Mrowka, Falk

2016-01-01

After the successful Global Coverage of the Digital Elevation Model, the TanDEM-X Science phase was initiated in September of 2014, dedicated to the demonstration of innovative techniques and experiments. The TanDEM-X Science phase had a large impact on the TerraSAR-X/TanDEM-X Mission Planning System. The two main challenges were the formation flying changes and the activation of a new acquisition mode, the so called Dual Receive Antenna (DRA) acquisition mode. This paper describes all action...

Relations between zeros of special polynomials associated with the Painleve equations

International Nuclear Information System (INIS)

Kudryashov, Nikolai A.; Demina, Maria V.

2007-01-01

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

Numerical approaches to time evolution of complex quantum systems

International Nuclear Information System (INIS)

Fehske, Holger; Schleede, Jens; Schubert, Gerald; Wellein, Gerhard; Filinov, Vladimir S.; Bishop, Alan R.

2009-01-01

We examine several numerical techniques for the calculation of the dynamics of quantum systems. In particular, we single out an iterative method which is based on expanding the time evolution operator into a finite series of Chebyshev polynomials. The Chebyshev approach benefits from two advantages over the standard time-integration Crank-Nicholson scheme: speedup and efficiency. Potential competitors are semiclassical methods such as the Wigner-Moyal or quantum tomographic approaches. We outline the basic concepts of these techniques and benchmark their performance against the Chebyshev approach by monitoring the time evolution of a Gaussian wave packet in restricted one-dimensional (1D) geometries. Thereby the focus is on tunnelling processes and the motion in anharmonic potentials. Finally we apply the prominent Chebyshev technique to two highly non-trivial problems of current interest: (i) the injection of a particle in a disordered 2D graphene nanoribbon and (ii) the spatiotemporal evolution of polaron states in finite quantum systems. Here, depending on the disorder/electron-phonon coupling strength and the device dimensions, we observe transmission or localisation of the matter wave.

On polynomial solutions of the Heun equation

International Nuclear Information System (INIS)

Gurappa, N; Panigrahi, Prasanta K

2004-01-01

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

A new Arnoldi approach for polynomial eigenproblems

Energy Technology Data Exchange (ETDEWEB)

Raeven, F.A.

1996-12-31

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

Orthogonal Polynomials and Special Functions

CERN Document Server

Assche, Walter

2003-01-01

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

Multiple Meixner polynomials and non-Hermitian oscillator Hamiltonians

International Nuclear Information System (INIS)

Ndayiragije, F; Van Assche, W

2013-01-01

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

Colouring and knot polynomials

International Nuclear Information System (INIS)

Welsh, D.J.A.

1991-01-01

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

A comparative appraisal of hydrological behavior of SRTM DEM at catchment level

Science.gov (United States)

Sharma, Arabinda; Tiwari, K. N.

2014-11-01

The Shuttle Radar Topography Mission (SRTM) data has emerged as a global elevation data in the past one decade because of its free availability, homogeneity and consistent accuracy compared to other global elevation dataset. The present study explores the consistency in hydrological behavior of the SRTM digital elevation model (DEM) with reference to easily available regional 20 m contour interpolated DEM (TOPO DEM). Analysis ranging from simple vertical accuracy assessment to hydrological simulation of the studied Maithon catchment, using empirical USLE model and semidistributed, physical SWAT model, were carried out. Moreover, terrain analysis involving hydrological indices was performed for comparative assessment of the SRTM DEM with respect to TOPO DEM. Results reveal that the vertical accuracy of SRTM DEM (±27.58 m) in the region is less than the specified standard (±16 m). Statistical analysis of hydrological indices such as topographic wetness index (TWI), stream power index (SPI), slope length factor (SLF) and geometry number (GN) shows a significant differences in hydrological properties of the two studied DEMs. Estimation of soil erosion potentials of the catchment and conservation priorities of microwatersheds of the catchment using SRTM DEM and TOPO DEM produce considerably different results. Prediction of soil erosion potential using SRTM DEM is far higher than that obtained using TOPO DEM. Similarly, conservation priorities determined using the two DEMs are found to be agreed for only 34% of microwatersheds of the catchment. ArcSWAT simulation reveals that runoff predictions are less sensitive to selection of the two DEMs as compared to sediment yield prediction. The results obtained in the present study are vital to hydrological analysis as it helps understanding the hydrological behavior of the DEM without being influenced by the model structural as well as parameter uncertainty. It also reemphasized that SRTM DEM can be a valuable dataset for

Performance evaluation of high rate space–time trellis-coded modulation using Gauss–Chebyshev quadrature technique

CSIR Research Space (South Africa)

Sokoya, O

2008-05-01

Full Text Available combines both simplicity and accuracy in finding the closed form expression of the PEP. The paper is organised as follows. In Section 2, we discuss the general transmission model of the HR-STTCM and the channel model. In Section 3, we describe... the derivation of the PEP using the Gauss–Chebyshev quadrature technique and also give a numerical example. In Section 4, we use the PEP obtained in Section 3 to estimate the average BEP for slow fading channels. Section 5 concludes the paper with discussion...

Coefficient of restitution in fractional viscoelastic compliant impacts using fractional Chebyshev collocation

Science.gov (United States)

Dabiri, Arman; Butcher, Eric A.; Nazari, Morad

2017-02-01

Compliant impacts can be modeled using linear viscoelastic constitutive models. While such impact models for realistic viscoelastic materials using integer order derivatives of force and displacement usually require a large number of parameters, compliant impact models obtained using fractional calculus, however, can be advantageous since such models use fewer parameters and successfully capture the hereditary property. In this paper, we introduce the fractional Chebyshev collocation (FCC) method as an approximation tool for numerical simulation of several linear fractional viscoelastic compliant impact models in which the overall coefficient of restitution for the impact is studied as a function of the fractional model parameters for the first time. Other relevant impact characteristics such as hysteresis curves, impact force gradient, penetration and separation depths are also studied.

Uniqueness and zeros of q-shift difference polynomials

Indian Academy of Sciences (India)

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

Factoring polynomials over arbitrary finite fields

NARCIS (Netherlands)

Lange, T.; Winterhof, A.

2000-01-01

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

Additive and polynomial representations

CERN Document Server

Krantz, David H; Suppes, Patrick

1971-01-01

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

S1-Leitlinie Lipödem.

Science.gov (United States)

Reich-Schupke, Stefanie; Schmeller, Wilfried; Brauer, Wolfgang Justus; Cornely, Manuel E; Faerber, Gabriele; Ludwig, Malte; Lulay, Gerd; Miller, Anya; Rapprich, Stefan; Richter, Dirk Frank; Schacht, Vivien; Schrader, Klaus; Stücker, Markus; Ure, Christian

2017-07-01

Die vorliegende überarbeitete Leitlinie zum Lipödem wurde unter der Federführung der Deutschen Gesellschaft für Phlebologie (DGP) erstellt und finanziert. Die Inhalte beruhen auf einer systematischen Literaturrecherche und dem Konsens von acht medizinischen Fachgesellschaften und Berufsverbänden. Die Leitlinie beinhaltet Empfehlungen zu Diagnostik und Therapie des Lipödems. Die Diagnose ist dabei auf der Basis von Anamnese und klinischem Befund zu stellen. Charakteristisch ist eine umschriebene, symmetrisch lokalisierte Vermehrung des Unterhautfettgewebes an den Extremitäten mit deutlicher Disproportion zum Stamm. Zusätzlich finden sich Ödeme, Hämatomneigung und eine gesteigerte Schmerzhaftigkeit der betroffenen Körperabschnitte. Weitere apparative Untersuchungen sind bisher besonderen Fragestellungen vorbehalten. Die Erkrankung ist chronisch progredient mit individuell unterschiedlichem und nicht vorhersehbarem Verlauf. Die Therapie besteht aus vier Säulen, die individuell kombiniert und an das aktuelle Beschwerdebild angepasst werden sollten: komplexe physikalische Entstauungstherapie (manuelle Lymphdrainage, Kompressionstherapie, Bewegungstherapie, Hautpflege), Liposuktion und plastisch-chirurgische Interventionen, Ernährung und körperliche Aktivität sowie ggf. additive Psychotherapie. Operative Maßnahmen sind insbesondere dann angezeigt, wenn trotz konsequent durchgeführter konservativer Therapie noch Beschwerden bestehen bzw. eine Progredienz des Befundes und/oder der Beschwerden auftritt. Eine begleitend zum Lipödem bestehende morbide Adipositas sollte vor einer Liposuktion therapeutisch angegangen werden. © 2017 The Authors | Journal compilation © Blackwell Verlag GmbH, Berlin.

A Determinant Expression for the Generalized Bessel Polynomials

Directory of Open Access Journals (Sweden)

Sheng-liang Yang

2013-01-01

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

A generalization of the Bernoulli polynomials

Directory of Open Access Journals (Sweden)

Pierpaolo Natalini

2003-01-01

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

Large Scale Landform Mapping Using Lidar DEM

Directory of Open Access Journals (Sweden)

Türkay Gökgöz

2015-08-01

Full Text Available In this study, LIDAR DEM data was used to obtain a primary landform map in accordance with a well-known methodology. This primary landform map was generalized using the Focal Statistics tool (Majority, considering the minimum area condition in cartographic generalization in order to obtain landform maps at 1:1000 and 1:5000 scales. Both the primary and the generalized landform maps were verified visually with hillshaded DEM and an orthophoto. As a result, these maps provide satisfactory visuals of the landforms. In order to show the effect of generalization, the area of each landform in both the primary and the generalized maps was computed. Consequently, landform maps at large scales could be obtained with the proposed methodology, including generalization using LIDAR DEM.

Information-theoretic lengths of Jacobi polynomials

Energy Technology Data Exchange (ETDEWEB)

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

2010-07-30

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

Transversals of Complex Polynomial Vector Fields

DEFF Research Database (Denmark)

Dias, Kealey

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

On Multiple Interpolation Functions of the -Genocchi Polynomials

Directory of Open Access Journals (Sweden)

Jin Jeong-Hee

2010-01-01

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

Polynomial regression analysis and significance test of the regression function

International Nuclear Information System (INIS)

Gao Zhengming; Zhao Juan; He Shengping

2012-01-01

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

The modified Gauss diagonalization of polynomial matrices

International Nuclear Information System (INIS)

Saeed, K.

1982-10-01

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

Approximating Exponential and Logarithmic Functions Using Polynomial Interpolation

Science.gov (United States)

Gordon, Sheldon P.; Yang, Yajun

2017-01-01

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

Numerical Simulation of Polynomial-Speed Convergence Phenomenon

Science.gov (United States)

Li, Yao; Xu, Hui

2017-11-01

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

Exceptional polynomials and SUSY quantum mechanics

Indian Academy of Sciences (India)

Abstract. We show that for the quantum mechanical problem which admit classical Laguerre/. Jacobi polynomials as solutions for the Schrödinger equations (SE), will also admit exceptional. Laguerre/Jacobi polynomials as solutions having the same eigenvalues but with the ground state missing after a modification of the ...

A companion matrix for 2-D polynomials

International Nuclear Information System (INIS)

Boudellioua, M.S.

1995-08-01

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

Global sensitivity analysis by polynomial dimensional decomposition

Energy Technology Data Exchange (ETDEWEB)

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

2011-07-15

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

Polynomial asymptotic stability of damped stochastic differential equations

Directory of Open Access Journals (Sweden)

John Appleby

2004-08-01

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

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

International Nuclear Information System (INIS)

Konakli, Katerina; Sudret, Bruno

2016-01-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

2016-09-15

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

Degenerate r-Stirling Numbers and r-Bell Polynomials

Science.gov (United States)

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

2018-01-01

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

Commutators with idempotent values on multilinear polynomials in ...

Indian Academy of Sciences (India)

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

Polynomial weights and code constructions

DEFF Research Database (Denmark)

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

1973-01-01

polynomial included. This fundamental property is then used as the key to a variety of code constructions including 1) a simplified derivation of the binary Reed-Muller codes and, for any primepgreater than 2, a new extensive class ofp-ary "Reed-Muller codes," 2) a new class of "repeated-root" cyclic codes...... of long constraint length binary convolutional codes derived from2^r-ary Reed-Solomon codes, and 6) a new class ofq-ary "repeated-root" constacyclic codes with an algebraic decoding algorithm.......For any nonzero elementcof a general finite fieldGF(q), it is shown that the polynomials(x - c)^i, i = 0,1,2,cdots, have the "weight-retaining" property that any linear combination of these polynomials with coefficients inGF(q)has Hamming weight at least as great as that of the minimum degree...

The generalized Yablonskii-Vorob'ev polynomials and their properties

International Nuclear Information System (INIS)

Kudryashov, Nikolai A.; Demina, Maria V.

2008-01-01

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

2-variable Laguerre matrix polynomials and Lie-algebraic techniques

International Nuclear Information System (INIS)

Khan, Subuhi; Hassan, Nader Ali Makboul

2010-01-01

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

Describing Quadratic Cremer Point Polynomials by Parabolic Perturbations

DEFF Research Database (Denmark)

Sørensen, Dan Erik Krarup

1996-01-01

We describe two infinite order parabolic perturbation proceduresyielding quadratic polynomials having a Cremer fixed point. The main ideais to obtain the polynomial as the limit of repeated parabolic perturbations.The basic tool at each step is to control the behaviour of certain externalrays.......Polynomials of the Cremer type correspond to parameters at the boundary of ahyperbolic component of the Mandelbrot set. In this paper we concentrate onthe main cardioid component. We investigate the differences between two-sided(i.e. alternating) and one-sided parabolic perturbations.In the two-sided case, we prove...... the existence of polynomials having an explicitlygiven external ray accumulating both at the Cremer point and at its non-periodicpreimage. We think of the Julia set as containing a "topologists double comb".In the one-sided case we prove a weaker result: the existence of polynomials havingan explicitly given...

Orthogonal polynomials derived from the tridiagonal representation approach

Science.gov (United States)

Alhaidari, A. D.

2018-01-01

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

A note on some identities of derangement polynomials.

Science.gov (United States)

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

2018-01-01

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

Topological quantum information, virtual Jones polynomials and Khovanov homology

International Nuclear Information System (INIS)

Kauffman, Louis H

2011-01-01

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

Polynomial solutions of the Monge-Ampère equation

Energy Technology Data Exchange (ETDEWEB)

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

2014-11-30

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

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

Indian Academy of Sciences (India)

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

Laguerre polynomials by a harmonic oscillator

Science.gov (United States)

Baykal, Melek; Baykal, Ahmet

2014-09-01

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

An automated, open-source (NASA Ames Stereo Pipeline) workflow for mass production of high-resolution DEMs from commercial stereo satellite imagery: Application to mountain glacies in the contiguous US

Science.gov (United States)

Shean, D. E.; Arendt, A. A.; Whorton, E.; Riedel, J. L.; O'Neel, S.; Fountain, A. G.; Joughin, I. R.

2016-12-01

We adapted the open source NASA Ames Stereo Pipeline (ASP) to generate digital elevation models (DEMs) and orthoimages from very-high-resolution (VHR) commercial imagery of the Earth. These modifications include support for rigorous and rational polynomial coefficient (RPC) sensor models, sensor geometry correction, bundle adjustment, point cloud co-registration, and significant improvements to the ASP code base. We outline an automated processing workflow for 0.5 m GSD DigitalGlobe WorldView-1/2/3 and GeoEye-1 along-track and cross-track stereo image data. Output DEM products are posted at 2, 8, and 32 m with direct geolocation accuracy of process individual stereo pairs on a local workstation, the methods presented here were developed for large-scale batch processing in a high-performance computing environment. We have leveraged these resources to produce dense time series and regional mosaics for the Earth's ice sheets. We are now processing and analyzing all available 2008-2016 commercial stereo DEMs over glaciers and perennial snowfields in the contiguous US. We are using these records to study long-term, interannual, and seasonal volume change and glacier mass balance. This analysis will provide a new assessment of regional climate change, and will offer basin-scale analyses of snowpack evolution and snow/ice melt runoff for water resource applications.

Julia Sets of Orthogonal Polynomials

DEFF Research Database (Denmark)

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

2018-01-01

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

An introduction to orthogonal polynomials

CERN Document Server

Chihara, Theodore S

1978-01-01

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

Imaging characteristics of Zernike and annular polynomial aberrations.

Science.gov (United States)

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

2013-04-01

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

Polynomial selection in number field sieve for integer factorization

Directory of Open Access Journals (Sweden)

Gireesh Pandey

2016-09-01

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

Polynomial solutions of nonlinear integral equations

International Nuclear Information System (INIS)

Dominici, Diego

2009-01-01

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

Polynomial solutions of nonlinear integral equations

Energy Technology Data Exchange (ETDEWEB)

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

2009-05-22

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

Laguerre polynomials by a harmonic oscillator

International Nuclear Information System (INIS)

Baykal, Melek; Baykal, Ahmet

2014-01-01

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

Remarks on determinants and the classical polynomials

International Nuclear Information System (INIS)

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

1986-01-01

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

Precise baseline determination for the TanDEM-X mission

Science.gov (United States)

Koenig, Rolf; Moon, Yongjin; Neumayer, Hans; Wermuth, Martin; Montenbruck, Oliver; Jäggi, Adrian

The TanDEM-X mission will strive for generating a global precise Digital Elevation Model (DEM) by way of bi-static SAR in a close formation of the TerraSAR-X satellite, already launched on June 15, 2007, and the TanDEM-X satellite to be launched in May 2010. Both satellites carry the Tracking, Occultation and Ranging (TOR) payload supplied by the GFZ German Research Centre for Geosciences. The TOR consists of a high-precision dual-frequency GPS receiver, called Integrated GPS Occultation Receiver (IGOR), and a Laser retro-reflector (LRR) for precise orbit determination (POD) and atmospheric sounding. The IGOR is of vital importance for the TanDEM-X mission objectives as the millimeter level determination of the baseline or distance between the two spacecrafts is needed to derive meter level accurate DEMs. Within the TanDEM-X ground segment GFZ is responsible for the operational provision of precise baselines. For this GFZ uses two software chains, first its Earth Parameter and Orbit System (EPOS) software and second the BERNESE software, for backup purposes and quality control. In a concerted effort also the German Aerospace Center (DLR) generates precise baselines independently with a dedicated Kalman filter approach realized in its FRNS software. By the example of GRACE the generation of baselines with millimeter accuracy from on-board GPS data can be validated directly by way of comparing them to the intersatellite K-band range measurements. The K-band ranges are accurate down to the micrometer-level and therefore may be considered as truth. Both TanDEM-X baseline providers are able to generate GRACE baselines with sub-millimeter accuracy. By merging the independent baselines by GFZ and DLR, the accuracy can even be increased. The K-band validation however covers solely the along-track component as the K-band data measure just the distance between the two GRACE satellites. In addition they inhibit an un-known bias which must be modelled in the comparison, so the

General quantum polynomials: irreducible modules and Morita equivalence

International Nuclear Information System (INIS)

Artamonov, V A

1999-01-01

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

Multiple Meixner polynomials and non-Hermitian oscillator Hamiltonians

OpenAIRE

Ndayiragije, François; Van Assche, Walter

2013-01-01

Multiple Meixner polynomials are polynomials in one variable which satisfy orthogonality relations with respect to $r>1$ different negative binomial distributions (Pascal distributions). There are two kinds of multiple Meixner polynomials, depending on the selection of the parameters in the negative binomial distribution. We recall their definition and some formulas and give generating functions and explicit expressions for the coefficients in the nearest neighbor recurrence relation. Followi...

Multivariable biorthogonal continuous--discrete Wilson and Racah polynomials

International Nuclear Information System (INIS)

Tratnik, M.V.

1990-01-01

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

Primitive polynomials selection method for pseudo-random number generator

Science.gov (United States)

Anikin, I. V.; Alnajjar, Kh

2018-01-01

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

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

International Nuclear Information System (INIS)

Wang, Jesse Y.

1980-01-01

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

Hydraulic correction method (HCM) to enhance the efficiency of SRTM DEM in flood modeling

Science.gov (United States)

Chen, Huili; Liang, Qiuhua; Liu, Yong; Xie, Shuguang

2018-04-01

Digital Elevation Model (DEM) is one of the most important controlling factors determining the simulation accuracy of hydraulic models. However, the currently available global topographic data is confronted with limitations for application in 2-D hydraulic modeling, mainly due to the existence of vegetation bias, random errors and insufficient spatial resolution. A hydraulic correction method (HCM) for the SRTM DEM is proposed in this study to improve modeling accuracy. Firstly, we employ the global vegetation corrected DEM (i.e. Bare-Earth DEM), developed from the SRTM DEM to include both vegetation height and SRTM vegetation signal. Then, a newly released DEM, removing both vegetation bias and random errors (i.e. Multi-Error Removed DEM), is employed to overcome the limitation of height errors. Last, an approach to correct the Multi-Error Removed DEM is presented to account for the insufficiency of spatial resolution, ensuring flow connectivity of the river networks. The approach involves: (a) extracting river networks from the Multi-Error Removed DEM using an automated algorithm in ArcGIS; (b) correcting the location and layout of extracted streams with the aid of Google Earth platform and Remote Sensing imagery; and (c) removing the positive biases of the raised segment in the river networks based on bed slope to generate the hydraulically corrected DEM. The proposed HCM utilizes easily available data and tools to improve the flow connectivity of river networks without manual adjustment. To demonstrate the advantages of HCM, an extreme flood event in Huifa River Basin (China) is simulated on the original DEM, Bare-Earth DEM, Multi-Error removed DEM, and hydraulically corrected DEM using an integrated hydrologic-hydraulic model. A comparative analysis is subsequently performed to assess the simulation accuracy and performance of four different DEMs and favorable results have been obtained on the corrected DEM.

Neck curve polynomials in neck rupture model

International Nuclear Information System (INIS)

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

2012-01-01

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

Patterns in Permutations and Words

CERN Document Server

Kitaev, Sergey

2011-01-01

There has been considerable interest recently in the subject of patterns in permutations and words, a new branch of combinatorics with its roots in the works of Rotem, Rogers, and Knuth in the 1970s. Consideration of the patterns in question has been extremely interesting from the combinatorial point of view, and it has proved to be a useful language in a variety of seemingly unrelated problems, including the theory of Kazhdan--Lusztig polynomials, singularities of Schubert varieties, interval orders, Chebyshev polynomials, models in statistical mechanics, and various sorting algorithms, inclu

Algebraic limit cycles in polynomial systems of differential equations

International Nuclear Information System (INIS)

Llibre, Jaume; Zhao Yulin

2007-01-01

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

From sequences to polynomials and back, via operator orderings

Energy Technology Data Exchange (ETDEWEB)

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

2013-12-15

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

Connection coefficients between Boas-Buck polynomial sets

Science.gov (United States)

Cheikh, Y. Ben; Chaggara, H.

2006-07-01

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

Which DEM is best for analyzing fluvial landscape development in mountainous terrains?

Science.gov (United States)

Boulton, Sarah J.; Stokes, Martin

2018-06-01

Regional studies of fluvial landforms and long-term (Quaternary) landscape development in remote mountain landscapes routinely use satellite-derived DEM data sets. The SRTM and ASTER DEMs are the most commonly utilised because of their longer availability, free cost, and ease of access. However, rapid technological developments mean that newer and higher resolution DEM data sets such as ALOS World 3D (AW3D) and TanDEM-X are being released to the scientific community. Geomorphologists are thus faced with an increasingly problematic challenge of selecting an appropriate DEM for their landscape analyses. Here, we test the application of four medium resolution DEM products (30 m = SRTM, ASTER, AW3D; 12 m = TanDEM-X) for qualitative and quantitative analysis of a fluvial mountain landscape using the Dades River catchment (High Atlas Mountains, Morocco). This landscape comprises significant DEM remote sensing challenges, notably a high mountain relief, steep slopes, and a deeply incised high sinuosity drainage network with narrow canyon/gorge reaches. Our goal was to see which DEM produced the most representative best fit drainage network and meaningful quantification. To achieve this, we used ArcGIS and Stream Profiler platforms to generate catchment hillshade and slope rasters and to extract drainage network, channel long profile and channel slope, and area data. TanDEM-X produces the clearest landscape representation but with channel routing errors in localised high relief areas. Thirty-metre DEMs are smoother and less detailed, but the AW3D shows the closest fit to the real drainage network configuration. The TanDEM-X elevation values are the closest to field-derived GPS measurements. Long profiles exhibit similar shapes but with minor differences in length, elevation, and the degree of noise/smoothing, with AW3D producing the best representation. Slope-area plots display similarly positioned slope-break knickpoints with modest differences in steepness and concavity

Least squares orthogonal polynomial approximation in several independent variables

International Nuclear Information System (INIS)

Caprari, R.S.

1992-06-01

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

On Roots of Polynomials and Algebraically Closed Fields

Directory of Open Access Journals (Sweden)

Schwarzweller Christoph

2017-10-01

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

Photodissociation of NaH using time-dependent Fourier grid method

Indian Academy of Sciences (India)

We have solved the time dependent Schrödinger equation by using the Chebyshev polynomial scheme and Fourier grid Hamiltonian method to calculate the dissociation cross section of NaH molecule by 1-photon absorption from the 1+ state to the 1 state. We have found that the results differ significantly from an ...

Topological string partition functions as polynomials

International Nuclear Information System (INIS)

Yamaguchi, Satoshi; Yau Shingtung

2004-01-01

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

Rotation of 2D orthogonal polynomials

Czech Academy of Sciences Publication Activity Database

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

2018-01-01

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

Accuracy of Cartosat-1 DEM and its derived attribute at multiple ...

Indian Academy of Sciences (India)

and information content was compared using mean elevation, variance and entropy statistics. Various ... required, but for local studies large scale represen- tation is ... been made to examine the effect of DEM accuracy ... accuracy of DEM is evaluated with respect to grid .... that loss of entropy is a measure of DEM quality or.

Der Meteorologe : (aus dem Band "V". Tallinn 1998) / Elo Viiding ; aus dem Estnischen von Gisbert Jänicke

Index Scriptorium Estoniae

Viiding, Elo, 1974-

2002-01-01

Sisu : Die Möglichkeit des Meteorologen = Meteoroloogi võimalikkusest ; "Der Meteorologe kam 1990 in die Stadt..." = "Meteoroloog saabus linna aastal 1990..." ; "Was wäre dir "Arbeit" des Meteorologen..." = "Mis oleks meteoroloogi töö..." ; "Und ein Unglück für den Meteorologen ist es auch..." = "Ja Meteoroloogi õnnetus on veel see..." ; Angst vor dem Altwerden des Meteorologen = Hirm Meteoroloogi vanakssaamise ees ; Fest. Geschenk = Pidu. Kink ; "Wenn der Meteorologe eine Grösse sieht, ist er darüber..." = "Kui meteoroloog näeb suurust, on ta selle kohal..." ; Der Meteorologe wird im Saal erwartet = Meteoroloogi oodatakse saali ; "Das Abkommen mit der Meteorologenerwartung kündigen..." = "Katkestada leping meteoroloogiootusega..." ; "Die "Wege des Herrn" sind der Meteorologe..." = "Looja tee" on Meteoroloog..." ; Von dem Fremden, der im Saal den Meteorologen traf = Võõra lugu, kes Meteoroloogi saalis kohtas ; "Den Fremden hervorzuhusten, der von dem..." = "Köhida enesest välja võõras, kes tahtis teha..." ; Der Fremde beruhigt sich nicht = Võõras ei jää rahule

q-analogue of the Krawtchouk and Meixner orthogonal polynomials

International Nuclear Information System (INIS)

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

1993-06-01

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

Skew-orthogonal polynomials and random matrix theory

CERN Document Server

Ghosh, Saugata

2009-01-01

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

Some properties of generalized self-reciprocal polynomials over finite fields

Directory of Open Access Journals (Sweden)

Ryul Kim

2014-07-01

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

The Rational Third-Kind Chebyshev Pseudospectral Method for the Solution of the Thomas-Fermi Equation over Infinite Interval

Directory of Open Access Journals (Sweden)

Majid Tavassoli Kajani

2013-01-01

Full Text Available We propose a pseudospectral method for solving the Thomas-Fermi equation which is a nonlinear ordinary differential equation on semi-infinite interval. This approach is based on the rational third-kind Chebyshev pseudospectral method that is indeed a combination of Tau and collocation methods. This method reduces the solution of this problem to the solution of a system of algebraic equations. Comparison with some numerical solutions shows that the present solution is highly accurate.

Cross Validation on the Equality of Uav-Based and Contour-Based Dems

Science.gov (United States)

Ma, R.; Xu, Z.; Wu, L.; Liu, S.

2018-04-01

Unmanned Aerial Vehicles (UAV) have been widely used for Digital Elevation Model (DEM) generation in geographic applications. This paper proposes a novel framework of generating DEM from UAV images. It starts with the generation of the point clouds by image matching, where the flight control data are used as reference for searching for the corresponding images, leading to a significant time saving. Besides, a set of ground control points (GCP) obtained from field surveying are used to transform the point clouds to the user's coordinate system. Following that, we use a multi-feature based supervised classification method for discriminating non-ground points from ground ones. In the end, we generate DEM by constructing triangular irregular networks and rasterization. The experiments are conducted in the east of Jilin province in China, which has been suffered from soil erosion for several years. The quality of UAV based DEM (UAV-DEM) is compared with that generated from contour interpolation (Contour-DEM). The comparison shows a higher resolution, as well as higher accuracy of UAV-DEMs, which contains more geographic information. In addition, the RMSE errors of the UAV-DEMs generated from point clouds with and without GCPs are ±0.5 m and ±20 m, respectively.

on the performance of Autoregressive Moving Average Polynomial

African Journals Online (AJOL)

Timothy Ademakinwa

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

Symmetric functions and orthogonal polynomials

CERN Document Server

Macdonald, I G

1997-01-01

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

Applications of polynomial optimization in financial risk investment

Science.gov (United States)

Zeng, Meilan; Fu, Hongwei

2017-09-01

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

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

African Journals Online (AJOL)

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

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

International Nuclear Information System (INIS)

Shi, Jicong

1993-01-01

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

Polynomial fuzzy model-based approach for underactuated surface vessels

DEFF Research Database (Denmark)

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

2018-01-01

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

Connections between the matching and chromatic polynomials

Directory of Open Access Journals (Sweden)

E. J. Farrell

1992-01-01

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

On Generalisation of Polynomials in Complex Plane

Directory of Open Access Journals (Sweden)

Maslina Darus

2010-01-01

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

Technique for image interpolation using polynomial transforms

NARCIS (Netherlands)

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

1993-01-01

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

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

NARCIS (Netherlands)

Koornwinder, T.H.

2015-01-01

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

Complex Polynomial Vector Fields

DEFF Research Database (Denmark)

Dias, Kealey

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

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

African Journals Online (AJOL)

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

Study of the clinical utility and potential problems of quantitative phase analysis using multiple gated cardiac blood pool image

International Nuclear Information System (INIS)

Tabuchi, Hiromi

1987-01-01

The temporal Fourier fitting at the fundamental frequency (Fourier analysis) and the Chebyshev polynomials for order 9 (Chebyshev analysis) were performed in 24 patients with myocardial infarction (MI) and 10 normal subjects. Fourier analysis showed a significantly delayed regional phase values (RPV), only when corrected in R-R interval, in the MI group. In both Fourier and Chebyshev analyses, a significantly decreased regional ejection fraction was noted in the MI group. Regional ejection time calculated by Chebyshev analysis was significantly delayed as well in the MI group. Fourier and Chebyshev analyses were useful in early detecting and precisely analysing MI contraction abnormality, respectively, although the former method required the correction in R-R interval. The second series of Fourier analysis was made on 11 patients with right ventricular endocardial pacing (RVEP), 7 patients with left bundle branch block (LBBB), and 10 normal subjects. The LBBB group had markedly delayed RPV in the whole ventricular area. The RVEP group had initial contraction at the apex of right ventricle, with tendency for wave-like contraction spreading basal portions of both ventricles. Patients with type RS on QRS waves at pacing tended to have slight differences in RPV between the right and left ventricles. Fourier analysis was useful in evaluating ventricular contraction pattern in patients with miscellaneous cardiac diseases. (Namekawa, K.) 70 refs

Der Ritter mit dem Hemd : drei Fassungen einer mittelalterlichen Erzählung

OpenAIRE

Dunphy, Graeme

2011-01-01

Unter den zahlreichen Motiven, die in der mittelalterlichen Literatur mit Frauendienst verbunden sind, gehört das vom Ritter mit dem Hemd zu den besonders interessanten. Es erscheint zunächst in dem ersten von fünf Fabliaux aus einer verlorenen Turiner Handschrift, die dem sonst unbekannten altfranzösischen Dichter Jacques de Baisieux zugeschrieben werden, einer heiteren Kurzgeschichte mit dem Titel "Des trois chevaliers et del chainse". In der vorliegenden Untersuchung gilt es, der Frage der...

Discriminants and functional equations for polynomials orthogonal on the unit circle

International Nuclear Information System (INIS)

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

2000-01-01

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

Contributions to fuzzy polynomial techniques for stability analysis and control

OpenAIRE

Pitarch Pérez, José Luis

2014-01-01

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

Numerical integration subprogrammes in Fortran II-D

Energy Technology Data Exchange (ETDEWEB)

Fry, C. R.

1966-12-15

This note briefly describes some integration subprogrammes written in FORTRAN II-D for the IBM 1620-II at CARDE. These presented are two Newton-Cotes, Chebyshev polynomial summation, Filon's, Nordsieck's and optimum Runge-Kutta and predictor-corrector methods. A few miscellaneous numerical integration procedures are also mentioned covering statistical functions, oscillating integrands and functions occurring in electrical engineering.

Fitting the IRI F2-profile function to measured profiles

International Nuclear Information System (INIS)

Reinisch, B.W.; Huang Xueqin

1997-01-01

Comparison with profile data from ionosondes shows that the IRI bottomside F2-profiles can be improved by using better B0 and B1 parameters. The best parameters (in a least-squares sense) can be easily calculated in a numerical procedure from measured profiles presented as a sum of Chebyshev polynomials. 7 refs, 5 figs, 1 tab

New angular quadrature sets: effect on the conditioning number of the LTSN two dimensional transport matrix

International Nuclear Information System (INIS)

Hauser, Eliete Biasotto; Romero, Debora Angrizano

2009-01-01

The main objective of this work is to utilize a new angular quadrature sets based on Legendre and Chebyshev polynomials, and to analyse their effects on the number of LTS N matrix conditioning for the problem of discrete coordinates of neutron transport with two dimension cartesian geometry with isotropic scattering, and an energy group, in non multiplicative homogenous domains

On the Lorentz degree of a product of polynomials

KAUST Repository

Ait-Haddou, Rachid

2015-01-01

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

Strong result for real zeros of random algebraic polynomials

Directory of Open Access Journals (Sweden)

T. Uno

2001-01-01

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

Large degree asymptotics of generalized Bessel polynomials

NARCIS (Netherlands)

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

2011-01-01

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

Uncertainty of soil erosion modelling using open source high resolution and aggregated DEMs

Directory of Open Access Journals (Sweden)

Arun Mondal

2017-05-01

Full Text Available Digital Elevation Model (DEM is one of the important parameters for soil erosion assessment. Notable uncertainties are observed in this study while using three high resolution open source DEMs. The Revised Universal Soil Loss Equation (RUSLE model has been applied to analysis the assessment of soil erosion uncertainty using open source DEMs (SRTM, ASTER and CARTOSAT and their increasing grid space (pixel size from the actual. The study area is a part of the Narmada river basin in Madhya Pradesh state, which is located in the central part of India and the area covered 20,558 km2. The actual resolution of DEMs is 30 m and their increasing grid spaces are taken as 90, 150, 210, 270 and 330 m for this study. Vertical accuracy of DEMs has been assessed using actual heights of the sample points that have been taken considering planimetric survey based map (toposheet. Elevations of DEMs are converted to the same vertical datum from WGS 84 to MSL (Mean Sea Level, before the accuracy assessment and modelling. Results indicate that the accuracy of the SRTM DEM with the RMSE of 13.31, 14.51, and 18.19 m in 30, 150 and 330 m resolution respectively, is better than the ASTER and the CARTOSAT DEMs. When the grid space of the DEMs increases, the accuracy of the elevation and calculated soil erosion decreases. This study presents a potential uncertainty introduced by open source high resolution DEMs in the accuracy of the soil erosion assessment models. The research provides an analysis of errors in selecting DEMs using the original and increased grid space for soil erosion modelling.

Linear operator pencils on Lie algebras and Laurent biorthogonal polynomials

International Nuclear Information System (INIS)

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

2004-01-01

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

Dementia-free life expectancy (demFLE) in the Netherlands

NARCIS (Netherlands)

Perenboom, R.J.M.; Boshuizen, H.C.; Breteler, M.M.B.; Alewijn, O.; Water, H.P.A. van de

1996-01-01

To gain an insight into the burden of dementia in an aging society, life expectancy with dementia and its counterpart dementia-free life expectancy (DemFLE) in The Netherlands are presented. Sullivan's method was used to calculate DemFLE. For elderly living either independently or in homes for the

[Julia Rosche. Zwischen den Fronten. Die Rolle Estlands zwischen dem Hitler-Stalin-Pakt und dem Ende des Zweiten Weltkriegs im internationalen Kontext] / Olaf Mertelsmann

Index Scriptorium Estoniae

Mertelsmann, Olaf, 1969-

2014-01-01

Arvustus: Rosche, Julia. Zwischen den Fronten. Die Rolle Estlands zwischen dem Hitler-Stalin-Pakt und dem Ende des Zweiten Weltkriegs im internationalen Kontext. Diplomica Verlag. Hamburg 2012. Unter demselben Titel mit identischem Text auch: Grin Verlag. München 2013

Higher order branching of periodic orbits from polynomial isochrones

Directory of Open Access Journals (Sweden)

B. Toni

1999-09-01

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

Numerical Simulation of One-Dimensional Fractional Nonsteady Heat Transfer Model Based on the Second Kind Chebyshev Wavelet

Directory of Open Access Journals (Sweden)

Fuqiang Zhao

2017-01-01

Full Text Available In the current study, a numerical technique for solving one-dimensional fractional nonsteady heat transfer model is presented. We construct the second kind Chebyshev wavelet and then derive the operational matrix of fractional-order integration. The operational matrix of fractional-order integration is utilized to reduce the original problem to a system of linear algebraic equations, and then the numerical solutions obtained by our method are compared with those obtained by CAS wavelet method. Lastly, illustrated examples are included to demonstrate the validity and applicability of the technique.

On the estimation of the degree of regression polynomial

International Nuclear Information System (INIS)

Toeroek, Cs.

1997-01-01

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

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

Directory of Open Access Journals (Sweden)

Sezgin Sucu

2012-01-01

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

On associated polynomials and decay rates for birth-death processes

NARCIS (Netherlands)

van Doorn, Erik A.

2001-01-01

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

On associated polynomials and decay rates for birth-death processes

NARCIS (Netherlands)

van Doorn, Erik A.

2003-01-01

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

A bivariate Chebyshev spectral collocation quasilinearization method for nonlinear evolution parabolic equations.

Science.gov (United States)

Motsa, S S; Magagula, V M; Sibanda, P

2014-01-01

This paper presents a new method for solving higher order nonlinear evolution partial differential equations (NPDEs). The method combines quasilinearisation, the Chebyshev spectral collocation method, and bivariate Lagrange interpolation. In this paper, we use the method to solve several nonlinear evolution equations, such as the modified KdV-Burgers equation, highly nonlinear modified KdV equation, Fisher's equation, Burgers-Fisher equation, Burgers-Huxley equation, and the Fitzhugh-Nagumo equation. The results are compared with known exact analytical solutions from literature to confirm accuracy, convergence, and effectiveness of the method. There is congruence between the numerical results and the exact solutions to a high order of accuracy. Tables were generated to present the order of accuracy of the method; convergence graphs to verify convergence of the method and error graphs are presented to show the excellent agreement between the results from this study and the known results from literature.

A Bivariate Chebyshev Spectral Collocation Quasilinearization Method for Nonlinear Evolution Parabolic Equations

Directory of Open Access Journals (Sweden)

S. S. Motsa

2014-01-01

Full Text Available This paper presents a new method for solving higher order nonlinear evolution partial differential equations (NPDEs. The method combines quasilinearisation, the Chebyshev spectral collocation method, and bivariate Lagrange interpolation. In this paper, we use the method to solve several nonlinear evolution equations, such as the modified KdV-Burgers equation, highly nonlinear modified KdV equation, Fisher's equation, Burgers-Fisher equation, Burgers-Huxley equation, and the Fitzhugh-Nagumo equation. The results are compared with known exact analytical solutions from literature to confirm accuracy, convergence, and effectiveness of the method. There is congruence between the numerical results and the exact solutions to a high order of accuracy. Tables were generated to present the order of accuracy of the method; convergence graphs to verify convergence of the method and error graphs are presented to show the excellent agreement between the results from this study and the known results from literature.

Digital Elevation Model (DEM), The county-wide DEM is published with a 20-foot grid size, though we have a more detailed DEM/DTM for some parts of the county, particularly the Green Bay Metro area, Published in 2000, 1:4800 (1in=400ft) scale, Brown County Government.

Data.gov (United States)

NSGIC Local Govt | GIS Inventory — Digital Elevation Model (DEM) dataset current as of 2000. The county-wide DEM is published with a 20-foot grid size, though we have a more detailed DEM/DTM for some...

Some Polynomials Associated with the r-Whitney Numbers

Indian Academy of Sciences (India)

26

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

The Bessel polynomials and their differential operators

International Nuclear Information System (INIS)

Onyango Otieno, V.P.

1987-10-01

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

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

CERN Document Server

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

2014-01-01

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

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

African Journals Online (AJOL)

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

Dual exponential polynomials and linear differential equations

Science.gov (United States)

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

2018-01-01

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

Novel application of DEM to modelling comminution processes

International Nuclear Information System (INIS)

Delaney, Gary W; Cleary, Paul W; Sinnott, Matt D; Morrison, Rob D

2010-01-01

Comminution processes in which grains are broken down into smaller and smaller sizes represent a critical component in many industries including mineral processing, cement production, food processing and pharmaceuticals. We present a novel DEM implementation capable of realistically modelling such comminution processes. This extends on a previous implementation of DEM particle breakage that utilized spherical particles. Our new extension uses super-quadric particles, where daughter fragments with realistic size and shape distributions are packed inside a bounding parent super-quadric. We demonstrate the flexibility of our approach in different particle breakage scenarios and examine the effect of the chosen minimum resolved particle size. This incorporation of the effect of particle shape in the breakage process allows for more realistic DEM simulations to be performed, that can provide additional fundamental insights into comminution processes and into the behaviour of individual pieces of industrial machinery.

Generation and performance assessment of the global TanDEM-X digital elevation model

Science.gov (United States)

Rizzoli, Paola; Martone, Michele; Gonzalez, Carolina; Wecklich, Christopher; Borla Tridon, Daniela; Bräutigam, Benjamin; Bachmann, Markus; Schulze, Daniel; Fritz, Thomas; Huber, Martin; Wessel, Birgit; Krieger, Gerhard; Zink, Manfred; Moreira, Alberto

2017-10-01

The primary objective of the TanDEM-X mission is the generation of a global, consistent, and high-resolution digital elevation model (DEM) with unprecedented global accuracy. The goal is achieved by exploiting the interferometric capabilities of the two twin SAR satellites TerraSAR-X and TanDEM-X, which fly in a close orbit formation, acting as an X-band single-pass interferometer. Between December 2010 and early 2015 all land surfaces have been acquired at least twice, difficult terrain up to seven or eight times. The acquisition strategy, data processing, and DEM calibration and mosaicking have been systematically monitored and optimized throughout the entire mission duration, in order to fulfill the specification. The processing of all data has finally been completed in September 2016 and this paper reports on the final performance of the TanDEM-X global DEM and presents the acquisition and processing strategy which allowed to obtain the final DEM quality. The results confirm the outstanding global accuracy of the delivered product, which can be now utilized for both scientific and commercial applications.

Generalized Freud's equation and level densities with polynomial

Indian Academy of Sciences (India)

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

Boreal forest biomass classification with TanDEM-X

OpenAIRE

Torano Caicoya, Astor; Kugler, Florian; Papathanassiou, Kostas; Hajnsek, Irena

2013-01-01

High spatial resolution X-band interferometric SAR data from the TanDEM-X, in the operational DEM generation mode, are sensitive to forest structure and can therefore be used for thematic boreal forest classification of forest environments. The interferometric coherence in absence of temporal decorrelation depends strongly on forest height and structure. Due to the rather homogenous structure of boreal forest, forest biomass can be derived from forest height, on the basis of allometric equati...

Neues aus dem Forschungsfeld Deutsch als Zweitsprache. Sammelrezension

Directory of Open Access Journals (Sweden)

Claus Altmayer

2015-03-01

Full Text Available Neues aus dem Forschungsfeld Deutsch als Zweitsprache. Sammelrezension (Teil 2 von Bernt Ahrenholz (Hrsg. (2009, Empirische Befunde zu DaZ-Erwerb und Sprachförderung. Beiträge aus dem 3. ‚Workshop Kinder mit Migrationshintergrund‘; Karen Schramm & Christoph Schröder (Hrsg. (2009, Empirische Zugänge zu Spracherwerb und Sprachförderung in Deutsch als Zweitsprache; Stefan Jeuk (2010, Deutsch als Zweitsprache in der Schule. Grundlagen - Diagnose – Förderung

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

Science.gov (United States)

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

2012-10-01

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

Modelling above Ground Biomass in Tanzanian Miombo Woodlands Using TanDEM-X WorldDEM and Field Data

Directory of Open Access Journals (Sweden)

Stefano Puliti

2017-09-01

Full Text Available The use of Interferometric Synthetic Aperture Radar (InSAR data has great potential for monitoring large scale forest above ground biomass (AGB in the tropics due to the increased ability to retrieve 3D information even under cloud cover. To date; results in tropical forests have been inconsistent and further knowledge on the accuracy of models linking AGB and InSAR height data is crucial for the development of large scale forest monitoring programs. This study provides an example of the use of TanDEM-X WorldDEM data to model AGB in Tanzanian woodlands. The primary objective was to assess the accuracy of a model linking AGB with InSAR height from WorldDEM after the subtraction of ground heights. The secondary objective was to assess the possibility of obtaining InSAR height for field plots when the terrain heights were derived from global navigation satellite systems (GNSS; i.e., as an alternative to using airborne laser scanning (ALS. The results revealed that the AGB model using InSAR height had a predictive accuracy of R M S E = 24.1 t·ha−1; or 38.8% of the mean AGB when terrain heights were derived from ALS. The results were similar when using terrain heights from GNSS. The accuracy of the predicted AGB was improved when compared to a previous study using TanDEM-X for a sub-area of the area of interest and was of similar magnitude to what was achieved in the same sub-area using ALS data. Overall; this study sheds new light on the opportunities that arise from the use of InSAR data for large scale AGB modelling in tropical woodlands.

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

Science.gov (United States)

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

2015-10-01

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

An overview on polynomial approximation of NP-hard problems

Directory of Open Access Journals (Sweden)

Paschos Vangelis Th.

2009-01-01

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

ArcticDEM Year 3; Improving Coverage, Repetition and Resolution

Science.gov (United States)

Morin, P. J.; Porter, C. C.; Cloutier, M.; Howat, I.; Noh, M. J.; Willis, M. J.; Candela, S. G.; Bauer, G.; Kramer, W.; Bates, B.; Williamson, C.

2017-12-01

Surface topography is among the most fundamental data sets for geosciences, essential for disciplines ranging from glaciology to geodynamics. The ArcticDEM project is using sub-meter, commercial imagery licensed by the National Geospatial-Intelligence Agency, petascale computing, and open source photogrammetry software to produce a time-tagged 2m posting elevation model and a 5m posting mosaic of the entire Arctic region. As ArcticDEM enters its third year, the region has gone from having some of the sparsest and poorest elevation data to some of the most precise and complete data of any region on the globe. To date, we have produced and released over 80,000,000 km2 as 57,000 - 2m posting, time-stamped DEMs. The Arctic, on average, is covered four times though there are hotspots with more than 100 DEMs. In addition, the version 1 release includes a 5m posting mosaic covering the entire 20,000,000 km2 region. All products are publically available through arctidem.org, ESRI web services, and a web viewer. The final year of the project will consist of a complete refiltering of clouds/water and re-mosaicing of all elevation data. Since inception of the project, post-processing techniques have improved significantly, resulting in fewer voids, better registration, sharper coastlines, and fewer inaccuracies due to clouds. All ArcticDEM data will be released in 2018. Data, documentation, web services and web viewer are available at arcticdem.org

Constructing general partial differential equations using polynomial and neural networks.

Science.gov (United States)

Zjavka, Ladislav; Pedrycz, Witold

2016-01-01

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

A note on the zeros of Freud-Sobolev orthogonal polynomials

Science.gov (United States)

Moreno-Balcazar, Juan J.

2007-10-01

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

About the solvability of matrix polynomial equations

OpenAIRE

Netzer, Tim; Thom, Andreas

2016-01-01

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

OPEN-SOURCE DIGITAL ELEVATION MODEL (DEMs EVALUATION WITH GPS AND LiDAR DATA

Directory of Open Access Journals (Sweden)

N. F. Khalid

2016-09-01

Full Text Available Advanced Spaceborne Thermal Emission and Reflection Radiometer-Global Digital Elevation Model (ASTER GDEM, Shuttle Radar Topography Mission (SRTM, and Global Multi-resolution Terrain Elevation Data 2010 (GMTED2010 are freely available Digital Elevation Model (DEM datasets for environmental modeling and studies. The quality of spatial resolution and vertical accuracy of the DEM data source has a great influence particularly on the accuracy specifically for inundation mapping. Most of the coastal inundation risk studies used the publicly available DEM to estimated the coastal inundation and associated damaged especially to human population based on the increment of sea level. In this study, the comparison between ground truth data from Global Positioning System (GPS observation and DEM is done to evaluate the accuracy of each DEM. The vertical accuracy of SRTM shows better result against ASTER and GMTED10 with an RMSE of 6.054 m. On top of the accuracy, the correlation of DEM is identified with the high determination of coefficient of 0.912 for SRTM. For coastal zone area, DEMs based on airborne light detection and ranging (LiDAR dataset was used as ground truth data relating to terrain height. In this case, the LiDAR DEM is compared against the new SRTM DEM after applying the scale factor. From the findings, the accuracy of the new DEM model from SRTM can be improved by applying scale factor. The result clearly shows that the value of RMSE exhibit slightly different when it reached 0.503 m. Hence, this new model is the most suitable and meets the accuracy requirement for coastal inundation risk assessment using open source data. The suitability of these datasets for further analysis on coastal management studies is vital to assess the potentially vulnerable areas caused by coastal inundation.

Two polynomial representations of experimental design

OpenAIRE

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

2007-01-01

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

Stable piecewise polynomial vector fields

Directory of Open Access Journals (Sweden)

Claudio Pessoa

2012-09-01

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

Impacts of DEM resolution and area threshold value uncertainty on ...

African Journals Online (AJOL)

... that DEM resolution influences the selected flow accumulation threshold value; the suitable flow accumulation threshold value increases as the DEM resolution increases, and shows greater variability for basins with lower drainage densities. The link between drainage area threshold value and stream network extraction ...

q-Bernoulli numbers and q-Bernoulli polynomials revisited

Directory of Open Access Journals (Sweden)

Kim Taekyun

2011-01-01

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

Computing Galois Groups of Eisenstein Polynomials Over P-adic Fields

Science.gov (United States)

Milstead, Jonathan

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

Fast beampattern evaluation by polynomial rooting

Science.gov (United States)

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

2011-07-01

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

Guts of surfaces and the colored Jones polynomial

CERN Document Server

Futer, David; Purcell, Jessica

2013-01-01

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

Computing Tutte polynomials of contact networks in classrooms

Science.gov (United States)

Hincapié, Doracelly; Ospina, Juan

2013-05-01

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

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

Directory of Open Access Journals (Sweden)

Bangyong Sun

2014-01-01

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

Exponential time paradigms through the polynomial time lens

NARCIS (Netherlands)

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

2016-01-01

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

Symmetries of the 2D magnetic particle imaging system matrix

International Nuclear Information System (INIS)

Weber, A; Knopp, T

2015-01-01

In magnetic particle imaging (MPI), the relation between the particle distribution and the measurement signal can be described by a linear system of equations. For 1D imaging, it can be shown that the system matrix can be expressed as a product of a convolution matrix and a Chebyshev transformation matrix. For multidimensional imaging, the structure of the MPI system matrix is not yet fully explored as the sampling trajectory complicates the physical model. It has been experimentally found that the MPI system matrix rows have symmetries and look similar to the tensor products of Chebyshev polynomials. In this work we will mathematically prove that the 2D MPI system matrix has symmetries that can be used for matrix compression. (paper)

Root and Critical Point Behaviors of Certain Sums of Polynomials

Indian Academy of Sciences (India)

13

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

The chromatic polynomial and list colorings

DEFF Research Database (Denmark)

Thomassen, Carsten

2009-01-01

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

BSDEs with polynomial growth generators

Directory of Open Access Journals (Sweden)

Philippe Briand

2000-01-01

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

Volcanic geomorphology using TanDEM-X

Science.gov (United States)

Poland, Michael; Kubanek, Julia

2016-04-01

Topography is perhaps the most fundamental dataset for any volcano, yet is surprisingly difficult to collect, especially during the course of an eruption. For example, photogrammetry and lidar are time-intensive and often expensive, and they cannot be employed when the surface is obscured by clouds. Ground-based surveys can operate in poor weather but have poor spatial resolution and may expose personnel to hazardous conditions. Repeat passes of synthetic aperture radar (SAR) data provide excellent spatial resolution, but topography in areas of surface change (from vegetation swaying in the wind to physical changes in the landscape) between radar passes cannot be imaged. The German Space Agency's TanDEM-X satellite system, however, solves this issue by simultaneously acquiring SAR data of the surface using a pair of orbiting satellites, thereby removing temporal change as a complicating factor in SAR-based topographic mapping. TanDEM-X measurements have demonstrated exceptional value in mapping the topography of volcanic environments in as-yet limited applications. The data provide excellent resolution (down to ~3-m pixel size) and are useful for updating topographic data at volcanoes where surface change has occurred since the most recent topographic dataset was collected. Such data can be used for applications ranging from correcting radar interferograms for topography, to modeling flow pathways in support of hazards mitigation. The most valuable contributions, however, relate to calculating volume changes related to eruptive activity. For example, limited datasets have provided critical measurements of lava dome growth and collapse at volcanoes including Merapi (Indonesia), Colima (Mexico), and Soufriere Hills (Montserrat), and of basaltic lava flow emplacement at Tolbachik (Kamchatka), Etna (Italy), and Kīlauea (Hawai`i). With topographic data spanning an eruption, it is possible to calculate eruption rates - information that might not otherwise be available

Chebyshev-Taylor Parameterization of Stable/Unstable Manifolds for Periodic Orbits: Implementation and Applications

Science.gov (United States)

Mireles James, J. D.; Murray, Maxime

2017-12-01

This paper develops a Chebyshev-Taylor spectral method for studying stable/unstable manifolds attached to periodic solutions of differential equations. The work exploits the parameterization method — a general functional analytic framework for studying invariant manifolds. Useful features of the parameterization method include the fact that it can follow folds in the embedding, recovers the dynamics on the manifold through a simple conjugacy, and admits a natural notion of a posteriori error analysis. Our approach begins by deriving a recursive system of linear differential equations describing the Taylor coefficients of the invariant manifold. We represent periodic solutions of these equations as solutions of coupled systems of boundary value problems. We discuss the implementation and performance of the method for the Lorenz system, and for the planar circular restricted three- and four-body problems. We also illustrate the use of the method as a tool for computing cycle-to-cycle connecting orbits.

Polynomial chaos functions and stochastic differential equations

International Nuclear Information System (INIS)

Williams, M.M.R.

2006-01-01

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

Minimal residual method stronger than polynomial preconditioning

Energy Technology Data Exchange (ETDEWEB)

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

1994-12-31

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

Bernoulli numbers and polynomials from a more general point of view

International Nuclear Information System (INIS)

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

2000-01-01

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

Generalizations of an integral for Legendre polynomials by Persson and Strang

NARCIS (Netherlands)

Diekema, E.; Koornwinder, T.H.

2012-01-01

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

Influence of Terraced area DEM Resolution on RUSLE LS Factor

Science.gov (United States)

Zhang, Hongming; Baartman, Jantiene E. M.; Yang, Xiaomei; Gai, Lingtong; Geissen, Viollette

2017-04-01

Topography has a large impact on the erosion of soil by water. Slope steepness and slope length are combined (the LS factor) in the universal soil-loss equation (USLE) and its revised version (RUSLE) for predicting soil erosion. The LS factor is usually extracted from a digital elevation model (DEM). The grid size of the DEM will thus influence the LS factor and the subsequent calculation of soil loss. Terracing is considered as a support practice factor (P) in the USLE/RUSLE equations, which is multiplied with the other USLE/RUSLE factors. However, as terraces change the slope length and steepness, they also affect the LS factor. The effect of DEM grid size on the LS factor has not been investigated for a terraced area. We obtained a high-resolution DEM by unmanned aerial vehicles (UAVs) photogrammetry, from which the slope steepness, slope length, and LS factor were extracted. The changes in these parameters at various DEM resolutions were then analysed. The DEM produced detailed LS-factor maps, particularly for low LS factors. High (small valleys, gullies, and terrace ridges) and low (flats and terrace fields) spatial frequencies were both sensitive to changes in resolution, so the areas of higher and lower slope steepness both decreased with increasing grid size. Average slope steepness decreased and average slope length increased with grid size. Slope length, however, had a larger effect than slope steepness on the LS factor as the grid size varied. The LS factor increased when the grid size increased from 0.5 to 30-m and increased significantly at grid sizes >5-m. The LS factor was increasingly overestimated as grid size decreased. The LS factor decreased from grid sizes of 30 to 100-m, because the details of the terraced terrain were gradually lost, but the factor was still overestimated.

Uncertainty of SWAT model at different DEM resolutions in a large mountainous watershed.

Science.gov (United States)

Zhang, Peipei; Liu, Ruimin; Bao, Yimeng; Wang, Jiawei; Yu, Wenwen; Shen, Zhenyao

2014-04-15

The objective of this study was to enhance understanding of the sensitivity of the SWAT model to the resolutions of Digital Elevation Models (DEMs) based on the analysis of multiple evaluation indicators. The Xiangxi River, a large tributary of Three Gorges Reservoir in China, was selected as the study area. A range of 17 DEM spatial resolutions, from 30 to 1000 m, was examined, and the annual and monthly model outputs based on each resolution were compared. The following results were obtained: (i) sediment yield was greatly affected by DEM resolution; (ii) the prediction of dissolved oxygen load was significantly affected by DEM resolutions coarser than 500 m; (iii) Total Nitrogen (TN) load was not greatly affected by the DEM resolution; (iv) Nitrate Nitrogen (NO₃-N) and Total Phosphorus (TP) loads were slightly affected by the DEM resolution; and (v) flow and Ammonia Nitrogen (NH₄-N) load were essentially unaffected by the DEM resolution. The flow and dissolved oxygen load decreased more significantly in the dry season than in the wet and normal seasons. Excluding flow and dissolved oxygen, the uncertainties of the other Hydrology/Non-point Source (H/NPS) pollution indicators were greater in the wet season than in the dry and normal seasons. Considering the temporal distribution uncertainties, the optimal DEM resolutions for flow was 30-200 m, for sediment and TP was 30-100 m, for dissolved oxygen and NO₃-N was 30-300 m, for NH₄-N was 30 to 70 m and for TN was 30-150 m. Copyright © 2014 Elsevier Ltd. All rights reserved.

Eye aberration analysis with Zernike polynomials

Science.gov (United States)

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

1998-06-01

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

Animating Nested Taylor Polynomials to Approximate a Function

Science.gov (United States)

Mazzone, Eric F.; Piper, Bruce R.

2010-01-01

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

Learning Read-constant Polynomials of Constant Degree modulo Composites

DEFF Research Database (Denmark)

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

2011-01-01

Boolean functions that have constant degree polynomial representation over a fixed finite ring form a natural and strict subclass of the complexity class \\textACC0ACC0. They are also precisely the functions computable efficiently by programs over fixed and finite nilpotent groups. This class...... is not known to be learnable in any reasonable learning model. In this paper, we provide a deterministic polynomial time algorithm for learning Boolean functions represented by polynomials of constant degree over arbitrary finite rings from membership queries, with the additional constraint that each variable...

Spatial Characterization of Landscapes through Multifractal Analysis of DEM

Directory of Open Access Journals (Sweden)

P. L. Aguado

2014-01-01

Full Text Available Landscape evolution is driven by abiotic, biotic, and anthropic factors. The interactions among these factors and their influence at different scales create a complex dynamic. Landscapes have been shown to exhibit numerous scaling laws, from Horton’s laws to more sophisticated scaling of heights in topography and river network topology. This scaling and multiscaling analysis has the potential to characterise the landscape in terms of the statistical signature of the measure selected. The study zone is a matrix obtained from a digital elevation model (DEM (map 10 × 10 m, and height 1 m that corresponds to homogeneous region with respect to soil characteristics and climatology known as “Monte El Pardo” although the water level of a reservoir and the topography play a main role on its organization and evolution. We have investigated whether the multifractal analysis of a DEM shows common features that can be used to reveal the underlying patterns and information associated with the landscape of the DEM mapping and studied the influence of the water level of the reservoir on the applied analysis. The results show that the use of the multifractal approach with mean absolute gradient data is a useful tool for analysing the topography represented by the DEM.

Artificial terraced field extraction based on high resolution DEMs

Science.gov (United States)

Na, Jiaming; Yang, Xin; Xiong, Liyang; Tang, Guoan

2017-04-01

With the increase of human activities, artificial landforms become one of the main terrain features with special geographical and hydrological value. Terraced field, as the most important artificial landscapes of the loess plateau, plays an important role in conserving soil and water. With the development of digital terrain analysis (DTA), there is a current and future need in developing a robust, repeatable and cost-effective research methodology for terraced fields. In this paper, a novel method using bidirectional DEM shaded relief is proposed for terraced field identification based on high resolution DEM, taking Zhifanggou watershed, Shannxi province as the study area. Firstly, 1m DEM is obtained by low altitude aerial photogrammetry using Unmanned Aerial Vehicle (UAV), and 0.1m DOM is also obtained as the test data. Then, the positive and negative terrain segmentation is done to acquire the area of terraced field. Finally, a bidirectional DEM shaded relief is simulated to extract the ridges of each terraced field stages. The method in this paper can get not only polygon feature of the terraced field areas but also line feature of terraced field ridges. The accuracy is 89.7% compared with the artificial interpretation result from DOM. And additional experiment shows that this method has a strong robustness as well as high accuracy.

DEM-based research on the landform features of China

Science.gov (United States)

Tang, Guoan; Liu, Aili; Li, Fayuan; Zhou, Jieyu

2006-10-01

Landforms can be described and identified by parameterization of digital elevation model (DEM). This paper discusses the large-scale geomorphological characteristics of China based on numerical analysis of terrain parameters and develop a methodology for characterizing landforms from DEMs. The methodology is implemented as a two-step process. First, terrain variables are derived from a 1-km DEM in a given statistical unit including local relief, the earth's surface incision, elevation variance coefficient, roughness, mean slope and mean elevation. Second, every parameter regarded as a single-band image is combined into a multi-band image. Then ISODATA unsupervised classification and the Bayesian technique of Maximum Likelihood supervised classification are applied for landform classification. The resulting landforms are evaluated by the means of Stratified Sampling with respect to an existing map and the overall classification accuracy reaches to rather high value. It's shown that the derived parameters carry sufficient physiographic information and can be used for landform classification. Since the classification method integrates manifold terrain indexes, conquers the limitation of the subjective cognition, as well as a low cost, apparently it could represent an applied foreground in the classification of macroscopic relief forms. Furthermore, it exhibits significance in consummating the theory and the methodology of DEMs on digital terrain analysis.

Accuracy assessment of the global TanDEM-X Digital Elevation Model with GPS data

Science.gov (United States)

Wessel, Birgit; Huber, Martin; Wohlfart, Christian; Marschalk, Ursula; Kosmann, Detlev; Roth, Achim

2018-05-01

The primary goal of the German TanDEM-X mission is the generation of a highly accurate and global Digital Elevation Model (DEM) with global accuracies of at least 10 m absolute height error (linear 90% error). The global TanDEM-X DEM acquired with single-pass SAR interferometry was finished in September 2016. This paper provides a unique accuracy assessment of the final TanDEM-X global DEM using two different GPS point reference data sets, which are distributed across all continents, to fully characterize the absolute height error. Firstly, the absolute vertical accuracy is examined by about three million globally distributed kinematic GPS (KGPS) points derived from 19 KGPS tracks covering a total length of about 66,000 km. Secondly, a comparison is performed with more than 23,000 "GPS on Bench Marks" (GPS-on-BM) points provided by the US National Geodetic Survey (NGS) scattered across 14 different land cover types of the US National Land Cover Data base (NLCD). Both GPS comparisons prove an absolute vertical mean error of TanDEM-X DEM smaller than ±0.20 m, a Root Means Square Error (RMSE) smaller than 1.4 m and an excellent absolute 90% linear height error below 2 m. The RMSE values are sensitive to land cover types. For low vegetation the RMSE is ±1.1 m, whereas it is slightly higher for developed areas (±1.4 m) and for forests (±1.8 m). This validation confirms an outstanding absolute height error at 90% confidence level of the global TanDEM-X DEM outperforming the requirement by a factor of five. Due to its extensive and globally distributed reference data sets, this study is of considerable interests for scientific and commercial applications.

Complex centers of polynomial differential equations

Directory of Open Access Journals (Sweden)

Mohamad Ali M. Alwash

2007-07-01

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

Differential recurrence formulae for orthogonal polynomials

Directory of Open Access Journals (Sweden)

Anton L. W. von Bachhaus

1995-11-01

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

DEM Resolution Impact on the Estimation of the Physical Characteristics of Watersheds by Using SWAT

Directory of Open Access Journals (Sweden)

Waranyu Buakhao

2016-01-01

Full Text Available A digital elevation model (DEM is an important spatial input for automatic extraction of topographic parameters for the soil and water assessment tool (SWAT. The objective of this study was to investigate the impact of DEM resolution (from 5 to 90 m on the delineation process of a SWAT model with two types of watershed characteristics (flat area and mountain area and three sizes of watershed area (about 20,000, 200,000, and 1,500,000 hectares. The results showed that the total lengths of the streamline, main channel slope, watershed area, and area slope were significantly different when using the DEM datasets to delineate. Delineation using the SRTM DEM (90 m, ASTER DEM (30 m, and LDD DEM (5 m for all watershed characteristics showed that the watershed sizes and shapes obtained were only slightly different, whereas the area slopes obtained were significantly different. The total lengths of the generated streams increased when the resolution of the DEM used was higher. The stream slopes obtained using the small area sizes were insignificant, whereas the slopes obtained using the large area sizes were significantly different. This suggests that water resource model users should use the ASTER DEM as opposed to a finer resolution DEM for model input to save time for the model calibration and validation.

Considering a non-polynomial basis for local kernel regression problem

Science.gov (United States)

Silalahi, Divo Dharma; Midi, Habshah

2017-01-01

A common used as solution for local kernel nonparametric regression problem is given using polynomial regression. In this study, we demonstrated the estimator and properties using maximum likelihood estimator for a non-polynomial basis such B-spline to replacing the polynomial basis. This estimator allows for flexibility in the selection of a bandwidth and a knot. The best estimator was selected by finding an optimal bandwidth and knot through minimizing the famous generalized validation function.

Open Problems Related to the Hurwitz Stability of Polynomials Segments

Directory of Open Access Journals (Sweden)

Baltazar Aguirre-Hernández

2018-01-01

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

Dem Generation from Close-Range Photogrammetry Using Extended Python Photogrammetry Toolbox

Science.gov (United States)

Belmonte, A. A.; Biong, M. M. P.; Macatulad, E. G.

2017-10-01

Digital elevation models (DEMs) are widely used raster data for different applications concerning terrain, such as for flood modelling, viewshed analysis, mining, land development, engineering design projects, to name a few. DEMs can be obtained through various methods, including topographic survey, LiDAR or photogrammetry, and internet sources. Terrestrial close-range photogrammetry is one of the alternative methods to produce DEMs through the processing of images using photogrammetry software. There are already powerful photogrammetry software that are commercially-available and can produce high-accuracy DEMs. However, this entails corresponding cost. Although, some of these software have free or demo trials, these trials have limits in their usable features and usage time. One alternative is the use of free and open-source software (FOSS), such as the Python Photogrammetry Toolbox (PPT), which provides an interface for performing photogrammetric processes implemented through python script. For relatively small areas such as in mining or construction excavation, a relatively inexpensive, fast and accurate method would be advantageous. In this study, PPT was used to generate 3D point cloud data from images of an open pit excavation. The PPT was extended to add an algorithm converting the generated point cloud data into a usable DEM.

The role of DEM at CERN

CERN Document Server

Van der Bij, E

2005-01-01

The DEM group in the Technical Support department provides services for the fabrication of special printed circuits that are invaluable for the whole particle physics community. The capability is based around a core technology that is developed by using skills to etch and process materials that are not commonly used in industry, combined with production methods used in PCB manufacturing. The role of the prototyping facilities is to assist engineers and physicists and to offer them easy access to competencies often not available from industry. At the same time, with the expertise and production capacity available, it makes that CERN is always geared up to handle emergency situations. The design office and the assembly workshop that are also part of DEM have similar roles that lower the cost and improve the quality and maintainability of electronics developed at CERN.

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

International Nuclear Information System (INIS)

Scullard, Christian R

2012-01-01

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

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

Science.gov (United States)

Rahman, Nurhakimah Ab.; Abdullah, Lazim

2014-07-01

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

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

DEFF Research Database (Denmark)

Arvesú, J.; Esposito, Chiara

2012-01-01

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

Developmental Eye Movement (DEM Test Norms for Mandarin Chinese-Speaking Chinese Children.

Directory of Open Access Journals (Sweden)

Yachun Xie

Full Text Available The Developmental Eye Movement (DEM test is commonly used as a clinical visual-verbal ocular motor assessment tool to screen and diagnose reading problems at the onset. No established norm exists for using the DEM test with Mandarin Chinese-speaking Chinese children. This study aims to establish the normative values of the DEM test for the Mandarin Chinese-speaking population in China; it also aims to compare the values with three other published norms for English-, Spanish-, and Cantonese-speaking Chinese children. A random stratified sampling method was used to recruit children from eight kindergartens and eight primary schools in the main urban and suburban areas of Nanjing. A total of 1,425 Mandarin Chinese-speaking children aged 5 to 12 years took the DEM test in Mandarin Chinese. A digital recorder was used to record the process. All of the subjects completed a symptomatology survey, and their DEM scores were determined by a trained tester. The scores were computed using the formula in the DEM manual, except that the "vertical scores" were adjusted by taking the vertical errors into consideration. The results were compared with the three other published norms. In our subjects, a general decrease with age was observed for the four eye movement indexes: vertical score, adjusted horizontal score, ratio, and total error. For both the vertical and adjusted horizontal scores, the Mandarin Chinese-speaking children completed the tests much more quickly than the norms for English- and Spanish-speaking children. However, the same group completed the test slightly more slowly than the norms for Cantonese-speaking children. The differences in the means were significant (P0.05; compared with Spanish-speaking children, the scores were statistically significant (P0.05. DEM norms may be affected by differences in language, cultural, and educational systems among various ethnicities. The norms of the DEM test are proposed for use with Mandarin Chinese

On the Lorentz degree of a product of polynomials

KAUST Repository

Ait-Haddou, Rachid

2015-01-01

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

Generalized Freud's equation and level densities with polynomial potential

Science.gov (United States)

Boobna, Akshat; Ghosh, Saugata

2013-08-01

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

H∞ Control of Polynomial Fuzzy Systems: A Sum of Squares Approach

Directory of Open Access Journals (Sweden)

Bomo W. Sanjaya

2014-07-01

Full Text Available This paper proposes the control design ofa nonlinear polynomial fuzzy system with H∞ performance objective using a sum of squares (SOS approach. Fuzzy model and controller are represented by a polynomial fuzzy model and controller. The design condition is obtained by using polynomial Lyapunov functions that not only guarantee stability but also satisfy the H∞ performance objective. The design condition is represented in terms of an SOS that can be numerically solved via the SOSTOOLS. A simulation study is presented to show the effectiveness of the SOS-based H∞ control designfor nonlinear polynomial fuzzy systems.

Zeros and logarithmic asymptotics of Sobolev orthogonal polynomials for exponential weights

Science.gov (United States)

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

2009-12-01

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

Some Results on the Independence Polynomial of Unicyclic Graphs

Directory of Open Access Journals (Sweden)

Oboudi Mohammad Reza

2018-05-01

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

High-Accuracy Tidal Flat Digital Elevation Model Construction Using TanDEM-X Science Phase Data

Science.gov (United States)

Lee, Seung-Kuk; Ryu, Joo-Hyung

2017-01-01

This study explored the feasibility of using TanDEM-X (TDX) interferometric observations of tidal flats for digital elevation model (DEM) construction. Our goal was to generate high-precision DEMs in tidal flat areas, because accurate intertidal zone data are essential for monitoring coastal environment sand erosion processes. To monitor dynamic coastal changes caused by waves, currents, and tides, very accurate DEMs with high spatial resolution are required. The bi- and monostatic modes of the TDX interferometer employed during the TDX science phase provided a great opportunity for highly accurate intertidal DEM construction using radar interferometry with no time lag (bistatic mode) or an approximately 10-s temporal baseline (monostatic mode) between the master and slave synthetic aperture radar image acquisitions. In this study, DEM construction in tidal flat areas was first optimized based on the TDX system parameters used in various TDX modes. We successfully generated intertidal zone DEMs with 57-m spatial resolutions and interferometric height accuracies better than 0.15 m for three representative tidal flats on the west coast of the Korean Peninsula. Finally, we validated these TDX DEMs against real-time kinematic-GPS measurements acquired in two tidal flat areas; the correlation coefficient was 0.97 with a root mean square error of 0.20 m.

Analysis the Accuracy of Digital Elevation Model (DEM) for Flood Modelling on Lowland Area

Science.gov (United States)

Zainol Abidin, Ku Hasna Zainurin Ku; Razi, Mohd Adib Mohammad; Bukari, Saifullizan Mohd

2018-04-01

Flood is one type of natural disaster that occurs almost every year in Malaysia. Commonly the lowland areas are the worst affected areas. This kind of disaster is controllable by using an accurate data for proposing any kinds of solutions. Elevation data is one of the data used to produce solutions for flooding. Currently, the research about the application of Digital Elevation Model (DEM) in hydrology was increased where this kind of model will identify the elevation for required areas. University of Tun Hussein Onn Malaysia is one of the lowland areas which facing flood problems on 2006. Therefore, this area was chosen in order to produce DEM which focussed on University Health Centre (PKU) and drainage area around Civil and Environment Faculty (FKAAS). Unmanned Aerial Vehicle used to collect aerial photos data then undergoes a process of generating DEM according to three types of accuracy and quality from Agisoft PhotoScan software. The higher the level of accuracy and quality of DEM produced, the longer time taken to generate a DEM. The reading of the errors created while producing the DEM shows almost 0.01 different. Therefore, it has been identified there are some important parameters which influenced the accuracy of DEM.

Eröffnung des „Hauses der Astronomie“ auf dem Königsstuhl

OpenAIRE

Pössel, Markus; Tschira, Klaus

2012-01-01

Mit dem „Haus der Astronomie“ (HdA) auf dem Königsstuhl ist ein neues Zentrum für astronomische Bildungs- und Öffentlichkeitsarbeit in Heidelberg eröffnet. Das Haus der Astronomie ist eine gemeinsame Einrichtung der Max-Planck-Gesellschaft (MPG) und der Klaus Tschira Stiftung unter Beteiligung der Stadt Heidelberg und der Ruperto Carola, deren Zentrum für Astronomie eng mit dem HdA zusammenarbeitet. Ziel des HdA ist es, astronomische Forschung einer breiten Öffentlichkeit in verständlicher Fo...

Relative Error Evaluation to Typical Open Global dem Datasets in Shanxi Plateau of China

Science.gov (United States)

Zhao, S.; Zhang, S.; Cheng, W.

2018-04-01

Produced by radar data or stereo remote sensing image pairs, global DEM datasets are one of the most important types for DEM data. Relative error relates to surface quality created by DEM data, so it relates to geomorphology and hydrologic applications using DEM data. Taking Shanxi Plateau of China as the study area, this research evaluated the relative error to typical open global DEM datasets including Shuttle Radar Terrain Mission (SRTM) data with 1 arc second resolution (SRTM1), SRTM data with 3 arc second resolution (SRTM3), ASTER global DEM data in the second version (GDEM-v2) and ALOS world 3D-30m (AW3D) data. Through process and selection, more than 300,000 ICESat/GLA14 points were used as the GCP data, and the vertical error was computed and compared among four typical global DEM datasets. Then, more than 2,600,000 ICESat/GLA14 point pairs were acquired using the distance threshold between 100 m and 500 m. Meanwhile, the horizontal distance between every point pair was computed, so the relative error was achieved using slope values based on vertical error difference and the horizontal distance of the point pairs. Finally, false slope ratio (FSR) index was computed through analyzing the difference between DEM and ICESat/GLA14 values for every point pair. Both relative error and FSR index were categorically compared for the four DEM datasets under different slope classes. Research results show: Overall, AW3D has the lowest relative error values in mean error, mean absolute error, root mean square error and standard deviation error; then the SRTM1 data, its values are a little higher than AW3D data; the SRTM3 and GDEM-v2 data have the highest relative error values, and the values for the two datasets are similar. Considering different slope conditions, all the four DEM data have better performance in flat areas but worse performance in sloping regions; AW3D has the best performance in all the slope classes, a litter better than SRTM1; with slope increasing

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

Directory of Open Access Journals (Sweden)

Jaume Llibre

2015-10-01

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

a High Precision dem Extraction Method Based on Insar Data

Science.gov (United States)

Wang, Xinshuang; Liu, Lingling; Shi, Xiaoliang; Huang, Xitao; Geng, Wei

2018-04-01

In the 13th Five-Year Plan for Geoinformatics Business, it is proposed that the new InSAR technology should be applied to surveying and mapping production, which will become the innovation driving force of geoinformatics industry. This paper will study closely around the new outline of surveying and mapping and then achieve the TerraSAR/TanDEM data of Bin County in Shaanxi Province in X band. The studying steps are as follows; Firstly, the baseline is estimated from the orbital data; Secondly, the interferometric pairs of SAR image are accurately registered; Thirdly, the interferogram is generated; Fourth, the interferometric correlation information is estimated and the flat-earth phase is removed. In order to solve the phase noise and the discontinuity phase existing in the interferometric image of phase, a GAMMA adaptive filtering method is adopted. Aiming at the "hole" problem of missing data in low coherent area, the interpolation method of low coherent area mask is used to assist the phase unwrapping. Then, the accuracy of the interferometric baseline is estimated from the ground control points. Finally, 1 : 50000 DEM is generated, and the existing DEM data is used to verify the accuracy through statistical analysis. The research results show that the improved InSAR data processing method in this paper can obtain the high-precision DEM of the study area, exactly the same with the topography of reference DEM. The R2 can reach to 0.9648, showing a strong positive correlation.

Polynomial Poisson algebras: Gel'fand-Kirillov problem and Poisson spectra

OpenAIRE

Lecoutre, César

2014-01-01

We study the fields of fractions and the Poisson spectra of polynomial Poisson algebras.\\ud \\ud First we investigate a Poisson birational equivalence problem for polynomial Poisson algebras over a field of arbitrary characteristic. Namely, the quadratic Poisson Gel'fand-Kirillov problem asks whether the field of fractions of a Poisson algebra is isomorphic to the field of fractions of a Poisson affine space, i.e. a polynomial algebra such that the Poisson bracket of two generators is equal to...

On an Inequality Concerning the Polar Derivative of a Polynomial

Indian Academy of Sciences (India)

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

Classification of complex polynomial vector fields in one complex variable

DEFF Research Database (Denmark)

Branner, Bodil; Dias, Kealey

2010-01-01

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

COMPARISON AND CO-REGISTRATION OF DEMS GENERATED FROM HiRISE AND CTX IMAGES

Directory of Open Access Journals (Sweden)

Y. Wang

2016-06-01

Full Text Available Images from two sensors, the High-Resolution Imaging Science Experiment (HiRISE and the Context Camera (CTX, both on-board the Mars Reconnaissance Orbiter (MRO, were used to generate high-quality DEMs (Digital Elevation Models of the Martian surface. However, there were discrepancies between the DEMs generated from the images acquired by these two sensors due to various reasons, such as variations in boresight alignment between the two sensors during the flight in the complex environment. This paper presents a systematic investigation of the discrepancies between the DEMs generated from the HiRISE and CTX images. A combined adjustment algorithm is presented for the co-registration of HiRISE and CTX DEMs. Experimental analysis was carried out using the HiRISE and CTX images collected at the Mars Rover landing site and several other typical regions. The results indicated that there were systematic offsets between the HiRISE and CTX DEMs in the longitude and latitude directions. However, the offset in the altitude was less obvious. After combined adjustment, the offsets were eliminated and the HiRISE and CTX DEMs were co-registered to each other. The presented research is of significance for the synergistic use of HiRISE and CTX images for precision Mars topographic mapping.

Random polynomials and expected complexity of bisection methods for real solving

DEFF Research Database (Denmark)

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

O(N) symmetries, sum rules for generalized Hermite polynomials and squeezed states

International Nuclear Information System (INIS)

Daboul, Jamil; Mizrahi, Salomon S

2005-01-01

Quantum optics has been dealing with coherent states, squeezed states and many other non-classical states. The associated mathematical framework makes use of special functions as Hermite polynomials, Laguerre polynomials and others. In this connection we here present some formal results that follow directly from the group O(N) of complex transformations. Motivated by the squeezed states structure, we introduce the generalized Hermite polynomials (GHP), which include as particular cases, the Hermite polynomials as well as the heat polynomials. Using generalized raising operators, we derive new sum rules for the GHP, which are covariant under O(N) transformations. The GHP and the associated sum rules become useful for evaluating Wigner functions in a straightforward manner. As a byproduct, we use one of these sum rules, on the operator level, to obtain raising and lowering operators for the Laguerre polynomials and show that they generate an sl(2, R) ≅ su(1, 1) algebra

Euler polynomials and identities for non-commutative operators

Science.gov (United States)

De Angelis, Valerio; Vignat, Christophe

2015-12-01

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

On integral and finite Fourier transforms of continuous q-Hermite polynomials

International Nuclear Information System (INIS)

Atakishiyeva, M. K.; Atakishiyev, N. M.

2009-01-01

We give an overview of the remarkably simple transformation properties of the continuous q-Hermite polynomials H n (x vertical bar q) of Rogers with respect to the classical Fourier integral transform. The behavior of the q-Hermite polynomials under the finite Fourier transform and an explicit form of the q-extended eigenfunctions of the finite Fourier transform, defined in terms of these polynomials, are also discussed.

On polynomial selection for the general number field sieve

Science.gov (United States)

Kleinjung, Thorsten

2006-12-01

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

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

Science.gov (United States)

Horozov, Emil

2016-05-01

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

Optimizing digital elevation models (DEMs) accuracy for planning and design of mobile communication networks

Science.gov (United States)

Hassan, Mahmoud A.

2004-02-01

Digital elevation models (DEMs) are important tools in the planning, design and maintenance of mobile communication networks. This research paper proposes a method for generating high accuracy DEMs based on SPOT satellite 1A stereo pair images, ground control points (GCP) and Erdas OrthoBASE Pro image processing software. DEMs with 0.2911 m mean error were achieved for the hilly and heavily populated city of Amman. The generated DEM was used to design a mobile communication network resulted in a minimum number of radio base transceiver stations, maximum number of covered regions and less than 2% of dead zones.

IceBridge DMS L3 Photogrammetric DEM

Data.gov (United States)

National Aeronautics and Space Administration — The IceBridge DMS L3 Photogrammetric DEM (IODMS3) data set contains gridded digital elevation models and orthorectified images of Greenland derived from the Digital...

Families of superintegrable Hamiltonians constructed from exceptional polynomials

International Nuclear Information System (INIS)

Post, Sarah; Tsujimoto, Satoshi; Vinet, Luc

2012-01-01

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

Raising and Lowering Operators for Askey-Wilson Polynomials

Directory of Open Access Journals (Sweden)

Siddhartha Sahi

2007-01-01

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

Tau method approximation of the Hubbell rectangular source integral

International Nuclear Information System (INIS)

Kalla, S.L.; Khajah, H.G.

2000-01-01

The Tau method is applied to obtain expansions, in terms of Chebyshev polynomials, which approximate the Hubbell rectangular source integral:I(a,b)=∫ b 0 (1/(√(1+x 2 )) arctan(a/(√(1+x 2 )))) This integral corresponds to the response of an omni-directional radiation detector situated over a corner of a plane isotropic rectangular source. A discussion of the error in the Tau method approximation follows

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

Science.gov (United States)

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

2008-10-01

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

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

African Journals Online (AJOL)

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

Computing derivative-based global sensitivity measures using polynomial chaos expansions

International Nuclear Information System (INIS)

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

Exact polynomial solutions of second order differential equations and their applications

International Nuclear Information System (INIS)

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)

The Jones polynomial as a new invariant of topological fluid dynamics

International Nuclear Information System (INIS)

Ricca, Renzo L; Liu, Xin

2014-01-01

A new method based on the use of the Jones polynomial, a well-known topological invariant of knot theory, is introduced to tackle and quantify topological aspects of structural complexity of vortex tangles in ideal fluids. By re-writing the Jones polynomial in terms of helicity, the resulting polynomial becomes then function of knot topology and vortex circulation, providing thus a new invariant of topological fluid dynamics. Explicit computations of the Jones polynomial for some standard configurations, including the Whitehead link and the Borromean rings (whose linking numbers are zero), are presented for illustration. In the case of a homogeneous, isotropic tangle of vortex filaments with same circulation, the new Jones polynomial reduces to some simple algebraic expression, that can be easily computed by numerical methods. This shows that this technique may offer a new setting and a powerful tool to detect and compute topological complexity and to investigate relations with energy, by tackling fundamental aspects of turbulence research. (paper)

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

International Nuclear Information System (INIS)

Schiffgens, J.O.

1990-01-01

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

Multivariate Local Polynomial Regression with Application to Shenzhen Component Index

Directory of Open Access Journals (Sweden)

Liyun Su

2011-01-01

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

Twisted Polynomials and Forgery Attacks on GCM

DEFF Research Database (Denmark)

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

2015-01-01

Polynomial hashing as an instantiation of universal hashing is a widely employed method for the construction of MACs and authenticated encryption (AE) schemes, the ubiquitous GCM being a prominent example. It is also used in recent AE proposals within the CAESAR competition which aim at providing...... in an improved key recovery algorithm. As cryptanalytic applications of our twisted polynomials, we develop the first universal forgery attacks on GCM in the weak-key model that do not require nonce reuse. Moreover, we present universal weak-key forgeries for the nonce-misuse resistant AE scheme POET, which...

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

Science.gov (United States)

Ma, Lichun; Zheng, Jie

2017-12-21

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

2016 USGS Lidar DEM: Maine QL2

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — Product: These are Digital Elevation Model (DEM) data for Franklin, Oxford, Piscataquis, and Somerset Counties, Maine as part of the required deliverables for the...

Blaze-DEMGPU: Modular high performance DEM framework for the GPU architecture

Directory of Open Access Journals (Sweden)

Nicolin Govender

2016-01-01

Full Text Available Blaze-DEMGPU is a modular GPU based discrete element method (DEM framework that supports polyhedral shaped particles. The high level performance is attributed to the light weight and Single Instruction Multiple Data (SIMD that the GPU architecture offers. Blaze-DEMGPU offers suitable algorithms to conduct DEM simulations on the GPU and these algorithms can be extended and modified. Since a large number of scientific simulations are particle based, many of the algorithms and strategies for GPU implementation present in Blaze-DEMGPU can be applied to other fields. Blaze-DEMGPU will make it easier for new researchers to use high performance GPU computing as well as stimulate wider GPU research efforts by the DEM community.

EVALUATION OF AIRBORNE L- BAND MULTI-BASELINE POL-INSAR FOR DEM EXTRACTION BENEATH FOREST CANOPY

Directory of Open Access Journals (Sweden)

W. M. Li

2018-04-01

Full Text Available DEM beneath forest canopy is difficult to extract with optical stereo pairs, InSAR and Pol-InSAR techniques. Tomographic SAR (TomoSAR based on different penetration and view angles could reflect vertical structure and ground structure. This paper aims at evaluating the possibility of TomoSAR for underlying DEM extraction. Airborne L-band repeat-pass Pol-InSAR collected in BioSAR 2008 campaign was applied to reconstruct the 3D structure of forest. And sum of kronecker product and algebraic synthesis algorithm were used to extract ground structure, and phase linking algorithm was applied to estimate ground phase. Then Goldstein cut-branch approach was used to unwrap the phases and then estimated underlying DEM. The average difference between the extracted underlying DEM and Lidar DEM is about 3.39 m in our test site. And the result indicates that it is possible for underlying DEM estimation with airborne L-band repeat-pass TomoSAR technique.

Evaluation of Airborne l- Band Multi-Baseline Pol-Insar for dem Extraction Beneath Forest Canopy

Science.gov (United States)

Li, W. M.; Chen, E. X.; Li, Z. Y.; Jiang, C.; Jia, Y.

2018-04-01

DEM beneath forest canopy is difficult to extract with optical stereo pairs, InSAR and Pol-InSAR techniques. Tomographic SAR (TomoSAR) based on different penetration and view angles could reflect vertical structure and ground structure. This paper aims at evaluating the possibility of TomoSAR for underlying DEM extraction. Airborne L-band repeat-pass Pol-InSAR collected in BioSAR 2008 campaign was applied to reconstruct the 3D structure of forest. And sum of kronecker product and algebraic synthesis algorithm were used to extract ground structure, and phase linking algorithm was applied to estimate ground phase. Then Goldstein cut-branch approach was used to unwrap the phases and then estimated underlying DEM. The average difference between the extracted underlying DEM and Lidar DEM is about 3.39 m in our test site. And the result indicates that it is possible for underlying DEM estimation with airborne L-band repeat-pass TomoSAR technique.

Fractional order differentiation by integration with Jacobi polynomials

KAUST Repository

Liu, Dayan

2012-12-01

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

Synchronization of generalized Henon map using polynomial controller

International Nuclear Information System (INIS)

Lam, H.K.

2010-01-01

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

Fractional order differentiation by integration with Jacobi polynomials

KAUST Repository

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

2012-01-01

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

A photogrammetric DEM of Greenland based on 1978-1987 aerial photos: validation and integration with laser altimetry and satellite-derived DEMs

DEFF Research Database (Denmark)

Korsgaard, Niels Jákup; Kjær, Kurt H.; Nuth, Christopher

Here we present a DEM of Greenland covering all ice-free terrain and the margins of the GrIS and local glaciers and ice caps. The DEM is based on the 3534 photos used in the aero-triangulation which were recorded by the Danish Geodata Agency (then the Geodetic Institute) in survey campaigns...... spanning the period 1978-1987. The GrIS is covered tens of kilometers into the interior due to the large footprints of the photos (30 x 30 km) and control provided by the aero-triangulation. Thus, the data are ideal for providing information for analysis of ice marginal elevation change and also control...

Non-existence criteria for Laurent polynomial first integrals

Directory of Open Access Journals (Sweden)

Shaoyun Shi

2003-01-01

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

Vanishing of Littlewood-Richardson polynomials is in P

OpenAIRE

Adve, Anshul; Robichaux, Colleen; Yong, Alexander

2017-01-01

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

Recurrence coefficients for discrete orthonormal polynomials and the Painlevé equations

International Nuclear Information System (INIS)

Clarkson, Peter A

2013-01-01

We investigate semi-classical generalizations of the Charlier and Meixner polynomials, which are discrete orthogonal polynomials that satisfy three-term recurrence relations. It is shown that the coefficients in these recurrence relations can be expressed in terms of Wronskians of modified Bessel functions and confluent hypergeometric functions, respectively for the generalized Charlier and generalized Meixner polynomials. These Wronskians arise in the description of special function solutions of the third and fifth Painlevé equations. (paper)

2014 USACE NCMP Topobathy Lidar DEM: Oregon

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — These Digital Elevation Model (DEM) files contain rasterized topobathy lidar elevations at a 1 m grid size, generated from data collected by the Coastal Zone Mapping...

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

Science.gov (United States)

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

2013-01-01

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

The number of beams in IMRT-theoretical investigations and implications for single-arc IMRT

International Nuclear Information System (INIS)

Bortfeld, Thomas

2010-01-01

The first purpose of this paper is to shed some new light on the old question of selecting the number of beams in intensity-modulated radiation therapy (IMRT). The second purpose is to illuminate the related issue of discrete static beam angles versus rotational techniques, which has recently re-surfaced due to the advancement of volumetric modulated arc therapy (VMAT). A specific objective is to find analytical expressions that allow one to address the points raised above. To make the problem mathematically tractable, it is assumed that the depth dose is flat and that the lateral dose profile can be approximated by polynomials, specifically Chebyshev polynomials of the first kind, of finite degree. The application of methods known from image reconstruction then allows one to answer the first question above as follows: the required number of beams is determined by the maximum degree of the polynomials used in the approximation of the beam profiles, which is a measure of the dose variability. There is nothing to be gained by using more beams. In realistic cases, in which the variability of the lateral dose profile is restricted in several ways, the required number of beams is of the order of 10-20. The consequence of delivering the beams with a 'leaf sweep' technique during continuous rotation of the gantry, as in VMAT, is also derived in an analytical form. The main effect is that the beams fan out, but the effect near the axis of rotation is small. This result can serve as a theoretical justification of VMAT. Overall the analytical derivations in this paper, albeit based on strong simplifications, provide new insights into, and a deeper understanding of, the beam angle problem in IMRT. The decomposition of the beam profiles into well-behaved and easily deliverable smooth functions, such as Chebyshev polynomials, could be of general interest in IMRT treatment planning.

FUSION OF MULTI-SCALE DEMS FROM DESCENT AND NAVCM IMAGES OF CHANG’E-3 USING COMPRESSED SENSING METHOD

Directory of Open Access Journals (Sweden)

M. Peng

2017-07-01

Full Text Available The multi-source DEMs generated using the images acquired in the descent and landing phase and after landing contain supplementary information, and this makes it possible and beneficial to produce a higher-quality DEM through fusing the multi-scale DEMs. The proposed fusion method consists of three steps. First, source DEMs are split into small DEM patches, then the DEM patches are classified into a few groups by local density peaks clustering. Next, the grouped DEM patches are used for sub-dictionary learning by stochastic coordinate coding. The trained sub-dictionaries are combined into a dictionary for sparse representation. Finally, the simultaneous orthogonal matching pursuit (SOMP algorithm is used to achieve sparse representation. We use the real DEMs generated from Chang’e-3 descent images and navigation camera (Navcam stereo images to validate the proposed method. Through the experiments, we have reconstructed a seamless DEM with the highest resolution and the largest spatial coverage among the input data. The experimental results demonstrated the feasibility of the proposed method.

Two polynomial division inequalities in

Directory of Open Access Journals (Sweden)

Goetgheluck P

1998-01-01

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

Asymptotics for the ratio and the zeros of multiple Charlier polynomials

OpenAIRE

Ndayiragije, François; Van Assche, Walter

2011-01-01

We investigate multiple Charlier polynomials and in particular we will use the (nearest neighbor) recurrence relation to find the asymptotic behavior of the ratio of two multiple Charlier polynomials. This result is then used to obtain the asymptotic distribution of the zeros, which is uniform on an interval. We also deal with the case where one of the parameters of the various Poisson distributions depend on the degree of the polynomial, in which case we obtain another asymptotic distributio...

H∞ Control of Polynomial Fuzzy Systems: A Sum of Squares Approach

OpenAIRE

Bomo W. Sanjaya; Bambang Riyanto Trilaksono; Arief Syaichu-Rohman

2014-01-01

This paper proposes the control design ofa nonlinear polynomial fuzzy system with H∞ performance objective using a sum of squares (SOS) approach. Fuzzy model and controller are represented by a polynomial fuzzy model and controller. The design condition is obtained by using polynomial Lyapunov functions that not only guarantee stability but also satisfy the H∞ performance objective. The design condition is represented in terms of an SOS that can be numerically solved via the SOSTOOLS. A simul...

Euler Polynomials and Identities for Non-Commutative Operators

OpenAIRE

De Angelis, V.; Vignat, C.

2015-01-01

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

Local polynomial Whittle estimation of perturbed fractional processes

DEFF Research Database (Denmark)

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

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

Polynomial algebra of discrete models in systems biology.

Science.gov (United States)

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

2010-07-01

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

Polynomial chaos expansion with random and fuzzy variables

Science.gov (United States)

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

2016-06-01

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

Polynomial Vector Fields in One Complex Variable

DEFF Research Database (Denmark)

Branner, Bodil

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

TanDEM-X the Earth surface observation project from space level - basis and mission status

Directory of Open Access Journals (Sweden)

Jerzy Wiśniowski

2015-03-01

Full Text Available TanDEM-X is DLR (Deutsches Zentrum für Luft- und Raumfahrt the Earth surface observation project using high-resolution SAR interferometry. It opens a new era in space borne radar remote sensing. The system is based on two satellites: TerraSAR-X (TSX and TanDEM-X (TDX flying on the very close, strictly controlled orbits. This paper gives an overview of the radar technology and overview of the TanDEM-X mission concept which is based on several innovative technologies. The primary objective of the mission is to deliver a global digital elevation model (DEM with an unprecedented accuracy, which is equal to or surpass the HRTI-3 specifications (12 m posting, relative height accuracy ±2 m for slope < 20% and ±4 m for slope > 20% [8]. Beyond that, TanDEM-X provides a highly reconfigurable platform for the demonstration of new radar imaging techniques and applications.[b]Keywords[/b]: remote sensing, Bistatic SAR, digital elevation model (DEM, Helix formation, SAR interferomery, HRTI-3, synchronization

EVALUATING THE ACCURACY OF DEM GENERATION ALGORITHMS FROM UAV IMAGERY

Directory of Open Access Journals (Sweden)

J. J. Ruiz

2013-08-01

Full Text Available In this work we evaluated how the use of different positioning systems affects the accuracy of Digital Elevation Models (DEMs generated from aerial imagery obtained with Unmanned Aerial Vehicles (UAVs. In this domain, state-of-the-art DEM generation algorithms suffer from typical errors obtained by GPS/INS devices in the position measurements associated with each picture obtained. The deviations from these measurements to real world positions are about meters. The experiments have been carried out using a small quadrotor in the indoor testbed at the Center for Advanced Aerospace Technologies (CATEC. This testbed houses a system that is able to track small markers mounted on the UAV and along the scenario with millimeter precision. This provides very precise position measurements, to which we can add random noise to simulate errors in different GPS receivers. The results showed that final DEM accuracy clearly depends on the positioning information.

Multivariable Christoffel-Darboux Kernels and Characteristic Polynomials of Random Hermitian Matrices

Directory of Open Access Journals (Sweden)

Hjalmar Rosengren

2006-12-01

Full Text Available We study multivariable Christoffel-Darboux kernels, which may be viewed as reproducing kernels for antisymmetric orthogonal polynomials, and also as correlation functions for products of characteristic polynomials of random Hermitian matrices. Using their interpretation as reproducing kernels, we obtain simple proofs of Pfaffian and determinant formulas, as well as Schur polynomial expansions, for such kernels. In subsequent work, these results are applied in combinatorics (enumeration of marked shifted tableaux and number theory (representation of integers as sums of squares.

Szász-Durrmeyer operators involving Boas-Buck polynomials of blending type.

Science.gov (United States)

Sidharth, Manjari; Agrawal, P N; Araci, Serkan

2017-01-01

The present paper introduces the Szász-Durrmeyer type operators based on Boas-Buck type polynomials which include Brenke type polynomials, Sheffer polynomials and Appell polynomials considered by Sucu et al. (Abstr. Appl. Anal. 2012:680340, 2012). We establish the moments of the operator and a Voronvskaja type asymptotic theorem and then proceed to studying the convergence of the operators with the help of Lipschitz type space and weighted modulus of continuity. Next, we obtain a direct approximation theorem with the aid of unified Ditzian-Totik modulus of smoothness. Furthermore, we study the approximation of functions whose derivatives are locally of bounded variation.

Szász-Durrmeyer operators involving Boas-Buck polynomials of blending type

Directory of Open Access Journals (Sweden)

Manjari Sidharth

2017-05-01

Full Text Available Abstract The present paper introduces the Szász-Durrmeyer type operators based on Boas-Buck type polynomials which include Brenke type polynomials, Sheffer polynomials and Appell polynomials considered by Sucu et al. (Abstr. Appl. Anal. 2012:680340, 2012. We establish the moments of the operator and a Voronvskaja type asymptotic theorem and then proceed to studying the convergence of the operators with the help of Lipschitz type space and weighted modulus of continuity. Next, we obtain a direct approximation theorem with the aid of unified Ditzian-Totik modulus of smoothness. Furthermore, we study the approximation of functions whose derivatives are locally of bounded variation.

An extension of Krawtchouk\\'s polynomials to the contstruction of ...

African Journals Online (AJOL)

A simple method is described for the construction of a set of orthogonal polynomials for any case where the proportions of observations follow a binomial distribution. The least squares equation which fits the data is determined using the properties of orthogonal polynomials and the analysis of variance technique.

Comparison of Conjugate Gradient Density Matrix Search and Chebyshev Expansion Methods for Avoiding Diagonalization in Large-Scale Electronic Structure Calculations

Science.gov (United States)

Bates, Kevin R.; Daniels, Andrew D.; Scuseria, Gustavo E.

1998-01-01

We report a comparison of two linear-scaling methods which avoid the diagonalization bottleneck of traditional electronic structure algorithms. The Chebyshev expansion method (CEM) is implemented for carbon tight-binding calculations of large systems and its memory and timing requirements compared to those of our previously implemented conjugate gradient density matrix search (CG-DMS). Benchmark calculations are carried out on icosahedral fullerenes from C60 to C8640 and the linear scaling memory and CPU requirements of the CEM demonstrated. We show that the CPU requisites of the CEM and CG-DMS are similar for calculations with comparable accuracy.

Geometry of polynomials and root-finding via path-lifting

Science.gov (United States)

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

2018-02-01

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

An Algorithm for the Convolution of Legendre Series

KAUST Repository

Hale, Nicholas; Townsend, Alex

2014-01-01

An O(N2) algorithm for the convolution of compactly supported Legendre series is described. The algorithm is derived from the convolution theorem for Legendre polynomials and the recurrence relation satisfied by spherical Bessel functions. Combining with previous work yields an O(N 2) algorithm for the convolution of Chebyshev series. Numerical results are presented to demonstrate the improved efficiency over the existing algorithm. © 2014 Society for Industrial and Applied Mathematics.

The Combinatorial Rigidity Conjecture is False for Cubic Polynomials

DEFF Research Database (Denmark)

Henriksen, Christian

2003-01-01

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

Ratio asymptotics of Hermite-Pade polynomials for Nikishin systems

International Nuclear Information System (INIS)

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

2005-01-01

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

Asymptotic behaviour of the zeros of the Jacobi polynomials Psub(n)(chi)sup(at,bt) as t→infinity and limit relations of these polynomials with Hermite polynomials

International Nuclear Information System (INIS)

Calogero, F.

1978-01-01

Let zsub(j)(α, β) be the jth zero of the Jacobi polynomial J sub(n)sup(α,β)(z), and xsub(j) the jth zero of the Hermite polynomial Hsub(n)(x). Then, as t→infinity, zsub(j)(at,bt)=(b-a)/(b+a)+t sup(-1/2)c x sub(j)+t -1 4/3(n+1/2+xsub(j) 2 )(a-b)/(a+b) 2 +0(t sup(-3/2)), with c=(ab)sup(1/2) [(a+b)/2]sup(-3/2) a>0, b>0. This formula implies the limit relation n exclamation mark lim sub(t→infinity) [t sup(-n/2)J sub(n)sup(at,bt) ((b-a)/(b+a)+t sup(-1/2)x)] = [(a+b)c/4]sup(n) Hsub(n)(chi/c). (author)

Congruences concerning Legendre polynomials III

OpenAIRE

Sun, Zhi-Hong

2010-01-01

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

Global Polynomial Kernel Hazard Estimation

DEFF Research Database (Denmark)

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

2015-01-01

This paper introduces a new bias reducing method for kernel hazard estimation. The method is called global polynomial adjustment (GPA). It is a global correction which is applicable to any kernel hazard estimator. The estimator works well from a theoretical point of view as it asymptotically redu...

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

Directory of Open Access Journals (Sweden)

Dražen Tutić

2009-05-01

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

Polynomial realization of the Uq (sl(3)) Gel'fand-(Weyl)-Zetlin basis

International Nuclear Information System (INIS)

Dobrev, V.K.; Truini, P.

1996-01-01

We give an explicit realization of the U ≡ U q (sl(3)) Gel'fand-(Weyl)-Zetlin (GWZ) basis as polynomial functions in three variables. This realization is obtained in two complementary ways. First we establish a 1-to-1 correspondence between the abstract GWZ basis and explicit polynomials in the quantum subgroup U + of the raising generators. We then use an explicit construction of arbitrary lowest weight (holomorphic) representations of U in terms of three variables on which the generators of U are realized as q-difference operators. Applying the GWZ corresponding polynomials in this realization to the lowest weight vector (the function 1) produces one realization of our GWZ basis. Another realization of the GWZ polynomial basis is found by the explicit diagonalization of the operators of isospin I-circumflex 2 , third component of isospin I-circumflex z , and hypercharge Y-circumflex, in the same realization as q-difference operators. The result is that the eigenvectors can be written in terms of q-hypergeometric polynomials in our three variables. Finally we construct an explicit scalar product (adapting the Shapovalov form to our setting). Using it we prove the orthogonality of our GWZ polynomials for which we use both realizations. This provides a polynomial construction for the orthonormal GWZ basis. We work for generic q, leaving the root of unity case for a following paper. It seems that our results are new also in the classical situation (q=1). (author). 20 refs

Real zeros of classes of random algebraic polynomials

Directory of Open Access Journals (Sweden)

K. Farahmand

2003-01-01

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

a Unified Matrix Polynomial Approach to Modal Identification

Science.gov (United States)

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

1998-04-01

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

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

Czech Academy of Sciences Publication Activity Database

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

2010-01-01

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

Quantum entanglement via nilpotent polynomials

International Nuclear Information System (INIS)

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

2006-01-01

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

Nuclear-magnetic-resonance quantum calculations of the Jones polynomial

International Nuclear Information System (INIS)

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

2010-01-01

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

Estimating Horizontal Displacement between DEMs by Means of Particle Image Velocimetry Techniques

Directory of Open Access Journals (Sweden)

Juan F. Reinoso

2015-12-01

Full Text Available To date, digital terrain model (DTM accuracy has been studied almost exclusively by computing its height variable. However, the largely ignored horizontal component bears a great influence on the positional accuracy of certain linear features, e.g., in hydrological features. In an effort to fill this gap, we propose a means of measurement different from the geomatic approach, involving fluid mechanics (water and air flows or aerodynamics. The particle image velocimetry (PIV algorithm is proposed as an estimator of horizontal differences between digital elevation models (DEM in grid format. After applying a scale factor to the displacement estimated by the PIV algorithm, the mean error predicted is around one-seventh of the cell size of the DEM with the greatest spatial resolution, and around one-nineteenth of the cell size of the DEM with the least spatial resolution. Our methodology allows all kinds of DTMs to be compared once they are transformed into DEM format, while also allowing comparison of data from diverse capture methods, i.e., LiDAR versus photogrammetric data sources.

Weierstrass method for quaternionic polynomial root-finding

Science.gov (United States)

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

2018-01-01

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

A set of sums for continuous dual q-2-Hahn polynomials

International Nuclear Information System (INIS)

Gade, R. M.

2009-01-01

An infinite set {τ (l) (y;r,z)} r,lisanelementofN 0 of linear sums of continuous dual q -2 -Hahn polynomials with prefactors depending on a complex parameter z is studied. The sums τ (l) (y;r,z) have an interpretation in context with tensor product representations of the quantum affine algebra U q ' (sl(2)) involving both a positive and a negative discrete series representation. For each l>0, the sum τ (l) (y;r,z) can be expressed in terms of the sum τ (0) (y;r,z), continuous dual q 2 -Hahn polynomials, and their associated polynomials. The sum τ (0) (y;r,z) is obtained as a combination of eight basic hypergeometric series. Moreover, an integral representation is provided for the sums τ (l) (y;r,z) with the complex parameter restricted by |zq| -2 -Hahn polynomials.

Fibonacci-like Differential Equations with a Polynomial Non-Homogeneous Part

NARCIS (Netherlands)

Asveld, P.R.J.

1989-01-01

We investigate non-homogeneous linear differential equations of the form $x''(t) + x'(t) - x(t) = p(t)$ where $p(t)$ is either a polynomial or a factorial polynomial in $t$. We express the solution of these differential equations in terms of the coefficients of $p(t)$, in the initial conditions, and

Sparse DOA estimation with polynomial rooting

DEFF Research Database (Denmark)

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

2015-01-01

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

Acute environmental toxicity and persistence of DEM, a chemical agent simulant: Diethyl malonate. [Diethyl malonate

Energy Technology Data Exchange (ETDEWEB)

Cataldo, D.A.; Ligotke, M.W.; Harvey, S.D.; Fellows, R.J.; Li, Shu-mei W.; Van Voris, P.; Wentsel, R.S.

1990-05-01

The purpose of the following chemical simulant studies is to assess the potential acute environmental effects and persistence of diethyl malonate (DEM). Deposition velocities for DEM to soil surfaces ranged from 0.04 to 0.2 cm/sec. For foliar surfaces, deposition velocities ranged from 0.0002 cm/sec at low air concentrations to 0.05 cm/sec for high dose levels. The residence times or half-lives of DEM deposited to soils was 2 h for the fast component and 5 to 16 h for the residual material. DEM deposited to foliar surfaces also exhibited biphasic depuration. The half-life of the short residence time component ranged from 1 to 3 h, while the longer time component had half-times of 16 to 242 h. Volatilization and other depuration mechanisms reduce surface contaminant levels in both soils and foliage to less than 1% of initial dose within 96 h. DEM is not phytotoxic at foliar mass loading levels of less than 10 {mu}m/cm{sup 2}. However, severe damage is evident at mass loading levels in excess of 17 {mu}g/cm{sup 2}. Tall fescue and sagebrush were more affected than was short-needle pine, however, mass loading levels were markedly different. Regrowth of tall fescue indicated that the effects of DEM are residual, and growth rates are affected only at higher mass loadings through the second harvest. Results from in vitro testing of DEM indicated concentrations below 500 {mu}g/g dry soil generally did not negatively impact soil microbial activity. Short-term effects of DEM were more profound on soil dehydrogenase activity than on soil phosphatase activity. No enzyme inhibition or enhancement was observed after 28 days in incubation. Results of the earthworm bioassay indicate survival to be 86 and 66% at soil doses of 107 and 204 {mu}g DEM/cm{sup 2}, respectively. At higher dose level, activity or mobility was judged to be affected in over 50% of the individuals. 21 refs., 10 figs., 15 tabs.

Identification and delineation of areas flood hazard using high accuracy of DEM data

Science.gov (United States)

Riadi, B.; Barus, B.; Widiatmaka; Yanuar, M. J. P.; Pramudya, B.

2018-05-01

Flood incidents that often occur in Karawang regency need to be mitigated. These expectations exist on technologies that can predict, anticipate and reduce disaster risks. Flood modeling techniques using Digital Elevation Model (DEM) data can be applied in mitigation activities. High accuracy DEM data used in modeling, will result in better flooding flood models. The result of high accuracy DEM data processing will yield information about surface morphology which can be used to identify indication of flood hazard area. The purpose of this study was to identify and describe flood hazard areas by identifying wetland areas using DEM data and Landsat-8 images. TerraSAR-X high-resolution data is used to detect wetlands from landscapes, while land cover is identified by Landsat image data. The Topography Wetness Index (TWI) method is used to detect and identify wetland areas with basic DEM data, while for land cover analysis using Tasseled Cap Transformation (TCT) method. The result of TWI modeling yields information about potential land of flood. Overlay TWI map with land cover map that produces information that in Karawang regency the most vulnerable areas occur flooding in rice fields. The spatial accuracy of the flood hazard area in this study was 87%.

How large is the Upper Indus Basin? The pitfalls of auto-delineation using DEMs

Science.gov (United States)

Khan, Asif; Richards, Keith S.; Parker, Geoffrey T.; McRobie, Allan; Mukhopadhyay, Biswajit

2014-02-01

Extraction of watershed areas from Digital Elevation Models (DEMs) is increasingly required in a variety of environmental analyses. It is facilitated by the availability of DEMs based on remotely sensed data, and by Geographical Information System (GIS) software. However, accurate delineation depends on the quality of the DEM and the methodology adopted. This paper considers automated and supervised delineation in a case study of the Upper Indus Basin (UIB), Pakistan, for which published estimates of the basin area show significant disagreement, ranging from 166,000 to 266,000 km2. Automated delineation used ArcGIS Archydro and hydrology tools applied to three good quality DEMs (two from SRTM data with 90m resolution, and one from 30m resolution ASTER data). Automatic delineation defined a basin area of c.440,000 km2 for the UIB, but included a large area of internal drainage in the western Tibetan Plateau. It is shown that discrepancies between different estimates reflect differences in the initial extent of the DEM used for watershed delineation, and the unchecked effect of iterative pit-filling of the DEM (going beyond the filling of erroneous pixels to filling entire closed basins). For the UIB we have identified critical points where spurious addition of catchment area has arisen, and use Google Earth to examine the geomorphology adjacent to these points, and also examine the basin boundary data provided by the HydroSHEDS database. We show that the Pangong Tso watershed and some other areas in the western Tibetan plateau are not part of the UIB, but are areas of internal drainage. Our best estimate of the area of the Upper Indus Basin (at Besham Qila) is 164,867 km2 based on the SRTM DEM, and 164,853 km2 using the ASTER DEM). This matches the catchment area measured by WAPDA SWHP. An important lesson from this investigation is that one should not rely on automated delineation, as iterative pit-filling can produce spurious drainage networks and basins, when

Polynomials in finite geometries and combinatorics

NARCIS (Netherlands)

Blokhuis, A.; Walker, K.

1993-01-01

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

Dirichlet polynomials, majorization, and trumping

International Nuclear Information System (INIS)

Pereira, Rajesh; Plosker, Sarah

2013-01-01

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

The neighbourhood polynomial of some families of dendrimers

Science.gov (United States)

Nazri Husin, Mohamad; Hasni, Roslan

2018-04-01

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

A new derivation of the highest-weight polynomial of a unitary lie algebra

International Nuclear Information System (INIS)

P Chau, Huu-Tai; P Van, Isacker

2000-01-01

A new method is presented to derive the expression of the highest-weight polynomial used to build the basis of an irreducible representation (IR) of the unitary algebra U(2J+1). After a brief reminder of Moshinsky's method to arrive at the set of equations defining the highest-weight polynomial of U(2J+1), an alternative derivation of the polynomial from these equations is presented. The method is less general than the one proposed by Moshinsky but has the advantage that the determinantal expression of the highest-weight polynomial is arrived at in a direct way using matrix inversions. (authors)

A probabilistic approach of sum rules for heat polynomials

International Nuclear Information System (INIS)

Vignat, C; Lévêque, O

2012-01-01

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

A Combinatorial Proof of a Result on Generalized Lucas Polynomials

Directory of Open Access Journals (Sweden)

Laugier Alexandre

2016-09-01

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

A Kantorovich Type of Szasz Operators Including Brenke-Type Polynomials

Directory of Open Access Journals (Sweden)

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.

Lower bounds for the circuit size of partially homogeneous polynomials

Czech Academy of Sciences Publication Activity Database

Le, Hong-Van

2017-01-01

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

Generalized catalan numbers, sequences and polynomials

OpenAIRE

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

2010-01-01

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

Multilevel weighted least squares polynomial approximation

KAUST Repository

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

2017-01-01

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

An algorithmic approach to solving polynomial equations associated with quantum circuits

International Nuclear Information System (INIS)

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

2009-01-01

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

Recurrence approach and higher order polynomial algebras for superintegrable monopole systems

Science.gov (United States)

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.

Canonical basis for type A4 (II) - Polynomial elements in one variable

International Nuclear Information System (INIS)

Hu Yuwang; Ye Jiachen

2003-12-01

All the 62 monomial elements in the canonical basis B of the quantized enveloping algebra for type A 4 have been determined. According to Lusztig's idea, the elements in the canonical basis B consist of monomials and linear combinations of monomials (for convenience, we call them polynomials). In this note, we compute all the 144 polynomial elements in one variable in the canonical basis B of the quantized enveloping algebra for type A 4 based on our joint note. We conjecture that there are other polynomial elements in two or three variables in the canonical basis B, which include independent variables and dependent variables. Moreover, it is conjectured that there are no polynomial elements in the canonical basis B with four or more variables. (author)

Discrete-Time Filter Synthesis using Product of Gegenbauer Polynomials

OpenAIRE

N. Stojanovic; N. Stamenkovic; I. Krstic

2016-01-01

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

Bounds and asymptotics for orthogonal polynomials for varying weights

CERN Document Server

Levin, Eli

2018-01-01

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

On Linear Combinations of Two Orthogonal Polynomial Sequences on the Unit Circle

Directory of Open Access Journals (Sweden)

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.

On the existence of polynomial Lyapunov functions for rationally stable vector fields

DEFF Research Database (Denmark)

Leth, Tobias; Wisniewski, Rafal; Sloth, Christoffer

2018-01-01

This paper proves the existence of polynomial Lyapunov functions for rationally stable vector fields. For practical purposes the existence of polynomial Lyapunov functions plays a significant role since polynomial Lyapunov functions can be found algorithmically. The paper extents an existing result...... on exponentially stable vector fields to the case of rational stability. For asymptotically stable vector fields a known counter example is investigated to exhibit the mechanisms responsible for the inability to extend the result further....

Combined DEM Extration Method from StereoSAR and InSAR

Science.gov (United States)

Zhao, Z.; Zhang, J. X.; Duan, M. Y.; Huang, G. M.; Yang, S. C.

2015-06-01

A pair of SAR images acquired from different positions can be used to generate digital elevation model (DEM). Two techniques exploiting this characteristic have been introduced: stereo SAR and interferometric SAR. They permit to recover the third dimension (topography) and, at the same time, to identify the absolute position (geolocation) of pixels included in the imaged area, thus allowing the generation of DEMs. In this paper, StereoSAR and InSAR combined adjustment model are constructed, and unify DEM extraction from InSAR and StereoSAR into the same coordinate system, and then improve three dimensional positioning accuracy of the target. We assume that there are four images 1, 2, 3 and 4. One pair of SAR images 1,2 meet the required conditions for InSAR technology, while the other pair of SAR images 3,4 can form stereo image pairs. The phase model is based on InSAR rigorous imaging geometric model. The master image 1 and the slave image 2 will be used in InSAR processing, but the slave image 2 is only used in the course of establishment, and the pixels of the slave image 2 are relevant to the corresponding pixels of the master image 1 through image coregistration coefficient, and it calculates the corresponding phase. It doesn't require the slave image in the construction of the phase model. In Range-Doppler (RD) model, the range equation and Doppler equation are a function of target geolocation, while in the phase equation, the phase is also a function of target geolocation. We exploit combined adjustment model to deviation of target geolocation, thus the problem of target solution is changed to solve three unkonwns through seven equations. The model was tested for DEM extraction under spaceborne InSAR and StereoSAR data and compared with InSAR and StereoSAR methods respectively. The results showed that the model delivered a better performance on experimental imagery and can be used for DEM extraction applications.

On Modular Counting with Polynomials

DEFF Research Database (Denmark)

Hansen, Kristoffer Arnsfelt

2006-01-01

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

Bernoulli numbers and polynomials from a more general point of view

Energy Technology Data Exchange (ETDEWEB)

Dattoli, G. [ENEA, Centro Ricerche Frascati, Frascati, RM(Italy). Div. Fisica Applicata; Cesarano, C. [Ulm Univ., Ulm (Germany). Dept. of Mathematics; Lonzellutta, S. [ENEA, Centro Ricerche E. Clementel, Bologna (Italy). Div. Fisica Applicata

2000-07-01

In this work it is applied the method of generating function, to introduce new forms of Bernoulli numbers and polynomials, which are exploited to derive further classes of partial sums involving generalized many index many variable polynomials. Analogous considerations are developed for the Euler numbers and polynomials. [Italian] Si applica il metodo della funzione generatrice per introdurre nuove forme di numeri e polinomi di Bernoulli che vengono utilizzati per sviluppare e per calcolare somme parziali che coinvolgono polinomi a piu' indici ed a piu' variabili. Si sviluppano considerazioni analoghe per i polinomi ed i numeri di Eulero.

Quantum Hurwitz numbers and Macdonald polynomials

Science.gov (United States)

Harnad, J.

2016-11-01

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

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

International Nuclear Information System (INIS)

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

Science.gov (United States)

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.

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

Science.gov (United States)

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

2012-01-01

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

Tensor calculus in polar coordinates using Jacobi polynomials

Science.gov (United States)

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

2016-11-01

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

2015 USACE NCMP Topobathy Lidar DEM: Avalon (NJ)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — These Digital Elevation Model (DEM) files contain rasterized topobathy lidar elevations at a 1 m grid size, generated from data collected by the Coastal Zone Mapping...

2013 USACE NCMP Topobathy Lidar DEM: Niihau (HI)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — These Digital Elevation Model (DEM) files contain rasterized topobathy lidar elevations at a 1 m grid size, generated from data collected by the Coastal Zone Mapping...

Real-root property of the spectral polynomial of the Treibich-Verdier potential and related problems

Science.gov (United States)

Chen, Zhijie; Kuo, Ting-Jung; Lin, Chang-Shou; Takemura, Kouichi

2018-04-01

We study the spectral polynomial of the Treibich-Verdier potential. Such spectral polynomial, which is a generalization of the classical Lamé polynomial, plays fundamental roles in both the finite-gap theory and the ODE theory of Heun's equation. In this paper, we prove that all the roots of such spectral polynomial are real and distinct under some assumptions. The proof uses the classical concept of Sturm sequence and isomonodromic theories. We also prove an analogous result for a polynomial associated with a generalized Lamé equation, where we apply a new approach based on the viewpoint of the monodromy data.

Granular dynamics, contact mechanics and particle system simulations a DEM study

CERN Document Server

Thornton, Colin

2015-01-01

This book is devoted to the Discrete Element Method (DEM) technique, a discontinuum modelling approach that takes into account the fact that granular materials are composed of discrete particles which interact with each other at the microscale level. This numerical simulation technique can be used both for dispersed systems in which the particle-particle interactions are collisional and compact systems of particles with multiple enduring contacts. The book provides an extensive and detailed explanation of the theoretical background of DEM. Contact mechanics theories for elastic, elastic-plastic, adhesive elastic and adhesive elastic-plastic particle-particle interactions are presented. Other contact force models are also discussed, including corrections to some of these models as described in the literature, and important areas of further research are identified. A key issue in DEM simulations is whether or not a code can reliably simulate the simplest of systems, namely the single particle oblique impact wit...

DemQSAR: predicting human volume of distribution and clearance of drugs.

Science.gov (United States)

Demir-Kavuk, Ozgur; Bentzien, Jörg; Muegge, Ingo; Knapp, Ernst-Walter

2011-12-01

In silico methods characterizing molecular compounds with respect to pharmacologically relevant properties can accelerate the identification of new drugs and reduce their development costs. Quantitative structure-activity/-property relationship (QSAR/QSPR) correlate structure and physico-chemical properties of molecular compounds with a specific functional activity/property under study. Typically a large number of molecular features are generated for the compounds. In many cases the number of generated features exceeds the number of molecular compounds with known property values that are available for learning. Machine learning methods tend to overfit the training data in such situations, i.e. the method adjusts to very specific features of the training data, which are not characteristic for the considered property. This problem can be alleviated by diminishing the influence of unimportant, redundant or even misleading features. A better strategy is to eliminate such features completely. Ideally, a molecular property can be described by a small number of features that are chemically interpretable. The purpose of the present contribution is to provide a predictive modeling approach, which combines feature generation, feature selection, model building and control of overtraining into a single application called DemQSAR. DemQSAR is used to predict human volume of distribution (VD(ss)) and human clearance (CL). To control overtraining, quadratic and linear regularization terms were employed. A recursive feature selection approach is used to reduce the number of descriptors. The prediction performance is as good as the best predictions reported in the recent literature. The example presented here demonstrates that DemQSAR can generate a model that uses very few features while maintaining high predictive power. A standalone DemQSAR Java application for model building of any user defined property as well as a web interface for the prediction of human VD(ss) and CL is

Numerical Solutions for Convection-Diffusion Equation through Non-Polynomial Spline

Directory of Open Access Journals (Sweden)

Ravi Kanth A.S.V.

2016-01-01

Full Text Available In this paper, numerical solutions for convection-diffusion equation via non-polynomial splines are studied. We purpose an implicit method based on non-polynomial spline functions for solving the convection-diffusion equation. The method is proven to be unconditionally stable by using Von Neumann technique. Numerical results are illustrated to demonstrate the efficiency and stability of the purposed method.

On the COSMO-SkyMed Exploitation for Interferometric DEM Generation

Science.gov (United States)

Teresa, C. M.; Raffaele, N.; Oscar, N. D.; Fabio, B.

2011-12-01

DEM products for Earth observation space-borne applications are being to play a role of increasing importance due to the new generation of high resolution sensors (both optical and SAR). These new sensors demand elevation data for processing and, on the other hand, they provide new possibilities for DEM generation. Till now, for what concerns interferometric DEM, the Shuttle Radar Topography Mission (SRTM) has been the reference product for scientific applications all over the world. SRTM mission [1] had the challenging goal to meet the requirements for a homogeneous and reliable DEM fulfilling the DTED-2 specifications. However, new generation of high resolution sensors (including SAR) pose new requirements for elevation data in terms of vertical precision and spatial resolution. DEM are usually used as ancillary input in different processing steps as for instance geocoding and Differential SAR Interferometry. In this context, the recent SAR missions of DLR (TerraSAR-X and TanDEM-X) and ASI (COSMO-SkyMed) can play a promising role thanks to their high resolution both in space and time. In particular, the present work investigates the potentialities of the COSMO/SkyMed (CSK) constellation for ground elevation measurement with particular attention devoted to the impact of the improved spatial resolution wrt the previous SAR sensors. The recent scientific works, [2] and [3], have shown the advantages of using CSK in the monitoring of terrain deformations caused by landslides, earthquakes, etc. On the other hand, thanks to the high spatial resolution, CSK appears to be very promising in monitoring man-made structures, such as buildings, bridges, railways and highways, thus enabling new potential applications (urban applications, precise DEM, etc.). We present results obtained by processing both SPOTLIGHT and STRIPMAP acquisitions through standard SAR Interferometry as well as multi-pass interferometry [4] with the aim of measuring ground elevation. Acknowledgments

Estimation of Length and Order of Polynomial-based Filter Implemented in the Form of Farrow Structure

Directory of Open Access Journals (Sweden)

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.

Invariant hyperplanes and Darboux integrability of polynomial vector fields

International Nuclear Information System (INIS)

Zhang Xiang

2002-01-01

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

TecDEM: A MATLAB Based Toolbox for understanding Tectonics from Digital Elevation Models

Science.gov (United States)

Shahzad, F.; Mahmood, S. A.; Gloaguen, R.

2009-04-01

TecDEM is a MATLAB based tool box for understanding the tectonics from digital elevation models (DEMs) of any area. These DEMs can be derived from data of any spatial resolution (Low, medium and High). In the first step we extract drainage network from the DEMs using flow grid approach. Drainage network is a group of streams having elevation and catchment area information as a function of spatial locations. We implement an array of stream structure to study this drainage network. Knickpoints can be identified on each stream of the drainage network by a graphical user interface and are helpful for understanding stream morphology. Stream profile analysis in steady state condition is applied on all streams to calculate geomorphic parameters and regional uplift rates. Hack index is calculated for all the profiles at a certain interval and over the change of knickpoints. Reports menu of this tool box generates detailed statistics report, complete tabulated report, graphical output of each analyzed stream profile and Hack index profile. All the calculated values are part of stream structure and is saved as .mat file for later use with this tool box. The spatial distribution of geomorphic parameters, uplift rates and knickpoints are exported as a shape files for visualization in professional GIS software. We test this tool box on DEMs from different tectonic settings worldwide and received verifiable results with other studies.

A Formally Verified Conflict Detection Algorithm for Polynomial Trajectories

Science.gov (United States)

Narkawicz, Anthony; Munoz, Cesar

2015-01-01

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

On selfadjoint functors satisfying polynomial relations

DEFF Research Database (Denmark)

Agerholm, Troels; Mazorchuk, Volodomyr

2011-01-01

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

SAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos

Energy Technology Data Exchange (ETDEWEB)

Ahlfeld, R., E-mail: r.ahlfeld14@imperial.ac.uk; Belkouchi, B.; Montomoli, F.

2016-09-01

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

SAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos

International Nuclear Information System (INIS)

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

2016-01-01

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

Bayer Demosaicking with Polynomial Interpolation.

Science.gov (United States)

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

2016-08-30

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

Joint use of multi-orbit high-resolution SAR interferometry for DEM generation in mountainous area

KAUST Repository

Zhang, Lu; Jiang, Houjun; Liao, Mingsheng; Balz, Timo; Wang, Teng

2014-01-01

SAR interferometry has long been regarded as an effective tool for wide-area topographic mapping in hilly and mountainous areas. However, quality of InSAR DEM product is usually affected by atmospheric disturbances and decorrelation-induced voids, especially for data acquired in repeat-pass mode. In this paper, we proposed an approach for improved topographic mapping by optimal fusion of multi-orbit InSAR DEMs with correction of atmospheric phase screen (APS). An experimental study with highresolution TerraSAR-X and COSMO-SkyMed datasets covering a mountainous area was carried out to demonstrate the effectiveness of the proposed approach. Validation with a reference DEM of scale 1:50,000 indicated that vertical accuracy of the fused DEM can be better than 5 m.

Joint use of multi-orbit high-resolution SAR interferometry for DEM generation in mountainous area

KAUST Repository

Zhang, Lu

2014-07-01

SAR interferometry has long been regarded as an effective tool for wide-area topographic mapping in hilly and mountainous areas. However, quality of InSAR DEM product is usually affected by atmospheric disturbances and decorrelation-induced voids, especially for data acquired in repeat-pass mode. In this paper, we proposed an approach for improved topographic mapping by optimal fusion of multi-orbit InSAR DEMs with correction of atmospheric phase screen (APS). An experimental study with highresolution TerraSAR-X and COSMO-SkyMed datasets covering a mountainous area was carried out to demonstrate the effectiveness of the proposed approach. Validation with a reference DEM of scale 1:50,000 indicated that vertical accuracy of the fused DEM can be better than 5 m.

Polynomials in algebraic analysis

OpenAIRE

Multarzyński, Piotr

2012-01-01

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

Demência na doença de Parkinson Dementia in Parkinsn's disease

Directory of Open Access Journals (Sweden)

Leonardo Caixeta

2008-12-01

Full Text Available OBJETIVO: A presença de síndromes psiquiátricas, incluindo demência, associada a distúrbios motores tem sido cada vez mais reconhecida durante a última década, com destaque para o prejuízo cognitivo na doença de Parkinson idiopática. Esta revisão enfocará a epidemiologia, os aspectos clínicos, diagnósticos diferenciais, mecanismos subjacentes e o tratamento da demência na doença de Parkinson idiopática. MÉTODO: Uma revisão da literatura dos estudos que investigaram a demência da doença de Parkinson idiopática foi realizada. RESULTADOS: A demência é altamente prevalente na doença de Parkinson idiopática. O protótipo da demência na doença de Parkinson idiopática consiste numa síndrome disexecutiva com comprometimento da atenção, funções executivas e, secundariamente, a memória. Neuroquimicamente, o déficit mais significativo parece ser colinérgico; a demência se correlaciona com a presença de corpos de Lewy corticais e límbicos. Evidências preliminares sugerem que os anticolinesterásicos podem ser efetivos na demência da doença de Parkinson idiopática. CONCLUSÕES: O prejuízo cognitivo na doença de Parkinson idiopática é associado a características próprias e é responsável por importante incapacidade nestes pacientes.OBJECTIVE: The concomitant presence of psychiatric syndromes, including dementia, with motor disturbance has been increasingly recognized during the last decade, with emphasis on cognitive impairment in idiopatic Parkinson's disease. This review will focus on the epidemiology, clinical aspects, differential diagnosis, underlying mechanisms and treatment of dementia in Parkinson's disease. METHOD: A literature review of the studies that investigated the dementia in Parkinson's disease was performed. RESULTS: Dementia is highly prevalent in Parkinson's disease. The prototype of dementia in Parkinson's disease is a dysexecutive syndrome with impaired attention, executive functions and

Confluent hypergeometric orthogonal polynomials related to the rational quantum Calogero system with harmonic confinement

International Nuclear Information System (INIS)

van Diejen, J.F.

1997-01-01

Two families (type A and type B) of confluent hypergeometric polynomials in several variables are studied. We describe the orthogonality properties, differential equations, and Pieri-type recurrence formulas for these families. In the one-variable case, the polynomials in question reduce to the Hermite polynomials (type A) and the Laguerre polynomials (type B), respectively. The multivariable confluent hypergeometric families considered here may be used to diagonalize the rational quantum Calogero models with harmonic confinement (for the classical root systems) and are closely connected to the (symmetric) generalized spherical harmonics investigated by Dunkl. (orig.)

Global sensitivity analysis using sparse grid interpolation and polynomial chaos

International Nuclear Information System (INIS)

Buzzard, Gregery T.

2012-01-01

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

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

Directory of Open Access Journals (Sweden)

Prasanta Kumar Ray

2012-01-01

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

DEM analysis of FOXSI-2 microflare using AIA observations

Science.gov (United States)

Athiray Panchapakesan, Subramania; Glesener, Lindsay; Vievering, Juliana; Camilo Buitrago-Casas, Juan; Christe, Steven; Inglis, Andrew; Krucker, Sam; Musset, Sophie

2017-08-01

The second flight of Focusing Optics X-ray Solar Imager (FOXSI) sounding rocket experiment was successfully completed on 11 December 2014. FOXSI makes direct imaging and spectral observation of the Sun in hard X-rays using grazing incidence optics modules which focus X-rays onto seven focal plane detectors kept at a 2m distance, in the energy range 4 to 20 keV, to study particle acceleration and coronal heating. Significant HXR emissions were observed by FOXSI during microflare events with A0.5 and A2.5 class, as classified by GOES, that occurred during FOXSI-2 flight.Spectral analysis of FOXSI data for these events indicate presence of plasma at higher temperatures (>10MK). We attempt to study the plasma content in the corona at different temperatures, characterized by the differential emission measure (DEM), over the FOXSI-2 observed flare regions using the Atmospheric Imaging Assembly (SDO/AIA) data. We utilize AIA observations in different EUV filters that are sensitive to ionized iron lines, to determine the DEM by using a regularized inversion method. This poster will show the properties of hot plasma as derived from FOXSI-2 HXR spectra with supporting DEM analysis using AIA observations.