null
Loading... Please wait...
FREE SHIPPING on All Unbranded Items LEARN MORE
Print This Page

Parallel Iterative Algorithms (From Sequential to Grid Computing)

List Price: $87.99
SKU:
9780367388164
Quantity:
Minimum Purchase
25 unit(s)
  • Availability: Confirm prior to ordering
  • Branding: minimum 50 pieces (add’l costs below)
  • Check Freight Rates (branded products only)

Branding Options (v), Availability & Lead Times

  • 1-Color Imprint: $2.00 ea.
  • Promo-Page Insert: $2.50 ea. (full-color printed, single-sided page)
  • Belly-Band Wrap: $2.50 ea. (full-color printed)
  • Set-Up Charge: $45 per decoration
FULL DETAILS
  • Availability: Product availability changes daily, so please confirm your quantity is available prior to placing an order.
  • Branded Products: allow 10 business days from proof approval for production. Branding options may be limited or unavailable based on product design or cover artwork.
  • Unbranded Products: allow 3-5 business days for shipping. All Unbranded items receive FREE ground shipping in the US. Inquire for international shipping.
  • RETURNS/CANCELLATIONS: All orders, branded or unbranded, are NON-CANCELLABLE and NON-RETURNABLE once a purchase order has been received.
  • Product Details

    Author:
    Jacques Mohcine Bahi, Sylvain Contassot-Vivier, Raphael Couturier
    Format:
    Paperback
    Pages:
    235
    Publisher:
    CRC Press (September 19, 2019)
    Language:
    English
    Audience:
    Professional and scholarly
    ISBN-13:
    9780367388164
    Weight:
    16oz
    Dimensions:
    6.125" x 9.1875"
    File:
    TAYLORFRANCIS-TayFran_260403050946149-20260403.xml
    Folder:
    TAYLORFRANCIS
    List Price:
    $87.99
    Country of Origin:
    United States
    Case Pack:
    1
    As low as:
    $83.59
    Publisher Identifier:
    P-CRC
    Discount Code:
    H
    Pub Discount:
    30
    Imprint:
    Chapman and Hall/CRC
  • Overview

    Presenting the theoretical and practical aspects of parallel numerical algorithms, this book illustrates how iterative algorithms can solve numerical problems and discusses their implementation on parallel and distributed computers. It reviews basic convergence results of iterative algorithms and explores the advantages of asynchronism, such as reducing the effect of bottlenecks and the synchronization penalty. The authors also analyze numerous experiments in various computational contexts for linear and nonlinear numerical problems. The book contains several exercises at the end of most chapters as well as an appendix of mathematical results.