Large sparse linear systems arising from mimetic discretization

DOI10.1016/j.camwa.2006.08.034zbMath1132.65022OpenAlexW2020496942MaRDI QIDQ2469908

Yanyan Li

Publication date: 11 February 2008

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2006.08.034

zbMATH Keywords

numerical experimentspreconditioningiterative methodsGMRESboundary value problemPoisson equationlarge sparse linear systemsstaggered gridmimetic methods

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Finite difference methods for boundary value problems involving PDEs (65N06)

Related Items (5)

Using Kronecker products to construct mimetic gradients ⋮ A mimetic iterative scheme for solving biharmonic equations ⋮ High-order mimetic finite-difference operators satisfying the extended Gauss divergence theorem ⋮ The mimetic methods toolkit: an object-oriented API for mimetic finite differences ⋮ A meshfree collocation method based on moving Taylor polynomial approximation for high order partial differential equations

Uses Software

• ILUT

Cites Work

• Solving diffusion equations with rough coefficients in rough grids
• Matrix approach to mimetic discretizations for differential operators on nonuniform grids
• The numerical solution of diffusion problems in strongly heterogeneous non-isotropic materials
• Adjoint operators for the natural discretizations of the divergence, gradient and curl on logically rectangular grids
• The convergence of mimetic discretization for rough grids
• Linear systems arising for second order mimetic divergence and gradient discretizations
• Approximation of boundary conditions for mimetic finite-difference methods
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Parallel Preconditioning with Sparse Approximate Inverses
• A Matrix Analysis Approach to Higher-Order Approximations for Divergence and Gradients Satisfying a Global Conservation Law
• ILUT: A dual threshold incomplete LU factorization
• Conservative Finite-Difference Methods on General Grids
• Fourth- and sixth-order conservative finite difference approximations of the divergence and gradient

This page was built for publication: Large sparse linear systems arising from mimetic discretization