HDTenEightyP/NetNews huggingface dataset:
From: agw@cs.columbia.edu (Art Werschulz)
Subject: Re: numerical integration in several dimensions
Reply-To: agw@cs.columbia.edu
Organization: Columbia University Department of Computer Science
Distribution: sci
Date: Thu, 8 Oct 1992 15:59:24 GMT

Hi all.

In article <Bvs362.4wo@mentor.cc.purdue.edu> hrubin@mentor.cc.purdue.edu (Herman Rubin) writes:

   It is not necessarily the case that even in one dimension, Gaussian
   quadrature is that great.  If one uses 32-point quadrature, the result
   is exact for polynomials of degree 63, but it is not too hard to find
   "natural" functions which are not well approximated by polynomials of
   degrees under the thousands, at least.

To be more specific, suppose you want to compute the integral of a
function in the $d$-dimensional unit cube.  Suppose further that your
class of integrands belongs to the unit ball of the Sobolev space
$W^{r,\infty}$.  (Roughly speaking, overall smoothness of order $r$
almost everywhere; the "unit ball" part is a normalization.)  Our
model of computation assumes a fixed cost for function evaluations and
that basic scalar operations have unit cost.

Suppose we use a worst case setting, i.e., the error of an
algorithm $\phi$ using evalutions at $t_1, \ldots, t_n$ is given as
$$|sup_{f\in F} \bigg|\int_D f - \phi(f(t_1),\ldots,f(t_n)) \bigg|.$$
Then the minimal error possible with $n$ function evaluations is
proportional to $n^{-r/d}$.  Alternatively, the $\epsilon$-complexity
(the *minimal* cost of an $\epsilon$-accurate approximation) is
proportional to $(1/\epsilon)^{d/r}$.

If we ignore the proportionality constants, this means that for fixed
smoothness $r$ and error criterion $\epsilon$, the complexity grows
exponentially in $d$.  Note that we're talking about complexity here,
i.e., the minimal cost over all algorithms.  This means that the
integration problem is inherently intractible for high-dimensional
regions.

If we want to beat this intractability, we have onlly two
alternatives:

(1) Change the model of computation.

(2) Change the setting (e.g., use an expectation instead of a sup when
    combining the errors at each problem element $f$ to find the
    overall error of an algorithm).

(3) Use another class of functions as the problem elements.  
    
For further discussion, refer to Wo\'zniakowski's article in the
BUlletin of the AMS (January, 1991).

 
--
      Art Werschulz
      InterNet:  agw@cs.columbia.edu
      ATTnet:    Columbia University (212) 939-7061
                 Fordham University  (212) 636-6325
Newsgroups: sci.math.num-analysis
From: emmel@pslu1.psl.wisc.edu (Grant Emmel)
Subject: Software for the Assignment Problem
Summary: Looking for (easily modified) software for Assignment Problem
Keywords: software, assignment, scheduling
Organization: Physical Sciences Lab, University of Wisconsin
Date: Wed, 14 Oct 92 04:38:50 GMT

