Computing the Quadratic Numerical Range

05/25/2023
by   Birgit Jacob, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/09/2019

Quadratic Suffices for Over-parametrization via Matrix Chernoff Bound

We improve the over-parametrization size over two beautiful results [Li ...
research
08/25/2016

Minimizing Quadratic Functions in Constant Time

A sampling-based optimization method for quadratic functions is proposed...
research
05/10/2022

Matrix pencils with the numerical range equal to the whole complex plane

The main purpose of this article is to show that the numerical range of ...
research
12/02/2022

Expected Value of Matrix Quadratic Forms with Wishart distributed Random Matrices

To explore the limits of a stochastic gradient method, it may be useful ...
research
04/29/2019

A highly parallel algorithm for computing the action of a matrix exponential on a vector based on a multilevel Monte Carlo method

A novel algorithm for computing the action of a matrix exponential over ...
research
03/18/2022

Sampling Complexity of Path Integral Methods for Trajectory Optimization

The use of random sampling in decision-making and control has become pop...
research
01/29/2016

Efficient Robust Mean Value Calculation of 1D Features

A robust mean value is often a good alternative to the standard mean val...

Please sign up or login with your details

Forgot password? Click here to reset