HDTenEightyP/NetNews huggingface dataset:
From: takriti@engin.umich.edu (samer Takriti)
Subject: Re: Help required to solve a system of non-linear Eq.,s
Date: Wed, 18 Nov 92 12:48:52 EST
Organization: University of Michigan Engineering, Ann Arbor
Keywords: Newton - Raphson method(currently used)

In article <1992Nov18.024417.19684@oucsace.cs.ohiou.edu> ravi@bobcat.ent.ohiou.edu (Pattalachinti) writes:
>Are there any thumb-rules for the successful execution of
>Newton-Raphson method to work successfully on a non-linear
>system of equations.
>
>Any suggestion is welcome,
>
>Thanking in advance,
>
>Ravi 

I think that what you are looking for is "Kantarovitch theorem". It states
that if the function is continuously differentiable, the norm of the e
inverse of the Jacobian is less than beta, and the norm of the (J^{-1}F(x))
is less than eta (J is the jacobian) then
if alpha * beta * eta <= .5 then the sequence converges.
F is lipschitz continuous with constant alpha.
-Samer
From: wright@shark.mcs.anl.gov (Stephen Wright)
Newsgroups: sci.math.num-analysis
Subject: Re: Text material on Numerical ODE wanted
Date: 16 Nov 92 18:48:59 GMT
Reply-To: wright@shark.mcs.anl.gov (Stephen Wright)
Organization: Argonne National Laboratory, Chicago, Illinois

Zhu Jian Ping writes:

> I will teach a graduate course next semester on 
> "Numerical ODE: Boundary value problems".

> I would appreciate any suggestion about a good
> textbook.

The book by Ascher, Mattheij, and Russell:

"Numerical Solution of Boundary Value Problems for Ordinary
Differential Equations"
Prentice-Hall, Englewood Cliffs, NJ, 1988,

is the definitive text. It may be too high-level for
your class, but you should check it out.

Steve Wright    wright@mcs.anl.gov
Newsgroups: sci.math.num-analysis
From: shen@cae.wisc.edu (Tan Shen Hsiao)
Subject: Request: C code for solving complex linear equations.
Organization: Microwave Research Group, U of Wisconsin-Madison
Distribution: usa
Date: 23 Nov 92 12:09:03 CST
Summary: Would like code for solving lineqns with complex coeff.

  Could someone point me to some code for solving linear equations
  with complex coefficients ?

  I realize that, with c, the code depends on how complex numbers
  are defined. I am currently using the format from Numerical
  Recipes in C.


  Shen Hsiao
Newsgroups: sci.math.num-analysis
Subject: Reaction-Diffusion Equations
From: frederik@pollux.acs.uci.edu (M. Donald Frederick)
Date: 20 Nov 92 02:12:05 GMT
Reply-To: frederik@pollux.acs.uci.edu (M. Donald Frederick)
Organization: University of California, Irvine


Does anyone have any comments on good references on numerical methods for 
solving Reaction-Diffusion equations in 2 space dimensions. References with
source code in C/FORTRAN would be most appreciated by one of our researchers.
Thank you.

------------------------------------------------------------------------
        Donald Frederick       |      Office of Academic Computing
        frederik@uci.edu       |      University of California, Irvine
        frederik@UCI.BITNET    |      Irvine, CA  92717
        (714) 725-3200         |      FAX (714) 725-2069
-----------------------------------------------------------------------
From: ravi@bobcat.ent.ohiou.edu (Pattalachinti)
Newsgroups: sci.math.num-analysis
Subject: Re: polynomial root finding
Date: 18 Nov 92 02:01:17 GMT
Organization: College of Engg. & Tech., Ohio University, Athens, Ohio

In article <6757@dove.nist.gov> fred@poly2.nist.gov (Frederick R. Phelan Jr.) writes:
>In article <1992Nov5.175007.3406@news2.cis.umn.edu>, jblee@giga.cs.umn.edu (Jaebum Lee) writes:
>|> Hi,
>|> I am looking for a subroutine to find all the roots(including complex) of
>|> a polynomial with real coefficients. Does anybody out there have such a
>|> subroutine? Any pointers wiil be appreciated.
>|> 
>|> Jaebum Lee
>|> jblee@tera.cs.umn.edu
>|>   
>
>Look for the algorithm zroots in NUMERICAL RECIPES by Press, Flannery et al.
>Works very nicely.




