<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:burst="http://xmlns.com/burst/0.1/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns="http://purl.org/rss/1.0/" xmlns:admin="http://webns.net/mvcb/" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:cc="http://web.resource.org/cc/"><channel rdf:about="https://puma.ub.uni-stuttgart.de/group/simtech/method%20element"><title>PUMA publications for /group/simtech/method%20element</title><link>https://puma.ub.uni-stuttgart.de/group/simtech/method%20element</link><description>PUMA RSS feed for /group/simtech/method%20element</description><dc:date>2026-04-23T07:12:59+02:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/bibtex/20292151aa2bb96a8903133be3ddc0c68/mhartmann"/></rdf:Seq></items></channel><item rdf:about="https://puma.ub.uni-stuttgart.de/bibtex/20292151aa2bb96a8903133be3ddc0c68/mhartmann"><title>Time domain boundary elements for dynamic contact problems</title><link>https://puma.ub.uni-stuttgart.de/bibtex/20292151aa2bb96a8903133be3ddc0c68/mhartmann</link><dc:creator>mhartmann</dc:creator><dc:date>2018-07-20T10:54:15+02:00</dc:date><dc:subject>method element Boundary vorlaeufig </dc:subject><content:encoded>&lt;span data-person-type=&#034;author&#034; class=&#034;authorEditorList &#034;&gt;&lt;span&gt;&lt;span itemtype=&#034;http://schema.org/Person&#034; itemscope=&#034;itemscope&#034; itemprop=&#034;author&#034;&gt;&lt;a title=&#034;H. Gimperlein&#034; itemprop=&#034;url&#034; href=&#034;/person/16d1c4375c318fb277b3b3e46876b9aad/author/0&#034;&gt;&lt;span itemprop=&#034;name&#034;&gt;H. Gimperlein&lt;/span&gt;&lt;/a&gt;&lt;/span&gt;, &lt;/span&gt;&lt;span&gt;&lt;span itemtype=&#034;http://schema.org/Person&#034; itemscope=&#034;itemscope&#034; itemprop=&#034;author&#034;&gt;&lt;a title=&#034;F. Meyer&#034; itemprop=&#034;url&#034; href=&#034;/person/16d1c4375c318fb277b3b3e46876b9aad/author/1&#034;&gt;&lt;span itemprop=&#034;name&#034;&gt;F. Meyer&lt;/span&gt;&lt;/a&gt;&lt;/span&gt;, &lt;/span&gt;&lt;span&gt;&lt;span itemtype=&#034;http://schema.org/Person&#034; itemscope=&#034;itemscope&#034; itemprop=&#034;author&#034;&gt;&lt;a title=&#034;C. �zdemir&#034; itemprop=&#034;url&#034; href=&#034;/person/16d1c4375c318fb277b3b3e46876b9aad/author/2&#034;&gt;&lt;span itemprop=&#034;name&#034;&gt;C. �zdemir&lt;/span&gt;&lt;/a&gt;&lt;/span&gt;, &lt;/span&gt; und &lt;span&gt;&lt;span itemtype=&#034;http://schema.org/Person&#034; itemscope=&#034;itemscope&#034; itemprop=&#034;author&#034;&gt;&lt;a title=&#034;E. P. Stephan&#034; itemprop=&#034;url&#034; href=&#034;/person/16d1c4375c318fb277b3b3e46876b9aad/author/3&#034;&gt;&lt;span itemprop=&#034;name&#034;&gt;E. Stephan&lt;/span&gt;&lt;/a&gt;&lt;/span&gt;&lt;/span&gt;. &lt;/span&gt;&lt;span class=&#034;additional-entrytype-information&#034;&gt;&lt;span itemtype=&#034;http://schema.org/PublicationIssue&#034; itemscope=&#034;itemscope&#034; itemprop=&#034;isPartOf&#034;&gt;&lt;em&gt;&lt;span itemprop=&#034;journal&#034;&gt;Computer Methods in Applied Mechanics and Engineering&lt;/span&gt;, &lt;/em&gt;  &lt;/span&gt;(&lt;em&gt;&lt;span&gt;2018&lt;meta content=&#034;2018&#034; itemprop=&#034;datePublished&#034;/&gt;&lt;/span&gt;&lt;/em&gt;)&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/method"/><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/element"/><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/Boundary"/><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/vorlaeufig"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="https://puma.ub.uni-stuttgart.de/bibtex/20292151aa2bb96a8903133be3ddc0c68/mhartmann"><owl:sameAs rdf:resource="/uri/bibtex/20292151aa2bb96a8903133be3ddc0c68/mhartmann"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="https://www.sciencedirect.com/science/article/pii/S0045782518300276"/><swrc:date>Fri Jul 20 10:54:15 CEST 2018</swrc:date><swrc:journal>Computer Methods in Applied Mechanics and Engineering</swrc:journal><swrc:pages>147 - 175</swrc:pages><swrc:title>Time domain boundary elements for dynamic contact problems</swrc:title><swrc:volume>333</swrc:volume><swrc:year>2018</swrc:year><swrc:keywords>method element Boundary vorlaeufig </swrc:keywords><swrc:abstract>Abstract This article considers a unilateral contact problem for the
	wave equation. The problem is reduced to a variational inequality
	for the Dirichlet-to-Neumann operator for the wave equation on the
	boundary, which is solved in a saddle point formulation using boundary
	elements in the time domain. As a model problem, also a variational
	inequality for the single layer operator is considered. A priori
	estimates are obtained for Galerkin approximations both to the variational
	inequality and the mixed formulation in the case of a flat contact
	area, where the existence of solutions to the continuous problem
	is known. Numerical experiments demonstrate the performance of the
	proposed mixed method. They indicate the stability and convergence
	beyond flat geometries.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="0045-7825" swrc:key="issn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="meyerfn" swrc:key="owner"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="https://doi.org/10.1016/j.cma.2018.01.025" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="H. Gimperlein"/></rdf:_1><rdf:_2><swrc:Person swrc:name="F. Meyer"/></rdf:_2><rdf:_3><swrc:Person swrc:name="C. �zdemir"/></rdf:_3><rdf:_4><swrc:Person swrc:name="E. P. Stephan"/></rdf:_4></rdf:Seq></swrc:author></rdf:Description></burst:publication></item></rdf:RDF>