Bounding matrix functionals via partial global block Lanczos decomposition
Authors:
- M. BellalijMBM. Bellalij
- L. ReichelLRL. Reichel
- G. RodriguezGRG. Rodriguez
- H. SadokHSH. Sadok
- 1 August 2015
- journal article
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 94, 127-139
Abstract
No abstract availableKeywords
Funding Information
- FMJH Program Gaspard Monge in optimization and operation research
- EDF
- NSF (DMS-1115385)
This publication has 24 references indexed in Scilit:
- Analysis of directed networks via partial singular value decomposition and Gauss quadratureLinear Algebra and its Applications, 2014
- Fast Matrix Computations for Pairwise and Columnwise Commute Times and Katz ScoresInternet Mathematics, 2012
- Moments of a linear operator, with applications to the trace of the inverse of matrices and the solution of equationsNumerical Linear Algebra with Applications, 2011
- Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrixJournal of the ACM, 2011
- Quadrature rule-based bounds for functions of adjacency matricesLinear Algebra and its Applications, 2010
- Network Properties Revealed through Matrix FunctionsSIAM Review, 2010
- Error Estimates and Evaluation of Matrix Functions via the Faber TransformSIAM Journal on Numerical Analysis, 2009
- Estimating the Estrada indexLinear Algebra and its Applications, 2007
- Some large-scale matrix computation problemsJournal of Computational and Applied Mathematics, 1996
- An Optimal Circulant Preconditioner for Toeplitz SystemsSIAM Journal on Scientific and Statistical Computing, 1988