Pages that link to "Item:Q4683913"
From MaRDI portal
The following pages link to Communication lower bounds and optimal algorithms for numerical linear algebra (Q4683913):
Displaying 18 items.
- Energy aware performance study for a class of computationally intensive Monte Carlo algorithms (Q2006556) (← links)
- Block Gram-Schmidt algorithms and their stability properties (Q2074959) (← links)
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation (Q2350005) (← links)
- GMRES algorithms over 35 years (Q2698151) (← links)
- How Bad Are Vandermonde Matrices? (Q2813332) (← links)
- Parallel Matrix Multiplication: A Systematic Journey (Q2954477) (← links)
- Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
- Avoiding Communication in Primal and Dual Block Coordinate Descent Methods (Q4613501) (← links)
- A Robust and Efficient Implementation of LOBPCG (Q4685340) (← links)
- Parallel Algorithms for Tensor Train Arithmetic (Q5028405) (← links)
- Performance of the Low-Rank TT-SVD for Large Dense Tensors on Modern MultiCore CPUs (Q5095475) (← links)
- Predict-and-Recompute Conjugate Gradient Variants (Q5132005) (← links)
- Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision (Q5264995) (← links)
- Limited‐memory polynomial methods for large‐scale matrix functions (Q6068267) (← links)
- Analytical modeling of matrix–vector multiplication on multicore processors (Q6139033) (← links)
- Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation (Q6154935) (← links)
- Adaptively restarted block Krylov subspace methods with low-synchronization skeletons (Q6157451) (← links)
- A numerically stable communication-avoiding \(s\)-step GMRES algorithm (Q6641763) (← links)
