Computing the nearest singular univariate polynomials with given root multiplicities

被引：5
|
作者：
Li, Zijia [1 ,2 ]
Zhi, Lihong [2 ]
机构：
[1] Austrian Acad Sci, Johann Radon Inst Computat & Appl Math, A-4040 Linz, Austria
[2] Acad Mil Med Sci, Key Lab Math Mechanizat, Beijing 100190, Peoples R China
来源：
THEORETICAL COMPUTER SCIENCE | 2013年 / 479卷
基金：
奥地利科学基金会;
关键词：
Multiplicity structure; Nearest singular polynomial; Multiple roots;
D O I：
10.1016/j.tcs.2012.10.027
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, we derive explicit expressions for the nearest singular polynomials with given root multiplicities and its distance to the given polynomial. These expressions can be computed recursively. These results extend previous results of Zhi et al. (2004) [10] and Zhi and Wu (1998) [11]. (c) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码：150 / 162
页数：13
相关论文
共 39 条
1234