Highly scalable distributed-memory sparse triangular solution algorithms

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	SIAM Workshop on Combinatorial Scientific Computing (8. : 2018 : Bergen, Norwegen) 8th SIAM Workshop on Combinatorial Scientific Computing (CSC18)
1. Verfasser:	Liu, Yang (VerfasserIn)
Weitere Verfasser:	Jacquelin, Mathias (VerfasserIn), Ghysels, Pieter (VerfasserIn), Li, Xiaoye S. (VerfasserIn)
Pages:	8
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	2018
Schlagworte:
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Titel	Jahr	Verfasser
Low-Memory Algorithimic Adjoint Propagation	2018	Naumann, Uwe
On spectral partitioning of signed graphs	2018	Knyazev, Andrew
Index Reduction for Differential-Algebraic Equations with Mixed Matrices	2018	Iwata, Satoru
Approximation algorithms for maximum matchings in undirected graphs	2018	Dufossé, Fanny
Multi-criteria Graph Partitioning with Scotch	2018	Barat, Rémi
Fault Tolerant Resource Efficient Matrix Multiplication	2018	Birnbaum, Noam
Evolving Difficult Graphs for Laplacian Solvers	2018	Deweese, Kevin
Fast and effective reordering of columns within supernodes using partition refinement	2018	Jacquelin, Mathias
Highly scalable distributed-memory sparse triangular solution algorithms	2018	Liu, Yang
New Approximation Algorithms for Minimum Weighted Edge Cover	2018	Ferdous, S. M.