HDTenEightyP/NetNews huggingface dataset:
From: laytonj@rayleigh.ecn.purdue.edu (Jeffrey Layton)
Newsgroups: sci.math.num-analysis
Subject: Re: Phd. thesis database, (does it exist??) -an enquiry..
Date: 23 Jul 92 12:59:43 GMT
Distribution: usa
Organization: Purdue University Engineering Computer Network

In article <1992Jul22.230113.1923@news.iastate.edu> n2skr@iastate.edu (Suresh K Reddy) writes:
>
> Hi,
>
>Is there a simple way of being able to look,
>at the TITLES of Phd. theses, in a particular
>branch say, Electrical Engg., at some university
>say, something like UIUC (University of Illinois
>at Urbana Champagne)???
>
>What I am looking for is, some archive site, at which
>say I can guest login or something, and get this information,
>for the last ten years maybe....
>
>Asking for ABSTRACTS maybe too much, but TITLES atleast, I 
>hope exists in database-archive...
>
>Thanks for any help,
>sury
>(n2skr@iastate.edu)
>

Try Dissertations Abstract in your library. It contains a listing of the
published Ph.D. Dissertations of a particular subject area of the
universities that subscribe to it (quite a few).

Jeff
School of Aeronautics
Purdue University
(Internet: laytonj@gn.ecn.purdue.edu)
From: charlie@ernie.stat.washington.edu (Charlie Geyer)
Newsgroups: sci.math.num-analysis
Subject: Re: Choice of optimization methods
Date: 27 Jul 92 03:54:16 GMT
Organization: Univ of Wash , Stat Dept.

In article <1992Jul21.171506@trc.amoco.com> zkdc05@trc.amoco.com
(Kelly D. Crawford) writes:

> Let me offer you a summary given by Lawrence Davis at the Fourth International
> Conference on Genetic Algorithms.  It is one of the best ways I've found of
> determining when to use a GA:
>
>     When to Use Genetic Algorithms
>
>     - Problem requires good, but not optimal solution
>     - Acceptable performance measure is available
>     - Feasible to test many potential solutions
>     - Acceptable representation (of a solution) is available
>     - Size and complexity of search space preclude traditional approaches:
>          - Analytic solution
>          - Exhaustive search
>          - Hill-climbing
>          - Random search

Excuse me, but I can't imagine a problem in which the "size and complexity
of search space" preclude random search, especially methods like simulated
annealing in which the search is guided by the objective function.  How can
that be?

> Seriously, though, GAs have ample theory to suggest why they work, and
> although there is a certain degree of randomness (in fact, a LOT of
> randomness), there is a high probability that they will converge toward
> a good solution.

We just had a talk here last week that said that GAs had essentially no
theory -- the "fundamental theorem" isn't even a theorem, and so forth.
I haven't looked at the literature myself, but the speaker seemed to make
a reasonable case.  So two questions:

  1. Do GAs have any real theory?

  2. Is there any problem in which GAs beat simulated annealing?

-- 
Charles Geyer
School of Statistics
University of Minnesota
charlie@umnstat.stat.umn.edu
Newsgroups: sci.math.num-analysis
From: Dick Rinewalt <rinewalt@gamma.is.tcu.edu>
Subject: Surface Area and Volume Approximation
Organization: Texas Christian Univ Comp Sci Dept
X-Useragent: Nuntius v1.1b3
Date: Fri, 31 Jul 1992 01:17:31 GMT

Given a list of sphere descriptors (radius and coordinates of the
center), I need to calculate the surface area and volume of the "shrink
wrap" which encloses them. The structure is generally a branching one
instead of being compact.

If this poorly described problem sounds even vaguely familiar, I would
appreciate any pointers to the literature.

Dick Rinewalt             Computer Science Dept              Texas
Christian Univ
rinewalt@gamma.is.tcu.edu
Newsgroups: sci.math.num-analysis
From: dmr@apmaths.uwo.ca (Daniel M. Racicot)
Subject: putting libraries onto a unix
Organization: next test news reader
Date: Fri, 24 Jul 1992 01:31:48 GMT


	I was wondering if anybody here has put IMSL libraries onto a unix 
