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

Write an algorithm in the form of a flowchart that: inputs top speeds (in km/hr.) of 5000 cars Outputs fastest speed and the slowest speed Outputs average (mean) s

Maximum numbers of nodes a binary tree of depth d The maximum numbers of nodes a binary tree of depth d can have is 2 d+1 -1.

Explain CAM software CAD/CAM software has been recognized as an essential tool in the designing and manufacturing of a product due to its ability to depict the designs and tool

Ans: A procedure to reverse the singly linked list: reverse(struct node **st) { struct node *p, *q, *r; p = *st; q = NULL; while(p != NULL) { r =q;

ESO207: Programming Assignment 1 Due on 6 Sept, 2015. To be submitted online. Problem In this assignment you are required to implement k-way Merge Sort algorithm. In this version p

Z-Buffer Algorithm Also known as the Depth-Buffer algorithm, this image-space method simply selects for  display the polygon or portion of a polygon that is nearest to the view

how do we use 4-discs stack to solve tower of hanoi problem and write an algorithm to solve it?

In a doubly linked list, also called as 2 way list, each node is divided into 3 parts. The first part is called previous pointer field. It contains the address of the preceding

Write the algorithm for compound interest