54
Views
3
CrossRef citations to date
0
Altmetric
Original Articles

A FULLY DISCRETE GALERKIN SCHEME FOR A TWO-FOLD SADDLE POINT FORMULATION OF AN EXTERIOR NONLINEAR PROBLEM*

&
Pages 885-912 | Published online: 17 Aug 2006
 

Abstract

We analyze a fully discrete Galerkin method for the coupling of mixed finite elements and boundary elements as applied to an exterior nonlinear transmission problem arising in potential theory. We first show that the corresponding continuous formulation becomes a well posed two-fold saddle point problem. Our discrete approach uses Raviart-Thomas elements of lowest order and is based on simple quadrature formulas for the interior and boundary terms. We prove that, if the parameter of discretization is sufficiently small, the fully discrete Galerkin scheme is uniquely solvable and leads to optimal error estimates.

*This research was partially supported by Fondecyt-Chile through the FONDAP Program in Applied Mathematics, by the Dirección de Investigación of the Universidad de Concepción through the Advanced Research Groups Program, and by D.G.E.S. through the project PB98-1564.

Acknowledgments

Notes

*This research was partially supported by Fondecyt-Chile through the FONDAP Program in Applied Mathematics, by the Dirección de Investigación of the Universidad de Concepción through the Advanced Research Groups Program, and by D.G.E.S. through the project PB98-1564.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.