Related papers: Matrix methods for Pad\'e approximation: numerical…
Following our earlier research, we use the method introduced by the author in \cite{prevost1996} named Remainder Pad\'e Approximant in \cite{rivoalprevost}, to construct approximations of the Hurwitz zeta function. We prove that these…
A parquet approximation (generalized ladder diagrams) in matrix models is considered. By means of numerical calculations we demonstrate that in the large $N$ limit the parquet approximation gives an excellent agreement with exact results.
A new method to represent and approximate rotation matrices is introduced. The method represents approximations of a rotation matrix $Q$ with linearithmic complexity, i.e. with $\frac{1}{2}n\lg(n)$ rotations over pairs of coordinates,…
In this paper the properties of R\'edei rational functions are used to derive rational approximations for square roots and both Newton and Pad\'e approximations are given as particular cases. As a consequence, such approximations can be…
This paper introduces a new method for constructing approximate solutions to a class of Wiener--Hopf equations. This is particularly useful since exact solutions of this class of Wiener--Hopf equations, at the moment, cannot be obtained.…
Matrix functions are a central topic of linear algebra, and problems requiring their numerical approximation appear increasingly often in scientific computing. We review various limited-memory methods for the approximation of the action of…
In this work, we present a new way to compute the Taylor polynomial of the matrix exponential which reduces the number of matrix multiplications in comparison with the de-facto standard Patterson-Stockmeyer method. This reduction is…
We prove several evaluations of determinants of matrices, the entries of which are given by the recurrence $a_{i,j}=a_{i-1,j}+a_{i,j-1}$, or variations thereof. These evaluations were either conjectured or extend conjectures by Roland…
We derive analytical expression of matrix factorization/completion solution by variational Bayes method, under the assumption that observed matrix is originally the product of low-rank dense and sparse matrices with additive noise. We…
This paper develops validated computational methods for studying infinite dimensional stable manifolds at equilibrium solutions of parabolic PDEs, synthesizing disparate errors resulting from numerical approximation. To construct our…
The goal of this paper is to provide computational tools able to find a solution of a system of polynomial inequalities. The set of inequalities is reformulated as a system of polynomial equations. Three different methods, two of which…
Transfer matrices and matrix product operators play an ubiquitous role in the field of many body physics. This paper gives an ideosyncratic overview of applications, exact results and computational aspects of diagonalizing transfer matrices…
We propose a numerical method to solve the three-dimensional static Maxwell equations in a singular axisymmetric domain, generated by the rotation of a singular polygon around one of its sides. The mathematical tools and an in-depth study…
A parallel algorithm for solving a series of matrix equations with a constant tridiagonal matrix and different right-hand sides is proposed and studied. The process of solving the problem is represented in two steps. The first preliminary…
This article is about both approximation theory and the numerical solution of partial differential equations (PDEs). First we introduce the notion of {\em reciprocal-log} or {\em log-lightning approximation} of analytic functions with…
Let $E = L_p, \; 1<p\leq 2,$ and $A : E \to E^*$ be a bounded monotone map such that $0 \in R(A)$. In this paper, we introduce and study an algorithm for approximating zeros of $A$. Furthermore, we study the application of this algorithm to…
We propose a class of Pad\'e interpolation problems whose solutions are expressible in terms of determinants of hypergeometric series.
In this paper the main results in arXiv:0901.3179v3, related to the matrix representation of polynomial maps, are restated in traditional way of linear algebra assuming that variable vectors are presented as column vectors. Some new results…
We show how to use the method of orthogonal polynomials for integrating, in the planar approximation, the partition function of one-matrix models with a potential with even or odd vertices, or any combination of them.
We study spaces of reflectionless Jacobi matrices. The main theme is the following type of question: Given a reflectionless Jacobi matrix, is it possible to approximate it by other reflectionless and, typically, simpler Jacobi matrices of a…