Abstract
Osborne's iteration is a method for balancing n × 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 Rn, but it is normally used in the L2 norm. The choice of norm not only a ects the desired balance condition, but also defines the iterated balancing step itself. In this paper we focus on Osborne's iteration in any Lp norm, where p < ∞. We design a specific implementation of Osborne's iteration in any Lp norm that converges to a strictly - balanced matrix in O(− 2n9K) 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 L2 norm (or any Lp norm, p < ∞) strictly balances matrices in polynomial time. This is a substantial improvement over our recent result (in SODA 2017) that showed weak balancing in Lp norms. Previously, Schulman and Sinclair (STOC 2015) showed strict balancing of another variant of Osborne's iteration in the L∞ norm. Their result does not imply any bounds on strict balancing in other norms.
Original language | English |
---|---|
Title of host publication | 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018 |
Editors | Christos Kaklamanis, Daniel Marx, Ioannis Chatzigiannakis, Donald Sannella |
Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
ISBN (Electronic) | 9783959770767 |
DOIs | |
State | Published - 1 Jul 2018 |
Event | 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018 - Prague, Czech Republic Duration: 9 Jul 2018 → 13 Jul 2018 |
Publication series
Name | Leibniz International Proceedings in Informatics, LIPIcs |
---|---|
Volume | 107 |
ISSN (Print) | 1868-8969 |
Conference
Conference | 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018 |
---|---|
Country/Territory | Czech Republic |
City | Prague |
Period | 9/07/18 → 13/07/18 |
Bibliographical note
Publisher Copyright:© 2018 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.
Keywords
- Numerical linear algebra
- Optimization