Large sparse linear systems arising from mimetic discretization

DOI10.1016/J.CAMWA.2006.08.034zbMATH Open1132.65022OpenAlexW2020496942MaRDI QIDQ2469908FDOQ2469908

Authors: 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

Recommendations

• Iterative methods and preconditioning for large and sparse linear systems with applications
• scientific article; zbMATH DE number 4001313
• scientific article; zbMATH DE number 1953444
• Preconditioned iterative methods for sparse linear algebra problems arising in circuit simulation
• Iterative solution of large sparse systems of equations. Transl. from the German

zbMATH Keywords

preconditioningnumerical experimentsboundary value problemiterative methodsPoisson equationGMRESlarge 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)

Cites Work

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

Cited In (6)

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

Uses Software

• ILUT

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

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