From owner-reliable_computing [at] interval [dot] usl.edu Mon Mar 1 11:40:52 1999 Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id LAA06720 for reliable_computing-outgoing; Mon, 1 Mar 1999 11:40:52 -0600 (CST) Received: from yonge.cs.toronto.edu (yonge.cs.toronto.edu [128.100.1.8]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id LAA06715 for ; Mon, 1 Mar 1999 11:40:10 -0600 (CST) Received: from jane.cs.toronto.edu ([128.100.2.31]) by yonge.cs.toronto.edu with SMTP id <86538-175>; Mon, 1 Mar 1999 12:39:48 -0500 Received: from gardiner.cs.toronto.edu by jane.cs.toronto.edu id <45648-16386>; Mon, 1 Mar 1999 12:39:35 -0500 From: Ned Nedialkov To: reliable_computing [at] interval [dot] usl.edu Subject: bounds for a polynomial Message-Id: <99Mar1.123935edt.45648-16386 [at] jane [dot] cs.toronto.edu> Date: Mon, 1 Mar 1999 12:39:27 -0500 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Hi, I am looking for a piece of software that can produce tight bounds for the range of the polynomial p(t) = a_0 + a_1t + ... + a_kt^k for t \in [0, h]. That is, I need a function that has input parameters a_0, a_1, ... a_k, and h and returns a tight interval that contains the range of p(t) over [0,h]. Any help is greatly appreciated. Regards, Ned From owner-reliable_computing [at] interval [dot] usl.edu Mon Mar 1 13:37:24 1999 Received: (from daemon@localhost) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id NAA07102 for reliable_computing-outgoing; Mon, 1 Mar 1999 13:37:24 -0600 (CST) Received: from staff1.cso.uiuc.edu (root [at] staff1 [dot] cso.uiuc.edu [128.174.5.59]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id NAA07097 for ; Mon, 1 Mar 1999 13:37:14 -0600 (CST) Received: from pontios (pontios.scs.uiuc.edu [130.126.227.246]) by staff1.cso.uiuc.edu (8.8.8/8.8.8) with SMTP id NAA29860; Mon, 1 Mar 1999 13:36:35 -0600 (CST) Message-Id: <4.1.19990301133044.01647900 [at] ux1 [dot] cso.uiuc.edu> X-Sender: nikos [at] ux1 [dot] cso.uiuc.edu X-Mailer: QUALCOMM Windows Eudora Pro Version 4.1 Date: Mon, 01 Mar 1999 13:38:25 -0800 To: Ned Nedialkov , reliable_computing [at] interval [dot] usl.edu From: Nick Sahinidis Subject: Re: bounds for a polynomial In-Reply-To: <99Mar1.123935edt.45648-16386 [at] jane [dot] cs.toronto.edu> Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk The BARON code provides a routine for finding the global minimum of a univariate polynomial (no additional software is required)--switch the coefficient signs to get the upper bound. See: http://archimedes.scs.uiuc.edu/baron.html At 12:39 PM 3/1/99 -0500, Ned Nedialkov wrote: > > Hi, > > I am looking for a piece of software that can produce tight bounds >for the range of the polynomial > > p(t) = a_0 + a_1t + ... + a_kt^k > >for t \in [0, h]. > >That is, I need a function that has input parameters > a_0, a_1, ... a_k, and h >and returns a tight interval that contains the range of p(t) over [0,h]. > >Any help is greatly appreciated. > >Regards, > Ned From owner-reliable_computing [at] interval [dot] usl.edu Mon Mar 1 14:41:16 1999 Received: (from daemon@localhost) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id OAA07448 for reliable_computing-outgoing; Mon, 1 Mar 1999 14:41:16 -0600 (CST) Received: from d22.ucs.usl.edu (root [at] d22 [dot] ucs.usl.edu [130.70.113.22]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id OAA07443 for ; Mon, 1 Mar 1999 14:41:14 -0600 (CST) Received: from d22.ucs.usl.edu (rbk5287 [at] d22 [dot] ucs.usl.edu [130.70.113.22]) by d22.ucs.usl.edu (8.9.1/8.9.1/ucs-client_1.3) with SMTP id OAA14973 for ; Mon, 1 Mar 1999 14:41:13 -0600 (CST) Message-Id: <199903012041.OAA14973 [at] d22 [dot] ucs.usl.edu> Date: Mon, 1 Mar 1999 14:41:13 -0600 (CST) From: Kearfott Ralph B Reply-To: Kearfott Ralph B Subject: Re: bounds for a polynomial To: reliable_computing [at] interval [dot] usl.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: SD2AHIvk6wgoek5GAvB/0w== X-Mailer: dtmail 1.2.1 CDE Version 1.2.1 SunOS 5.6 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk And then rigorous bounds could be produced from the output of Baron via epsilon-inflation and a verification step, provided it is certain that Baron gives a point near the global minimum (as opposed to a local minimizer). I'm inclined to believe it can, given that the function is a polynomial with the coefficients known to Baron. Certainly, for polynomials of degree 4 or less :-) Alternately, a general interval branch and bound system, such as GlobSol, may be used to rigorously find the minima. But that might be more computation than you desire, if this represents a small subproblem in a larger system. Best regards, Baker > From: Nick Sahinidis > Subject: Re: bounds for a polynomial > Mime-Version: 1.0 > > The BARON code provides a routine for finding the global minimum of a > univariate polynomial (no additional software is required)--switch the > coefficient signs to get the upper bound. See: > > http://archimedes.scs.uiuc.edu/baron.html > > At 12:39 PM 3/1/99 -0500, Ned Nedialkov wrote: > > > > Hi, > > > > I am looking for a piece of software that can produce tight bounds > >for the range of the polynomial > > > > p(t) = a_0 + a_1t + ... + a_kt^k > > > >for t \in [0, h]. > > > >That is, I need a function that has input parameters > > a_0, a_1, ... a_k, and h > >and returns a tight interval that contains the range of p(t) over [0,h]. > > > >Any help is greatly appreciated. > > > >Regards, > > Ned R. Baker Kearfott, rbk [at] usl [dot] edu (318) 231-5346 (fax) (318) 231-5270 (work) (318) 981-9744 (home) From owner-reliable_computing [at] interval [dot] usl.edu Mon Mar 1 17:12:52 1999 Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id RAA07860 for reliable_computing-outgoing; Mon, 1 Mar 1999 17:12:52 -0600 (CST) Received: from staff2.cso.uiuc.edu (nikos [at] staff2 [dot] cso.uiuc.edu [128.174.5.53]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id RAA07855 for ; Mon, 1 Mar 1999 17:12:49 -0600 (CST) Received: from localhost (nikos@localhost) by staff2.cso.uiuc.edu (8.8.8/8.8.8) with SMTP id RAA17758; Mon, 1 Mar 1999 17:12:45 -0600 (CST) X-Authentication-Warning: staff2.cso.uiuc.edu: nikos owned process doing -bs Date: Mon, 1 Mar 1999 17:12:44 -0600 (CST) From: sahinidis nikolaos v X-Sender: nikos [at] staff2 [dot] cso.uiuc.edu To: Kearfott Ralph B cc: reliable_computing [at] interval [dot] usl.edu Subject: Re: bounds for a polynomial In-Reply-To: <199903012041.OAA14973 [at] d22 [dot] ucs.usl.edu> Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Yes, the point provided by BARON is a near-global minimum. The algorithm used is of the branch and bound type, although all computations are done in fixed point arithmetic and not interval arithmetic. We have used it with polynomials up to degree 50. The BARON code for univariate polynomials is VERY fast (even the version provided on the web is very fast:) Best regards, Nick On Mon, 1 Mar 1999, Kearfott Ralph B wrote: > And then rigorous bounds could be produced from the output of Baron > via epsilon-inflation and a verification step, provided it is certain > that Baron gives a point near the global minimum (as opposed to a > local minimizer). I'm inclined to believe it can, given that the > function is a polynomial with the coefficients known to Baron. Certainly, > for polynomials of degree 4 or less :-) > > Alternately, a general interval branch and bound system, such as > GlobSol, may be used to rigorously find the minima. But that might > be more computation than you desire, if this represents a small subproblem > in a larger system. > > Best regards, > > Baker > > > From: Nick Sahinidis > > Subject: Re: bounds for a polynomial > > Mime-Version: 1.0 > > > > The BARON code provides a routine for finding the global minimum of a > > univariate polynomial (no additional software is required)--switch the > > coefficient signs to get the upper bound. See: > > > > http://archimedes.scs.uiuc.edu/baron.html > > > > At 12:39 PM 3/1/99 -0500, Ned Nedialkov wrote: > > > > > > Hi, > > > > > > I am looking for a piece of software that can produce tight bounds > > >for the range of the polynomial > > > > > > p(t) = a_0 + a_1t + ... + a_kt^k > > > > > >for t \in [0, h]. > > > > > >That is, I need a function that has input parameters > > > a_0, a_1, ... a_k, and h > > >and returns a tight interval that contains the range of p(t) over [0,h]. > > > > > >Any help is greatly appreciated. > > > > > >Regards, > > > Ned > > R. Baker Kearfott, rbk [at] usl [dot] edu (318) 231-5346 (fax) > (318) 231-5270 (work) (318) 981-9744 (home) > From owner-reliable_computing [at] interval [dot] usl.edu Thu Mar 4 05:30:56 1999 Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id FAA19890 for reliable_computing-outgoing; Thu, 4 Mar 1999 05:30:56 -0600 (CST) Received: from contact.fh-konstanz.de (contact.fh-konstanz.de [141.37.216.5]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id FAA19885 for ; Thu, 4 Mar 1999 05:30:32 -0600 (CST) Received: from ti-pc01.fh-konstanz.de (dec-switch.fh-konstanz.de [141.37.28.1]) by contact.fh-konstanz.de (8.8.8/8.8.8) with SMTP id MAA14443 for ; Thu, 4 Mar 1999 12:29:13 +0100 (MET) Message-Id: <1.5.4.32.19990304111630.006d9548 [at] mail [dot] fh-konstanz.de> X-Sender: garloff [at] mail [dot] fh-konstanz.de X-Mailer: Windows Eudora Light Version 1.5.4 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Thu, 04 Mar 1999 12:16:30 +0100 To: reliable_computing [at] interval [dot] usl.edu From: Juergen Garloff Subject: bounds on a polynomial Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk An alternative approach relies on the expansion of a polynomial into Bernstein polynomials. A rather complete bibliography (also on the univariate case) can be found in R.Hungerbuehler and J.Garloff Bounds for the range of a bivariate polynomial over a triangle Reliable Computing 4, pp.3-13,1998. Juergen Garloff -------------------------------------------------------------- Prof. Dr. Juergen Garloff Fachhochschule Konstanz/ University of Applied Sciences Konstanz Fachbereich Informatik Postfach 100543 D-78405 Konstanz Germany Tel.: +49-7531-206-597 or -627 Fax: +49-7531-206-559 email: garloff@fh-konstanz.de URL: http://www-home.fh-konstanz.de/~garloff/ -------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] usl.edu Thu Mar 4 19:46:41 1999 Received: (from daemon@localhost) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id TAA20644 for reliable_computing-outgoing; Thu, 4 Mar 1999 19:46:41 -0600 (CST) Received: from yonge.cs.toronto.edu (root [at] yonge [dot] cs.toronto.edu [128.100.1.8]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id TAA20639 for ; Thu, 4 Mar 1999 19:46:38 -0600 (CST) Received: from qew.cs.toronto.edu ([128.100.2.15]) by yonge.cs.toronto.edu with SMTP id <86474-176>; Thu, 4 Mar 1999 20:46:33 -0500 Received: by qew.cs.toronto.edu id <37913-13184>; Thu, 4 Mar 1999 20:46:21 -0500 From: Ned Nedialkov To: reliable_computing [at] interval [dot] usl.edu Subject: Summary: bounds for a polynomial Message-Id: <99Mar4.204621edt.37913-13184 [at] qew [dot] cs.toronto.edu> Date: Thu, 4 Mar 1999 20:46:17 -0500 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk I posted the following message a few days ago: ========================================================================= I am looking for a piece of software that can produce tight bounds for the range of the polynomial p(t) = a_0 + a_1t + ... + a_kt^k for t \in [0, h]. That is, I need a function that has input parameters a_0, a_1, ... a_k, and h and returns a tight interval that contains the range of p(t) over [0,h]. ========================================================================= Thank you to all the people that replied. >From the responses (so far) in this mailing list, it seems that there is not a stand-alone function that can compute such bounds. Note that the coefficients are not even intervals, although I have not said this explicitly. I am not interested in downloading a package that does other things, and somewhere it can do what I want. I need just a function, which I can download and compile with my software. Perhaps doing a really good job on this problem is enough for a M.Sc. project? Regards, Ned From owner-reliable_computing [at] interval [dot] usl.edu Thu Mar 4 20:01:28 1999 Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id UAA20933 for reliable_computing-outgoing; Thu, 4 Mar 1999 20:01:28 -0600 (CST) Received: from mercury.Sun.COM (mercury.Sun.COM [192.9.25.1]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id UAA20928 for ; Thu, 4 Mar 1999 20:01:25 -0600 (CST) Received: from engmail2.Eng.Sun.COM ([129.146.1.25]) by mercury.Sun.COM (8.9.3+Sun/8.9.3) with ESMTP id SAA21358; Thu, 4 Mar 1999 18:00:45 -0800 (PST) Received: from ha-sims.eng.sun.com (phys-thestorka.Eng.Sun.COM [129.146.1.231]) by engmail2.Eng.Sun.COM (8.8.8+Sun/8.8.8) with ESMTP id SAA02508; Thu, 4 Mar 1999 18:00:44 -0800 (PST) Received: from math (math.Eng.Sun.COM) by ha-sims.eng.sun.com (Sun Internet Mail Server sims.3.5.1999.01.13.19.49.p4) with SMTP id <0F83005A5MVEFV@ha-sims.eng.sun.com>; Thu, 4 Mar 1999 17:59:38 -0800 (PST) Date: Thu, 04 Mar 1999 17:59:42 -0800 (PST) From: Dmitri Shiriaev Subject: Re: Summary: bounds for a polynomial To: reliable_computing [at] interval [dot] usl.edu Cc: ned [at] cs [dot] toronto.edu Reply-to: Dmitri Shiriaev Message-id: <0F83005A6MVEFV@ha-sims.eng.sun.com> MIME-version: 1.0 X-Mailer: dtmail 1.2.1 CDE Version 1.2.1 SunOS 5.6 sun4u sparc Content-type: TEXT/plain; charset=us-ascii Content-MD5: eFwqO/sAhs1XQBM471inmA== Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Ned, Unfortunately I missed this posting before. Check out Hammer, Hocks, Kulisch, Ratz either Numerical Toolbox for Verified Computing I (PASCAL-XSC version) or C++ Toolbox for Verified Computing (C-XSC version) Programs in the chapter 4 do exactly what you need The source code is freely available through either http://www.uni-karlsruhe.de/~iam/html/literatur/toolbox.html or http://www.uni-karlsruhe.de/~iam/html/literatur/c-toolbox.html Regards Dima > Date: Thu, 04 Mar 1999 20:46:17 -0500 > From: Ned Nedialkov > Subject: Summary: bounds for a polynomial > To: reliable_computing [at] interval [dot] usl.edu > > > > I posted the following message a few days ago: > > ========================================================================= > > I am looking for a piece of software that can produce tight bounds > for the range of the polynomial > > p(t) = a_0 + a_1t + ... + a_kt^k > > for t \in [0, h]. > > That is, I need a function that has input parameters > a_0, a_1, ... a_k, and h > and returns a tight interval that contains the range of p(t) over [0,h]. > > ========================================================================= > > Thank you to all the people that replied. > > From the responses (so far) in this mailing list, it seems that there > is not a stand-alone function that can compute such bounds. Note that > the coefficients are not even intervals, although I have not said this > explicitly. I am not interested in downloading a package that does > other things, and somewhere it can do what I want. I need just a > function, which I can download and compile with my software. Perhaps > doing a really good job on this problem is enough for a M.Sc. project? > > Regards, > Ned -- Dima -- From owner-reliable_computing [at] interval [dot] usl.edu Thu Mar 4 23:31:48 1999 Received: (from daemon@localhost) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id XAA21373 for reliable_computing-outgoing; Thu, 4 Mar 1999 23:31:48 -0600 (CST) Received: from marnier.ucs.usl.edu (root@ucs-gw.usl.edu [130.70.40.2]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id XAA21365 for ; Thu, 4 Mar 1999 23:31:45 -0600 (CST) Received: from bp.usl.edu (goedel.usl.edu [130.70.49.203]) by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.3) with SMTP id XAA04525; Thu, 4 Mar 1999 23:31:32 -0600 (CST) Message-Id: <2.2.32.19990305052703.0069d1a8 [at] pop [dot] usl.edu> X-Sender: rbk5287 [at] pop [dot] usl.edu X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Thu, 04 Mar 1999 23:27:03 -0600 To: Ned Nedialkov , reliable_computing [at] interval [dot] usl.edu From: "R. Baker Kearfott" Subject: Re: Summary: bounds for a polynomial Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Yes, I think it may be a good project. I did it for degree 3 as a direct method (considering various cases), when I was thinking of providing support for splines in GlobSol. For very high degree, it can be somewhat interesting just to find the zeros of a polynomial with a branch and bound method. Although I completed it some time ago, it took me a while to discover techniques that would give 20 tight verified solutions to the Wilkinson polynomial, within the context that is now GlobSol. Best regards, Baker At 08:46 PM 3/4/99 -0500, Ned Nedialkov wrote: > > >I posted the following message a few days ago: > >========================================================================= > > I am looking for a piece of software that can produce tight bounds >for the range of the polynomial > > p(t) = a_0 + a_1t + ... + a_kt^k > >for t \in [0, h]. > >That is, I need a function that has input parameters > a_0, a_1, ... a_k, and h >and returns a tight interval that contains the range of p(t) over [0,h]. > >========================================================================= > >Thank you to all the people that replied. > >>From the responses (so far) in this mailing list, it seems that there >is not a stand-alone function that can compute such bounds. Note that >the coefficients are not even intervals, although I have not said this >explicitly. I am not interested in downloading a package that does >other things, and somewhere it can do what I want. I need just a >function, which I can download and compile with my software. Perhaps >doing a really good job on this problem is enough for a M.Sc. project? > >Regards, > Ned > > --------------------------------------------------------------- R. Baker Kearfott, rbk [at] usl [dot] edu (318) 482-5346 (fax) (318) 482-5270 (work) (318) 981-9744 (home) URL: http://interval.usl.edu/kearfott.html Department of Mathematics, University of Southwestern Louisiana USL Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] usl.edu Thu Mar 4 23:31:50 1999 Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id XAA21387 for reliable_computing-outgoing; Thu, 4 Mar 1999 23:31:50 -0600 (CST) Received: from marnier.ucs.usl.edu (root@ucs-gw.usl.edu [130.70.40.2]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id XAA21371 for ; Thu, 4 Mar 1999 23:31:47 -0600 (CST) Received: from bp.usl.edu (goedel.usl.edu [130.70.49.203]) by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.3) with SMTP id XAA04528; Thu, 4 Mar 1999 23:31:40 -0600 (CST) Message-Id: <2.2.32.19990305052707.00694c90 [at] pop [dot] usl.edu> X-Sender: rbk5287 [at] pop [dot] usl.edu X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Thu, 04 Mar 1999 23:27:07 -0600 To: Dmitri Shiriaev , reliable_computing [at] interval [dot] usl.edu From: "R. Baker Kearfott" Subject: Re: Summary: bounds for a polynomial Cc: ned [at] cs [dot] toronto.edu Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Ah, yes, thanks, Dima. I'd forgot about that when I posted my previous message. (Blush, blush) Best regards, Baker At 05:59 PM 3/4/99 -0800, Dmitri Shiriaev wrote: >Ned, > >Check out > >Hammer, Hocks, Kulisch, Ratz >either >Numerical Toolbox for Verified Computing I (PASCAL-XSC version) >or >C++ Toolbox for Verified Computing (C-XSC version) > >Programs in the chapter 4 do exactly what you need > >The source code is freely available through >either >http://www.uni-karlsruhe.de/~iam/html/literatur/toolbox.html >or >http://www.uni-karlsruhe.de/~iam/html/literatur/c-toolbox.html > >Regards >Dima > >> Date: Thu, 04 Mar 1999 20:46:17 -0500 >> From: Ned Nedialkov >> Subject: Summary: bounds for a polynomial >> To: reliable_computing [at] interval [dot] usl.edu >> >> >> >> I posted the following message a few days ago: >> >> ========================================================================= >> >> I am looking for a piece of software that can produce tight bounds >> for the range of the polynomial >> >> p(t) = a_0 + a_1t + ... + a_kt^k >> >> for t \in [0, h]. >> >> That is, I need a function that has input parameters >> a_0, a_1, ... a_k, and h >> and returns a tight interval that contains the range of p(t) over [0,h]. >> >> ========================================================================= >-- Dima -- > > --------------------------------------------------------------- R. Baker Kearfott, rbk [at] usl [dot] edu (318) 482-5346 (fax) (318) 482-5270 (work) (318) 981-9744 (home) URL: http://interval.usl.edu/kearfott.html Department of Mathematics, University of Southwestern Louisiana USL Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] usl.edu Fri Mar 5 09:37:30 1999 Received: (from daemon@localhost) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id JAA22484 for reliable_computing-outgoing; Fri, 5 Mar 1999 09:37:30 -0600 (CST) Received: from happy.dt.uh.edu (Happy.DT.UH.EDU [129.7.174.25]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id JAA22479; Fri, 5 Mar 1999 09:37:27 -0600 (CST) Received: by happy.dt.uh.edu (950413.SGI.8.6.12/940406.SGI.AUTO) id JAA13722; Fri, 5 Mar 1999 09:35:22 -0800 From: "Chenyi Hu" Message-Id: <9903050935.ZM13720 [at] happy [dot] dt.uh.edu> Date: Fri, 5 Mar 1999 09:35:21 -0800 In-Reply-To: "Angel L. Pereira" "Javascript codes" (Feb 27, 12:17am) References: <36D77FD7.2E3362EE [at] unix [dot] temple.edu> X-Mailer: Z-Mail (3.2.3 08feb96 MediaMail) To: "Angel L. Pereira" , reliable_computing [at] interval [dot] usl.edu, Angel Pereira Subject: Re: Javascript codes Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk On Feb 27, 12:17am, Angel L. Pereira wrote: > > I'm trying to create a javascript interval calculator abd I'm having > problem comming with a Sin,Tan,Cos code that works with an input form. > Can any body help me find or give me any ideas of how I can create or > find a good code for this purpose. The main problem is that it won't let > me use the functions more than once at the same time. Thank you. > Yes, we have developed an online interval calculator with Java 1.1. Please see the websites: http://www.mscs.mu.edu/~globsol/JavaIntervalCalc/I_C.html or http://gauss.dt.uh.edu/IntervalCalc/I_C.html Chenyi Hu -- Ph.D., Associate Professor, Computer and Mathematical Sciences Center for Computational Science and Advanced Distributed Simulation University of Houston-Downtown Phone: 713 221-8414 One Main Street Fax: 713 221-8086 Houston, Texas 77002 E-mail: CHu [at] uh [dot] edu http://happy.dt.uh.edu/~hu/Hu.html