machine. We have just received one and I would like to use it but my 
programs call IMSL subroutines extensively. Our machine is an IBM RS 6000 I 
believe and I have read through the AIX fortran manual, this does not help.
I thought I could ftp all the source code onto the new computer compile the 
files into objects and then figure out how to make libraries, but the source 
code won't even compile. 

I have emailed IMSL support but they don't answer very quickly.
If someone here has done this or can offer me any assistance it would be 
greatly appreciated.
thanks in advance
Dan
dmr@apmaths.uwo.ca
Newsgroups: sci.math.num-analysis
From: gibsoni@ee470.ee.mcgill.ca ( irwin roger  gibson)
Subject: Bayes Classifier & Cluster Analysis softre required
Organization: EE Lab, McGill University EE Lab, Montreal
Date: Fri, 24 Jul 92 16:06:00 GMT

Bayesian Classifier & Cluster Analysis
=======================================

If anyone has or knows of the following types of software and there
availability: (ftp or email)

Bayesian Classifier & Cluster Analysis (DOS or UNIX)

This software is urgently required for use in Neural Network Research.


"I thank you for your cooperation and time."
********************************************
gibsoni@ee470.ee.mcgill.ca

Irwin Gibson
D'Ombrain Computer Facility
Dept. of Electrical Engineering
McGill University
Montreal, Quebec CANADA
H3A 2K6
From: wmitchel@fergie.dnet.ge.com (Bill Mitchell)
Newsgroups: sci.math.num-analysis
Subject: Re: Math software for a mathematical pendulum of length L and mass m
Date: 24 Jul 92 15:13:41 GMT
Organization: GE Advanced Technology Labs

In article <1992Jul22.141833.6229@monu6.cc.monash.edu.au>, map@hal.maths.monash.edu.au (Michael Page) writes:
|> In article <lexier.711772340@sfu.ca> lexier@fraser.sfu.ca (Lyle Lexier) writes:
|> > 
|> >     Is there any software for calculating the differential equation:
|> > 
|> >                    g
|> >          fi  =   - - sin (fi)
|> >            tt      L
|> 
|> First, it's phi not fi.  Second, this can be integrated by multiplying
|> both sides by phi_t, then I recall that the solution is expressible in
|> terms of elliptic functions.  Even without this it is pretty trivial to
|> integrate this numerically with 4th-order Runge Kutta for a pair of
|> first-order o.d.e.s 
|> 
|>             X_t = -g/L sin (Y) and Y_t = X.
|> 
|> My second-year students could do it.
|> 
|> 

Come on, take it easy on the guy.  You don't know what his background is,
or what his field of expertise is.

As long as you told him how to solve the problem with Runge Kutta, why
not answer his original question and tell him where to get the software?

Mail to netlib@ornl.gov with the message
send index from ode
and the message
send index from odepack

I'm sure one of them has an RK4 program.

Bill
Newsgroups: sci.math.num-analysis
From: drpatton@undergrad.math.waterloo.edu (Dave Patton)
Subject: Help with Brent's multiple-precision library
Keywords: Brent's Multiple precision
Organization: University of Waterloo
Date: Wed, 29 Jul 1992 15:20:07 GMT

Hi there.

I am attempting to use Brent's Multiple-precision library with a MIPS Fortran 77
compiler.  I would like to run a program which is fairly simple in nature but
which requires very high precision for certain choices of parameters.

Does anyone know how to run a simple program, which makes use of the AUGMENT
preprocessor?
Also, I seem to be encountering numerous compile errors with the library
routines.  Is this as a result of machine-dependent code, or am I missing 
something more obvious?

Please respond by email to drpatton@descartes.waterloo.edu

Thanks in advance for your suggestions!

