Sparse matrices, Data Structure & Algorithms


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

Refer the following matrices of Figure


(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
algorithm and flow chart to find weather the given numbers are positive or negative or neutral

differences between direct and indirect recursion

Q. Explain w hat are the stacks? How can we use the stacks  to check whether an expression is correctly parentheses or not. For example (()) is well formed but (() or )()( is not w

Explain the Memory Function method The Memory Function method seeks to combine strengths of the top  down and bottom-up approaches  to  solving  problems  with  overlapping  su

Conversion of Forest into Tree A binary tree may be used to show an entire forest, since the next pointer in the root of a tree can be used to point to the next tree of the for

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

Write an algorithm for binary search. What are its limitations? .

The following are several operations on a AA-tree: 1. Searching: Searching is done using an algorithm which is similar to the search algorithm of a binary search tree. 2. Ins

(a) Suppose that t is a binary tree of integers (that is, an object of type BinTree of Int.) in the state shown in Figure 3.   Give the vectors returned by each of the f

Range: A Structured Type in Ruby Ruby has a numerous structured types, comprising arrays, hashes, sets, classes, streams, and ranges. In this section we would only discuss rang