ISBN: 9781333149925 - iterative substructuring methods: algorithms and theory for elliptic problems in the plane (classic reprint) (3 risultati)

Perfeziona la tua ricerca

  • Libri (3)

  • Nuovo (3)

a

Fascia di prezzo personalizzata (EUR)

a

  • Lingua: Inglese

    Editore: Forgotten Books, 2018

    1333149921 / 9781333149925

    • Brossura

    Da: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 25,49

     Spedizione gratuita 
    Spedito in U.S.A.

    Quantità: 15 disponibili

    PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

  • Lingua: Inglese

    Editore: Forgotten Books, 2018

    1333149921 / 9781333149925

    • Brossura

    Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 24,67

    EUR 3,93 spedizione 
    Spedito da Regno Unito a U.S.A.

    Quantità: 15 disponibili

    PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

  • Lingua: Inglese

    Editore: Forgotten Books, London, 2018

    1333149921 / 9781333149925

    • Brossura
    • Print on Demand

    Da: Forgotten Books, London, Regno UnitoForgotten Books

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 16,01

     Spedizione gratuita 
    Spedito da Regno Unito a U.S.A.

    Quantità: Più di 20 disponibili

    Paperback. Condizione: New. No Jacket. Print on Demand. The book presents fast, scalable domain decomposition methods for elliptic problems in two dimensions.This rigorous, theory?driven work explains iterative substructuring algorithms that improve convergence and reduce communication in parallel computing. It focuses on finite element formulations, Sobolev spaces, and Schur complement techniques, with a clear path from two?substructure cases to many substructures. While it emphasizes theory over numerical results, the text shows how to achieve almost optimal performance with practical preconditioners and safeguards against growing condition numbers.- Learn how two?substructure and multi?substructure problems are modeled and solved.- See how Schur complements, discrete harmonic functions, and extension theorems underpin algorithm design.- Explore several nearly optimal preconditioners and how they control convergence rates.- Understand how these methods adapt to parallel environments and higher dimensions in future work.Ideal for readers of advanced numerical analysis and computational science, the book builds a solid foundation for designing efficient domain decomposition solvers in elliptic problems. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.…