<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/A4878504-B506-449E-A74D-9D0777EDEA2F"><efrbr-work:titleOfTheWork>Efficient Levinson and Schur-type algorithms for block near-to-Toeplitz systems of equations</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/A4878504-B506-449E-A74D-9D0777EDEA2F"><efrbr-expression:titleOfTheExpression>Efficient Levinson and Schur-type algorithms for block near-to-Toeplitz systems of equations</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Peer-Reviewed Journal Publication
            Δημοσίευση σε Περιοδικό με Κριτές
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2015-11-08</efrbr-expression:dateOfExpression><efrbr-expression:dateOfExpression type="published">1994</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>In this paper new efficient Levinson- and Schur-type algorithms are derived for block near-to-Toeplitz systems of equations. In contrast to previously derived algorithms, the block near-to-Toeplitz property is exploited on a scalar level leading to Levinson- and Schur-type algorithms based on scalar instead of matrix operations. As a consequence, the highly parallel Schur-type algorithm can be implemented in a straightforward way on a linear array processor, consisting of scalar operators locally connected.</efrbr-expression:summarizationOfContent><efrbr-expression:useRestrictionsOnTheExpression type="creative-commons">http://creativecommons.org/licenses/by/4.0/</efrbr-expression:useRestrictionsOnTheExpression><efrbr-expression:note type="journal name">Signal Processing </efrbr-expression:note><efrbr-expression:note type="journal volume">3</efrbr-expression:note><efrbr-expression:note type="journal number">35</efrbr-expression:note><efrbr-expression:note type="page range">241–255</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/113547917"><efrbr-person:nameOfPerson vocabulary="VIAF">
            Theodoridis, Spyros
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-corporateBody:corporateBody identifier="http://www.elsevier.com/"><efrbr-corporateBody:nameOfTheCorporateBody vocabulary="S/R:PUBLISHERS">
            Elsevier
         </efrbr-corporateBody:nameOfTheCorporateBody></efrbr-corporateBody:corporateBody><efrbr-concept:concept identifier="55BDFE7A-3C32-4AB1-BC55-9636A9B3A9F2"><efrbr-concept:termForTheConcept>
            Levinson-type algorithms
         </efrbr-concept:termForTheConcept></efrbr-concept:concept></efrbr:entities><efrbr:relationships><efrbr-structure:structureRelations><efrbr-structure:realizedThrough sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/A4878504-B506-449E-A74D-9D0777EDEA2F" targetEntity="expression" targetURI="http://purl.tuc.gr/dl/dias/A4878504-B506-449E-A74D-9D0777EDEA2F"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/A4878504-B506-449E-A74D-9D0777EDEA2F" targetEntity="person" targetURI="http://users.isc.tuc.gr/~aliavas"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/A4878504-B506-449E-A74D-9D0777EDEA2F" targetEntity="person" targetURI="http://users.isc.tuc.gr/~aliavas" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/A4878504-B506-449E-A74D-9D0777EDEA2F" targetEntity="person" targetURI="http://viaf.org/viaf/113547917" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/A4878504-B506-449E-A74D-9D0777EDEA2F" targetEntity="person" targetURI="http://www.elsevier.com/" role="publisher"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/A4878504-B506-449E-A74D-9D0777EDEA2F" targetEntity="concept" targetURI="55BDFE7A-3C32-4AB1-BC55-9636A9B3A9F2"/></efrbr-subject:subjectRelations><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>