%0 Journal Article %1 citeulike:8182369 %A Burman, Erik %D 2010 %J Comptes Rendus Mathematique %K 65n85-fictitious-domain-methods 65f35-matrix-norms-conditioning-scaling %N 21-22 %P 1217--1220 %R 10.1016/j.crma.2010.10.006 %T Ghost Penalty %U http://dx.doi.org/10.1016/j.crma.2010.10.006 %V 348 %X In this Note we discuss a simple penalty method that allows to increase the robustness of fictitious domain methods. In particular the condition number of the matrix can be upper bounded independently of how the domain boundary intersects the computational mesh, under rather weak assumptions.

@article{citeulike:8182369, abstract = {{In this Note we discuss a simple penalty method that allows to increase the robustness of fictitious domain methods. In particular the condition number of the matrix can be upper bounded independently of how the domain boundary intersects the computational mesh, under rather weak assumptions.}}, added-at = {2017-06-29T07:13:07.000+0200}, author = {Burman, Erik}, biburl = {https://www.bibsonomy.org/bibtex/2aac9cdfc71d8c443173ec31988e2f16c/gdmcbain}, citeulike-article-id = {8182369}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.crma.2010.10.006}, day = 28, doi = {10.1016/j.crma.2010.10.006}, interhash = {08e2768ea26d09ac205d0423e1b1b445}, intrahash = {aac9cdfc71d8c443173ec31988e2f16c}, issn = {1631073X}, journal = {Comptes Rendus Mathematique}, keywords = {65n85-fictitious-domain-methods 65f35-matrix-norms-conditioning-scaling}, month = nov, number = {21-22}, pages = {1217--1220}, posted-at = {2017-03-01 00:02:35}, priority = {2}, timestamp = {2019-04-09T05:12:38.000+0200}, title = {{Ghost Penalty}}, url = {http://dx.doi.org/10.1016/j.crma.2010.10.006}, volume = 348, year = 2010 }