On the public citation graph

Using Strassen's algorithm to accelerate the solution of linear systems

0 signed · 74 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf02165411openalex-snapshot

Gaussian elimination is not optimal

inferredcites →https://doi.org/10.1063/1.4822961openalex-snapshot

Savitzky-Golay Smoothing Filters

inferredcites →https://doi.org/10.1137/0204009openalex-snapshot

Computational Complexity and Numerical Stability

inferredcites →https://doi.org/10.1137/0613043openalex-snapshot

Stability of a Method for Multiplying Complex Matrices with Three Real Matrix Multiplications

inferredcites →https://doi.org/10.1137/0909040openalex-snapshot

Extra High Speed Matrix Multiplication on the Cray-2

inferredcites →https://doi.org/10.1145/28395.28396openalex-snapshot

Matrix multiplication via arithmetic progressions

inferredcites →https://doi.org/10.1145/36318.36319openalex-snapshot

A proposal for a set of level 3 basic linear algebra subprograms

inferredcites →https://doi.org/10.1145/77626.77627openalex-snapshot

Algorithm 679: A set of level 3 basic linear algebra subprograms: model implementation and test programs

inferredcites →https://doi.org/10.1145/77626.79170openalex-snapshot

A set of level 3 basic linear algebra subprograms

inferredcites →https://doi.org/10.1145/98267.98290openalex-snapshot

Exploiting fast matrix multiplication within the level 3 BLAS

inferredcites →https://doi.org/10.21236/ad0705509openalex-snapshot

ALGORITHMS FOR MATRIX MULTIPLICATION

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cpe.728openalex-snapshot

The LINPACK Benchmark: past, present and future

inferred← citeshttps://doi.org/10.1002/pamm.200700084openalex-snapshot

A strategy for parallel implementation of finite difference numerical schemes associated to evolution differential equations

inferred← citeshttps://doi.org/10.1007/11502760_8openalex-snapshot

The ANF of the Composition of Addition and Multiplication mod 2 n with a Boolean Function

inferred← citeshttps://doi.org/10.1007/11586821_20openalex-snapshot

Probabilistic Algebraic Attacks

inferred← citeshttps://doi.org/10.1007/11596219_4openalex-snapshot

On the Algebraic Immunity of Symmetric Boolean Functions

inferred← citeshttps://doi.org/10.1007/978-1-4471-5079-4_12openalex-snapshot

Computational Aspects

inferred← citeshttps://doi.org/10.1007/978-3-031-68566-8_4openalex-snapshot

Matrix Methods

inferred← citeshttps://doi.org/10.1007/978-3-319-30256-0_1openalex-snapshot

Introduction to Scientific Computing

inferred← citeshttps://doi.org/10.1007/978-3-319-30256-0_3openalex-snapshot

Matrix Equations

inferred← citeshttps://doi.org/10.1007/978-3-319-78619-3_3openalex-snapshot

Matrix Methods

inferred← citeshttps://doi.org/10.1007/978-3-642-15291-7_29openalex-snapshot

Optimized Dense Matrix Multiplication on a Many-Core Architecture

inferred← citeshttps://doi.org/10.1007/978-3-642-21551-3_5openalex-snapshot

Numerical Linear Algebra

inferred← citeshttps://doi.org/10.1007/978-3-642-31464-3_23openalex-snapshot

Generalizing Matrix Multiplication for Efficient Computations on Modern Computers

inferred← citeshttps://doi.org/10.1007/978-3-642-32478-9_3openalex-snapshot

Matrix Methods

inferred← citeshttps://doi.org/10.1007/978-3-642-34062-8_23openalex-snapshot

On Fast Division Algorithm for Polynomials Using Newton Iteration

inferred← citeshttps://doi.org/10.1007/978-3-642-58066-6_7openalex-snapshot

The Performance of Linear Algebra Algorithms on Intel Parallel Supercomputers

