• DocumentCode
    1496344
  • Title

    Smolyak´s algorithm: a simple and accurate framework for the analysis of correlated log-normal power-sums

  • Author

    Renzo, Marco Di ; Imbriglio, Laura ; Graziosi, Fabio ; Santucci, Fortunato

  • Author_Institution
    Inst. for Digital Commun., Univ. of Edinburgh, Edinburgh, UK
  • Volume
    13
  • Issue
    9
  • fYear
    2009
  • Firstpage
    673
  • Lastpage
    675
  • Abstract
    The accurate analysis of log-normal power-sums requires the computation of multidimensional integrals with unknown closed-form. Typical approaches to numerically compute them are based on the full tensor-product formula, whose complexity raises exponentially with the number of summands. In this letter, we propose a different method which is called Smolyak´s algorithm. It belongs to the family of numerical integration techniques on sparse grids, and can be used in conjunction with several approximation methods for log-normal power-sums. Numerical results will show a complexity reduction greater than 99% without numerical accuracy degradation.
  • Keywords
    approximation theory; computational complexity; integration; log normal distribution; random processes; tensors; Smolyak algorithm; approximation method; computational complexity; correlated log-normal power-sum analysis; full tensor-product formula; numerical integration technique; random variable; sparse grid; unknown closed-form multidimensional integral computation; Algorithm design and analysis; Approximation algorithms; Approximation methods; Associate members; Degradation; Distributed computing; Grid computing; Monte Carlo methods; Multidimensional systems; Probability; Log-normal power-sum, Smolyak´s algorithm;
  • fLanguage
    English
  • Journal_Title
    Communications Letters, IEEE
  • Publisher
    ieee
  • ISSN
    1089-7798
  • Type

    jour

  • DOI
    10.1109/LCOMM.2009.091288
  • Filename
    5282371