Related papers: Regular polynomial interpolation and approximation…
Equivalence between algebraic equations of motion may be detected by using a $p$-adic method, methods using factorization and linear algebra, or by systematic computer search of suitable Tschirnhausen transformations. Here, we show standard…
Using elementary methods, we define and derive a particular weighted average of the trapezoidal and composite trapezoidal rules and show that this approximation, as well as its composite, is straightforward in computation. This…
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
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…
Zeilberger's algorithm provides a method to compute recurrence and differential equations from given hypergeometric series representations, and an adaption of Almquist and Zeilberger computes recurrence and differential equations for…
The solution to partial differential equations using deep learning approaches has shown promising results for several classes of initial and boundary-value problems. However, their ability to surpass, particularly in terms of accuracy,…
In this paper, we first propose a general interpolation algorithm in a free module of a linearized polynomial ring, and then apply this algorithm to decode several important families of codes, Gabidulin codes, KK codes and MV codes. Our…
This paper develops a fully discrete soft thresholding polynomial approximation over a general region, named Lasso hyperinterpolation. This approximation is an $\ell_1$-regularized discrete least squares approximation under the same…
Using a lemma of Davis on Gram matrices applied to the classical Orthogonal Polynomials to generate reproducing kernel interpolation over the classical domains for polynomials. These kernels have terms which are exact over the rational…
This paper deals with the polynomial linear system solving with errors (PLSwE) problem. Specifically, we focus on the evaluation-interpolation technique for solving polynomial linear systems and we assume that errors can occur in the…
Numerous scientific and engineering applications require numerically solving systems of equations. Classically solving a general set of polynomial equations requires iterative solvers, while linear equations may be solved either by direct…
This paper introduces the concept of generalized interlacing families of polynomials, which extends the classical interlacing polynomial method to handle polynomials of varying degrees. We establish a fundamental property for these…
In this paper, we propose a fully discrete soft thresholding trigonometric polynomial approximation on $[-\pi,\pi],$ named Lasso trigonometric interpolation. This approximation is an $\ell_1$-regularized discrete least squares approximation…
In this paper, we propose a proximal iteratively reweighted algorithm with extrapolation based on block coordinate update aimed at solving a class of optimization problems which is the sum of a smooth possibly nonconvex loss function and a…
A wide range of numerical methods exists for computing polynomial approximations of solutions of ordinary differential equations based on Chebyshev series expansions or Chebyshev interpolation polynomials. We consider the application of…
Renewed interest in mixed-precision algorithms has emerged due to growing data capacity and bandwidth concerns, as well as the advancement of GPUs, which enable significant speedup for low precision arithmetic. In light of this, we propose…
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…
We develop an interpolation-based modeling framework for parameter-dependent partial differential equations arising in control, inverse problems, and uncertainty quantification. The solution is discretized in the physical domain using…
In our preceding paper, we have proposed an algorithm for obtaining finite-norm solutions of higher-order linear ordinary differential equations of the Fuchsian type [\sum_m p_m (x) (d/dx)^m] f(x) = 0 (where p_m is a polynomial with…
An algorithm for generating interpolants for formulas which are conjunctions of quadratic polynomial inequalities (both strict and nonstrict) is proposed. The algorithm is based on a key observation that quadratic polynomial inequalities…