Efficient algorithm for Toeplitz plus Hankel matrices (Q1119333)
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: Efficient algorithm for Toeplitz plus Hankel matrices |
scientific article; zbMATH DE number 4098608
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithm for Toeplitz plus Hankel matrices |
scientific article; zbMATH DE number 4098608 |
Statements
Efficient algorithm for Toeplitz plus Hankel matrices (English)
0 references
1989
0 references
An algorithm is given for the solution of a system of linear equations with a symmetric strongly regular coefficient matrix R which is the sum of a Toeplitz and a Hankel matrix with real elements. The derivation of the algorithm is based on a general approach to the solutions of a system of linear equations with structured coefficient matrices and integral equations with structured kernels developed earlier by the authors. It is pointed out that the number of multiplications (division) in the whole algorithm is \(5N^ 2+O(N)\).
0 references
Toeplitz plus Hankel matrices
0 references
sparse structured matrices
0 references
algorithm
0 references
sum of a Toeplitz and a Hankel matrix
0 references
0 references
0.9606577
0 references
0.9308692
0 references
0 references
0.91353697
0 references
0.90711665
0 references