Refer to: Solving polynomial systems
	  using continuation
	  for Engineering and
	  Scientific problems

		by Alexander Morgan

ravi
From: kohut1@urz.unibas.ch
Newsgroups: sci.math.num-analysis
Subject: Solutions of Lane-Emden-Diff. Eq.
Date: 23 Nov 92 13:21:41 MET
Organization: University of Basel, Switzerland

I desperatly lookink for any solution off the Lane-Emden differantial equation.
My problem is, that I even don't found any lectures about this diff.eq. 

So, any help is warmly appreciated !

Thanks in advance...

-Peter-

P.S. By "solution" I mean numerical OR analytical solutions, of course
Newsgroups: sci.math.num-analysis
From: patton@phy.uab.edu (David Patton)
Subject: Re: netlib (another question)
Followup-To: patton@phy.uab.edu
Summary: Try this
Reply-To: patton@phy.uab.edu
Organization: University of Alabama at Birmingham
Date: Thu, 19 Nov 1992 17:52:47 GMT

Did you send the following:

    To:       netlib@ornl.gov
    Subject:  send index from lp



Then leave the body of your mail message blank.





David Clay Patton                                  patton@phy.uab.edu
Physics Department
University of Alabama at Birmingham
Birmingham, Al 35294

Newsgroups: sci.math.num-analysis
From: trammell@engin.umich.edu (James Trammell)
Subject: Numerical Recipes in C Source Code
Date: Tue, 17 Nov 92 03:56:23 EST
Organization: Univ of Michigan
Followup-To: sender
Originator: trammell@antithesis.engin.umich.edu


Could someone direct me to an FTP site which has the source from the book
Numerical Recipes in C?

Please reply via email.

Thank you,

-James Trammell
From: ravi@bobcat.ent.ohiou.edu (Pattalachinti)
Newsgroups: sci.math.num-analysis
Subject: Help required to solve a system of non-linear Eq.,s
Keywords: Newton - Raphson method(currently used)
Date: 18 Nov 92 02:44:17 GMT
Organization: College of Engg. & Tech., Ohio University, Athens, Ohio
Originator: ravi@bobcat.ent.ohiou.edu

Are there any thumb-rules for the successful execution of
Newton-Raphson method to work successfully on a non-linear
system of equations.

Any suggestion is welcome,

Thanking in advance,

Ravi 
Newsgroups: sci.math.num-analysis
From: bosch@rz.uni-karlsruhe.de (Gerhard Bosch)
Subject: Determining the distance from the boundaries in a 2-dim. domain 
Organization: University of Karlsruhe, Germany
Date: Sat, 21 Nov 1992 07:00:21 GMT

Hi guys,

I have a probably very simple quesiton for math guys. I haven't worked out
this problem yet, because I couldn't find a starting point.

I interested in the field of CFD with curvi-linear grid. So I have a 
grid, which is locally more or less orthogonal and the boundaries are
fitted to any arbitrary body shape. It should be mentioned that I'm 
dealing with four-sided cells in these grids.

The problem is to detect the distance of all the center points from the
2 boundaries of the domain. This distance should be the normal distance,
to have the smallest path.




A simple  example:

                                                  2
***********************             **************************
*                     *             *                        * 
*                     *             *                        *
*                      *         1 *                         *
*                       *         *                          *
*                        *       *                           *
*                         **   **           X                *3
*                           ***                              *
*                                                            *
*                                                            *
*                                                            *
*                                                            *
**************************************************************
                                             4                


X is an arbitrary point in the domain, with a know location.
That point is influence in this special case by 4 wall marked
marked with the numbers 1,2,3 and 4. I need now the points on
all these 4 surfaces and their distance to the point given by
X.

This is already a special case. Did anybody consider something
similar and more general.



Sincerely, Gerhard Bosch

