Synopsis
Unlock faster solves for large systems with smart preconditioning.
This book shows how to choose and design preconditioners that make iterative methods converge quickly on sparse problems. It explains how, by focusing on the spectrum and condition number, you can improve performance in practical, real‑world computations.
- Learn why certain sparsity patterns respond best to specific preconditioners
- See how diagonal, block diagonal, and Laplacian‑type approaches compare in theory and practice
- Explore optimization techniques that identify the most effective matrices within a fixed sparsity pattern
- Understand how these ideas apply to Chebyshev methods, conjugate gradient, and related algorithms
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Optimal Preconditioners of a Given Sparsity Pattern...
Stock Image
Optimal Preconditioners of a Given Sparsity Pattern Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9780656168118
Stock Image
Optimal Preconditioners of a Given Sparsity Pattern Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9780656168118
Buy New
US$ 30.40
US$ 5.54 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available