Rounding with multiplier methods: An efficient algorithm and applications in statistics

被引:0
|
作者
Gregor Dorfleitner
Thomas Klein
机构
[1] Universität Augsburg,Institut für Statistik und Mathematische Wirtschaftstheorie
[2] Universität Augsburg,Institut für Mathematik
来源
Statistical Papers | 1999年 / 40卷
关键词
rounding with summation restrictions; apportionment methods; multiplier rounding methods; multiple solutions; efficient algorithms; rounding percentages; optimal design of experiments; optimal sampling allocation;
D O I
暂无
中图分类号
学科分类号
摘要
Ordinary rounding does not always satisfy a summation restriction on the rounding results. This can be resolved by applying multiplier methods, for which we present an easy-to-implement algorithm complemented by remarks on special families of multiplier methods, the arithmetic-mean and power-mean method, and a previously unaddressed family, the geometric-mean methods. Finally, several applications in statistics are pointed out, i.e. rounding percentages in descriptive statistics, rounding optimal designs of experiments, and rounding optimal sample allocations.
引用
收藏
页码:143 / 157
页数:14
相关论文
共 50 条
  • [1] Rounding with multiplier methods: An efficient algorithm and applications in statistics
    Dorfleitner, G
    Klein, T
    STATISTICAL PAPERS, 1999, 40 (02) : 143 - 157
  • [2] Reconfigurable Rounding Based Approximate Multiplier for Energy Efficient Multimedia Applications
    Garg, Bharat
    Patel, Sujit
    WIRELESS PERSONAL COMMUNICATIONS, 2021, 118 (02) : 919 - 931
  • [3] Reconfigurable Rounding Based Approximate Multiplier for Energy Efficient Multimedia Applications
    Bharat Garg
    Sujit Patel
    Wireless Personal Communications, 2021, 118 : 919 - 931
  • [4] Efficient Design of Rounding-Based Approximate Multiplier Using Modified Karatsuba Algorithm
    Rao, E. Jagadeeswara
    Rao, K. Tarakeswara
    Ramya, K. Sudha
    Ajaykumar, D.
    Trinadh, R.
    JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS, 2022, 38 (05): : 567 - 574
  • [5] Efficient Design of Rounding-Based Approximate Multiplier Using Modified Karatsuba Algorithm
    E. Jagadeeswara Rao
    K. Tarakeswara Rao
    K. Sudha Ramya
    D. Ajaykumar
    R. Trinadh
    Journal of Electronic Testing, 2022, 38 : 567 - 574
  • [6] Design and Performance Analysis of Rounding Approximate Multiplier for Signal Processing Applications
    Sravanthi, V. Naga
    Terlapu, Sudheer Kumar
    SMART INTELLIGENT COMPUTING AND APPLICATIONS, VOL 2, 2020, 160 : 395 - 403
  • [7] Rounding Technique Analysis for Power-Area & Energy Efficient Approximate Multiplier Design
    Lohray, Priyanka
    Gali, Satwik
    Rangisetti, Srirathan
    Nikoubin, Tooraj
    2019 IEEE 9TH ANNUAL COMPUTING AND COMMUNICATION WORKSHOP AND CONFERENCE (CCWC), 2019, : 420 - 425
  • [8] Truncation and Rounding-Based Scalable Approximate Multiplier Design for Computer Imaging Applications
    Rooban, S.
    Ratnam, A. Yamini Naga
    Ramprasad, M. V. S.
    Subbulakshmi, N.
    Mageswari, R. Uma
    CMC-COMPUTERS MATERIALS & CONTINUA, 2022, 73 (03): : 5169 - 5184
  • [9] An efficient binary multiplier design for high speed applications using Karatsuba algorithm and Urdhva-Tiryagbhyam algorithm
    Arish, S.
    Sharma, R. K.
    2015 GLOBAL CONFERENCE ON COMMUNICATION TECHNOLOGIES (GCCT), 2015, : 192 - 196
  • [10] On stationary multiplier methods for the rounding of probabilities and the limiting law of the Sainte-Lague divergence
    Heinrich, Lothar
    Pukelsheim, Friedrich
    Schwingenschloegl, Udo
    STATISTICS & RISK MODELING, 2005, 23 (02) : 117 - 129