Positive Definite, Hermitian Matrix: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "{{DISPLAYTITLE:Positive Definite, Hermitian Matrix (Linear System)}} == Description == In this case, we restrict $A$ to be positive definite and hermitian (or symmetric, if $A$ is real-valued). == Related Problems == Generalizations: General Linear System Related: Sparse Linear System, Non-Definite, Symmetric Matrix, Toeplitz Matrix, Vandermonde Matrix == Parameters == <pre>n: number of variables and number of equations m: number of nonzero e...")
 
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 positive definite and hermitian (or symmetric, if $A$ is real-valued).

Related Problems

Generalizations: General Linear System

Related: Sparse Linear System, 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
Cholesky 1940 $O(n^{3})$ $O(n^{2})$ Exact Deterministic

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