20101023, 03:45  #1  
Mar 2006
2^{3}×59 Posts 
Solving linear systems faster than ever...
I just saw a posting on Slashdot about how some researchers have found a way to speedup solving linear SDD systems. Here's a small excerpt:
Quote:
You can find the Slashdot post here: http://news.slashdot.org/story/10/10...arSDDSystems The actual article from Carnegie Mellon University here: http://www.cmu.edu/news/archive/2010...lgorithm.shtml Or a pdf of the paper here: http://www.cs.cmu.edu/~glmiller/Publ...ching2010.pdf 

20101023, 05:27  #2  
"Richard B. Woods"
Aug 2002
Wisconsin USA
2^{2}·3·599 Posts 
Quote:


20101023, 21:27  #3 
Dec 2008
2^{4}×11 Posts 
The kind of matrix this new algorithm accepts and the kind of matrix produced by NFS and QS are so completely different that it's very unlikely it will be of any use in factoring.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Solving systems of equations modulo n  carpetpool  carpetpool  2  20170205 20:40 
SIQS  problem with solving linear algebra  Dome  Factoring  14  20150306 17:59 
New Method for Solving Linear Systems  Dubslow  Miscellaneous Math  24  20120824 10:46 
Solving linear systems modulo n  drido  Math  3  20080208 15:06 
Mathematica questionsolving systems  ZetaFlux  Math  6  20050922 21:47 