inferred← citeshttps://doi.org/10.1007/978-94-011-5412-3_2openalex-snapshot

On Parallel Numerical Software Libraries

inferred← citeshttps://doi.org/10.1007/978-94-015-8196-7_4openalex-snapshot

Trading off Parallelism and Numerical Stability

inferred← citeshttps://doi.org/10.1007/bfb0030137openalex-snapshot

A transform approach to fast matrix multiplication

inferred← citeshttps://doi.org/10.1016/0024-3795(93)00230-wopenalex-snapshot

Fast rectangular matrix multiplication and QR decomposition

inferred← citeshttps://doi.org/10.1016/0898-1221(95)00216-2openalex-snapshot

Using Strassen's matrix multiplication in high performance solution of linear systems

inferred← citeshttps://doi.org/10.1016/b978-0-12-289253-0.50014-2openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1016/j.jisa.2021.102855openalex-snapshot

A generic framework for decomposing block cipher structure with secret components

inferred← citeshttps://doi.org/10.1016/j.parco.2015.10.003openalex-snapshot

Recursion based parallelization of exact dense linear algebra routines for Gaussian elimination

inferred← citeshttps://doi.org/10.1017/s0956796899003470openalex-snapshot

Using randomization to make recursive matrix algorithms practical

inferred← citeshttps://doi.org/10.1017/s096249290000235xopenalex-snapshot

Parallel numerical linear algebra

inferred← citeshttps://doi.org/10.1080/00207170600747283openalex-snapshot

An approach for computing the exact stability domain for a class of LTI parameter dependent systems

inferred← citeshttps://doi.org/10.1093/oso/9780198500148.003.0001openalex-snapshot

Recent Developments in Dense Numerical Linear Algebra

inferred← citeshttps://doi.org/10.1109/access.2023.3338544openalex-snapshot

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

inferred← citeshttps://doi.org/10.1109/acit58437.2023.10275419openalex-snapshot

A Perusal of Algrebraic and Computational Modelling on Matrix Multiplication Time Complexity

inferred← citeshttps://doi.org/10.1109/acssc.2001.987699openalex-snapshot

Reduction of matrix products and their error bounds

inferred← citeshttps://doi.org/10.1109/fccm.2006.12openalex-snapshot

A Parallel Hardware Architecture for fast Gaussian Elimination over GF(2)

inferred← citeshttps://doi.org/10.1109/i2c2.2017.8321772openalex-snapshot

Optimizing the complexity of matrix multiplication algorithm

inferred← citeshttps://doi.org/10.1109/icce-tw52618.2021.9603148openalex-snapshot

Knee Lift Detection using Convolutional Neural Network Method with FPGA Hardware Design

inferred← citeshttps://doi.org/10.1109/iciscae52414.2021.9590713openalex-snapshot

Hierarchical Affinity Learning for Training Evaluation

inferred← citeshttps://doi.org/10.1109/icpads.2011.130openalex-snapshot

Strassen's Matrix Multiplication on GPUs

inferred← citeshttps://doi.org/10.1109/ipdps.2001.924938openalex-snapshot

Mixed parallel implementations of the top level step of Strassen and Winograd matrix multiplication algorithms

inferred← citeshttps://doi.org/10.1109/ipps.1993.262814openalex-snapshot

A tensor product formulation of Strassen's matrix multiplication algorithm with memory reduction

inferred← citeshttps://doi.org/10.1109/jproc.2017.2761740openalex-snapshot

Efficient Processing of Deep Neural Networks: A Tutorial and Survey

inferred← citeshttps://doi.org/10.1109/nigercon.2017.8281929openalex-snapshot

Performance of one-level recursion parallel Strassen's algorithm on dual core processor

inferred← citeshttps://doi.org/10.1109/tfuzz.2017.2647992openalex-snapshot

Avoiding Matrix Inversion in Takagi–Sugeno-Based Advanced Controllers and Observers

