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
The data structure needed to evaluate a postfix expression is  Stack

1) What will call a graph that have no cycle? 2) Adjacency matrix of an undirected graph is------------- on main diagonal. 3) Represent the following graphs by adjacency matr

Explain the concept of hidden lines The problem of hidden lines or surfaces was implicit even in 2-D graphics, but we did not mention it there, because what was intended to be

What is Class invariants assertion A class invariant is an assertion which should be true of any class instance before and after calls of its exported operations. Generally

What is a first-in-first-out data structure ? Write algorithms to perform the following operations on it – create, insertion, deletion, for testing overflow and empty conditions.

In this project you will write a program to produce a discrete time simulation of a queue as shown in Fig. 1. Time is slotted on the input and the output. Each input packet follows

CMY Model  The cyan, magenta, yellow (CMY) colour model is a subtractive model based on the colour absorption properties of paints and inks. As such it has become the standard

Question 1 Discuss the advantages of implementation checks preconditions Question 2 Write a ‘C' program to search for an item using binary search Question 3 Show that To

Objective The goal of this project is to extend and implement an algorithm presented in the course and to apply notions introduced by the course to this program/algorithm. The ass

Explain process of B-TREE and what difference between AVL Tree Using Algorithms