Dave
From: mjfrisch@vx.cis.umn.edu (Michael J. Frisch, CIS 612/625-5830)
Subject: Maximize Volume of Boxes in Shipping Container
News-Software: VAX/VMS VNEWS 1.41    
Organization: University of Minnesota CIS
Date: Fri, 24 Jul 1992 17:57:00 GMT

I am helping one of our users who wants to get the maximum volume of boxes
to fit in a shipping container.  There are twelve different sized boxes.
I'm interested in any software for solving this problem.  Otherwise, is
there a way to set this up as a linear or nonlinear programming problem?
If so, how?  Are there other methods one could use?  Are there any
published articles or books on the subject?  Thanks for your help.

Michael J. Frisch
Computer and Information Services
University of Minnesota
612/625-5830
mjfrisch@vx.cis.umn.edu
From: rfanta@cea.berkeley.edu (Richard Fanta)
Newsgroups: sci.math.num-analysis
Subject: A few quick Matlab questions
Date: 31 Jul 92 13:22:58
Organization: CEA @ UC Berkeley, Berkeley, CA, USA.
Distribution: world
NNTP-Posting-Host: newport.cea.berkeley.edu


I'm not a Matlab guru yet so please help me out with the following:

1) How can I do 2-D histograms?

2) ""  ""  "" "" scatter plots in 3-D?

Right now we're using Matlab 3.5.  Also, help with the following would
be much appreciated:

3) Is there a mailing list for Matlab questions?  I've recently been
   added to MUG (Matlab User's Group run by Mathworks) but haven't
   received info on how to mail to the group.  If anyone has info
   on any other such mailgroups for Matlab, please let me know.

4) Matlab 4.0. Is it shipping?

Thanks much,

Rick Fanta
Center for EUV Astrophysics
   
--
--------------------------------------------------------------------------------
Rick Fanta			e-mail: rfanta@cea.berkeley.edu
Center EUV Astrophysics
From: JRBANGA@poppy.ucdavis.edu (JULIO RODRIGUEZ BANGA)
Newsgroups: sci.math.num-analysis
Subject: Choice of optimization methods
Date: 21 Jul 92 21:07:32 GMT
Organization: University of California, Davis
X-News-Reader: VMS NEWS 1.20


 Hi there.

  There is a huge amount of literature reporting the solution of optimization
problems using genetic algorithms and direct search optimization methods (like
the Complex from Box) that are more or less 'stochastic'.
 
 I'm myself a user of this type of methods because they are usually easy to
work with and, more important, they usually work well, if you don't mind CPU
 time very much. 

 However, these methods are usually regarded as 'politically incorrect', and
considered as 'inferior' when compared with, for example, SQP (sequential
quadratic programming) and gradient methods. For those interested, see the
comments of Dr. Sargent in the book 'Foundations of computer-aided process
design', edited by Sirola, Grossman and Stephanopoulos, CAChE-Elsevier, 1990.

 Though my work deals with optimization, I'm not an expert in the field, so I'd
like to receive opinions about the pros and cons of GA and direct search
methods when compared with 'politically correct' algorithms. Particularly, 
if those methods are 'incorrect', why are they so widely used?.

    Thanks in advance,

                               Julio.

==========================================================================
  Julio R. Banga                   ! Internet: <jrbanga@poppy.ucdavis.edu>
  University of California, Davis  ! Phone   :  916 752 8144
==========================================================================
From: ciechan@ubvmsc.cc.buffalo.edu (Chaishia Tracy Chan)
Newsgroups: sci.math.num-analysis
Subject: Routine "ZPORC" ?
Date: 27 Jul 92 18:16:00 GMT
Organization: University at Buffalo
News-Software: VAX/VMS VNEWS 1.41

Hi,

I am running a FORTRAN program, in which an IMSL routine "ZPORC" is used. 
Since I have to run this program on PC, so the source code of ZPORC is needed. 
Could anyone mail the source code to me if he/she has one? 
Thanx a lot!!!

