Frobenius matrix
Frobenius matrix is a matrix in numerical mathematics.
All 2 facts, and where they come from
Facts
2 facts · 0 confirmed by two sources · 0 cited · 2 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 17, 2026 · revision 2462905017
- Described as
- matrix in numerical mathematics
- What it is
- mathematical concept
- Named after
- Ferdinand Georg Frobenius
- Wikipedias with a page
- 8
Wikidata item Q1469444 (wikidata.org/wiki/Q1469444), public domain (CC0). Copied 2026-11-17.
What Wikipedia says · copied November 17, 2026 · revision 1377701413
A Frobenius matrix is a special kind of square matrix from numerical analysis. A matrix is a Frobenius matrix if it has the following three properties:
all entries on the main diagonal are ones
the entries below the main diagonal of at most one column are arbitrary
every other entry is zero
The following matrix is an example.A=(100⋯0010⋯00a321⋯0⋮⋮⋮⋱⋮0an20⋯1)
Frobenius matrices are invertible. The inverse of a Frobenius matrix is again a Frobenius matrix, equal to the original matrix with changed signs outside the main diagonal. The inverse of the example above is therefore:A−1=(100⋯0010⋯00−a321⋯0⋮⋮⋮⋱⋮0−an20⋯1)
Frobenius matrices are named after Ferdinand Georg Frobenius.
The term Frobenius matrix may also be used for an alternative matrix form that differs from an Identity matrix only in the elements of a single row preceding the diagonal entry of that row (as opposed to the above definition which has the matrix differing from the identity matrix in a single column below the diagonal). The following matrix is an example of this alternative form showing a 4-by-4 matrix with its 3rd row differing from the identity matrix.A=(10000100a31a32100001)
An alternative name for this latter form of Frobenius matrices is Gauss transformation matrix, after Carl Friedrich Gauss. They are used in the process of Gaussian elimination to represent the Gaussian transformations.
If a matrix is multiplied from the left (left multiplied) with a Gauss transformation matrix, a linear combination of the preceding rows is added to the given row of the matrix (in the example shown above, a linear combination of rows 1 and 2 will be added to row 3). Multiplication with the inverse matrix subtracts the corresponding linear combination from the given row. This corresponds to one of the elementary operations of Gaussian elimination (besides the operation of transposing the rows and multiplying a row with a scalar multiple).
From the Wikipedia article “Frobenius matrix” (en.wikipedia.org/wiki/Frobenius_matrix), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
