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 new and uptodate book by a leading authority in the field examines an advanced set of numerical methods and algorithms that may be used to solve largescale, complex problems on computers with massive parallel processing capabilities. Drawing on his many years of research, the author uses a wealth of practical applications to illuminate his presentation of theory. This book is a valuable reference for professionals in the fields of computer science and applied mathematics, and engineers interested in problems involving numerical analysis and parallel computing.
⚠️ 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.