Computing rank-deficiency of rectangular matrix pencils (Q1094094)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4024636
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing rank-deficiency of rectangular matrix pencils |
scientific article; zbMATH DE number 4024636 |
Statements
Computing rank-deficiency of rectangular matrix pencils (English)
0 references
1987
0 references
From author's summary: We examine a method to find the distance from an arbitrary given matrix pencil to a nearby rank-deficient one. We propose an experimental computational method that exhibits quadratic convergence to a local minimum of the distance function.
0 references
rank-deficiency
0 references
matrix pencil
0 references
experimental computational method
0 references
quadratic convergence
0 references
local minimum of the distance function
0 references
0 references
0.7913857698440552
0 references
0.7814629673957825
0 references
0.7727062106132507
0 references
0.7597478628158569
0 references
0.7561331987380981
0 references
