5. Gauss pivot algorithm. Consequences
This paragraph describes the Gauss pivot algorithm. It allows :
a simple, numerically efficient algorithm for solving systems and inverting square matrices;
to specify simple generators of the linear group.
5.1 Basic matrix manipulations
In this section, we refer to M = (mi, j ) as a matrix belonging to . We now describe what are known as elementary manipulations on the rows of this matrix.
-
Addition to a line of another line...
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
Gauss pivot algorithm. Consequences
Determinants
Article included in this offer
"Mathematics"
(
168 articles
)
Updated and enriched with articles validated by our scientific committees
A set of exclusive tools to complement the resources
