You can subscribe to this list here.
2001 
_{Jan}

_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}

_{Oct}
(8) 
_{Nov}
(8) 
_{Dec}
(4) 

2002 
_{Jan}
(53) 
_{Feb}
(15) 
_{Mar}
(51) 
_{Apr}
(54) 
_{May}
(41) 
_{Jun}
(48) 
_{Jul}
(32) 
_{Aug}
(22) 
_{Sep}
(61) 
_{Oct}
(31) 
_{Nov}
(31) 
_{Dec}
(27) 
2003 
_{Jan}
(45) 
_{Feb}
(18) 
_{Mar}
(25) 
_{Apr}
(39) 
_{May}
(34) 
_{Jun}
(20) 
_{Jul}
(13) 
_{Aug}
(16) 
_{Sep}
(18) 
_{Oct}
(14) 
_{Nov}
(17) 
_{Dec}
(13) 
2004 
_{Jan}
(53) 
_{Feb}
(12) 
_{Mar}
(38) 
_{Apr}
(29) 
_{May}
(72) 
_{Jun}
(38) 
_{Jul}
(41) 
_{Aug}
(11) 
_{Sep}
(21) 
_{Oct}
(30) 
_{Nov}
(35) 
_{Dec}
(14) 
2005 
_{Jan}
(66) 
_{Feb}
(14) 
_{Mar}
(24) 
_{Apr}
(50) 
_{May}
(40) 
_{Jun}
(29) 
_{Jul}
(37) 
_{Aug}
(27) 
_{Sep}
(26) 
_{Oct}
(58) 
_{Nov}
(43) 
_{Dec}
(23) 
2006 
_{Jan}
(84) 
_{Feb}
(36) 
_{Mar}
(24) 
_{Apr}
(42) 
_{May}
(20) 
_{Jun}
(41) 
_{Jul}
(40) 
_{Aug}
(42) 
_{Sep}
(23) 
_{Oct}
(38) 
_{Nov}
(31) 
_{Dec}
(28) 
2007 
_{Jan}
(11) 
_{Feb}
(34) 
_{Mar}
(14) 
_{Apr}
(29) 
_{May}
(45) 
_{Jun}
(5) 
_{Jul}
(10) 
_{Aug}
(6) 
_{Sep}
(38) 
_{Oct}
(44) 
_{Nov}
(19) 
_{Dec}
(22) 
2008 
_{Jan}
(37) 
_{Feb}
(24) 
_{Mar}
(29) 
_{Apr}
(14) 
_{May}
(24) 
_{Jun}
(47) 
_{Jul}
(26) 
_{Aug}
(4) 
_{Sep}
(14) 
_{Oct}
(45) 
_{Nov}
(25) 
_{Dec}
(16) 
2009 
_{Jan}
(33) 
_{Feb}
(34) 
_{Mar}
(45) 
_{Apr}
(45) 
_{May}
(30) 
_{Jun}
(47) 
_{Jul}
(37) 
_{Aug}
(19) 
_{Sep}
(15) 
_{Oct}
(16) 
_{Nov}
(24) 
_{Dec}
(31) 
2010 
_{Jan}
(32) 
_{Feb}
(25) 
_{Mar}
(12) 
_{Apr}
(5) 
_{May}
(2) 
_{Jun}
(9) 
_{Jul}
(31) 
_{Aug}
(10) 
_{Sep}
(12) 
_{Oct}
(20) 
_{Nov}
(6) 
_{Dec}
(41) 
2011 
_{Jan}
(23) 
_{Feb}
(8) 
_{Mar}
(41) 
_{Apr}
(8) 
_{May}
(15) 
_{Jun}
(10) 
_{Jul}
(8) 
_{Aug}
(14) 
_{Sep}
(16) 
_{Oct}
(13) 
_{Nov}
(15) 
_{Dec}
(8) 
2012 
_{Jan}
(6) 
_{Feb}
(14) 
_{Mar}
(22) 
_{Apr}
(40) 
_{May}
(27) 
_{Jun}
(18) 
_{Jul}
(2) 
_{Aug}
(6) 
_{Sep}
(10) 
_{Oct}
(32) 
_{Nov}
(5) 
_{Dec}
(2) 
2013 
_{Jan}
(14) 
_{Feb}
(2) 
_{Mar}
(15) 
_{Apr}
(2) 
_{May}
(6) 
_{Jun}
(7) 
_{Jul}
(25) 
_{Aug}
(6) 
_{Sep}
(3) 
_{Oct}

