Vandermonde Matrix: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:Vandermonde Matrix (Linear System)}} == 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 == <pre>n: number of variables and number of equations m: number of nonzero entries in matrix k: ratio between largest and sma...") |
No edit summary |
||
Line 12: | Line 12: | ||
== Parameters == | == Parameters == | ||
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 == |
Revision as of 12:02, 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 |
---|---|---|---|---|---|---|
Bjorck-Pereyra | 1970 | $O(n^{2})$ | $O(n^{2})$ total | Exact | Deterministic | Time |