Ljiljana Cvetković
University of Novi Sad
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Ljiljana Cvetković.
Numerical Algorithms | 2006
Ljiljana Cvetković
The eigenvalue localization problem is very closely related to the
Applied Mathematics and Computation | 2013
Ljiljana Cvetković; Ping-Fan Dai; Ksenija Doroslovački; Yao-tang Li
H
Applied Mathematics and Computation | 2009
Ljiljana Cvetković; Vladimir Kostić; Sonja Rauški
-matrix theory. The most elegant example of this relation is the equivalence between the Geršgorin theorem and the theorem about nonsingularity of SDD (strictly diagonally dominant) matrices, which is a starting point for further beautiful results in the book of Varga [19]. Furthermore, the corresponding Geršgorin-type theorem is equivalent to the statement that each matrix from a particular subclass of
Numerical Linear Algebra With Applications | 2014
Ljiljana Cvetković; Vladimir Kostić
H
Advances in Computational Mathematics | 2011
Ljiljana Cvetković; Vladimir Kostić; Rafael Bru; Francisco Pedroche
-matrices is nonsingular. Finally, the statement that all eigenvalues of a given matrix belong to minimal Geršgorin set (defined in [19]) is equivalent to the statement that every
SIAM Journal on Matrix Analysis and Applications | 2011
Ljiljana Cvetković; Vladimir Kostić; Juan Manuel Peña
H
Applied Mathematics and Computation | 2008
Ljiljana Cvetković; Vladimir Kostić; Maja Kovačević; Tomasz Szulc
-matrix is nonsingular. Since minimal Geršgorin set remained unattainable, a lot of different Geršgorin-type areas for eigenvalues has been developed recently. Along with them, a lot of new subclasses of
Applied Mathematics and Computation | 2012
Ljiljana Cvetković; Vladimir Kostić; Ksenija Doroslovački
H
Numerical Linear Algebra With Applications | 2009
Vladimir Kostić; Ljiljana Cvetković; Richard S. Varga
-matrices were obtained. A survey of recent results in both areas, as well as their relationships, will be presented in this paper.
Numerical Algorithms | 2006
Ljiljana Cvetković; Vladimir Kostić
From the application point of view, it is important to have a good upper bound for the maximum norm of the inverse of a given matrix A. In this paper we will give two simple and practical upper bounds for the maximum norm of the inverse of a Nekrasov matrix.