Tracy
ciechan@ubvmsc.cc.buffalo.edu
Newsgroups: sci.math.num-analysis
From: yuan@saturn.eecs.nwu.edu (Ya-Xiang Yuan)
Subject: Re: Finding C Code for LINPACK/EISPACK Routines
Organization: EECS Department, Northwestern University
Date: Fri, 31 Jul 1992 11:30:10 GMT

In article <1992Jul31.120946.1@zodiac.dsto.oz.au> st_waldman@zodiac.dsto.oz.au writes:
>I would also like to know the location of C (and Fortran)
>versions of the LINPACK and EISPACK source codes.
>You can post replies directly to me, or to this
>news group.
>
>Thank you.
>
>Witold Waldman
>ST_WALDMAN@ZODIAC.DSTO.GOV.AU



      You can try FTP 
 emx.utexas.edu (128.83.1.33) in the directory pub/mathlib
 ( I think they have Linpack in C there)
.

-- 
Ya-xiang Yuan,  Computing Centre, Academia Sinica, BEIJING
From: kay@isgtec.UUCP (Ian Kay)
Newsgroups: sci.math.num-analysis
Subject: Looking for methods to calculate the Mobius Function
Date: 28 Jul 92 22:43:23 GMT
Distribution: world
Organization: ISG Technologies Inc., Mississauga Ont.


I am interested in calculating the Mobius (Meobius?) Function (Abramovitz and 
Stegun, p.826).  I looked in netlib, but did not find any keywords that matched. 
Does anyone have any ideas about how this function might be implemented?  I suspect that constructing a lookup table is probably the most efficient, but even that is an interesting problem.

Can anyone point me in the right direction here?

_______________________________________________________________________
Ian Kay                          kay@isgtec.com (...uunet.ca!isgtec!kay)
ISG Technologies Inc.                                     (416)672-2100
3030 Orlando Dr. Mississauga, Ontario
Canada L4V 1S8
--
_______________________________________________________________________
Ian Kay                          kay@isgtec.com (...uunet.ca!isgtec!kay)
ISG Technologies Inc.                                     (416)672-2100
3030 Orlando Dr. Mississauga, Ontario
Newsgroups: sci.math.num-analysis
From: steele@wesson.phys.ucalgary.ca (Dave Steele)
Subject: Bugs in Numerical Recipes in C
Date: Thu, 23 Jul 92 20:01:53 GMT
Reply-To: steele@wesson.phys.ucalgary.ca
Organization: Institute for Space Research
Keywords: numerical recipes, C, bugs, errors, style

About six weeks ago I posted a query to this newsgroup about the relia-bility
of the latest edition of _Numerical Recipes in C_.  After a couple of
weeks with no responses, I addressed my questions to Numerical Recipes
Software at the address given in the book.  I received a reply from
William Vetterling, one of the book's authors, and thought some of you
might be interested in what he had to say.  Excerpts follow:

"...we have periodically updated the books and diskettes to reflect our
latest knowledge of errors. ... we can only correct errors when a
printing cycle completes.  However, the rate of error reports has slowed
to a trickle, and most of them report errors that only exist in previous
versions.  It is also true of bug reports of the numerical bulletin
boards that most are errors that were long-ago discovered and corrected.
...
There will be a new edition of the Recipes in C appearing early in
1993..."

I'm impressed with the prompt and helpful response from Numerical Recipes
Software.

Dave

-- 
David Steele                          |  Internet : steele@wesson.phys.ucalgary.ca
Department of Physics and Astronomy   |  SPAN     : CANCAL::STEELE
The University of Calgary             |  Phone    : +1 403 220 8651
OPINIONS EXPRESSED WITHIN ARE MY OWN AND NOT THOSE OF THE UNIVERSITY OF CALGARY
Newsgroups: sci.math.num-analysis
From: pkchung@stokes.Princeton.EDU (Phil Chung)
Subject: Periodic Tridiagonal Solver
Originator: news@ernie.Princeton.EDU
Keywords: Compact Finite Differences, Periodic Thomas Algorithm
Organization: Princeton University
Date: Tue, 21 Jul 1992 03:33:18 GMT

