swMATH4171MaRDI QIDQ16355FDOQ16355
Author name not available (Why is that?)
Official website: http://www.cs.utexas.edu/~rvdg/abstracts/SUMMA.html
Cited In (58)
- hyper.deal: An Efficient, Matrix-free Finite-element Library for High-dimensional Partial Differential Equations
- New ideas in sparse matrix matrix multiplication
- Scalability of heterogeneous parallel systems
- Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication
- Robust and accurate stopping criteria for adaptive randomized sampling in matrix-free hierarchically semiseparable construction
- PoLAPACK: Parallel factorization routines with algorithmic blocking
- An optimized sparse approximate matrix multiply for matrices with decay
- A distributed-memory package for dense hierarchically semi-separable matrix computations using randomization
- Parallel Processing and Applied Mathematics
- A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic
- A recursive partitioning algorithm for matrix inversion on parallel computers
- Parallel matrix multiplication: a systematic journey
- Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization
- Specialized parallel algorithms for solving Lyapunov and Stein equations
- Title not available (Why is that?)
- Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments
- Title not available (Why is that?)
- An extension of fortran for high performance parallel computing
- Strassen's Algorithm for Tensor Contraction
- Computational Science - ICCS 2004
- PoLAPACK
- PLAPACK
- SRUMMA
- ARMCI
- PHiPAC
- CALU
- PUMMA
- GAMESS-UK
- MOCHA
- FASTCLIME
- PGEToolbox
- FreeON
- VanInverse
- OpenUH
- SpAMM
- CU2CL
- Nanos++
- spammpack
- TASCEL
- SpGEMM
- CUMP
- GPUprec
- MPIGMP
- ChaNGa
- ACML
- TKPSVD
- ELSI
- Matrix exponentials and parallel prefix computation in a quantum control problem
- Communication lower bounds for distributed-memory matrix multiplication
- Solvers for \(\mathcal{O}(N)\) electronic structure in the strong scaling limit
- A new parallel matrix multiplication algorithm on distributed-memory concurrent computers
- Communication lower bounds and optimal algorithms for numerical linear algebra
- Title not available (Why is that?)
- ADTT
- hyper.deal
- Reducing communication costs for sparse matrix multiplication within algebraic multigrid
- Scalability of correlated electronic structure calculations on parallel computers: A case study of the RI-MP2 method
- High-performance statistical computing in the computing environments of the 2020s
This page was built for software: SUMMA
