<efrbr:recordSet xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:efrbr="http://vfrbr.info/efrbr/1.1" xmlns:efrbr-work="http://vfrbr.info/efrbr/1.1/work" xmlns:efrbr-expression="http://vfrbr.info/efrbr/1.1/expression" xmlns:efrbr-manifestation="http://vfrbr.info/efrbr/1.1/manifestation" xmlns:efrbr-person="http://vfrbr.info/efrbr/1.1/person" xmlns:efrbr-corporateBody="http://vfrbr.info/efrbr/1.1/corporateBody" xmlns:efrbr-concept="http://vfrbr.info/efrbr/1.1/concept" xmlns:efrbr-structure="http://vfrbr.info/efrbr/1.1/structure" xmlns:efrbr-responsible="http://vfrbr.info/efrbr/1.1/responsible" xmlns:efrbr-subject="http://vfrbr.info/efrbr/1.1/subject" xmlns:efrbr-other="http://vfrbr.info/efrbr/1.1/other" xsi:schemaLocation="http://vfrbr.info/efrbr/1.1 http://vfrbr.info/schemas/1.1/efrbr.xsd"><efrbr:entities><efrbr-work:work identifier="http://purl.tuc.gr/dl/dias/8283D1E3-F08F-4857-B128-A2F810183A56"><efrbr-work:titleOfTheWork>Numerical accuracy issues of recursive least squares algorithms</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/8283D1E3-F08F-4857-B128-A2F810183A56"><efrbr-expression:titleOfTheExpression>Numerical accuracy issues of recursive least squares algorithms</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Πλήρης Δημοσίευση σε Συνέδριο
            Conference Full Paper
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2015-11-09</efrbr-expression:dateOfExpression><efrbr-expression:dateOfExpression type="published">1998</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>The continuous use of adaptive algorithms is strongly dependent on their behavior in finite-precision environments. We study the nonlinear round-off error accumulation system of the conventional RLS algorithm and we derive bounds for the relative precision of the computations and the accumulated round-off error, which guarantee the numerical stability of the finite-precision implementation of the algorithm. The bounds depend on the conditioning of the problem and the exponential forgetting factor. Simulations agree with our theoretical results</efrbr-expression:summarizationOfContent><efrbr-expression:useRestrictionsOnTheExpression type="creative-commons">http://creativecommons.org/licenses/by/4.0/</efrbr-expression:useRestrictionsOnTheExpression><efrbr-expression:note type="page range">1409 - 1412</efrbr-expression:note><efrbr-expression:note type="conference name">IEEE International  Conference  Acoustics, Speech and Signal Processing</efrbr-expression:note></efrbr-expression:expression><efrbr-person:person identifier="http://users.isc.tuc.gr/~aliavas"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Liavas Athanasios
            Λιαβας Αθανασιος
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://viaf.org/viaf/26294699"><efrbr-person:nameOfPerson vocabulary="VIAF">
            Regalia, Phillip A., 1962-
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-corporateBody:corporateBody identifier="http://www.ieee.org/index.html"><efrbr-corporateBody:nameOfTheCorporateBody vocabulary="S/R:PUBLISHERS">
            Institute of Electrical and Electronics Engineers
         </efrbr-corporateBody:nameOfTheCorporateBody></efrbr-corporateBody:corporateBody><efrbr-concept:concept identifier="0BEDA245-1DCE-4CA9-9763-FABC10C2F903"><efrbr-concept:termForTheConcept>
            Adaptive algorithms
         </efrbr-concept:termForTheConcept></efrbr-concept:concept></efrbr:entities><efrbr:relationships><efrbr-structure:structureRelations><efrbr-structure:realizedThrough sourceEntity="work" targetEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/8283D1E3-F08F-4857-B128-A2F810183A56" targetURI="http://purl.tuc.gr/dl/dias/8283D1E3-F08F-4857-B128-A2F810183A56"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/8283D1E3-F08F-4857-B128-A2F810183A56" targetURI="http://users.isc.tuc.gr/~aliavas"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/8283D1E3-F08F-4857-B128-A2F810183A56" targetURI="http://users.isc.tuc.gr/~aliavas"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/8283D1E3-F08F-4857-B128-A2F810183A56" targetURI="http://viaf.org/viaf/26294699"/><efrbr-responsible:realizedBy sourceEntity="expression" role="publisher" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/8283D1E3-F08F-4857-B128-A2F810183A56" targetURI="http://www.ieee.org/index.html"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations><efrbr-subject:hasSubject sourceEntity="work" targetEntity="concept" sourceURI="http://purl.tuc.gr/dl/dias/8283D1E3-F08F-4857-B128-A2F810183A56" targetURI="0BEDA245-1DCE-4CA9-9763-FABC10C2F903"/></efrbr-subject:subjectRelations><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>