Compiling Strassen-like Matrix Multiplication Algorithms to Fast CUDA Kernels

Authors: Jangda, Abhinav

Source: Proceedings of the ACM on Programming Languages. 10(PLDI):505-530

Availability: http://dl.acm.org/doi/10.1145/3808267

Limited-Sharing Multi-Party Computation With Reduced Recovery Threshold

Authors: Sarzaeem, Mohammad Amin, Najarkolaei, Seyed Reza Hoseini, Yassaee, Mohammad Hossein, Aref, Mohammadreza

Source: 2025 13th Iran Workshop on Communication and Information Theory (IWCIT) Communication and Information Theory (IWCIT), 2025 13th Iran Workshop on. :1-6 May, 2025

Relation: 2025 13th Iran Workshop on Communication and Information Theory (IWCIT)

HSAMM: A Hybrid-Strassen Algorithm-Based Asynchronous Architecture for Sparse Matrix Multiplication

Authors: Zhang, Lingzhuang, Hu, Rongqing, Zhang, Hongrui, Jiang, Yilong, Ma, Jun, Li, Yinglong, He, Anping

Source: 2024 IEEE International Conference on High Performance Computing and Communications (HPCC) HPCC High Performance Computing and Communications (HPCC), 2024 IEEE International Conference on. :127-134 Dec, 2024

Relation: 2024 IEEE International Conference on High Performance Computing and Communications (HPCC)

Acceleration of Complex Matrix Multiplication Using Arbitrary Precision Floating-Point Arithmetic

Authors: Kouya, Tomonori

Source: 2023 International Conference on Engineering and Emerging Technologies (ICEET) Engineering and Emerging Technologies (ICEET), 2023 International Conference on. :1-6 Oct, 2023

Relation: 2023 International Conference on Engineering and Emerging Technologies (ICEET)

Comparison and Applications of Multiplying 2 by 2 Matrices Using Strassen Algorithm in Python IDLE, Jupyter Notebook, and Colab

Authors: Gao, Shanzhen, Gao, Weizheng, Malomo, Olumide, Allagan, Julian D., Eyob, Ephrem, Su, Jianning

Source: 2023 Congress in Computer Science, Computer Engineering, & Applied Computing (CSCE) CSCE Computer Science, Computer Engineering, & Applied Computing (CSCE), 2023 Congress in. :750-755 Jul, 2023

Relation: 2023 Congress in Computer Science, Computer Engineering, & Applied Computing (CSCE)

Comparison and Applications of Multiplying Two 3 by 3 Matrices

Authors: Gao, Shanzhen, Gao, Weizheng, Malomo, Olumide, Allagan, Julian D., Eyob, Ephrem, Su, Jianning

Source: 2023 Congress in Computer Science, Computer Engineering, & Applied Computing (CSCE) CSCE Computer Science, Computer Engineering, & Applied Computing (CSCE), 2023 Congress in. :735-740 Jul, 2023

Relation: 2023 Congress in Computer Science, Computer Engineering, & Applied Computing (CSCE)

Running Time Comparison and Applications of Multiplying $\mathbf{2} \times \mathbf{2}$ Matrices Using the Strassen Algorithm

Authors: Gao, Shanzhen, Malomo, Olumide, Eyob, Ephrem, Gao, Weizheng

Source: 2022 International Conference on Computational Science and Computational Intelligence (CSCI) CSCI Computational Science and Computational Intelligence (CSCI), 2022 International Conference on. :556-560 Dec, 2022

Relation: 2022 International Conference on Computational Science and Computational Intelligence (CSCI)

Recommendation System using optimized Matrix Multiplication Algorithm

Authors: Rathod, Pawan Manoj, Shende, RajKumar K.

Source: 2020 IEEE International Symposium on Sustainable Energy, Signal Processing and Cyber Security (iSSSC) Sustainable Energy, Signal Processing and Cyber Security (iSSSC), 2020 IEEE International Symposium on. :1-4 Dec, 2020

Relation: 2020 IEEE International Symposium on Sustainable Energy, Signal Processing and Cyber Security (iSSSC)

On Invertibility of Large Binary Matrices

