Pole Allocation for Rational Gauss Quadrature Rules for Matrix Functionals Defined by a Stieltjes Function
Open Access
Abstract
This paper considers the computation of approximations of matrix functionals of form , where A is a large symmetric positive definite matrix, v is a vector, and f is a Stieltjes function. The functional is approximated by a rational Gauss quadrature rule with poles on the negative real axis (or part thereof) in the complex plane, and we focus on the allocation of the poles. Specifically, we propose that the poles, when considered positive point charges, be allocated to make the negative real axis (or part thereof) approximate an equipotential curve. This is easily achieved with the aid of conformal mapping.
Keywords
This publication has 12 references indexed in Scilit:
- Rational Krylov for Stieltjes matrix functions: convergence and pole selectionBIT Numerical Mathematics, 2020
- Error bounds and estimates for Krylov subspace approximations of Stieltjes matrix functionsBIT Numerical Mathematics, 2015
- Rational Gauss QuadratureSIAM Journal on Numerical Analysis, 2014
- A black-box rational Arnoldi variant for Cauchy–Stieltjes matrix functionsBIT Numerical Mathematics, 2013
- Recurrence relations for orthogonal rational functionsNumerische Mathematik, 2012
- Matrices, Moments and Quadrature with Applications2009
- Functions of Matrices2008
- Orthogonal Polynomials2004
- Superfast Solution of Real Positive Definite Toeplitz SystemsSIAM Journal on Matrix Analysis and Applications, 1988
- Computational complex analysis1974