首页> 外文期刊>Signal Processing, IEEE Transactions on >Superfast Tikhonov Regularization of Toeplitz Systems
【24h】

Superfast Tikhonov Regularization of Toeplitz Systems

机译:Toeplitz系统的超快Tikhonov正则化

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Toeplitz-structured linear systems arise often in practical engineering problems. Correspondingly, a number of algorithms have been developed that exploit Toeplitz structure to gain computational efficiency when solving these systems. Early “fast” algorithms required $ {cal O}(n^{2})$ operations, but recent “superfast” algorithms are more efficient. In this work, we present a superfast algorithm for Tikhonov regularization of Toeplitz systems. Using an “extension-and-transformation” technique, our algorithm translates a Tikhonov-regularized Toeplitz system into a type of specialized polynomial problem known as tangential interpolation. Under this formulation, we can compute the solution in only $ {cal O}(KNlog ^{2} N)$ operations, where $K$ is the number of regularizers and $N$ is on the order of the number of parameters defining the system matrix. Our algorithm is further improved with displacement structure, which reduces the complexity when solving the system for multiple input vectors. We use numerical simulations to demonstrate our algorithm's complexity and accuracy.
机译:Toeplitz结构的线性系统经常出现在实际的工程问题中。相应地,已经开发出许多算法,它们在解决这些系统时利用Toeplitz结构来提高计算效率。早期的“快速”算法需要$ {cal O}(n ^ {2})$个运算,但是最近的“超快速”算法效率更高。在这项工作中,我们提出了Toeplitz系统的Tikhonov正则化的超快速算法。我们的算法使用“扩展和转换”技术,将Tikhonov正则化的Toeplitz系统转换为一种称为切线插值的专业多项式问题。在此公式下,我们只能在$ {cal O}(KNlog ^ {2} N)$个运算中计算解,其中$ K $是正则化器的数量,而$ N $则是定义参数的数量的顺序系统矩阵。位移结构进一步改进了我们的算法,从而降低了系统求解多个输入向量时的复杂度。我们使用数值模拟来证明我们算法的复杂性和准确性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号