Muutke küpsiste eelistusi

Fast Solvers for Mesh-Based Computations [Kõva köide]

(Dept of Computer Science, Electronics and Telecommunications, AGH University of Science and Technology)
  • Formaat: Hardback, 348 pages, kõrgus x laius: 254x178 mm, kaal: 834 g, 8 Tables, black and white; 154 Illustrations, black and white
  • Sari: Advances in Applied Mathematics
  • Ilmumisaeg: 01-Dec-2015
  • Kirjastus: CRC Press Inc
  • ISBN-10: 1498754198
  • ISBN-13: 9781498754194
Teised raamatud teemal:
Fast Solvers for Mesh-Based ComputationsSuurem pilt
  • Formaat: Hardback, 348 pages, kõrgus x laius: 254x178 mm, kaal: 834 g, 8 Tables, black and white; 154 Illustrations, black and white
  • Sari: Advances in Applied Mathematics
  • Ilmumisaeg: 01-Dec-2015
  • Kirjastus: CRC Press Inc
  • ISBN-10: 1498754198
  • ISBN-13: 9781498754194
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9781498754194.html
Märksõnad:
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 books 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 authors 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.

Arvustused

"The author describes how to design and implement efficient parallel multi-frontal direct solver algorithms for mesh-based computations.

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.

The book's structure follows that 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.

In each chapter JAVA or Fortran codes of the parallel sparse direct solver are listed. 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.

The book represents 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." ~Nicola Mastronardi, Mathematical Reviews, 2017

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 Factorizatons. Numerical Experiments.

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