Error control technique of quadrature-based algorithms for the action of real powers of a Hermitian positive-definite matrix
This work addresses error control for iterative solvers in matrix computations, which is incremental for numerical linear algebra applications.
The study tackled the problem of controlling errors in quadrature-based algorithms for computing the action of a real power of a Hermitian positive-definite matrix on a vector, by bounding errors from iterative solvers and deriving a stopping criterion, with numerical results showing it enables computation within prescribed tolerance limits.
This study considers quadrature-based algorithms to compute $A^α\boldsymbol{b}$, the action of a real power of a Hermitian positive-definite matrix $A$ on a vector $ \boldsymbol{b}$. In these algorithms, the computation of an integral representation of $A^α \boldsymbol{b}$ is reduced to solving several tens or hundreds of shifted linear systems. Current approaches usually analyze the quadrature discretization error, but rarely take into account the additional error introduced by solving these shifted linear systems with iterative solvers. Here, we bound this error with the residual of the approximated solution of these linear systems. This allows the derivation of a stopping criterion for iterative solvers to keep the error of $A^α\boldsymbol{b}$ below a prescribed error tolerance. Numerical results demonstrate that the proposed criterion enables the computation of $A^α\boldsymbol{b}$ within prescribed tolerance limits.