_{Nov}
(8) 
_{Dec}

2014 
_{Jan}
(3) 
_{Feb}
(3) 
_{Mar}
(3) 
_{Apr}

_{May}
(19) 
_{Jun}
(6) 
_{Jul}
(1) 
_{Aug}
(4) 
_{Sep}
(18) 
_{Oct}
(5) 
_{Nov}
(1) 
_{Dec}

2015 
_{Jan}
(2) 
_{Feb}
(4) 
_{Mar}
(2) 
_{Apr}
(1) 
_{May}
(17) 
_{Jun}
(1) 
_{Jul}

_{Aug}
(2) 
_{Sep}

_{Oct}

_{Nov}
(1) 
_{Dec}
(11) 
2016 
_{Jan}
(10) 
_{Feb}
(6) 
_{Mar}
(14) 
_{Apr}

_{May}
(2) 
_{Jun}
(5) 
_{Jul}

_{Aug}

_{Sep}
(3) 
_{Oct}
(1) 
_{Nov}
(1) 
_{Dec}

2017 
_{Jan}

_{Feb}
(1) 
_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}

S  M  T  W  T  F  S 






1

2

3

4
(1) 
5
(3) 
6
(2) 
7
(3) 
8

9

10

11
(2) 
12
(3) 
13

14
(6) 
15

16
(2) 
17

18

19
(2) 
20

21

22
(2) 
23

24
(1) 
25

26
(9) 
27
(9) 
28
(4) 
29
(1) 
30
(1) 
31







From: <Peter.Vanroose@es...>  20020327 16:25:22

> whereas for 30 equations it goes banana (wrong solution): > > vnl_lsqr.cxx : x = 0 is the exact solution. No iterations were performed. > vnl_lsqr.cxx : The iteration limit ITNLIM was reached. > vnl_lsqr.cxx : residual norm estimate = 3.24731 > vnl_lsqr.cxx : result norm estimate = 14.2702 > vnl_lsqr.cxx : condition no. estimate = 106.047 > vnl_lsqr.cxx : iterations = 30 Whenever you see the message "The iteration limit ITNLIM was reached" you can expect that the result is incorrect or at least imprecise. Could you try changing the # iterations to 120 in this case? P.S. I've changed the default in vnl_lsqr.h to 4*n. Peter. 
From: Andrew Fitzgibbon <awf@ro...>  20020327 16:04:47

Also, Domi, can you run the profiler to see where the 10 mins is spent? MATLAB has pretty highly optimized code paths  we may be able to gain a factor of 25 just by microoptimizing the sparse matrix stuff. A. 
From: <Peter.Vanroose@es...>  20020327 15:51:34

> vnl_lsqr.cxx : The iteration limit ITNLIM was reached. From v3p/netlib/lsqr.c : /* ITNLIM input An upper limit on the number of iterations. */ /* Suggested value: */ /* ITNLIM = n/2 for wellconditioned systems */ /* with clustered singular values, */ /* ITNLIM = 4*n otherwise. */ ITNLIM is the 17th parameter to lsqr_() It can be set in vnl_lsqr by the method set_max_iterations(int). The default is "n", which should probably be changed to "4*n". Peter. 
From: Ian Scott <ian.m.scott@st...>  20020327 14:56:06

Sorry, http://www.isbe.man.ac.uk/public_vxl_doc/books/vxl/book.html#SEC60 > Original Message > From: Andrew Fitzgibbon [mailto:awf@...] > Sent: Wednesday, March 27, 2002 2:54 PM > To: Ian Scott > Subject: RE: [Vxlusers] vnl_sqrt does solve Ax=b but toooo sloooow > > > > 4bidden > > >http://www.isbe.man.ac.uk/internal/software/c++/isbe_vxl_doc/ > books/vxl/ > book.html#SEC60 > > 
From: Ian Scott <ian.m.scott@st...>  20020327 14:31:21

