Gauss pivot algorithm. Consequences
Matrix calculation

Article REF: AF86 V1

Gauss pivot algorithm. Consequences
Matrix calculation

Authors : Gérard DEBEAUMARCHÉ, Danièle LINO

Publication date: October 10, 1998, Review date: November 19, 2019 | Lire en français

You do not have access to this resource.

Request your free trial access! Free trial

Already subscribed?Log in!

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 = (m _{i, j} ) as a matrix belonging to $M_{n, p} (K)$ . We now describe what are known as...

You do not have access to this resource.

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed? Log in!

Ongoing reading
Gauss pivot algorithm. Consequences

Article included in this offer

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources