Randomized Preprocessing versus Pivoting II ∗

@inproceedings{Pan2010RandomizedPV,
  title={Randomized Preprocessing versus Pivoting II ∗},
  author={Victor Y. Pan and Guoliang Qian and A. Zheng},
  year={2010}
}
It is known that without pivoting Gaussian elimination can run significantly faster, particularly for matrices that have structure of Toeplitz or Hankel types, but becomes numerically unsafe. The known remedies take their toll, e.g., symmetrization squares the condition number of the input matrix. Can we fix the problem without such a punishment? Taking this challenge we combine randomized preconditioning techniques with iterative refinement and prove that this combination is expected to make… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 46 references

Technical Reports TRs 2009009 and 2010009

V. Y. Pan, G. Qian, Solving Linear Systems with Randomized Augmentation
Ph.D. Program in Computer Science, Graduate Center, the City University of New York, 2009 and • 2010
View 4 Excerpts
Highly Influenced

Newton’s Iteration for Matrix Inversion, Advances and Extensions, in Matrix methods: Theory, Algorithms and Applications (dedicated to the Memory of Gene

V. Y. Pan
H. Golub, edited by Vadim Olshevsky and Eugene Tyrtyshnikov), • 2010

Technical Report TR 2010012

V. Y. Pan, G. Qian, A. Zheng, Randomized Preconditioning of Linear Systems of Equations
Ph.D. Program in Computer Science, Graduate Center, the City University of New York, • 2010
View 8 Excerpts

Degeneration of Integer Matrices Modulo an Integer

V. Y. Pan, X. Wang
Linear Algebra and Its Applications, 429, 2113–2130 • 2008
View 2 Excerpts

Similar Papers

Loading similar papers…