Newsgroups: sci.math.num-analysis
From: engp2116@nuscc.nus.sg (Rainer Bachl)
Subject: Re: Probl. Lin.-Algeb./Optim.
Organization: National University of Singapore
X-Newsreader: Tin 1.1 PL4
Date: Sat, 21 Nov 1992 10:28:47 GMT

engp2116@nuscc.nus.sg (Rainer Bachl) writes:
: 
: After some efforts and pages of manipulations of an engineering problem
: in signal processing I have got a nice mathematical formulation for it:
: 
: Find a real vector d constrained to a convex subspace subject to
: 
:              min | A * P |
:                           2
: 
: where P is a real orthogonal projector on the subspace          
: of span{ diag(d) * H }, i.e.
: 
:                                  T        2  -1    T
:              P = diag(d) * H * {H *diag(d) H}   * H  * diag(d)
: 
: and A,H are both known real matrices. However, H is m*n with m>n and
: satisfies
:               T
:              H  * H = identity(n).
: 
: I think there exists no closed form solution and therefore I am looking
: for an optimization procedure locally (if not globally) minimizing the
: above cost function. Iterative schemes, similar to that of Steiglitz/
: McBride or the IQML algorithm, whereby d(i+1) is calculated by using
: a fixed d(i) in the matrix inverse, do not converge to a local minimum
: close to the initial value of d. Methods involving first and second
: order derivatives might be computationally too expensive for this
: application.
: 
: I am not an expert in this area and any suggestions are welcome.

Sorry, forgot to mention an arbitrary norm constraint for the desired
solution, e.g. | d |  = 1, to avoid the trivial case d = 0.
                    2
-Rainer Bachl
 National University of Singapore
From: breiner@zardoz.chem.appstate.edu (Steven Jay Breiner)
Newsgroups: sci.math.num-analysis
Subject: Request for info - SVD in Numerical Recipes
Keywords: svd, singular value decomposition, Numerical Recipes
Date: 19 Nov 92 13:07:29 GMT
Organization: Appalachian State University
NNTP-Posting-Host: zardoz.appstate.edu

To Users of the Numerical Recipes SVD routines:

I remembered reading this group a while back about some problems with the
singular value decomposition function in the Numerical Recipes (in C?) book
by Press, Flannery, et. al. I have been unable to locate an archive of this
newsgroup (sci.math.num-analysis) and I would appreciate any pointers to
such a beast.  Alternatively, if you perchance saved the articles describing
the problems and/or fixes for the SVD (and associated routines), I would
appreciate your emailing them to me.

Since this topic has been discussed before, I think email would be
appropriate to limit the bandwidth used.

				Thanks in advance!
				Steve Breiner
*****************************************************************************
Steve Breiner			Phone: (704) 262-2964	FAX: (704) 262-2127
Appalachian State University	Internet email: breiner@appstate.edu
Department of Chemistry		Boone, NC  28608
-- 
*****************************************************************************
Steve Breiner			Phone: (704) 262-2964	FAX: (704) 262-2127
Appalachian State University	Internet email: breiner@appstate.edu
Department of Chemistry		Boone, NC  28608
Newsgroups: sci.math.num-analysis
Subject: Curved boundary diff. equ.s for PD equations
From: chergr@lure.latrobe.edu.au
Date: Fri, 20 Nov 1992 02:51:29 GMT
Organization: VAX Cluster, Computer Centre, La Trobe University 

LaPlace's equation can be solved on a rectangular region using a 5 point
difference formula or a 9 point difference formula at every point. 

However if there is an object with curved boundaries inside the rectangular
region (dirichlet boundary conditions) the difference formula has to be
modified at points adjacent to the boundaries. 

There are two approaches:
1. use a modified difference equation where the 'template' has unequal
distances up/down/left/right so that some of the 5 points are placed
on the actual curved boundary. I have this formula.
2. use a linear extrapolation between the actual boundary and points not next
to the boundary. This extrapolation can be along the x-direction, y-direction
or a combination of both. I can do this. It works as long as the extrapolated
points are not subject to over-relaxation. In fact for my problem, a set of
mulipoles, it appears to work better than 1. above, which is recommended as
being more accurate.

