A Preconditioned Iterative Method for the Solution of the Biharmonic Problem (Q3340087)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3874552
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Preconditioned Iterative Method for the Solution of the Biharmonic Problem |
scientific article; zbMATH DE number 3874552 |
Statements
A Preconditioned Iterative Method for the Solution of the Biharmonic Problem (English)
0 references
1984
0 references
biharmonic equation
0 references
finite element
0 references
coupled iteration
0 references
preconditioned conjugate gradient method
0 references
computational complexity
0 references
0.8735875487327576
0 references
0.8668227195739746
0 references
0.8648611307144165
0 references
0.8621695041656494
0 references
A mixed variable variational formulation for the Dirichlet problem for the biharmonic equation on polygonal plane domains is studied. In the discretization arbitrary finite element approximations are used. The linear system is solved by coupled iteration using the preconditioned conjugate gradient method. The number of outer iterations is shown to grow as \(O(h^{-1})\), h a mesh parameter. The computational complexity is \(O(N_ 0^{1.5})\), \(N_ 0\to\infty \), where \(N_ 0\) is the number of unknowns. An \(O(N_ 0^{1.25})\) method is also presented. The storage requirement is optimal order \(O(N_ 0)\) and it is easy to program and implement.
0 references