A fitting algorithm for real coefficient polynomial rooting

DOI10.1016/j.cam.2012.02.027zbMath1242.65096OpenAlexW1984270864MaRDI QIDQ421833

Peter Strobach

Publication date: 14 May 2012

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.2012.02.027

zbMATH Keywords

algorithmconvolutionnumerical examplespolynomialspolynomial factorizationroots of polynomialsQR algorithmpolynomial fittingroot-findingcompanion matrix eigenvalue method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Real polynomials: location of zeros (26C10) Numerical computation of roots of polynomial equations (65H04)

Related Items (1)

A study of numerical integration based on Legendre polynomial and RLS algorithm

Uses Software

• na10

Cites Work

• Unnamed Item
• Unnamed Item
• Solving cubics by polynomial fitting
• Numerical computation of polynomial zeros by means of Aberth's method
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• Implicit double shift \(QR\)-algorithm for companion matrices
• Linear prediction theory. A mathematical basis for adaptive systems
• Solving a Polynomial Equation: Some History and Recent Progress
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously

This page was built for publication: A fitting algorithm for real coefficient polynomial rooting