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
A tree is a non-empty set one component of which is designated the root of the tree while the remaining components are partitioned into non-empty groups each of which is a subtree

1. For the ER diagram you created in assignment, the artefact of the conceptual database design, map the ER model into the relational model according to how it was designed in the

What data structure would you mostly likely see in a nonrecursive execution of a recursive algorithm? Stack

Q. Enumerate number of operations possible on ordered lists and arrays.  Write procedures to insert and delete an element in to array.

Q. Write down a non recursive algorithm to traverse a binary tree in order.                    Ans: N on - recursive algorithm to traverse a binary tree in inorder is as

The process of accessing data stored in a serial access memory is same to manipulating data on a By using stack  method.

Now, consider a function that calculates partial sum of an integer n. int psum(int n) { int i, partial_sum; partial_sum = 0;                                           /* L


Explain principle of Optimality It indicates that an optimal solution to any instance of an optimization problem is composed of  optimal solutions to its subinstances.

In this unit, we described about the data structure Queue. It had two ends. One is front from where the elements can be removed and the other is rear where the elements can be inse