Sciweavers

Share
SIAMSC
2011

Computing f(A)b via Least Squares Polynomial Approximations

8 years 2 months ago
Computing f(A)b via Least Squares Polynomial Approximations
Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly computing the matrix f(A). Such methods were typically developed for a specific function f, a common case being that of the exponential. This paper discusses a procedure based on least squares polynomials that can, in principle, be applied to any (continuous) function f. The idea is to start by approximating the function by a spline of a desired accuracy. Then, a particular definition of the function inner product is invoked that facilitates the computation of the least squares polynomial to this spline function. Since the function is approximated by a polynomial, the matrix A is referenced only through a matrix-vector multiplication. In addition, the choice of the inner product makes it possible to avoid numerical integration. As an important application, we consider the case when f(t) = √ t and A is a spars...
Jie Chen, Mihai Anitescu, Yousef Saad
Added 15 May 2011
Updated 15 May 2011
Type Journal
Year 2011
Where SIAMSC
Authors Jie Chen, Mihai Anitescu, Yousef Saad
Comments (0)
books