|
|
Detalji o izabranom predavanju:
| Seminar: | Seminar za numeričku matematiku i znan. računanje |
| Naziv predavanja: | Low rank matrix completion and tensor codes |
| Predavač: | Matt W. Larson, Stanford University, SAD |
| Vrijeme: |
13.06.2024 12:15 |
| Predavaonica: | 201 |
| Tip: |
Gost seminara |
| Opis: | The low rank matrix completion problem is to determine whether a matrix, some of whose entries have been filled in with generic complex numbers, can be completed so that it has rank at most r. I will explain why this problem is related to the problem of understanding tensor codes, certain error-correcting codes which are studied in information theory. |
|
|
