메뉴 건너뛰기




Volumn , Issue , 2011, Pages 1-447

Numerical methods of statistics, second edition

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84924699841     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511977176     Document Type: Book
Times cited : (18)

References (401)
  • 2
    • 0003657590 scopus 로고    scopus 로고
    • Fundamental Algorithms), 3rd ed. Reading, MA: Addison-Wesley
    • Donald E. Knuth (1997), The Art of Computer Programming(vol. 1: Fundamental Algorithms), 3rd ed. Reading, MA: Addison-Wesley.
    • (1997) The Art of Computer Programming , vol.1
    • Knuth, D.E.1
  • 6
    • 84924713343 scopus 로고
    • Anonymous, Poughkeepsie, NY: IBM Corporation
    • Anonymous (1956), Number Systems. Poughkeepsie, NY: IBM Corporation.
    • (1956) Number Systems
  • 7
    • 84966222419 scopus 로고
    • The computation of π to 29,360,000 decimal digits using borwein’s quartically convergent algorithm
    • David H. Bailey (1988), “The Computation of π to 29,360,000 Decimal Digits Using Borweins’ Quartically Convergent Algorithm,” Mathematics of Computation50: 283–96.
    • (1988) Mathematics of Computation , vol.50 , pp. 283-296
    • Bailey, D.H.1
  • 8
    • 0017950568 scopus 로고
    • A fortran multiple-precision arithmetic package
    • Richard P. Brent (1978), “A Fortran Multiple-Precision Arithmetic Package,” ACM Transactions on Mathematical Software4: 57–70.
    • (1978) ACM Transactions on Mathematical Software , vol.4 , pp. 57-70
    • Brent, R.P.1
  • 9
    • 0024133445 scopus 로고
    • Algorithm 665, machar: A subroutine to dynamically determine machine parameters
    • W. J. Cody (1988), “Algorithm 665, MACHAR: A Subroutine to Dynamically Determine Machine Parameters,” ACM Transactions on Mathematical Software14: 303–11.
    • (1988) ACM Transactions on Mathematical Software , vol.14 , pp. 303-311
    • Cody, W.J.1
  • 10
    • 0004276254 scopus 로고
    • trans. by N. Anderson). Englewood Cliffs, NJ: Prentice-Hall
    • Germund Dahlquist and Ake Bjorck (1974), Numerical Methods(trans. by N. Anderson). Englewood Cliffs, NJ: Prentice-Hall.
    • (1974) Numerical Methods
    • Dahlquist, G.1    Bjorck, A.2
  • 11
    • 0000810983 scopus 로고
    • A floating-point technique for extending theavailable precision
    • T. J. Dekker (1971), “A Floating-Point Technique for Extending theAvailable Precision,” Numerische Mathematik18: 224–42.
    • (1971) Numerische Mathematik , vol.18 , pp. 224-242
    • Dekker, T.J.1
  • 13
    • 0026122066 scopus 로고
    • What every computer scientist should know about floating point arithmetic
    • David Goldberg (1991), “What Every Computer Scientist Should Know about Floating Point Arithmetic,” ACM Computing Surveys23: 5–48.
    • (1991) ACM Computing Surveys , vol.23 , pp. 5-48
    • Goldberg, D.1
  • 14
    • 0003589319 scopus 로고
    • Standard 754-1985, IEEE, New York
    • Institute of Electrical and Electronics Engineers (1985), “IEEE Standard for Binary Floating Point Arithmetic,” Standard 754-1985, IEEE, New York.
    • (1985) IEEE Standard for Binary Floating Pointarithmetic
  • 17
    • 0003657590 scopus 로고    scopus 로고
    • Fundamental Algorithms), 3rd ed. Reading, MA: Addison-Wesley
    • Donald E. Knuth (1997a), The Art of Computer Programming(vol. 1: Fundamental Algorithms), 3rd ed. Reading, MA: Addison-Wesley.
    • (1997) The Art of Computer Programming , vol.1
    • Knuth, D.E.1
  • 18
    • 0003657593 scopus 로고    scopus 로고
    • Seminumerical Algorithms), 3rd. ed. Reading, MA: Addison-Wesley
    • Donald E. Knuth (1997b), The Art of Computer Programming(vol. 2: Seminumerical Algorithms), 3rd. ed. Reading, MA: Addison-Wesley.
    • (1997) The Art of Computer Programming , vol.2
    • Knuth, D.E.1
  • 20
    • 0001376054 scopus 로고
    • Symmetric decomposition of a positive definite matrix
    • R. S. Martin, G. Peters, and J. H. Wilkinson (1965), “Symmetric Decomposition of a Positive Definite Matrix,” Numerische Mathematik7: 363–83.
    • (1965) Numerische Mathematik , vol.7 , pp. 363-383
    • Martin, R.S.1    Peters, G.2    Wilkinson, J.H.3
  • 23
    • 0024090481 scopus 로고
    • Random number generators: Good ones are hard to find
    • Stephen K. Park and Keith W. Miller (1988), “Random Number Generators: Good Ones Are Hard to Find,” Communications of the ACM31: 1192–1201.
    • (1988) Communications of the ACM , vol.31 , pp. 1192-1201
    • Park, S.K.1    Miller, K.W.2
  • 24
    • 0003655416 scopus 로고
    • 2nd ed. New York: Macmillan
    • H. L. Royden (1968), Real Analysis, 2nd ed. New York: Macmillan.
    • (1968) Real Analysis
    • Royden, H.L.1
  • 26
    • 0026167255 scopus 로고
    • Algorithm 693: A fortran package for floating-point multiple-precision arithmetic
    • David M. Smith (1991), “Algorithm 693: A Fortran Package for Floating-Point Multiple-Precision Arithmetic,” ACM Transactions on Mathematical Software17: 273–83.
    • (1991) ACM Transactions on Mathematical Software , vol.17 , pp. 273-283
    • Smith, D.M.1
  • 28
    • 0016059457 scopus 로고
    • On the distribution of significant digits and roundoff errors
    • Nai-kuan Tsao (1974), “On the Distribution of Significant Digits and Roundoff Errors,” Communications of the ACM17: 269–271.
    • (1974) Communications of the ACM , vol.17 , pp. 269-271
    • Tsao, N.-K.1
  • 29
    • 21844503454 scopus 로고
    • Self-validating computations of probabilities for selected central and noncentral univariate probability functions
    • Morgan C. Wang and William J. Kennedy (1994), “Self-Validating Computations of Probabilities for Selected Central and Noncentral Univariate Probability Functions,” Journal of the American Statistical Association89: 878–87.
    • (1994) Journal of the American Statistical Association , vol.89 , pp. 878-887
    • Wang, M.C.1    Kennedy, W.J.2
  • 33
    • 84966237760 scopus 로고
    • The probability that a numerical analysis problem is difficult
    • James W. Demmel (1988), “The Probability That a Numerical Analysis Problem Is Difficult,” Mathematics of Computation50: 449–80.
    • (1988) Mathematics of Computation , vol.50 , pp. 449-480
    • Demmel, J.W.1
  • 35
    • 0004236492 scopus 로고    scopus 로고
    • 3rd. ed. Baltimore: Johns Hopkins University Press
    • Gene H. Golub and Charles van Loan (1996), Matrix Computations, 3rd. ed. Baltimore: Johns Hopkins University Press.
    • (1996) Matrix Computations
    • Golub, G.H.1    Loan, C.V.2
  • 39
    • 0003657590 scopus 로고    scopus 로고
    • Fundamental Algorithms), 3rd ed. Reading, MA: Addison-Wesley
    • Donald E. Knuth (1997), The Art of Computer Programming(vol. 1: Fundamental Algorithms), 3rd ed. Reading, MA: Addison-Wesley.
    • (1997) The Art of Computer Programming , vol.1
    • Knuth, D.E.1
  • 42
    • 0000485973 scopus 로고
    • The efficient generation of random orthogonal matrices with an application to condition estimators
    • G.W. Stewart (1980), “The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators,” SIAM Journal of Numerical Analysis17: 403–9.
    • (1980) SIAM Journal of Numerical Analysis , vol.17 , pp. 403-409
    • Stewart, G.W.1
  • 44
    • 0018345540 scopus 로고
    • An algorithm for the exact likelihood of a mixed autoregressive-moving average process
    • Craig F. Ansley (1979), “An Algorithm for the Exact Likelihood of a Mixed Autoregressive-Moving Average Process,” Biometrika66: 59–65.
    • (1979) Biometrika , vol.66 , pp. 59-65
    • Ansley, C.F.1
  • 45
    • 0001637146 scopus 로고
    • The simplex method of linear programming using lu decomposition
    • Richard H. Bartels and Gene H. Golub (1969), “The Simplex Method of Linear Programming Using LU Decomposition,” Communications of the ACM, 12: 266–68.
    • (1969) Communications of the ACM , vol.12 , pp. 266-268
    • Bartels, R.H.1    Golub, G.H.2
  • 47
    • 0001112325 scopus 로고
    • The numerical stability of the levinson–durbin algorithm for toeplitz systems of equations
    • George Cybenko (1980), “The Numerical Stability of the Levinson–Durbin Algorithm for Toeplitz Systems of Equations,” SIAM Journal of Scientific and Statistical Computing1: 303–19.
    • (1980) SIAM Journal of Scientific and Statistical Computing , vol.1 , pp. 303-319
    • Cybenko, G.1
  • 49
    • 0004236492 scopus 로고    scopus 로고
    • 3rd ed. Baltimore: Johns Hopkins University Press
    • Gene H. Golub and Charles van Loan (1996), Matrix Computations, 3rd ed. Baltimore: Johns Hopkins University Press.
    • (1996) Matrix Computations
    • Golub, G.H.1    Loan, C.V.2
  • 50
    • 0001671939 scopus 로고
    • Comparison of some direct methods for computing stationary distributions of markov chains
    • W. J. Harrod and R. J. Plemmons (1984), “Comparison of Some Direct Methods for Computing Stationary Distributions of Markov Chains,” SIAM Journal of Scientific and Statistical Computing5: 453–69.
    • (1984) SIAM Journal of Scientific and Statistical Computing , vol.5 , pp. 453-469
    • Harrod, W.J.1    Plemmons, R.J.2
  • 51
    • 0001917942 scopus 로고
    • Space-time modelling with long-memory dependence: Assessing ireland’s wind power resource
    • John Haslett and Adrian Raftery (1989), “Space-Time Modelling with Long-Memory Dependence: Assessing Ireland’s Wind Power Resource,” Applied Statistics38: 1–50.
    • (1989) Applied Statistics , vol.38 , pp. 1-50
    • Haslett, J.1    Raftery, A.2
  • 52
    • 77956890381 scopus 로고
    • Fractional differencing
    • J. R. M. Hosking (1981), “Fractional Differencing,” Biometrika68: 165–76.
    • (1981) Biometrika , vol.68 , pp. 165-176
    • Hosking, J.1
  • 55
    • 0000413581 scopus 로고
    • The weiner rms error criterion in filter design and prediction
    • Norman Levinson (1947), “The Weiner RMS Error Criterion in Filter Design and Prediction,” Journal of Mathematics and Physics26: 261–78.
    • (1947) Journal of Mathematics and Physics , vol.26 , pp. 261-278
    • Levinson, N.1
  • 56
    • 0004552797 scopus 로고
    • Symmetric decomposition of positive definite band matrices
    • R. S. Martin and J. H. Wilkinson (1965), “Symmetric Decomposition of Positive Definite Band Matrices,” Numerische Mathematik7: 355–61.
    • (1965) Numerische Mathematik , vol.7 , pp. 355-361
    • Martin, R.S.1    Wilkinson, J.H.2
  • 57
    • 0039043426 scopus 로고
    • A note on enforcing stationarity in autoregressive-moving averagemodels
    • John F. Monahan (1984), “A Note on Enforcing Stationarity in Autoregressive-Moving Average Models,” Biometrika71: 403–4.
    • (1984) Biometrika , vol.71 , pp. 403-404
    • Monahan, J.F.1
  • 59
    • 17944380319 scopus 로고
    • When is an autoregressive scheme stationary?
    • Marcello Pagano (1973), “When is an Autoregressive Scheme Stationary?” Communications in Statistics1: 533–44.
    • (1973) Communications in Statistics , vol.1 , pp. 533-544
    • Pagano, M.1
  • 60
    • 0000307017 scopus 로고
    • An algorithm for the inversion of finite toeplitz matrices
    • William F. Trench (1964), “An Algorithm for the Inversion of Finite Toeplitz Matrices,” Journal of SIAM12: 515–22.
    • (1964) Journal of SIAM , vol.12 , pp. 515-522
    • Trench, W.F.1
  • 61
    • 34548613548 scopus 로고
    • Comment on ‘more on computational accuracy in regression’
    • Albert E. Beaton (1977), “Comment on ‘More on Computational Accuracy in Regression’,” Journal of the American Statistical Association72: 600.
    • (1977) Journal of the American Statistical Association , vol.72 , pp. 600
    • Beaton, A.E.1
  • 62
    • 0012094470 scopus 로고
    • The acceptability of regression solutions: Another look at computational accuracy
    • Albert E. Beaton, Donald B. Rubin, and John L. Barone (1976), “The Acceptability of Regression Solutions: Another Look at Computational Accuracy,” Journal of the American Statistical Association71: 158–68.
    • (1976) Journal of the American Statistical Association , vol.71 , pp. 158-168
    • Beaton, A.E.1    Rubin, D.B.2    Barone, J.L.3
  • 64
    • 0002168778 scopus 로고
    • Solving least squares problems by gram–schmidt orthogonalization
    • Ake Bjorck (1967), “Solving Least Squares Problems by Gram–Schmidt Orthogonalization,” BIT7: 1–21.
    • (1967) BIT , vol.7 , pp. 1-21
    • Bjorck, A.1
  • 66
    • 84952519631 scopus 로고
    • Algorithms for computing the sample variance
    • Tony F. Chan, Gene H. Golub, and Randall J. LeVeque (1983), “Algorithms for Computing the Sample Variance,” American Statistician37: 242–7.
    • (1983) American Statistician , vol.37 , pp. 242-247
    • Chan, T.F.1    Golub, G.H.2    LeVeque, R.J.3
  • 67
    • 0000577304 scopus 로고
    • As 163:Agivens algorithm for moving from one linear model to another without going back to the data
    • M. R. B. Clarke (1981), “AS 163:AGivens Algorithm for Moving from One Linear Model to Another without Going Back to the Data,” Applied Statistics30: 198–203.
    • (1981) Applied Statistics , vol.30 , pp. 198-203
    • Clarke, M.1
  • 69
    • 0004276254 scopus 로고
    • trans. by N. Anderson). Englewood Cliffs, NJ: Prentice-Hall
    • Germund Dahlquist and Ake Bjorck (1974), Numerical Methods(trans. by N. Anderson). Englewood Cliffs, NJ: Prentice-Hall.
    • (1974) Numerical Methods
    • Dahlquist, G.1    Bjorck, A.2
  • 72
    • 0642314553 scopus 로고
    • Multicollinearity etc., some ‘new’ examples
    • Washington, DC: American Statistical Association
    • R. J. Freund (1979), “Multicollinearity etc., Some ‘New’ Examples,” in Proceedings of the Statistical Computing Section, pp. 111–12. Washington, DC: American Statistical Association.
    • (1979) Proceedings of the Statistical Computing Section , pp. 111-112
    • Freund, R.J.1
  • 73
    • 51649109955 scopus 로고
    • All possible regressions with less computation
    • George M. Furnival (1971), “All Possible Regressions with Less Computation,” Technometrics13: 403–8.
    • (1971) Technometrics , vol.13 , pp. 403-408
    • Furnival, G.M.1
  • 74
    • 0016128505 scopus 로고
    • Regressions by leaps and bounds
    • George M. Furnival and Robert W. Wilson, Jr. (1974), “Regressions by Leaps and Bounds,” Technometrics16: 499–511.
    • (1974) Technometrics , vol.16 , pp. 499-511
    • Furnival, G.M.1    Wilson, R.W.2
  • 76
    • 0001596694 scopus 로고
    • Numerically stable methods for quadratic programming
    • Philip E. Gill and Walter Murray (1978), “Numerically Stable Methods for Quadratic Programming,” Mathematical Programming14: 349–372.
    • (1978) Mathematical Programming , vol.14 , pp. 349-372
    • Gill, P.E.1    Murray, W.2
  • 77
    • 49149140793 scopus 로고
    • Rules and software for detecting rank degeneracy
    • Gene Golub, Virginia Klema, and Stephen C. Peters (1980), “Rules and Software for Detecting Rank Degeneracy,” Journal of Econometrics12: 41–8.
    • (1980) Journal of Econometrics , vol.12 , pp. 41-48
    • Golub, G.1    Klema, V.2    Peters, S.C.3
  • 78
    • 0004236492 scopus 로고    scopus 로고
    • Baltimore: Johns Hopkins University Press
    • Gene H. Golub and Charles van Loan (1984), Matrix Computations. Baltimore: Johns Hopkins University Press.
    • (1984) Matrix Computations
    • Golub, G.H.1    Loan, C.V.2
  • 79
    • 84947680781 scopus 로고
    • A tutorial on the sweep operator
    • James H. Goodnight (1979), “A Tutorial on the SWEEP Operator,” American Statistician33: 149–58.
    • (1979) American Statistician , vol.33 , pp. 149-158
    • Goodnight, J.H.1
  • 80
    • 0003157339 scopus 로고
    • Robust estimation of a location parameter
    • Peter J. Huber (1964), “Robust Estimation of a Location Parameter”, Annals of Mathematical Statistics35: 73–101.
    • (1964) Annals of Mathematical Statistics , vol.35 , pp. 73-101
    • Huber, P.J.1
  • 83
    • 0000693707 scopus 로고
    • An appraisal of least squares programs for the electronic computer for the point of view of the user
    • James W. Longley (1967), “An Appraisal of Least Squares Programs for the Electronic Computer for the Point of View of the User,” Journal of the American Statistical Association62: 819–41.
    • (1967) Journal of the American Statistical Association , vol.62 , pp. 819-841
    • Longley, J.W.1
  • 87
    • 0000976724 scopus 로고    scopus 로고
    • The gaussian hare and the laplacian tortoise: Computability of square-error versus absolute-error estimators
    • Stephen Portnoy and Roger Koenker (1997), “The Gaussian Hare and the Laplacian Tortoise: Computability of Square-Error versus Absolute-error Estimators,” Statistical Science, 12: 279–300.
    • (1997) Statistical Science , vol.12 , pp. 279-300
    • Portnoy, S.1    Koenker, R.2
  • 88
    • 84946640102 scopus 로고
    • Efficient calculation of all possible regressions
    • M. Schatzoff, R. Tsao, and S. Feinberg (1968), “Efficient Calculation of All Possible Regressions,” Technometrics10: 769–79.
    • (1968) Technometrics , vol.10 , pp. 769-779
    • Schatzoff, M.1    Tsao, R.2    Feinberg, S.3
  • 93
    • 0040374448 scopus 로고
    • The economic storage of plane rotations
    • G. W. Stewart (1976), “The Economic Storage of Plane Rotations,” Numerische Mathematik25: 137–8.
    • (1976) Numerische Mathematik , vol.25 , pp. 137-138
    • Stewart, G.W.1
  • 94
    • 85194972808 scopus 로고    scopus 로고
    • Regression shrinkage and selection via the lasso
    • Robert Tibshirani (1996), “Regression Shrinkage and Selection via the Lasso,” Journal of the Royal Statistical Society58: 267–288.
    • (1996) Journal of the Royal Statistical Society , vol.58 , pp. 267-288
    • Tibshirani, R.1
  • 95
    • 0001639411 scopus 로고
    • Efficient computing of regression diagnostics
    • Paul F. Velleman and Roy E.Welsch (1981), “Efficient Computing of Regression Diagnostics,” American Statistician35: 234–42.
    • (1981) American Statistician , vol.35 , pp. 234-242
    • Velleman, P.F.1    Roy, E.2
  • 96
    • 0345840281 scopus 로고
    • Test procedures and test problems for least squares algorithms
    • Roy H. Wampler (1980), “Test Procedures and Test Problems for Least Squares Algorithms,” Journal of Econometrics12: 3–22.
    • (1980) Journal of Econometrics , vol.12 , pp. 3-22
    • Wampler, R.H.1
  • 98
    • 84946063031 scopus 로고
    • An improved algorithm for computing the singular value decomposition
    • T. F. Chan (1982), “An Improved Algorithm for Computing the Singular Value Decomposition,” ACM Transactions on Mathematical Software8: 72–88.
    • (1982) ACM Transactions on Mathematical Software , vol.8 , pp. 72-88
    • Chan, T.F.1
  • 99
    • 0004236492 scopus 로고    scopus 로고
    • 2nd ed. Baltimore: Johns Hopkins University Press
    • Gene H. Golub and Charles van Loan (1989), Matrix Computations, 2nd ed. Baltimore: Johns Hopkins University Press.
    • (1989) Matrix Computations
    • Golub, G.H.1    Loan, C.V.2
  • 100
    • 0001671939 scopus 로고
    • Comparison of some direct methods for computing stationary distributions of markov chains
    • W. J. Harrod and R. J. Plemmons (1984), “Comparison of Some Direct Methods for Computing Stationary Distributions of Markov Chains,” SIAM Journal of Scientific and Statistical Computing5: 453–68.
    • (1984) SIAM Journal of Scientific and Statistical Computing , vol.5 , pp. 453-468
    • Harrod, W.J.1    Plemmons, R.J.2
  • 104
    • 0000525593 scopus 로고
    • A geometric theory for the qr, lu and power iterations
    • B. N. Parlett and W. G. Poole (1973), “A Geometric Theory for the QR, LU and Power Iterations,” SIAM Journal of Numerical Analysis10: 389–412.
    • (1973) SIAM Journal of Numerical Analysis , vol.10 , pp. 389-412
    • Parlett, B.N.1    Poole, W.G.2
  • 106
    • 0017935507 scopus 로고
    • A comparison of numerical techniques in markov modeling
    • William J. Stewart (1978), “A Comparison of Numerical Techniques in Markov Modeling,” Communications of the ACM21: 144–52.
    • (1978) Communications of the ACM , vol.21 , pp. 144-152
    • Stewart, W.J.1
  • 112
    • 0347216900 scopus 로고
    • Alternatives to hasting’s approximation to the inverse of the normal cumulative distribution function
    • B. J. R. Bailey (1981), “Alternatives to Hastings’ Approximation to the Inverse of the Normal Cumulative Distribution Function,” Applied Statistics30: 275–6.
    • (1981) Applied Statistics , vol.30 , pp. 275-276
    • Bailey, B.1
  • 115
    • 84924650839 scopus 로고
    • Remark on algorithm 179, incomplete beta ratio
    • N. E. Bosten and E. L. Battiste (1973), “Remark on Algorithm 179, Incomplete Beta Ratio,” Communications of the ACM17: 156–7.
    • (1973) Communications of the ACM , vol.17 , pp. 156-157
    • Bosten, N.E.1    Battiste, E.L.2
  • 116
    • 0042638723 scopus 로고
    • Rational chebyshev approximation using linearequations
    • W. J. Cody, W. Fraser, and J. F. Hart (1968), “Rational Chebyshev Approximation Using Linear Equations,” Numerische Mathematik12: 242–51.
    • (1968) Numerische Mathematik , vol.12 , pp. 242-251
    • Cody, W.J.1    Fraser, W.2    Hart, J.F.3
  • 118
    • 34250263445 scopus 로고
    • Smoothing noisy data with spline functions
    • P. Craven and G. Wahba (1979), “Smoothing Noisy Data with Spline Functions,” Numerische Mathematik31: 377–403.
    • (1979) Numerische Mathematik , vol.31 , pp. 377-403
    • Craven, P.1    Wahba, G.2
  • 119
    • 0004276254 scopus 로고
    • trans. by N. Anderson). Englewood Cliffs, NJ: Prentice-Hall
    • Germund Dahlquist and Ake Bjorck (1974), Numerical Methods(trans. by N. Anderson). Englewood Cliffs, NJ: Prentice-Hall.
    • (1974) Numerical Methods
    • Dahlquist, G.1    Bjorck, A.2
  • 122
    • 0026914369 scopus 로고
    • Algorithm 708: Significant digit computation of the incomplete beta ratio
    • Armido R. DiDonato and Alfred H. Morris, Jr. (1992), “Algorithm 708: Significant Digit Computation of the Incomplete Beta Ratio,” ACM Transactions on Mathematical Software18: 360–73.
    • (1992) ACM Transactions on Mathematical Software , vol.18 , pp. 360-373
    • DiDonato, A.R.1    Morris, A.H.2
  • 123
    • 0002299623 scopus 로고
    • Calculation of univariate and bivariate normal probability functions
    • D. R. Divgi (1979), “Calculation of Univariate and Bivariate Normal Probability Functions,” Annals of Statistics7: 903–10.
    • (1979) Annals of Statistics , vol.7 , pp. 903-910
    • Divgi, D.R.1
  • 124
    • 84966241790 scopus 로고
    • Computation of the bivariate normal integral
    • Zvi Dresner (1978), “Computation of the Bivariate Normal Integral,” Mathematics of Computation32: 277–9.
    • (1978) Mathematics of Computation , vol.32 , pp. 277-279
    • Dresner, Z.1
  • 130
    • 84976782392 scopus 로고
    • A computational procedure for incomplete gamma functions
    • W. Gautschi (1979), “A Computational Procedure for Incomplete Gamma Functions,” ACM Transactions on Mathematical Software5: 466–81.
    • (1979) ACM Transactions on Mathematical Software , vol.5 , pp. 466-481
    • Gautschi, W.1
  • 131
    • 0011570697 scopus 로고
    • Optimal error bounds for cubic spline interpolation
    • C. A. Hall and W. W. Meyer (1976), “Optimal Error Bounds for Cubic Spline Interpolation,” Journal of Approximation Theory16: 105–22.
    • (1976) Journal of Approximation Theory , vol.16 , pp. 105-122
    • Hall, C.A.1    Meyer, W.W.2
  • 134
    • 0022730018 scopus 로고
    • Algorithm 642: A fast procedure for calculating minimum cross-validation cubic smoothing splines
    • M. F. Hutchinson (1986), “Algorithm 642: A Fast Procedure for Calculating Minimum Cross-Validation Cubic Smoothing Splines,” ACM Transactions on Mathematical Software12: 150–3.
    • (1986) ACM Transactions on Mathematical Software , vol.12 , pp. 150-153
    • Hutchinson, M.F.1
  • 135
    • 22944459891 scopus 로고
    • An approximation to the cumulative normal distribution with simple coefficients
    • Robert A. Lew (1981), “An Approximation to the Cumulative Normal Distribution with Simple Coefficients,” Applied Statistics30: 299–301.
    • (1981) Applied Statistics , vol.30 , pp. 299-301
    • Lew, R.A.1
  • 136
    • 0005849701 scopus 로고
    • A study of the accuracy of some approximation for t, chi-square, and f tail probabilities
    • Robert F. Ling (1978), “A Study of the Accuracy of Some Approximation for t, chi-square, and F Tail Probabilities,” Journal of the American Statistical Association73: 274–83.
    • (1978) Journal of the American Statistical Association , vol.73 , pp. 274-283
    • Ling, R.F.1
  • 137
    • 0007025295 scopus 로고
    • Algorithm as63: The incomplete beta integral
    • K. L. Majumder and G. P. Bhattacharjee (1973), “Algorithm AS63: The Incomplete Beta Integral,” Applied Statistics22: 409–11.
    • (1973) Applied Statistics , vol.22 , pp. 409-411
    • Majumder, K.L.1    Bhattacharjee, G.P.2
  • 139
    • 0041327199 scopus 로고
    • “normal scale mixture approximations to f ∗
    • N. Balakrishnan (Ed.), New York: Marcel Dekker
    • John F. Monahan and Leonard A. Stefanski (1992), “Normal Scale Mixture Approximations to F ∗(z) and Computation of the Logistic–Normal Integral,” in N. Balakrishnan (Ed.), Handbook of the Logistic Distribution, pp. 529–40. New York: Marcel Dekker.
    • (1992) Handbook of the Logistic Distribution , pp. 529-540
    • Monahan, J.F.1    Stefanski, L.A.2
  • 140
    • 0002399812 scopus 로고
    • Algorithm as70: The percentile points of the normal distribution
    • R. E. Odeh and J. O. Evans (1974), “Algorithm AS70: The Percentile Points of the Normal Distribution,” Applied Statistics23: 96–7.
    • (1974) Applied Statistics , vol.23 , pp. 96-97
    • Odeh, R.E.1    Evans, J.O.2
  • 142
    • 34250516079 scopus 로고
    • Smoothing by spline functions
    • Christian H. Reinsch (1967), “Smoothing by Spline Functions,” Numerische Mathematik10: 177–83.
    • (1967) Numerische Mathematik , vol.10 , pp. 177-183
    • Reinsch, C.H.1
  • 143
    • 11644266571 scopus 로고
    • Smoothing by spline functions ii
    • ChristianH. Reinsch (1971), “Smoothing by Spline Functions II,” Numerische Mathematik16: 451–4.
    • (1971) Numerische Mathematik , vol.16 , pp. 451-454
    • Reinsch, C.1
  • 144
    • 80052531478 scopus 로고
    • Probability contents of regions under spherical normal distributions iii: The bivariate normal integral
    • Harold Ruben (1961), “Probability Contents of Regions under Spherical Normal Distributions III: The Bivariate Normal Integral,” Annals of Mathematical Statistics32: 171–86.
    • (1961) Annals of Mathematical Statistics , vol.32 , pp. 171-186
    • Ruben, H.1
  • 146
    • 0001995852 scopus 로고
    • Some aspects of the spline smoothing approach to nonparametric regression curve fitting
    • B. W. Silverman (1985), “Some Aspects of the Spline Smoothing Approach to Nonparametric Regression Curve Fitting,” Journal of the Royal Statistical Society B47: 1–52.
    • (1985) Journal of the Royal Statistical Society B , vol.47 , pp. 1-52
    • Silverman, B.W.1
  • 147
    • 84924713206 scopus 로고
    • The numerical evaluation of the incomplete beta-function
    • Cambridge University Press
    • H. E. Soper (1921), “The Numerical Evaluation of the Incomplete Beta-Function,” in Tracts for Computers(no. 7). Cambridge University Press.
    • (1921) Tracts for Computers
    • Soper, H.E.1
  • 148
    • 0004073954 scopus 로고
    • Providence, RI: American Mathematical Society
    • G. Szego (1959), Orthogonal Polynomials. Providence, RI: American Mathematical Society.
    • (1959) Orthogonal Polynomials
    • Szego, G.1
  • 149
    • 38249001553 scopus 로고
    • An invertible approximation to the normal distribution function
    • John D. Vedder (1993), “An Invertible Approximation to the Normal Distribution Function,” Computational Statistics and Data Analysis16: 119–23.
    • (1993) Computational Statistics and Data Analysis , vol.16 , pp. 119-123
    • Vedder, J.D.1
  • 153
    • 0021620813 scopus 로고
    • A user’s guide to nonlinear optimization algorithms
    • J. E. Dennis, Jr. (1984), “A User’s Guide to Nonlinear Optimization Algorithms,” Proceedings of the IEEE72: 1765–76.
    • (1984) Proceedings of the IEEE , vol.72 , pp. 1765-1776
    • Dennis, J.E.1
  • 155
    • 0038448410 scopus 로고
    • A modified regula falsi method for computing the root of an equation
    • M. Dowell and P. Jarratt (1971), “A Modified Regula Falsi Method for Computing the Root of an Equation,” BIT11: 168–74.
    • (1971) BIT , vol.11 , pp. 168-174
    • Dowell, M.1    Jarratt, P.2
  • 156
    • 0020949717 scopus 로고
    • Algorithm 611: Subroutines for unconstrained minimization using a model/trust region approach
    • D.M. Gay (1983), “Algorithm 611: Subroutines for Unconstrained Minimization Using a Model/Trust Region Approach,” ACM Transactions on Mathematical Software9: 503–24.
    • (1983) ACM Transactions on Mathematical Software , vol.9 , pp. 503-524
    • Gay, D.M.1
  • 158
    • 84954050397 scopus 로고
    • Factorized variable metric methods for unconstrained optimization
    • D. Goldfarb (1976), “Factorized Variable Metric Methods for Unconstrained Optimization,” Mathematics of Computation30: 796–811.
    • (1976) Mathematics of Computation , vol.30 , pp. 796-811
    • Goldfarb, D.1
  • 162
    • 2942746555 scopus 로고    scopus 로고
    • Verifying the solution from a nonlinear solver: A case study
    • B. D. McCullough and H. D. Vinod (2003), “Verifying the Solution from a Nonlinear Solver: A Case Study,” The American Economic Review93: 873–91.
    • (2003) The American Economic Review , vol.93 , pp. 873-891
    • McCullough, B.D.1    Vinod, H.D.2
  • 163
    • 0000238336 scopus 로고
    • A simplex method for function minimization
    • J. A. Nelder and R. Mead (1965), “A Simplex Method for Function Minimization,” The Computer Journal7: 308–13.
    • (1965) The Computer Journal , vol.7 , pp. 308-313
    • Nelder, J.A.1    Mead, R.2
  • 164
    • 0002340344 scopus 로고
    • A new algorithm for unconstrained optimization
    • J. B. Rosen, O. L. Mangasarian, and K. Ritter (Eds.), New York: Academic Press
    • M. J. D. Powell (1970), “A New Algorithm for Unconstrained Optimization,” in J. B. Rosen, O. L. Mangasarian, and K. Ritter (Eds.), Nonlinear Programming, pp. 31–65. New York: Academic Press.
    • (1970) Nonlinear Programming , pp. 31-65
    • Powell, M.1
  • 165
    • 0001723141 scopus 로고
    • An automatic method for finding the greatest or least value of a function
    • H. Rosenbrock (1960), “An Automatic Method for Finding the Greatest or Least Value of a Function,” Computer Journal3: 175–84.
    • (1960) Computer Journal , vol.3 , pp. 175-184
    • Rosenbrock, H.1
  • 166
    • 84946640734 scopus 로고
    • Sequential application of simplex designs in optimization and evolutionary operation
    • W. Spendley, G. R. Hext, and F. R. Himsworth (1962), “Sequential Application of Simplex Designs in Optimization and Evolutionary Operation,” Technometrics4: 441–61.
    • (1962) Technometrics , vol.4 , pp. 441-461
    • Spendley, W.1    Hext, G.R.2    Himsworth, F.R.3
  • 167
    • 0024141611 scopus 로고
    • Solving systems of nonlinear equations using the nonzero value of the topological degree
    • Michael N. Vrahatis (1988), “Solving Systems of Nonlinear Equations Using the Nonzero Value of the Topological Degree,” ACM Transactions on Mathematical Software14: 312–29.
    • (1988) ACM Transactions on Mathematical Software , vol.14 , pp. 312-329
    • Vrahatis, M.N.1
  • 170
    • 0002662712 scopus 로고
    • On the existence of maximum likelihood estimates in logistic regression models
    • A. Albert and J. A. Anderson (1984), “On the Existence of Maximum Likelihood Estimates in Logistic Regression Models,” Biometrika71: 1–10.
    • (1984) Biometrika , vol.71 , pp. 1-10
    • Albert, A.1    Anderson, J.A.2
  • 172
    • 0003111416 scopus 로고
    • Calculation of intrinsic and parameter-effects curvatures for nonlinear regression models
    • D.M. Bates, D. C. Hamilton, and D. G. Watts (1983), “Calculation of Intrinsic and Parameter-Effects Curvatures for Nonlinear Regression Models,” Communications in Statistics B12: 469–77.
    • (1983) Communications in Statistics B , vol.12 , pp. 469-477
    • Bates, D.M.1    Hamilton, D.C.2    Watts, D.G.3
  • 175
    • 21144470086 scopus 로고
    • On generalized score tests
    • Dennis D. Boos (1992), “On Generalized Score Tests,” American Statistician46: 327–33.
    • (1992) American Statistician , vol.46 , pp. 327-333
    • Boos, D.D.1
  • 180
    • 0018115641 scopus 로고
    • Assessing the accuracy of the maximum likelihood estimator: Observed versus expected fisher information
    • B. Efron and D. V. Hinkley (1978), “Assessing the Accuracy of the Maximum Likelihood Estimator: Observed versus Expected Fisher Information,” Biometrika65: 457–87.
    • (1978) Biometrika , vol.65 , pp. 457-487
    • Efron, B.1    Hinkley, D.V.2
  • 181
    • 0000756680 scopus 로고
    • The estimation from individual records of the relationship between dose and quantal response
    • D. J. Finney (1947), “The Estimation from Individual Records of the Relationship Between Dose and Quantal Response,” Biometrika34: 320–34.
    • (1947) Biometrika , vol.34 , pp. 320-334
    • Finney, D.J.1
  • 182
    • 0020820869 scopus 로고
    • The analysis of rates using poisson regression models
    • E. L. Frome (1983), “The Analysis of Rates Using Poisson Regression Models,” Biometrics39: 665–74.
    • (1983) Biometrics , vol.39 , pp. 665-674
    • Frome, E.L.1
  • 184
    • 79952544057 scopus 로고
    • Nonlinear regression
    • A. R. Gallant (1975), “Nonlinear Regression,” American Statistician29: 73–81.
    • (1975) American Statistician , vol.29 , pp. 73-81
    • Gallant, A.R.1
  • 187
    • 84946263679 scopus 로고
    • Robust regression using iteratively reweighted least squares
    • Paul W. Holland and Roy E. Welsch (1977), “Robust Regression Using Iteratively Reweighted Least Squares,” Communications in StatisticsA6: 813–27.
    • (1977) Communications in Statistics , vol.6 A , pp. 813-827
    • Holland, P.W.1    Welsch, R.E.2
  • 188
    • 0001962507 scopus 로고
    • Maximum likelihood estimation by means of nonlinear least squares
    • Washington, DC: American Statistical Association
    • R. I. Jennrich and R. H. Moore (1975), “Maximum Likelihood Estimation by Means of Nonlinear Least Squares,” in Proceedings of the Statistical Computing Section, pp. 57–65.Washington, DC: American Statistical Association.
    • (1975) Proceedings of the Statistical Computing Section , pp. 57-65
    • Jennrich, R.I.1    Moore, R.H.2
  • 189
    • 0002063974 scopus 로고
    • An application of stepwise regression to non-linear estimation
    • R. I. Jennrich and P. F. Sampson (1968), “An Application of Stepwise Regression to Non-Linear Estimation,” Technometrics10: 63–72.
    • (1968) Technometrics , vol.10 , pp. 63-72
    • Jennrich, R.I.1    Sampson, P.F.2
  • 190
  • 191
    • 0010191129 scopus 로고
    • On the assumptions used to prove asymptotic normality of maximum likelihood estimators
    • L. LeCam (1970), “On the Assumptions Used to Prove Asymptotic Normality of Maximum Likelihood Estimators,” Annals of Mathematical Statistics41: 802–28.
    • (1970) Annals of Mathematical Statistics , vol.41 , pp. 802-828
    • LeCam, L.1
  • 193
    • 0000169232 scopus 로고
    • An algorithm for least-squares estimation of nonlinear parameters
    • D. Marquardt (1963), “An Algorithm for Least-Squares Estimation of Nonlinear Parameters,” SIAM Journal of Applied Mathematics11: 431–41.
    • (1963) SIAM Journal of Applied Mathematics , vol.11 , pp. 431-441
    • Marquardt, D.1
  • 195
    • 0007298102 scopus 로고
    • Fully bayesian analysis of arma time series models
    • John F. Monahan (1983), “Fully Bayesian Analysis of ARMA Time Series Models,” Journal of Econometrics21: 307–31.
    • (1983) Journal of Econometrics , vol.21 , pp. 307-331
    • Monahan, J.F.1
  • 196
    • 0001362410 scopus 로고
    • The levenberg–marquardt algorithm: Implementation and theory
    • G. A. Watson (Ed.), Lecture Notes in Mathematics, no. 630, Berlin: Springer-Verlag
    • Jorge J. Moré (1977), “The Levenberg–Marquardt Algorithm: Implementation and Theory,” in G. A. Watson (Ed.), Numerical Analysis(Lecture Notes in Mathematics, no. 630), pp. 105–16. Berlin: Springer-Verlag.
    • (1977) Numerical Analysis , pp. 105-116
    • Moré, J.J.1
  • 199
    • 0001831031 scopus 로고
    • Consistent estimates based on partially consistent observations
    • J. Neyman and E. Scott (1948), “Consistent Estimates Based on Partially Consistent Observations,” Econometrica16: 1–32.
    • (1948) Econometrica , vol.16 , pp. 1-32
    • Neyman, J.1    Scott, E.2
  • 201
    • 0001431651 scopus 로고
    • A note on a. Albert and j. a. anderson’s conditions for the existence of maximum likelihood estimates in logistic regression models
    • Thomas J. Santner and Diane E. Duffy (1986), “A Note on A. Albert and J. A. Anderson’s Conditions for the Existence of Maximum Likelihood Estimates in Logistic Regression Models,” Biometrika73: 755–58.
    • (1986) Biometrika , vol.73 , pp. 755-758
    • Santner, T.J.1    Duffy, D.E.2
  • 203
    • 3342892200 scopus 로고    scopus 로고
    • On the advantage of using two or more econometric software systems to solve the same problem
    • Houston H. Stokes (2004), “On the Advantage of Using Two or More Econometric Software Systems to Solve the Same Problem,” Journal of Economic and Social Measurement29: 307–20.
    • (2004) Journal of Economic and Social Measurement , vol.29 , pp. 307-320
    • Stokes, H.H.1
  • 204
    • 0000167944 scopus 로고
    • Note on the consistency of the maximum likelihood estimate
    • A. Wald (1949), “Note on the Consistency of the Maximum Likelihood Estimate,” Annals of Mathematical Statistics20: 595–601.
    • (1949) Annals of Mathematical Statistics , vol.20 , pp. 595-601
    • Wald, A.1
  • 205
    • 85041988327 scopus 로고
    • On the existence and uniqueness of the maximum likelihood estimates for certain generalized linear models
    • R. W. M. Wedderburn (1976), “On the Existence and Uniqueness of the Maximum Likelihood Estimates for Certain Generalized Linear Models,” Biometrika63: 27–32.
    • (1976) Biometrika , vol.63 , pp. 27-32
    • Wedderburn, R.1
  • 206
    • 0037549997 scopus 로고
    • On wald’s proof of the consistency of the maximum likelihood estimate
    • J. Wolfowitz (1949), “On Wald’s Proof of the Consistency of the Maximum Likelihood Estimate,” Annals of Mathematical Statistics20: 601–2.
    • (1949) Annals of Mathematical Statistics , vol.20 , pp. 601-602
    • Wolfowitz, J.1
  • 207
    • 0000480451 scopus 로고
    • Asymptotic theory of nonlinear least squares estimation
    • C. F. Jeff Wu (1981), “Asymptotic Theory of Nonlinear Least Squares Estimation,” Annals of Statistics9: 501–13.
    • (1981) Annals of Statistics , vol.9 , pp. 501-513
    • Jeff Wu, C.F.1
  • 208
    • 0002210265 scopus 로고
    • On the convergence properties of the em algorithm
    • C. F. JeffWu (1983), “On the Convergence Properties of the EM Algorithm,” Annals of Statistics11: 95–103.
    • (1983) Annals of Statistics , vol.11 , pp. 95-103
    • JeffWu, C.F.1
  • 213
    • 0018723248 scopus 로고
    • Quasi-random number sequences from a long-period tlp generator with remarks on application to cryptography
    • H. S. Bright and R. L. Enison (1979), “Quasi-Random Number Sequences from a Long-Period TLP Generator with Remarks on Application to Cryptography,” Computing Surveys11: 357–70.
    • (1979) Computing Surveys , vol.11 , pp. 357-370
    • Bright, H.S.1    Enison, R.L.2
  • 214
    • 21244501160 scopus 로고
    • Analysis of random number generators using monte carlo simulation
    • P. D. Coddington (1994), “Analysis of Random Number Generators Using Monte Carlo Simulation,” International Journal of Modern Physics C5: 547–60.
    • (1994) International Journal of Modern Physics C , vol.5 , pp. 547-560
    • Coddington, P.D.1
  • 215
    • 0000272653 scopus 로고
    • Randomization of number theoretic methods for multiple integration
    • R. Cranley and T. N. L. Patterson (1976), “Randomization of Number Theoretic Methods for Multiple Integration,” SIAM Journal of Numerical Analysis13: 904–14.
    • (1976) SIAM Journal of Numerical Analysis , vol.13 , pp. 904-914
    • Cranley, R.1    Patterson, T.N.2
  • 219
    • 11944269419 scopus 로고
    • Monte carlo simulations: Hidden errors from ‘good’ random number generators
    • A. M. Ferrenberg, D. P. Landau, and Y. J. Wong (1992), “Monte Carlo Simulations: Hidden Errors from ‘Good’ Random Number Generators,” Physical Review Letters69: 3382–4.
    • (1992) Physical Review Letters , vol.69 , pp. 3382-3384
    • Ferrenberg, A.M.1    Landau, D.P.2    Wong, Y.J.3
  • 220
    • 84950898939 scopus 로고
    • A statistical evaluation of multiplicative congruential generators with modulus 231−1
    • George S. Fishman and Louis R. Moore (1982), “A Statistical Evaluation of Multiplicative Congruential Generators with Modulus 231−1,” Journal of the American Statistical Association77: 129–36.
    • (1982) Journal of the American Statistical Association , vol.77 , pp. 129-136
    • Fishman, G.S.1    Moore, L.R.2
  • 221
    • 0001848202 scopus 로고
    • An exhaustive analysis of multiplicative congruential random number generators with modulus 231−1
    • George S. Fishman and Louis R. Moore (1986), “An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus 231−1,” SIAM Journal of Scientific and Statistical Computing7: 24–45.
    • (1986) SIAM Journal of Scientific and Statistical Computing , vol.7 , pp. 24-45
    • Fishman, G.S.1    Moore, L.R.2
  • 222
    • 84924713204 scopus 로고
    • Contemporary Mathematics Series, Providence, RI: American Mathematical Society
    • Nancy Flournoy and Robert K. Tsutakawa (Eds.) (1991), Statistical Multiple Integration(Contemporary Mathematics Series, vol. 115). Providence, RI: American Mathematical Society.
    • (1991) Statistical Multiple Integration , vol.115
    • Flournoy, N.1    Tsutakawa, R.K.2
  • 223
    • 0020793402 scopus 로고
    • The k-distribution of generalized feedback shift register pseudorandom numbers
    • M. Fushimi and S. Tezuka (1983), “The k-Distribution of Generalized Feedback Shift Register Pseudorandom Numbers,” Communications of the ACM26: 516–23.
    • (1983) Communications of the ACM , vol.26 , pp. 516-523
    • Fushimi, M.1    Tezuka, S.2
  • 224
    • 0001667705 scopus 로고
    • Bayesian inference in econometric models using monte carlo integration
    • John Geweke (1989), “Bayesian Inference in Econometric Models Using Monte Carlo Integration,” Econometrica57: 1317–39.
    • (1989) Econometrica , vol.57 , pp. 1317-1339
    • Geweke, J.1
  • 225
    • 30244501735 scopus 로고
    • The spectral test for the evaluation of congruential pseudo-random generators
    • Corrections in Volume 25, p. 324 (Golder) and Volume 27, pp. 375–6 (Hoaglin and King)
    • E. R. Golder (1976), “The Spectral Test for the Evaluation of Congruential Pseudo-random Generators,” Applied Statistics25: 173–80. [Corrections in Volume 25, p. 324 (Golder) and Volume 27, pp. 375–6 (Hoaglin and King).]
    • (1976) Applied Statistics , vol.25 , pp. 173-180
    • Golder, E.R.1
  • 226
    • 0000223746 scopus 로고
    • Calculation of gauss quadrature rules
    • Gene H. Golub and J. H. Welsch (1969), “Calculation of Gauss Quadrature Rules,” Mathematics of Computation23: 221–30.
    • (1969) Mathematics of Computation , vol.23 , pp. 221-230
    • Golub, G.H.1    Welsch, J.H.2
  • 227
    • 0015725594 scopus 로고
    • A monte carlo swindle for estimators of location
    • A. M. Gross (1973), “A Monte Carlo Swindle for Estimators of Location,” Applied Statistics22: 347–53.
    • (1973) Applied Statistics , vol.22 , pp. 347-353
    • Gross, A.M.1
  • 228
    • 84945708500 scopus 로고
    • Algorithm 247: Radical-inverse quasi-random pointsequence
    • J. H. Halton and G. B. Smith (1964), “Algorithm 247: Radical-Inverse Quasi-Random Point Sequence,” Communications of the ACM7: 701–2.
    • (1964) Communications of the ACM , vol.7 , pp. 701-702
    • Halton, J.H.1    Smith, G.B.2
  • 230
    • 0027866834 scopus 로고
    • A portable random number generator well suited for the rejection method
    • W. Hormann and G. Derflinger (1993), “A Portable Random Number Generator Well Suited for the Rejection Method,” ACM Transactions on Mathematical Software19: 489–95.
    • (1993) ACM Transactions on Mathematical Software , vol.19 , pp. 489-495
    • Hormann, W.1    Derflinger, G.2
  • 232
    • 0039022082 scopus 로고
    • A table of good lattice points in three dimensions
    • Gershon Kedem and S. K. Zaremba (1974), “A Table of Good Lattice Points in Three Dimensions,” Numerische Mathematik23: 175–80.
    • (1974) Numerische Mathematik , vol.23 , pp. 175-180
    • Kedem, G.1    Zaremba, S.K.2
  • 233
    • 0003657590 scopus 로고    scopus 로고
    • Seminumerical Algorithms), 3rd ed. Reading, MA: Addison-Wesley
    • Donald E. Knuth (1997), The Art of Computer Programming(vol. 2: Seminumerical Algorithms), 3rd ed. Reading, MA: Addison-Wesley.
    • (1997) The Art of Computer Programming , vol.2
    • Knuth, D.E.1
  • 236
    • 0024029607 scopus 로고
    • Efficient and portable random number generators
    • 774
    • Pierre L’Ecuyer (1988), “Efficient and Portable Random Number Generators,” Communications of the ACM31: 742–9, 774.
    • (1988) Communications of the ACM , vol.31 , pp. 742-749
    • L’Ecuyer, P.1
  • 237
    • 84976749160 scopus 로고
    • Random numbers for simulation
    • Pierre L’Ecuyer (1990), “Random Numbers for Simulation,” Communications of the ACM33: 85–97.
    • (1990) Communications of the ACM , vol.33 , pp. 85-97
    • L’Ecuyer, P.1
  • 238
    • 0002986905 scopus 로고
    • A pseudo-random number generator for the system/360
    • P. A.W. Lewis, A. S. Goodman, and J. M. Miller (1969), “A Pseudo-random Number Generator for the System/360,” IBM Systems Journal2: 136–46.
    • (1969) IBM Systems Journal , vol.2 , pp. 136-146
    • Lewis, P.1    Goodman, A.S.2    Miller, J.M.3
  • 240
  • 241
    • 0010037713 scopus 로고
    • Recherche et utilisation des ‘bons treillis.’ Programmation et resultats numeriques
    • S. K. Zaremba (Ed.), New York: Academic Press
    • Dominique Maisonneuve (1972), “Recherche et Utilisation des ‘Bons Treillis.’ Programmation et Resultats Numeriques,” in S. K. Zaremba (Ed.), Applications of Number Theory to Numerical Analysis, pp. 121–201. New York: Academic Press.
    • (1972) Applications of Number Theory to Numerical Analysis , pp. 121-201
    • Maisonneuve, D.1
  • 243
    • 0001240132 scopus 로고
    • The structure of linear congruential sequences
    • S. K. Zaremba (Ed.), New York: AcademicPress
    • George Marsaglia (1972), “The Structure of Linear Congruential Sequences,” in S. K. Zaremba (Ed.), Applications of Number Theory to Numerical Analysis, pp. 249–85. New York: Academic Press.
    • (1972) Applications of Number Theory to Numerical Analysis , pp. 249-285
    • Marsaglia, G.1
  • 245
    • 0031599142 scopus 로고    scopus 로고
    • Mersenne twister:A623-dimensionally equidistributed uniform pseudo-random number generator
    • Makoto Matsumoto and Takuji Nishimura (1998), “Mersenne Twister:A623-Dimensionally Equidistributed Uniform Pseudo-Random Number Generator,” ACM Transactions on Modeling and Computer Simulation, 8: 3–30.
    • (1998) ACM Transactions on Modeling and Computer Simulation , vol.8 , pp. 3-30
    • Matsumoto, M.1    Nishimura, T.2
  • 246
    • 0002582460 scopus 로고
    • The approximation of multiple integrals by using interpolatory cubature formulae
    • R. A. DeVore and K. Scherer (Eds.), New York: Academic Press
    • I. P. Mysovskikh (1980), “The Approximation of Multiple Integrals by using Interpolatory Cubature Formulae,” in R. A. DeVore and K. Scherer (Eds.), Quantitative Approximation, pp. 217–43. New York: Academic Press.
    • (1980) Quantitative Approximation , pp. 217-243
    • Mysovskikh, I.P.1
  • 247
  • 248
    • 0007331677 scopus 로고
    • Statistical analysis of generalized feedback shift register pseudorandom generators
    • Harald Neiderreiter (1987), “Statistical Analysis of Generalized Feedback Shift Register Pseudorandom Generators,” SIAM Journal of Scientific and Statistical Computing8: 1035–51.
    • (1987) SIAM Journal of Scientific and Statistical Computing , vol.8 , pp. 1035-1051
    • Neiderreiter, H.1
  • 251
    • 0024090481 scopus 로고
    • Random number generators: Good ones are hard to find
    • Stephen K. Park and KeithW. Miller (1988), “Random Number Generators: Good Ones Are Hard to Find,” Communications of the ACM31: 1192–1201.
    • (1988) Communications of the ACM , vol.31 , pp. 1192-1201
    • Park, S.K.1    Miller, K.2
  • 253
    • 0001438071 scopus 로고
    • Discrepancy and integration of continuous functions
    • P. D. Proinov (1988), “Discrepancy and Integration of Continuous Functions,” Journal of Approximation Theory52: 121–31.
    • (1988) Journal of Approximation Theory , vol.52 , pp. 121-131
    • Proinov, P.D.1
  • 254
    • 84919150784 scopus 로고
    • Variance reduction techniques for monte carlo sampling from student distributions
    • Daniel A. Relles (1970), “Variance Reduction Techniques for Monte Carlo Sampling from Student Distributions,” Technometrics12: 499–515.
    • (1970) Technometrics , vol.12 , pp. 499-515
    • Relles, D.A.1
  • 255
    • 0011158003 scopus 로고
    • Computer generation of random variables: Atutorial
    • Brian D. Ripley (1983), “Computer Generation of Random Variables: ATutorial,” International Statistical Review51: 301–19.
    • (1983) International Statistical Review , vol.51 , pp. 301-319
    • Ripley, B.D.1
  • 257
    • 0018478675 scopus 로고
    • A more portable fortran random number generator
    • Linus Schrage (1979), “A More Portable Fortran Random Number Generator,” ACM Transactions on Mathematical Software5: 132–8.
    • (1979) ACM Transactions on Mathematical Software , vol.5 , pp. 132-138
    • Schrage, L.1
  • 258
    • 0039216813 scopus 로고
    • Computer simulation swindles, with applications to estimates of location and dispersion
    • Gary Simon (1976), “Computer Simulation Swindles, with Applications to Estimates of Location and Dispersion,” Applied Statistics25: 266–74.
    • (1976) Applied Statistics , vol.25 , pp. 266-274
    • Simon, G.1
  • 261
    • 0021375677 scopus 로고
    • Monte carlo comparison of anova, mivque, reml, and ml estimators of variance components
    • William H. Swallow and John F. Monahan (1984), “Monte Carlo Comparison of ANOVA, MIVQUE, REML, and ML Estimators of Variance Components,” Technometrics26: 47–57.
    • (1984) Technometrics , vol.26 , pp. 47-57
    • Swallow, W.H.1    Monahan, J.F.2
  • 262
    • 84968520264 scopus 로고
    • Random numbers generated by linear recurrence modulo two
    • R. C. Tausworthe (1965), “Random Numbers Generated by Linear Recurrence Modulo Two,” Mathematics of Computation19: 201–9.
    • (1965) Mathematics of Computation , vol.19 , pp. 201-209
    • Tausworthe, R.C.1
  • 264
    • 0001312511 scopus 로고
    • Algorithm as 183: An efficient and portable pseudorandom number generator
    • 33: 123
    • B. A. Wichmann and J. D. Hill (1982), “Algorithm AS 183: An Efficient and Portable Pseudorandom Number Generator,” Applied Statistics31: 188–90; 33: 123.
    • (1982) Applied Statistics , vol.31 , pp. 188-190
    • Wichmann, B.A.1    Hill, J.D.2
  • 265
    • 0002624038 scopus 로고
    • Exact conditional tests for cross- classifications: Approximation of attained significance levels
    • Alan Agresti, Dennis Wackerly, and James M. Boyett (1979), “Exact Conditional Tests for Cross- Classifications: Approximation of Attained Significance Levels,” Psychometrika44: 75–83.
    • (1979) Psychometrika , vol.44 , pp. 75-83
    • Agresti, A.1    Wackerly, D.2    Boyett, J.M.3
  • 266
    • 0015967277 scopus 로고
    • Computer methods for sampling from gamma, beta, poisson, and normal distributions
    • J. H. Ahrens and U. Dieter (1974), “Computer Methods for Sampling from Gamma, Beta, Poisson, and Normal Distributions,” Computing12: 223–46.
    • (1974) Computing , vol.12 , pp. 223-246
    • Ahrens, J.H.1    Dieter, U.2
  • 267
    • 0001953226 scopus 로고
    • A convenient sampling method with bounded computation times for poisson distributions
    • Peter R. Nelson (Ed.), Columbus, OH: American Sciences Press
    • J. H. Ahrens and U. Dieter (1991), “A Convenient Sampling Method with Bounded Computation Times for Poisson Distributions,” in Peter R. Nelson (Ed.), The Frontiers of Statistical Computation, Simulation and Modeling, pp. 137–49. Columbus, OH: American Sciences Press.
    • (1991) The Frontiers of Statistical Computation, Simulation and Modeling , pp. 137-149
    • Ahrens, J.H.1    Dieter, U.2
  • 269
    • 0001541731 scopus 로고
    • A note on the generation of random normal deviates
    • George E. P. Box and Mervin E. Muller (1958), “A Note on the Generation of Random Normal Deviates,” Annals of Mathematical Statistics29: 610–11.
    • (1958) Annals of Mathematical Statistics , vol.29 , pp. 610-611
    • Box, G.E.P.1    Muller, M.E.2
  • 273
    • 84968518347 scopus 로고
    • Von neumann’s comparison method for random sampling from normal and other distributions
    • George Forsythe (1972), “Von Neumann’s Comparison Method for Random Sampling from Normal and Other Distributions,” Mathematics of Computation26: 817–26.
    • (1972) Mathematics of Computation , vol.26 , pp. 817-826
    • Forsythe, G.1
  • 274
    • 0000148038 scopus 로고
    • Computer generation of random variables using the ratio of uniform deviates
    • Albert J. Kinderman and John F. Monahan (1977), “Computer Generation of Random Variables Using the Ratio of Uniform Deviates,” ACM Transactions on Mathematical Software3: 257–60.
    • (1977) ACM Transactions on Mathematical Software , vol.3 , pp. 257-260
    • Kinderman, A.J.1    Monahan, J.F.2
  • 275
    • 0003303959 scopus 로고
    • New methods for generating student’s t and gamma variables
    • Albert J. Kinderman and John F. Monahan (1980), “New Methods for Generating Student’s t and Gamma Variables,” Computing25: 369–77.
    • (1980) Computing , vol.25 , pp. 369-377
    • Kinderman, A.J.1    Monahan, J.F.2
  • 276
    • 84966226104 scopus 로고
    • Computer methods for sampling from student’s t distribution
    • Albert J. Kinderman, John F. Monahan, and John G. Ramage (1977), “Computer Methods for Sampling from Student’s t Distribution,” Mathematics of Computation31: 1009–18.
    • (1977) Mathematics of Computation , vol.31 , pp. 1009-1018
    • Kinderman, A.J.1    Monahan, J.F.2    Ramage, J.G.3
  • 277
    • 0003657590 scopus 로고    scopus 로고
    • Seminumerical Algorithms), 3rd ed. Reading, MA: Addison-Wesley
    • Donald E. Knuth (1997), The Art of Computer Programming(vol. 2: Seminumerical Algorithms), 3rd ed. Reading, MA: Addison-Wesley.
    • (1997) The Art of Computer Programming , vol.2
    • Knuth, D.E.1
  • 278
    • 0011955637 scopus 로고
    • On the alias method for generating random variables from a discrete distribution
    • Richard A. Kronmal and ArthurV. Peterson, Jr. (1979), “On the Alias Method for Generating Random Variables from a Discrete Distribution,” American Statistician33: 214–18.
    • (1979) American Statistician , vol.33 , pp. 214-218
    • Kronmal, R.A.1    Peterson, A.2
  • 279
    • 0013505888 scopus 로고
    • An extremely portable random number generator
    • Joseph B. Kruskal (1969), “An Extremely Portable Random Number Generator,” Communications of the ACM12: 93–4.
    • (1969) Communications of the ACM , vol.12 , pp. 93-94
    • Kruskal, J.B.1
  • 281
    • 0007259483 scopus 로고
    • Generating exponential random variables
    • George Marsaglia (1961), “Generating Exponential Random Variables,” Annals of Mathematical Statistics32: 899–902.
    • (1961) Annals of Mathematical Statistics , vol.32 , pp. 899-902
    • Marsaglia, G.1
  • 282
    • 0000284806 scopus 로고
    • A convenient method for generating normal variables
    • George Marsaglia and T. A. Bray (1964), “A Convenient Method for Generating Normal Variables,” SIAM Review6: 260–4.
    • (1964) SIAM Review , vol.6 , pp. 260-264
    • Marsaglia, G.1    Bray, T.A.2
  • 283
    • 84924713203 scopus 로고
    • Extensions of von neumann’s method for generating random variables
    • John F. Monahan (1979), “Extensions of von Neumann’s Method for Generating Random Variables,” Mathematics of Computation33: 1065–9.
    • (1979) Mathematics of Computation , vol.33 , pp. 1065-1069
    • Monahan, J.F.1
  • 284
    • 84966239426 scopus 로고
    • Accuracy in random number generation
    • John F. Monahan (1985), “Accuracy in Random Number Generation,” Mathematics of Computation45: 559–68.
    • (1985) Mathematics of Computation , vol.45 , pp. 559-568
    • Monahan, J.F.1
  • 285
    • 0023363501 scopus 로고
    • An algorithm for generating chi random variables
    • John F. Monahan (1987), “An Algorithm for Generating Chi Random Variables,” ACM Transactions on Mathematical Software13: 168–72.
    • (1987) ACM Transactions on Mathematical Software , vol.13 , pp. 168-172
    • Monahan, J.F.1
  • 286
    • 0039638471 scopus 로고
    • On using the box–muller transformation with multiplicative congruential pseudo-random number generators
    • Henry R. Neave (1973), “On Using the Box–Muller Transformation with Multiplicative Congruential Pseudo-random Number Generators,” Applied Statistics22: 92–7.
    • (1973) Applied Statistics , vol.22 , pp. 92-97
    • Neave, H.R.1
  • 289
    • 0008266358 scopus 로고
    • Algorithm as 53:Wishart variate generator
    • W. B. Smith and R. R. Hocking (1972), “Algorithm AS 53:Wishart Variate Generator,” Applied Statistics21: 341–5.
    • (1972) Applied Statistics , vol.21 , pp. 341-345
    • Smith, W.B.1    Hocking, R.R.2
  • 290
    • 0347165885 scopus 로고
    • Sampling from poisson, binomial and hypergeometric distributions: Ratio of uniforms as a simple and fast alternative
    • Forschungsgesellschaft Joanneum, Graz, Austria
    • Ernst Stadlober (1989), “Sampling from Poisson, Binomial and Hypergeometric Distributions: Ratio of Uniforms as a Simple and Fast Alternative,” Mathematisch–Statistische Sektion 303. Forschungsgesellschaft Joanneum, Graz, Austria.
    • (1989) Mathematisch–Statistische Sektion , pp. 303
    • Stadlober, E.1
  • 291
    • 38249020270 scopus 로고
    • The ratio of uniforms approach for generating discrete random variables
    • Ernst Stadlober (1990), “The Ratio of Uniforms Approach for Generating Discrete Random Variables,” Journal of Computational and Applied Mathematics31: 181–9.
    • (1990) Journal of Computational and Applied Mathematics , vol.31 , pp. 181-189
    • Stadlober, E.1
  • 292
    • 84882096159 scopus 로고
    • Binomial random variate generation: A method based on ratio of uniforms
    • Peter R. Nelson (Ed.), Columbus, OH: American Sciences Press
    • Ernst Stadlober (1991), “Binomial Random Variate Generation: A Method Based on Ratio of Uniforms,” in Peter R. Nelson (Ed.), The Frontiers of Statistical Computation, Simulation and Modeling, pp. 93–112. Columbus, OH: American Sciences Press.
    • (1991) The Frontiers of Statistical Computation, Simulation and Modeling , pp. 93-112
    • Stadlober, E.1
  • 293
    • 0023315240 scopus 로고
    • An efficient algorithm for sequential random sampling
    • Jeffrey S. Vitter (1987), “An Efficient Algorithm for Sequential Random Sampling,” ACM Transactions on Mathematical Software13: 58–67.
    • (1987) ACM Transactions on Mathematical Software , vol.13 , pp. 58-67
    • Vitter, J.S.1
  • 294
    • 0003087344 scopus 로고
    • Various techniques in connection with random digits
    • AMS 12, Washington, DC: National Bureau of Standards
    • John von Neumann (1951), “Various Techniques in Connection with Random Digits,” in Monte Carlo Method(AMS 12), pp. 36–8.Washington, DC: National Bureau of Standards.
    • (1951) Monte Carlo Method , pp. 36-38
    • Neumann, J.V.1
  • 295
    • 0001285808 scopus 로고
    • An efficient method for generating random variables with general distributions
    • Alastair J. Walker (1977), “An Efficient Method for Generating Random Variables with General Distributions,” ACM Transactions on Mathematical Software3: 253–6.
    • (1977) ACM Transactions on Mathematical Software , vol.3 , pp. 253-256
    • Walker, A.J.1
  • 297
    • 0021375203 scopus 로고
    • Using extreme value theory to estimate large percentiles
    • Dennis D. Boos (1984), “Using Extreme Value Theory to Estimate Large Percentiles,” Technometrics26: 33–9.
    • (1984) Technometrics , vol.26 , pp. 33-39
    • Boos, D.D.1
  • 298
    • 0001215143 scopus 로고
    • Evaluation of an unknown distribution density from observations
    • N. N. Cencov (1962), “Evaluation of an Unknown Distribution Density from Observations,” Soviet Mathematics3: 1559–62.
    • (1962) Soviet Mathematics , vol.3 , pp. 1559-1562
    • Cencov, N.N.1
  • 299
    • 0000642942 scopus 로고
    • Some methods for strengthening the common χ2 tests
    • William G. Cochran (1954), “Some Methods for Strengthening the Common χ2 Tests,” Biometrics10: 417–51.
    • (1954) Biometrics , vol.10 , pp. 417-451
    • Cochran, W.G.1
  • 300
    • 0000272653 scopus 로고
    • Randomization of number theoretic methods for multiple integration
    • R. Cranley and T. N. L. Patterson (1976), “Randomization of Number Theoretic Methods for Multiple Integration,” SIAM Journal on Numerical Analysis13: 904–14.
    • (1976) SIAM Journal on Numerical Analysis , vol.13 , pp. 904-914
    • Cranley, R.1    Patterson, T.N.2
  • 302
    • 0040061088 scopus 로고    scopus 로고
    • Stochastic integration rules for infinite regions
    • Alan Genz and John Monahan (1998), “Stochastic Integration Rules for Infinite Regions,” SIAM Journal of Scientific Computation19: 426–39.
    • (1998) SIAM Journal of Scientific Computation , vol.19 , pp. 426-439
    • Genz, A.1    Monahan, J.2
  • 303
    • 0001667705 scopus 로고
    • Bayesian inference in econometric models using monte carlo integration
    • John Geweke (1989), “Bayesian Inference in Econometric Models Using Monte Carlo Integration,” Econometrica57: 1317–39.
    • (1989) Econometrica , vol.57 , pp. 1317-1339
    • Geweke, J.1
  • 304
    • 0001618329 scopus 로고
    • On asymptotic normality of hill’s estimator for the exponent of regular variation
    • E. Haeusler and J. L. Teugels (1985), “On Asymptotic Normality of Hill’s Estimator for the Exponent of Regular Variation,” Annals of Statistics13: 743–56.
    • (1985) Annals of Statistics , vol.13 , pp. 743-756
    • Haeusler, E.1    Teugels, J.L.2
  • 305
    • 0002407801 scopus 로고
    • On some simple estimates of an exponent of regular variation
    • P. Hall (1982), “On Some Simple Estimates of an Exponent of Regular Variation,” Journal of the Royal Statistical Society B44: 37–42.
    • (1982) Journal of the Royal Statistical Society B , vol.44 , pp. 37-42
    • Hall, P.1
  • 306
    • 0001189848 scopus 로고
    • Algorithm as127: Generation of random orthogonal matrices
    • Richard M. Heiberger (1978), “Algorithm AS127: Generation of Random Orthogonal Matrices,” Applied Statistics27: 199–206.
    • (1978) Applied Statistics , vol.27 , pp. 199-206
    • Heiberger, R.M.1
  • 307
    • 78649424388 scopus 로고
    • Weighted average importance sampling and defensive mixture distributions
    • Tim Hesterberg (1995), “Weighted Average Importance Sampling and Defensive Mixture Distributions,” Technometrics37: 185–94.
    • (1995) Technometrics , vol.37 , pp. 185-194
    • Hesterberg, T.1
  • 308
    • 0001263124 scopus 로고
    • A simple general approach to inference about the tail of a distribution
    • B.W. Hill (1975), “A Simple General Approach to Inference about the Tail of a Distribution,” Annals of Statistics3: 1163–74.
    • (1975) Annals of Statistics , vol.3 , pp. 1163-1174
    • Hill, B.W.1
  • 309
    • 0000584710 scopus 로고
    • On the choice of the number of class intervals in the application of the chi-square test
    • H. B. Mann and A. Wald (1942), “On the Choice of the Number of Class Intervals in the Application of the Chi-Square Test,” Annals of Mathematical Statistics13: 306–17.
    • (1942) Annals of Mathematical Statistics , vol.13 , pp. 306-317
    • Mann, H.B.1    Wald, A.2
  • 310
    • 33747748502 scopus 로고
    • Testing the behavior of importance sampling weights
    • J. F. Monahan (1993), “Testing the Behavior of Importance Sampling Weights,” Computing Science and Statistics24: 112–17.
    • (1993) Computing Science and Statistics , vol.24 , pp. 112-117
    • Monahan, J.F.1
  • 311
  • 312
    • 0001773114 scopus 로고
    • Tests of chi-squared type
    • R. B. D’Agostino and M. A. Stephens (Eds.), New York: Marcel Dekker
    • David S. Moore (1986), “Tests of Chi-Squared Type,” in R. B. D’Agostino and M. A. Stephens (Eds.), Goodness-of-Fit Techniques, pp. 63–95. New York: Marcel Dekker.
    • (1986) Goodness-Of-Fit Techniques , pp. 63-95
    • Moore, D.S.1
  • 313
    • 0000367077 scopus 로고
    • An investigation of the restraints with respect to sample size commonly imposed on the use of chi–square statistic
    • J. T. Roscoe and J. A. Byars (1971), “An Investigation of the Restraints with Respect to Sample Size Commonly Imposed on the Use of Chi–Square Statistic,” Journal of the American Statistical Association66: 755–9.
    • (1971) Journal of the American Statistical Association , vol.66 , pp. 755-759
    • Roscoe, J.T.1    Byars, J.A.2
  • 314
    • 0000643826 scopus 로고
    • Unbiased monte carlo integration methods with exactness for low order polynomials
    • A. F. Siegel and F. O’Brien (1985), “Unbiased Monte Carlo Integration Methods with Exactness for Low Order Polynomials,” SIAM Journal on Scientific and Statistical Computing6: 169–81.
    • (1985) SIAM Journal on Scientific and Statistical Computing , vol.6 , pp. 169-181
    • Siegel, A.F.1    O’Brien, F.2
  • 316
    • 0001893703 scopus 로고
    • On the estimation of the discrepancy between empirical curves of distribution for two independent samples (In russian)
    • N. V. Smirnov (1939), “On the Estimation of the Discrepancy between Empirical Curves of Distribution for Two Independent Samples” (in Russian), Bulletin of Moscow University2: 3–16.
    • (1939) Bulletin of Moscow University , vol.2 , pp. 3-16
    • Smirnov, N.V.1
  • 317
    • 0000634854 scopus 로고
    • Use of the kolmogorov–smirnov, cramer–von mises and related statistics without extensive tables
    • Michael A. Stephens (1970), “Use of the Kolmogorov–Smirnov, Cramer–von Mises and Related Statistics without Extensive Tables,” Journal of the Royal Statistical Society B32: 115–22.
    • (1970) Journal of the Royal Statistical Society B , vol.32 , pp. 115-122
    • Stephens, M.A.1
  • 318
    • 0002878311 scopus 로고
    • Tests based on edf statistics
    • R. B. D’Agostino and M. A. Stephens (Eds.), New York: Marcel Dekker
    • Michael A. Stephens (1986), “Tests Based on EDF Statistics,” in R. B. D’Agostino and M. A. Stephens (Eds.), Goodness-of-Fit Techniques, pp. 97–193. New York: Marcel Dekker.
    • (1986) Goodness-Of-Fit Techniques , pp. 97-193
    • Stephens, M.A.1
  • 319
    • 0000485973 scopus 로고
    • The efficient generation of random orthogonal matrices with an application to condition estimation
    • G.W. Stewart (1980), “The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimation,” SIAM Journal on Numerical Analysis17: 403–9.
    • (1980) SIAM Journal on Numerical Analysis , vol.17 , pp. 403-409
    • Stewart, G.W.1
  • 320
    • 0007549740 scopus 로고
    • Remark asr42. A remark on as127. generation of random orthogonal matrices
    • Martin A. Tanner and Ronald A. Thisted (1982), “Remark ASR42. A Remark on AS127. Generation of Random Orthogonal Matrices,” Applied Statistics31: 190–92.
    • (1982) Applied Statistics , vol.31 , pp. 190-192
    • Tanner, M.A.1    Thisted, R.A.2
  • 322
    • 84950871099 scopus 로고
    • Accurate approximations for posterior moments and marginal densities
    • Luke Tierney and Joseph B. Kadane (1986), “Accurate Approximations for Posterior Moments and Marginal Densities,” Journal of the American Statistical Association81: 82–6.
    • (1986) Journal of the American Statistical Association , vol.81 , pp. 82-86
    • Tierney, L.1    Kadane, J.B.2
  • 323
    • 0001560641 scopus 로고
    • Fully exponential laplace approximations to expectations and variances of non positive functions
    • Luke Tierney, Robert E. Kass, and Joseph B. Kadane (1989), “Fully Exponential Laplace Approximations to Expectations and Variances of Non positive Functions,” Journal of the American Statistical Association84: 710–16.
    • (1989) Journal of the American Statistical Association , vol.84 , pp. 710-716
    • Tierney, L.1    Kass, R.E.2    Kadane, J.B.3
  • 324
    • 0002336995 scopus 로고
    • Interpolating spline methods for density estimation i: Equi-spaced knots
    • Grace Wahba (1975), “Interpolating Spline Methods for Density Estimation I: Equi-Spaced Knots,” Annals of Statistics3: 30–48.
    • (1975) Annals of Statistics , vol.3 , pp. 30-48
    • Wahba, G.1
  • 326
    • 84936167519 scopus 로고
    • Estimation of parameters and large quantiles based on the k largest observations
    • I. Weissman (1978), “Estimation of Parameters and Large Quantiles Based on the k Largest Observations,” Journal of the American Statistical Association73: 812–15
    • (1978) Journal of the American Statistical Association , vol.73 , pp. 812-815
    • Weissman, I.1
  • 331
    • 84937730674 scopus 로고
    • Explaining the gibbs sampler
    • George Casella and Edward I. George (1992), “Explaining the Gibbs Sampler,” American Statistician46: 167–74.
    • (1992) American Statistician , vol.46 , pp. 167-174
    • Casella, G.1    George, E.I.2
  • 332
    • 0000576596 scopus 로고
    • Discussion of “markov chains for exploring posterior distributions” (By l. tierney)
    • K. S. Chan and C. J. Geyer (1994), Discussion of “Markov Chains for Exploring Posterior Distributions” (by L. Tierney), Annals of Statistics22: 1747–58.
    • (1994) Annals of Statistics , vol.22 , pp. 1747-1758
    • Chan, K.S.1    Geyer, C.J.2
  • 333
    • 32344446687 scopus 로고
    • Understanding the metropolis–hastings algorithm
    • Siddhartha Chib and Edward Greenberg (1995), “Understanding the Metropolis–Hastings Algorithm,” American Statistician49: 327–35.
    • (1995) American Statistician , vol.49 , pp. 327-335
    • Chib, S.1    Greenberg, E.2
  • 334
    • 0030539336 scopus 로고    scopus 로고
    • Markov chain monte carlo convergence diagnostics: A comparative review
    • Mary Kathryn Cowles and Bradley P. Carlin (1996), “Markov Chain Monte Carlo Convergence Diagnostics: A Comparative Review,” Journal of the American Statistical Association91: 883–904.
    • (1996) Journal of the American Statistical Association , vol.91 , pp. 883-904
    • Cowles, M.K.1    Carlin, B.P.2
  • 335
    • 0039644192 scopus 로고
    • Bayesian inference for generalized linear and proportional hazards models via gibbs sampling
    • P. Dellaportas and A. F. M. Smith (1993), “Bayesian Inference for Generalized Linear and Proportional Hazards Models via Gibbs Sampling,” Applied Statistics42: 443–59.
    • (1993) Applied Statistics , vol.42 , pp. 443-459
    • Dellaportas, P.1    Smith, A.F.2
  • 336
    • 0021604288 scopus 로고
    • A simple algorithm for generating random variates with a log-concave density
    • Luc Devroye (1984), “A Simple Algorithm for Generating Random Variates with a Log-Concave Density,” Computing33: 247–57.
    • (1984) Computing , vol.33 , pp. 247-257
    • Devroye, L.1
  • 338
    • 0001330444 scopus 로고
    • Estimation of time response curves and their confidence bands
    • R. C. Elston and J. F. Grizzle (1962), “Estimation of Time Response Curves and Their Confidence Bands,” Biometrics18: 148–59.
    • (1962) Biometrics , vol.18 , pp. 148-159
    • Elston, R.C.1    Grizzle, J.F.2
  • 341
    • 0001032162 scopus 로고
    • A single sequence from the gibbs sampler gives a false sense of security
    • J. M. Bernardo, J. O. Berger, A. P. Dawid, and A. F. M. Smith (Eds.), Oxford, U.K.: Oxford University Press
    • Andrew Gelman and Donald B. Rubin (1992a), “A Single Sequence from the Gibbs Sampler Gives a False Sense of Security,” in J. M. Bernardo, J. O. Berger, A. P. Dawid, and A. F. M. Smith (Eds.), Bayesian Statistics4, pp. 625–31. Oxford, U.K.: Oxford University Press.
    • (1992) Bayesian Statistics , vol.4 , pp. 625-631
    • Gelman, A.1    Rubin, D.B.2
  • 342
    • 84972492387 scopus 로고
    • Inference from iterative simulation using multiple sequences
    • Andrew Gelman and Donald B. Rubin (1992b), “Inference from Iterative Simulation Using Multiple Sequences,” Statistical Science7: 457–511.
    • (1992) Statistical Science , vol.7 , pp. 457-511
    • Gelman, A.1    Rubin, D.B.2
  • 344
    • 0001032163 scopus 로고
    • Evaluating the accuracy of sampling-based approaches to the calculation of posterior moments
    • J. M. Bernardo, J. O. Berger, A. P. Dawid, and A. F. M. Smith (Eds.), Oxford, U.K.: Oxford University Press
    • J. Geweke (1992), “Evaluating the Accuracy of Sampling-Based Approaches to the Calculation of Posterior Moments,” in J. M. Bernardo, J. O. Berger, A. P. Dawid, and A. F. M. Smith (Eds.), Bayesian Statistics4, pp. 169–93. Oxford, U.K.: Oxford University Press.
    • (1992) Bayesian Statistics , vol.4 , pp. 169-193
    • Geweke, J.1
  • 345
    • 84972511893 scopus 로고
    • Practical markov chain monte carlo
    • Charles J. Geyer (1992), “Practical Markov Chain Monte Carlo,” Statistical Science7: 473–511.
    • (1992) Statistical Science , vol.7 , pp. 473-511
    • Geyer, C.J.1
  • 346
    • 0001422224 scopus 로고
    • Derivative-free adaptive rejection sampling for gibbs sampling
    • J. M. Bernardo, J. O. Berger, A. P. Dawid, and A. F. M. Smith (Eds.), Oxford, U.K.: Oxford University Press
    • W. R. Gilks (1992), “Derivative-Free Adaptive Rejection Sampling for Gibbs Sampling,” in J. M. Bernardo, J. O. Berger, A. P. Dawid, and A. F. M. Smith (Eds.), Bayesian Statistics4, pp. 641–9. Oxford, U.K.: Oxford University Press.
    • (1992) Bayesian Statistics , vol.4 , pp. 641-649
    • Gilks, W.R.1
  • 347
    • 0038312668 scopus 로고
    • Adaptive rejection metropolis sampling within gibbs sampling
    • W. R. Gilks, N. G. Best, and K. K. C. Tan (1995), “Adaptive Rejection Metropolis Sampling within Gibbs Sampling,” Applied Statistics44: 455–72.
    • (1995) Applied Statistics , vol.44 , pp. 455-472
    • Gilks, W.R.1    Best, N.G.2    Tan, K.K.3
  • 349
    • 0000324169 scopus 로고
    • Adaptive rejection sampling for gibbs sampling
    • W. R. Gilks and P. Wild (1992), “Adaptive Rejection Sampling for Gibbs Sampling,” Applied Statistics41: 337–48.
    • (1992) Applied Statistics , vol.41 , pp. 337-348
    • Gilks, W.R.1    Wild, P.2
  • 350
    • 77956890234 scopus 로고
    • Monte carlo sampling methods using markov chains and their applications
    • W. K. Hastings (1970), “Monte Carlo Sampling Methods Using Markov Chains and Their Applications,” Biometrika57: 97–109.
    • (1970) Biometrika , vol.57 , pp. 97-109
    • Hastings, W.K.1
  • 351
    • 0020850136 scopus 로고
    • Simulation run length control in the presence of an initial transient
    • P. Heidelberger and P. D. Welch (1983), “Simulation Run Length Control in the Presence of an Initial Transient,” Operations Research31: 1109–44.
    • (1983) Operations Research , vol.31 , pp. 1109-1144
    • Heidelberger, P.1    Welch, P.D.2
  • 352
    • 0030327881 scopus 로고    scopus 로고
    • The effect of improper priors on gibbs sampling in hierarchical linear models
    • James P. Hobert and George Casella (1996), “The Effect of Improper Priors on Gibbs Sampling in Hierarchical Linear Models,” Journal of the American Statistical Association91: 1461–73.
    • (1996) Journal of the American Statistical Association , vol.91 , pp. 1461-1473
    • Hobert, J.P.1    Casella, G.2
  • 353
    • 0032382838 scopus 로고    scopus 로고
    • Markov chain monte carlo in practice: A roundtable discussion
    • Robert E. Kass, Bradley P. Carlin, Andrew Gelman, and Radford M. Neal (1998), “Markov Chain Monte Carlo in Practice: A Roundtable Discussion,” American Statistician52: 93–100.
    • (1998) American Statistician , vol.52 , pp. 93-100
    • Kass, R.E.1    Carlin, B.P.2    Gelman, R.3    Neal, R.M.4
  • 354
    • 0003011474 scopus 로고    scopus 로고
    • Automatic sampling with the ratio-of-uniforms method
    • Josef Leydold (2000), “Automatic Sampling with the Ratio-of-Uniforms Method,” ACM Transactions on Mathematical Software26: 78–98.
    • (2000) ACM Transactions on Mathematical Software , vol.26 , pp. 78-98
    • Leydold, J.1
  • 358
    • 0000759236 scopus 로고
    • How many iterations in the gibbs sampler?
    • J. M. Bernardo, J. O. Berger, A. P. Dawid, and A. F. M. Smith (Eds.), Oxford, U.K.: Oxford University Press
    • A. E. Raftery and S. Lewis (1992), “How Many Iterations in the Gibbs Sampler?” in J. M. Bernardo, J. O. Berger, A. P. Dawid, and A. F. M. Smith (Eds.), Bayesian Statistics4, pp. 763–73. Oxford, U.K.: Oxford University Press.
    • (1992) Bayesian Statistics , vol.4 , pp. 763-773
    • Raftery, A.E.1    Lewis, S.2
  • 361
    • 77957068681 scopus 로고
    • Simulation experiments
    • D. P. Heyman and M. J. Sobel (Eds.), Stochastic Models, Amsterdam: North-Holland
    • Bruce Schmeiser (1990), “Simulation Experiments,” in D. P. Heyman and M. J. Sobel (Eds.), Handbooks in Operations Research and Management Science(vol. 2: Stochastic Models), pp. 295–330. Amsterdam: North-Holland.
    • (1990) Handbooks in Operations Research and Management Science , vol.2 , pp. 295-330
    • Schmeiser, B.1
  • 364
    • 0000576595 scopus 로고
    • Markov chains for exploring posterior distributions
    • (with discussion)
    • Luke Tierney (1994), “Markov Chains for Exploring Posterior Distributions” (with discussion), Annals of Statistics22: 1701–62.
    • (1994) Annals of Statistics , vol.22 , pp. 1701-1762
    • Tierney, L.1
  • 365
    • 0001789959 scopus 로고
    • Introduction to general state-space markov chain theory
    • W. R. Gilks, S. Richardson, and D. J. Spiegelhalter (Eds.), London: Chapman & Hall
    • Luke Tierney (1995), “Introduction to General State-Space Markov Chain Theory,” in W. R. Gilks, S. Richardson, and D. J. Spiegelhalter (Eds.), Markov Chain Monte Carlo in Practice. London: Chapman & Hall.
    • (1995) Markov Chain Monte Carlo in Practice
    • Tierney, L.1
  • 368
    • 0014905463 scopus 로고
    • A linear filtering approach to the computation of the discrete fourier transform
    • L. I. Bluestein (1970), “A Linear Filtering Approach to the Computation of the Discrete Fourier Transform,” IEEE Transactions on Audio and Electroacoustics18: 451–5.
    • (1970) IEEE Transactions on Audio and Electroacoustics , vol.18 , pp. 451-455
    • Bluestein, L.I.1
  • 369
    • 0141496677 scopus 로고
    • Numerical inversions of characteristic functions
    • Harald Bohman (1975), “Numerical Inversions of Characteristic Functions,” Scandinavian Actuarial Journal, pp. 121–4.
    • (1975) Scandinavian Actuarial Journal , pp. 121-124
    • Bohman, H.1
  • 370
    • 84924697028 scopus 로고
    • Algorithm 29: Permutation of the elements of a vector
    • J. Boothroyd (1967), “Algorithm 29: Permutation of the Elements of a Vector,” Computer Journal10: 311.
    • (1967) Computer Journal , vol.10 , pp. 311
    • Boothroyd, J.1
  • 372
    • 84968470212 scopus 로고
    • An algorithm for the machine calculation of complex fourier series
    • J.W. Cooley and J.W. Tukey (1965), “An Algorithm for the Machine Calculation of Complex Fourier Series,” Mathematics of Computation19: 297–301.
    • (1965) Mathematics of Computation , vol.19 , pp. 297-301
    • Cooley, J.W.1    Tukey, J.W.2
  • 375
    • 85041932786 scopus 로고
    • Numerical inversion of a characteristic function
    • R. B. Davies (1975), “Numerical Inversion of a Characteristic Function,” Biometrika60: 415–17.
    • (1975) Biometrika , vol.60 , pp. 415-417
    • Davies, R.B.1
  • 376
    • 0001008882 scopus 로고
    • Ass 155: The distribution of a linear combination of chi-squared random variables
    • Robert B. Davies (1980), “ASS 155: The Distribution of a Linear Combination of Chi-Squared Random Variables,” Applied Statistics29: 323–33.
    • (1980) Applied Statistics , vol.29 , pp. 323-333
    • Davies, R.B.1
  • 377
    • 0003506734 scopus 로고
    • Exact distribution for χ2 and for the likelihood-ratio statistic for the equiprobable multinomial distribution
    • I. J. Good, T. N. Gover, and G. J. Mitchell (1970), “Exact Distribution for χ2 and for the Likelihood-Ratio Statistic for the Equiprobable Multinomial Distribution,” Journal of the American Statistical Association65: 267–83.
    • (1970) Journal of the American Statistical Association , vol.65 , pp. 267-283
    • Good, I.J.1    Gover, T.N.2    Mitchell, G.J.3
  • 378
    • 0348164422 scopus 로고
    • Algorithm 63 (Partition) and algorithm 65 (find)
    • C. A. R. Hoare (1961), “Algorithm 63 (PARTITION) and Algorithm 65 (FIND),” Communications of the ACM4: 321–2.
    • (1961) Communications of the ACM , vol.4 , pp. 321-322
    • Hoare, C.1
  • 380
    • 0001507590 scopus 로고
    • Computing the distribution of quadratic forms in normalvariables
    • J. P. Imhof (1961), “Computing the Distribution of Quadratic Forms in NormalVariables,” Biometrika48: 419–26.
    • (1961) Biometrika , vol.48 , pp. 419-426
    • Imhof, J.P.1
  • 381
    • 84976699955 scopus 로고
    • Lower bounds for selection in x + y and other multisets
    • D. B. Johnson and S. D. Kashdan (1978), “Lower Bounds for Selection in X + Y and Other Multisets,” Journal of the ACM25: 556–70.
    • (1978) Journal of the ACM , vol.25 , pp. 556-570
    • Johnson, D.B.1    Kashdan, S.D.2
  • 382
    • 84976859075 scopus 로고
    • A numbering system for combinations
    • Gary D. Knott (1974), “A Numbering System for Combinations,” Communications of the ACM17: 45–6.
    • (1974) Communications of the ACM , vol.17 , pp. 45-46
    • Knott, G.D.1
  • 383
    • 0003657590 scopus 로고    scopus 로고
    • Seminumerical Algorithms), 3rd ed. Reading, MA: Addison-Wesley
    • Donald E. Knuth (1997), The Art of Computer Programming(vol. 2: Seminumerical Algorithms), 3rd ed. Reading, MA: Addison-Wesley.
    • (1997) The Art of Computer Programming , vol.2
    • Knuth, D.E.1
  • 384
    • 0003657590 scopus 로고    scopus 로고
    • Sorting and Searching), 2nd ed. Reading, MA: Addison-Wesley
    • Donald E. Knuth (1998), The Art of Computer Programming(vol. 3: Sorting and Searching), 2nd ed. Reading, MA: Addison-Wesley.
    • (1998) The Art of Computer Programming , vol.3
    • Knuth, D.E.1
  • 385
    • 1942496050 scopus 로고    scopus 로고
    • Improving the numerical technique for computing the accumulated distribution of a quadratic form in normal variables
    • Lu, Zeng-Hua and Maxwell L. King (2002), “Improving the Numerical Technique for Computing the Accumulated Distribution of a Quadratic Form in Normal Variables,” Econometric Reviews21: 149–65.
    • (2002) Econometric Reviews , vol.21 , pp. 149-165
    • Lu, Z.-H.1    King, M.L.2
  • 386
    • 84976676917 scopus 로고
    • Algorithm 516: An algorithm for obtaining confidence intervals and point estimates based on rank in a two-sample location problem
    • J.W. McKean and T. A. Ryan (1977), “Algorithm 516: An Algorithm for Obtaining Confidence Intervals and Point Estimates Based on Rank in a Two-Sample Location Problem,” ACM Transactions on Mathematical Software3: 183–5.
    • (1977) ACM Transactions on Mathematical Software , vol.3 , pp. 183-185
    • McKean, J.W.1    Ryan, T.A.2
  • 387
    • 0022731304 scopus 로고
    • Fexact: A fortran subroutine for fisher’s exact test on unordered r ×c contingency tables
    • Cyrus R. Mehta and Nitin R. Patel (1986), “FEXACT: A Fortran Subroutine for Fisher’s Exact Test on Unordered r ×c Contingency Tables,” ACM Transactions on Mathematical Software12: 154–61.
    • (1986) ACM Transactions on Mathematical Software , vol.12 , pp. 154-161
    • Mehta, C.R.1    Patel, N.R.2
  • 388
    • 0021489594 scopus 로고
    • Fast computation of the hodges–lehmann location estimator
    • John F. Monahan (1984), “Fast Computation of the Hodges–Lehmann Location Estimator,” ACM Transactions on Mathematical Software10: 265–70.
    • (1984) ACM Transactions on Mathematical Software , vol.10 , pp. 265-270
    • Monahan, J.F.1
  • 389
    • 84924725676 scopus 로고
    • An alternative method for computing overflow probabilities
    • John F. Monahan (1987), “An Alternative Method for Computing Overflow Probabilities,” Communications in Statistics A16: 3355–7.
    • (1987) Communications in Statistics A , vol.16 , pp. 3355-3357
    • Monahan, J.F.1
  • 393
    • 84946617872 scopus 로고
    • Computing the probability of hash table/urn overflow
    • M. V. Ramakrishna (1987), “Computing the Probability of Hash Table/Urn Overflow,” Communications in Statistics A16: 3343–53.
    • (1987) Communications in Statistics A , vol.16 , pp. 3343-3353
    • Ramakrishna, M.V.1
  • 395
    • 78649300842 scopus 로고
    • Algorithm 202: Generation of permutations in lexicographical order
    • Mok-Kong Shen (1963), “Algorithm 202: Generation of Permutations in Lexicographical Order,” Communications of the ACM6: 517.
    • (1963) Communications of the ACM , vol.6 , pp. 517
    • Shen, M.-K.1
  • 396
    • 0002319720 scopus 로고
    • Kernel density estimation using the fast fourier transform
    • B.W. Silverman (1982), “Kernel Density Estimation Using the Fast Fourier Transform,” Applied Statistics31: 93–7.
    • (1982) Applied Statistics , vol.31 , pp. 93-97
    • Silverman, B.W.1
  • 397
    • 0014520310 scopus 로고
    • An algorithm for computing the mixed-radix fast fourier transform
    • R. C. Singleton (1969), “An Algorithm for Computing the Mixed-Radix Fast Fourier Transform,” IEEE Transactions on Audio and Electroacoustics17: 93–103.
    • (1969) IEEE Transactions on Audio and Electroacoustics , vol.17 , pp. 93-103
    • Singleton, R.C.1
  • 398
    • 84914891478 scopus 로고
    • Efficient calculation of the permutation distribution of trimmed means
    • Cathie Spino and Marcello Pagano (1991), “Efficient Calculation of the Permutation Distribution of Trimmed Means,” Journal of the American Statistical Association86: 729–37.
    • (1991) Journal of the American Statistical Association , vol.86 , pp. 729-737
    • Spino, C.1    Pagano, M.2
  • 401
    • 84968482241 scopus 로고
    • Generation of permutations by transposition
    • Mark B. Wells (1961), “Generation of Permutations by Transposition,” Mathematics of Computation15: 192–5.
    • (1961) Mathematics of Computation , vol.15 , pp. 192-195
    • Wells, M.B.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.