The algebra of elimination

1Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Elimination with only the necessary row exchanges will produce the triangular factorization A = LPU, with the (unique) permutation P in the middle. The entries in L are reordered in comparison with the more familiar A = PLU (where P is not unique). Elimination with three other starting points 1, n and n, n and n, 1 produces three more factorizations of A, including the Wiener–Hopf form UPL and Bruhat’s U1πU2 with two upper triangular factors. All these starting points are useless for doubly infinite matrices. The matrix has no first or last entry. When A is banded and invertible, we look for a new way to establish A = LPU. The key is to locate the pivot rows (we also find the main diagonal of A). LPU was previously known in the periodic (block Toeplitz) case A(i,j)=A(i+b,j+b), by factoring a matrix polynomial.

Cite

CITATION STYLE

APA

Strang, G. (2015). The algebra of elimination. In Applied and Numerical Harmonic Analysis (pp. 3–22). Springer International Publishing. https://doi.org/10.1007/978-3-319-13230-3_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free