Publication:3732856

DOI10.2307/2008093zbMATH Open0598.65023OpenAlexW2071852476MaRDI QIDQ3732856FDOQ3732856

Ronald G. Mosier

Publication date: 1986

Full work available at URL: https://doi.org/10.2307/2008093

zbMATH Keywords

condition numbersroots of polynomialsroot neighborhoods

Mathematics Subject Classification ID

Roundoff error (65G50) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)

Cited In (24)

• The nearest polynomial to multiple given polynomials with a given zero: a unified optimization approach
• Efficient computation of the nearest polynomial by linearized alternating direction method
• The nearest polynomial with a zero in a given domain
• On condition numbers of polynomial eigenvalue problems
• A unified approach to computing the nearest complex polynomial with a given zero
• On pseudospectra of matrix polynomials and their boundaries
• Pseudozeros of multivariate polynomials
• A verified method for bounding clusters of zeros of analytic functions
• Homeostasis despite instability
• Robust plotting of generalized lemniscates
• The econometrics of auctions with asymmetric anonymous bidders
• The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval
• More on pseudospectra for polynomial eigenvalue problems and applications in control theory
• On real factors of real interval polynomials
• Computing with barycentric polynomials
• Solving secular and polynomial equations: a multiprecision algorithm
• Numerical computation of polynomial zeros by means of Aberth's method
• Computing curve intersection by means of simultaneous iterations
• Real and complex pseudozero sets for polynomials with applications
• An iterative method for computing robustness of polynomial stability
• The nearest complex polynomial with a zero in a given complex domain
• Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions
• Root neighborhoods, generalized lemniscates, and robust stability of dynamic systems
• A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted \(\ell_{2, q}\)-norm minimization and its complex extension

This page was built for publication: Root Neighborhoods of a Polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3732856)