2015.36: Max-Balanced Hungarian Scalings
2015.36: James Hook, Jennifer Pestana, Francoise Tisseur and Jonathan Hogg (2015) Max-Balanced Hungarian Scalings.
This is the latest version of this eprint.
Full text available as:
|PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
A Hungarian scaling is a diagonal scaling of a matrix that is typically applied along with a permutation to a sparse linear system before calling a direct or iterative solver. A matrix that has been Hungarian scaled and reordered has all entries of modulus less than or equal to 1 and entries of modulus 1 on the diagonal. An important fact that has been overlooked by the previous research into Hungarian scaling of linear systems is that a given matrix typically has a range of possible Hungarian scalings and direct or iterative solvers may behave quite differently under each of these scalings. Since standard algorithms for computing Hungarian scalings return only one scaling, it is natural to ask whether a superior performing scaling can be obtained by searching within the set of all possible Hungarian scalings. To this end we propose a method for computing a Hungarian scaling that is optimal from the point of view of diagonal dominance. Our method uses max-balancing, which minimizes the largest off-diagonal entries in the matrix. Numerical experiments illustrate the increased diagonal dominance produced by max-balanced Hungarian scaling as well as the reduced need for row interchanges in Gaussian elimination with partial pivoting and the improved stability of LU factorizations without pivoting. We additionally find that applying the max-balancing scaling before computing incomplete LU preconditioners improves the convergence rate of certain iterative methods.
|Item Type:||MIMS Preprint|
|Subjects:||MSC 2000 > 15 Linear and multilinear algebra; matrix theory|
MSC 2000 > 65 Numerical analysis
|Deposited By:||Dr Françoise Tisseur|
|Deposited On:||28 April 2017|
Available Versions of this Item
- Max-Balanced Hungarian Scalings (deposited 28 April 2017) [Currently Displayed]