Recursive computational algorithms for a set of block pulse operational matrices
A set of integral operational matrices, which are superior to the conventional and generalized integral operational matrices in the identification of time-varying linear systems via block pulse functions, can be calculated efficiently by the new recursive computational algorithms which are proposed...
Uložené v:
| Vydané v: | International journal of systems science Ročník 23; číslo 11; s. 1921 - 1935 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
London
Taylor & Francis Group
01.11.1992
Taylor & Francis |
| Predmet: | |
| ISSN: | 0020-7721, 1464-5319 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | A set of integral operational matrices, which are superior to the conventional and generalized integral operational matrices in the identification of time-varying linear systems via block pulse functions, can be calculated efficiently by the new recursive computational algorithms which are proposed in this paper. As the basis of these algorithms, the constant difference properties of entries of the set of operational matrices are proved. And as the advantage of these algorithms, the reduction of their computational size is discussed. The proposed algorithms are especially useful when the number of block pulses is large in realistic applications of the block pulse function method. |
|---|---|
| AbstractList | A set of integral operational matrices, which are superior to the conventional and generalized integral operational matrices in the identification of time-varying linear systems via block pulse functions, can be calculated efficiently by the new recursive computational algorithms which are proposed in this paper. As the basis of these algorithms, the constant difference properties of entries of the set of operational matrices are proved. And as the advantage of these algorithms, the reduction of their computational size is discussed. The proposed algorithms are especially useful when the number of block pulses is large in realistic applications of the block pulse function method. |
| Author | JIANG, Z. H. SCHAUFELBERGER, W. |
| Author_xml | – sequence: 1 givenname: Z. H. surname: JIANG fullname: JIANG, Z. H. organization: Project Center IDA, Swiss Federal Institute of Technology (ETH) – sequence: 2 givenname: W. surname: SCHAUFELBERGER fullname: SCHAUFELBERGER, W. organization: Project Center IDA, Swiss Federal Institute of Technology (ETH) |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=4487790$$DView record in Pascal Francis |
| BookMark | eNp9kE1LAzEQhoNUsFZ_gLccvK5OvpoEvEjxCwqK6HnJpolGdzdLslX6792y9qLoaQ7zPC8z7yGatLF1CJ0QOCOg4ByAgpRUU1Caa85gD00Jn_NCMKInaLrdFwNADtBhzm8AIASFKXp4dHadcvhw2MamW_emD7E1NTb1S0yhf20y9jFhg7PrcfS4qqN9x926zg7HzqUd35g-BevyEdr3Zlgef88Zer6-elrcFsv7m7vF5bKwjMq-4GruKKVWOS81lVJUXMiV9aTyKyW8MMCq1dxZygRnQjkNXhNlpFCEerCOzdDpmNuZbE3tk2ltyGWXQmPSpuRcSalhwOSI2RRzTs6XNow_9smEuiRQbvsrf_U3mOSHucv-z7kYndAOpTXmM6Z6VfZmU8e0u5D9rX8BEweG1A |
| CODEN | IJSYA9 |
| CitedBy_id | crossref_primary_10_1016_0016_0032_95_00057_7 |
| Cites_doi | 10.1016/0016-0032(77)90029-1 10.1080/00207178408933294 10.1080/00207178708933719 10.1080/00207178208932875 10.1049/piee.1977.0119 10.1080/00207728508926775 |
| ContentType | Journal Article |
| Copyright | Copyright Taylor & Francis Group, LLC 1992 1993 INIST-CNRS |
| Copyright_xml | – notice: Copyright Taylor & Francis Group, LLC 1992 – notice: 1993 INIST-CNRS |
| DBID | AAYXX CITATION IQODW |
| DOI | 10.1080/00207729208949430 |
| DatabaseName | CrossRef Pascal-Francis |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Applied Sciences |
| EISSN | 1464-5319 |
| EndPage | 1935 |
| ExternalDocumentID | 4487790 10_1080_00207729208949430 8949430 |
| GroupedDBID | -~X .DC 07I 0R~ 1TA 4.4 4B5 5GY 5VS 8VB ABJNI ACGEJ ACGFS ACNCT ADCVX ADXEU ADXPE AEHZU AENEX AEPSL AEYOC AEZBV AFFNX AFION AGBLW AGYFW AKHJE AKMBP ALMA_UNASSIGNED_HOLDINGS ALXIB AQTUD AWYRJ BGSSV C0- C5H CS3 DEXXA DU5 EBS EJD F5P FETWF H13 HZ~ IFELN L8C MS~ NA5 NUSFT NX~ O9- P2P QWB TAJZE TAP TDBHL TFL TFW UB6 ZL0 ~02 .7F .QJ 0BK 29J 30N AAENE AAGDL AAHIA AAJMT AALDU AAMIU AAPUL AAQRR AAYJJ AAYXX ABCCY ABFIM ABHAV ABLIJ ABPAQ ABPEM ABTAI ABXUL ABXYU ACTIO ACTTO ADGTB ADUMR AEISY AEOZL AFBWG AFKVX AFRVT AGBKS AGDLA AGMYJ AGVKY AGWUF AHDZW AIJEM AIYEW AJWEG AKBVH AKOOK ALQZU ALRRR AQRUH AVBZW BLEHA BWMZZ CAG CCCUG CE4 CITATION COF CYRSC DAOYK DGEBU DKSSO E~A E~B GTTXZ HF~ H~P IPNFZ J.P KYCEM LJTGL M4Z OPCYK RIG RNANH ROSJB RTWRZ S-T SNACF T9H TASJS TBQAZ TEN TFT TNC TTHFI TUROJ TWF UT5 UU3 ZGOLN ZXP ~S~ ADYSH IQODW |
| ID | FETCH-LOGICAL-c327t-486e222c8ef792775b457dcf1bfd85f5a03bd6ec2354358e90f918a75812f0ce3 |
| IEDL.DBID | TFW |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=10_1080_00207729208949430&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0020-7721 |
| IngestDate | Wed Apr 02 07:24:57 EDT 2025 Sat Nov 29 02:12:24 EST 2025 Tue Nov 18 21:58:47 EST 2025 Mon Oct 20 23:46:27 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 11 |
| Keywords | Block pulse function Linear system Time- varying system Matrix method System identification Recursive algorithm Computing complexity |
| Language | English |
| License | CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c327t-486e222c8ef792775b457dcf1bfd85f5a03bd6ec2354358e90f918a75812f0ce3 |
| PageCount | 15 |
| ParticipantIDs | informaworld_taylorfrancis_310_1080_00207729208949430 pascalfrancis_primary_4487790 crossref_citationtrail_10_1080_00207729208949430 crossref_primary_10_1080_00207729208949430 |
| PublicationCentury | 1900 |
| PublicationDate | 1992-11-01 |
| PublicationDateYYYYMMDD | 1992-11-01 |
| PublicationDate_xml | – month: 11 year: 1992 text: 1992-11-01 day: 01 |
| PublicationDecade | 1990 |
| PublicationPlace | London |
| PublicationPlace_xml | – name: London |
| PublicationTitle | International journal of systems science |
| PublicationYear | 1992 |
| Publisher | Taylor & Francis Group Taylor & Francis |
| Publisher_xml | – name: Taylor & Francis Group – name: Taylor & Francis |
| References | CIT0003 CIT0002 CIT0005 CIT0004 CIT0006 CIT0001 |
| References_xml | – ident: CIT0001 doi: 10.1016/0016-0032(77)90029-1 – ident: CIT0002 doi: 10.1080/00207178408933294 – ident: CIT0006 doi: 10.1080/00207178708933719 – ident: CIT0005 doi: 10.1080/00207178208932875 – ident: CIT0004 doi: 10.1049/piee.1977.0119 – ident: CIT0003 doi: 10.1080/00207728508926775 |
| SSID | ssj0005520 |
| Score | 1.3843789 |
| Snippet | A set of integral operational matrices, which are superior to the conventional and generalized integral operational matrices in the identification of... |
| SourceID | pascalfrancis crossref informaworld |
| SourceType | Index Database Enrichment Source Publisher |
| StartPage | 1921 |
| SubjectTerms | Applied sciences Computer science; control theory; systems Control theory. Systems Exact sciences and technology Modelling and identification |
| Title | Recursive computational algorithms for a set of block pulse operational matrices |
| URI | https://www.tandfonline.com/doi/abs/10.1080/00207729208949430 |
| Volume | 23 |
| WOSCitedRecordID | wos10_1080_00207729208949430&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAWR databaseName: Taylor & Francis customDbUrl: eissn: 1464-5319 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0005520 issn: 0020-7721 databaseCode: TFW dateStart: 19701001 isFulltext: true titleUrlDefault: https://www.tandfonline.com providerName: Taylor & Francis |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1NS8MwGA4yPOjBb3HqJAdPQiH9SJMeRRyexpCJu5UmTXS4raPt_P2-SdO5ieyg9yQN-XreJ33yvAjdCh0wAGbq5bFmXpQH1EsARj2dhQzoCgS4ubbJJthgwMfjZOi0OZWTVRoOrRujCHtWm82diapVxJkX3MQEhQHhSWTsw-EEBtg323LUf_0WeFBnyggECYr77T_N31rYQKUNz1IjlswqGC_dJLpYQ5_-4T_7fYQOXNiJ75t1cox21PwE7a-ZEZ6i4bO5ejdqdixtqgd3TYiz6VtRTur3WYWhwzjDlapxobEAHPzAiyWAKy4WqmzLz6zrv6rO0Ev_cfTw5Ll8C54MA1Z7EY8VhAuSK82SgDEqIspyqX2hc041zUgo8ljJIKQQZHGVEJ34PAPG4QeaSBWeo868mKsLhIFHBZyahKKGgMcqEVrBZidE5iSnIu4i0o53Kp0ZucmJMU39lWfpj8HqortVlUXjxLGtMF2fxLS21x9uCtNwS73exmyvvgQs1jgzXv6x3Su0Z3W-9hHjNerU5VL10K78rCdVeWPX7RfdEOha |
| linkProvider | Taylor & Francis |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEF60CurBt1i1ugdPQmDz2GxyFLFUrKVIxd5Csg8ttk1JUn-_s8m2tiI96H1fzO7mm28y-w1C14lyGAAztYSvmOUJh1ohwKilYpcBXQEHV6iy2ATrdIJ-P-yagFtu0io1h1aVUET5rdaXWwejZylx-gk30V6hQ4LQ0_rh62iDAs5q7fxe8_U7xYMaWUagSNDenv3V_G2IJVxaUi3V6ZJxDhZTVamLBfxp7v135fto13ie-LY6KgdoTY4P0c6CHuER6j7r6LtOaMe8rPZgIoU4Hr6l2aB4H-UYVoxjnMsCpwonAIUfeDIFfMXpRGaz9qNS-F_mx-iled-7a1mm5ILFXYcVlhf4EjwGHkjFQocxmniUCa7sRImAKhoTNxG-5I5Lwc8KZEhUaAcxkA7bUYRL9wTVxulYniIMVMoJqK4pqjm4L8NESbjvhHBBBE38OiIzg0fc6JHrshjDyJ7Llv4wVh3dzLtMKjGOVY3p4i5GRRkBMXsYuSv6NZa2ez4TEFktznj2x3Gv0Far99SO2g-dx3O0Xab9lm8aL1CtyKaygTb5ZzHIs8vyEH8Bn4jshA |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEF60iujBt1i1ugdPQmDz2GxyFDUoSilSsbeQ7EOLbROS1N_vbB61FelB7_tidjYz3-bbbxC6jJXFIDBTQ7iKGY6wqOFDGDVUZDOAK5DgClUWm2DdrjcY-L2am5PXtEqNoVUlFFF-q_XhToVqGHH6BTfRSaFFPN_R8uGraA3SZlc7eD94_WZ40FqVERAStDebn5q_DbEQlhZESzVbMsrBYKqqdDEXfoKdfy58F23XeSe-rhxlD63IyT7amlMjPEC9Z333runsmJe1Hup7QhyN3pJsWLyPcwwLxhHOZYEThWMIhB84nUJ0xUkqs6b9uJT9l_khegnu-jf3Rl1wweC2xQrD8VwJ-QL3pGK-xRiNHcoEV2ashEcVjYgdC1dyy6aQZXnSJ8o3vQggh2kpwqV9hFqTZCKPEQYgZXlUVxTVCNyVfqwknHZCuCCCxm4bkcbeIa_VyHVRjFFozkRLfxirja5mXdJKimNZYzq_iWFR3n_UWxjaS_p1FnZ7NhPAWC3NePLHcS_QRu82CJ8euo-naLPk_JYPGs9Qq8imsoPW-WcxzLPz0oW_AOFq6zY |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Recursive+computational+algorithms+for+a+set+of+block+pulse+operational+matrices&rft.jtitle=International+journal+of+systems+science&rft.au=JIANG%2C+Z.+H&rft.au=SCHAUFELBERGER%2C+W&rft.date=1992-11-01&rft.pub=Taylor+%26+Francis&rft.issn=0020-7721&rft.volume=23&rft.issue=11&rft.spage=1921&rft.epage=1935&rft_id=info:doi/10.1080%2F00207729208949430&rft.externalDBID=n%2Fa&rft.externalDocID=4487790 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-7721&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-7721&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-7721&client=summon |