Computing all the zeros of an analytic function and their respective multiplicities, locating clusters of zeros and analytic fuctions, computing zeros and poles of meromorphic functions, and solving systems of analytic equations are problems in computational complex analysis that lead to a rich blend of mathematics and numerical analysis. This book treats these four problems in a unified way. It contains not only theoretical results (based on formal orthogonal polynomials or rational interpolation) but also numerical analysis and algorithmic aspects, implementation heuristics, and polished software (the package ZEAL) that is available via the CPC Program Library. Graduate studets and researchers in numerical mathematics will find this book very readable.

This book constitutes the refereed proceedings of the 7th International Conference on Applied Parallel Computing, PARA 2004, held in June 2004. The 118 revised full papers presented together with five invited lectures and 15 contributed talks were carefully reviewed and selected for inclusion in the proceedings. The papers are organized in topical sections.

Practical Programming in the Cell Broadband Engine offers a unique programming guide for the Cell Broadband Engine, demonstrating a large number of real-life programs to identify and solve problems in engineering, logic design, VLSI CAD, number-theory, graph-theory, computational geometry, image processing, and other subjects. Key features include: Numerous diagrams, mnemonics, tables, charts, code samples for making program development on the CBE as accessible as possible Comprehensive reading list for introductory material to the subject matter A website providing all source codes and sample-data for examples presented in this text.

This book constitutes the thoroughly refereed post-proceedings of the 5th International Conference on Large-Scale Scientific Computations, LSSC 2005, held in Sozopol, Bulgaria in June 2005. The 75 revised full papers presented together with five invited papers were carefully reviewed and selected for inclusion in the book. The papers are organized in topical sections.

This volume constitutes the refereed proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science, MFCS 2011, held in Warsaw, Poland, in August 2011. The 48 revised full papers presented together with 6 invited talks were carefully reviewed and selected from 129 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, grammars and formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, cryptography and security, databases and knowledge-based systems, formal specifications and program development, foundations of computing, logic in computer science, mobile computing, models of computation, networks, parallel and distributed computing, quantum computing, semantics and verification of programs, and theoretical issues in artificial intelligence.

Proceedings of the International Symposium on High Performance Computational Science and Engineering 2004 (IFIP World Computer Congress) is an essential reference for both academic and professional researchers in the field of computational science and engineering. Computational Science and Engineering is increasingly becoming an emerging and promising discipline in shaping future research and development activities in academia and industry ranging from engineering, science, finance, economics, arts and humanitarian fields. New challenges are in modeling of complex systems, sophisticated algorithms, advanced scientific and engineering computing, and associated (multi-disciplinary) problem solving environments. The papers presented in this volume are specially selected to address the most up-to-date ideas, results, work-in-progress and research experience in the area of high performance computational techniques for science and engineering applications. This state-of-the-are volume presents the proceedings of the International Symposium on High Performance Computational Science and Engineering, held in conjunction with the IFIP World Computer Congress, August 2004, in Toulouse, France. The collection will be important not only for computational science and engineering experts and researchers but for all teachers and administrators interested in high performance computational techniques.

Numerical Methods for Roots of Polynomials - Part II along with Part I (9780444527295) covers most of the traditional methods for polynomial root-finding such as interpolation and methods due to Graeffe, Laguerre, and Jenkins and Traub. It includes many other methods and topics as well and has a chapter devoted to certain modern virtually optimal methods. Additionally, there are pointers to robust and efficient programs. This book is invaluable to anyone doing research in polynomial roots, or teaching a graduate course on that topic. - First comprehensive treatment of Root-Finding in several decades with a description of high-grade software and where it can be downloaded - Offers a long chapter on matrix methods and includes Parallel methods and errors where appropriate - Proves invaluable for research or graduate course

This volume contains refereed state-of-the-art research articles and extensive surveys on the various aspects of interaction of complex variables and scientific computation as well as on related areas such as function theory and approximation theory.

This book constitutes the proceedings of the 19th International Workshop on Computer Algebra in Scientific Computing, CASC 2017, held in Beijing, China, in September 2017. The 28 full papers presented in this volume were carefully reviewed and selected from 33 submissions. They deal with cutting-edge research in all major disciplines of Computer Algebra.