Design and Implementation of a Parallel Markowitz Threshold Algorithm

Autor: Timothy A. Davis, Iain S. Duff, Stojce Nakov

Publikováno v: SIAM Journal on Matrix Analysis and Applications. 41:573-590

We develop a novel algorithm for the parallel factorization of an unsymmetric sparse matrix using a Markowitz threshold algorithm. Our algorithm uses a significant extension of a maximum independen...

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::676b9c329c6869c922dd82f1081dce6b
https://doi.org/10.1137/19m1245815

Advanced Architecture Computers

Autor: Iain S. Duff, Jack Dongarra

We describe the characteristics of several recent computers that employ vectorization or parallelism to achieve high performance in floating-point calculations. We consider both top-of-the-range supercomputers and computers based on readily available

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::9756b73fd14fd476c5bcd5ddeaf9e4f1
https://doi.org/10.1201/9781003066767-2

Uncovering Hidden Block Structure for Clustering

Autor: Luce Le Gorrec, Daniel Ruiz, Sandrine Mouysset, Philip A. Knight, Iain S. Duff

Publikováno v: LNCS-Proceedings of ECML PKDD 2019
European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases-ECML PKDD 2019
European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases-ECML PKDD 2019, Sep 2019, Würzburg, Germany. pp.140-155, ⟨10.1007/978-3-030-46150-8_9⟩
[Research Report] IRIT. 2018
Machine Learning and Knowledge Discovery in Databases ISBN: 9783030461492
ECML/PKDD (1)

ISBN 978-3-030-46149-2; International audience; We present a multistage procedure to cluster directed and undirected weighted graphs by finding the block structure of their adjacency matrices. A central part of the process is to scale the adjacency m

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4d2b02650921ce5ddd620cf1ccacb294
https://hal.archives-ouvertes.fr/hal-03003811/document

Experiments with sparse Cholesky using a sequential task-flow implementation

Autor: Iain S. Duff, Florent Lopez, JD Hogg

Publikováno v: Numerical Algebra, Control & Optimization

We describe the development of a prototype code for the solution of large sparse symmetric positive definite systems that is efficient on parallel architectures. We implement a DAG-based Cholesky factorization that offers good performance and scalabi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::35bf264340d207912027082268257859

Preconditioning Linear Least-Squares Problems by Identifying a Basis Matrix

Autor: Mario Arioli, Iain S. Duff

Publikováno v: SIAM Journal on Scientific Computing. 37:S544-S561

We study the solution of the linear least-squares problem $\min_x \| b - A x \|^2_2$ where the matrix $A \in {\Bbb R}^{m \times n}$ ($ m \ge n$) has rank $n$ and is large and sparse. We assume that $A$ is available as a matrix, not an operator. The p

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::7b7f62425ed0d3f0799bff9b3114634f
https://doi.org/10.1137/140975358