A method of determining all the zeros of a generalized polynomial with respect to an arbitrary Chebyshev system

DOI10.1016/0041-5553(87)90112-1zbMath0648.65043OpenAlexW1992545150MaRDI QIDQ3793633

Kh. I. Semerdzhiev, S. G. Tamburov

Publication date: 1987

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(87)90112-1

zbMATH Keywords

iterative methodquadratic convergenceChebyshev systemgeneralized polynomialzeros with given multiplicity

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)

Related Items (1)

A comparison of companion matrix methods to find roots of a trigonometric polynomial

This page was built for publication: A method of determining all the zeros of a generalized polynomial with respect to an arbitrary Chebyshev system