Pages that link to "Item:Q3112398"
From MaRDI portal
The following pages link to Minimizing Communication in Numerical Linear Algebra (Q3112398):
Displaying 29 items.
- A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic (Q285264) (← links)
- Minimizing synchronizations in sparse iterative solvers for distributed supercomputers (Q316448) (← links)
- A direct solver for variable coefficient elliptic PDEs discretized via a composite spectral collocation method (Q401558) (← links)
- A generalization of \(s\)-step variants of gradient methods (Q415206) (← links)
- Accelerating the reduction to upper Hessenberg, tridiagonal, and bidiagonal forms through hybrid GPU-based computing (Q608851) (← links)
- Aligning the representation and reality of computation with asynchronous logic automata (Q652552) (← links)
- The swept rule for breaking the latency barrier in time advancing PDEs (Q729369) (← links)
- The method of polarized traces for the 2D Helmholtz equation (Q729469) (← links)
- Towards dense linear algebra for hybrid GPU accelerated manycore systems (Q991102) (← links)
- High-performance statistical computing in the computing environments of the 2020s (Q2092893) (← links)
- L-sweeps: a scalable, parallel preconditioner for the high-frequency Helmholtz equation (Q2125010) (← links)
- Simultaneous band reduction of two symmetric matrices (Q2203923) (← links)
- Distributed-memory hierarchical interpolative factorization (Q2408983) (← links)
- A Cache-Optimal Alternative to the Unidirectional Hierarchization Algorithm (Q2808020) (← links)
- Algorithm 953 (Q2828159) (← links)
- An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem (Q2936585) (← links)
- Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions (Q3186101) (← links)
- A Factored Sparse Approximate Inverse Preconditioned Conjugate Gradient Solver on Graphics Processing Units (Q3464428) (← links)
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting (Q4610132) (← links)
- Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra (Q4637194) (← links)
- Communication lower bounds and optimal algorithms for numerical linear algebra (Q4683913) (← links)
- On the cost of iterative computations (Q4993500) (← links)
- Numerical algorithms for high-performance computational science (Q4993515) (← links)
- Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions (Q5157832) (← links)
- An Input/Output Efficient Algorithm for Hessenberg Reduction (Q5207035) (← links)
- Communication Avoiding ILU0 Preconditioner (Q5254468) (← links)
- Randomized QR with Column Pivoting (Q5348261) (← links)
- Pebbling Game and Alternative Basis for High Performance Matrix Multiplication (Q6087745) (← links)
- A Structure-Preserving Divide-and-Conquer Method for Pseudosymmetric Matrices (Q6094743) (← links)
