Abstract Let A be any matrix and let A be a slight random perturbation of A. We prove that it is unlikely that A has large condition number. Using this result, we prove it is unlikely that A has large growth factor under Gaussian elimination without pivoting. By combining these results, we bound the smoothed precision needed by Gaussian elimination without pivoting. Our results improve the average-case analysis of Gaussian elimination without pivoting performed by Yeung and Chan (SIAM J. Matrix Anal. Appl., 1997)
AbstractWe consider the values for large minors of a skew-Hadamard matrix or conference matrix W of ...
The Higham matrix is a complex symmetric matrix A=B+iC, where both B and C are real, symmetric and p...
The Higham matrix is a complex symmetric matrix A=B+iC, where both B and C are real, symmetric and p...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2004.Includes bibliogr...
Abstract. The growth factor plays an important role in the error analysis of Gaussian elimination. I...
The growth factor plays an important role in the error analysis of Gaussian elimination. It is well ...
AbstractWe consider Gaussian elimination without pivoting applied to complex Gaussian matrices X∈Cn×...
AbstractSeveral definitions of growth factors for Gaussian elimination are compared. Some new pivoti...
Several de¯nitions of growth factors for Gaussian elimination are compared. Some new piv- oting stra...
Abstract. It has been conjectured that when Gaussian elimination with complete pivoting is applied t...
J.H. Wilkinson put Gaussian elimination (GE) on a sound numerical footing in the 1960's when he sho...
The smallest singular value and condition number play important roles in numerical linear algebra an...
The generalized Higham matrix is a complex symmetric matrix A=B+iC, where both B and C are Hermitian...
For any linear program, we show that a slight random relative perturbation of that linear program ha...
The Higham matrix is a complex symmetric matrix A=B+iC, where both B and C are real, symmetric and p...
AbstractWe consider the values for large minors of a skew-Hadamard matrix or conference matrix W of ...
The Higham matrix is a complex symmetric matrix A=B+iC, where both B and C are real, symmetric and p...
The Higham matrix is a complex symmetric matrix A=B+iC, where both B and C are real, symmetric and p...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2004.Includes bibliogr...
Abstract. The growth factor plays an important role in the error analysis of Gaussian elimination. I...
The growth factor plays an important role in the error analysis of Gaussian elimination. It is well ...
AbstractWe consider Gaussian elimination without pivoting applied to complex Gaussian matrices X∈Cn×...
AbstractSeveral definitions of growth factors for Gaussian elimination are compared. Some new pivoti...
Several de¯nitions of growth factors for Gaussian elimination are compared. Some new piv- oting stra...
Abstract. It has been conjectured that when Gaussian elimination with complete pivoting is applied t...
J.H. Wilkinson put Gaussian elimination (GE) on a sound numerical footing in the 1960's when he sho...
The smallest singular value and condition number play important roles in numerical linear algebra an...
The generalized Higham matrix is a complex symmetric matrix A=B+iC, where both B and C are Hermitian...
For any linear program, we show that a slight random relative perturbation of that linear program ha...
The Higham matrix is a complex symmetric matrix A=B+iC, where both B and C are real, symmetric and p...
AbstractWe consider the values for large minors of a skew-Hadamard matrix or conference matrix W of ...
The Higham matrix is a complex symmetric matrix A=B+iC, where both B and C are real, symmetric and p...
The Higham matrix is a complex symmetric matrix A=B+iC, where both B and C are real, symmetric and p...