Incremental Unknowns in Finite Differences: Condition Number of the Matrix

From MaRDI portal





The authors apply the method of incremental unknowns to multilevel finite difference approximations of linear second order elliptic boundary value problems. Roughly speaking, in a two-level setting the incremental unknowns consist of the nodal values at the coarse grid points and, for the fine grid points, of the increment to the averaged value a the neighbouring coarse grid points. Evidently, there is a close relationship to \textit{H. Yserentant}'s hierarchical basis finite element method [Numer. Math. 49, 379-412 (1986; Zbl 0608.65065)] but it should be emphasized that the two methods are not the same. In case of the Dirichlet problem and spatial step size \(h\) it is shown that the condition number behaves like \(O((\log h)^ 2)\) compared to \(O(h^{-2})\) for the standard nodal unknowns. The theoretical results are supported by several numerical examples.




Cited in
(35)








This page was built for publication: Incremental Unknowns in Finite Differences: Condition Number of the Matrix

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