| L. V. Foster, The growth factor and e#ciency of Gaussian elimination with rook pivoting. Accepted for publication in J. Comp. and Appl. Math. |
....the idle time. 4.2 Pivoting for stability To ensure stability of the factorization, we bound the magnitudes of entries in both L and U by a user supplied tolerance. For the symmetric case, the algorithm is described and analyzed in [5] For the nonsymmetric case, it is known as rook pivoting [8, 17]. Partial pivoting, where rows (or columns) are interchanged, bounds entries only in L (or U ) In most cases, pivoting adds little cost to a serial or parallel factorization, as long as the pivot tolerance and or matrix structure does not induce too many postponed rows and columns. We recommend ....
L. V. Foster, The growth factor and e#ciency of Gaussian elimination with rook pivoting. Accepted for publication in J. Comp. and Appl. Math.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC