Tighter bounds of errors of numerical roots

被引:0
|
作者
Tateaki Sasaki
机构
[1] University of Tsukuba,Institute of Mathematics
关键词
Error Bound; Tight Bound; Numerical Root; Approximate Root; Close Root;
D O I
暂无
中图分类号
学科分类号
摘要
LetP(z) be a monic univariate polynomial overC, of degreen and having roots ζ1,..., ζn. Given approximate rootsz1,...,zn, with ζi ≃zi (i = 1,...,n), we derive a very tight upper bound of ¦ζi −zi¦, by assuming that ζi has no close root. The bound formula has a similarity with Smale’s and Smith’s formulas. We also derive a lower bound of ¦ζi −zi¦ and a lower bound of min{ζj −zi¦ ¦j ≠i}.
引用
收藏
页码:219 / 226
页数:7
相关论文
共 50 条
  • [1] Tighter bounds of errors of numerical roots
    Sasaki, Tateaki
    JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 2007, 24 (02) : 219 - 226
  • [2] Tighter Bounds for Facility Games
    Lu, Pinyan
    Wang, Yajun
    Zhou, Yuan
    INTERNET AND NETWORK ECONOMICS, PROCEEDINGS, 2009, 5929 : 137 - 148
  • [3] Tighter bounds in triangular systems
    Jun, Sung Jae
    Pinkse, Joris
    Xu, Haiqing
    JOURNAL OF ECONOMETRICS, 2011, 161 (02) : 122 - 128
  • [4] Tighter Trail Bounds for Xoodoo
    Mella, Silvia
    Daemen, Joan
    Van Assche, Gilles
    IACR TRANSACTIONS ON SYMMETRIC CRYPTOLOGY, 2023, 2023 (04) : 187 - 214
  • [5] Tighter Bounds on the Expressivity of Transformer Encoders
    Chiang, David
    Cholak, Peter
    Pillay, Anand
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 202, 2023, 202
  • [6] Tighter Variational Bounds are Not Necessarily Better
    Rainforth, Tom
    Kosiorek, Adam R.
    Tuan Anh Le
    Maddison, Chris J.
    Igl, Maximilian
    Wood, Frank
    Teh, Yee Whye
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 80, 2018, 80
  • [7] Tighter Fourier Transform Lower Bounds
    Ailon, Nir
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2015, 9134 : 14 - 25
  • [8] TIGHTER BOUNDS FOR THE DISCREPANCY OF BOXES AND POLYTOPES
    Nikolov, Aleksandar
    MATHEMATIKA, 2017, 63 (03) : 1091 - 1113
  • [9] Tighter Bounds for Random Projections of Manifolds
    Clarkson, Kenneth L.
    PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY (SGG'08), 2008, : 39 - 48
  • [10] Tighter bounds on the minimum broadcast time
    Haugland, Dag
    DISCRETE OPTIMIZATION, 2024, 51