Related papers: An improved algorithm to compute the exponential o…
In this paper, we present novel deterministic algorithms for multiplying two $n \times n$ matrices approximately. Given two matrices $A,B$ we return a matrix $C'$ which is an \emph{approximation} to $C = AB$. We consider the notion of…
This article deals with the computation of the characteristic polynomial of dense matrices over small finite fields and over the integers. We first present two algorithms for the finite fields: one is based on Krylov iterates and Gaussian…
We here calculate the series expansion of the T-matrix for a spheroidal particle in the small-size/long-wavelength limit, up to third lowest order with respect to the size parameter, X, which we will define rigorously for a non-spherical…
In this paper we consider the problem of obtaining sharp bounds for the performance of temporal difference (TD) methods with linear function approximation for policy evaluation in discounted Markov decision processes. We show that a simple…
Taylor's formula holds significant importance in function representation, such as solving differential difference equations, ordinary differential equations, partial differential equations, and further promotes applications in visual…
We recover the Tutte polynomial of a matroid, up to change of coordinates, from an Ehrhart-style polynomial counting lattice points in the Minkowski sum of its base polytope and scalings of simplices. Our polynomial has coefficients of…
The polynomial eigenvalue problem arises in many applications and has received a great deal of attention over the last decade. The use of root-finding methods to solve the polynomial eigenvalue problem dates back to the work of…
The objective of this paper is to investigate a new numerical method for the approximation of the self-diffusion matrix of a tagged particle process defined on a grid. While standard numerical methods make use of long-time averages of…
Consider a matrix polynomial $P \left( \lambda \right)= A_0 + \lambda A_1 + \ldots + \lambda^d A_d$, with $A_0,\ldots, A_d$ complex (or real) matrices with a certain structure. In this paper we discuss an iterative method to numerically…
In this paper, we derive a variant of the Taylor theorem to obtain a new minimized remainder. For a given function $f$ defined on the interval $[a,b]$, this formula is derived by introducing a linear combination of $f'$ computed at $n+1$…
To approximate solutions of a linear differential equation, we project, via trigonometric interpolation, its solution space onto a finite-dimensional space of trigonometric polynomials and construct a matrix representation of the…
In this work, new closed-form formulas for the matrix exponential are provided. Our method is direct and elementary, it gives tractable and manageable formulas not current in the extensive literature on this essential subject. Moreover,…
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an $n\times n$ matrix over a finite field that requires $O(n^3)$ field operations and O(n) random vectors, and is well suited for successful practical…
This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some of the output variables are also input variables, linked by a linear dependency. Fundamental examples…
A new method of matrix spectral factorization is proposed which reliably computes an approximate spectral factor of any matrix spectral density that admits spectral factorization
We consider the problem of estimating the spectral norm of a matrix using only matrix-vector products. We propose a new Counterbalance estimator that provides upper bounds on the norm and derive probabilistic guarantees on its…
The standard approach for finding eigenvalues and eigenvectors of matrix polynomials starts by embedding the coefficients of the polynomial into a matrix pencil, known as linearization. Building on the pioneering work of Nakatsukasa and…
An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant…
We provide new exact Taylor's series with fixed coefficients and without the remainder. We demonstrate the usefulness of this contribution by using it to obtain very simple solutions to (non-linear) PDEs. We also apply the method to the…
In this article, we describe an implementation of a polynomial system solver to compute the approximate solutions of a 0-dimensional polynomial system with finite precision p-adic arithmetic. We also describe an improvement to an algorithm…