HI Neha
Thanks , but its the transpose of Coadjoint matrix , which gets complex as
the size of the matrix increases.
I was looking for some kind of algorithm if anyone has for the inverse of
matrix
thanks& regards
saurabh
"Joseph A. Marrero" <[EMAIL PROTECTED]> wrote:
--- neha lodha <[EMAIL PROTECTED]> wrote:
> hey, i think u want to find transpose of a matrix....
> for this just interchange the rols of row and columns
> in the loop..
> like...
> for(i=o;i<r;i++)
> {
> for(j=0;J<c;j++)
> printf("%d",a[i][j];
> }
> the above prog will simply write the contents of the
> matrix A.now for transpose:
> for(i=0;i<c;i++)
> {
> for(j=0;j<r;j++)
> printf("%d",a[i][j])
> }
> hope this code will help u....;
The transpose of a matrix is the inverse only for
orthogonal matrices. Because the OP did not state he was
dealing with an orthogonal matrix, that may not work.
http://en.wikipedia.org/wiki/Orthogonal_matrix
>
> sau1983in <[EMAIL PROTECTED]> wrote:
> Hi
>
> Can any one guide me the appoach fpr finding out the
> inverse of a
> matrix in C. I am just new to the C
>
> any help is appreciated.
>
> regards
> SAurabh
>
>
>
>
>
>
> ---------------------------------
> Everyone is raving about the all-new Yahoo! Mail beta.
_________________
Joseph A. Marrero
http://www.l33tprogrammer.com/
__________________________________________________________
The fish are biting.
Get more visitors on your site using Yahoo! Search Marketing.
http://searchmarketing.yahoo.com/arp/sponsoredsearch_v2.php
Send instant messages to your online friends http://uk.messenger.yahoo.com
