Toeplitz Matrix (Linear System)
Revision as of 11:18, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Toeplitz Matrix (Linear System)}} == 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 == <pre>n: number of variables and number of equations m: number of nonzero entries in matrix k: ratio between largest and smalle...")
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 |
|---|---|---|---|---|---|---|
| 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
Space Complexity graph
Pareto Decades graph
