Counting roots of random polynomial equations in small intervals

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The problem of finding the probability distribution of the number of zeros in some real interval of a random polynomial whose coefficients have a given continuous joint density function is considered. A new simulation algorithm for solving this problem is presented. The effectiveness of the presented algorithm for the case where the real interval is small is proved.

Original languageEnglish
Title of host publicationRecent Advances in Computers, Communications, Applied Social Science and Mathematics -Proceedings of ICANCM'11, ICDCC'11, IC-ASSSE-DC'11
Pages228-232
Number of pages5
StatePublished - 2011
EventInt. Conf. on Applied, Numerical and Computational Mathematics, ICANCM'11, Int. Conf. on Computers, Digital Communications and Computing, ICDCC'11, Int. Conference on Applied Social Science, Social Economy and Digital Convergence, IC-ASSSE-DC'11 - Barcelona, Spain
Duration: 15 Sep 201117 Sep 2011

Publication series

NameRecent Advances in Computers, Communications, Applied Social Science and Mathematics -Proceedings of ICANCM'11, ICDCC'11, IC-ASSSE-DC'11

Conference

ConferenceInt. Conf. on Applied, Numerical and Computational Mathematics, ICANCM'11, Int. Conf. on Computers, Digital Communications and Computing, ICDCC'11, Int. Conference on Applied Social Science, Social Economy and Digital Convergence, IC-ASSSE-DC'11
Country/TerritorySpain
CityBarcelona
Period15/09/1117/09/11

Keywords

  • Monte-carlo algorithm
  • Numerical method
  • Random polynomial

Fingerprint

Dive into the research topics of 'Counting roots of random polynomial equations in small intervals'. Together they form a unique fingerprint.

Cite this