Search for a command to run...
The purpose of this paper is to develop and analyze a least-squares approximation to a first order system. The first order system represents a reformulation of a second order elliptic boundary value problem which may be indefinite and/or nonsymmetric. The approach taken here is novel in that the least-squares functional employed involves a discrete inner product which is related to the inner product in <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper H Superscript negative 1 Baseline left-parenthesis normal upper Omega right-parenthesis"> <mml:semantics> <mml:mrow> <mml:msup> <mml:mi>H</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mo>−</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:msup> <mml:mo stretchy="false">(</mml:mo> <mml:mi mathvariant="normal">Ω</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">H^{-1}(\Omega )</mml:annotation> </mml:semantics> </mml:math> </inline-formula> (the Sobolev space of order minus one on <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="normal upper Omega"> <mml:semantics> <mml:mi mathvariant="normal">Ω</mml:mi> <mml:annotation encoding="application/x-tex">\Omega</mml:annotation> </mml:semantics> </mml:math> </inline-formula>). The use of this inner product results in a method of approximation which is optimal with respect to the required regularity as well as the order of approximation even when applied to problems with low regularity solutions. In addition, the discrete system of equations which needs to be solved in order to compute the resulting approximation is easily preconditioned, thus providing an efficient method for solving the algebraic equations. The preconditioner for this discrete system only requires the construction of preconditioners for standard second order problems, a task which is well understood.
Published in: Mathematics of Computation
Volume 66, Issue 219, pp. 935-955