PLASMA

swMATH12743MaRDI QIDQ24667FDOQ24667

Author name not available (Why is that?)

Described by source

• PLASMA

Cited In (40)

• A Scalable High Performant Cholesky Factorization for Multicore with GPU Accelerators
• KBLAS
• Implementing High-performance Complex Matrix Multiplication via the 3m and 4m Methods
• Multi-GPU implementation of the lattice Boltzmann method
• Scientific computations on multi-core systems using different programming frameworks
• Evaluation of selected resource allocation and scheduling methods in heterogeneous many-core processors and graphics processing units
• ViennaCL-linear algebra library for multi- and many-core architectures
• BLIS: a framework for rapidly instantiating BLAS functionality
• Divide and conquer on hybrid GPU-accelerated multicore systems
• Parallel hierarchical hybrid linear solvers for emerging computing platforms
• A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic
• A High Performance QDWH-SVD Solver Using Hardware Accelerators
• SuperGlue: A Shared Memory Framework Using Data Versioning for Dependency-Aware Task-Based Parallelization
• An inertia-free filter line-search algorithm for large-scale nonlinear programming
• Accelerating the Solution of Linear Systems by Iterative Refinement in Three Precisions
• Linear algebra software for large-scale accelerated multicore computing
• Hiding Global Communication Latency in the GMRES Algorithm on Massively Parallel Machines
• Algorithm 953: Parallel library software for the multishift QR algorithm with aggressive early deflation
• \(\mathcal H\)-LU factorization on many-core systems
• Exploiting Symmetry in Tensors for High Performance: Multiplication with Symmetric Tensors
• A Set of Batched Basic Linear Algebra Subprograms and LAPACK Routines
• Static Scheduling with Load Balancing for Solving Triangular Band Linear Systems on Multicore Processors
• A distributed and incremental SVD algorithm for agglomerative data analysis on large networks
• A novel parallel algorithm based on the Gram-Schmidt method for tridiagonal linear systems of equations
• Design of a Multicore Sparse Cholesky Factorization Using DAGs
• An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths
• An efficient approach to solve very large dense linear systems with verified computing on clusters
• Exact likelihood-free Markov chain Monte Carlo for elliptically contoured distributions
• Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
• Towards an Efficient Tile Matrix Inversion of Symmetric Positive Definite Matrices on Multicore Architectures
• Efficient semidefinite branch-and-cut for MAP-MRF inference
• Parallel direct methods for solving the system of linear equations with pipelining on a multicore using OpenMP
• Toward a High Performance Tile Divide and Conquer Algorithm for the Dense Symmetric Eigenvalue Problem
• An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
• The parallel tiled WZ factorization algorithm for multicore architectures
• Solving a large scale radiosity problem on GPU-based parallel computers
• High-order finite-element seismic wave propagation modeling with MPI on a large GPU cluster
• Numerical analysis of parallel implementation of the reorthogonalized ABS methods
• Experiments with sparse Cholesky using a sequential task-flow implementation
• A New Sparse $LDL^T$ Solver Using A Posteriori Threshold Pivoting

This page was built for software: PLASMA