Rigidity and Shrinkability of Diagonalizable Matrices
Dimitris Karayannakis, Maria-Evgenia Xezonaki
Journal of Advances in Mathematics and Computer Science · pp. 1–15 · Published 22 Apr 2017
10.9734/BJMCS/2017/32839Abstract
We introduce the seemingly new concept of a rigid matrix based on the comparison of its sparsity to the sparsity of the natural powers of the matrix. Our results could be useful as a usage guide in the scheduling of various iterative algorithms that appear in numerical linear algebra. Especially in Sparse matrix-vector multiplication and they could also be used in matrix norm error analysis.
Cited by 0
No indexed citations yet.
Related research
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
0
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.