<?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-03-09T00:22:53Z</responseDate>
  <request metadataPrefix="jpcoar_1.0" verb="GetRecord" identifier="oai:ipsj.ixsq.nii.ac.jp:00233150">https://ipsj.ixsq.nii.ac.jp/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:ipsj.ixsq.nii.ac.jp:00233150</identifier>
        <datestamp>2025-01-19T10:11:39Z</datestamp>
        <setSpec>1164:2240:11467:11522</setSpec>
      </header>
      <metadata>
        <jpcoar:jpcoar xmlns:datacite="https://schema.datacite.org/meta/kernel-4/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcndl="http://ndl.go.jp/dcndl/terms/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:jpcoar="https://github.com/JPCOAR/schema/blob/master/1.0/" xmlns:oaire="http://namespace.openaire.eu/schema/oaire/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:rioxxterms="http://www.rioxx.net/schema/v2.0/rioxxterms/" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns="https://github.com/JPCOAR/schema/blob/master/1.0/" xsi:schemaLocation="https://github.com/JPCOAR/schema/blob/master/1.0/jpcoar_scm.xsd">
          <dc:title>マルチコンポーネント型多倍長精度浮動小数点演算を用いた複素LU分解の高性能化</dc:title>
          <dc:title xml:lang="en">Acceleration of complex LU decomposition with multi-component-type multiple-precision floating-point arithmetic</dc:title>
          <jpcoar:creator>
            <jpcoar:creatorName>幸谷, 智紀</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:subject subjectScheme="Other">数値解析</jpcoar:subject>
          <datacite:description descriptionType="Other">直接法は連立一次方程式を解くための代表的なアルゴリズムの一つであり，計算時間の大部分は LU 分解が占める．本講演では，マルチコンポーネント型多倍長精度浮動小数点演算を用いた複素 LU 分解の高速化について議論する．特に，3M 法に基づく複素行列乗算を用いることによる高速化の可能性について，MPLAPACK の直接法ルーチンと計算時間・誤差を比較するためのベンチマークテストを行った結果に基づいて考える．</datacite:description>
          <datacite:description descriptionType="Other">The Direct method is one of major algorithms to solve linear systems of equations, and LU decomposition shares large part of its computational time. In this talk, we discuss some ways to accelerate complex LU decomposition with multi-component-type multiple-precision floating-point arithmetic. The possibility to be more efficient using 3M method as complex matrix multiplication is especially considered in our benchmark test in order to compare with the implementation of direct method in MPLAPACK about computational time and numerical errors.</datacite:description>
          <dc:publisher xml:lang="ja">情報処理学会</dc:publisher>
          <datacite:date dateType="Issued">2024-03-11</datacite:date>
          <dc:language>jpn</dc:language>
          <dc:type rdf:resource="http://purl.org/coar/resource_type/c_18gh">technical report</dc:type>
          <jpcoar:identifier identifierType="URI">https://ipsj.ixsq.nii.ac.jp/records/233150</jpcoar:identifier>
          <jpcoar:sourceIdentifier identifierType="ISSN">2188-8841</jpcoar:sourceIdentifier>
          <jpcoar:sourceIdentifier identifierType="NCID">AN10463942</jpcoar:sourceIdentifier>
          <jpcoar:sourceTitle>研究報告ハイパフォーマンスコンピューティング（HPC）</jpcoar:sourceTitle>
          <jpcoar:volume>2024-HPC-193</jpcoar:volume>
          <jpcoar:issue>8</jpcoar:issue>
          <jpcoar:pageStart>1</jpcoar:pageStart>
          <jpcoar:pageEnd>6</jpcoar:pageEnd>
          <jpcoar:file>
            <jpcoar:URI label="IPSJ-HPC24193008.pdf">https://ipsj.ixsq.nii.ac.jp/record/233150/files/IPSJ-HPC24193008.pdf</jpcoar:URI>
            <jpcoar:mimeType>application/pdf</jpcoar:mimeType>
            <jpcoar:extent>2.0 MB</jpcoar:extent>
            <datacite:date dateType="Available">2026-03-11</datacite:date>
          </jpcoar:file>
        </jpcoar:jpcoar>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
