Fast solvers for mesh-based computations

MaRDI QIDQ3450779zbMATH OpenFDO

Authors Maciej Paszynski

Publication date 9 November 2015

Full work available at URL http://www.crcnetbase.com/isbn/9781498754200

zbMATH Keywords

BLAS factorizationblock-diagonal systemscollocation methodCrank-Nicolson schemeelimination tree methodfinite differenceisogeometric finite element methodLU factorizationmonographmulti-frontal direct solversnumerical experimentpartial LU factorizationprojection problemReuse algorithmsolver performancetri-diagonal systems

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Finite difference and finite volume methods for ordinary differential equations (65L12) Mesh generation, refinement, and adaptive methods for ordinary differential equations (65L50) Finite element, Rayleigh-Ritz, Galerkin and collocation methods for ordinary differential equations (65L60) Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50) Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs (65M60) Finite difference methods for boundary value problems involving PDEs (65N06) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Parallel numerical computation (65Y05)

Recommendations

• Parallel Scientific Computing
• Direct Methods for Sparse Linear Systems
• Finite Element Methods: Parallel-Sparse Statics and Eigen-Solutions
• A direct parallel sparse matrix solver
• Parallelism in matrix computations

Cited in

(8)

• Efficient searching in meshfree methods
• Applications of a hyper-graph grammar system in adaptive finite-element computations
• A fast algorithm for point-location in a finite element mesh
• Element partition trees for \(h\)-refined meshes to optimize direct solver performance. I: Dynamic programming
• Refined isogeometric analysis for fluid mechanics and electromagnetics
• Fast Meshless Techniques Based on the Regularized Method of Fundamental Solutions
• Fast Methods for Solving High Accuracy Surface Modeling
• Unicyclic graphs with edge open packing number three

Describes a project that uses

Uses Software

• GALOIS
• HSL
• PARDISO
• PaStiX
• SuperLU
• MUMPS
• METIS
• Slatec
• BLIS

This page was built for publication: Fast solvers for mesh-based computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3450779)