On the convergence of Uzawa's method for the solution of biharmonic problem
The author considers the numerical solution of the biharmonic problem with linear and quadratic mixed finite elements. The approximate problems are solved by Uzawa's method. Explicit asymptotic convergence rates are shown and from these a lower bound on the number n of iterations is obtained that are needed to have a truncation error for the iteration of the same order as the discretization error. The bound turns out as \(n\geq ch^{-1}| \ln h|\) for linear finite elements and roughly four times that for quadratic elements. It is, however, assumed that the parameter in Uzawa's method is chosen equal to an in general unknown quantity for which only a lower bound is quoted from the literature.
- Zur numerischen Lösung des ersten biharmonischen Randwertproblems. (On the numerical solution of the first biharmonic boundary value problem)
- scientific article; zbMATH DE number 3901957
- scientific article; zbMATH DE number 3926395
- On the convergence factor of Uzawa's algorithm
- scientific article; zbMATH DE number 3915572
- A mixed method for 4th order problems using linear finite elements
- Dual iterative techniques for solving a finite element approximation of the biharmonic equation
- scientific article; zbMATH DE number 3596197 (Why is no real title available?)
- The Coupled Equation Approach to the Numerical Solution of the Biharmonic Equation by finite Differences. I
This page was built for publication: On the convergence of Uzawa's method for the solution of biharmonic problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q760769)
