Orthogonal polynomial expansions for the matrix exponential
نویسنده
چکیده
Many different algorithms have been suggested for computing the matrix exponential. In this paper, we put forward the idea of expanding in either Chebyshev, Legendre or Laguerre orthogonal polynomials. In order for these expansions to converge quickly, we cluster the eigenvalues into diagonal blocks and accelerate using shifting and scaling.
منابع مشابه
A Fast Algorithm for Orthogonal Polynomial Expansions on Sparse Grids∗
A fast algorithm is developed to compute orthogonal polynomial expansions on sparse grids for a function of d variables in a weighted L space. The proposed algorithm combines the fast cosine transform, a fast transform from the Chebyshev orthogonal polynomial basis to the orthogonal polynomial basis for the weighted L space and a fast algorithm of computing hierarchically structured basis funct...
متن کاملOrthogonal polynomial expansions on sparse grids
We study the orthogonal polynomial expansion on sparse grids for a function of d variables in a weighted L space. A fast algorithm is developed to compute the orthogonal polynomial expansion by combining the fast cosine transform, a fast transform from the Chebyshev orthogonal polynomial basis to the orthogonal polynomial basis for the weighted L space, and a fast algorithm of computing hierarc...
متن کاملOrthogonal Polynomials of Discrete Variable and Boundedness of Dirichlet Kernel
Abstract. For orthogonal polynomials defined by compact Jacobi matrix with exponential decay of the coefficients, precise properties of orthogonality measure is determined. This allows showing uniform boundedness of partial sums of orthogonal expansions with respect to L∞ norm, which generalize analogous results obtained for little qLegendre, little q-Jacobi and little q-Laguerre polynomials, b...
متن کاملComputing exp ( − τA ) b by the Filtered Conjugate Residual Algorithm ∗
This paper discusses a class of Filtered Conjugate Residual Algorithms (FCR) as a way to compute the product of the exponential of a matrix by an arbitrary vector. These methods utilize implicitly expansions of the exponential function in a basis of orthogonal polynomials. FCR methods based on Laguerre, Hermite, and Chebyshev polynomials, are described and their performances are compared. The p...
متن کاملPointwise bounds of orthogonal expansions on the real line via weighted Hilbert transforms
We study pointwise bounds of orthogonal expansions on the real line for a class of exponential weights of smooth polynomial decay at infinity. As a consequence of our main results, we establish pointwise bounds for weighted Hilbert transforms which are of independent interest.
متن کامل