English
Related papers

Related papers: New Method to obtain Exact-Fit Polynomial and Expo…

200 papers

We study the explicit formula of Euler numbers and polynomials of higher order

Number Theory · Mathematics 2007-05-23 Taekyun Kim

The Macdonald polynomials with prescribed symmetry are obtained from the nonsymmetric Macdonald polynomials via the operations of $t$-symmetrisation, $t$-antisymmetrisation and normalisation. Motivated by corresponding results in Jack…

Quantum Algebra · Mathematics 2010-01-20 W. Baratta

In this work, a new technique has been presented to find approximate solution of linear integro-differential equations. The method is based on modified orthonormal Bernoulli polynomials and an operational matrix thereof. The method converts…

Numerical Analysis · Mathematics 2020-08-04 Udaya Pratap Singh

This paper is devoted to present new error bounds of regularized gap functions for polynomial variational inequalities with exponents explicitly determined by the dimension of the underlying space and the number/degree of the involved…

Optimization and Control · Mathematics 2020-03-24 Dinh Bui Van , Tien-Son Pham

The goal of this paper is to provide computational tools able to find a solution of a system of polynomial inequalities. The set of inequalities is reformulated as a system of polynomial equations. Three different methods, two of which…

Dynamical Systems · Mathematics 2016-03-04 Laura Menini , Corrado Possieri , Antonio Tornambè

Exact and quasi-exact solvabilities of the one-dimensional Schr\"odinger equation are discussed from a unified viewpoint based on the prepotential together with Bethe ansatz equations. This is a constructive approach which gives the…

Mathematical Physics · Physics 2015-05-13 Choon-Lin Ho

The aim of this note is to provide a reduction of the Exact Matching problem to the Top-$k$ Perfect Matching Problem. Together with earlier work by El Maalouly, this shows that the two problems are polynomial-time equivalent. The Exact…

Data Structures and Algorithms · Computer Science 2022-09-21 Nicolas El Maalouly , Lasse Wulf

We adapt (over $\mathbb{F}_2$) the general notions of multiplicative function, Dirichlet convolution and Inverse. We get some interesting results, namely necessary conditions for an odd binary polynomial to be perfect. Note that we are…

Number Theory · Mathematics 2023-01-16 Luis H. Gallardo , Olivier Rahavandrainy

In this article two methods to distinguish between polynomial and exponential tails are introduced. The methods are mainly based on the properties of the residual coefficient of variation for the exponential and non-exponential…

Methodology · Statistics 2011-12-21 Joan del Castillo , Jalila Daoudi , Richard Lockhart

Highly efficient and even nearly optimal algorithms have been developed for the classical problem of univariate polynomial root-finding (see, e.g., \cite{P95}, \cite{P02}, \cite{MNP13}, and the bibliography therein), but this is still an…

Symbolic Computation · Computer Science 2014-04-21 Victor Y. Pan , Elias Tsigaridas

This paper derives numerical bounds for and implements the splitting circle method for finding roots of a univariate polynomial in the presence of fixed precision.

Numerical Analysis · Mathematics 2022-09-13 Michael Nisenzon

The asymptotic iteration method is used to find exact and approximate solutions of Schroedinger's equation for a number of one-dimensional trigonometric potentials (sine-squared, double-cosine, tangent-squared, and complex cotangent).…

Mathematical Physics · Physics 2014-03-05 Hakan Ciftci , Richard L. Hall , Nasser Saad

This paper presents an alternative approach to simplify the proofs of some important results related to polynomial mappings in Computational Algebraic Geometry such as Polynomial Implicitization, Image Closure and some properties of the…

Algebraic Geometry · Mathematics 2011-11-30 Yongbi Li

We first review existing sequential methods for estimating a binomial proportion. Afterward, we propose a new family of group sequential sampling schemes for estimating a binomial proportion with prescribed margin of error and confidence…

Statistics Theory · Mathematics 2013-11-05 Zhengjia Chen , Xinjia Chen

We give a formula for matrix exponentials and partial fraction decompositions.

General Mathematics · Mathematics 2007-05-23 Pierre-Yves Gaillard

Finding suitable points for multivariate polynomial interpolation and approximation is a challenging task. Yet, despite this challenge, there has been tremendous research dedicated to this singular cause. In this paper, we begin by…

Numerical Analysis · Mathematics 2018-05-21 Pranay Seshadri , Gianluca Iaccarino , Tiziano Ghisu

We study the computation of local approximations of invariant manifolds of parabolic fixed points and parabolic periodic orbits of periodic vector fields. If the dimension of these manifolds is two or greater, in general, it is not possible…

Dynamical Systems · Mathematics 2016-03-09 Inmaculada Baldomá , Ernest Fontich , Pau Martín

We obtain exact, simple and very compact expressions for the linearization coefficients of the products of orthogonal polynomials; both the conventional Clebsch-Gordan-type and the modified version. The expressions are general depending…

Classical Analysis and ODEs · Mathematics 2023-06-09 A. D. Alhaidari

We present a method for constructing superoscillatory functions the superoscillatory part of which approximates a given polynomial with arbitrarily small error in a fixed interval. These functions are obtained as the product of the…

Mathematical Physics · Physics 2015-04-21 Ioannis Chremmos , George Fikioris

This paper is devoted to several new results concerning (standard) octonion polynomials. The first is the determination of the roots of all right scalar multiples of octonion polynomials. The roots of left multiples are also discussed,…

Rings and Algebras · Mathematics 2023-06-22 Adam Chapman , Solomon Vishkautsan
‹ Prev 1 4 5 6 7 8 10 Next ›