Algorithm to compute critical values of Durbin-Watson statistic?

From: Phil Sherrod (phil.sherrod_at_REMOVETHISsandh.com)
Date: 12/22/04 

Date: Wed, 22 Dec 2004 16:01:42 GMT

Can anyone give me a pointer to a site that provides an algorithm for
computing the critical values of the Durbin-Watson statistic? There are
lots of pre-computed tables, but I need to compute the values in a program. 

-- 
Phil Sherrod
(phil.sherrod 'at' sandh.com)
http://www.dtreg.com  (decision tree modeling)
http://www.nlreg.com  (nonlinear regression)
http://www.NewsRover.com (Usenet newsreader)
http://www.LogRover.com (Web statistics analysis)

Relevant Pages

  • Algorithm to compute critical values of Durbin-Watson statistic?
    ... Can anyone give me a pointer to a site that provides an algorithm for ... computing the critical values of the Durbin-Watson statistic? ... http://www.LogRover.com (Web statistics analysis) ...
    (sci.stat.edu)
  • beta version of Victor Shoups book, "A Computational Introduction to Number Theory and Algebra&
    ... Computing with Large Integers ... The Basic Euclidean Algorithm ... Factoring and Computing Euler's phi-Function are Equivalent ... The Existence of Finite Fields ...
    (sci.crypt)
  • Re: Why does Cantor a target for cranks?
    ... and wildberger doesn't give this the recognition it deserves ... that if we have a computing process that generates a stream of ... then it's meaningful for such a specific process (algorithm) ... or conflating various groups of order 6 into the ...
    (sci.math)
  • Re: Simple C containers, std::vector analog
    ... the computing power of thiry ... Thirty years ago it was 1975 and computers ran in Kilohertz ... and some implementations do choke on realloc'ing a null pointer. ... template f void f(voidpT buffer){ ...
    (comp.lang.c)
  • Re: Correctness proving (Was: Clear and Unambiguous SOFTWARE requirements/specifications possible?)
    ... We come up with reasonable schemes that find "good" results (by some ... The bulk of OR techniques -- like linear programming, dynamic programming, Out Of Kilter, etc. -- all provide a deterministic solution for problems like Traveling Salesman that will always be the absolute optimum. ... Solving np-Complete problems requires both an algorithm and a representation of the problem that is appropriate for the algorithm. ... The issue here is proving correctness of programs that are well-formed within the constraints of the computing space. ...
    (comp.software.testing)