crazyFritz
science forum beginner
Joined: 17 Jul 2006
Posts: 3
|
 Posted: Mon Jul 17, 2006 2:24 pm Post subject:
Complexity of Sparse Cholesky Factorization
|
|
|
Assume that for a particular problem it can be proved that the matrices
are getting arbitrarily (even though very slowly) sparse with matrix
size.
Is it justified to claim that a sparse cholesky factorization of such a
matrix can be performed in at most O(NlogN)?
If no why not?
If yes with what specific algorithm?
Can you give a pointer to a particular paper?
Best regards,
Thomas |
|
FAQ
Search
Memberlist
Usergroups
Profile
Log in to check your private messages
Log in
Forum index
»
Science and Technology
»
Math
»
Research
