...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Signal Processing: The Official Publication of the European Association for Signal Processing (EURASIP) >FAST COMPUTATION OF THE PRINCIPAL SINGULAR VECTORS OF TOEPLITZ MATRICES ARISING IN EXPONENTIAL DATA MODELLING
【24h】

FAST COMPUTATION OF THE PRINCIPAL SINGULAR VECTORS OF TOEPLITZ MATRICES ARISING IN EXPONENTIAL DATA MODELLING

机译：FAST COMPUTATION OF THE PRINCIPAL SINGULAR VECTORS OF TOEPLITZ MATRICES ARISING IN EXPONENTIAL DATA MODELLING

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       
页面导航
  • 摘要
  • 著录项
  • 相关主题

摘要

A comparison is made of algorithms for computing the largest singular values and corresponding singular vectors of a Toeplitz matrix. In many applications the signal subspace is the subspace spanned by those singular vectors. Algorithms, based on the Lanczos procedure, for computing a few singular values of a sparse matrix are discussed, and the fast Fourier transform (FFT) is used for the matrix-vector multiplication. In particular, we consider a recently developed implicitly restarted Lanczos algorithm, and we give evidence that for Toeplitz matrices arising in exponential data modelling, this algorithm is both more efficient and more reliable than other Lanczos variants. Numerical tests also indicate that this algorithm may be up to one hundred times faster than standard algorithms (from LAPACK) even for problems of modest size. [References: 30]

著录项

获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号