A Collection of Problems for Which Gaussian Elimination with Partial Pivoting is Unstable

@article{Wright1993ACO,
  title={A Collection of Problems for Which Gaussian Elimination with Partial Pivoting is Unstable},
  author={Stephen J. Wright},
  journal={SIAM J. Sci. Comput.},
  year={1993},
  volume={14},
  pages={231-238}
}
A significant collection of two-point boundary value problems is shown to give rise to linear systems of algebraic equations on which Gaussian elimination with row partial pivoting is unstable when standard solution techniques are used. 
Row – Column Pivoting in Gaussian Elimination ∗
We introduce a new policy of pivoting in Gaussian elimination and test its power versus partial and complete pivoting. According to our extensive tests, the policy is as stable numerically as
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 means for reducing communications in parallel
Threshold-pivoting in parallel Gaussian elimination for improved efficiency
TLDR
The application of threshold pivoting in dense Gaussian elimination for improving the performance of a parallel implementation is described and the effect on the numerical stability is discussed.
TR-2007021: Row-Column Pivoting in Gaussian Elimination
We introduce a new policy of pivoting in Gaussian elimination and test its power versus partial and complete pivoting. According to our extensive tests, the policy is as stable numerically as
Stable parallel elimination for boundary value odes
Summary.A parallelizable and vectorizable algorithm for solving linear algebraic systems arising from two-point boundary value ODEs is described. The method is equivalent to Gaussian elimination,
Algorithms and Library Software for Periodic and Parallel Eigenvalue Reordering and Sylvester-Type Matrix Equations with Condition Estimation
This Thesis contains contributions in two different but closely related subfields of Scientific and Parallel Computing which arise in the context of various eigenvalue problems: periodic and parall
A collection of examples where Neville elimination outperforms Gaussian elimination
TLDR
Examples are included, most of them test matrices used in MATLAB which are not totally positive matrices, where Neville elimination outperforms Gaussian elimination.
Cost of stable algorithms for bordered almost block diagonal systems
We show that the cost of stable, sequential elimination for bordered almost block diagonal systems is essentially the same whether using QR factorizations or using stable, structured or unstructured,
The stable parallel solution of general narrow banded linear systems
We propose a stable algorithm for the parallel solution of banded and periodically banded linear systems. While most of the known parallel algorithms are stable only for symmetric positive de nite or
Probabilistic analysis of complex Gaussian elimination without pivoting
Abstract We consider Gaussian elimination without pivoting applied to complex Gaussian matrices X ∈ C n×n . We first study some independence properties of the elements of the LU factors of X . Based
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 11 REFERENCES
Stable Parallel Algorithms for Two-Point Boundary Value Problems
TLDR
It is shown here that a structured orthogonal factorization technique can be used to solve this system of linear equations, and hence the overall problem, in an efficient, parallel, and stable way.
Large growth factors in Gaussian elimination with pivoting
The growth factor plays an important role in the error analysis of Gaussian elimination. It is well known that when partial pivoting or complete pivoting is used the growth factor is usually small,
Linear system solvers for boundary value ODEs
Abstract We investigate the stability properties of several linear system solvers for solving boundary value ODEs. We consider the compactification algorithm, Gaussian elimination with row partial
The algebraic eigenvalue problem
Theoretical background Perturbation theory Error analysis Solution of linear algebraic equations Hermitian matrices Reduction of a general matrix to condensed form Eigenvalues of matrices of
Average-case stability of Gaussian elimination
Gaussian elimination with partial pivoting is unstable in the worst case: the “growth factor” can be as large as $2^{n - 1} $, where n is the matrix dimension, resulting in a loss of $n - 1$ bits of
Three mysteries of Gaussian elimination
If numerical analysts understand anything, surely it must be Gaussian elimination. This is the oldest and truest of numerical algorithms. To be precise, I am speaking of Gaussian elimination with
The Close Relationships between Methods for Solving Two-Point Boundary Value Problems
The well-conditioning of a boundary value problem is shown to be related to bounding two quantities, one involving the boundary conditions and the other involving the Green’s function. In the case of
Decoupling and Stability of Algorithms for Boundary Value Problems
The ordinary differential equations occurring in linear boundary value problems characteristically have both stable and unstable solution modes. Therefore a stable numerical algorithm should avoid
Numerical Solution of Boundary Value Problems for Ordinary Di erential Equations, Prentice-Hall
  • Englewood Cli s,
  • 1988
Numerical Solution of Boundary Value Problems for Ordinary Diierential Equations
  • Numerical Solution of Boundary Value Problems for Ordinary Diierential Equations
  • 1988
...
1
2
...