<?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-10-14T03:58:25Z</responseDate>
  <request identifier="1438" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:1438</identifier>
        <datestamp>2024-03-06T10:07:53Z</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>Improving the Performance of a Verified Linear System Solver Using Optimized Libraries and Parallel Computation</dc:title>
          <dc:creator>Kolberg, Mariana</dc:creator>
          <dc:creator>Bohlender, Gerd</dc:creator>
          <dc:creator>Claudio, Dalcidio</dc:creator>
          <dc:subject>Linear systems</dc:subject>
          <dc:subject>result verification</dc:subject>
          <dc:subject>parallel computing</dc:subject>
          <dc:description>A parallel version of the self-verified method for solving linear systems&#13;
was presented on PARA and VECPAR conferences in 2006. In this research we propose improvements aiming&#13;
at a better performance. The idea is to implement an algorithm that uses technologies&#13;
as MPI communication primitives associated to libraries as LAPACK,&#13;
BLAS and C-XSC, aiming to provide both self-verification and speed-up at the&#13;
same time. The algorithms should find an enclosure even for very ill-conditioned&#13;
problems. In this scenario, a parallel version of a self-verified solver for dense&#13;
linear systems appears to be essential in order to solve bigger problems. Moreover,&#13;
the major goal of this research is to provide a free, fast, reliable and accurate&#13;
solver for dense linear systems.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Mariana Kolberg and Gerd Bohlender and Dalcidio Claudio</dc:contributor>
          <dc:date>2008</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 8021, Numerical Validation in Current Hardware Architectures (2008)</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.08021.13</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-14386</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08021.13</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>
