A 2002 update of the supplementary bibliography on roots of polynomials
From MaRDI portal
Publication:1612321
DOI10.1016/S0377-0427(01)00546-5zbMath1002.65056MaRDI QIDQ1612321
Publication date: 22 August 2002
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
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) Real polynomials: location of zeros (26C10) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to numerical analysis (65-00)
Related Items
Eigenvalue condition numbers and pseudospectra of Fiedler matrices, The Weierstrass–Durand–Kerner root finder is not generally convergent, The amended DSeSC power method for polynomial root-finding, A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration, Newton's method in practice. II: The iterated refinement Newton method and near-optimal complexity for finding all roots of some polynomials of very large degrees, Efficient polynomial root-refiners: a survey and new record efficiency estimates, Finding all real roots of a polynomial by matrix algebra and the Adomian decomposition method, A model of host response to a multi-stage pathogen, Root-finding by expansion with independent constraints, A further analysis of backward error in polynomial deflation, Computing real roots of real polynomials, Solving a sparse system using linear algebra, Numerical analysis of some characteristics of the limit cycle of the free van der Pol equation, A property of the elementary symmetric functions on the frequencies of sinusoidal signals, On efficient computation and asymptotic sharpness of Kalantari’s bounds for zeros of polynomials, The polynomial pivots as initial values for a new root-finding iterative method, On the efficient global dynamics of Newton’s method for complex polynomials, Accelerated approximation of the complex roots and factors of a univariate polynomial, Newton's method in practice: finding all roots of polynomials of degree one million efficiently
