Fast Solvers for Mesh-Based Computations

Regular price €132.99
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
A01=Maciej Paszynski
Age Group_Uncategorized
Age Group_Uncategorized
algorithm
Algorithms
Author_Maciej Paszynski
automatic-update
B1 A1
backward
Backward Substitution
BLAS Routine
Category1=Non-Fiction
Category=PBW
Category=UMB
Category=UYA
Codes
complement
computational mathematics
COP=United States
Delivery_Pre-order
Dependency Graph
Direct Solver
Direct solvers
Discrete Weak Formulation
Double A2
Double B1
Edge Singularity
element
elimination
Elimination Tree
eq_bestseller
eq_computing
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Execution Time
finite
Finite Difference Method
Finite Element Mesh
Finite Element Methods
FLOPs
high performance computing
Language_English
Linear Basis Functions
LU Factorization
Master Element
Mesh-Based Computations
method
MULTI-FRONTAL SOLVER
Nested Dissections Algorithm
numerical linear algebra
PA=Temporarily unavailable
parallel computing
Parallel Implementation
parallel sparse solver implementation
Patch Number
Precision Matrix
Price_€100 and above
PS=Active
schur
Schur Complement
scientific programming
softlaunch
Solver Algorithm
Son Node
sparse matrix analysis
substitution
tree
Tri Diagonal Matrix

Product details

  • ISBN 9781498754194
  • Weight: 834g
  • Dimensions: 178 x 254mm
  • Publication Date: 01 Dec 2015
  • Publisher: Taylor & Francis Inc
  • Publication City/Country: US
  • Product Form: Hardback
  • Language: English
Secure checkout Fast Shipping Easy returns

Fast Solvers for Mesh-Based Computations presents an alternative way of constructing multi-frontal direct solver algorithms for mesh-based computations. It also describes how to design and implement those algorithms.

The book’s structure follows those of the matrices, starting from tri-diagonal matrices resulting from one-dimensional mesh-based methods, through multi-diagonal or block-diagonal matrices, and ending with general sparse matrices.

Each chapter explains how to design and implement a parallel sparse direct solver specific for a particular structure of the matrix. All the solvers presented are either designed from scratch or based on previously designed and implemented solvers.

Each chapter also derives the complete JAVA or Fortran code of the parallel sparse direct solver. The exemplary JAVA codes can be used as reference for designing parallel direct solvers in more efficient languages for specific architectures of parallel machines.

The author also derives exemplary element frontal matrices for different one-, two-, or three-dimensional mesh-based computations. These matrices can be used as references for testing the developed parallel direct solvers.

Based on more than 10 years of the author’s experience in the area, this book is a valuable resource for researchers and graduate students who would like to learn how to design and implement parallel direct solvers for mesh-based computations.

Maciej Paszynski, PhD, Department of Computer Science, Electronics and Telecommunications, AGH University of Science and Technology, Kraków, Poland

More from this author