I'm looking for available software (public domain or not) for a
non-commercial/non-educational application (I'm helping a friend)
that will solve the assignment problem.  That is the general idea.

The specific idea is for scheduling resources that have restrictions
on when they can be scheduled.  The point is that I don't want to
have to pre-select timeslots since I could have a 100 or so resources.

The application is for a recreation league.  I need to schedule people
(referees) to various places (gyms) at various times (games).  Each of
the people, places and times have varing availability.

The problem seems straightforward enough and I seem to remember some
of theory behind it all (transshipment theory, feasible solutions,
integer-valued optimal solutions,...)  It's all pretty fuzzy.

Any help, from theory to software would be helpful.  Post if it is
interesting enough, email in any case.

Thanks ahead of time (I told my buddy I'd find help!  :-)  )

Grant Emmel
emmel@psl.wisc.edu


-- 

------------------------------------------------------------------------
Grant Emmel,  Physical Sciences Laboratory University of Wisconsin
Internet:emmel@psl.wisc.edu.                              608-873-6651
Newsgroups: sci.math.num-analysis
From: rons@hardy.u.washington.edu (Ronald Schoenberg)
Subject: Re: Eigen problem
Organization: University of Washington, Seattle
Date: Thu, 8 Oct 1992 15:07:45 GMT

In article <1992Oct8.125936.56162@qut.edu.au> holmes@qut.edu.au writes:
>I have a large real symetric banded matrix (1000x1000) that I want
>to find the first 30 eigenvectors and eigenvalues for. This matrix
>is singular with the first 6 eigenvalues being 0.
>
>Does anyone know of some fast method that will allow me to
>specify a set number of eigenvalues to extract. I have seen the
>Inverse Power method but how do you find the inverse of a singular
>matrix? If anyone knows of books, papers or code that might help
>could you please post the information to me.
>
>Thanks in Advance
>
>---------------------------------------------------------------
>
>Peter Holmes
>Queensland University of Technology
>Australia
>
>EMAIL:  peterh@lime.eese.qut.edu.au
>---------------------------------------------------------------

The LAPACK functions SSBEVX (single precision) DSBEVX (double
precision) CHBEVX (Hermitian) compute eigenvalues for banded matrices
which may be selected by index (i.e., you may select the 7th through
20th eigenvalue) or by value (i.e., you may select eigenvalues greater
than some number and less than some number).  The eigenvectors are
also selected (or you may choose not to compute them at all).
   Let x be your desired data type, then send the following message to
netlib@research.att.com or to netlib@ornl.gov:

    send xbevx from lapack

Newsgroups: sci.math.num-analysis,comp.parallel
From: carson@cs.umd.edu (Mark Carson)
Subject: Info wanted on parallel matrix factorization updating
Followup-To: sci.math.num-analysis
Organization: U of Maryland, Dept. of Computer Science, Coll. Pk., MD 20742
Date: 10 Oct 92 19:36:05 GMT


I'm interested in any information or references anyone can provide
in the area of updating matrix factorizations on parallel machines.
The idea is given an existing factorization (such as LU or QR) for
a matrix A, to devise efficient parallel means of updating the
factorization after some small change in A, such as modifying,
adding or deleting a row or column.

Again, thanks for any information you can provide.

Mark Carson (carson@cs.umd.edu)
-- 
Mark Carson	carson@cs.umd.edu	301-240-7348
Department of Computer Science   University of Maryland, College Park -or-
IBM 182/3F42   800 N. Frederick Ave.   Gaithersburg MD 20879

Newsgroups: sci.math.num-analysis
From: joe@gauss.engga.uwo.ca (Joe LoVetri)
Subject: Re: EMLIB archive site(s) ?
Organization: Dept. of Electrical Engineering, UWO, London, Canada
Date: Thu, 8 Oct 1992 12:17:50 GMT
Keywords: electromagnetics, fdtd

In article <1992Oct5.150522.1402@greco-prog.fr>, bardo@ief-paris-sud.fr (Bardo Muller) writes:
|> 
|> 
|> in <1992Sep30.121326.16320@julian.uwo.ca>  Joe LoVetri writes
|> 
|> 
|> >There is an fdtd code in the EMLIB archive site
|> >
|> >	microwave.jpl.nasa.gov (IP adress 128.149.76.31)
|> >
|> >see README.DIR file
|> >
|> >Joe LoVetri
|> >
|> >e-mail: joe@gauss.engga.uwo.ca
|> 
|> 
|> I have no luck to connect to the above address (timed out..)
|> 
|> Are there any mirrors etc. known ?
|> 
|> Salut,
|> 
|> ___________________________________________________________________________
|> | Bardo MULLER                          | phone  : [33] [1] 69 41 78 50    |
|> | Institut d'Electronique Fondamentale  | fax    : [33] [1] 60 19 25 93    |
|> | Bat. 220 Universite Paris Sud         | e-mail : bardo@ief-paris-sud.fr  |
|> | 91405 ORSAY CEDEX FRANCE              |             THE NET WORKS !      |
|> |_______________________________________|__________________________________|

There must be some temporary problem with the emlib server.
When anyone is able to get thru or find out anymore please post a message.


Joe
From: magdi@uxh.cso.uiuc.edu (Magdi N Azer)
Subject: MINUIT software developed at CERN
Organization: University of Illinois at Urbana
Date: Thu, 8 Oct 1992 17:09:05 GMT

	Is anyone familiar with a package called MINUIT.  It was developed at
CERN starting in 1965 (I think), and the last reference I found on it was 1984.

	It is used to solve linear programming problems where you are trying
to fit your data to some function.  Is it public domain?  How can I get a copy
of this program

Thanks for your help
magdi@uxh.cso.uiuc.edu
From: bchen@wpi.WPI.EDU (Bi Chen)
Newsgroups: sci.math.num-analysis
Subject: Complete or incomplete polynormial basis for FEM
Date: 13 Oct 92 16:54:18 GMT
Distribution: inet
Organization: Worcester Polytechnic Institute, Worcester, MA 01609-2280
NNTP-Posting-Host: wpi.wpi.edu


Hi, there. I'm not sure my question is relavent to this group. Is
there a finite element forum on net? Anyway, my question goes like
this. I need C^1 continuity but may have to resort to use incomplete
polynormial basis. I know that if one use such an basis, one cannot
, in principle, describe any shape of functions to that order of
the polynormial. Usually, it should not be a problem since Finite
element itself is an approximation anyway. Does anyone know the
trade-off in real life about using an incomplete basis (in terms
of convergency etc.)?

Thanks in advance

Dr Bi Chen
Newsgroups: sci.math.num-analysis
From: dahlhaus@nariwork15.ethz.ch (Dirk Dahlhaus,ETF D111,2791,,,)
Subject: search for spectral estimators
Keywords: spectral estimator
Reply-To: dahlhaus@nariwork15.ethz.ch
Organization: Sun Microsystems, Inc.
Date: Wed, 14 Oct 1992 11:08:01 GMT

I search for a tool in mathematica, maple, matlab etc.
to do nonparametric spectral estimation from a sequence
of N data points. Is there anyone to help me?
Thanks Dirk

=========================================================
     Swiss Federal Institute of Technology, Zurich
             Communication Technology Lab
     Tel.: +41 1 256-2791      Fax: +41 1 262-0943
             email: dahlhaus@nari.ikt.ethz.ch
=========================================================
From: ian@ssc-vax.boeing.com (Ian R. Searle)
Newsgroups: sci.math.num-analysis
Subject: Looking for C version of minpack
Date: 12 Oct 92 17:08:27 GMT
Article-I.D.: ssc-bee.5622
Organization: Boeing Defense and Space Group, Seattle WA

The subject pretty much says it all. I am aware of f2c(1), and 
have already used it on the existing fortran minpack subroutines.
But, I am still interested to see if anyone has done the hand
translation, or even something original that does what minpack does.


-Ian Searle
 ian@hobbes.ds.boeing.com
Newsgroups: sci.math.num-analysis
From: ac@mentor.cc.purdue.edu (ac)
Subject: e-mail address of PATRAN vendor (PDA Engineering?) ??
Organization: Purdue University Computing Center
Distribution: usa
Date: Fri, 9 Oct 1992 02:46:22 GMT

Does anyone know the e-mail address of PATRAN vendor (PDA Eng.?) ?
I'm interested in the info about their manuals. Thanks!!

Alex Chou
EE, Purdue U.

Newsgroups: sci.math.num-analysis
From: ssmithap@cc.curtin.edu.au
Subject: Root Solver Program
Organization: Curtin University of Technology
Date: Mon, 12 Oct 1992 05:48:02 GMT


  Hi!

  Could anyone tell me a name of a program for an MSDOS based machine
  that can find the roots of an equation up to the nth order. (ideally
  up to 10th order or better).  Where abouts would I be able to ftp 
  such a program from.

  Could you please e-mail me your replies.

  Your help would be greatly appreciated

  Thanks

   Andrew
   ssmithap@cc.curtin.edu.au

Newsgroups: sci.math.num-analysis
From: strick@cedar.hao.ucar.edu (Douglas Strickland)
Subject: Re: FD Cauchy-Riemann vs. FD Laplace ?
Organization: High Alititude Observatory/NCAR, Boulder CO
Date: Wed, 14 Oct 1992 13:17:19 GMT


Hello:

   I am new to this group so this might be a FAQ (although I did read the 
FAQ articles).

   I need a compression utility which:
      --- is a subroutine.
      --- Ada or FORTRAN are preferred.
      --- accepts a decimal array (1-D or 2-D) and other pertinent inputs
          and returns an compressed decimal array. (I'd rather not deal
          with binaries).

   Any help is appreciated, please e-mail to me directly. Thanks in advance.

Mike Shen
shen@euler.cpi.com


Newsgroups: sci.math.num-analysis
From: CCMAHTAJ@mizzou1.missouri.edu (Hossein Tahani)
Subject: distance and positive definite matrices
Organization: University of Missouri
Date: Mon, 12 Oct 92 08:15:17 CDT

Hi :
Let x and m be points in n dimensional Euclidean sapce and A be a
positive definite matrix. Then, one can define the distance between
x and m, d(x,m) = (x-m) A (x-m)^t, where ^t denotes the transpose of
of the vector. I have two questions :
 
1. How can I generate the positive definie matrix A?
 
2. What is the (geometric) interpretation of distance between x and m
   when using different matrix A ?
 
Please e-mail your replies. Thanks for your time and effort.
 
Hossein Tahani
ccmahtaj@MIZZOU1.missouri.edu
Newsgroups: sci.math.num-analysis
From: takriti@engin.umich.edu (samer Takriti)
Subject: Minimum cost flow in a network
Date: Sun, 11 Oct 92 15:56:37 EDT
Organization: University of Michigan Engineering, Ann Arbor
Keywords: Network programming
From: wabe@ukc.ac.uk (W.A.B.Evans)
Newsgroups: sci.math.num-analysis
Subject: Re: numerical factorization of very high degree polynomial
Date: 7 Oct 92 18:34:49 GMT
Reply-To: wabe@ukc.ac.uk (W.A.B.Evans)
Organization: Computing Lab, University of Kent at Canterbury, UK.

In article <1992Oct6.094142.9281@vax.oxford.ac.uk> nagrwb@vax.oxford.ac.uk writes:
>In article <9227919.6924@mulga.cs.mu.OZ.AU>, yzhu@nairana.ee.mu.oz.au (Yan ZHU (yhua)) writes:
>> 
>>  
>>  I am trying to solve non-linear problem by LP method.
>>  And I am looking for an algorithm for the numerical
>>  factorization of very high degree (500th-800th) polynomials 
>>  with complex coefficients.
>> 
>>  ...stuff deleted 
>
>NAG Fortran Library routine C02AFF finds all the roots of a complex
>polynomial equation, usinmg a variant of Laguerre's method. Any degree
>can be specified.
>
	Another method that springs easily to mind is to find the roots
sequentially by the Newton-Raphson method within the synthetic division
algorithm. This of course converges very fast and on finding one root you
are automatically left with the coeffs. of the "deflated" polynomial and
of course, the method is perfectly suitable to polynomials with complex
coeffs. I have used this with considerable satisfaction on "moderately
large" polynomials - but certainly NOT of order 500-800. However I see no
reason why it should not work provided the calculations could be done in
"sufficiently high" precision (I doubt that COMPLEX*8 would be adequate!).

						W. Alan B. Evans
						[ wabe@ukc.ac.uk ]
Newsgroups: sci.math.num-analysis
From: engp2176@nusunix1.nus.sg (JEROME HANSABHAYA ELLEPOLA)
Subject: STAGGERED GRID TECH
Organization: National University of Singapore
X-Newsreader: TIN [version 1.1 PL6]
Date: Thu, 15 Oct 1992 08:24:44 GMT

I am solving a problem, in thermo fluids which requires to write the FD
equations in the Toroidal or cylindrical coordinate system.  Does any
one out there happen to have the source code or know of a publication
that has the staggered grid routine ( SIMPLE by PATANKAR & SPAULDING )
in the stated coordinate system.  Numerical Heat transfer and Fluid Flow
(PATANKAR ) has it only for the cart coordinates.  ( Excellent book
though )

I look forward to a reply, thanks in advance.

JEROME
ENGP2176@NUSVM.NUS.SG
From: ken@unixg.ubc.ca (Kenneth White)
Newsgroups: sci.math.num-analysis
Subject: Re: Need ref:  least-squares for complex variables
Date: 9 Oct 92 15:30:53 GMT
Distribution: inet
Organization: University of British Columbia, Vancouver, B.C., Canada
NNTP-Posting-Host: unixg.ubc.ca

read
Kenneth S. Miller, COMPLEX LINEAR LEAST SQUARES, SIAM Review Vol 15, No. 4
October 1973.
or also his book Complex Stochastic Processes
I am curious about your application and would like to see your results.
From: holmes@qut.edu.au
Newsgroups: sci.math.num-analysis
Subject: Eigen problem
Date: 8 Oct 92 12:59:36 EST
Organization: Queensland University of Technology

I have a large real symetric banded matrix (1000x1000) that I want
to find the first 30 eigenvectors and eigenvalues for. This matrix
is singular with the first 6 eigenvalues being 0.

Does anyone know of some fast method that will allow me to
specify a set number of eigenvalues to extract. I have seen the
Inverse Power method but how do you find the inverse of a singular
matrix? If anyone knows of books, papers or code that might help
could you please post the information to me.

Thanks in Advance

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

Peter Holmes
Queensland University of Technology
Australia

EMAIL:  peterh@lime.eese.qut.edu.au
---------------------------------------------------------------
From: toma@hpsad.sad.hp.com (Tom Anderson)
Newsgroups: sci.math.num-analysis
Subject: Re: Help:  persp() function in S
Date: 12 Oct 92 22:51:41 GMT
Organization: HP Signal Analysis Division - Rohnert Park, CA

> I am using Splus to plot some 3D graphs, and I have
> having trouble using the eye parameter persp() uses 
> to specify the viewpoint that I want.  All I seem to
> be able to get are viewpoints from either corner of
> my plot.

Maybe this example will help:
persp(log(PinI+1e-7),log(freq),PinPhase[,],eye=c(-50,8,300))

You might try normalizing your data.

Tom Anderson    toma@hpsad.sad.hp.com    "It's only hardware"
Newsgroups: sci.math.num-analysis
From: takriti@engin.umich.edu (samer Takriti)
Subject: Re: Software for the Assignment Problem
Date: Wed, 14 Oct 92 09:56:16 EDT
Organization: University of Michigan Engineering, Ann Arbor
Keywords: software, assignment, scheduling

In article <1992Oct14.043850.4095@pslu1.psl.wisc.edu> emmel@pslu1.psl.wisc.edu (Grant Emmel) writes:
>I'm looking for available software (public domain or not) for a
>non-commercial/non-educational application (I'm helping a friend)
>that will solve the assignment problem.  That is the general idea.
>
>Any help, from theory to software would be helpful.  Post if it is
>interesting enough, email in any case.
>Grant Emmel

A simple example of the assignment problem would be: There are n jobs 
and n different candidates for these jobs. We want to assign one 
and only one candidate to each job. There is a cost square matrix that
specifies the cost that has to be paid for candidate i to perform job
j, i=1,..,n, j=1,.., n. The objective is to minimize the cost.
The method which is used usually to solve the assignment problem is 
the "Hungarian method". It is a dual algorithm. The complexity is 
O(n^3). For a full description of the algorithm you can refer to 
"Linear and combinatorial programming" by K.G. Murty. It is in 
Chapter 12: Networ Algorithms. A more sophisticated approach is 
in "Network Programming" by the same author (This book was published
a few months ago so it may be hard to find it) from Prentice Hall.
The code should not be hard to write.
-Samer
Newsgroups: sci.math.num-analysis
From: takriti@engin.umich.edu (samer Takriti)
Subject: Assignment Problem question
Date: Wed, 14 Oct 92 10:04:03 EDT
Organization: University of Michigan Engineering, Ann Arbor
From: wabe@ukc.ac.uk (W.A.B.Evans)
Newsgroups: sci.math.num-analysis
Subject: Re: Least Squares Fitting or Cubic Splines?
Date: 16 Oct 92 21:49:18 GMT
Reply-To: wabe@ukc.ac.uk (W.A.B.Evans)
Distribution: sci.math.num-analysis
Organization: Computing Lab, University of Kent at Canterbury, UK.

In article <LSTERN.92Oct15162328@orville.nas.nasa.gov> lstern@orville.nas.nasa.gov (Louis G. Stern) writes:
>	Stuff Deleted
>
> Has anyone
>come across some combination of splines + least-squared fitting before?
>
	In developing a plotter algorithm for my PLOT program, I implemented
a piecewise least squares fit of cubic polynomials to the "local" data. The
usual least squares algorithm was subject to 2 constraints i.e. the cubic
had to be continuous in value and gradient with the previous cubic - as
indeed are cubic splines. These constraints are coded by means of Lagrange
multipliers - so that to obtain the next cubic, I had to invert a 6x6 matrix
(instead of the usual 4x4). The first 4 elements of the 6-vector are the
cubic coeffs one desires and the last two are the Lagrange multipliers that
are of no further use. To start it off, I do a normal unconstrained cubic fit
to the leftmost local data - so that this technique is not as nicely symmetric
as a normal cubic spline. I also used a "Lorentzian" weighting function to
weight the "local" points the width of which I could choose. For narrow widths
the piecewise polynomial fit curve makes valiant efforts to pass very close
to every point (like cubic splines) but for larger widths it produces a
smoother curve that ignores high frequency (noise?) in the data.

	Although this technique is fairly "obvious" I have never seen any
textbook refer to it - but I dare say someone out there may know better.

				Regards,	W. Alan B. Evans
						[ wabe@ukc.ac.uk ]
Newsgroups: sci.math.num-analysis
From: schoen@ghost.dsi.unimi.it
Subject: Re: Software for the Assignment Problem
Keywords: software, assignment, scheduling
Organization: Computer Science Dep. - Milan University
Date: Fri, 16 Oct 1992 08:23:25 GMT

takriti@engin.umich.edu (samer Takriti) writes:

>In article <1992Oct14.043850.4095@pslu1.psl.wisc.edu> emmel@pslu1.psl.wisc.edu (Grant Emmel) writes:
>>I'm looking for available software (public domain or not) for a
>>non-commercial/non-educational application (I'm helping a friend)
>>that will solve the assignment problem.  That is the general idea.
>>
>>Any help, from theory to software would be helpful.  Post if it is
>>interesting enough, email in any case.
>>Grant Emmel

You can also have a look to the recent book
 J.R. Evans, E. Minieka, "Optimization Algorithms for Networks and
 Graphs", 2nd edition, Marcel Dekker, 1992 (US$ 59.75)

which comes with a diskette with software (including assignment).
This just n case you don't want to code yourself (which is not too
difficult a task, following any Operations Research textbook)

-- 
+---------------------------------------------------------------------------+
| Fabio Schoen                                  e-mail:                     |
| Dipartimento di Scienze della Informazione    schoen@ghost.dsi.unimi.it   |
| via Comelico 39/41 - room    S235             schoen@imiucca.csi.unimi.it |
From: alan@elroy.jpl.nasa.gov (Alan S. Mazer)
Newsgroups: sci.math.num-analysis
Subject: Re: [sci.math.num-analysis] EMLIB site
Date: 14 Oct 92 19:25:30 GMT
Article-I.D.: elroy.1992Oct14.192530.28175
Organization: Image Analysis Systems Group, JPL
Cc: mathew alan meemong richard stevo

In article <1bh214INNs40@agate.berkeley.edu> bardo@ief-paris-sud.fr writes:
>A couple of months ago EMLIB, a ftp-able site for microwave-specific
>codes at
>
>microwave.jpl.nasa.gov (IP address 128.149.76.31)
>
>was announced. Below is t text I received. The site times out since.
>
>Any information on status/alternative access to EMLIB would be
>greatly acknowledged.

Everyone should know that recent changes in Laboratory policy forbid free
distribution of software written at JPL unless distribution is to NASA or to
someone under contract.  New lab policy is that if you want something written
here, you're going to pay for it.  If anyone wants further details call me
(818-354-0003) or the JPL Technology Utilization Office (818-354-2241).
-- 
 
-- Alan                        # Mountain Dew and doughnuts...
   ..!ames!elroy!alan          # because breakfast is the most important meal
   alan@elroy.jpl.nasa.gov     # of the day.