Vandermonde Matrix: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
Line 40: Line 40:
[[File:Linear System - Vandermonde Matrix - Space.png|1000px]]
[[File:Linear System - Vandermonde Matrix - Space.png|1000px]]


== Pareto Frontier Improvements Graph ==  
== Space-Time Tradeoff Improvements ==  


[[File:Linear System - Vandermonde Matrix - Pareto Frontier.png|1000px]]
[[File:Linear System - Vandermonde Matrix - Pareto Frontier.png|1000px]]

Revision as of 15:34, 15 February 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

Space Complexity Graph

Error creating thumbnail: Unable to save thumbnail to destination

Space-Time Tradeoff Improvements

Error creating thumbnail: Unable to save thumbnail to destination