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

_{Feb}

_{Mar}

_{Apr}
(9) 
_{May}
(2) 
_{Jun}
(2) 
_{Jul}
(3) 
_{Aug}
(2) 
_{Sep}

_{Oct}

_{Nov}

_{Dec}


2001 
_{Jan}

_{Feb}

_{Mar}

_{Apr}

_{May}
(2) 
_{Jun}

_{Jul}
(8) 
_{Aug}

_{Sep}

_{Oct}
(5) 
_{Nov}

_{Dec}

2002 
_{Jan}
(2) 
_{Feb}
(7) 
_{Mar}
(14) 
_{Apr}

_{May}

_{Jun}
(16) 
_{Jul}
(7) 
_{Aug}
(5) 
_{Sep}
(28) 
_{Oct}
(9) 
_{Nov}
(26) 
_{Dec}
(3) 
2003 
_{Jan}

_{Feb}
(6) 
_{Mar}
(4) 
_{Apr}
(16) 
_{May}

_{Jun}
(8) 
_{Jul}
(1) 
_{Aug}
(2) 
_{Sep}
(2) 
_{Oct}
(33) 
_{Nov}
(13) 
_{Dec}

2004 
_{Jan}
(2) 
_{Feb}
(16) 
_{Mar}

_{Apr}
(2) 
_{May}
(35) 
_{Jun}
(8) 
_{Jul}

_{Aug}
(2) 
_{Sep}

_{Oct}

_{Nov}
(8) 
_{Dec}
(21) 
2005 
_{Jan}
(7) 
_{Feb}

_{Mar}

_{Apr}
(1) 
_{May}
(8) 
_{Jun}
(4) 
_{Jul}
(5) 
_{Aug}
(18) 
_{Sep}
(2) 
_{Oct}

_{Nov}
(3) 
_{Dec}
(31) 
2006 
_{Jan}

_{Feb}

_{Mar}

_{Apr}
(3) 
_{May}
(1) 
_{Jun}
(7) 
_{Jul}

_{Aug}
(2) 
_{Sep}
(3) 
_{Oct}

_{Nov}
(1) 
_{Dec}

2007 
_{Jan}

_{Feb}

_{Mar}
(2) 
_{Apr}
(11) 
_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}
(2) 
2008 
_{Jan}

_{Feb}

_{Mar}

_{Apr}
(4) 
_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}
(10) 
2009 
_{Jan}

_{Feb}

_{Mar}

_{Apr}
(1) 
_{May}
(1) 
_{Jun}

_{Jul}
(2) 
_{Aug}
(1) 
_{Sep}

_{Oct}
(1) 
_{Nov}

_{Dec}
(1) 
2011 
_{Jan}

_{Feb}

_{Mar}

_{Apr}

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

_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}

2012 
_{Jan}
(1) 
_{Feb}
(1) 
_{Mar}

_{Apr}
(1) 
_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}

2013 
_{Jan}

_{Feb}

_{Mar}
(1) 
_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}

_{Oct}

_{Nov}
(1) 
_{Dec}
(1) 
2014 
_{Jan}

_{Feb}
(1) 
_{Mar}
(1) 
_{Apr}

_{May}
(2) 
_{Jun}
(1) 
_{Jul}
(1) 
_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}

S  M  T  W  T  F  S 



1

2

3

4

5

6

7

8

9

10

11
(1) 
12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29
(7) 
30
(1) 
31



From: Nicolas Neuss <Nicolas.Neuss@iw...>  20021030 09:47:09

"Michael A. Koerber" <mak@...> writes: > Rif, > > I should read and write more slowly. WRT your first posting, > the solution for multiple RHS would be to use (GETRS ...) or (GETRS! ...) > > mike Yes, something like (multiplevaluebind (lu ipiv info) (getrf! (copy mat)) (declare (ignore info)) (getrs! lu ipiv rhs)) should work in recent CVS versions. Nicolas. 
From: Raymond Toy <toy@rt...>  20021029 17:05:03

