Hybrid method for computing the nearest singular polynomials

被引：0
|
作者：
Lihong Zhi
Matu-Tarow Noda
Hiroshi Kai
Wenda Wu
机构：
[1] Ehime University,Department of Computer Science
[2] Beijing Municipal Computing Center,Mathematics Mechanization Research Center
[3] Academia Sinica,undefined
来源：
Japan Journal of Industrial and Applied Mathematics | 2004年 / 21卷
关键词：
quadratic form; minimization; multiple roots;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper, we propose a combined symbolic-numeric algorithm for computing the nearest singular polynomial and its multiple zero. Explicit expressions of the minimal perturbation and the nearest singular polynomials are presented. A theoretical error bound and several numerical examples are given.
引用
收藏
相关论文
共 50 条
  • [1] Hybrid method for computing the nearest singular polynomials
    Zhi, LH
    Noda, MT
    Kai, H
    Wu, W
    JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 2004, 21 (02) : 149 - 162
  • [2] Computing the nearest singular univariate polynomials with given root multiplicities
    Li, Zijia
    Zhi, Lihong
    THEORETICAL COMPUTER SCIENCE, 2013, 479 : 150 - 162
  • [3] Nearest singular polynomials
    Zhi, LH
    Wu, WD
    JOURNAL OF SYMBOLIC COMPUTATION, 1998, 26 (06) : 667 - 675
  • [4] Nearest common root of a set of polynomials: A structured singular value approach
    Limantseva, Olga
    Halikias, George
    Karcanias, Nicos
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2020, 584 : 233 - 256
  • [5] A PRECONDITIONED HYBRID SVD METHOD FOR ACCURATELY COMPUTING SINGULAR TRIPLETS OF LARGE MATRICES
    Wu, Lingfei
    Stathopoulos, Andreas
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2015, 37 (05): : S365 - S388
  • [6] A subdivision method for computing nearest gcd with certification
    Cheze, Guillaume
    Galligo, Andre
    Mourrain, Bernard
    Yakoubsohn, Jean-Claude
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (35) : 4493 - 4503
  • [7] A RIEMANNIAN OPTIMIZATION METHOD TO COMPUTE THE NEAREST SINGULAR PENCIL
    Dopico, N. M.
    Noferini, Vanni
    Nyman, Lauri
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2024, 45 (04) : 2007 - 2038
  • [8] A method for computing symmetric and related polynomials
    Feit, W
    JOURNAL OF ALGEBRA, 2000, 234 (02) : 540 - 544
  • [9] Nearest common root of polynomials, approximate greatest common divisor and the structured singular value
    Halikias, G.
    Galanis, G.
    Karcanias, N.
    Milonidis, E.
    IMA JOURNAL OF MATHEMATICAL CONTROL AND INFORMATION, 2013, 30 (04) : 423 - 442
  • [10] A method for computing nearly singular integrals
    Beale, JT
    Lai, MC
    SIAM JOURNAL ON NUMERICAL ANALYSIS, 2001, 38 (06) : 1902 - 1925
12345