Authors: Ibrahim Mammadov, Pavel Loskot, Thomas Honold

Source: Mathematics ; Volume 14 ; Issue 2 ; Pages: 270

Subject Terms: algorithm complexity, Bruhat decomposition, binary matrix, Galois field, matrix inverse, PLU factorization, Strassen algorithm, matrix multiplication

File Description: application/pdf

Relation: C: Mathematical Analysis; https://dx.doi.org/10.3390/math14020270

Availability: https://doi.org/10.3390/math14020270

Finding Complex-Valued Solutions of Brent Equations Using Nonlinear Least Squares: Finding complex-valued solutions of Brent equations using nonlinear least squares

Authors: Kaporin, I. E.

Source: Computational Mathematics and Mathematical Physics. 64:1881-1891

Subject Terms: nonlinear least squares problem, Numerical linear algebra, Multilinear algebra, tensor calculus, Numerical methods for matrix equations, Matrix equations and identities, fast matrix multiplication, Brent equations, Strassen algorithm

File Description: application/xml

Access URL: https://zbmath.org/7942540
https://doi.org/10.1134/s0965542524701021

Semi-Analytical Solution of Brent Equations: Semi-analytical solution of Brent equations

Authors: Kaporin, I. E.

Source: Doklady Mathematics. 110:318-322

Subject Terms: Complexity and performance of numerical algorithms, Numerical interpolation, Numerical linear algebra, fast matrix multiplication, Brent equations, Strassen algorithm

File Description: application/xml

Access URL: https://zbmath.org/7950001
https://doi.org/10.1134/s1064562424702223

Discovering Numerous Strassen’s Equivalent Equations Using a Simple Micro Multimodal GA: Evolution in Action

Authors: Bidgoli, Azam Asilian, Trumble, Steven, Rahnamayan, Shahryar

Source: 2020 IEEE Congress on Evolutionary Computation (CEC) Evolutionary Computation (CEC), 2020 IEEE Congress on. :1-8 Jul, 2020

Relation: 2020 IEEE Congress on Evolutionary Computation (CEC)

High Performance Recursive Matrix Inversion for Multicore Architectures

Authors: Mahfoudhi, Ryma, Achour, Sami, Hamdi-Larbli, Olfa, Mahjoub, Zaher

Source: 2017 International Conference on High Performance Computing & Simulation (HPCS) HPCS High Performance Computing & Simulation (HPCS), 2017 International Conference on. :675-682 Jul, 2017

Relation: 2017 International Conference on High Performance Computing & Simulation (HPCS)

Resolution of Matrix Multiplication Complexity to the O(n^2) Ground State via 6-Dimensional Hantzsche-Wendt Manifold Mapping

Authors: Forrest M. Anderson, Forrest

Subject Terms: Matrix Multiplication Complexity, Computational Complexity Theory, Topological Data Analysis, Hantzsche-Wendt Manifolds, Adelic Number Theory, Atiyah-Singer Index Theorem, Hodge-Laplacian Sieve, Manifold Mapping, Information Superconductivity, O(n^2) Lower Bound Finality, Substrate Independence, Dynamic Systems & Attractors, Inertial Logic Hardening, Girth-6 Graph Theory, Relativistic Information Flux, Strassen Algorithm, Coppersmith-Winograd Algorithm, Hasse Principle, Banach Fixed-Point Theorem, Lyapunov Stability, Anderson Operator Framework, AOF, S8 Governor, 6D Lifting, Topological Seal, Adelic Product Formula, 1.42 GHz Resonance, 170kDa Logic Mass, Theory of computation~Algebraic algorithms, Theory of computation~Circuit complexity, Computing methodologies~Symbolic and algebraic manipulation, Hardware~Signal processing systems, Information Theory, Statistical Physics, Condensed Matter, Mathematical Physics, Dissipative systems, Topological invariants, 68Q17, 15A24, 58J20, 11S80, 53C22, 05C38, 37C70

Breaking through memory limitation in GPU parallel processing using Strassen Algorithm

Authors: Yugopuspito, Pujianto, Sutrisno, Hudi, Robertus

