Dirichlet degrees of freedom need not be eliminated

Authors:
J. Maubach
Affiliations:
Eindhoven University of Technology, Postbus 513, NL-5600 MB Eindhoven, The Netherlands
Venue:
Applied Numerical Mathematics
Year:
2008

Citing 9
Cited 0

GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems

SIAM Journal on Scientific and Statistical Computing
A generalized conjugate gradient, least square method

Numerische Mathematik
Conjugate gradient type methods and preconditioning

Journal of Computational and Applied Mathematics - Special issue on iterative methods for the solution of linear systems
BI-CGSTAB: a fast and smoothly converging variant of BI-CG for the solution of nonsymmetric linear systems

SIAM Journal on Scientific and Statistical Computing
Factorized sparse approximate inverse preconditionings I: theory

SIAM Journal on Matrix Analysis and Applications
A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems

SIAM Journal on Scientific Computing
Toward an Effective Sparse Approximate Inverse Preconditioner

SIAM Journal on Matrix Analysis and Applications
Iterative solution of nonlinear equations in several variables

Iterative solution of nonlinear equations in several variables
Iterative Methods for Sparse Linear Systems

Iterative Methods for Sparse Linear Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dirichlet degrees of freedom are often eliminated from discretized initial value boundary value equations. This has advantages (creation of a symmetric system of equations and simplification of the equations) and a potential disadvantage (modification of the equations could lead to a more complex and less convenient implementation). This paper demonstrates that no elimination is needed to keep all elimination-related advantages - if one uses standard iterative solution techniques in a proper manner.