defense of the least squares solution to peelle’s pertinent puzzle国防的最小二乘解peelle相关的难题.pdfVIP

Algorithms 2011, 4, 28-39; doi:10.3390/a4010028 OPEN ACCESS algorithms ISSN 1999-4893 /journal/algorithms Article Defense of the Least Squares Solution to Peelle’s Pertinent Puzzle Tom Burr ,⋆, Toshihiko Kawano , Patrick Talou , Feng Pan and Nicolas Hengartner Statistical Sciences, Los Alamos National Laboratory, Los Alamos NM, USA; E-Mail: tburr@ Nuclear and Particle Physics, Los Alamos National Laboratory, Los Alamos NM, USA; E-Mail: talou@ Decision Applications, Los Alamos National Laboratory, Los Alamos NM, USA; E-Mail: fpan@ Information Sciences, Los Alamos National Laboratory, Los Alamos NM, USA; E-Mail: nickh@ ⋆ Author to whom correspondence should be addressed; E-Mail: kawano@; Tel.: +1-505-664-0513; Fax: +1-505-667-1931. Received: 6 December 2010; in revised form: 15 January 2011 / Accepted: 7 February 2011 / Published: 15 February 2011 Abstract: Generalized least squares (GLS) for model parameter estimation has a long and successful history dating to its development by Gauss in 1795. Alternatives can outperform GLS in some settings, and alternatives to GLS are sometimes sought when GLS exhibits curious behavior, such as in Peelle’s Pertinent Puzzle (PPP). PPP was described in 1987 in the context of estimating fundamental parameters that arise in nuclear interaction experiments. In PPP, GLS estimates fell outside the range of the data, eliciting concerns that GLS was somehow flawed. These concerns have led to suggested alternatives to GLS estimators. This paper defends GLS in the PPP context, investigates when PPP can occur, illu