On the public citation graph

The Use of BLAS3 in Linear Algebra on a Parallel Processor with a Hierarchical Memory

0 signed · 64 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.1137/1.9781611971811openalex-snapshot

LINPACK Users' Guide

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

On the stability of Gauss-Jordan elimination with pivoting

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.4330060503openalex-snapshot

Portable Parallel implementation of BLAS 3

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

A role for Pareto optimality in mining performance data

inferred← citeshttps://doi.org/10.1007/3-540-53065-7_101openalex-snapshot

An adaptive blocking strategy for matrix factorizations

inferred← citeshttps://doi.org/10.1007/3-540-55895-0_434openalex-snapshot

A block algorithm for orthogonalization in elliptic norms

inferred← citeshttps://doi.org/10.1007/3-540-62828-2_116openalex-snapshot

The use of computational kernels in full and sparse linear solvers, efficient code design on high-performance RISC processors

inferred← citeshttps://doi.org/10.1007/978-1-4471-3501-2_8openalex-snapshot

A Quantitative Algorithm for Data Locality Optimization

inferred← citeshttps://doi.org/10.1007/978-1-4615-3422-8_39openalex-snapshot

Matrix Multiplication on Digital Signal Processors and Hierarchical Memory Systems

inferred← citeshttps://doi.org/10.1007/978-3-322-83922-0openalex-snapshot

Lösung linearer Gleichungssysteme auf Parallelrechnern

inferred← citeshttps://doi.org/10.1007/978-3-322-83922-0_4openalex-snapshot

Gauß—Elimination

inferred← citeshttps://doi.org/10.1007/978-3-642-51761-7_4openalex-snapshot

Numerical Tests for the Mixed Finite Element Schemes for Bending Plates

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

A Hybrid Scheme for the Singular Value Decomposition on a Multiprocessor

inferred← citeshttps://doi.org/10.1007/978-3-642-83548-3_11openalex-snapshot

Matrix Computations on Shared-Memory Multiprocessors

inferred← citeshttps://doi.org/10.1007/978-94-017-7188-7_2openalex-snapshot

Fundamental Kernels

inferred← citeshttps://doi.org/10.1007/978-94-017-7188-7_4openalex-snapshot

General Linear Systems

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

Adaptive blocking in the QR factorization

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

Vector processing in simplex and interior methods for linear programming

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

Fast parallel solution of the Poisson equation on irregular domains

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

A locally optimized reordering algorithm and its application to a parallel sparse linear system solver

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

Boundary collocation fast poisson solver on irregular domains

inferred← citeshttps://doi.org/10.1016/0021-9991(89)90119-8openalex-snapshot

A pseudospectral matrix element method for solution of three-dimensional incompressible flows and its parallel implementation

inferred← citeshttps://doi.org/10.1016/0167-8191(88)90016-6openalex-snapshot

Tools to aid in the analysis of memory access patterns for FORTRAN programs

inferred← citeshttps://doi.org/10.1016/0168-9274(92)90054-hopenalex-snapshot

Block-Cholesky for parallel processing

inferred← citeshttps://doi.org/10.1016/0377-0427(89)90366-xopenalex-snapshot

An overview of parallel algorithms for the singular value and symmetric eigenvalue problems

inferred← citeshttps://doi.org/10.1016/0743-7315(88)90014-7openalex-snapshot

Strategies for cache and local memory management by global program transformation

inferred← citeshttps://doi.org/10.1016/b978-0-444-88621-7.50014-1openalex-snapshot

An overview of parallel algorithms for the singular value and symmetric eigenvalue problems* *This work was supported in part by the National Science Foundation under Grant Nos. US NSF MIP-8410110 and US NSF DCR85–09970, the U.S. Department of Energy under Grant No. US DOE DE-FG02–85ER25001, and…

inferred← citeshttps://doi.org/10.1016/j.cam.2016.11.031openalex-snapshot

Block Conjugate Gradient algorithms for least squares problems

inferred← citeshttps://doi.org/10.1016/j.optcom.2006.10.085openalex-snapshot

The block Schur algorithm for designing optical multi-layered structures

inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00086-1openalex-snapshot

Compilation techniques for parallel systems

inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80203-8openalex-snapshot

Chapter 6 A survey of matrix computations

