### A method for the inverse numerical range problem.

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

An $n\times n$ ray pattern $\mathcal{A}$ is called a spectrally arbitrary ray pattern if the complex matrices in $Q\left(\mathcal{A}\right)$ give rise to all possible complex polynomials of degree $n$. In a paper of Mei, Gao, Shao, and Wang (2014) was proved that the minimum number of nonzeros in an $n\times n$ irreducible spectrally arbitrary ray pattern is $3n-1$. In this paper, we introduce a new family of spectrally arbitrary ray patterns of order $n$ with exactly $3n-1$ nonzeros.

An iterative inversion algorithm for a class of square matrices is derived and tested. The inverted matrix can be defined over both real and complex fields. This algorithm is based only on the operations of addition and multiplication. The numerics of the algorithm can cope with a short number representation and therefore can be very useful in the case of processors with limited possibilities, like different neuro-computers and accelerator cards. The quality of inversion can be traced and tested....

Blur is a common problem that limits the effective resolution of many imaging systems. In this article, we give a general overview of methods that can be used to reduce the blur. This includes the classical multi-channel deconvolution problems as well as challenging extensions to spatially varying blur. The proposed methods are formulated as energy minimization problems with specific regularization terms on images and blurs. Experiments on real data illustrate very good and stable performance of...