Related papers: Matrix methods for Pad\'e approximation: numerical…
In transferring some results from universal Taylor series to the case of Pad\'e approximants we obtain stronger results, such as, universal approximation on compact sets of arbitrary connectivity and generic results on planar domains of any…
Approximation of entire functions by their pad\'e approximants has been examined in the past. It is true that generically such an approximation holds. However, examining this problem from another viewpoint, we obtain stronger generic…
Pade-approximant methods are used to extract information about leading positive zeros or poles of QCD and SQCD beta-functions from the known terms of their perturbative series. For QCD, such methods are seen to corroborate the…
This paper describes a suite of algorithms for constructing low-rank approximations of an input matrix from a random linear image of the matrix, called a sketch. These methods can preserve structural properties of the input matrix, such as…
The main purpose of this paper is to give a solution to a conjecture concerning a Pad\'{e} family of iterations for the matrix sector function that was recently raised by B. Laszkiewicz et al in [A Pad\'{e} family of iterations for the…
We derive approximation algorithms for the nonnegative matrix factorization problem, i.e. the problem of factorizing a matrix as the product of two matrices with nonnegative coefficients. We form convex approximations of this problem which…
We derive an analytic expression for the scalar one-loop pentagon and hexagon functions which is convenient for subsequent numerical integration. These functions are of relevance in the computation of next-to-leading order radiative…
In various areas of applied numerics, the problem of calculating the logarithm of a matrix A emerges. Since series expansions of the logarithm usually do not converge well for matrices far away from the identity, the standard numerical…
Algorithms for the computation of the forward and inverse geodesic problems for an ellipsoid of revolution are derived. These are accurate to better than 15 nm when applied to the terrestrial ellipsoids. The solutions of other problems…
Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…
A new recalibration post-processing method is presented to improve the quality of the posterior approximation when using Approximate Bayesian Computation (ABC) algorithms. Recalibration may be used in conjunction with existing…
In this paper a novel numerical approximation of parametric eigenvalue problems is presented. We motivate our study with the analysis of a POD reduced order model for a simple one dimensional example. In particular, we introduce a new…
We obtain rates of convergence of numerical approximations of abstract linear parabolic evolution equations in Banach spaces. Our estimates extend known results from the literature of finite element approximations of parabolic equations to…
It is proved that among the rational iterations locally converging with order s>1 to the sign function, the Pad\'e iterations and their reciprocals are the unique rationals with the lowest sum of the degrees of numerator and denominator.
This paper focuses on numerical approximation for fractional powers of elliptic operators on $2$-d manifolds. Firstly, parametric finite element method is employed to discretize the original problem. We then approximate fractional powers of…
First, an abstract scheme of constructing biorthogonal rational systems related to some interpolation problems is proposed. We also present a modification of the famous step-by-step process of solving the Nevanlinna-Pick problems for…
Proper Orthogonal Decomposition (POD) is a widely used technique for the construction of low-dimensional approximation spaces from high-dimensional input data. For large-scale applications and an increasing amount of input data vectors,…
The use of approximants of Pad\`e type are employed to develop a method aimed at opening new perspectives in the theory of Appell polynomials $a_n(x)$, specified by the generating function \sum_{n=0}^{\infty} \frac{t^n}{n!} a_n(x) = A(t)…
A method for approximate solution of initial value and spectral problems for one dimensional Dirac equation based on an analytic approximation of the transmutation operator is presented. In fact the problem of numerical approximation of…
We investigate the problem of determining the zeros of quaternionic polynomials using matrix method. In a recent paper, Dar et al. \cite{RD} proved that the zeros of a quaternionic polynomial and the left eigenvalues of the corresponding…