返回
AN IMPROVED DQDS ALGORITHM
DOI:10.1137/120881087.png)
摘要
En 中文
In this paper we present an improved DQDS algorithm for computing all the singular values of a bidiagonal matrix to high relative accuracy. There are two key contributions: a novel deflation strategy that improves the convergence for badly scaled matrices, and some modifications to certain shift strategies that accelerate the convergence for most bidiagonal matrices. These techniques together ensure linear worst case complexity of the improved algorithm (denoted by V5). Our extensive numerical experiments indicate that V5 is typically 1.2x-4x faster than DLASQ (the LAPACK-3.4.0 implementation of DQDS) without any degradation in accuracy. On matrices for which DLASQ shows very slow convergence, V5 can be 3x-10x faster. We develop a hybrid algorithm (HDLASQ) by combining our improvements with the aggressive early deflation strategy (AggDef2 in [Y. Nakatsukasa, K. Aishima, and I. Yamazaki, SIAM J. Matrix Anal. Appl., 33 (2012), pp. 22-51]). Numerical results show that HDLASQ is the fastest among these different versions.
Keyword:
DQDS
singular value
d-deflation
DLASQ
LAPACK
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
The significance of the anatomy of the skull base for mechanical modelling: A comparative study颅底解剖对力学建模的意义:一项比较研究
Temperature dependence of the dielectric function and the interband critical-point parameters of GaP
An Enterprise Knowledge Management System (EKMS) Based on Knowledge Evaluation by the Public基于公众知识评价的企业知识管理系统(EKMS)
没有更多内容

