On Sat, 16 Feb 2002, Dylan Thurston wrote:
On Thu, Jan 24, 2002 at 03:38:59PM +0100, Bjorn Lisper wrote:
I think MATLAB's matrix language provides about the right level of
abstraction for a high-level matrix language. You can for instance write
things like
Y = inv(A)*B
to assign
Jerzy Karczmarczuk writes:
Steven Bevan wrote interesting numeric routines a long time ago.
Actually I did little more than transliterate the algorithm
descriptions I found in a book on numerical analysis. I know next to
nothing about numerical analysis so I have no idea if they are
On Thu, Jan 24, 2002 at 03:38:59PM +0100, Bjorn Lisper wrote:
I think MATLAB's matrix language provides about the right level of
abstraction for a high-level matrix language. You can for instance write
things like
Y = inv(A)*B
to assign to Y the solution of Ax = B. ...
Just a comment on
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Friday 25 January 2002 13:25, Jerzy Karczmarczuk wrote:
Block recursive Schemes in Matlab are easier than in C++. Implementing
pyramid algorithms is not difficult. Slicing, reshaping, cloning, etc.
of matrices are very powerful tools, but they
Simon Peyton-Jones:
Lots of people have observed that Haskell might be a good scripting
language for numerical computation. In complicated numerical
applications, the program may spend most of its time in (say) matrix
multiply, which constitutes a tiny fraction of the code for the
Message-
| From: Hal Daume III [mailto:[EMAIL PROTECTED]]
| Sent: 22 January 2002 22:00
| To: Haskell Mailing List
| Subject: ideas for compiler project
|
|
| Hi All,
|
| I'm currently taking a class in compiler optimization for
| high performance computing (i.e., parallel architectures
Simon:
Lots of people have observed that Haskell might be a good scripting
language for numerical computation. In complicated numerical
applications, the program may spend most of its time in (say) matrix
multiply, which constitutes a tiny fraction of the code for the
application. So write the
One thing I would very much like to see done in a functional language is fault-tree
analysis.
A fault tree has as nodes various undesirable events, with as top node some disaster
(for example,
nuclear reactor meltdown) and as leaves various faults which can occur, with their
probabilities
