Умножение на матрици (Bulgarian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Умножение на матрици" in Bulgarian language version.

refsWebsite

Global rank Bulgarian rank

5doi.org

2^nd place

7^th place

3archive.org

6^th place

11^th place

3web.archive.org

1^st place

2stanford.edu

179^th place

123^rd place

1williamstein.org

low place

1siam.org

low place

1hpi-web.de

low place

1mit.edu

415^th place

414^th place

1acm.org

1,185^th place

1,746^th place

acm.org (Global: 1,185^th place; Bulgarian: 1,746^th place)

portal.acm.org

Lynn Elliot Cannon, A cellular computer to implement the Kalman Filter Algorithm, Technical report, Ph.D. Thesis, Montana State University, 14 юли 1969.

archive.org (Global: 6^th place; Bulgarian: 11^th place)

Lerner, R. G., Trigg, G. L. Encyclopaedia of Physics. 2nd. VHC publishers, 1991. ISBN 3-527-26954-1.
Lipschutz, S., Lipson, M. Linear Algebra. 4th. McGraw Hill (USA), 2009. ISBN 978-0-07-154352-1. с. 30 – 31.
2 // Linear Algebra. 4th. McGraw Hill (USA), 2009. ISBN 978-0-07-154352-1.

doi.org (Global: 2^nd place; Bulgarian: 7^th place)

dx.doi.org

Miller, Webb. Computational complexity and numerical stability // SIAM News 4. 1975. DOI:10.1137/0204009. 10.1.1.148.9947. с. 97 – 107.
Iliopoulos, Costas S. Worst-case complexity bounds on algorithms for computing the canonical structure of finite abelian groups and the Hermite and Smith normal forms of an integer matrix // SIAM Journal on Computing 18 (4). 1989. DOI:10.1137/0218045. с. 658 – 669. Архивиран от оригинала на 5 март 2014. Посетен на 29 септември 2015. The Coppersmith–Winograd algorithm is not practical, due to the very large hidden constant in the upper bound on the number of multiplications required.
Irony, Dror и др. Communication lower bounds for distributed-memory matrix multiplication // J. Parallel Distrib. Comput. 64 (9). September 2004. DOI:10.1016/j.jpdc.2004.03.021. с. 1017 – 1026.
Agarwal, R.C. и др. A three-dimensional approach to parallel matrix multiplication // IBM J. Res. Dev. 39 (5). September 1995. DOI:10.1147/rd.395.0575. с. 575 – 582.
Solomonik, Edgar и др. Communication-optimal parallel 2.5D matrix multiplication and LU factorization algorithms // Proceedings of the 17th international conference on Parallel processing Part II. 2011. DOI:10.1007/978-3-642-23397-5_10. с. 90 – 109.

hpi-web.de (Global: low place; Bulgarian: low place)

eccc.hpi-web.de

Alon, Shpilka, Umans, On Sunflowers and Matrix Multiplication

mit.edu (Global: 415^th place; Bulgarian: 414^th place)

supertech.csail.mit.edu

Ph.D. Keith H. Randall. Cilk: Efficient Multithreaded Computing. Massachusetts Institute of Technology, 1998. с. 54 – 57. Архив на оригинала от 2020-11-06 в Wayback Machine.

siam.org (Global: low place; Bulgarian: low place)

Robinson, Sara. Toward an Optimal Algorithm for Matrix Multiplication // SIAM News 38 (9). 2005.

stanford.edu (Global: 179^th place; Bulgarian: 123^rd place)

cs.stanford.edu

Powers of tensors and fast matrix multiplication // Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (ISSAC 2014). 2014.. Оригиналния алгоритъм е представен от Дон Копърсмит и Шмуел Виноград през 1990 г. и има асимптотична сложност O(n^2.376). Подобрен е през 2013 г. до O(n^2.3729) от Виргиния Василевска Уилиамс, като времето за изпълнение е малко по-високо от подобрението на Ле Гал: Williams, Virginia Vassilevska. Multiplying matrices faster than Coppersmith-Winograd // Архивиран от оригинала на 8 октомври 2013. Посетен на 29 септември 2015.

stanford.edu

Bosagh Zadeh, Reza, Carlsson, Gunnar. Dimension Independent Matrix Square Using MapReduce. Посетен на 12 юли 2014.

web.archive.org (Global: 1^st place; Bulgarian: 1^st place)

Powers of tensors and fast matrix multiplication // Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (ISSAC 2014). 2014.. Оригиналния алгоритъм е представен от Дон Копърсмит и Шмуел Виноград през 1990 г. и има асимптотична сложност O(n^2.376). Подобрен е през 2013 г. до O(n^2.3729) от Виргиния Василевска Уилиамс, като времето за изпълнение е малко по-високо от подобрението на Ле Гал: Williams, Virginia Vassilevska. Multiplying matrices faster than Coppersmith-Winograd // Архивиран от оригинала на 8 октомври 2013. Посетен на 29 септември 2015.
Iliopoulos, Costas S. Worst-case complexity bounds on algorithms for computing the canonical structure of finite abelian groups and the Hermite and Smith normal forms of an integer matrix // SIAM Journal on Computing 18 (4). 1989. DOI:10.1137/0218045. с. 658 – 669. Архивиран от оригинала на 5 март 2014. Посетен на 29 септември 2015. The Coppersmith–Winograd algorithm is not practical, due to the very large hidden constant in the upper bound on the number of multiplications required.
Ph.D. Keith H. Randall. Cilk: Efficient Multithreaded Computing. Massachusetts Institute of Technology, 1998. с. 54 – 57. Архив на оригинала от 2020-11-06 в Wayback Machine.

williamstein.org (Global: low place; Bulgarian: low place)

Iliopoulos, Costas S. Worst-case complexity bounds on algorithms for computing the canonical structure of finite abelian groups and the Hermite and Smith normal forms of an integer matrix // SIAM Journal on Computing 18 (4). 1989. DOI:10.1137/0218045. с. 658 – 669. Архивиран от оригинала на 5 март 2014. Посетен на 29 септември 2015. The Coppersmith–Winograd algorithm is not practical, due to the very large hidden constant in the upper bound on the number of multiplications required.

Умножение на матрици (Bulgarian Wikipedia)

acm.org (Global: 1,185th place; Bulgarian: 1,746th place)

portal.acm.org

archive.org (Global: 6th place; Bulgarian: 11th place)

doi.org (Global: 2nd place; Bulgarian: 7th place)

dx.doi.org

hpi-web.de (Global: low place; Bulgarian: low place)

eccc.hpi-web.de

mit.edu (Global: 415th place; Bulgarian: 414th place)

supertech.csail.mit.edu

siam.org (Global: low place; Bulgarian: low place)

stanford.edu (Global: 179th place; Bulgarian: 123rd place)

cs.stanford.edu

stanford.edu

web.archive.org (Global: 1st place; Bulgarian: 1st place)

williamstein.org (Global: low place; Bulgarian: low place)

acm.org (Global: 1,185^th place; Bulgarian: 1,746^th place)

archive.org (Global: 6^th place; Bulgarian: 11^th place)

doi.org (Global: 2^nd place; Bulgarian: 7^th place)

mit.edu (Global: 415^th place; Bulgarian: 414^th place)

stanford.edu (Global: 179^th place; Bulgarian: 123^rd place)

web.archive.org (Global: 1^st place; Bulgarian: 1^st place)