Toeplitz Matrix: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 37: | Line 37: | ||
[[File:Linear System - Toeplitz Matrix - Time.png|1000px]] | [[File:Linear System - Toeplitz Matrix - Time.png|1000px]] | ||
== References/Citation == | == References/Citation == | ||
https://en.wikipedia.org/wiki/Levinson_recursion | https://en.wikipedia.org/wiki/Levinson_recursion | ||
Latest revision as of 10:05, 28 April 2023
Description
In this case, we restrict $A$ to be a Toeplitz matrix.
Related Problems
Generalizations: General Linear System
Related: Sparse Linear System, Positive Definite, Hermitian Matrix, Non-Definite, Symmetric Matrix, Vandermonde Matrix
Parameters
$n$: number of variables and number of equations
$m$: number of nonzero entries in matrix
$k$: ratio between largest and smallest eigenvalues
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Gaussian-Jordan Elimination | -150 | $O(n^{3})$ | $O(n^{2})$ | Exact | Deterministic | |
| Levinson–Durbin recursion | 1947 | $O(n^{2})$ | $O(n^{2})$ total | Exact | Deterministic | Time |
| Bareiss Algorithm | 1969 | $O(n^{2})$ | $O(n^{2})$ total | Exact | Deterministic | Time |
Time Complexity Graph
