Utilizaţi acest identificator pentru a cita sau a face link la acest document:
https://dspace.upt.ro/xmlui/handle/123456789/8076| Titlu: | Wold decomposition for operators close isometries [articol] |
| Autori: | Manolescu, Laura |
| Subiecte: | Wold decomposition Wandering subspace Left invertible operators Random processes Frames in Hilbert spaces |
| Data publicării: | 2022 |
| Editura: | Timişoara: Editura Politehnica |
| Citare: | Manolescu, Laura. Wold decomposition for operators close isometries. Timişoara: Editura Politehnica, 2022. Disponibil la: https://doi.org/10.59168/BFCQ9403 |
| Serie/Nr. raport: | Scientific Bulletin of the Politehnica University Timisoara, Romania Transactions On Mathematics & Physics=Buletinul Ştiinţific al Universităţii Politehnica Timişoara, România Seria Matematică - Fizică;67(81) |
| Abstract: | The Wold decomposition theorem is used to decompose a wide sense stationary random process into its deterministic and purely nondeterministic parts and, also, has an important role in signal processing, factorization theory and the description of dilations in Hilbert spaces. In geometric language, this means that an isometry is a direct sum between an unitary operator and a shift. In Bergman and Dirichlet spaces, the shift operator is not an isometry, but it is a left invertible operator. In this paper we give conditions on the left invertible operators such that a operator version, in the sense of Rosenblum and Rovnyak, of the Wold decomposition to take place. |
| URI: | https://www.upt.ro/Informatii_seria-matematica_294_ro.html https://search.crossref.org/search/works?q=10.59168%2FBFCQ9403&from_ui=yes Link DOI |
| ISSN: | 1224-6069 |
| Colecţia: | Articole științifice/Scientific articles |
Fişierele documentului:
| Fişier | Descriere | Mărime | Format | |
|---|---|---|---|---|
| BUPT_ART_Manolescu_f.pdf | 286.08 kB | Adobe PDF | Vizualizare/Deschidere |
Documentele din DSpace sunt protejate de legea dreptului de autor, cu toate drepturile rezervate, mai puţin cele indicate în mod explicit.