Related papers: Hypergeometric Solutions of Linear Difference Syst…
We present the Parareal-CG algorithm for time-dependent differential equations in this work. The algorithm is a parallel in time iteration algorithm utilizes Chebyshev-Gauss spectral collocation method for fine propagator F and backward…
We consider the iterative solution of large linear systems of equations in which the coefficient matrix is the sum of two terms, a sparse matrix $A$ and a possibly dense, rank deficient matrix of the form $\gamma UU^T$, where $\gamma > 0$…
In this paper we study higher-order difference equations which can be written as follows: $$ \mathbf{J} (y_0,y_1,...)^T = \lambda^N (y_0,y_1,...)^T, $$ where $\mathbf{J}$ is a $(2N+1)$-diagonal bounded banded matrix…
We present a recursive way to partition hypergraphs which creates and exploits hypergraph geometry and is suitable for many-core parallel architectures. Such partitionings are then used to bring sparse matrices in a recursive Bordered Block…
In this paper we study meromorphic functions solutions of linear shift difference equations in coefficients in $\mathbb{C}(x)$ involving the operator $\rho: y(x)\mapsto y(x+h)$, for some $h\in \mathbb{C}^*$. We prove that if $f$ is solution…
Matrix factorization-based recommender system is in effect an angle preserving dimensionality reduction technique. Since the frequency of items follows power-law distribution, most vectors in the original dimension of user feature vectors…
A long-standing open question in Integer Programming is whether integer programs with constraint matrices with bounded subdeterminants are efficiently solvable. An important special case thereof are congruency-constrained integer programs…
Following a method originally due to Siegel, we establish upper bounds for the number of primitive integer solutions to inequalities of the shape $0<|F(x, y)| \leq h$, where $F(x , y) =(\alpha x + \beta y)^r -(\gamma x + \delta y)^r \in…
We study Bayesian methods for large-scale linear inverse problems, focusing on the challenging task of hyperparameter estimation. Typical hierarchical Bayesian formulations that follow a Markov Chain Monte Carlo approach are possible for…
We consider certain examples of applications of the general methods, based on geometry and integrability of matrix models, described in hep-th/0601212. In particular, the nonlinear differential equations, satisfied by quasiclassical…
In this work we present a new approach for the implementation of operational Tau method for the solutions of linear differential and integral equations. In our approach we use the three terms relation of an orthogonal polynomial basis to…
This work is devoted to the development and analysis of a linearization algorithm for microscopic elliptic equations, with scaled degenerate production, posed in a perforated medium and constrained by the homogeneous Neumann-Dirichlet…
We present a mass lumping approach based on an isogeometric Petrov-Galerkin method that preserves higher-order spatial accuracy in explicit dynamics calculations irrespective of the polynomial degree of the spline approximation. To…
We systematically exploit a new generalized hypergeometric identity to obtain new hypergeometric summation formulas. As a consistency test, alternative proofs for some special cases are also provided. As a byproduct new summation formulas…
This paper considers the multi-parametric linear complementarity problem (pLCP) with sufficient matrices. The main result is an algorithm to find a polyhedral decomposition of the set of feasible parameters and to construct a piecewise…
For any complex parameters $x$ and $\nu$, we provide a new class of linear inversion formulas $T = A(x,\nu) \cdot S \Leftrightarrow S = B(x,\nu) \cdot T$ between sequences $S = (S_n)_{n \in \mathbb{N}^*}$ and $T = (T_n)_{n \in…
Painleve's transcendental differential equation P_{VI} may be expressed as the consistency condition for a pair of linear differential equations with 2 by 2 matrix coefficients with rational entries. By a construction due to Tracy and…
We introduce a near-linear complexity (geometric and meshless/algebraic) multigrid/multiresolution method for PDEs with rough ($L^\infty$) coefficients with rigorous a-priori accuracy and performance estimates. The method is discovered…
We show that certain hypergeometric series used to formulate mirror symmetry for Calabi-Yau hypersurfaces, in string theory and algebraic geometry, satisfy a number of interesting properties. Many of these properties are used in separate…
We consider KP tau function of hypergeometric type $\tau({\bf t},T,{\bf t}^*)$, where the set ${\bf t}$ is the KP higher times and $T,{\bf t}^*$ are sets of parameters. Fixing ${\bf t}^*$, we find that $\tau({\bf t},T,{\bf t}^*)$ is an…