Related papers: The kernel polynomial method based on Jacobi polyn…
Kernel methods such as kernel ridge regression and Gaussian process regressions with Matern type kernels have been increasingly used, in particular, to fit potential energy surfaces (PES) and density functionals, and for materials…
For arbitrary nontrivial linear combinations of a finite number of Poisson kernels, the fulfillment of the Nagy condition is established for all numbers n, starting from some number. It is also proved for any n the existence of linear…
This paper presents a method for the accurate and efficient computations on scalar, vector and tensor fields in three-dimensional spherical polar coordinates. The methods uses spin-weighted spherical harmonics in the angular directions and…
Let f_1,...,f_r be homogeneous polynomials in K[x_1,...,x_n], K a field. Put F=y_1f_1+...+y_rf_r in K[x,y] and let I be the ideal of K[x,y] generated by the partials of F relative to the x_i and y_j. The Jacobian ring of F is the quotient…
Quadratically optimized polynomials are described which are useful in multi-bosonic algorithms for Monte Carlo simulations of quantum field theories with fermions. Algorithms for the computation of the coefficients and roots of these…
The first part of the paper is devoted to two descriptions of all polynomial tau-functions of the KP hierarchy: by a generalized Jacobi-Trudy formula, and a generalized Giambelli formula. We use the latter formula in the second part to…
A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…
Orthogonal polynomials for a family of weight functions on $[-1,1]^2$, $$ \CW_{\a,\b,\g}(x,y) = |x+y|^{2\a+1} |x-y|^{2\b+1} (1-x^2)^\g(1-y^2)^{\g}, $$ are studied and shown to be related to the Koornwinder polynomials defined on the region…
We consider kernels of discrete convolution operators or, equivalently, homogeneous solutions of partial difference operators and show that these solutions always have to be exponential polynomials. The respective polynomial space in…
Our goal is to settle the following faded problem: The Jacobian Conjecture (JC_n): If f_1,..,f_n are elements in a polynomial ring k[X_1,..,X_n] over a field k of characteristic 0 such that det(\partial f_i/ \partial X_j) is a nonzero…
We use the well-known observation that the solutions of Jacobi's differential equation can be represented via non-oscillatory phase and amplitude functions to develop a fast algorithm for computing multi-dimensional Jacobi polynomial…
In this paper we study a generalization of the class of orthogonal polynomials on the real line. These polynomials satisfy the following relation: $(J_5 - \lambda J_3) \vec p(\lambda) = 0$, where $J_3$ is a Jacobi matrix and $J_5$ is a…
Kernel methods are fundamental tools in machine learning that allow detection of non-linear dependencies between data without explicitly constructing feature vectors in high dimensional spaces. A major disadvantage of kernel methods is…
The Permuted Kernel Problem (PKP) asks to find a permutation of a given vector belonging to the kernel of a given matrix. The PKP is at the basis of PKP-DSS, a post-quantum signature scheme deriving from the identification scheme proposed…
Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of reduction rules and combinatorial insights. We will expose in this paper a similar strategy for obtaining polynomial-time approximation…
We present a spectral method for one-sided linear fractional integral equations on a closed interval that achieves exponentially fast convergence for a variety of equations, including ones with irrational order, multiple fractional orders,…
The possibility for the Jacobi equation to admit in some cases general solutions that are polynomials has been recently highlighted by Calogero and Yi, who termed them para-Jacobi polynomials. Such polynomials are used here to build seed…
We utilize the same technique as in [arXiv:2205.04254 (2022)] to provide some representations of polynomials non-negative on a basic semi-algebraic set, defined by polynomial inequalities, under more general conditions. Based on each…
This paper presents reproducing kernel Hilbert spaces method to obtain the numerical solution for partial differential equation constrained optimization problem.
In this work, the concept of quasi-type Kernel polynomials with respect to a moment functional is introduced. Difference equation satisfied by these polynomials along with the criterion for orthogonality conditions are discussed. The…