License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2018.93
URN: urn:nbn:de:0030-drops-90976
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9097/
Ostrovsky, Rafail ;
Rabani, Yuval ;
Yousefi, Arman
Strictly Balancing Matrices in Polynomial Time Using Osborne's Iteration
Abstract
Osborne's iteration is a method for balancing n x n matrices which is widely used in linear algebra packages, as balancing preserves eigenvalues and stabilizes their numeral computation. The iteration can be implemented in any norm over R^n, but it is normally used in the L_2 norm. The choice of norm not only affects the desired balance condition, but also defines the iterated balancing step itself.
In this paper we focus on Osborne's iteration in any L_p norm, where p < infty. We design a specific implementation of Osborne's iteration in any L_p norm that converges to a strictly epsilon-balanced matrix in O~(epsilon^{-2}n^{9} K) iterations, where K measures, roughly, the number of bits required to represent the entries of the input matrix.
This is the first result that proves a variant of Osborne's iteration in the L_2 norm (or any L_p norm, p < infty) strictly balances matrices in polynomial time. This is a substantial improvement over our recent result (in SODA 2017) that showed weak balancing in L_p norms. Previously, Schulman and Sinclair (STOC 2015) showed strict balancing of another variant of Osborne's iteration in the L_infty norm. Their result does not imply any bounds on strict balancing in other norms.
BibTeX - Entry
@InProceedings{ostrovsky_et_al:LIPIcs:2018:9097,
author = {Rafail Ostrovsky and Yuval Rabani and Arman Yousefi},
title = {{Strictly Balancing Matrices in Polynomial Time Using Osborne's Iteration}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {93:1--93:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-076-7},
ISSN = {1868-8969},
year = {2018},
volume = {107},
editor = {Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'a}niel Marx and Donald Sannella},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9097},
URN = {urn:nbn:de:0030-drops-90976},
doi = {10.4230/LIPIcs.ICALP.2018.93},
annote = {Keywords: Numerical Linear Algebra, Optimization}
}
|
Keywords: |
|
Numerical Linear Algebra, Optimization |
|
Collection: |
|
45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
04.07.2018 |
