home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.pascal
- Path: sparky!uunet!cs.utexas.edu!torn!news.ccs.queensu.ca!dmurdoch
- From: dmurdoch@QueensU.CA (Duncan Murdoch)
- Subject: Re: Matrix routines in pascal
- Message-ID: <Bs5wKs.3pE@knot.ccs.queensu.ca>
- Sender: news@knot.ccs.queensu.ca (Netnews control)
- Organization: Queen's University, Kingston, Canada
- References: <1992Jul29.162918.13707@csi.jpl.nasa.gov>
- Distribution: usa
- Date: Wed, 29 Jul 1992 17:58:04 GMT
- Lines: 21
-
- In article <1992Jul29.162918.13707@csi.jpl.nasa.gov> eldred@rrunner.jpl.nasa.gov (Dan Eldred) writes:
- >
- >For people who attempt to do numerical programming in pascal: how
- >do you handle matrices? In particular, what approach do you use to
- >create general purpose routines like matrix multiply, inversion,
- >eigensystems, etc.? If you have a pascal compiler that allows
- >conformant arrays, this is pretty easy--either do Fortran style
- >calls in which the dimensions are passed as parameters, or pass
- >a record structure which has the dimensions embedded. But I'm
- >having trouble coming up with a satisfactory strategy for ANS
- >pascal (i.e. Think Pascal 4.0 on the Mac). Suggestions?
-
- Think Pascal includes OOP extensions, doesn't it? If so, making a
- matrix object is probably the best way to go. That's how I handle
- matrices in Turbo Pascal. The big problem there is the 64K limit on
- size; that means I have to go through all sorts of gyrations to handle
- large matrices, since 90 by 90 is the biggest matrix of doubles that
- fits in 64K.
-
- Duncan Murdoch
- dmurdoch@mast.queensu.ca
-