  A novel algorithm for the computation of the quadratic numerical range is
presented and exemplified yielding much better results in less time compared to
the random vector sampling method. Furthermore, a bound on the probability for
the random vector sampling method to produce a point exceeding a neighborhood
of the expectation value in dependence on norm and size of the matrix is given.
