[OT ?] determinant computation time complexity
From: Emanuele Blanco (manub_at_despammed.com)
Date: 04/27/04
- Previous message: Alfredo Novoa: "Re: OT: Ireland, Europe and software patents"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Tue, 27 Apr 2004 13:32:32 +0200
Hi there,
I hope this is the right NG for this question. If it isn't, please redirect
me to the right one, thanks.
I'm not so experienced in calculating complexity. Anyway, I need to
calculate time complexity for calculating the determinant of a square n x n
matrix, using the Laplace expansion. I know this is a really slow algorithm
(compared to faster algorithms like LU factorization), but I need this. I'm
supposing that asintotic complexity is O(n!), that because calculating the
determinant of a square n matrix is composed by n sum, 2n multiplications
and computating n determinants of n matrix each one of (n-1)x(n-1)
dimension.
Thanks in advance
-- Emanuele Blanco PGP Key Available
- Previous message: Alfredo Novoa: "Re: OT: Ireland, Europe and software patents"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|