Informatsionnye Tekhnologii i Vychslitel'nye Sistemy
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Informatsionnye Tekhnologii i Vychslitel'nye Sistemy:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Informatsionnye Tekhnologii i Vychslitel'nye Sistemy, 2018, Issue 1, Pages 8–15 (Mi itvs289)  
INTELLIGENT SYSTEMS AND TECHNOLOGIES

Entropy methad of compression matrices with random elements

Yu. S. Popkov

ISA FRC CSC RAS
Full-text PDF (374 kB)
Abstract: Two-stages method of compression matrices with random elements is proposed. Operation of direct and invers projections are the kernal of method. The information cross-entropy is used for optimization these operations. Serial and parallel procedures are proposed.
Keywords: cross-entropy, projection operator, matrix derivatives, gradient method.
Funding agency Grant number
Russian Foundation for Basic Research 17-07-00286
17-29-03119
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: Yu. S. Popkov, “Entropy methad of compression matrices with random elements”, Informatsionnye Tekhnologii i Vychslitel'nye Sistemy, 2018, no. 1, 8–15
Citation in format AMSBIB
\Bibitem{Pop18}
\by Yu.~S.~Popkov
\paper Entropy methad of compression matrices with random elements
\jour Informatsionnye Tekhnologii i Vychslitel'nye Sistemy
\yr 2018
\issue 1
\pages 8--15
\mathnet{http://mi.mathnet.ru/itvs289}
\elib{https://elibrary.ru/item.asp?id=32660140}
Linking options:
  • https://www.mathnet.ru/eng/itvs289
  • https://www.mathnet.ru/eng/itvs/y2018/i1/p8
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Informatsionnye Tekhnologii i Vychslitel'nye Sistemy
    Statistics & downloads:
    Abstract page:176
    Full-text PDF :195
    References:2
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025