The generalized Schur algorithm and some applications (Q2305951): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Paul Van Dooren / rank | |||
Property / author | |||
Property / author: Paul Van Dooren / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.3390/axioms7040081 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2899523484 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 20:19, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The generalized Schur algorithm and some applications |
scientific article |
Statements
The generalized Schur algorithm and some applications (English)
0 references
20 March 2020
0 references
Summary: The generalized Schur algorithm is a powerful tool allowing to compute classical decompositions of matrices, such as the \(QR\) and \(LU\) factorizations. When applied to matrices with particular structures, the generalized Schur algorithm computes these factorizations with a complexity of one order of magnitude less than that of classical algorithms based on Householder or elementary transformations. In this manuscript, we describe the main features of the generalized Schur algorithm. We show that it helps to prove some theoretical properties of the \(R\) factor of the \(QR\) factorization of some structured matrices, such as symmetric positive definite Toeplitz and Sylvester matrices, that can hardly be proven using classical linear algebra tools. Moreover, we propose a fast implementation of the generalized Schur algorithm for computing the rank of Sylvester matrices, arising in a number of applications. Finally, we propose a generalized Schur based algorithm for computing the null-space of polynomial matrices.
0 references
generalized Schur algorithm
0 references
null-space
0 references
displacement rank
0 references
structured matrices
0 references