An algorithm for computing the eigenstructure of a regular matrix polynomial (Q1822455): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(87)90071-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2156494024 / rank | |||
Normal rank | |||
Revision as of 21:15, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for computing the eigenstructure of a regular matrix polynomial |
scientific article |
Statements
An algorithm for computing the eigenstructure of a regular matrix polynomial (English)
0 references
1987
0 references
An algorithm for separating ranges and nullspaces of a general matrix pencil using LU decompositions is described. It is an alternative to the orthogonal factorizations used by other authors as e.g. \textit{B. Kågström} [SIAM J. Sci. Stat. Comput. 7, 185-211 (1986; Zbl 0593.65027)] and \textit{P. Van Dooren} [Linear Alg. Appl. 27, 103-140 (1979; Zbl 0416.65026)].
0 references
range and nullspace separation
0 references
matrix pencil
0 references
LU decompositions
0 references
