Toeplitz Matrix

In this case, we restrict $A$ to be a Toeplitz matrix.

Parameters

$n$ : number of variables and number of equations
$m$ : number of nonzero entries in matrix
$k$ : ratio between largest and smallest eigenvalues

Related Problems

Sparse Quantum Linear System

Bounded Norm Quantum Linear System

Toeplitz Quantum Linear System

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Displaying 3 of 3 algorithms

				See more
Bareiss Algorithm	1969	$O(n^2)$	$O(n^2)$
Levinson–Durbin recursion	1947	$O(n^2)$	$O(n^2)$
Gaussian-Jordan Elimination	-150	$O(n^3)$	$O(n^2)$

Reductions Table

Insuffient Data to display table

Other relevant algorithms

Insuffient Data to display table