Sparse Linear System: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:Sparse Linear System (Linear System)}} == Description == In this case, we restrict $A$ to be sparse (i.e. $A$ only has $O(n)$ nonzero entries). == Related Problems == Generalizations: General Linear System Related: Positive Definite, Hermitian Matrix, Non-Definite, Symmetric Matrix, Toeplitz Matrix, Vandermonde Matrix == Parameters == <pre>n: number of variables and number of equations m: number of nonzero entries in matrix k:...") |
No edit summary |
||
| Line 12: | Line 12: | ||
== Parameters == | == Parameters == | ||
n: number of variables and number of equations | |||
m: number of nonzero entries in matrix | m: number of nonzero entries in matrix | ||
k: ratio between largest and smallest eigenvalues | |||
k: ratio between largest and smallest eigenvalues | |||
== Table of Algorithms == | == Table of Algorithms == | ||
Revision as of 12:02, 15 February 2023
Description
In this case, we restrict $A$ to be sparse (i.e. $A$ only has $O(n)$ nonzero entries).
Related Problems
Generalizations: General Linear System
Related: Positive Definite, Hermitian Matrix, Non-Definite, Symmetric Matrix, Toeplitz 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 |
|---|---|---|---|---|---|---|
| Harrow (Quantum) | 2009 | $O(k^{2}*logn)$ | $O(log n)$ | Exact | Quantum | Time & Space |