Xref: utzoo comp.sys.super:378 comp.arch:23117
Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!convex!usenet
From: dodson@convex.COM (Dave Dodson)
Newsgroups: comp.sys.super,comp.arch
Subject: Re: Massively Parallel LINPACK on the Intel Touchstone Delta machine
Message-ID: <1991Jun06.163843.10838@convex.com>
Date: 6 Jun 91 16:38:43 GMT
References: <1991Jun3.233741.8570@elroy.jpl.nasa.gov> <13301@pt.cs.cmu.edu> <16333@life.ai.mit.edu>
Sender: usenet@convex.com (news access account)
Reply-To: dodson@convex.COM (Dave Dodson)
Organization: CONVEX Computer Corporation, Richardson, Tx., USA
Lines: 12
Nntp-Posting-Host: mozart.convex.com

In article <16333@life.ai.mit.edu> lethin@raisin-scone.ai.mit.edu (Richard A. Lethin) writes:
>Aren't really large problems of interest sparse matrices anyway?

In radar-cross-section work, huge dense non-Hermitian complex matrices
abound.  I suppose that larger matrices yield better models, making it
easier for you to determine if you can either find or hide the stealth
bomber, whichever you are trying to do.

----------------------------------------------------------------------

Dave Dodson		                             dodson@convex.COM
Convex Computer Corporation      Richardson, Texas      (214) 497-4234