Source: 2013 International Conference on Computer, Control, Informatics and Its Applications (IC3INA) Computer, Control, Informatics and Its Applications (IC3INA), 2013 International Conference on. :201-205 Nov, 2013

Relation: 2013 International Conference on Computer, Control, Informatics and Its Applications (IC3INA)

A Parallel Computing Method for the Computation of the Moore–Penrose Generalized Inverse for Shared-Memory Architectures

Authors: Elkin Gelvez-Almeida, Ricardo J. Barrientos, Karina Vilches-Ponce, Marco Mora

Source: IEEE Access, Vol 11, Pp 134834-134845 (2023)

Subject Terms: High-performance computing, Moore–Penrose generalized inverse matrix, neural networks with random weights, parallel computing, Strassen algorithm, Electrical engineering. Electronics. Nuclear engineering, TK1-9971

File Description: electronic resource

Relation: https://ieeexplore.ieee.org/document/10336814/; https://doaj.org/toc/2169-3536

Access URL: https://doaj.org/article/b6166452959a482c958b2bd689ec6aec

Minimizing Multiplication of Kernel Computation in Convolutional Neural Networks Using Strassen Algorithm

Authors: Rifqie, Dary Mochamad, Surianto, Dewi Fatmarani, Jayanegara, Sudarmanto, Fajar B, Muhammad, Fakhri, M. Miftach

Source: Jurnal MediaTIK; Volume 6 Issue 2, Mei (2023); 52-54 ; 2715-5919 ; 2656-1247 ; 10.59562/mediatik.v6i2

Subject Terms: Convolutional Neural Network, Strassen Algorithm, Matrix Multiplication, Kernal Computation

File Description: application/pdf

Relation: http://journal.unm.ac.id/index.php/MediaTIK/article/view/1397/865; http://journal.unm.ac.id/index.php/MediaTIK/article/view/1397

Availability: http://journal.unm.ac.id/index.php/MediaTIK/article/view/1397
https://doi.org/10.59562/mediatik.v6i2.1397

Performance Evaluation of Strassen Matrix Multiplication Supporting Triple-Double Precision Floating-Point Arithmetic

Authors: Kouya, Tomonori^Aff19

Contributors: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff3, Gao, Wen, Editorial Board Member^Aff4, Steffen, Bernhard, Editorial Board Member^Aff5, Woeginger, Gerhard, Editorial Board Member^Aff6, Yung, Moti, Editorial Board Member^Aff7, Gervasi, Osvaldo, editor^Aff8, Murgante, Beniamino, editor^Aff9, Misra, Sanjay, editor^Aff10, Garau, Chiara, editor^Aff11, Blečić, Ivan, editor^Aff12, Taniar, David, editor^Aff13, Apduhan, Bernady O., editor^Aff14, Rocha, Ana Maria A. C., editor^Aff15, Tarantino, Eufemia, editor^Aff16, Torre, Carmelo Maria, editor^Aff17, Karaca, Yeliz, editor^Aff18

Source: Computational Science and Its Applications – ICCSA 2020 : 20th International Conference, Cagliari, Italy, July 1–4, 2020, Proceedings, Part V. 12253:163-176

Symbolic-Optimal Matrix Multiplication: Canonical Tensor Algorithms Beyond Strassen

Authors: Fathi, Kevin

Subject Terms: Algebraic complexity, Symbolic entropy, Information theory, Symbolic matrix multiplication, Complexity lower bounds, Shannon entropy, Kolmogorov complexity, Canonical normal form (CNF), Irreducibility, Computational algebra, Greedy contraction algorithm, Formal logic systems, Matrix multiplication exponent, Symbolic computation, Tensor decomposition, Bilinear maps, Tensor rank, Semantic traceability, Asymptotic optimization, Strassen algorithm

Parameter Space for the Architecture of FFT-Based Montgomery Modular Multiplication

Authors: Chen, D.D., Yao, G.X., Cheung, R.C., Pao, D., Koc, C.K.

Source: IEEE Transactions on Computers IEEE Trans. Comput. Computers, IEEE Transactions on. 65(1):147-160 Jan, 2016