This study proposes a method for the acceleration of the projection method to compute a few eigenvalues with the largest real parts of a large nonsymmetric matrix. In the eld of the solution of the linear system, an acceleration using the least squares polynomial which minimizes its norm on the boundary of the convex hull formed with the unwanted eigenvalues are proposed. We simplify this metho...

This study proposes a new method for the acceleration of the projection method to compute a few eigenvalues with the largest real parts of a large nonsymmetric matrix. In the eld of the solution of the linear system, an acceleration using the least squares polynomial which minimizes its norm on the boundary of the convex hull formed with the unwanted eigenvalues are proposed. We simplify this m...

The eigenvalues of G are denoted by [Formula: see text], where n is the order of G. In particular, [Formula: see text] is called the spectral radius of G, [Formula: see text] is the least eigenvalue of G, and the spread of G is defined to be the difference between [Formula: see text] and [Formula: see text]. Let [Formula: see text] be the set of n-vertex unicyclic graphs, each of whose vertices...

In this contribution we consider the timeaveraged GPS single-baseline model and study in a qualitative sense its relation with the geometry-free model and the geometry-based model. The least-squares estimators of the model are derived and their properties discussed. Special attention is given to the ambiguity search space, since it plays such a crucial role in the problem of integer ambiguity e...

In this paper, using variational analysis and optimization techniques, we examine some fundamental analytic properties of Z-eigenvalues of a real symmetric tensor with even order. We first establish that the maximum Z-eigenvalue function is a continuous and convex function on the symmetric tensor space, and so, provide formulas of the convex conjugate function and ε-subdifferential of the maxim...

‎based on an eigenvalue analysis‎, ‎a new proof for the sufficient‎ ‎descent property of the modified polak-ribière-polyak conjugate‎ ‎gradient method proposed by yu et al‎. ‎is presented‎.

A novel approach for sub-band based multi-microphone speech dereverberation is presented. In recent contribution a method utilizing the null subspace of the spatial-temporal correlation matrix of the received signals (obtained by the generalized eigenvalue decomposition (GEVD) procedure). The desired acoustic transfer functions (ATF-s) are shown to be embedded in these generalized eigenvectors....

This paper gives an upper bound for the first eigenvalue of the universal cover of a complete, stable minimal surface in hyperbolic space, and a sharper one for least area disks.

If A is an n × n complex matrix and λ is an eigenvalue of A with geometric multiplicity k, then λ is in at least k of the n Geršgorin discs of A.