Sparse matrices, Data Structure & Algorithms

SPARSE MATRICES

Matrices along with good number of zero entries are called sparse matrices.

Refer the following matrices of Figure

2312_SPARSE MATRICES.png

(a)                                                                   (b)

Figure: (a) Triangular Matrix (b) Tridiagonal Matrix

A triangular matrix is a square matrix wherein all of the elements either above or below the main diagonal are zero. Triangular matrices are kind of sparse matrices. A tridiagonal matrix is also kind of square matrix wherein all of the elements except for the chief diagonal, diagonals on the instant upper & lower side are zeroes. Tridiagonal matrices are also  a kind of sparse matrices.

Posted Date: 4/4/2013 6:27:50 AM | Location : United States







Related Discussions:- Sparse matrices, Assignment Help, Ask Question on Sparse matrices, Get Answer, Expert's Help, Sparse matrices Discussions

Write discussion on Sparse matrices
Your posts are moderated
Related Questions
Difference among Prism's and Kruskal's Algorithm In Kruskal's algorithm, the set A is a forest. The safe edge added to A is always a least-weight edge in the paragraph that lin

what happen''s in my computer when i input any passage

The size of stack was declared as ten. Thus, stack cannot hold more than ten elements. The major operations which can be performed onto a stack are push and pop. However, in a prog

Graph Traversal In many problems we wish to investigate all the vertices in a graph in some systematic order. In graph we often do not have any single vertex singled out as spe

Write an algorithm for binary search. Algorithm for Binary Search 1.  if (low> high) 2.  return (-1) 3.  Mid = (low + high)/2 4.  if ( X = = a[mid]) 5.  return (mid); 6.

insertion and deletion in a tree

I =PR/12 Numbers of years .Interest rate up to 1yrs . 5.50 up to 5yrs . 6.50 More than 5 yrs . 6.75 design an algorithm based on the above information

State the Introduction to pseudocode No specific programming language is referred to; development of algorithms by using pseudocode uses generic descriptions of branching, loop

The time needed to delete a node x from a doubly linked list having n nodes is O (1)

what is far and near procedures in system programming?