A Krylov Subspace Method for Covariance Approximation and Simulation of Random Processes and Fields
Authors:
- 1 October 2003
- journal article
- Published by Springer Nature in Multidimensional Systems and Signal Processing
- Vol. 14 (4) , 295-318
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Evaluation of matrix functions with the block Lanczos algorithmComputers & Mathematics with Applications, 1997
- Applied Numerical Linear Algebra1997
- Application of fast subspace decomposition to signal processing and communication problemsIEEE Transactions on Signal Processing, 1994
- Sequential data assimilation with a nonlinear quasi‐geostrophic model using Monte Carlo methods to forecast error statisticsJournal of Geophysical Research: Oceans, 1994
- Fast subspace decompositionIEEE Transactions on Signal Processing, 1994
- Fast algorithms for updating signal subspacesIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1994
- Signal detection in fractional Gaussian noiseIEEE Transactions on Information Theory, 1988
- An iterative solution method for solving f(A)x = b, using Krylov subspace information obtained for the symmetric positive definite matrix AJournal of Computational and Applied Mathematics, 1987
- On the Rates of Convergence of the Lanczos and the Block-Lanczos MethodsSIAM Journal on Numerical Analysis, 1980
- The Lanczos algorithm with selective orthogonalizationMathematics of Computation, 1979