<?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-04-16T18:52:40Z</responseDate>
  <request verb="GetRecord" metadataPrefix="oai_dc" identifier="oai:ipsj.ixsq.nii.ac.jp:00212232">https://ipsj.ixsq.nii.ac.jp/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:ipsj.ixsq.nii.ac.jp:00212232</identifier>
        <datestamp>2025-01-19T17:33:57Z</datestamp>
        <setSpec>934:989:10456:10630</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns="http://www.w3.org/2001/XMLSchema" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>On an Implementation of the One-Sided Jacobi Method With High Accuracy</dc:title>
          <dc:title>On an Implementation of the One-Sided Jacobi Method With High Accuracy</dc:title>
          <dc:creator>Masami, Takata</dc:creator>
          <dc:creator>Sho, Araki</dc:creator>
          <dc:creator>Takahiro, Miyamae</dc:creator>
          <dc:creator>Kinji, Kimura</dc:creator>
          <dc:creator>Yoshimasa, Nakamura</dc:creator>
          <dc:creator>Masami, Takata</dc:creator>
          <dc:creator>Sho, Araki</dc:creator>
          <dc:creator>Takahiro, Miyamae</dc:creator>
          <dc:creator>Kinji, Kimura</dc:creator>
          <dc:creator>Yoshimasa, Nakamura</dc:creator>
          <dc:subject>[オリジナル論文] Singular value decomposition, Jacobi method, false-position method, secant method</dc:subject>
          <dc:description>The one-sided Jacobi method for performing singular value decomposition can compute all singular values and singular vectors with high accuracy. Additionally, the computation cost is insignificant for comparatively small matrices. However, in the case of the conventional implementation in Linear Algebra PACKage, the subroutine may not be able to compute a singular vector with sufficient orthogonality. To avoid this problem, we propose a novel implementation of the one-sided Jacobi method. In the proposed implementation, a Givens rotation with high accuracy and fused multiply-accumulate are adopted.</dc:description>
          <dc:description>The one-sided Jacobi method for performing singular value decomposition can compute all singular values and singular vectors with high accuracy. Additionally, the computation cost is insignificant for comparatively small matrices. However, in the case of the conventional implementation in Linear Algebra PACKage, the subroutine may not be able to compute a singular vector with sufficient orthogonality. To avoid this problem, we propose a novel implementation of the one-sided Jacobi method. In the proposed implementation, a Givens rotation with high accuracy and fused multiply-accumulate are adopted.</dc:description>
          <dc:description>journal article</dc:description>
          <dc:publisher>情報処理学会</dc:publisher>
          <dc:date>2021-08-10</dc:date>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>情報処理学会論文誌数理モデル化と応用（TOM）</dc:identifier>
          <dc:identifier>3</dc:identifier>
          <dc:identifier>14</dc:identifier>
          <dc:identifier>68</dc:identifier>
          <dc:identifier>75</dc:identifier>
          <dc:identifier>1882-7780</dc:identifier>
          <dc:identifier>AA11464803</dc:identifier>
          <dc:identifier>https://ipsj.ixsq.nii.ac.jp/record/212232/files/IPSJ-TOM1403007.pdf</dc:identifier>
          <dc:language>eng</dc:language>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
