Remarks on complexity of polynomial and special matrix computations (Q1824347)
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 4117736
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Remarks on complexity of polynomial and special matrix computations |
scientific article; zbMATH DE number 4117736 |
Statements
Remarks on complexity of polynomial and special matrix computations (English)
0 references
1989
0 references
The asymptotic order of complexity of the problems of polynomial and rational interpolation, polynomial evaluation and inversion of Löwner and Toeplitz or Hankel matrices is studied. The main result is that the solution of a Löwner matrix has not a larger order than the combination of rational interpolation and polynomial evaluation. There are other inequalities. The author emphasizes that there remains the open problem whether the whole group of the problems has the same order of complexity or not.
0 references
Toeplitz matrices
0 references
Löwner matrices
0 references
matrix inversion
0 references
asymptotic order of complexity
0 references
rational interpolation
0 references
polynomial evaluation
0 references
Hankel matrices
0 references
0.7792766690254211
0 references
0.7765618562698364
0 references
0.7728428244590759
0 references
