<?xml version="1.0" encoding="UTF-8"?>
<collection>
<dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" 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:identifier>doi:10.1007/s10915-019-00975-6</dc:identifier><dc:language>eng</dc:language><dc:creator>Delgado, Jorge</dc:creator><dc:creator>Orera, Héctor</dc:creator><dc:creator>Peña, J.M.</dc:creator><dc:title>Accurate Algorithms for Bessel Matrices</dc:title><dc:identifier>ART-2019-112511</dc:identifier><dc:description>In this paper, we prove that any collocation matrix of Bessel polynomials at positive points is strictly totally positive, that is, all its minors are positive. Moreover, an accurate method to construct the bidiagonal factorization of these matrices is obtained and used to compute with high relative accuracy the eigenvalues, singular values and inverses. Similar results for the collocation matrices for the reverse Bessel polynomials are also obtained. Numerical examples illustrating the theoretical results are included. © 2019, Springer Science+Business Media, LLC, part of Springer Nature.</dc:description><dc:date>2019</dc:date><dc:source>http://zaguan.unizar.es/record/148441</dc:source><dc:doi>10.1007/s10915-019-00975-6</dc:doi><dc:identifier>http://zaguan.unizar.es/record/148441</dc:identifier><dc:identifier>oai:zaguan.unizar.es:148441</dc:identifier><dc:relation>info:eu-repo/grantAgreement/ES/DGA/E41-17R</dc:relation><dc:relation>info:eu-repo/grantAgreement/ES/MCIU-AEI/PGC2018-096321-B-I00</dc:relation><dc:identifier.citation>Journal of Scientific Computing 80, 2 (2019), 1264–1278</dc:identifier.citation><dc:rights>All rights reserved</dc:rights><dc:rights>http://www.europeana.eu/rights/rr-f/</dc:rights><dc:rights>info:eu-repo/semantics/openAccess</dc:rights></dc:dc>

</collection>