<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-20T12:07:27Z</responseDate>
  <request identifier="2094" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2094</identifier>
        <datestamp>2024-03-06T11:08:35Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Stabilising aggregation AMG</dc:title>
          <dc:creator>Hülsemann, Frank</dc:creator>
          <dc:subject>Algebraic multigrid</dc:subject>
          <dc:subject>aggregation</dc:subject>
          <dc:subject>stabilisation</dc:subject>
          <dc:description>When applied to linear systems arising from scalar elliptic partial differential equations,  algebraic multigrid (AMG) schemes based on aggregation exhibit a mesh size dependent convergence behaviour.  As the number of iterations increases with the number of unknowns in the linear system, the computational  complexity of such a scheme is non-optimal. This contribution presents a stabilisation of the aggregation  AMG algorithm which adds a number of subspace projection steps at different stages of the algorithm and &#13;
allows for variable cycling strategies. Numerical results illustrate the advantage of the stabilised algorithm over its  original formulation.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Frank Hülsemann</dc:contributor>
          <dc:date>2009</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 9061, Combinatorial Scientific Computing (2009)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.09061.17</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-20946</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.17</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