The question is: are there equivalent formulas for the 9-point case. I have been
looking for these for some time without much luck.

P.S. Another approach I think might be promising is harmonic extrapolation.
Thanks in advance Richard Rothwell
From: xz1@Ra.MsState.Edu (Xinglai Zhuang)
Newsgroups: sci.math.num-analysis
Subject: Text material on Numerical ODE wanted
Date: 16 Nov 92 16:47:54 GMT
Article-I.D.: ra.1992Nov16.164754.12206
Distribution: usa
Organization: Mississippi State University

I will teach a graduate course next semester on 
"Numerical ODE: Boundary value problems".

I would appreciate any suggestion about a good
textbook.

The majority of the students will be from engineering
departments.

Please send your suggestions to jzhu@erc.msstate.edu

Zhu Jian Ping
Professor of Mathematics
Mississippi State University
Newsgroups: sci.math.num-analysis
From: engp2116@nuscc.nus.sg (Rainer Walter Bachl (Mr))
Subject: Problem in Lin.Algebra/Optimization
Organization: National University of Singapore
X-Newsreader: Tin 1.1 PL4
Date: Thu, 19 Nov 1992 10:53:49 GMT


Newsgroups: sci.math.num-analysis
From: trammell@engin.umich.edu (James Trammell)
Subject: Numerical Recipes Example Book (C) Source Code
Date: Tue, 17 Nov 92 04:30:28 EST
Organization: The University of Michigan
Originator: trammell@antithesis.engin.umich.edu


Also, could someone direct me to an FTP site which has the source from
Numerical Recipes Example Book (C)?

Please reply via email.

Thank you,

-James Trammell
Newsgroups: sci.math.num-analysis
From: takriti@engin.umich.edu (samer Takriti)
Subject: Re: question: how to show that a set of linear inequalities is consistent?
Date: Wed, 18 Nov 92 12:57:21 EST
Organization: University of Michigan Engineering, Ann Arbor

In article <batra.722077145@beagle> batra@boulder.Colorado.EDU (sajeev batra) writes:
>hi,
>
>I have a large set of  linear inequalities (with about a 20 unknowns)
>and I am about to use linear programming to solve for them.
>Is there an algorithm that will tell me that my set is consistent or
>inconsistent?  Also, I need to know specifically which inequalities
>contradict each other.  How do I go about doing this?  Any suggestions?
>Please post or email.
>
>Thank YoO,
>sajeev
>batra@cs.colorado.edu
>

Phase I of the simplex method tells you which inequalities are inconsistent
with the system. Assume that you have a system of the form:
A x = b, b >=0
  x >= 0
(Your system can be transformed into this format easily)
Now add artificial variables to the previous system:
A x + y = b
  x,  y >= 0
Note that y=b >=0 is a solution to the previous system. This is your starting
solution. Minimize y1+y2+... If the solution is y1=y2=...=0 then the previous
system (Ax=b, x>=0) has a solution. Otherwise, any constraint with yi<>0 is
incosistent with the system.
-Samer
From: splinter@kuhub.cc.ukans.edu
Newsgroups: sci.math.num-analysis
Subject: Multi-Grid Approaches to Gas Dynamics
Date: 23 Nov 92 09:05:43 CST
Organization: University of Kansas Academic Computing Services

Does anyone out there know of any good references to mulit-grid approaches
to solving gas dynamics problems in three dimensions. Further, I am not
interested in steady-state solutions, the algorithm must be capable of 
allowing the system to evolve in time. Thanks in advance for any info. If 
possible please send e-mail to me directly below. 

Randall Splinter
Dept of Physics & Astronomy
University of Kansas
splinter@kusmos.phsx.ukans.edu
Newsgroups: sci.math.num-analysis,comp.lang.fortran,sci.math
From: u235@rex.chb.uokhsc.edu (Yung-Jin Lee)
Subject: Repost: The algorithms for model discrimination needed
Originator: usenet@essex.ecn.uoknor.edu
Date: Sun, 15 Nov 1992 19:36:17 GMT
Organization: University of Oklahoma Health Sciences Center, OKC
Keywords: modeling, model discrimination, pharmacokinetics
Followup-To: sci.math.num-analysis,comp.lang.fortran,sci.math

	I'm a graduate student of the College of Pharmacy, The
