<p>Given an $n\times n$ Vandermonde integer matrix with structured integers (such as arithmetic or geometric progression).</p>

<p>Is complexity of approximately computing Vandermonde determinant upto multiplicative error $\epsilon_m$ and additive error $\epsilon_a$ studied in literature?</p>

CC BY-SA 3.0
2015-02-23T03:28:27.387Z
Why would you want an approximation, there is an explicit formula for the determinant as a product of $O(n^2)$ numbers.
Sasho Nikolov
CC BY-SA 3.0
2015-02-23T04:06:27.390Z
true.. if the number had structure, could we do better? without structure we cannot do better.
Turbo
<reference-request><linear-algebra>
Complexity of Approximating Vandermonde Determinant
Turbo
# Complexity of Approximating Vandermonde Determinant

(Asked by: username_0 on 2015-02-23)

Given an $n\times n$ Vandermonde integer matrix with structured integers (such as arithmetic or geometric progression).

Is complexity of approximately computing Vandermonde determinant upto multiplicative error $\epsilon\_m$ and additive error $\epsilon\_a$ studied in literature?

**Tags:** reference-request, linear-algebra

> **Comments:**
> **username_1**: Why would you want an approximation, there is an explicit formula for the determinant as a product of $O(n^2)$ numbers.  
> **username_0**: true.. if the number had structure, could we do better? without structure we cannot do better.  

---

## 0 answers

