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

B-trees are special m-ary balanced trees utilized in databases since their structure allows records to be added, deleted & retrieved with guaranteed worst case performance. A B-

Breadth-first search starts at a given vertex h, which is at level 0. In the first stage, we go to all the vertices that are at the distance of one edge away. When we go there, we

QUESTION (a) Define a tree and list its properties. (b) By showing all your workings, draw the spanning tree for the following graph based on the Breadth-First-Search algori

Determine the Components of Illumination The light reaching the eye when looking at a surface has clearly come from a source (or sources) of illumination and bounced off the su

A striking application of DFS is determine a strongly connected component of a graph. Definition: For graph G = (V, E) , where V refer to the set of vertices and E refer to the

Q. Perform implementation of a queue using a singly linked list L. The operations INSER and DELETE should take O (1) time.

Q. What do you mean by the best case complexity of quick sort and outline why it is so. How would its worst case behaviour arise?

As we talked in class, a program with two integer variables is universal. Now, we consider a special form of four variableprograms. Let G = (V; E) be a directed graph, where V is a

* Initialise d & pi* for each vertex v within V( g ) g.d[v] := infinity  g.pi[v] := nil g.d[s] := 0; * Set S to empty * S := { 0 }  Q := V(g) * While (V-S)