Related papers: Fast and accurate evaluation of dual Bernstein pol…
In this thesis quadratic and cubic algebras, which are extensions of SU(1,1) and SU(2) are studied in detail, with particular attention being given to their construction, their finite and infinite dimensional irreducible representations and…
Low rank approximation is a commonly occurring problem in many computer vision and machine learning applications. There are two common ways of optimizing the resulting models. Either the set of matrices with a given rank can be explicitly…
This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some output variables are also input variables, linked by a linear dependency. Fundamental examples include the…
We derive new matrix representation for higher-order changhee numbers and polynomials. This helps us to obtain simple and short proofs of many previous results on higher-order changhee numbers and polynomials. Moreover, we obtain recurrence…
We derive new formulas for the high dimensional biharmonic potential acting on Gaussians or Gaussians times special polynomials. These formulas can be used to construct accurate cubature formulas of an arbitrary high order which are fast…
In this research, the Bernoulli polynomials are introduced. The properties of these polynomials are employed to construct the operational matrices of integration together with the derivative and product. These properties are then utilized…
Given $\{P_n \}$ a sequence of monic orthogonal polynomials, we analyze their linear combinations $\{Q_n \}$with constant coefficients and fixed length $k+1$. Necessary and sufficient conditions are given for the orthogonality of the monic…
In this article, a formulation of a point-collocation method in which the unknown function is approximated using global expansion in tensor product Bernstein polynomial basis is presented. Bernstein polynomials used in this study are…
We introduce another new type of combinations of Bernstein operators in this paper, which can be used to approximate the functions with inner singularities. The direct and inverse results of the weighted approximation of this new type…
By establishing an interesting connection between ordinary Bell polynomials and rational convolution powers, some composition and inverse relations of Bell polynomials as well as explicit expressions for convolution roots of sequences are…
Various recurrence relations between formal orthogonal polynomials can be used to derive Lanczos-type algorithms. In this paper, we consider recurrence relation $A_{12}$ for the choice $U_i(x)=P_i(x)$, where $U_i$ is an auxiliary family of…
We show that a confluent case of the big q-Jacobi polynomials P_n(x;a,b,c;q), which corresponds to a=b=-c, leads to a discrete orthogonality relation for imaginary values of the parameter a (outside of its commonly known domain 0<a<…
In a previous paper, we presented conjectures of the recurrence relations with constant coefficients for the multi-indexed orthogonal polynomials of Laguerre, Jacobi, Wilson and Askey-Wilson types. In this paper we present a proof for the…
We investigate the symmetric Dunkl-classical orthogonal polynomials by using a new approach applied in connection with the Dunkl operator. The main aim of this technique is to determine the recurrence coefficients first and foremost. We…
We introduce a multivariate analogue of Bernoulli polynomials and give their fundamental properties: difference and differential relations, symmetry, explicit formula, inversion formula, multiplication theorem, and binomial type formula.…
Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input…
Lanczos-type algorithms are efficient and easy to implement. Unfortunately they breakdown frequently and well before convergence has been achieved. These algorithms are typically based on recurrence relations which involve formal orthogonal…
Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…
Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…
We give a concise direct proof of the orthogonality of interpolation Macdonald polynomials with respect to the Fourier pairing and briefly discuss some immediate applications of this orthogonality, such as the symmetry of the Fourier…