Solving secular and polynomial equations: a multiprecision algorithm
From MaRDI portal
Publication:2253077
DOI10.1016/j.cam.2013.04.037zbMath1310.65052OpenAlexW2111028120MaRDI QIDQ2253077
Dario Andrea Bini, Leonardo Robol
Publication date: 25 July 2014
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2013.04.037
secular equationspolynomial rootsEhrlich-Aberth iterationroot neighborhoodsmultiprecision computations
Numerical computation of solutions to single equations (65H05) Numerical computation of roots of polynomial equations (65H04)
Related Items
Quasiseparable Hessenberg reduction of real diagonal plus low rank matrices and applications, On a class of matrix pencils and \(\ell\)-ifications equivalent to a given matrix polynomial, Root radii and subdivision for polynomial root-finding, Characterization of local optima of polynomial modulus over a disc, SOME ANALYTICAL AND NUMERICAL RESULTS FOR THE ZEROS OF A CLASS OF FIBONACCI-LIKE POLYNOMIALS, A Fractal Eigenvector, Symbolic-numeric integration of rational functions, A bound on the spectral radius of graphs in terms of their Zagreb indices, A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration, Fast and Backward Stable Computation of Roots of Polynomials, Part II: Backward Error Analysis; Companion Matrix and Companion Pencil, A Framework for Structured Linearizations of Matrix Polynomials in Various Bases, Fast evaluation and root finding for polynomials with floating-point coefficients, 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, Torus partition function of the six-vertex model from algebraic geometry, Note on a rank-one modification of the singular value decomposition, Transmission operators for the non-overlapping Schwarz method for solving Helmholtz problems in rectangular cavities, Fast optimization of viscosities for frequency‐weighted damping of second‐order systems, Rational Krylov methods for functions of matrices with applications to fractional partial differential equations, An adaptive subdivision method for root finding of univariate polynomials, Efficient Ehrlich-Aberth iteration for finding intersections of interpolating polynomials and rational functions, On the stability of computing polynomial roots via confederate linearizations, Nearly optimal computations with structured matrices, Cylinder partition function of the 6-vertex model from algebraic geometry, An effective implementation of a modified Laguerre method for the roots of a polynomial, New Practical Advances in Polynomial Root Clustering, Accelerated subdivision for clustering roots of polynomials given by evaluation oracles, On the efficient global dynamics of Newton’s method for complex polynomials, Real polynomial root-finding by means of matrix and polynomial iterations, 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Numerical computation of polynomial zeros by means of Aberth's method
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials
- Inclusion of the roots of a polynomial based on Gerschgorin's theorem
- Rayleigh quotient algorithms for nonsymmetric matrix pencils
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- Convergence conditions of some methods for the simultaneous computation of polynomial zero
- Numerical solution of a secular equation
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Improved initialization of the accelerated and robust QR-like polynomial root-finding
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem
- A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix
- Partition Polynomials: Asymptotics and Zeros
- Root Neighborhoods of a Polynomial
- An Algorithm for Subspace Computation, with Applications in Signal Processing
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- Accuracy and Stability of Numerical Algorithms
- A modified Newton method for polynomials
- Some Modified Matrix Eigenvalue Problems
