Analysis of a Classical Matrix Preconditioning Algorithm

Author:

Schulman Leonard J.1,Sinclair Alistair2

Affiliation:

1. California Institute of Technology, Pasadena, CA

2. University of California, Berkeley

Abstract

We study a classical iterative algorithm for balancing matrices in the L norm via a scaling transformation. This algorithm, which goes back to Osborne and Parlett 8 Reinsch in the 1960s, is implemented as a standard preconditioner in many numerical linear algebra packages. Surprisingly, despite its widespread use over several decades, no bounds were known on its rate of convergence. In this article, we prove that, for any irreducible n × n (real or complex) input matrix A , a natural variant of the algorithm converges in O ( n 3 log ( n ρ/ε)) elementary balancing operations, where ρ measures the initial imbalance of A and ε is the target imbalance of the output matrix. (The imbalance of A is |log( a i out / a i in )|, where a i out , a i in are the maximum entries in magnitude in the i th row and column, respectively.) This bound is tight up to the log n factor. A balancing operation scales the i th row and column so that their maximum entries are equal, and requires O ( m / n ) arithmetic operations on average, where m is the number of nonzero elements in A . Thus, the running time of the iterative algorithm is Õ( n 2 m ). This is the first time bound of any kind on any variant of the Osborne-Parlett-Reinsch algorithm. We also prove a conjecture of Chen that characterizes those matrices for which the limit of the balancing process is independent of the order in which balancing operations are performed.

Funder

Simons Institute for the Theory of Computing

NSF

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference26 articles.

1. Linear Matrix Inequalities in System and Control Theory

2. T.-Y. Chen. 1998. Balancing Sparse Matrices for Computing Eigenvalues. Master’s thesis. UC Berkeley. T.-Y. Chen. 1998. Balancing Sparse Matrices for Computing Eigenvalues. Master’s thesis. UC Berkeley.

3. Balancing sparse matrices for computing eigenvalues

4. Line-sum-symmetric scalings of square nonnegative matrices

5. On the scaling of multidimensional matrices

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3