HDTenEightyP/NetNews huggingface dataset:
From: mstemper@ems.cdc.com (Michael Stemper)
Newsgroups: sci.math
Subject: Re: Fundamental Theorems?
Date: 13 Aug 92 17:02:07 GMT
Reply-To: mstemper@ems.cdc.com
Organization: Empros Systems International, a division of Ceridian

In article <4711@balrog.ctron.com>, wilson@web.ctron.com writes:
|>     Fundamental Theorem of Geometry:
|> 
|> 	The Independence of the Parallel Postulate:
|> 
|> 	The parallel postulate is independent of the axioms of absolute
|> 	geometry.
|> 
|> 	Try to beat this one for historical importance as well as its 
|> 	bearing on mathematical thought.

Important, yes. Accepted, yes. Theorem, no.
How would you prove this? Reductio ad absurdum? :->

|>     Fundamental Theorem of Mathematics:
|> 
|> 	The principle of mathematical induction:
|> 
|> 	Let P(x) be a proposition about natural number x.  If
|> 	    1.  P(0)
|> 	    2.  For all x, P(x) ==> P(x+1)
|> 	Then P(x) is true for all numbers.
|> 
|> 	This principle pervades mathematics.  To understand, appreciate,
|> 	and use mathematical induction is the entry ticket to mathematics.
|> 
|> 	(Bob Silverman points out that mathematical induction is an
|> 	axiom.  I believe that this makes it no less a theorem).

I thought that axioms were what you used to prove theorems?

-- 
#include <Standard_Disclaimer.h>
Michael F. Stemper
Power Systems Consultant
mstemper@ems.cdc.com
From: wilson@web.ctron.com
Newsgroups: sci.math
Subject: Equivalence teaser
Date: 18 Aug 92 15:45:25 GMT
Reply-To: wilson@web.ctron.com ()
Organization: Cabletron Systems INc.
Originator: wilson@web


    Let S and T be subsets of a metric space M with norm ||.  Define
    S == T iff there exists a bijection f from S to T and a real number
    d such that |x-f(x)| <= d for all x in S.

    1.  Show that == is an equivalence relation.

    2.  Let M = R^2 and || be the L2-norm.  Let G be the set of points
    with integer coordinates, and G' be its image under some rotation
    and translation in R^2.  Does G == G'?  (I know the answer).



-- 
David W. Wilson (wilson@ctron.com)

Disclaimer: "Truth is just truth...You can't have opinions about truth."
- Peter Schikele, introduction to P.D.Q. Bach's oratorio "The Seasonings."
From: goddard@NeXTwork.Rose-Hulman.Edu (Bart Goddard)
Newsgroups: sci.math
Subject: Re: Calculus and Mathematica
Date: 19 Aug 92 18:42:34 GMT
Article-I.D.: cs.1992Aug19.184234.5437
Organization: Rose-Hulman Institute of Technology


