Non-Definite, Symmetric Matrix (Linear System)

From Algorithm Wiki
Revision as of 09:05, 28 April 2023 by Admin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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

Linear System - Non-Definite, Symmetric Matrix - Time.png