Uniform preconditioners for problems of negative order
This provides a more practical and general preconditioning method for computational scientists solving PDEs with negative-order operators.
The authors construct uniform preconditioners for negative-order operators discretized by piecewise polynomials, achieving linear cost in mesh cells and avoiding non-diagonal inverses or mesh grading assumptions.
Uniform preconditioners for operators of negative order discretized by (dis)continuous piecewise polynomials of any order are constructed from a boundedly invertible operator of opposite order discretized by continuous piecewise linears. Besides the cost of the application of the latter discretized operator, the other cost of the preconditioner scales linearly with the number of mesh cells. Compared to earlier proposals, the preconditioner has the following advantages: It does not require the inverse of a non-diagonal matrix; it applies without any mildly grading assumption on the mesh; and it does not require a barycentric refinement of the mesh underlying the trial space.