In article <1992Aug19.174230.21555@alchemy.chem.utoronto.ca>  
mroussel@alchemy.chem.utoronto.ca (Marc Roussel) writes:
> In article <1992Aug19.163805.3972@cs.rose-hulman.edu>
> goddard@NeXTwork.Rose-Hulman.Edu (Bart Goddard) writes:
> >Last year, I gave the  
> >new class roughly the same list (but longer) and had them integrate  
> >them on the machine.  (I had to check that the maching could do all  
of  
> >them before I made the assignment.  If the machine can't, the  
problem  
> >isn't a good example for this exercise.)
> 
>      Did you eventually show your students examples the computers
> screwed up badly?  Integration is the one thing which computer  
algebra
> systems all claim to do, but can't handle reliably.  If you use one  
of these
> systems in your classes, you have to show the students just how
> dangerously stupid these things are.
> 
> 				Marc R. Roussel
>                                 mroussel@alchemy.chem.utoronto.ca
In a way.  There is no trouble finding ample problems of any type with  
which the machine has trouble.  I didn't present these as a set of  
isolated pathological cases.  Instead, the tack of the course is  
different.  With a CAS available, one can explore more of a problem  
than was previously practicle.  You shouldn't just "do the integral",  
but also make appropriate graphs, calculations, whatever to make sure  
your result makes sense, and to make sure you have covered all facets  
of the problem.  The functions in max/min problems should be plotted  
and the critical points estimated and checked against the zeros of the  
derivative.  Plotting the integrand may reveal a singularity to a  
student  who may have missed an improper integral otherwise.

SOOOOOOooooo, since we never did anything in isolation, the "danger" is  
considerably reduced, PLUS we got to emphasize problem solving more.   
After all is said and done, you want the bridge to really support the  
truck, and you would check your work in many ways.  This helps a  
student to see how different parts of mathematics relate.

Bart Goddard
goddard@nextwork.rose-hulman.edu
Xref: sparky sci.math:10511 sci.physics:13327
From: nickh@CS.CMU.EDU (Nick Haines)
Newsgroups: sci.math,sci.physics
Subject: Re: tensors: How about 3rd, 4th rank?
Date: 22 Aug 92 22:14:34 GMT
	<israel.714359708@unixg.ubc.ca> <5130@tuegate.tue.nl>
	<5134@tuegate.tue.nl> <3djygrk@rpi.edu>
Organization: School of Computer Science, Carnegie Mellon University
Originator: nickh@VOILA.VENARI.CS.CMU.EDU

- rank-2 tensors are not matrices. Matrices are simply ordered sets of
scalars. The difference between a tensor and a scalar is in their
behaviour under changes of coordinates.

- 3rd and 4th order tensors crop up all the time in GR.

Nick Haines nickh@cs.cmu.edu
From: tsen+@EDRC.CMU.EDU (Chung Kang Tsen)
Newsgroups: sci.math
Subject: Walsh Functions what is it?
Date: 13 Aug 92 20:19:19 GMT
Article-I.D.: cs.Bsxv48.Ko7.2
Organization: Carnegie Mellon University


Can someone give me a brief description of what Walsh Functions are,
some of it's applications and also good references to the subject?

I am studying applications of Walsh functions in Genetic Algorithms, but
I want to know if there are other areas that use (and how they use)
it, so I can have a better view of the overall picture.

  Thanks in advance,

           Tsen
Newsgroups: sci.math
From: tim@maths.tcd.ie (Timothy Murphy)
Subject: Re: tensors: How about 3rd, 4th rank?
Organization: Dept. of Maths, Trinity College, Dublin, Ireland.
Date: Sat, 22 Aug 1992 13:35:04 GMT

More simply, the determinant in n dimensions
corresponds to a tensor of rank n ,
the epsilon tensor $\epsilon_{i_1i_2\dots i_n}$.

-- 
Timothy Murphy  
e-mail: tim@maths.tcd.ie
tel: +353-1-2842366
s-mail: School of Mathematics, Trinity College, Dublin 2, Ireland
From: POKORNY@rzmain.rz.uni-ulm.de (POKORNY DAN)
Newsgroups: sci.math
Subject: Anybody from Dubrovnik/Croatia to COMPSTAT?
Date: 19 Aug 92 21:17:43 GMT
Organization: University of Ulm, Germany
X-News-Reader: VMS NEWS 1.23

I wish to contact anybody from Dubrovnik (or Dalmatia, or Croatia at least),
where the last statistical symposium COMPSTAT has been held,
who intends to go to the current COMPSTAT in Neuchatel/Schwitzerland
next week.
I will greatly appretiate her/his opinion to a certain idea I have got.

------------------------------------------------------
Sorry for this non-mathematical posting here...
------------------------------------------------------

Thanks

Dan Pokorny, Dept. Pychotherapy, Univ. of Ulm
pokorny@rzmain.rz.uni-ulm.de
From: cxd653@huxley.anu.edu.au (Chunping Ding)
Newsgroups: sci.math.num-analysis
Subject: Numerical solution of parabilic equation
Date: 20 Aug 92 12:42:25 GMT
Organization: Australian National University
Originator: cxd653@huxley

I am looking for a source code (C or Fortran) to solve the
parabolic equation on two space dimensions. I don't care
what numerical method has been used to solve the equation.
It would be better if I can be also given some test data.

I do not read this group very often, please send email to myself.

Thank you for your help!

Ding Chunping

________________________________________________________________________

(Mr.) Ding Chunping             Telephone 61 6 249 4205 or 61 6 249 2066
Geology Department              Fax       61 6 249 5544                 
Australian National University  Email:    cxd653@huxley.anu.edu.au
GPO Box 4, Canberra, ACT 2601             ding@basins.anu.edu.au
Australia                                 ding@grafix.anu.edu.au
________________________________________________________________________
From: androula@lips.ecn.purdue.edu (Ioannis Androulakis)
Newsgroups: sci.math.num-analysis
Subject: Calculation of Lyapunov Exponents
Keywords: lyaponov exponent
Date: 12 Aug 92 22:10:36 GMT
Organization: Purdue University Engineering Computer Network

Is there any public domain code available for 
calculating Lyapunov exponents of discrete
dynamical systems ?
Thanks for any information

androula@ecn.purdue.edu
From: bobh@river.hwr.arizona.edu (Bob Harrington)
Newsgroups: sci.math.num-analysis
Subject: Re: Calculation of Lyapunov Exponents
Keywords: lyaponov exponent
Date: 17 Aug 92 04:13:16 GMT
Organization: University of Arizona -- Tucson, AZ

In article <b94m4l#@lynx.unm.edu> john@aquarius.unm.edu (John Prentice) writes:
>In article <androula.713657436@lips.ecn.purdue.edu> androula@lips.ecn.purdue.edu (Ioannis Androulakis) writes:
>>Is there any public domain code available for 
>>calculating Lyapunov exponents of discrete
>>dynamical systems ?
>>Thanks for any information
>>
>
>Look in comp.theory.dynamic-sys .  There is a ftp site that has some
>software to do what you need.  I recall it being discussed in that
>newsgroup a month or so ago.
>
>John
>
>-- 
>Dr. John K. Prentice                      
>Partner, Quetzal Computational Associates    
>3200 Carlisle N.E., Albuquerque, NM   87110-1664; 505-889-4543
>john@unmfys.unm.edu -or- jkprent@cs.sandia.gov -or- prentice@rufous.cs.unm.edu

If you can't find it in comp.theroy.dynamic-sys, look in sci.geo.fluids. I
saw a posting there advertising an ftp site with some chaos software and
a preprint server.

Bob Harrington
Xref: sparky sci.math.num-analysis:2506 comp.sys.dec:4663
From: hsong@ardour.bellcore.com
Newsgroups: sci.math.num-analysis,comp.sys.dec
Subject: Xnetlib trouble on DecStation 5000/200
Date: 21 Aug 92 19:18:26 GMT
Reply-To: hsong@ardour.bellcore.com
Organization: Bellcore


Hi,
Am I the only person having trouble with xnetlib?  On DecStation 5000/200,
I was trying to download "LAPACK" revised version.  The xnetlib window is 
constantly being messed up.  Last time when I downloaded LAPACK right 
after intalling xnetlib Version 2.0  (is this the latest?),
I was able to download.  But now, I can't.  So please send me a line
telling typical, usual troubles you are experiencing with xnetlib.  
Especially from DecStation users.

I am running Ultrix 4.0.  Yes X11R3 server with twm manager.

Thank you.

	Hugh
From: hrubin@pop.stat.purdue.edu (Herman Rubin)
Newsgroups: sci.math.num-analysis
Subject: Re: REQUEST: lst sqrs withs errors in both X and Y
Date: 14 Aug 92 22:03:21 GMT
Organization: Purdue University Statistics Department

In article <1992Aug4.135256.11081@gov.on.ca> diamong@gov.on.ca (Gerald Diamond) writes:
>I am looking for a good reference (or references) for 
>a least-squares type algorithm which treats both X and Y as 
>having errors rather than the usual case of assuming all the
>errors are in one variable.

If you are looking for something which has a meaning from the 
standpoint of statistical inference, there are things which can
be done, but not simply.  
-- 
Herman Rubin, Dept. of Statistics, Purdue Univ., West Lafayette IN47907-1399
Phone: (317)494-6054
hrubin@pop.stat.purdue.edu (Internet, bitnet)  
{purdue,pur-ee}!pop.stat!hrubin(UUCP)
Newsgroups: sci.math.num-analysis
From: kurtles@momth3.maths.monash.edu.au (Mr K.A. Brinschwitz)
Subject: REQUEST:Code for network with gains
Organization: Monash University
Date: Wed, 19 Aug 1992 00:31:13 GMT

Hi there:

	I am interested in obtaining either C or FORTRAN coding for
a generalized network solver. The particular problem of interest is 
this:
	Consider a directed graph with set of nodes, N, and  a set of arcs, ARCS.
Each arc, (i,j), has a scalar associated with it, Aij   , the COST of (i,j).
Let Fij  denote the FLOW on arc (i,j). There are upper and lower bounds on Fij,
Cij and Lij respectively.

With each arc (i,j),  there is an associated scalar Kij, the GAIN of arc (i,j).

The problem:
                 _
      minimize   > Aij Fij
                 -
         (i,j) element of ARCS


subject to

         (Conservation of flow)
          _                               _
          >  Kmi  Fmi          -          >  Fim          =  0    (For All i in N)
          -                               -
          m                               m
   (m,i) element of ARCS        (i,m) element of ARCS

       
          (capacity constraints)

          Lij <=  Fij   <=  Cij        (for all (i,j) in the set ARCS)	   

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

I am interested in obtaining a network solver that handles the above for 
cases with  Kij not always unity (ie networks with gains and losses.)

I already have a paper by Bertsekas and Tseng (OPERATIONS RESEARCH, VOL36 No 1
1988),  in which an algorithm is formulated for solving a network with Gains.
Does anyone know if the algorithm has been implemented as code? I already have a copy
of their code to solve for a no-gain network, but it seems a non-trivial task
to upgrade their code to the GAINS case. 

I would be most grateful for any help whatsoever.

Kurt Brinschwitz
Postgraduate Student
Monash University, Australia
From: madams@ecst.csuchico.edu (Michael E. Adams)
Subject: *moan*beg*: HELP : sob,snif "forlorn looks", much suffering....
Organization: California State University, Chico
Distribution: usa
Date: Sun, 23 Aug 1992 11:30:11 GMT

Did I forget, or did I just sleep in class too much in 1980 and
never really learned how to....

      >>>>> solve the "Time Value of Money" equation for 'i' <<<<<<

                             ?????????

Given:  p, n, b, & f = 0;  How do you solve for 'i'?

                            -n                       -n
     100 p  1 - (1 + i/100)^   +  b = -f (1 + i/100)^
            ---------------
                   i

Or,
                    -n
      1 - (1 + i/100)^   =  -b
      ---------------      -----
             i             100 p

And that's as far as I get.  I need HELP!!!!! *sniff*
Pascal code would be nice.  But I can live with an equation: 'i' alone.

Thank you for you time
-Michael

         (___)      |  Michael E. Adams
         (o o)      |  
  /-------\ /       |  P.O. Box 5027
 / |     ||O        |  Chico,  California  95927-5025    U.S.A.
*  ||,---||         |
   ~~    ~~         |  Internet: madams@cscihp.ecst.csuchico.edu
-- 
Hi! I am a .signature virus. Copy me into your .signature to join in!
From: celms@vim.brl.mil (Dr. Aivars Celmins )
Newsgroups: sci.math.num-analysis
Subject: Re: REQUEST: lst sqrs withs errors in both X and Y
Date: 19 Aug 92 14:03:57 GMT
Organization: U.S. Army Ballistic Research Laboratory, APG, MD.

>In article <1992Aug4.135256.11081@gov.on.ca> diamong@gov.on.ca (Gerald Diamond) writes:
>I am looking for a good reference (or references) for 
>a least-squares type algorithm which treats both X and Y as 
>having errors rather than the usual case of assuming all the
>errors are in one variable.
>

  The problem (with arbitrary number of coordinates with errors) is
  discussed and solved in

   A. Celmins, Least-Squares Optimization with Implicit Model Functions, in
   "Mathematical Programming with Data Perturbations II", Anthony V. Fiacco,
   Ed., Marcel Dekker, 1983, pp. 131-152.

   Aivars Celmins
From: mbk@lyapunov.ucsd.edu (Matt Kennel)
Newsgroups: sci.math.num-analysis
Subject: Re: REQUEST: lst sqrs withs errors in both X and Y
Date: 16 Aug 1992 21:12:10 GMT
Organization: Institute For Nonlinear Science, UCSD
NNTP-Posting-Host: lyapunov.ucsd.edu
X-Newsreader: Tin 1.1 PL3

stewart@cs.umd.edu (G. W. Stewart) writes:
: In article <1992Aug4.135256.11081@gov.on.ca> diamong@gov.on.ca (Gerald Diamond) writes:
: >I am looking for a good reference (or references) for 
: >a least-squares type algorithm which treats both X and Y as 
: >having errors rather than the usual case of assuming all the
: >errors are in one variable.
: 
: Since this problem occurs frequently, I am taking the liberty of
: appending a rather long list of references from my personal data base.
: It is the result of a brute-force search on keywords and certainly
: contains some irrelevant articles.  With equal certainty it also
: omits some relevant articles.
: 
: Pete Stewart

: <bibliography deleted>


There's a new FORTRAN package on 'netlib', (i.e. where LINPACK and
others of it's bretheren live) called ODRPACK, which does what
you want, if you're interested.

--
-Matt Kennel  		mbk@inls1.ucsd.edu
-Institute for Nonlinear Science, University of California, San Diego
-*** AD: Archive for nonlinear dynamics papers & programs: FTP to
-***     lyapunov.ucsd.edu, username "anonymous".
From: cscoging@unpcs1.cs.unp.ac.za (Chris Scogings)
Newsgroups: sci.math.num-analysis
Subject: WANTED: Optimization problem
Date: 20 Aug 92 07:39:13 GMT
Article-I.D.: unpcs1.cscoging.65
Organization: University of Natal (Pietermaritzburg)

I am testing various optimization methods and I need some problems to test 
them out on.  These problems must not be too simple (I have already used 
Rosenbrock's function, etc.) but must not be so complicated that I spend all 
my time setting up the function and not optimising it.

Ideally, I need a moderately complex function of 3 to 8 variables.  It is 
not necessary for the function to be differentiable.  Results of the 
optimization and comparisons between various methods will be posted if 
anyone is interested.

Thank you
Chris
From: ajayshah@almaak.usc.edu (Ajay Shah)
Newsgroups: sci.math.num-analysis
Subject: Re: Numerical Recipes stuff
Date: 21 Aug 1992 23:29:33 -0700
Organization: University of Southern California, Los Angeles, CA
Distribution: usa
NNTP-Posting-Host: almaak.usc.edu

mccauley@ecn.purdue.edu (Darrell McCauley) writes:

>Now a question: has anyone compiled a list of replacement routines
>for those found in NR? By replacement routines, I mean net sources
>(anonymous ftp) that can be redistributed with PD software. Would
>such a list be legal if it included the names of corresponding
>NR routines? Would it be legal/ethical to redistribute such a list?
>(I have the humble beginnings of a list.)

Of course it's legal and ethically appropriate to work on
such a list.  I'm incredibly irritated at NR for not making their
code open (like Linpack, say).

To the extent that the code has appeared in print, it's hard for them
to sue anyone; you can't prove in court of law that I did not type out
the code from the book.  Functions like dmatrix() are the only real
catch.  I have a full (and superior) reimplementation of these.
Send me email for more info; they will appear by ftp "soon".

        -ans.
-- 
Ajay Shah, (213)749-8133, ajayshah@usc.edu
Newsgroups: sci.math.num-analysis
From: smadden@titan.trl.OZ.AU (Steve Madden)
Subject: Help on R1mach and D1mach for DEC 5000
Organization: Telecom Research Labs, Melbourne, Australia
Date: Fri, 14 Aug 1992 00:41:49 GMT

Greetings,
	  we are trying to use some of the wonderful code from Netlib, and
much of this calls r1mach and d1mach. Does any knowledgeable soul out there
know what the relevent quantites are for a DEC 5000 ? (no-one in our support
area seems to, and the headings are'nt overly clear). We're using the "Fort"
compiler on this machine by the way, which is I think a version of Vax
fortran recompiled for the MIPS chip (?). Any help greatly appreciated, 

				Thanks


      /~~~\   !                           
      \___    !---   ___ .    .  ___       ###########################
          \   !     /___> \  /  /___>      # smadden@titan.trl.OZ.AU #
      \___/   \__/  \___   \/   \___       ###########################
From: rdd@ukc.ac.uk (Rudnei Dias da Cunha)
Newsgroups: sci.parallel,sci.math.num-analysis
Subject: Timing an application program under PVM
Date: 20 Aug 92 14:40:16 GMT
Organization: Computing Lab, University of Kent at Canterbury, UK.

Dear colleagues,

I wonder if somebody who uses PVM could help me. I am having trouble
measuring the time taken by some application programs written in FORTRAN 77
and run on a network of SUN4s. 

Apparently the execution time returned by the function ``dtime'' is that of 
the application program only and is not including the time taken by the 
daemons to actually transfer the data. Any suggestions? Shall I use a
similar approach to that in the program ``timing.c'' that comes with PVM,
which uses the ``gettimeofday'' routine?

Thanks in advance!
--
                                    Rudnei Dias da Cunha
                                        rdd@ukc.ac.uk
                       Computing Lab, University of Kent at Canterbury
                          Canterbury, Kent  CT2 7NF, United Kingdom
From: inlowm@cpva.saic.com
Newsgroups: sci.math.num-analysis
Subject: Re: REQUEST: lst sqrs with errors in both X and Y
Date: 15 Aug 92 00:01:17 GMT
Organization: Science Applications Int'l Corp./San Diego


  This may have been mentioned already but I believe that when
you have "errors in both x and y" you have a "Total Least
Squares" problem.  So you might want to check out the literature
on total least squares.  In particular, SIAM has a book, basically
a compilation of articles, out on total least squares.

Mark Inlow
SAIC
(619) 546-6978
inlowm@jupiter.saic.com
From: tcsg3046@uxa.cso.uiuc.edu (Timothy C. Sozen)
Newsgroups: sci.math.num-analysis
Subject: Looking for fast way to find max and min eigenvalues
Summary: Need to find fast way to find max and min eigenvalues
Keywords: eigenvalues max min poodle
Date: 20 Aug 92 21:28:47 GMT
Article-I.D.: news.BtAx00.Lq9
Organization: University of Illinois at Urbana


I would like to know if there is a way to find max and min eigenvalues 
of a system of equations. That is, is there a way to find them without
finding every eigenvalue and testing for max and min?

Thanks in advance

Tim

PS My matrix is symmetric positive definite and 7-diagonal.
Newsgroups: sci.math.num-analysis
From: N020BA@tamvm1.tamu.edu
Subject: Custom Wavelets From Data-How do you do it?
Organization: Texas A&M University
Date: Sat, 15 Aug 1992 00:18:28 GMT

     Hello! I've got a wavelet problem. I'd like to take some EEG data,
extract a waveform from that data, and change that waveform into a basic
wavelet. The wavelet thus computed would be used in subsequent analysis.
How would this be done. Please either by E-mail (N020BA@tamvm1.tamu.edu)
or to the group. Thank you very much.
 
========================================================================
The truth may hurt, but lies hurt more.  | My opinions are mine and mine
The difference between left-wing incomp- | alone. I speak for myself and
etance and right-wing incompetance is    | no-one else.
the difference between cat #$!& and dog  |______________________________
#$!&. Reply to N020BA@tamvm1.tamu.edu.        Bill and Opus in '92!!
Newsgroups: sci.math.num-analysis
From: yip-ken@CS.YALE.EDU (ken yip)
Subject: Errata sheet for Kahaner et al. book  (Numerical Methods and Software)?
Organization: Yale University, Department of Computer Science
Date: Fri, 14 Aug 1992 18:15:57 GMT


Does that exist?  It is quite annoying to go through examples and
problems that don't seem to work.  (E.g. P3-8, p78)
Newsgroups: sci.math.num-analysis