Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sun-barr!olivea!spool.mu.edu!caen!zaphod.mps.ohio-state.edu!sample.eng.ohio-state.edu!purdue!mentor.cc.purdue.edu!mace.cc.purdue.edu!bfp
From: bfp@mace.cc.purdue.edu (Bryan Putnam)
Newsgroups: comp.lang.fortran
Subject: Re: Need complex matrix solver for CM
Message-ID: <7887@mace.cc.purdue.edu>
Date: 27 Jun 91 21:09:54 GMT
References: <1991Jun27.161918.10218@leland.Stanford.EDU> <1991Jun27.190724.26161@ariel.unm.edu>
Organization: Purdue University Computing Center
Lines: 14

In article <1991Jun27.190724.26161@ariel.unm.edu> john@spectre.unm.edu (John Prentice) writes:
>In article <1991Jun27.161918.10218@leland.Stanford.EDU> francis@hanauma.stanford.edu (Francis Muir) writes:
>>Re-write the code in REAL; it will probably illuminate.
>
>This is an amazingly presumptuous, not to mention useless, comment.  If I

That sounds like a perfectly good solution to me, although it makes the
linear system twice as large. If you need a High School math reminder:

Ax=b ==>

+ A(r)  -A(i) +  x(r)          b(r)
|             |           =    
+ A(i)   A(r) +  x(i)          b(i)