Computing a Factor of a Polynomial by Means of Multishift <i> LR </i> Algorithms (Q4389067)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing a Factor of a Polynomial by Means of Multishift LR Algorithms |
scientific article; zbMATH DE number 1150969
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing a Factor of a Polynomial by Means of Multishift <i> LR </i> Algorithms |
scientific article; zbMATH DE number 1150969 |
Statements
Computing a Factor of a Polynomial by Means of Multishift <i> LR </i> Algorithms (English)
0 references
11 May 1998
0 references
factorization of polynomials
0 references
eigenvalue computation
0 references
LR algorithms
0 references
global convergence
0 references
numerical experiments
0 references
matrix transforms
0 references
functional iterations
0 references
complexity
0 references
algorithm
0 references
0.8069286942481995
0 references
0.7722413539886475
0 references
0.7686232328414917
0 references
