Yes, my bad. The determinant must be different from 0 if the inverse
exists.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
T
An exact algorithm for the steiner tree might look like the one given
in this paper:
"An Exact Algorithm for the Uniformly-Oriented
Steiner Tree Problem" Benny K. Nielsen, Pawel Winter, and Martin
Zachariasen
http://www.springerlink.com/(ilim4245kwp0q545vzj1b345)/app/home/content.asp?referrer=co
One way of doing this is to use gaussian elimination. If the matrix to
invert is A, the inversion of A is A' and the identity matrix is I,
then the algorithm is:
Row reduce A until it is I. If you now use the same row reductions on
I, you get A'.
The reduction of A can be written:
E1 E2 ..
> Hi everybody
>
>
> I am in need to find factorial of numbers .
...
> Is there any other algorithm which requires less amount of processing .and
> finds the factorial of any bigger number in simple way.
>
If you can do with an approximation, there is always Stirlings's
approximation.
--~
