Abstract
CvetkoviÄ-KostiÄ-Varga (CKV)-type matrices play a significant role in numerical linear algebra. However, verifying whether a given matrix is a CKV-type matrix is complicated because it involves choosing a suitable subset of $\{1,2,\ldots,n\}$. In this paper, we give some easily computable and verifiable equivalent conditions for a CKV-type matrix, and based on these conditions, two direct algorithms with less computational cost for identifying CKV-type matrices are put forward. Moreover, by considering the matrix sparsity pattern, two classes of matrices called $S$-Sparse Ostrowski-Brauer type-I and type-II matrices are proposed and then proved to be subclasses of CKV-type matrices. The relationships with other subclasses of $H$-matrices are also discussed. Besides, a new eigenvalue localization set involving the sparsity pattern for matrices is presented, which requires less computational cost than that provided by CvetkoviÄ et al. [Linear Algebra Appl., 608 (2021), pp.158â184].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: ETNA - Electronic Transactions on Numerical Analysis
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