Univ. of Oklahoma.  I have several drug-kinetic models defined
with both diff eqns and explicit eqns, which are needed to be
discriminated.  Is there any algorithms (in Fortran is preferred)
that I can use for model discrimination?

	Apologies for this reposting.

Yung-jin
From: peco1805@altair.selu.edu
Newsgroups: sci.math.num-analysis
Subject: Looking for FAQ
Date: 16 Nov 92 11:29:43 -0600
Distribution: world
Organization: Southeastern Louisiana University

Hi 
I am a freshman and am looking for FAQ of this newsgroup. The main question
that I want to know is about netlib and I believe this is a FAQ. Then, can
anyone send me FAQ copy.
Thanks in advance.
Jian Liu
Newsgroups: sci.math.num-analysis
From: batra@boulder.Colorado.EDU (sajeev batra)
Subject: Re: question: how to show that a set of linear inequalities is consistent?
Organization: University of Colorado, Boulder
Date: 20 Nov 92 07:30:46 GMT

I'd like to thank everyone who responded to my questions.  Thank you.
A number of people asked me for references and I did receive a couple.
I have not read thru them, but here are the two that I received :

1) 

"Fourier - Motzkin Elimination and Dual" , by George Dantzig and 
Curtis Eaves, Journal of Combinatorial Theory (A) 14, 288 -297 (1973). 

2)

"Locating Minimal Infeasible Constraint Sets in Linear Programs", 
by John Chinneck and Erik Dranieks, Spring 1991 ORSA Journal on 
Computing



Sajeev Batra
univ of colorado @ boulder
From: al.sorhaindo@execnet.com (al sorhaindo)
Newsgroups: sci.math.num-analysis
Subject: num integration ques
Date: 17 Nov 92 13:00:05 GMT
Reply-To: "al sorhaindo" <al.sorhaindo@execnet.com>
Distribution: sci
Organization: Executive Networks Information

Is Numerical integration primarily utilized to:


a) Allow computers to rapidly perform a menial tasks for humans?

or

b) Calculate integrals that can not easily be done otherwise?

or

c) Both


If b), or c)  could someone please email some applied math functions
that are unpractical to integrate without using numerical methods?


                             Thanks in advance,

                              Al (al.sorhaindo@execnet.com)
---
 ~ DeLuxe} 1.21 #11688 ~ al.sorhaindo@execnet.com
--
Executive Network Information System  (914) 667-4567
International ILink Host
From: engp2116@nuscc.nus.sg (Rainer Walter Bachl (Mr))
Subject: Problem in Lin.Algebra/Optimization
Organization: National University of Singapore
X-Newsreader: Tin 1.1 PL4
Date: Thu, 19 Nov 1992 10:16:27 GMT


Newsgroups: sci.math.num-analysis
From: rowan@rigel.epm.ornl.gov (Tom Rowan)
Subject: Re: netlib
Keywords: X interface
Organization: Oak Ridge National Laboratory
Date: Mon, 16 Nov 1992 19:55:43 GMT

In article <1992Nov16.152505.15014@cis.uab.edu>, patton@phy.uab.edu (David Patton) writes:
|> 
|> Here is a nice tool.  I find it extremely helpful.
|> 
|> # 
|> # 
|> #         xnetlib 3.0 -- an X interface to netlib
|> # 
|> #         Xnetlib is a new version of netlib recently developed at the
|> #         University of Tennessee and Oak Ridge National Laboratory.
|> #         Unlike netlib, which uses electronic mail to process requests
|> #         for mathematical software, xnetlib uses an X Window graphical
|> #         user interface and a socket-based connection between the user's
|> #         machine and the xnetlib server machine to process software
|> #         requests.  Xnetlib is available to anyone who has access to the
|> #         TCP/IP Internet.
|> 
|> 
|> 
|> Actually, I think the latest version is 3.2

	Version 3.2 hasn't been officially released yet.  NETLIB still has
	version 3.0.

