The Markov chain process for predicting the occurence of a sequence of rainless days, a standard technique, is critically examined in light of the basic underlying assumptions that must be made each time it is used. This is then compared to a simple binomial model wherein an event is defined to be a series of rainless days of desired length. Computer programs to perform the required calculations are then presented and compared as to complexity and operating characteristics. Finally, an example of applying both programs to real data is presented and further comparisons are drawn between the two techniques.
Identifer | oai:union.ndltd.org:UTAHS/oai:digitalcommons.usu.edu:etd-8045 |
Date | 01 May 1974 |
Creators | Homeyer, Jack Wilfred |
Publisher | DigitalCommons@USU |
Source Sets | Utah State University |
Detected Language | English |
Type | text |
Format | application/pdf |
Source | All Graduate Theses and Dissertations |
Rights | Copyright for this work is held by the author. Transmission or reproduction of materials protected by copyright beyond that allowed by fair use requires the written permission of the copyright owners. Works not in the public domain cannot be commercially exploited without permission of the copyright owner. Responsibility for any use rests exclusively with the user. For more information contact digitalcommons@usu.edu. |
Page generated in 0.0021 seconds