Fast solvers for mesh-based computations

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...

Full description

Saved in:
Bibliographic Details
Main Author: Paszyński, Maciej (Author)
Format: Book
Language:English
Published: Boca Raton CRC Press, Taylor & Francis Group [2016]
Series:Advances in applied mathematics
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!

MARC

LEADER 00000nam a2200000 c 4500
001 100998
003 MY-KLNDU
005 20241220035618.0
008 221104 2016 flua bi 000 0 eng d
020 |a 9781498754194 
039 9 |a 202211041150  |b VLOAD  |c 201701100858  |d azraai  |y 201610251521  |z hasri 
040 |a UPNM  |b eng  |c UPNM  |e rda 
090 |a QA 76.58  |b .P37 2015 
100 1 |a Paszyński, Maciej  |e author 
245 1 0 |a Fast solvers for mesh-based computations  |c Maciej Paszyński 
264 1 |a Boca Raton  |b CRC Press, Taylor & Francis Group  |c [2016] 
264 4 |c ©2016 
300 |a xxxviii, 310 pages  |b illustrations  |c 26 cm. 
336 |a text  |2 rdacontent 
337 |a unmediated  |2 rdamedia 
338 |a volume  |2 rdacarrier 
490 1 |a Advances in applied mathematics 
504 |a Includes bibliographical references and index 
505 0 |a Multi-frontal direct solver algorithm for tri-diagonal and block-diagonal one-dimensional problems -- One-dimensional non-stationary problems -- Multi-frontal direct solver algorithm for multi-diagonal one-dimensional problems -- Multi-frontal direct solver algorithm for two-dimensional grids with block diagonal structure of the matrix -- Multi-frontal direct solver algorithm for three-dimensional grids with block diagonal structure of the matrix -- Multi-frontal direct solver algorithm for two-dimensional isogeometric finite element method -- Expressing partial LU factorization by BLAS calls -- Multi-frontal solver algorithm for arbitrary mesh-based computations -- Elimination trees -- Reutilization and reuse of partial LU factorizations -- Numerical experiments 
520 |a 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 
592 |a 32582  |b 5/12/16  |c RM327.13  |h Bookline 
650 0 |a Parallel processing (Electronic computers) 
830 0 |a Advances in applied mathematics 
999 |a vtls000057194  |c 100998  |d 100998