Search Results - block-recursive Strassen’s algorithm
-
1
A New Fast Recursive Matrix Multiplication Algorithm
ISSN: 1060-0396, 1573-8337Published: New York Springer US 01.07.2019Published in Cybernetics and systems analysis (01.07.2019)“… = 4 μ with μ = 2 q −1 ( q > 0). As compared with the well-known recursive Strassen’s and Winograd–Strassen’s algorithms, the new algorithm minimizes the multiplicative complexity equal to W m…”
Get full text
Journal Article -
2
Generalized matrix inversion is not harder than matrix multiplication
ISSN: 0377-0427, 1879-1778Published: Kidlington Elsevier B.V 01.08.2009Published in Journal of computational and applied mathematics (01.08.2009)“…Starting from the Strassen method for rapid matrix multiplication and inversion as well as from the recursive Cholesky factorization algorithm, we introduced a completely block recursive algorithm…”
Get full text
Journal Article -
3
An Optimized Distributed Recursive Matrix Multiplication for Arbitrary Sized Matrices
Published: IEEE 10.12.2020Published in 2020 IEEE International Conference on Big Data (Big Data) (10.12.2020)“…Strassen's block-recursive matrix multiplication is amenable to parallelization via distributed recursion…”
Get full text
Conference Proceeding -
4
A Framework for Generating Distributed-Memory Parallel Programs for Block Recursive Algorithms
ISSN: 0743-7315, 1096-0848Published: San Diego, CA Elsevier Inc 01.05.1996Published in Journal of parallel and distributed computing (01.05.1996)“…A framework for synthesizing communication-efficient distributed-memory parallel programs for block recursive algorithms such as the fast Fourier transform (FFT…”
Get full text
Journal Article -
5
EXTENT:a portable programming environment for designing and implementing high-performance block recursive algorithms
ISBN: 0818666056, 9780818666056ISSN: 1063-9535Published: 1994Published in Conference on High Performance Networking and Computing: Proceedings of the 1994 ACM/IEEE conference on Supercomputing : Washington, D.C.; 14-18 Nov. 1994 (1994)“… In this programming methodology, block recursive algorithms such as the fast Fourier transform and Strassen's matrix multiplication algorithm are expressed as tensor product formulas involving tensor…”
Get full text
Conference Proceeding -
6
A Tensor Product Formulation of Strassen′s Matrix Multiplication Algorithm with Memory Reduction
ISSN: 1058-9244, 1875-919XPublished: Egypt Hindawi Publishing Corporation 17.04.1995Published in Scientific programming (17.04.1995)“… In this methodology, block recursive programs such as the fast Fourier Transforms and Strassen′s matrix multiplication algorithm are expressed as algebraic formulas involving tensor products and other matrix operations…”
Get full text
Journal Article -
7
Synthesizing communication-efficient distributed memory parallel programs for block recursive algorithms
ISBN: 9798209192756Published: ProQuest Dissertations & Theses 01.01.1995“… In this thesis, we present a framework for synthesizing communication-efficient distributed-memory parallel programs for block recursive algorithms, such as the fast Fourier transform (FFT…”
Get full text
Dissertation -
8
EXTENT: a portable programming environment for designing and implementing high-performance block recursive algorithms
ISBN: 0818666056, 9780818666056Published: Los Alamitos, CA, USA IEEE Computer Society Press 14.11.1994Published in Proceedings of the 1994 ACM/IEEE conference on Supercomputing (14.11.1994)“… In this programming methodology, block recursive algorithms such as the fast Fourier transform and Strassen's matrix multiplication algorithm are expressed as tensor product formulas involving tensor…”
Get full text
Conference Proceeding -
9
EXTENT: a portable programming environment for designing and implementing high-performance block recursive algorithms
ISBN: 0818666056, 9780818666056Published: IEEE Comput. Soc. Press 1994Published in Supercomputing, `94 (1994)“… In this programming methodology, block recursive algorithms such as the fast Fourier transform and Strassen's matrix multiplication algorithm are expressed as tensor product formulas involving tensor…”
Get full text
Conference Proceeding -
10
On Distributed Solution for Simultaneous Linear Symmetric Systems
Published: IEEE 10.12.2020Published in 2020 IEEE International Conference on Big Data (Big Data) (10.12.2020)“… In this paper, we present two distributed block-recursive approaches to solve large SPD systems - the symmetric version of the state-of-the-art Strassen's algorithm and Cholesky based inversion algorithm…”
Get full text
Conference Proceeding -
11
A tensor product formulation of Strassen's matrix multiplication algorithm with memory reduction
ISBN: 9780818634420, 0818634421Published: IEEE Comput. Soc. Press 1993Published in Parallel Processing Symposium, 7th International (IPPS '93 (1993)“…A programming methodology based on tensor products has been used for designing and implementing block recursive algorithms for parallel and vector multiprocessors…”
Get full text
Conference Proceeding -
12
A Method of Ultra-Large-Scale Matrix Inversion Using Block Recursion
ISSN: 2078-2489, 2078-2489Published: Basel MDPI AG 01.11.2020Published in Information (Basel) (01.11.2020)“…; nonetheless, the need has become increasingly urgent. Hence, we propose a parallel distributed block recursive computing method that can process matrices at a significantly increased scale, based on Strassen’s method…”
Get full text
Journal Article -
13
New features in MathPartner 2021
ISSN: 2331-8422Published: Ithaca Cornell University Library, arXiv.org 23.04.2022Published in arXiv.org (23.04.2022)“…We introduce new features in the MathPartner service that have recently become available to users. We highlight the functions for calculating both…”
Get full text
Paper -
14
SPIN: A Fast and Scalable Matrix Inversion Method in Apache Spark
ISSN: 2331-8422Published: Ithaca Cornell University Library, arXiv.org 15.01.2018Published in arXiv.org (15.01.2018)“… using big data platforms rely on LU decomposition based block-recursive algorithms. However, these algorithms are complex and require a lot of side calculations, e.g…”
Get full text
Paper