inferred← citeshttps://doi.org/10.1137/0613043openalex-snapshot

Stability of a Method for Multiplying Complex Matrices with Three Real Matrix Multiplications

inferred← citeshttps://doi.org/10.1137/22m1502719openalex-snapshot

Pebbling Game and Alternative Basis for High Performance Matrix Multiplication

inferred← citeshttps://doi.org/10.1137/s0895479896297744openalex-snapshot

Locality of Reference in LU Decomposition with Partial Pivoting

inferred← citeshttps://doi.org/10.1145/1145768.1145789openalex-snapshot

Implementation techniques for fast polynomial arithmetic in a high-level programming environment

inferred← citeshttps://doi.org/10.1145/1274971.1275010openalex-snapshot

Adaptive Strassen's matrix multiplication

inferred← citeshttps://doi.org/10.1145/131766.131769openalex-snapshot

Stability of block algorithms with fast level-3 BLAS

inferred← citeshttps://doi.org/10.1145/1823931.1823956openalex-snapshot

Toward high-performance polynomial system solvers based on triangular decompositions

inferred← citeshttps://doi.org/10.1145/2591635.2667174openalex-snapshot

Optimizing matrix multiply using PHiPAC

inferred← citeshttps://doi.org/10.1145/369028.369096openalex-snapshot

Implementation of Strassen's algorithm for matrix multiplication

inferred← citeshttps://doi.org/10.1145/3712285.3759826openalex-snapshot

StraGCN: GPU-Accelerated Strassen’s Sparse-Dense Matrix Multiplication for Graph Convolutional Network Training

inferred← citeshttps://doi.org/10.1155/1992/328793openalex-snapshot

Misleading Performance Reporting in the Supercomputing Field

inferred← citeshttps://doi.org/10.1155/1995/636457openalex-snapshot

A Tensor Product Formulation of Strassen′s Matrix Multiplication Algorithm with Memory Reduction

inferred← citeshttps://doi.org/10.1155/2001/569670openalex-snapshot

Recursive Approach in Sparse Matrix LU Factorization

inferred← citeshttps://doi.org/10.12694/scpe.v15i2.983openalex-snapshot

Generalized Matrix Multiplication and its Object Oriented Model

inferred← citeshttps://doi.org/10.1541/ieejeiss.125.677openalex-snapshot

A Practical Performance Comparison of Parallel Matrix Multiplication Algorithms on Network of Workstations

inferred← citeshttps://doi.org/10.2200/s01004ed1v01y202004cac050openalex-snapshot

Efficient Processing of Deep Neural Networks

inferred← citeshttps://doi.org/10.25088/complexsystems.18.3.307openalex-snapshot

An Algebraic and Graph Theoretic Framework to Study Monomial Dynamical Systems over a Finite Field

inferred← citeshttps://doi.org/10.3390/e17063692openalex-snapshot

The Switching Generator: New Clock-Controlled Generator with Resistance against the Algebraic and Side Channel Attacks

inferred← citeshttps://doi.org/10.3807/hkh.2007.18.6.410openalex-snapshot

Numerical Calculation Method for Paraxial Zoom Loci of Complicated Zoom Lenses with Infinite Object Distance by Using Gaussian Bracket Method

inferred← citeshttps://doi.org/10.3807/hkh.2009.20.3.156openalex-snapshot

General Numerical Calculation Method for Paraxial Zoom Loci of Zoom Lenses with Finite Object Distance by Using Gaussian Bracket Method

inferred← citeshttps://doi.org/10.3807/hkh.2009.20.3.166openalex-snapshot

Numerical Calculation for Autofocus of Zoom Lenses by Using Gaussian Brackets

inferred← citeshttps://doi.org/10.9734/bjmcs/2015/18772openalex-snapshot

Determining the Effects of Cross-over Point on the Running Time of Strassen Matrix Multiplication Algorithm

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.