|
Showing 1 - 4 of
4 matches in All Departments
This book differs from traditional numerical analysis texts in that
it focuses on the motivation and ideas behind the algorithms
presented rather than on detailed analyses of them. It presents a
broad overview of methods and software for solving mathematical
problems arising in computational modeling and data analysis,
including proper problem formulation, selection of effective
solution algorithms, and interpretation of results. In the 20 years
since its original publication, the modern, fundamental perspective
of this book has aged well, and it continues to be used in the
classroom. This Classics edition has been updated to include
pointers to Python software and the Chebfun package, expansions on
barycentric formulation for Lagrange polynomial interpretation and
stochastic methods, and the availability of about 100 interactive
educational modules that dynamically illustrate the concepts and
algorithms in the book. Scientific Computing: An Introductory
Survey, Second Edition is intended as both a textbook and a
reference for computationally oriented disciplines that need to
solve mathematical problems.
This IMA Volume in Mathematics and its Applications ALGORITHMS FOR
PARALLEL PROCESSING is based on the proceedings of a workshop that
was an integral part of the 1996-97 IMA program on "MATHEMATICS IN
HIGH-PERFORMANCE COMPUTING. " The workshop brought together
algorithm developers from theory, combinatorics, and scientific
computing. The topics ranged over models, linear algebra, sorting,
randomization, and graph algorithms and their analysis. We thank
Michael T. Heath of University of lllinois at Urbana (Com puter
Science), Abhiram Ranade of the Indian Institute of Technology
(Computer Science and Engineering), and Robert S. Schreiber of
Hewlett Packard Laboratories for their excellent work in organizing
the workshop and editing the proceedings. We also take this
opportunity to thank the National Science Founda tion (NSF) and the
Army Research Office (ARO), whose financial support made the
workshop possible. A vner Friedman Robert Gulliver v PREFACE The
Workshop on Algorithms for Parallel Processing was held at the IMA
September 16 - 20, 1996; it was the first workshop of the IMA year
dedicated to the mathematics of high performance computing. The
work shop organizers were Abhiram Ranade of The Indian Institute of
Tech nology, Bombay, Michael Heath of the University of Illinois,
and Robert Schreiber of Hewlett Packard Laboratories. Our idea was
to bring together researchers who do innovative, exciting, parallel
algorithms research on a wide range of topics, and by sharing
insights, problems, tools, and methods to learn something of value
from one another."
This IMA Volume in Mathematics and its Applications ALGORITHMS FOR
PARALLEL PROCESSING is based on the proceedings of a workshop that
was an integral part of the 1996-97 IMA program on "MATHEMATICS IN
HIGH-PERFORMANCE COMPUTING. " The workshop brought together
algorithm developers from theory, combinatorics, and scientific
computing. The topics ranged over models, linear algebra, sorting,
randomization, and graph algorithms and their analysis. We thank
Michael T. Heath of University of lllinois at Urbana (Com puter
Science), Abhiram Ranade of the Indian Institute of Technology
(Computer Science and Engineering), and Robert S. Schreiber of
Hewlett Packard Laboratories for their excellent work in organizing
the workshop and editing the proceedings. We also take this
opportunity to thank the National Science Founda tion (NSF) and the
Army Research Office (ARO), whose financial support made the
workshop possible. A vner Friedman Robert Gulliver v PREFACE The
Workshop on Algorithms for Parallel Processing was held at the IMA
September 16 - 20, 1996; it was the first workshop of the IMA year
dedicated to the mathematics of high performance computing. The
work shop organizers were Abhiram Ranade of The Indian Institute of
Tech nology, Bombay, Michael Heath of the University of Illinois,
and Robert Schreiber of Hewlett Packard Laboratories. Our idea was
to bring together researchers who do innovative, exciting, parallel
algorithms research on a wide range of topics, and by sharing
insights, problems, tools, and methods to learn something of value
from one another."
Describes a selection of important parallel algorithms for matrix
computations. Reviews the current status and provides an overall
perspective of parallel algorithms for solving problems arising in
the major areas of numerical linear algebra, including (1) direct
solution of dense, structured, or sparse linear systems, (2) dense
or structured least squares computations, (3) dense or structured
eigenvaluen and singular value computations, and (4) rapid elliptic
solvers. The book emphasizes computational primitives whose
efficient execution on parallel and vector computers is essential
to obtain high performance algorithms. Consists of two
comprehensive survey papers on important parallel algorithms for
solving problems arising in the major areas of numerical linear
algebra - direct solution of linear systems, least squares
computations, eigenvalue and singular value computations, and rapid
elliptic solvers, plus an extensive up-to-date bibliography (2,000
items) on related research.
|
|