Componentwise backward error analysis of Neville elimination
نویسندگان
چکیده
منابع مشابه
A collection of examples where Neville elimination outperforms Gaussian elimination
Neville elimination is an elimination procedure alternative to Gaussian elimination. It is very useful when dealing with totally positive matrices, for which nice stability results are known. Here we include examples, most of them test matrices used in MATLAB which are not totally positive matrices, where Neville elimination outperforms Gaussian elimination. 2010 Elsevier Inc. All rights reserved.
متن کاملComponentwise Error Analysis for Stationary Iterative Methods∗
How small can a stationary iterative method for solving a linear system Ax = b make the error and the residual in the presence of rounding errors? We give a componentwise error analysis that provides an answer to this question and we examine the implications for numerical stability. The Jacobi, Gauss-Seidel and successive overrelaxation methods are all found to be forward stable in a componentw...
متن کاملA PLU-factorization of rectangular matrices by the Neville elimination
In this paper we prove that Neville elimination can be matricially described by elementary matrices. A PLU-factorization is obtained for any n×m matrix, where P is a permutation matrix, L is a lower triangular matrix (product of bidiagonal factors) and U is an upper triangular matrix. This result generalizes the Neville factorization usually applied to characterize the totally positive matrices...
متن کاملBackward Error Analysis for Numerical Integrators Backward Error Analysis for Numerical Integrators
We consider backward error analysis of numerical approximations to ordinary diie-rential equations, i.e., the numerical solution is formally interpreted as the exact solution of a modiied diierential equation. A simple recursive deenition of the modiied equation is stated. This recursion is used to give a new proof of the exponentially closeness of the numerical solutions and the solutions to a...
متن کاملBackward Error Analysis in Computational Geometry
A recent paper, published in Algorithms—ESA2004, presented examples designed to illustrate that using floating-point arithmetic in algorithms for computational geometry may cause implementations to fail. The stated purpose was to demonstrate, to students and implementors, the inadequacy of floating-point arithmetic for geometric computations. The examples presented were both useful and insightf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2014
ISSN: 0024-3795
DOI: 10.1016/j.laa.2014.03.014