Nearest singular polynomials (Q1281843)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Nearest singular polynomials |
scientific article; zbMATH DE number 1268447
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nearest singular polynomials |
scientific article; zbMATH DE number 1268447 |
Statements
Nearest singular polynomials (English)
0 references
22 March 1999
0 references
The following problem is considered: Given a monic polynomial \(f(x)\) \[ f= x^m+ \sum^m_{j=1} f_j\cdot x^{m-j},\quad f_j\in\mathbb{C}. \] Find a monic polynomial \(h(x)\) \[ h= (x- c)^k\cdot \Biggl(x^{m-k}+ \sum^{m- k}_{j= 1} \Phi_j\cdot x^{m- k-j}\Biggr),\quad c,\Phi_j\in \mathbb{C},\;k\geq 2 \] such that \(\| f- h\|^2\to\) minimum, where \(\| p(x)\|^2= \sum^k_{j= 0}| p_j|^2\) for any \(p(x)= \sum^k_{j= 0} p_j\cdot x^{k-j}\), \(p_j\in\mathbb{C}\). Some recursive relations between the polynomials determining the multiple zeros for consecutive \(k\)'s are presented. Two numerical examples are given.
0 references
nearest singular polynomials
0 references
quadratic programming
0 references
multiple zeros
0 references
numerical examples
0 references