Repeated red-black ordering: A new approach
DOI10.1007/BF02140688zbMath0805.65032OpenAlexW2048559463MaRDI QIDQ1334273
Publication date: 2 February 1995
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02140688
convergencediscontinuous coefficientsfinite elementcondition numberiterative methodPoisson equationpreconditioned conjugate gradient methodred-black orderingsymmetric elliptic problems
Boundary value problems for second-order elliptic equations (35J25) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) 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)
Related Items
Uses Software
Cites Work
- Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems
- An incomplete-factorization preconditioning using repeated red-black ordering
- The effect of ordering on preconditioned conjugate gradients
- On modified incomplete cholesky factorization methods for the solution of problems with mixed boundary conditions and problems with discontinuous material conefficients
- A class of first order factorization methods
- Fourier Analysis of Iterative Methods for Elliptic pr
- An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference Equations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item