inferred← citeshttps://doi.org/10.1023/a:1018970413988openalex-snapshot

A parameterized ordering for cache-, register- and pipeline-efficient Givens QR decomposition

inferred← citeshttps://doi.org/10.1109/fmpc.1992.234897openalex-snapshot

The LINPACK benchmark on the Fujitsu FAP 1000

inferred← citeshttps://doi.org/10.1109/hpcc.2014.30openalex-snapshot

LU Factorization of Small Matrices: Accelerating Batched DGETRF on the GPU

inferred← citeshttps://doi.org/10.1109/icpp.1993.88openalex-snapshot

Fast Enumeration of Solutions for Data Dependence Analysis and Data Locality Optimization

inferred← citeshttps://doi.org/10.1109/icpp.1996.537375openalex-snapshot

A three-parameter fast Givens QR algorithm for superscalar processors

inferred← citeshttps://doi.org/10.1109/icpp.2014.52openalex-snapshot

A Fast Batched Cholesky Factorization on a GPU

inferred← citeshttps://doi.org/10.1109/oceans.2001.968092openalex-snapshot

Optimum block size for the computation of Schur algorithm using a CRAY

inferred← citeshttps://doi.org/10.1109/tpds.2026.3692274openalex-snapshot

OSLA: A High Performance One-Sided Linear Algebra Library on GPU Architectures

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

Krylov Subspace Methods on Supercomputers

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

Stability Analysis and Improvement of the Block Gram–Schmidt Algorithm

inferred← citeshttps://doi.org/10.1137/1.9781611971705.ch3openalex-snapshot

3. A Bibliography on Parallel and Vector Numerical Algorithms

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

Parallel Algorithms for Dense Linear Algebra Computations

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

Threshold pivoting for dense LU factorization on distributed memory multiprocessors

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

A parallel block implementation of Level-3 BLAS for MIMD vector processors

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

Level-3 Cholesky Factorization Routines Improve Performance of Many Cholesky Algorithms

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

Use of parallel level 3 BLAS in LU factorization on three vector multiprocessors the ALLIANT FX/80, the CRAY-2, and the IBM 3090 VF

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

Strategies for cache and local memory management by global program transformation

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

Portable and efficient factorization algorithms on the IBM 3090/VF

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

A comparison of parallel processing on CRAY X-MP AND IBM 3090 VF multiprocessors

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

The RISC BLAS

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

A benchmark package for sparse matrix computations

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

A set of level 3 basic linear algebra subprograms

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

Use of parallel level 3 BLAS in LU factorization on three vector multiprocessors the ALLIANT FX/80, the CRAY-2, and the IBM 3090 VF

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

Exploiting fast matrix multiplication within the level 3 BLAS

inferred← citeshttps://doi.org/10.1177/109434208800200103openalex-snapshot

Impact of Hierarchical Memory Systems On Linear Algebra Algorithm Design

inferred← citeshttps://doi.org/10.1177/109434208800200304openalex-snapshot

Multiprocessor Schemes for Solving Block Tridiagonal Linear Systems

inferred← citeshttps://doi.org/10.1177/109434208900300204openalex-snapshot

Level 3 Blas in Lu Factorization On the Cray-2, Eta-10P, and Ibm 3090-200/Vf

inferred← citeshttps://doi.org/10.1177/109434208900300302openalex-snapshot

The Perfect Club Benchmarks: Effective Performance Evaluation of Supercomputers

inferred← citeshttps://doi.org/10.1177/109434209100500308openalex-snapshot

Use of Level 3 Blas in Lu Factorization in a Multiprocessing Environment On Three Vector Multiprocessors: the Alliant Fx/80, the Cray-2, and the Ibm 3090 Vf

inferred← citeshttps://doi.org/10.1177/109434209200600103openalex-snapshot

Large-Scale Sparse Singular Value Computations

inferred← citeshttps://doi.org/10.1201/9781420028683.ch4openalex-snapshot

Parallel Algorithms for the Singular Value Decomposition

inferred← citeshttps://doi.org/10.1515/mcma-2020-2076openalex-snapshot

Gaussian variant of Freivalds’ algorithm for efficient and reliable matrix product verification

inferred← citeshttps://doi.org/10.1515/piko.1991.14.3.139openalex-snapshot

THEORIE UND PRAXIS

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.