Positive Definite, Hermitian Matrix (Linear System)

From Algorithm Wiki
Revision as of 08:18, 10 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 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
Gaussian-Jordan Elimination -150 $O(n^{3})$ $O(n^{2})$ Exact Deterministic
Cholesky 1940 $O(n^{3})$ $O(n^{2})$ Exact Deterministic

Time Complexity Graph

Linear System - Positive Definite, Hermitian Matrix - Time.png

Space Complexity Graph

Linear System - Positive Definite, Hermitian Matrix - Space.png

Time-Space Tradeoff

Linear System - Positive Definite, Hermitian Matrix - Pareto Frontier.png