Abstract
The problem of moments has been studied for more than a century. This paper discusses a practical issue related to the problem of moments namely the bounding of a distribution based on a given number of moments. The presented approach is unified in the sense that all measures of interests are provided as a quadratic expression of the same Hankel-matrix.
Application examples indicate the importance of the presented approach.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Akhiezer, N.I.: The classical moment problem and some related questions in analysis. Hafner publishing company, New York (1965) (translation of Н. И. Ахиезер Класическая Проблема Моментов и Некоторые Волросы Анализа published by Государственное Издательство физико Математической Литературы, Moscow, 1961)
Donatiello, L., Grassi, V.: On evaluating the cumulative performance distribution of fault-tolerant computer systems. IEEE Transactions on Computers (1991)
Fodor, G., Rácz, S., Telek, M.: On providing blocking probability- and throughput guarantees in a multi-service environment. International Journal of Communication Systems 15(4), 257–285 (2002)
Horváth, A., Telek, M., Horváth, G.: Analysis of inhomogeneous Markov reward models. Linear algebra and its application 386, 383–405 (2004)
Horváth, G., Rácz, S., Tari, Á., Telek, M.: Evaluation of reward analysis methods with MRMSolve 2.0. In: 1st International Conference on Quantitative Evaluation of Systems (QEST) 2004, Twente, The Netherlands, September 2004, pp. 165–174. IEEE CS Press, Los Alamitos (2004)
van de Liefvoort, A.: The moment problem for continuous distributions. Technical report, University of Missouri, WP-CM-1990-02, Kansas City (1990)
Nabli, H., Sericola, B.: Performability analysis: a new algorithm. IEEE Transactions on Computers 45, 491–494 (1996)
Press, W.H., Flannery, B.P., Teukolsky, S.A., Vetterling, W.T.: Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press, Cambridge (1993), http://lib-www.lanl.gov/numerical/bookcpdf.html
Rácz, S.: Numerical analysis of communication systems through Markov reward models. PhD thesis, Technical University of Budapest (2000)
Rácz, S., Telek, M.: Performability analysis of Markov reward models with rate and impulse reward. In: Silva, M., Plateau, B., Stewart, W. (eds.) Int. Conf. on Numerical solution of Markov chains, Zaragoza, Spain, pp. 169–187 (1999)
Rózsa, P.: Lineáris algebra és alkalmazásai. Tankönyvkiadó (1991) (in Hungarian)
Shohat, J.A., Tamarkin, D.J.: The problem of moments. Americal Mathematical Society, Providence, Rhode Island, Mathematical surveys (1946)
de Souza e Silva, E., Gail, H.R.: Calculating cumulative operational time distributions of repairable computer systems. IEEE Transactions on Computers C-35, 322–332 (1986)
Stieltjes, T.: Reserches sur les fractions continues. Ann. Fac. Sci. Univ. Toulouse 2, 1–122 (1894) (in French)
Szegö, G.: Orthogonal polynomials. American Mathematical Society, Providence (1939)
Tagliani, A.: Existence and stability of a discrete probability distribution by maximum entropy approach. Applied Mathematics and Computation 110, 105–114 (2000)
Telek, M., Rácz, S.: Numerical analysis of large Markovian reward models. Performance Evaluation 36&37, 95–114 (1999)
Weisstein, E.W.: Positive definite matrix, http://mathworld.wolfram.com/PositiveDefiniteMatrix.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tari, Á., Telek, M., Buchholz, P. (2005). A Unified Approach to the Moments Based Distribution Estimation – Unbounded Support. In: Bravetti, M., Kloul, L., Zavattaro, G. (eds) Formal Techniques for Computer Systems and Business Processes. EPEW WS-FM 2005 2005. Lecture Notes in Computer Science, vol 3670. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549970_7
Download citation
DOI: https://doi.org/10.1007/11549970_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28701-8
Online ISBN: 978-3-540-31903-0
eBook Packages: Computer ScienceComputer Science (R0)