Vandermonde Matrix: Difference between revisions

From Algorithm Wiki
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 || 
|-
| [[Bjorck-Pereyra (Vandermonde Matrix Linear System)|Bjorck-Pereyra]] || 1970 || $O(n^{2})$ || $O(n^{2})$ total || Exact || Deterministic || [https://www-jstor-org.ezproxy.canberra.edu.au/stable/2004623?seq=1 Time]
| [[Bjorck-Pereyra (Vandermonde Matrix Linear System)|Bjorck-Pereyra]] || 1970 || $O(n^{2})$ || $O(n^{2})$ total || Exact || Deterministic || [https://www-jstor-org.ezproxy.canberra.edu.au/stable/2004623?seq=1 Time]
|-
|-
|}
|}


== Time Complexity graph ==  
== Time Complexity Graph ==  


[[File:Linear System - Vandermonde Matrix - Time.png|1000px]]
[[File:Linear System - Vandermonde Matrix - Time.png|1000px]]
== Space Complexity graph ==
[[File:Linear System - Vandermonde Matrix - Space.png|1000px]]
== Pareto Decades graph ==
[[File:Linear System - Vandermonde Matrix - Pareto Frontier.png|1000px]]

Latest revision as of 09:05, 28 April 2023

Description

In this case, we restrict $A$ to be a Vandermonde matrix.

Related Problems

Generalizations: General Linear System

Related: Sparse Linear System, Positive Definite, Hermitian Matrix, Non-Definite, Symmetric Matrix, Toeplitz 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
Bjorck-Pereyra 1970 $O(n^{2})$ $O(n^{2})$ total Exact Deterministic Time

Time Complexity Graph

Error creating thumbnail: Unable to save thumbnail to destination