Hello!
> > >It seems to be a fact that numerically intensive code spends a lot of time
> > >performing matrix maths. If this means `array performance' is the limiting
> > >factor in performance why it it `tunnel vision' to concentrate on it?
> >because matrices in real codes are sparse and rarely implemented
> >with "arrays".
> go get 'em andy! that's giving them a taste of the real (aka 'sparse')
> world.:)
I agree that matrix arithmetics is not the issue (but still arrays, or
what do you use?)
Here at UMass, I know a whole bunch of people doing numerics, and all of
the projects I know of use Markov chain Monte Carlo algorithms. This is
actually a very fast developping field. And no matrices arithmetic
involved.
I am working on hole dynamic in a two dimensional quantum
antiferromagnet. There have been numerics about that using diagonalization
of matrices with lattice sizes of ten by ten, sometimes a bit higher. Our
project aims at lattice sizes typically hundred by hundred.
The code is rather complicated and OOP makes life much easier. So while
many people who post here use OOP to play tricks, I use it to manage
complex algorithms.
Take care
Oliver
-- -- Oliver Axel Ruebenacker Physics Graduate Student -- -- Computational Condensed Matter Theory -- -- Univ. of Mass. at Amherst & Univ. of Karlsruhe, Germany -- -- http://www.ruebenacker.de/ Oliver@Ruebenacker.de -- -- 347 Prince House, UMass Amherst MA 01003 (413) 546 5919 -- -- Office: 414 Hasbrouck Lab (413) 545 0561 ----------------------- Object Oriented Numerics List -------------------------- * To subscribe/unsubscribe: use the handy web form at http://oonumerics.org/oon/ * If this doesn't work, please send a note to owner-oon-list@oonumerics.org
This archive was generated by hypermail 2b29 : Wed Feb 20 2002 - 03:20:11 EST