相关论文: Representations of orthogonal polynomials
We discuss a fast approximate solution to the associated classical -- classical orthogonal polynomial connection problem. We first show that associated classical orthogonal polynomials are solutions to a fourth-order quadratic eigenvalue…
We present formulas of Rodrigues type giving the Macdonald polynomials for arbitrary partitions through the repeated application of creation operators on the constant 1. Three expressions for the creation operators are derived one from the…
Lanczos methods for solving $\textit{A}\textbf{x}=\textbf{b}$ consist in constructing a sequence of vectors $(\textbf{x}_k), k=1,...$ such that $\textbf{r}_{k}=\textbf{b}-\textit{A}\textbf{x}_{k}=\textit{P}_{k}(\textit{A})\textbf{r}_{0}$,,…
New sequences of orthogonal polynomials with respect to the weight functions $e^{-x} \rho_\nu(x),\ e^{- 1/x} x^{-1} \rho_{\nu} (x), \rho_{\nu}(x)= 2 x^{\nu/2} K_\nu(2\sqrt x),\ x >0, \nu \in \mathbb{R}$, where $K_\nu(z)$ is the modified…
New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…
The Deligne-Ogus-Shioda theorem guarantees the existence of isomorphisms between products of supersingular elliptic curves over finite fields. In this paper, we present methods for explicitly computing these isomorphisms in polynomial time,…
The authors proposed a general way to find particular solutions for overdetermined systems of PDEs previously, where the number of equations is greater than the number of unknown functions. In this paper, we propose an algorithm for finding…
By introducing a class of meromorphic functions with certain ramification structures on $\Bbb{CP}^1$, a new method for the determination of the Legendre representation of elliptic curves with complex multiplication is introduced. These…
This work introduces a methodology to solve ordinary differential equations using the Schur decomposition of the linear representation of the differential equation. This is done by first transforming the system into an upper triangular…
Sparse polynomial interpolation, sparse linear system solving or modular rational reconstruction are fundamental problems in Computer Algebra. They come down to computing linear recurrence relations of a sequence with the Berlekamp-Massey…
Recently the authors and J.M. Kress presented a special function recurrence relation method to prove quantum superintegrability of an integrable 2D system that included explicit constructions of higher order symmetries and the structure…
Classical orthogonal polynomials have widespread applications including in numerical integration, solving differential equations, and interpolation. Changing basis between classical orthogonal polynomials can affect the convergence,…
This papers studies the expressive and computational power of discrete Ordinary Differential Equations (ODEs). It presents a new framework using discrete ODEs as a central tool for computation and provides several implicit characterizations…
In this paper matrix orthogonal polynomials in the real line are described in terms of a Riemann--Hilbert problem. This approach provides an easy derivation of discrete equations for the corresponding matrix recursion coefficients. The…
We analyze a random lozenge tiling model of a large regular hexagon, whose underlying weight structure is periodic of period $2$ in both the horizontal and vertical directions. This is a determinantal point process whose correlation kernel…
We consider orthogonal polynomials p_n with respect to an exponential weight function w(x) = exp(-P(x)). The related equations for the recurrence coefficients have been explored by many people, starting essentially with Laguerre [49], in…
In this paper, we tackle the parametric complete multiplicity problem for a univariate polynomial. Our approach to the parametric complete multiplicity problem has a significant difference from the classical method, which relies on repeated…
In this paper, we develop a novel approach to the Weingarten calculus by employing the notion of virtual isometries. Traditionally, Weingarten calculus provides explicit formulas for integrating polynomial functions over compact matrix…
This work is a thorough investigation of skew-orthogonal polynomials with respect to a quartic Freud weight. We provide an explicit method to evaluate skew-orthogonal polynomials of any degree as linear combinations of orthogonal…
This paper studies a new family of Angelesco multiple orthogonal polynomials with shared orthogonality conditions with respect to a system of weight functions, which are complex analogues of Pascal distributions on a legged star-like set.…