FAQFAQ   SearchSearch   MemberlistMemberlist   UsergroupsUsergroups 
 ProfileProfile   PreferencesPreferences   Log in to check your private messagesLog in to check your private messages   Log inLog in 
Forum index » Science and Technology » Math » Research
Complexity of Sparse Cholesky Factorization
Post new topic   Reply to topic Page 1 of 1 [1 Post] View previous topic :: View next topic
Author Message
crazyFritz
science forum beginner


Joined: 17 Jul 2006
Posts: 3

PostPosted: Mon Jul 17, 2006 2:24 pm    Post subject: Complexity of Sparse Cholesky Factorization Reply with quote
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
Back to top
Google
Back to top
Display posts from previous:   
Post new topic   Reply to topic Page 1 of 1 [1 Post] View previous topic :: View next topic
The time now is Wed Jun 28, 2017 7:15 pm | All times are GMT
Forum index » Science and Technology » Math » Research
Jump to:  

Similar Topics
Topic Author Forum Replies Last Post
No new posts Complexity of Sparse Cholesky Factorization crazyFritz Math 5 Mon Jul 17, 2006 1:31 pm
No new posts Reductions within P [complexity] ahuznot@yahoo.com Math 0 Sat Jul 15, 2006 4:38 pm
No new posts Bound on nnz for sparse matrix product Scott Kilpatrick num-analysis 3 Wed Jul 12, 2006 4:24 pm
No new posts Algorithm to fit rectangles with different areas inside a... Dani Camps Research 0 Tue Jul 11, 2006 9:14 am
No new posts factorization an NP problem (don't see it) oferlock@yahoo.com Math 4 Thu Jul 06, 2006 4:16 am

Copyright © 2004-2005 DeniX Solutions SRL
Other DeniX Solutions sites: Electronics forum |  Medicine forum |  Unix/Linux blog |  Unix/Linux documentation |  Unix/Linux forums  |  send newsletters
 


Powered by phpBB © 2001, 2005 phpBB Group

[ Time: 0.0163s ][ Queries: 16 (0.0033s) ][ GZIP on - Debug on ]