MATHICSE-GroupKostić, V. R.Miedlar, A.Cvetković, LJ.2019-10-212019-10-212019-10-212015-03-0110.5075/epfl-MATHICSE-271446https://infoscience.epfl.ch/handle/20.500.14299/162166The first algorithms for computing the minimal Geršgorn set were developed by Varga et all. in [17] for the use on small and medium size (dense) matrices. Here, we first discuss the existing methods and present a new approach based on the modified Newton’s method to find zeros of the parameter dependent left-most eigenvalue of a Z-matrix. Additionally, sampling technique used in the original work is replaced by a special curve tracing procedure. The advantages of the new approach are presented on several test examples that arise in practical applications.Minimal Geršgorin setEigenvalue localizationCurve tracingtext::working paper