Efficient algorithms for the solution of block linear systems with Toeplitz entries (Q1208301)
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 166248
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for the solution of block linear systems with Toeplitz entries |
scientific article; zbMATH DE number 166248 |
Statements
Efficient algorithms for the solution of block linear systems with Toeplitz entries (English)
0 references
16 May 1993
0 references
A system of linear equations with a positive definite block matrix is studied. The blocks are Toeplitz matrices (all elements on the same diagonal are equal). Two fast algorithms are given. The first one has a block Levinson structure, the second one reduces the process time to \(O(kp)\) time units in parallel processing where \(k\) is the block order of the system and \(p\) is the dimension of the largest submatrix.
0 references
block linear systems with Toeplitz entries
0 references
positive definite block matrix
0 references
Toeplitz matrices
0 references
fast algorithms
0 references
block Levinson structure
0 references
parallel processing
0 references
0 references
0 references
0.8373057842254639
0 references
0.8293306827545166
0 references
0.823828399181366
0 references
