Next Article in Journal
Edit Distance with Block Deletions
Previous Article in Journal
Quantification of the Variability of Continuous Glucose Monitoring Data
Algorithms 2011, 4(1), 28-39; doi:10.3390/a4010028

Defense of the Least Squares Solution to Peelle’s Pertinent Puzzle

1,* , 2
Received: 6 December 2010 / Revised: 15 January 2011 / Accepted: 7 February 2011 / Published: 15 February 2011
View Full-Text   |   Download PDF [123 KB, 17 February 2011; original version 15 February 2011]   |   Browse Figures


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, illustrates when PPP can be beneficial for parameter estimation, reviews optimality properties of GLS estimators, and gives an example in which PPP does occur.
Keywords: Peelle’s puzzle; mean squared error; measurement error modeling Peelle’s puzzle; mean squared error; measurement error modeling
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Share & Cite This Article

Further Mendeley | CiteULike
Export to BibTeX |
MDPI and ACS Style

Burr, T.; Kawano, T.; Talou, P.; Pan, F.; Hengartner, N. Defense of the Least Squares Solution to Peelle’s Pertinent Puzzle. Algorithms 2011, 4, 28-39.

View more citation formats

Article Metrics

For more information on the journal, click here


Cited By

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert