Computing Bayesian predictive distributions: The K-square and K-prime distributions

From MaRDI portal
Publication:6478236

arXivmath/0611419MaRDI QIDQ6478236FDOQ6478236


Authors: Jacques Poitevineau, Bruno Lecoutre Edit this on Wikidata


Publication date: 14 November 2006

Abstract: The computation of two Bayesian predictive distributions which are discrete mixtures of incomplete beta functions is considered. The number of iterations can easily become large for these distributions and thus, the accuracy of the result can be questionable. Therefore, existing algorithms for that class of mixtures are improved by introducing round-off error calculation into the stopping rule. A further simple modification is proposed to deal with possible underflows that may prevent recurrence to work properly.













This page was built for publication: Computing Bayesian predictive distributions: The K-square and K-prime distributions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6478236)