Non-Definite, Symmetric Matrix: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| (4 intermediate revisions by the same user not shown) | |||
| Line 12: | Line 12: | ||
== Parameters == | == Parameters == | ||
n: number of variables and number of equations | $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 == | ||
| Line 26: | Line 26: | ||
|- | |- | ||
| [[Gaussian-Jordan Elimination (General Linear System; Positive Definite, Hermitian Matrix; Non-Definite, Symmetric Matrix; Toeplitz Matrix; Vandermonde Matrix Linear System)|Gaussian-Jordan Elimination]] || -150 || $O(n^{3})$ || $O(n^{2})$ || Exact || Deterministic || | |||
|- | |||
| [[Aasen's method (Non-Definite, Symmetric Matrix Linear System)|Aasen's method]] || 1971 || $O(n^{3})$ || $O(n^{2})$ total || Exact || Deterministic || [https://link.springer.com/article/10.1007/BF01931804 Time] | | [[Aasen's method (Non-Definite, Symmetric Matrix Linear System)|Aasen's method]] || 1971 || $O(n^{3})$ || $O(n^{2})$ total || Exact || Deterministic || [https://link.springer.com/article/10.1007/BF01931804 Time] | ||
|- | |- | ||
|} | |} | ||
== Time Complexity | == Time Complexity Graph == | ||
[[File:Linear System - Non-Definite, Symmetric Matrix - Time.png|1000px]] | [[File:Linear System - Non-Definite, Symmetric Matrix - Time.png|1000px]] | ||
Latest revision as of 09:05, 28 April 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
