IMA Journal of Numerical Analysis · 2009 · 52 citations · 17 references
Natural SciencesMathematicsComputational PhysicsDynamical SystemsOptimizationApproximation AlgorithmsApproximation MethodsMatrix ComputationNumerical AlgorithmsNumerical AnalysisNumerical Linear AlgebraComputational Matrix Theory
In this paper the error term in the ‘first’ method of Eiermann & Ernst (2006, SIAM J. Numer. Anal., 44, 2481–2504) for restarting the Lanczos approximation of the matrix–vector product f(A)b, where A ∈ ℝn× n is symmetric, is re-derived and expressed as an explicit partial fraction expansion of the divided differences. The partial fraction representation makes the new variant slightly more stable (albeit still unstable) than the former method because it requires fewer finite-difference evaluations. We then present an error bound for the restarted Lanczos approximation of f(A)b for symmetric positive-definite A when f is in a particular class of completely monotone functions and illustrate for some important matrix function applications the usefulness of these bounds for terminating the restart process once the desired accuracy in the matrix function approximation has been achieved. Finally, in an attempt to overcome the inherent instability of our restart procedure, we propose a simple heuristic that identifies when to halt the iterations.
17
Markov Chain Monte Carlo in Practice
Mauro Gasparini, W. R. Gilks, Sylvia Richardson et al. · Technometrics · 1997 · 1.8K citations
Business, Biostatistics, Statistics +14
Roger B. Sidje · ACM Transactions on Mathematical Software · 1998 · 802 citations · Full text
Gaussian Markov Random Fields: Theory and Applications
Jeffrey D. Picka · Technometrics · 2006 · 407 citations