If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.
Customer service
All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com
Sale & Press
If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com
Help
If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.
Customer service
All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com
Sale & Press
If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com
This Highly Acclaimed Work, First Published By Prentice Hall In 1989, Is A Comprehensive And Theoretically Sound Treatment Of Parallel And Distributed Numerical Methods. It Focuses On Algorithms That Are Naturally Suited For Massive Parallelization, And It Explores The Fundamental Convergence, Rate Of Convergence, Communication, And Synchronization Issues Associated With Such Algorithms. This Is An Extensive Book, Which Aside From Its Focus On Parallel And Distributed Algorithms, Contains A Wealth Of Material On A Broad Variety Of Computation And Optimization Topics. Among Its Special Features, The Book: 1) Quantifies The Performance Of Parallel Algorithms, Including The Limitations Imposed By The Communication And Synchronization Penalties. 2) Describes Communication Algorithms For A Variety Of System Architectures Including Tree, Mesh, And Hypercube. 3) Provides A Comprehensive Convergence Analysis Of Asynchronous Methods And A Comparison With Their Asynchronous Counterparts. 4) Covers Direct And Iterative Algorithms For Linear And Nonlinear Systems Of Equations And Variational Inequalities. 5) Describes Optimization Methods For Nonlinear Programming, Shortest Paths, Dynamic Programming, Network Flows, And Largescale Decomposition. 6) Includes Extensive Research Material On Optimization Methods, Asynchronous Algorithm Convergence, Rollback Synchronization, Asynchronous Communication Network Protocols, And Others. 7) Supplements The Text Material With Many Exercises, Whose Complete Solutions Are Posted On The Internet. 8) Contains A Lot Of Material Not Found In Any Other Book.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer,
birth defects, or other reproductive harm.
For MAP (Minimum Advertised Price) violations and Intellectual Property (IP) or Trademark concerns, please contact:
support@ergodebooks.com
⚠️ California Proposition 65 Warning: Some products sold on this website may expose you to chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm. For more information, visit www.P65Warnings.ca.gov.
