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
What is an Algorithm? An algorithm is a sequence of unambiguous instructions for solving a problem, i.e., for getting a needed output for any legitimate input in a finite amoun

I am looking for assignment help on the topic Data Structures. It would be great if anyone help me.

implementation of fast fourier transforms for non power of 2

The algorithm to delete any node having key from a binary search tree is not simple where as several cases has to be considered. If the node to be deleted contains no sons,

important points on asymptotic notation to remember

What are the conditions under which sequential search of a list is preferred over binary search?

Illumination of wire frame The colour or shade that a surface appears to the human eye depends primarily on three  factors : Colour and strength of incoming illumination

write a algorithsm in c to perform push and pop operations stastic implementation using array ?

adjacency multilist

Limitation of Binary Search: - (i)  The complexity of Binary search is O (log2 n). The complexity is similar irrespective of the position of the element, even if it is not pres