# How ordinary elimination became Gaussian elimination

```@article{Grcar2011HowOE,
title={How ordinary elimination became Gaussian elimination},
author={Joseph F. Grcar},
journal={Historia Mathematica},
year={2011},
volume={38},
pages={163-218}
}```
• J. Grcar
• Published 14 July 2009
• Computer Science
• Historia Mathematica
48 Citations

## Figures and Tables from this paper

Mathematicians of Gaussian Elimination
This article summarizes the evolution of Gaussian elimination through themiddle of the twentieth century, which has had three phases: First came the schoolbook lesson, beginning with Isaac Newton, next were methods for professional hand computers, which began with Gauss, who apparently was inspired by work of JosephLouis Lagrange.
Gaussian Elimination and LU-Decomposition
Solving sets of linear equations as a component of dealing with larger problems like partial-differential-equation solving, or optimization, consumes more computer time than any other computational procedure.
John von Neumann's Analysis of Gaussian Elimination and the Origins of Modern Numerical Analysis
Just when modern computers were being invented, John von Neumann and Herman Goldstine wrote a paper to illustrate the mathematical analyses that they believed would be needed to use the new machines effectively and to guide the development of still faster computers.
Alan Turing and the origins of modern Gaussian elimination ∗
The contributions of Alan Turing and other authors to the error analysis of Gaussian elimination, the historical context of these contributions, and their in uence on modern Numerical Analysis are revised.
Gaussian Elimination 1
An overview of Gaussian elimination is given, ranging from theory to computation, and why GE computes an LU factorization and the various benefits of this matrix factorization viewpoint are explained.
System of Linear Equations, Gaussian Elimination
• Mathematics
• 2015
The goal of this research was to analyze different elimination techniques of linear equations and measure the performance of Guassian elimination and Guass Jordan method, in order to find their relative importance and advantage in the field of symbolic and numeric computation.
Alan Turing y los orígenes de la eliminación gaussiana moderna
The purpose of this paper is to revise the contributions of Alan Turing and other authors to the error analysis of Gaussian elimination, the historical context of these contributions, and their influence on modern Numerical Analysis.
Gaussian elimination
• N. Higham
• Computer Science
Introduction to Finite Elements in Engineering
• 2021
An overview of Gaussian elimination is given, ranging from theory to computation, and why GE computes an LU factorization and the various benefits of this matrix factorization viewpoint are explained.
Using Gauss - Jordan elimination method with The Application of Android for Solving Linear Equations
• Computer Science
International Journal for Educational and Vocational Studies
• 2019
Overall regarding content, proper software that can be used by students and lecturers in implementing numerical methods because there are ways to use the application and steps to solve linear equation problems using the GJ-elimination method.
Another Introduction to Geometric Algebra with some Comments on Moore-Penrose Inverses
• Maarten Horn
• Mathematics
Journal of Physics: Conference Series
• 2018
With his theory of extensions Hermann Grassmann gave algebra a substantial different shape: He indeed had invented a generalized version of Pauli and Dirac Algebra which can be applied not only to

## References

SHOWING 1-10 OF 271 REFERENCES
NOTES ON THE SOLUTION OF ALGEBRAIC LINEAR SIMULTANEOUS EQUATIONS
• Mathematics
• 1948
In this paper four methods of solving simultaneous equations and inverting matrices are described from the viewpoint of the practical computer. The first three methods can be performed on ordinary
Pierre-Simon Laplace, 1749-1827. A Life in Exact Science
Laplace is a name known to most physical scientists and mathematicians, if only for the Laplace transform method of solving differential equations, but few will know much about his life and work. He
ROUNDING-OFF ERRORS IN MATRIX PROCESSES
A number of methods of solving sets of linear equations and inverting matrices are discussed. The theory of the rounding-off errors involved is investigated for some of the methods. In all cases
James Hardy Wilkinson, 27 September 1919 - 5 October 1986
• L. Fox
• History
Biographical Memoirs of Fellows of the Royal Society
• 1987
James Hardy Wilkinson was the first professional numerical analyst to be elected to the Fellowship of the Royal Society and the nickname ‘Wilkie’ occurs in section 5.
Solving linear algebraic equations can be interesting
Here A is a square matrix of order n, whose elements are given real numbers ai3' with a determinant d(A)9 0] x and b denote column vectors, and the components of b are given real numbers. (Complex
The Doolittle Method for Solving Multiple Correlation Equations versus the Kelley-Salisbury “Iteration” Method
• Geology
• 1927
In presenting a new " iteration " method for solving normal equations by the use of conversion formulae' Kelley and Salisbury make the statement "that it cuts down the labor of a 16 variable problem
The Computer from Pascal to von Neumann
From the Publisher: In 1942, Lt. Herman H. Goldstine, a former mathematics professor, was stationed at the Moore School of Electrical Engineering at the University of Pennsylvania where he assisted
The mathematical papers of Isaac Newton
• Linguistics
• 1967
This is a complete edition in eight volumes of all the known mathematical papers of Isaac Newton - edited, annotated and translated by D. T. Whiteside. Papers originally in Latin are provided with
Mathematics in the time of the pharaohs
In writing the first book-length study of ancient Egyptian mathematics, Richard Gillings presents evidence that Egyptian achievements in this area are much more substantial than has been previously