Related papers: Simple Parametrization Methods for Generating Adom…

Six families of generalized hypergeometric series in a variable $x$ and an arbitrary number of parameters are considered. Each of them is indexed by an integer $n$. Linear recurrence relations in $n$ relate these functions and their product…

We develop symbolic methods of asymptotic approximations for solutions of linear ordinary differential equations and use to them stabilize numerical calculations. Our method follows classical analysis for first-order systems and…

Proving statements about linear operators expressed in terms of identities often leads to finding elements of certain form in noncommutative polynomial ideals. We illustrate this by examples coming from actual operator statements and…

We construct linear operators factorizing the three bases of symmetric polynomials: monomial symmetric functions m(x), elementary symmetric polynomials E(x), and Schur functions s(x), into products of univariate polynomials.

Computing more than one eigenvalue for (large sparse) one-parameter polynomial and general nonlinear eigenproblems, as well as for multiparameter linear and nonlinear eigenproblems, is a much harder task than for standard eigenvalue…

The interpretation of numerical methods, such as finite difference methods for differential equations, as point estimators suggests that formal uncertainty quantification can also be performed in this context. Competing statistical…

We present a numerical algorithm for finding real non-negative solutions to polynomial equations. Our methods are based on the expectation maximization and iterative proportional fitting algorithms, which are used in statistics to find…

Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…

This paper introduces a smoothed proximal Lagrangian method for minimizing a nonconvex smooth function over a convex domain with additional explicit convex nonlinear constraints. Two key features are 1) the proposed method is single-looped,…

In this paper we study nonconvex and nonsmooth multi-block optimization over Riemannian manifolds with coupled linear constraints. Such optimization problems naturally arise from machine learning, statistical learning, compressive sensing,…

We construct a non-trivial type of 1-step exceptional Bannai-Ito polynomials which satisfy discrete orthogonality by using a generalized Darboux transformation. In this generalization, the Darboux transformed Bannai-Ito operator is directly…

In this article algebraic constructions are introduced in order to study the variety defined by a radical parametrization (a tuple of functions involving complex numbers, $n$ variables, the four field operations and radical extractions). We…

We study two important operations on polynomials defined over complete discrete valuation fields: Euclidean division and factorization. In particular, we design a simple and efficient algorithm for computing slope factorizations, based on…

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…

In this paper we introduce the polynomials $\{d_n^{(r)}(x)\}$ and $\{D_n^{(r)}(x)\}$ given by $d_n^{(r)}(x)=\sum_{k=0}^n\binom{x+r+k}k\binom{x-r}{n-k} \ (n\ge 0)$, $D_0^{(r)}(x)=1,\ D_1^{(r)}(x)=x$ and…

We construct new knot polynomials. Let $V$ be the standard solid torus in 3-space and let $pr$ be its standard projection onto an annulus. Let $M$ be the space of all smooth oriented knots in $V$ such that the restriction of $pr$ is an…

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

In this paper we develop a plane wave type method for discretization of homogeneous Helmholtz equations with variable wave numbers. In the proposed method, local basis functions (on each element) are constructed by the geometric optics…

A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient method which can avoid singularities and breakdowns in the…

In 1975, Koornwinder gave a method to construct orthogonal polynomials in two variables using the classical Jacobi polynomials. In [5], the authors introduced some new examples of Koornwinder polynomials obtained from the Koornwinder…