Logo BSU

Please use this identifier to cite or link to this item: https://elib.bsu.by/handle/123456789/10096
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPilipchuk, L. A.-
dc.contributor.authorRomanovski, I. V.-
dc.date.accessioned2012-05-26T09:38:26Z-
dc.date.available2012-05-26T09:38:26Z-
dc.date.issued2006-
dc.identifier.citationPilipchuk, L.A. Fractal-like Matrices / I.V. Romanovski, L.A. Pilipchuk // Computing, 76, Austria. – 2006. – P. 353-357.-
dc.identifier.urihttp://elib.bsu.by/handle/123456789/10096-
dc.description.abstractWe introduce special sparse matrices. Their structure is inherited from the famous Sierpinski triangle and is not sensitive to matrix multiplication and inversion. The arithmetical complexity of taking product or inverse of such matrices is proved to be O(n^2).ru
dc.language.isoenru
dc.subjectЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Математикаru
dc.titleFractal-like Matricesru
dc.typeArticleru
Appears in Collections:Статьи факультета прикладной математики и информатики

Files in This Item:
File Description SizeFormat 
PLA_Fractal-likeMatrices.pdf413,98 kBAdobe PDFView/Open
Show simple item record Google Scholar



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.