On computational complexity for the multiplication of generalized Hilbert matrices with vectors and solution of certain generalized linear Hilbert systems (Q920579)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On computational complexity for the multiplication of generalized Hilbert matrices with vectors and solution of certain generalized linear Hilbert systems |
scientific article |
Statements
On computational complexity for the multiplication of generalized Hilbert matrices with vectors and solution of certain generalized linear Hilbert systems (English)
0 references
1990
0 references
The author shows the existence of a fast algorithm with \(O(np \log n \log np)\) time complexity of the multiplication of generalized Hilbert matrices with vectors. The method is based on the fast polynomial evaluation and interpolation. For \(p=1\), it is shown that to solve the generalized linear Hilbert system \(B_ 1x=d\) only requires \(O(n \log n)\) arithmetic operations.
0 references
computational complexity
0 references
matrix-vector multiplication
0 references
fast algorithm
0 references
time complexity
0 references
Hilbert matrices
0 references
fast polynomial evaluation
0 references
interpolation
0 references
