Abstract
This paper derives a priori residual-type bounds for the Arnoldi approximation of a matrix function together with a strategy for setting the iteration accuracies in the inexact Arnoldi approximation of matrix functions. Such results are based on the decay behavior of the entries of functions of banded matrices. Specifically, a priori decay bounds for the entries of functions of banded non-Hermitian matrices will be exploited, using Faber polynomial approximation. Numerical experiments illustrate the quality of the results.
Similar content being viewed by others
References
Afanasjew, M., Eiermann, M., Ernst, O.G., Güttel, S.: Implementation of a restarted Krylov subspace method for the evaluation of matrix functions. Linear Algebra Appl. 429(10), 2293–2314 (2008). https://doi.org/10.1016/j.laa.2008.06.029
Beckermann, B.: Image numérique, GMRES et polynômes de Faber. C. R. Math. Acad. Sci. Paris 340(11), 855–860 (2005)
Benzi, M., Boito, P.: Decay properties for functions of matrices over \(C^*\)-algebras. Linear Algebra Appl. 456, 174–198 (2014). https://doi.org/10.1016/j.laa.2013.11.027
Benzi, M., Boito, P., Razouk, N.: Decay properties of spectral projectors with applications to electronic structure. SIAM Rev. 55(1), 3–64 (2013). https://doi.org/10.1137/100814019
Benzi, M., Golub, G.H.: Bounds for the entries of matrix functions with applications to preconditioning. BIT 39(3), 417–438 (1999). https://doi.org/10.1023/A:1022362401426
Benzi, M., Razouk, N.: Decay bounds and O(n) algorithms for approximating functions of sparse matrices. Electron. Trans. Numer. Anal. 28, 16–39 (2007)
Benzi, M., Simoncini, V.: Decay bounds for functions of Hermitian matrices with banded or Kronecker structure. SIAM J. Matrix Anal. Appl. 36(3), 1263–1282 (2015). https://doi.org/10.1137/151006159
Botchev, M.A., Grimm, V., Hochbruck, M.: Residual, restarting and Richardson iteration for the matrix exponential. SIAM J. Sci. Comput. 35(3), A1376–A1397 (2013)
Canuto, C., Simoncini, V., Verani, M.: On the decay of the inverse of matrices that are sum of Kronecker products. Linear Algebra Appl. 452, 21–39 (2014). https://doi.org/10.1016/j.laa.2014.03.029
Cowen, C.C., Harel, E.: An Effective Algorithm for Computing the Numerical Range (1995). https://www.math.iupui.edu/ccowen/Downloads/33NumRange.html
Del Buono, N., Lopez, L., Peluso, R.: Computation of the exponential of large sparse skew-symmetric matrices. SIAM J. Sci. Comput. 27(1), 278–293 (2005). https://doi.org/10.1137/030600758
Demko, S.G.: Inverses of band matrices and local convergence of spline projections. SIAM J. Numer. Anal. 14(4), 616–619 (1977). https://doi.org/10.1137/0714041
Demko, S.G., Moss, W.F., Smith, P.W.: Decay rates for inverses of band matrices. Math. Comp. 43(168), 491–499 (1984). https://doi.org/10.2307/2008290
Dinh, K.N., Sidje, R.B.: Analysis of inexact Krylov subspace methods for approximating the matrix exponential. Math. Comput. Simul. 138, 1–13 (2017). https://doi.org/10.1016/j.matcom.2017.01.002. http://www.sciencedirect.com/science/article/pii/S0378475417300034
Druskin, V., Knizhnerman, L.: Krylov subspace approximation of eigenpairs and matrix functions in exact and computer arithmetic. Numer. Linear Algebra Appl. 2(3), 205–217 (1995). https://doi.org/10.1002/nla.1680020303
Eiermann, M.: Fields of values and iterative methods. Linear Algebra Appl. 180, 167–197 (1993). https://doi.org/10.1016/0024-3795(93)90530-2
Eiermann, M., Ernst, O.G., Güttel, S.: Deflated restarting for matrix functions. SIAM J. Matrix Anal. Appl. 32(2), 621–641 (2011)
Eijkhout, V., Polman, B.: Decay rates of inverses of banded M-matrices that are near to Toeplitz matrices. Linear Algebra Appl. 109, 247–277 (1988). https://doi.org/10.1016/0024-3795(88)90211-X. http://www.sciencedirect.com/science/article/pii/002437958890211X
Ellacott, S.W.: Computation of Faber series with application to numerical polynomial approximation in the complex plane. Math. Comp. 40(162), 575–587 (1983)
Freund, R.: On polynomial approximations to \(f_a(z)=(z-a)^{-1}\) with complex \(a\) and some applications to certain non-hermitian matrices. Approx. Theory Appl. 5, 15–31 (1989)
Frommer, A., Güttel, S., Schweitzer, M.: Convergence of restarted Krylov subspace methods for Stieltjes functions of matrices. SIAM J. Matrix Anal. Appl. 35(4), 1602–1624 (2014)
Frommer, A., Güttel, S., Schweitzer, M.: Efficient and stable Arnoldi restarts for matrix functions based on quadrature. SIAM J. Matrix Anal. Appl. 35(2), 661–683 (2014). https://doi.org/10.1137/13093491X
Frommer, A., Schimmel, C., Schweitzer, M.: Bounds for the decay of the entries in inverses and Cauchy-Stieltjes functions of certain sparse, normal matrices. Numer. Linear Algebra Appl. 25(4), e2131 (2018). https://doi.org/10.1002/nla.2131
Giraud, L., Langou, J., Rozložník, M., van den Eshof, J.: Rounding error analysis of the classical Gram-Schmidt orthogonalization process. Numer. Math. 101(1), 87–100 (2005)
Güttel, S.: Rational Krylov approximation of matrix functions: numerical methods and optimal pole selection. GAMM-Mitt. 36(1), 8–31 (2013). https://doi.org/10.1002/gamm.201310002
Güttel, S., Knizhnerman, L.: A black-box rational Arnoldi variant for Cauchy-Stieltjes matrix functions. BIT 53(3), 595–616 (2013). https://doi.org/10.1007/s10543-013-0420-x
Higham, N.J.: Functions of Matrices: Theory and Computation. Society for Industrial and Applied Mathematics, Philadelphia (2008)
Hochbruck, M., Lubich, C.: On Krylov subspace approximations to the matrix exponential operator. SIAM J. Numer. Anal. 34, 1911–1925 (1997)
Iserles, A.: How large is the exponential of a banded matrix? New Zealand J. Math. 29, 177–192 (2000)
Knizhnerman, L., Simoncini, V.: A new investigation of the extended Krylov subspace method for matrix function evaluations. Numer. Linear Algebra Appl. 17(4), 615–638 (2010). https://doi.org/10.1002/nla.652
Kürschner, P., Freitag, M.A.: Inexact methods for the low rank solution to large scale Lyapunov equations. arXiv preprint arXiv:1809.06903 (2018)
Matrix Market: A Visual Repository of Test Data for Use in Comparative Studies of Algorithms for Numerical Linear Algebra. Mathematical and Computational Sciences Division, National Institute of Standards and Technology; available online at http://math.nist.gov/MatrixMarket
Mastronardi, N., Ng, M., Tyrtyshnikov, E.E.: Decay in functions of multiband matrices. SIAM J. Matrix Anal. Appl. 31(5), 2721–2737 (2010). https://doi.org/10.1137/090758374
The MathWorks, Inc.: MATLAB 7, r2013b edn. (2013)
Meurant, G.: A review on the inverse of symmetric tridiagonal and block tridiagonal matrices. SIAM J. Matrix Anal. Appl. 13(3), 707–728 (1992). https://doi.org/10.1137/0613045
Pozza, S., Tudisco, F.: On the stability of network indices defined by means of matrix functions. SIAM J. Matrix Anal. Appl. 39(4), 1521–1546 (2018)
Rinehart, R.F.: The equivalence of definitions of a matric function. Amer. Math. Monthly 62(6), 395–414 (1955)
Saad, Y.: Analysis of some Krylov subspace approximations to the matrix exponential operator. SIAM J. Numer. Anal. 29(1), 209–228 (1992). https://doi.org/10.1137/0729014
Simoncini, V.: Variable accuracy of matrix-vector products in projection methods for eigencomputation. SIAM J. Numer. Anal. 43(3), 1155–1174 (2005)
Simoncini, V., Szyld, D.B.: Theory of inexact Krylov subspace methods and applications to scientific computing. SIAM J. Sci. Comput. 25(2), 454–477 (2003)
Suetin, P.K.: Series of Faber polynomials. Gordon and Breach Science Publishers (1998). Translated from the 1984 Russian original by E. V. Pankratiev [E. V. Pankrat\(^{\prime }\)ev]
Wang, H.: The Krylov Subspace Methods for the Computation of Matrix Exponentials. Ph.D. thesis, Department of Mathematics, University of Kentucky (2015)
Wang, H., Ye, Q.: Error bounds for the Krylov subspace methods for computations of matrix exponentials. SIAM J. Matrix Anal. Appl. 38(1), 155–187 (2017). https://doi.org/10.1137/16M1063733
Ye, Q.: Error bounds for the Lanczos methods for approximating matrix exponentials. SIAM J. Numer. Anal. 51(1), 68–87 (2013). https://doi.org/10.1137/11085935x
Acknowledgements
We are indebted with Leonid Knizhnerman for a careful reading of an earlier version of this manuscript, and for his many insightful remarks which led to great improvements of our results. We also thank Michele Benzi for several suggestions and the two referees whose remarks helped us improve the presentation.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Daniel Kressner.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This work has been supported by the FARB12SIMO grant, Università di Bologna, by INdAM-GNCS under the 2016 Project Equazioni e funzioni di matrici con struttura: analisi e algoritmi, by the INdAM-GNCS “Giovani ricercatori 2016” grant, and by Charles University Research program No. UNCE/SCI/023.
Appendix. Technical proofs
Appendix. Technical proofs
1.1 Proof of corollary 2.4
Let \(\rho = \sqrt{a^2 - b^2}\) be the distance between the foci and the center of the ellipse (i.e., the boundary of E), and let \(R = (a + b)/\rho \). Then a conformal map for E is
and its inverse is
see, e.g., [41, chapter II, Example 3]. Notice that
Hence by Theorem 2.3 we get
The optimal value of \(\tau > 1\) that minimizes \( e^{\frac{\rho }{2}\left( R\tau + \frac{1}{R\tau } \right) } \left( \frac{1}{\tau } \right) ^\xi \) is
Moreover, the condition \(\tau >1\) is satisfied if and only if \(\xi > \frac{\rho }{2}\left( R - \frac{1}{R} \right) = b\). Finally, noticing that
and collecting \(\xi \) the proof is completed. \(\square \)
1.2 Proof of Corollary 2.5
The function \(f(z) = \exp (- \sqrt{z})\) is analytic on \(\mathbb {C} \setminus (-\infty ,0)\). Since we consider the principal square root, then \(\mathfrak {R}(\sqrt{z})\ge 0\), and
Hence, by Theorem 2.3 we can determine \(\tau \) for which
For every \(\varepsilon > 0\) close enough to zero, we set the parameter
with \(\phi (w)\) as in (A.1) and \(\psi (z)\) its inverse (A.2). Then the ellipse \(\{ \psi (z), \, |z| = \tau _\varepsilon \}\) is contained in \(\mathbb {C}{\setminus }(-\infty ,0]\). Letting \(\varepsilon \rightarrow 0\) concludes the proof. \(\square \)
Rights and permissions
About this article
Cite this article
Pozza, S., Simoncini, V. Inexact Arnoldi residual estimates and decay properties for functions of non-Hermitian matrices. Bit Numer Math 59, 969–986 (2019). https://doi.org/10.1007/s10543-019-00763-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10543-019-00763-6
Keywords
- Arnoldi algorithm
- Inexact Arnoldi algorithm
- Matrix functions
- Faber polynomials
- Decay bounds
- Banded matrices