|> 
|> To get it send email 
|> 
|> 
|> To:       netlib@ornl.gov
|> Subject:  send xnetlib

	That should be
	   Subject: send xnetlib.shar from xnetlib

|> 
|> 
|> 
|> And leave the body blank.
|> 
|> 
|> David Clay Patton                                  patton@phy.uab.edu
|> Physics Department
|> University of Alabama at Birmingham
|> Birmingham, Al 35294
|> 

-- 
Tom Rowan                                         rowan@msr.epm.ornl.gov
Oak Ridge National Laboratory / Math Sciences Section     (615) 574-3131
P.O. Box 2008, Bldg. 6012 / Oak Ridge, TN 37831-6367  Fax:(615) 574-0680
From: gross@maxwell.ucsc.edu (Mike Gross)
Newsgroups: sci.math.num-analysis
Subject: Re: calling Fortran libraries with C
Date: 23 Nov 1992 04:25:54 GMT
Organization: University of California, Santa Cruz
Distribution: ba
NNTP-Posting-Host: maxwell.ucsc.edu
Keywords: Fortran, C

In <1ep9qjINNsni@agate.berkeley.edu> actize@garnet.berkeley.edu () writes:

>I program in C, and most of our mathematical libraries are in Fortran 77.
>Our online documentation describes a few things, such as 
>1.	Fortran calls by address
>2.	The order of array storage is different.

>Does anybody have experience with this, and advice ?

>David
>actize@garnet.berkeley.edu

If you're programming on a Sun, the SunOS fortran manual has a whole chapter
on this. IBM's RS-6000 has a similar document, though it isn't as detailed.

A few more differences (assuming you're on a Unix system):

All fortran routines are converted to lowercase and have an underscore appended
to the end of the function name.

Strings are passed in an odd manner--there is an extra argument at the *end*
of the argument list for each string passed. This is a long (*not* a long *)
and it holds the length of the string in bytes.

Subroutines return int *'s. Functions return the corresponding type in C (passed
by reference, of course).

You must link in libF77.a (or libV77.a if you need VMS compatibility).

int * <--> INTEGER or INTEGER*4
long * <--> INTEGER*8
char * <--> CHARACTER or INTEGER*1 or CHARACTER*n or LOGICAL
double * <--> DOUBLE PRECISION or REAL*8
float * <--> REAL or REAL*4

Complex numbers correspond to a structure of two of the appropriate floating
point type.

If you're programming a VMS system, all this is BS.

Good luck.

Mike Gross
Physics Board
Univ of California                 GO SLUGS!!!!!
Santa Cruz, CA 95064


Newsgroups: sci.math.num-analysis
From: engp2116@nuscc.nus.sg (Rainer Bachl)
Subject: Probl. Lin.-Algeb./Optim.
Organization: National University of Singapore
X-Newsreader: Tin 1.1 PL4
Date: Fri, 20 Nov 1992 03:51:17 GMT


After some efforts and pages of manipulations of an engineering problem
in signal processing I have got a nice mathematical formulation for it:

Find a real vector d constrained to a convex subspace subject to

             min | A * P |
                          2

where P is a real orthogonal projector on the subspace          
of span{ diag(d) * H }, i.e.

                                 T        2  -1    T
             P = diag(d) * H * {H *diag(d) H}   * H  * diag(d)

and A,H are both known real matrices. However, H is m*n with m>n and
satisfies
              T
             H  * H = identity(n).

I think there exists no closed form solution and therefore I am looking
for an optimization procedure locally (if not globally) minimizing the
above cost function. Iterative schemes, similar to that of Steiglitz/
McBride or the IQML algorithm, whereby d(i+1) is calculated by using
a fixed d(i) in the matrix inverse, do not converge to a local minimum
close to the initial value of d. Methods involving first and second
order derivatives might be computationally too expensive for this
application.

I am not an expert in this area and any suggestions are welcome.
Newsgroups: sci.math.num-analysis