Non-Definite, Symmetric Matrix: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "{{DISPLAYTITLE:Non-Definite, Symmetric Matrix (Linear System)}} == 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 == <pre>n: number of variables and number of equations m: number of nonzero entries in matrix k: ratio between largest a...")
 
No edit summary
Line 12: Line 12:
== Parameters ==  
== Parameters ==  


<pre>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</pre>
 
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 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
Aasen's method 1971 $O(n^{3})$ $O(n^{2})$ total Exact Deterministic Time

Time Complexity graph

Error creating thumbnail: Unable to save thumbnail to destination

Space Complexity graph

Error creating thumbnail: Unable to save thumbnail to destination

Pareto Decades graph

Error creating thumbnail: Unable to save thumbnail to destination