Sequential and parallel complexity of approximate evaluation of polynomial zeros

Συγγραφείς: Victor Y. Pan

Πηγή: Computers & Mathematics with Applications. 14:591-622

Θεματικοί όροι: practical implementation, Analysis of algorithms and problem complexity, Software, source code, etc. for problems pertaining to functions of a complex variable, sequential and parallel algorithms, 0102 computer and information sciences, complex polynomial zeros, 01 natural sciences, upper bounds, Computational Mathematics, Computational Theory and Mathematics, Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral), Modelling and Simulation, Numerical computation of solutions to single equations, 0101 mathematics, arithmetic and Boolean complexity

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/4032925
https://doi.org/10.1016/0898-1221(87)90186-6
https://www.sciencedirect.com/science/article/pii/0898122187901866
https://core.ac.uk/display/22969160
http://comet.lehman.cuny.edu/vpan/pdf/pan61.pdf