Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!caip!rutgers!uwvax!husc6!endor!greg
From: greg@endor.harvard.edu (Greg)
Newsgroups: sci.math
Subject: Sturm chains...
Message-ID: <481@husc6.HARVARD.EDU>
Date: Mon, 20-Oct-86 13:06:45 EDT
Article-I.D.: husc6.481
Posted: Mon Oct 20 13:06:45 1986
Date-Received: Tue, 21-Oct-86 23:30:52 EDT
Sender: news@husc6.HARVARD.EDU
Reply-To: greg@endor.UUCP (Greg)
Distribution: net
Organization: Harvard
Lines: 6

A long time ago, someone posted an article about a good algorithm to figure out
if a given polynomial has a root between two given points in the reals.  I
believe it involved Sturm chains...Could this person (or someone else who knows
about this stuff) send me the algorithm?  Thanks in advance.
----
Greg