A C++ Program for testing a Matrix For Sparsity and Diagonalization
Matrices are used extensively in both linear algebra and differential equations. Often times, processing a matrix can be very time consuming. The processing can often prove to be more computationally efficient if it is known if the matrix has a certain structure. If it can be determined that a matrix has such a structure, more efficient algorithms can then be developed to process the matrix. In this paper, source code is presented to preprocess a matrix to determine if the matrix is sparse and to test for the diagonalization, the number of diagonals with the same number of diagonals above and below the main diagonal. If this structure can be determined, new algorithms can be written to make the computational complexity of processing the matrix more effective and efficient.
- There are currently no refbacks.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.