<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-00980591</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-16T04:33:56+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Nearly Optimal Computations with Structured Matrices</title>
            <author role="aut">
              <persName>
                <forename type="first">Victor Y.</forename>
                <surname>Pan</surname>
              </persName>
              <idno type="halauthorid">886045-0</idno>
              <affiliation ref="#struct-23048"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Elias</forename>
                <surname>Tsigaridas</surname>
              </persName>
              <email type="md5">2574bcae9f1455fd6cf3833a1e5e5277</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">elias-tsigaridas</idno>
              <idno type="idhal" notation="numeric">690</idno>
              <idno type="halauthorid" notation="string">19773-690</idno>
              <affiliation ref="#struct-179805"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Elias</forename>
                <surname>Tsigaridas</surname>
              </persName>
              <email type="md5">2574bcae9f1455fd6cf3833a1e5e5277</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2014-04-18 12:35:23</date>
              <date type="whenWritten">2014-04-10</date>
              <date type="whenModified">2025-02-26 15:24:03</date>
              <date type="whenReleased">2014-04-18 14:43:35</date>
              <date type="whenProduced">2014-07-28</date>
              <date type="whenEndEmbargoed">2014-04-18</date>
              <ref type="file" target="https://inria.hal.science/hal-00980591v1/document">
                <date notBefore="2014-04-18"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-00980591v1/file/pt-struct-snc.pdf" id="file-980591-715124">
                <date notBefore="2014-04-18"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/1404.4768"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="114831">
                <persName>
                  <forename>Elias</forename>
                  <surname>Tsigaridas</surname>
                </persName>
                <email type="md5">2574bcae9f1455fd6cf3833a1e5e5277</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00980591</idno>
            <idno type="halUri">https://inria.hal.science/hal-00980591</idno>
            <idno type="halBibtex">pan:hal-00980591</idno>
            <idno type="halRefHtml">&lt;i&gt;SNC '14 - Symposium on Symbolic-Numeric Computation&lt;/i&gt;, Jul 2014, Shanghai, China. pp.21-30, &lt;a target="_blank" href="https://dx.doi.org/10.1145/2631948.2631954"&gt;&amp;#x27E8;10.1145/2631948.2631954&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">SNC '14 - Symposium on Symbolic-Numeric Computation, Jul 2014, Shanghai, China. pp.21-30, &amp;#x27E8;10.1145/2631948.2631954&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-980591-715124"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UPMC" corresp="SORBONNE-UNIVERSITE">Université Pierre et Marie Curie</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="INRIA-ROCQ">INRIA Paris - Rocquencourt</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="LIP6" corresp="SORBONNE-UNIVERSITE">Laboratoire d'Informatique de Paris 6</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="UPMC_POLE_1" corresp="UPMC">UPMC Pôle 1</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
            <idno type="stamp" n="INRIA-ETATSUNIS">Copublications Inria-Etats-Unis</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Nearly Optimal Computations with Structured Matrices</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Victor Y.</forename>
                    <surname>Pan</surname>
                  </persName>
                  <idno type="halauthorid">886045-0</idno>
                  <affiliation ref="#struct-23048"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Elias</forename>
                    <surname>Tsigaridas</surname>
                  </persName>
                  <email type="md5">2574bcae9f1455fd6cf3833a1e5e5277</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">elias-tsigaridas</idno>
                  <idno type="idhal" notation="numeric">690</idno>
                  <idno type="halauthorid" notation="string">19773-690</idno>
                  <affiliation ref="#struct-179805"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Proceedings of the 2014 Symposium on Symbolic-Numeric Computation</title>
                <meeting>
                  <title>SNC '14 - Symposium on Symbolic-Numeric Computation</title>
                  <date type="start">2014-07-28</date>
                  <date type="end">2014-07-31</date>
                  <settlement>Shanghai</settlement>
                  <country key="CN">China</country>
                </meeting>
                <imprint>
                  <biblScope unit="pp">21-30</biblScope>
                </imprint>
              </monogr>
              <idno type="arxiv">1404.4768</idno>
              <idno type="doi">10.1145/2631948.2631954</idno>
              <ref type="publisher">http://symbolic-numeric-computation.org/snc-2014/</ref>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">precision of computing</term>
                <term xml:lang="en">interpolation</term>
                <term xml:lang="en">multipoint evaluation</term>
                <term xml:lang="en">rational functions</term>
                <term xml:lang="en">approximate computations</term>
                <term xml:lang="en">Boolean comlexity</term>
                <term xml:lang="en">fast polynomial division</term>
                <term xml:lang="en">polynomials</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-sc">Computer Science [cs]/Symbolic Computation [cs.SC]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>We estimate the Boolean complexity of multiplication of structured matrices by a vector and the solution of nonsingular linear systems of equations with these matrices. We study four basic most popular classes, that is, Toeplitz, Hankel, Cauchy and Van\-der\-monde matrices, for which the cited computational problems are equivalent to the task of polynomial multiplication and division and polynomial and rational multipoint evaluation and interpolation. The Boolean cost estimates for the latter problems have been obtained by Kirrinnis in \cite{kirrinnis-joc-1998}, except for rational interpolation, which we supply now. All known Boolean cost estimates for these problems rely on using Kronecker product. This implies the $d$-fold precision increase for the $d$-th degree output, but we avoid such an increase by relying on distinct techniques based on employing FFT. Furthermore we simplify the analysis and make it more transparent by combining the representation of our tasks and algorithms in terms of both structured matrices and polynomials and rational functions. This also enables further extensions of our estimates to cover Trummer's important problem and computations with the popular classes of structured matrices that generalize the four cited basic matrix classes.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-23048" status="VALID">
          <orgName>Department of Mathematics and Computer Science [Lehman]</orgName>
          <desc>
            <address>
              <addrLine>Lehman College - 250 Bedford Park Boulevard West - Bronx, NY 10468</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">http://lehman.edu/academics/mathematics-computer-science/index.php</ref>
          </desc>
          <listRelation>
            <relation active="#struct-302931" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-179805" status="OLD">
          <idno type="RNSR">201221011R</idno>
          <orgName>Polynomial Systems</orgName>
          <orgName type="acronym">PolSys</orgName>
          <date type="start">2012-01-01</date>
          <date type="end">2015-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/polsys</ref>
          </desc>
          <listRelation>
            <relation active="#struct-233" type="direct"/>
            <relation active="#struct-93591" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
            <relation active="#struct-86790" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-302931" status="VALID">
          <idno type="ISNI">0000 0001 2298 5718</idno>
          <idno type="ROR">https://ror.org/00453a208</idno>
          <orgName>City University of New York [New York]</orgName>
          <orgName type="acronym">CUNY</orgName>
          <desc>
            <address>
              <addrLine>217 East 42 St, New York, NY 10017</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">http://www2.cuny.edu/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-233" status="OLD">
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>Laboratoire d'Informatique de Paris 6</orgName>
          <orgName type="acronym">LIP6</orgName>
          <date type="start">1997-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lip6.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-93591" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-93591" status="OLD">
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Université Pierre et Marie Curie - Paris 6</orgName>
          <orgName type="acronym">UPMC</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 place Jussieu - 75005 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.upmc.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-86790" status="OLD">
          <orgName>Inria Paris-Rocquencourt</orgName>
          <date type="end">2016-03-30</date>
          <desc>
            <address>
              <addrLine>INRIA Rocquencourt : Domaine de Voluceau, Rocquencourt B.P. 105 78153 le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/paris-rocquencourt</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>