Effective way of storing two symmetric matrices, Data Structure & Algorithms

Explain an efficient and effective way of storing two symmetric matrices of the same order in the memory.

A n-square matrix array will be symmetric if a[j][k]=a[k][j] for all j and k.

For a symmetric matrix, we need to store elements which are lying on and below the diagonal of the matrix or those on and above the diagonal. Two symmetric matrix of A and B of the same dimension can be stored in an n*(n+1) array C where c[j][k]=a[j][k] when j≥k but c[j][k-1]=b[j][k-1] when j

 

121_Storing_Matrices_in_Memory.png

Posted Date: 7/9/2012 10:01:10 PM | Location : United States







Related Discussions:- Effective way of storing two symmetric matrices, Assignment Help, Ask Question on Effective way of storing two symmetric matrices, Get Answer, Expert's Help, Effective way of storing two symmetric matrices Discussions

Write discussion on Effective way of storing two symmetric matrices
Your posts are moderated
Related Questions
1. develop an algorithm which reads two decimal numbers x and y and determines and prints out wether x>y or y>x. the input values, x and y, are whole number > or equal to 0, which

In internal sorting, all of the data to be sorted is obtainable in the high speed main memory of the computer. We will learn the methods of internal sorting which are following:

Explain Floyd's algorithm It is convenient to record the lengths of shortest paths in an n by n matrix D known as the  distance matrix: the element d ij   in the i th   row an

Define Hashing. Store the following values in a hash table of table size 11 using division method: 25, 42, 96, 101, 102, 162, and 197. In case of collision, use other hash functio

Depth-first traversal A depth-first traversal of a tree visit a node and then recursively visits the subtrees of that node. Likewise, depth-first traversal of a graph visits

/* The program accepts matrix like input & prints the 3-tuple representation of it*/ #include void main() { int a[5][5],rows,columns,i,j; printf("enter the order of

Algorithm for Z-Buffer Method (a)  Initialize every pixel in the viewport to the smallest value of z, namely z0 the z-value of the rear clipping plane or "back-ground". Store a

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.

When there is requirement to access records sequentially by some key value and also to access records directly by the similar key value, the collection of records may be organized

state difference between linear and non linear data structure. give one example scenario of each