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 Efficiency of algorithm? Efficiency of an algorithm can be precisely explained and investigated with mathematical rigor.  There are two types of algorithm efficiency

floyd warshall algorithm

One can change a binary tree into its mirror image by traversing it in Postorder is the only proecess whcih can convert binary tree into its mirror image.

Data Structure and Algorithm 1. Explain linked list and its types. How do you represent linked list in memory? 2. List and elucidate the types of binary tree. 3. Descr

How many nodes in a tree have no ancestors 1 node in atree have no ancestors.

Explain Dijkstra's algorithm Dijkstra's algorithm: This problem is concerned with finding the least cost path from an originating node in a weighted graph to a destination node

Write a recursive function the computes the number of digits in a positive integer n. For example if n = 6598, the function should return 4. Find a variant expression and a thresho

Explain about Hidden-surface Hidden-line removal refers to wire-frame diagrams without surface rendering and polygonal surfaces with straight edges. Hidden-surface removal ref

Linked lists are among the most common and easiest data structures. They may be used to implement various other common abstract data types, including queues, stacks, symbolic expre

implement multiple stacks in an array and write different algorithms to perform operations on it