Gaussian elimination

Known as: Gauss Elimination, Gauss–Jordan elimination, Gauss elimination method 
In linear algebra, Gaussian elimination (also known as row reduction) is an algorithm for solving systems of linear equations. It is usually… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1958-2017
05010019582017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
G aussian elimination is universally known as “the” method for solving simultaneous linear equations. As Leonhard Euler remarked… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We present randomized algorithms for finding maximum matchings in general and bipartite graphs. Both algorithms have running time… (More)
  • figure 1
Is this relevant?
2004
2004
We present a randomized algorithm for finding maximum matchings in planar graphs in timeO(n ω/2), whereω is the exponent of the… (More)
  • figure 2
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Although Gaussian elimination with partial pivoting is a robust algorithm to solve unsymmetric sparse linear systems of equations… (More)
  • figure 12
  • figure 14
  • figure 19
  • figure 23
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and… (More)
  • figure 1
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
1996
1996
Sparse Gaussian Elimination on High Performance Computers 
  • figure 3.1
  • figure 3.2
  • table 3.1
  • figure 3.3
  • figure 3.4
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)
  • table 1
  • table 2
Is this relevant?
1985
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
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
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?