Ok. When is 1.0 due for delivery (roughly)? Meanwhile I will do the Java rewrite and make the source + func & perf tests available on our website so you guys can have a look before any commit.
BTW, is there any "graph library" proposal? Or any "heuristic optimisation" like simulated annealing, ant walk, genetic programming, etc. I know it's not numerics, but its still maths and algebra... Cheers, Pierre On Wed, 31 Mar 2004 15:31:32 -0800 (PST), Al Chou wrote > --- Phil Steitz <[EMAIL PROTECTED]> wrote: > > Pierre Auslander wrote: > > > Gents, > > > > > > would it be of any interest to contribute sparse matrices (with iterative > > > decomposition, solvers, etc.) to commons.math? > > > > > > Some time ago I've implemented such a library in C++, using iterative > > > algorithms. It allowed us to handle very large sparse matrices (e.g. > > 100'000 > > > by 100'000 correlation matrices used in risk management) in record space > > and > > > time. I need now a Java version and think of translating the library and > > > possibly contributing it to jakarta/commons. > > > > > > > I think that this would make a good addition to commons-math (post 1.0). > > I completely agree. > > Al > > __________________________________ > Do you Yahoo!? > Yahoo! Finance Tax Center - File online. File on time. > http://taxes.yahoo.com/filing.html > > --------------------------------------------------------------------- > To unsubscribe, e-mail: [EMAIL PROTECTED] > For additional commands, e-mail: [EMAIL PROTECTED] -- Open WebMail Project (http://openwebmail.org) --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
