Iterative refinement implies numerical stability for Gaussian elimination
نویسندگان
چکیده
منابع مشابه
Iterative Refinement Implies Numerical Stability for Gaussian Elimination
Because of scaling problems, Gaussian elimination with pivoting is not always as accurate as one might reasonably expect. It is shown that even a single iteration of iterative refinement in single precision is enough to make Gaussian elimination stable in a very strong sense. Also, it is shown that without iterative refinement row pivoting is inferior to column pivoting in situations where the ...
متن کاملAverage - Case Stability of Gaussian Elimination 337
Gaussian elimination with partial pivoting is unstable in the worst case: the "growth factor" can be as large as 2"-l, where n is the matrix dimension, resulting in a loss of n bits of precision. It is proposed that an average-case analysis can help explain why it is nevertheless stable in practice. The results presented begin with the observation that for many distributions of matrices, the ma...
متن کاملIterative numerical methods for sampling from high dimensional Gaussian distributions
Many applications require efficient sampling from Gaussian distributions. The method of choice depends on the dimension of the problem as well as the structure of the covariance-(Σ) or precision matrix (Q). The most common black-box routine for computing a sample is based on Cholesky factorisation. In high dimensions, computing the Cholesky factor of Σ or Q may be prohibitive due to massive fil...
متن کاملStability of a Pivoting Strategy for Parallel Gaussian Elimination
Gaussian elimination with partial pivoting achieved by adding the pivot row to the kth row at step k, was introduced by Onaga and Takechi in 1986 as a means for reducing communications in parallel implementations. In this paper it is shown that the growth factor of this partial pivoting algorithm is bounded above by μn < 3 n−1, as compared to 2n−1 for the standard partial pivoting. This bound μ...
متن کاملNumerical Stability of Iterative Solvers for Inverse Kinematics
In its basic formulation, the inverse kinematics (IK) problem seeks to compute a set of joint angles such that the end of a given joint chain coincides with a certain position in space. Further constraints, such as orientation, velocity, and preferences for curvature, are possible, but beyond the scope of this project. In this report, we describe the basic forward and inverse kinematics problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1980
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1980-0572859-4