i hope that this is not a FAQ.  i have just gotten a undergraduate
engineering degree and am "attempting" to pursue some research in CFD
before i go on to grad school.  my apologies if this question
is inappropriate for this news group.

i am trying to do some CFD using 4th order compact finite differences
(classical Pade scheme).  this method of finite differencing yields
4th order accuracy in space with only a 3 point stencil, i.e. a
tridiagonal system.  the problem i have is that when i want to
implement periodic boundary conditions, i get a tridiagonal system
with two extra terms on the first and last rows.  i have been told
that a periodic version of the Thomas algorithm exists somewhere out
there.  i was wondering if anyone knew where i could get a hold of
such a routine, either in C or FORTRAN (preferably in C, though).

thanks in advance,

phil chung
-- 
typical disclaimer: blah! blah! blah!

pkchung@acm.princeton.edu
From: solca1@urz.unibas.ch
Newsgroups: sci.math.num-analysis
Subject: Non-Linear PDE,finite diff meth.
Date: 30 Jul 92 18:23:05 MET
Organization: University of Basel, Switzerland

Hello everyboby 

I'm working on Reaction-Transport equation of the type :

		a + b <-> c  with k1 -> , and k2 in <- direction as rate 
						       constant.

The PDE I get as usual :

dt(Ca(x,t))= D dx**2(Ca(x,t)) -k1Ca(x,t)Cb(x,t) + k2Cc(x,t)

where D=diffusion const, dt=Dt (now D as partial Differential operator)
      dx**2 = Dxx (second partial derivative in x) .
      Ca(x,t) space-time concentration of specie A ,Cb the same for b .....

 
Naturally you get the same pdes for Cb(x,t) and Cc(x,t) with little changes.
I have a system of three non-linears PDEs which must solved simultanously .

I have made a simulation on a Cellular Automata of this reaction-transport
process and I'm interested in a numerical solution too. I have planed to use 
finite difference method to solve this system of PDE's .The problem is, 
must I first do a linearization of the system or  can I simply use the usual 
algorithm for linear Pde. 
If, for instance, you have a linear pde , you use the implicit or the 
explicit scheme  . Now what happend if your pde is non-linear ,is a $
linearization obligatory or not ? In some books it is said that you can 
ungo this linearization, and in other the contrary is not said but 
nothing is said about ? If some body have some answers to my questions 
it  would be glad  of you to mail me .Thanks for any suggestion !!

					bye Jan .
      





Newsgroups: sci.math.num-analysis
From: enzo@research.canon.oz.au (Enzo Liguori)
Subject: REQUEST : Simulated Annealing versus Genetic Algorithms
Organization: Canon Information Systems Research Australia
Date: Wed, 29 Jul 1992 02:23:03 GMT

Does anybody know about any serious study about performances of Simulated
Annealing (SA) compared to Genetics Algorithms (GA) ?
Personal opinions and experience are welcome as well.
I know that there's a book called "Simulated annealing and Genetic Algorithms"
or something like that but I've never had any chance to read it.
I have some experience with SA, but none with GA and the only person I know who
tryed both is extremely pessimistic about GA.
If there's any interest I'll summarize.
Thanks in advance.

           Enzo

Enzo Liguori - Canon Information Systems Research Australia
Newsgroups: sci.math.num-analysis
From: meelan@cmb44.larc.nasa.gov (Meelan Choudhari)
Subject: SLEIGN code, singular Sturm-Liouville eigenvalue problems
Originator: meelan@cmb44.larc.nasa.gov
Organization: NASA Langley Research Center  Hampton VA  23665
Date: Mon, 27 Jul 1992 14:21:52 GMT