>>>>> "rif" == rif <rif@...> writes: rif> Yes, R\t means solve this matrix, but Matlab/Octave are able to take rif> advantage of the fact that R is upper or lower triangular, so solving rif> each triangular system takes O(n^2) rather than O(n^3) operations (you rif> pay the O(n^3) once when you factor the matrix). rif> I guess I'm a little confused. If we don't already have operations rif> like this, what's the point of exposing LU from Lapack? AFAIK, the rif> reason to do an LU decomposition is so that I can then use it to solve rif> systems in time O(n^2)... I also wanted to say that if you know the name of the BLAS or LAPACK routines that perform Cholesky decomposition and solution, please point them out and I can create the necessary FFI for them. Ray 
From: Michael A. Koerber <mak@ll...>  20021029 17:03:48

Rif, I should read and write more slowly. WRT your first posting, the solution for multiple RHS would be to use (GETRS ...) or (GETRS! ...) mike 
From: Raymond Toy <toy@rt...>  20021029 17:00:57

>>>>> "rif" == rif <rif@...> writes: rif> I guess I'm a little confused. If we don't already have operations rif> like this, what's the point of exposing LU from Lapack? AFAIK, the rif> reason to do an LU decomposition is so that I can then use it to solve rif> systems in time O(n^2)... It means I was too lazy to either look up the necessary routines or was too lazy to add the necessary smarts because I didn't need them. Ray 
From: Michael A. Koerber <mak@ll...>  20021029 17:00:05

> If R\t means R^(1)*t, the (m/ t r) will do that. However, I think > that's probably rather expensive because it probably will use Gaussian > elimination to solve this set of equations. Some other special > routine from LAPACK should probably be used. (m/ A B) uses the LU decomposition routines. Not also the recent addition made (GETRS! ... ) uses LU. mike 
From: rif <rif@MIT.EDU>  20021029 16:55:50

Yes, R\t means solve this matrix, but Matlab/Octave are able to take advantage of the fact that R is upper or lower triangular, so solving each triangular system takes O(n^2) rather than O(n^3) operations (you pay the O(n^3) once when you factor the matrix). I guess I'm a little confused. If we don't already have operations like this, what's the point of exposing LU from Lapack? AFAIK, the reason to do an LU decomposition is so that I can then use it to solve systems in time O(n^2)... rif > If R\t means R^(1)*t, the (m/ t r) will do that. However, I think > that's probably rather expensive because it probably will use Gaussian > elimination to solve this set of equations. Some other special > routine from LAPACK should probably be used. > > Will have to dig through LAPACK.... > > Ray 
From: Raymond Toy <toy@rt...>  20021029 16:47:26

>>>>> "rif" == rif <rif@...> writes: rif> Nearly all the matrices I work with are positive semidefinite. Does rif> Matlisp have a Cholesky factorization routine? Yes and no. LAPACK has one, I think. Matlisp doesn't because no one has written the FFI for it. rif> Also, what is the best way to solve a bunch of problems of the form Ax rif> = b, where A is positive semidefinite and the b's are not known ahead rif> of time? In Octave, I would say: rif> R = chol(A); rif> and, once I obtained a b, I would solve via: rif> t = R'\b; rif> x = R\t; rif> What is the Matlisp equivalent to this approach? If R\t means R^(1)*t, the (m/ t r) will do that. However, I think that's probably rather expensive because it probably will use Gaussian elimination to solve this set of equations. Some other special routine from LAPACK should probably be used. Will have to dig through LAPACK.... Ray 
From: rif <rif@MIT.EDU>  20021029 16:14:06

Nearly all the matrices I work with are positive semidefinite. Does Matlisp have a Cholesky factorization routine? Also, what is the best way to solve a bunch of problems of the form Ax = b, where A is positive semidefinite and the b's are not known ahead of time? In Octave, I would say: R = chol(A); and, once I obtained a b, I would solve via: t = R'\b; x = R\t; What is the Matlisp equivalent to this approach? Cheers, rif 
From: rif <rif@MIT.EDU>  20021011 04:57:33

I tried saving a corefile with (savematlisp). The corefile seems to save fine, but if I start up a new cmulisp with that corefile, there's no help function. Everything else seems to be there (or at least a bunch of other functions that I tried), but help is undefined. It may or may not be relevant that I am using the debian cmucl, which has a built in "help" function, and so in my .cmuclinit, I load the matlisp/start.lisp file, then I (unintern 'help) (usepackage :matlisp) Any ideas how to get the help back in my core file? Cheers, rif 