Related papers: On the Jacobi formula for Bivariate Pade Approxima…
Exact rational solutions of the generalized Hunter-Saxton equation are obtained using Pad\'e approximant approach for the traveling-wave and self-similarity reduction. A larger class of algebraic solutions are also obtained by extending a…
We study the problem of best approximations of a vector $\alpha\in{\mathbb R}^n$ by rational vectors of a lattice $\Lambda\subset {\mathbb R}^n$ whose common denominator is bounded. To this end we introduce successive minima for a periodic…
We investigate the differential equation for the Jacobi-type polynomials which are orthogonal on the interval $[-1,1]$ with respect to the classical Jacobi measure and an additional point mass at one endpoint. This scale of higher-order…
In this paper, we introduce Jacobi polynomial generalizations of several classical invariants in coding theory over finite fields, specifically, the higher and extended weight enumerators, and we establish explicit correspondences between…
In the present paper, we consider large-scale continuous-time differential matrix Riccati equations having low rank right-hand sides. These equations are generally solved by Backward Differentiation Formula (BDF) or Rosenbrock methods…
We provide a rounding error analysis of a mixed-precision preconditioned Jacobi algorithm, which uses low precision to compute the preconditioner, applies it at high precision (amounting to two matrix-matrix multiplications) and solves the…
Based on the mathematically well defined Pad\'e Theory, a theoretically safe new procedure for the extraction of the pole mass and width of a resonance is proposed. In particular, thanks to the Montessus de Ballore theorem we are able to…
This paper introduces some methods to determine the simultaneous approximation constants of a class of well approximable numbers $\zeta_{1},\zeta_{2},...,\zeta_{k}$. The approach relies on results on the connection between the set of all…
The matching distance is a computationally tractable topological measure to compare multi-filtered simplicial complexes. We design efficient algorithms for approximating the matching distance of two bi-filtered complexes to any desired…
In this paper we discuss a framework for the polynomial approximation to the solution of initial value problems for differential equations. The framework, initially devised for the approximation of ordinary differential equations, is…
We find all spectral type differential equations satisfied by the symmetric generalized ultraspherical polynomials which are orthogonal on the interval [-1,1] with respect to the classical symmetric weight function for the Jacobi…
The method of self-similar factor approximants is shown to be very convenient for solving different evolution equations and boundary-value problems typical of physical applications. The method is general and simple, being a straightforward…
We prove pointwise bounds for two-parameter families of Jacobi polynomials. Our bounds imply estimates for a class of functions arising from the spectral analysis of distinguished Laplacians and sub-Laplacians on the unit sphere in…
The paper deals with the problem of approximating the functions of several variables by branched continued fractions, in particular, multidimensional A- and J-fractions with independent variables. A generalization of Gragg's algorithm is…
We consider the numerical solution of the continuous algebraic Riccati equation $A^*X+XA-XFX+G=0$, with $F=F^*, G=G^*$ of low rank and $A$ large and sparse. We develop an algorithm for the low rank approximation of $X$ by means of an…
We propose an algorithm for evaluation of the cumulative bivariate normal distribution, building upon Marsaglia's ideas for evaluation of the cumulative univariate normal distribution. The algorithm is mathematically transparent, delivers…
A novel approach to efficiently treat pure-state equality constraints in optimal control problems (OCPs) using a Riccati recursion algorithm is proposed. The proposed method transforms a pure-state equality constraint into a mixed…
Rounding linear programs using techniques from discrepancy is a recent approach that has been very successful in certain settings. However this method also has some limitations when compared to approaches such as randomized and iterative…
We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical…
In this and subsequent paper arXiv:1011.5185 we develop a recursive approach for calculating the short-time expansion of the propagator for a general quantum system in a time-dependent potential to orders that have not yet been accessible…