> This solves my (naive) test linear system but: > > 1) I have to set no. of interations to 2x size of A, otherwise I get > wrong solution, If the default value isn't big enough, it could indicate a bug in vnl_lsqr. Have a look at the documentation in the underlying netlib function, it may tell you something useful. > > 2) It takes 10 minutes for 10,000 x 10,000 while matlab takes only 1 > minute to give the same. > > 3) I have to solve ~ 10,000 x 10,000 maaaaaaany times in my > calculations > > Any ideas how to improve things? Find a better algorithm in the literature and add it to vnl. http://www.isbe.man.ac.uk/internal/software/c++/isbe_vxl_doc/books/vxl/book. html#SEC60 Ian. 
From: <domi@vi...>  20020327 14:22:01

> perhaps increase the interation limit Great. Thank you Ian. This solves my (naive) test linear system but: 1) I have to set no. of interations to 2x size of A, otherwise I get wrong solution, 2) It takes 10 minutes for 10,000 x 10,000 while matlab takes only 1 minute to give the same. 3) I have to solve ~ 10,000 x 10,000 maaaaaaany times in my calculations Any ideas how to improve things? dominique 
From: <domi@vi...>  20020327 13:26:31

vnl_sqrt doesnt solve Ax=b for systems aleardy around 30. For 20 it gives good results (for a naive linear problem) and: vnl_lsqr.cxx : x = 0 is the exact solution. No iterations were performed. vnl_lsqr.cxx : The iteration limit ITNLIM was reached. vnl_lsqr.cxx : residual norm estimate = 8.40484e06 vnl_lsqr.cxx : result norm estimate = 14.6304 vnl_lsqr.cxx : condition no. estimate = 67.683 vnl_lsqr.cxx : iterations = 20 whereas for 30 equations it goes banana (wrong solution): vnl_lsqr.cxx : x = 0 is the exact solution. No iterations were performed. vnl_lsqr.cxx : The iteration limit ITNLIM was reached. vnl_lsqr.cxx : residual norm estimate = 3.24731 vnl_lsqr.cxx : result norm estimate = 14.2702 vnl_lsqr.cxx : condition no. estimate = 106.047 vnl_lsqr.cxx : iterations = 30 I guess residual norm estimate holds the key. Any ideas? thanks Dominique 
From: <domi@vi...>  20020327 12:50:43

> I think vnl_lsqr is the class you are looking for. From the documentation Ian, yes, you are right. I was there before, but I didnt know I can use it (well, matix inverse and least squares are kind of two different jobs, arent they?). I checked  it works for small systems, but if it works good enough for huge sparse systems I will know in a day or two. > I readily acknowledge that VXL's documentation is far from perfect. If you > can think of some better documentation (either for the vnl chapter in the > book, or the doxygen output,) we would be grateful. Improvements to the VXL > code or documentation are always welcome. I dont need a perfect documentation (although a little bit less messy would be great). Instead I prefer the idea of getting in touch with someone who had similar problem (and asking him for solution). I can offer the same. thank you Dominique 
From: Ian Scott <ian.m.scott@st...>  20020327 09:35:38

> I see a lot of classes, but none is giving me either an > inverse of a big > *sparse* matrix or a corresponding solution  not to mention other > expectations/doubts I wrote about :( I think vnl_lsqr is the class you are looking for. From the documentation http://www.isbe.man.ac.uk/public_vxl_doc/vxl/vnl/html/class_vnl_lsqr.html "vnl_lsqr implements an algorithm for large, sparse linear systems and sparse, linear least squares" As I undestand it, linear least squares applied to the equation Ax=b will give you a least squares solution for x, which is as good as you are likely to get for a massive sparse matrix A. > I'm sorry, but there is no clear answer there to "questions > like this". The place for an overview of numerical algorithms is a book like "Numerical Recipes." There is no point in us replicating this sort of information in VXL's documentation. However, the search engine and documentation do provide a means of finding algorithms. vnl_lsqr comes 4th on a search for "vnl sparse". Ok, the vnl_lsqr documentation doesn't mention the word "inverse" (because it doesn't actually do an inverse,) but this is exactly the process I used to answer your question. I readily acknowledge that VXL's documentation is far from perfect. If you can think of some better documentation (either for the vnl chapter in the book, or the doxygen output,) we would be grateful. Improvements to the VXL code or documentation are always welcome. Ian. 