Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A parallel algorithm for finding roots of a complex polynomial

From MaRDI portal
Publication:805233
Jump to:navigation, search

DOI10.1007/BF02946566zbMath0728.68065MaRDI QIDQ805233

Jinsong Cheng

Publication date: 1990

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)


zbMATH Keywords

parallel algorithmroots of a complex polynomialWilf algorithm


Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Parallel numerical computation (65Y05) Distributed algorithms (68W15)


Related Items (1)

The properties of a new subclass of harmonic univalent mappings



Cites Work

  • Unnamed Item
  • A parallel Wilf algorithm for complex zeros of a polynomial




This page was built for publication: A parallel algorithm for finding roots of a complex polynomial

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:805233&oldid=12725621"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 11:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki