0

# How do you check orthogonality of a matrix using arrays?

Updated: 12/9/2022

Wiki User

15y ago

the transpose of null space of A is equal to orthogonal complement of A

Wiki User

15y ago

Earn +20 pts
Q: How do you check orthogonality of a matrix using arrays?
Submit
Still have questions?
Related questions

### Write a program using iostreams to take as input two multi-dimensional arrays and print their sum as output Matrix Addition in Matrix format?

http://www.assignmentsclub.com/

### What is a fast-transpose algorithm for sparse matrices?

A fast-transpose is a computer algorithm that quickly transposes a sparse matrix using a relatively small amount of memory. Using arrays normally to record a sparse matrix uses up a lot of memory since many of the matrix's values are zero. In addition, using the normal transpose algorithm to transpose this matrix will take O(cols*elements) amount of time. The fast-transpose algorithm only uses a little memory to record the matrix and takes only O(cols+elements) amount of time, which is efficient considering the number of elements equals cols*rows.

### What multiplication fact be found be using the arrays 2x9 and 5x9?

7x9 is the multiplication fact that can be found using the arrays 2x9 and 5x9.

### What is the way by which you can make the user defined the size of the arrays?

By using the library function #define A[] we can define the size of arrays

### What is the purpose of using arrays in C language?

The purpose of using arrays in C is to store multiple values in one variable. Then you can make programs that use arrays like lists, printing values from multiple arrays into one line. It take memory in continues block then we can know memory location easily. We can retrieve data quickly.

### What is memory leakage in terms of arrays?

leakage in arrays occur when you declare an array with big size and using only very few bytes.

### Wap to find whether given matrix is skew symmetric matrix or not using arrays?

int sym_test(const **a,int n){ int i,j,sym; i=1;j=0;sym=1; while(sym &amp;&amp; i&lt;n){ if ( a[i][j] != -[j][i] ) sym=0; else if (j&lt;i-1) ++j; else ++i,y=0; } return sym; }

abdulrahman

9