Non-Definite, Symmetric Matrix: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 40: | Line 40: | ||
[[File:Linear System - Non-Definite, Symmetric Matrix - Space.png|1000px]] | [[File:Linear System - Non-Definite, Symmetric Matrix - Space.png|1000px]] | ||
== | == Space-Time Tradeoff Improvements == | ||
[[File:Linear System - Non-Definite, Symmetric Matrix - Pareto Frontier.png|1000px]] | [[File:Linear System - Non-Definite, Symmetric Matrix - Pareto Frontier.png|1000px]] | ||
Revision as of 15:34, 15 February 2023
Description
In this case, we restrict $A$ to be non-definite and symmetric.
Related Problems
Generalizations: General Linear System
Related: Sparse Linear System, Positive Definite, Hermitian 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 |
|---|---|---|---|---|---|---|
| Gaussian-Jordan Elimination | -150 | $O(n^{3})$ | $O(n^{2})$ | Exact | Deterministic | |
| Aasen's method | 1971 | $O(n^{3})$ | $O(n^{2})$ total | Exact | Deterministic | Time |
Time Complexity Graph
Space Complexity Graph
Space-Time Tradeoff Improvements