I need to solve a singular (2nd order) eigenvalue problem on [0, inf.) which, 
in general, has not only a regular singularity at the origin, but also at some 
interior location where the solution itself may also be unbounded.  The interior
singularity can be bypassed by integrating along an indented contour in the 
complex plane which can be chosen using (related) physical considerations.  
However, the endpoint singularity has led to in considerable difficulties
in the numerics which usually get attracted to a different eigenvalue than 
the one I would like to track or oscillate between some two eigenvalues as
I vary another controlling parameter in the problem.   

In order to get a handle on the global spectrum of this equation, one may
examine a simpler equation corresponding to a particular asymptotic limit, viz.,
           y'' - (1 - 1/x*x) y = 0;   y(0) = y(inf.) = 0,
which does not have any interior singularity.  It is also possible to express
the solutions to this equation in terms of modified Bessel function solutions 
of an imaginary order; but that does not help much. Unfortunately, even for 
this simpler equation, the numerics failed to exhibit convergence with respect 
to grid size and/or choice of the trucated domain. 
 
During a search for robust, canned public domain routines which also accomplish 
the same task, I came across the SLEIGN code by Bailey et. al. which has been 
modified recently and published as TOMS algorithm 700.  However, the netlib 
archives at ORNL do not seem to go beyond algorithms 686.  Does anyone have an 
idea as to whether this code can also be copied from some other site of 
archives?

Suggestions regarding other comparable codes, and their availability would
also be welcome.  I know about the D02KEF routine from the NAG library, but  
have no access to NAG.  In their 1968 article in TOMS, Bailley et. al. mention 
that singulat Sturm-Liouville cases are usually treated on a case by case basis,
although no references are given.  Therefore, related references would be
appreciated as well.

Thanks in advance to all.

- Meelan Choudhari

-------------------------------------------------------------------------
email : meelan@tab00.larc.nasa.gov
Ph.   : (804)-864-2240
mailing address: M. S. 156, NASA Langley Research Center, Hampton, VA 23665.   
-------------------------------------------------------------------------
 

Newsgroups: sci.math.num-analysis
From: jonathan@chpc.utexas.edu (Jonathan Thornburg)
Subject: Re: Algorithm to find which bits set.
Summary: there a number of "fast" algorithms, see any good combinarial algs book
Keywords: Bit counting
Organization: U of Texas at Austin / Physics Dept / Center for Relativity
Date: Tue, 28 Jul 92 01:51:39 GMT

In article <1992Jul26.013041.10387@infonode.ingr.com>
aaronb@suhana.analog.ingr.com writes:
>My friend asked me the fastest way of finding which bits are
>set in a bit-string.  I gave him my first response.  But I think there
>is a better way of doing it.

There are quite a few -- this problem has been studied a lot.
Any good book on combinatorial algorithms should cover the various
algorithms.  For example, see

	Reingold, Neiversgelt [sp?], and Deo
	"Combinatorial Algorithms: Theory and Practice"

which describes several of them, and gives references to the original
literature for further details.

- Jonathan Thornburg
  <jonathan@einstein.ph.utexas.edu> or <jonathan@hermes.chpc.utexas.edu>
  University of Texas at Austin / Physics Dept / Center for Relativity
  and (for a few more months) U of British Columbia / {Astronomy,Physics}
Newsgroups: sci.math.num-analysis
From: sshws@convx1.lerc.nasa.gov (Herb Schilling)
Subject: Re: PC software to do Partial Diff EQ's ?
Organization: NASA Lewis Research Center
Date: Wed, 22 Jul 1992 11:14:04 GMT



A while ago I asked if there are any PC packages ( commercial or freeware ) 
to do partial differential equations ?

 I promised a summary of responses.

 The only response that I got was posted to this newsgroup. It said that it
was planned to have Mathematica support PDE's by the end of the year in
version 2.2.
-- 
Herb Schilling , NASA Lewis Research Center , 21000 Brookpark Road, MS 142-5
Cleveland, Ohio 44135 . (216) 433-8955       sshws@convx1.lerc.nasa.gov
Newsgroups: sci.math.num-analysis