In linear algebra, Gaussian elimination (also known as row reduction) is an algorithm for solving systems of linear equations. It is usually… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2011

2011

- Joseph F. Grcar
- 2011

G aussian elimination is universally known as “the” method for solving simultaneous linear equations. As Leonhard Euler remarked… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Marcin Mucha, Piotr Sankowski
- 45th Annual IEEE Symposium on Foundations of…
- 2004

We present randomized algorithms for finding maximum matchings in general and bipartite graphs. Both algorithms have running time… (More)

Is this relevant?

2004

2004

- Marcin Mucha, Piotr Sankowski
- Algorithmica
- 2004

We present a randomized algorithm for finding maximum matchings in planar graphs in timeO(n ω/2), whereω is the exponent of the… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- James Demmel, John R. Gilbert, Xiaoye S. Li
- SIAM J. Matrix Analysis Applications
- 1999

Although Gaussian elimination with partial pivoting is a robust algorithm to solve unsymmetric sparse linear systems of equations… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Rina Dechter
- Artif. Intell.
- 1999

Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and… (More)

Is this relevant?

1996

1996

Sparse Gaussian Elimination on High Performance Computers

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Markus Olschowka
- 1996

This paper discusses a method for determining a good pivoting sequence for Gaussian elimination, based on an algorithm for… (More)

Is this relevant?

1985

1985

- Danny C. Sorensen
- IEEE Transactions on Computers
- 1985

The method of Gaussian elimination using triangularization by elementary stabilized matrices constructed by pairwise pivoting is… (More)

Is this relevant?

Highly Cited

1983

Highly Cited

1983

- Daniel Lazard
- EUROCAL
- 1983

In the past few years, two very different methods have been developed for solving systems of algebraic equations : the method of… (More)

Is this relevant?

Highly Cited

1982

Highly Cited

1982

- Robert Schreiber
- ACM Trans. Math. Softw.
- 1982

When only a small fraction of the elements of A are nonzero, A is said to be sparse. When a sparse matr ix is factored, "fill-in… (More)

Is this relevant?