Skip to main content
Ir a la página de inicio de la Comisión Europea (se abrirá en una nueva ventana)
español español
CORDIS - Resultados de investigaciones de la UE
CORDIS

Parallel Numerical Linear Algebra for Future Extreme-Scale Systems

CORDIS proporciona enlaces a los documentos públicos y las publicaciones de los proyectos de los programas marco HORIZONTE.

Los enlaces a los documentos y las publicaciones de los proyectos del Séptimo Programa Marco, así como los enlaces a algunos tipos de resultados específicos, como conjuntos de datos y «software», se obtienen dinámicamente de OpenAIRE .

Resultado final

Final prototype software for different versions of the BLAS (se abrirá en una nueva ventana)

Final implementation and evaluation of different versions of the BLAS based on the final specification from WP7.

Software for hybrid methods (se abrirá en una nueva ventana)

Software for partitioning saddle point problems and overdetermined systems; improved block Cimmino methods incorporating new solvers from other deliverables. Includes extensive testing, documentation and benchmarking.

Software integration (se abrirá en una nueva ventana)

Integration of the NLAFET library in the respective application environments.

Novel SVD algorithms (se abrirá en una nueva ventana)

Prototypes for the standard SVD algorithm, the symmetric eigenvalue problem and the QDWH-based SVD algorithm.

Software for highly unsymmetric factorizations (se abrirá en una nueva ventana)

Implementation of proposed methods from D3.4 on top of common task framework. Includes extensive testing, documentation and benchmarking.

Prototypes for tiled one-sided factorizations with algorithm-based fault tolerance (se abrirá en una nueva ventana)

Prototype software for the Cholesky, LU, and QR factorizations with algorithm-based fault tolerance described in D6.6.

Prototype software for eigenvalue problem solvers (se abrirá en una nueva ventana)

Prototypes for reduction to non-symmetric condensed forms (Hessenberg and Hessenberg-triangular), for the symmetric eigenvalue problem and the non-symmetric eigenvalue problems.

Prototype software, phase 2 (se abrirá en una nueva ventana)

Prototypes for Krylov-based iterative methods, and multilevel preconditioners.

Bidiagonal factorization (se abrirá en una nueva ventana)

Prototypes for tw-sided bidiagonal factorization.

Prototype software, phase 1 (se abrirá en una nueva ventana)

Prototype software for sparse matrix-matrix multiplication and sparse low-rank matrix- approximation.

Prototype software for different versions of the BLAS (se abrirá en una nueva ventana)

Implementation and evaluation of different versions of the BLAS based on the draft specification from WP7.

Software for symmetrically structured factorizations (se abrirá en una nueva ventana)

Implementation and adaption of methods from D3.2 on top of the common task framework. Extension from symmetric to unsymmetric (but symmetrically structured) case. Includes extensive testing, documentation and benchmarking.

Prototypes for runtime systems exhibiting novel types of scheduling (se abrirá en una nueva ventana)

Prototype for runtime systems capable of scheduling at a varying level of granularity/abstraction (i.e., basic kernels, BLAS, LAPACK, etc, and runtime systems that can execute the tasks along the critical path with an adaptive level of parallelism.

Algorithm design for symmetrically structured factorizations (se abrirá en una nueva ventana)

Report on algorithm design and approaches to address issues around use of DAGs for sparse factorizations. Includes reporting on prototype code testing possible solutions.

Scalability and tunability of factorization algorithms (se abrirá en una nueva ventana)

Report on scalability and tunability of the software implementing novel factorisation algorithms.

One-sided matrix factorizations (se abrirá en una nueva ventana)

Report on tile algorithms and new experimental algorithms for matrix factorizations (LU, Cholesky, symmetric indefinite and QR). Includes reporting on and documentation of prototype code developed.

Analysis and algorithm design (se abrirá en una nueva ventana)

Report on novel Krylov methods and multilevel preconditioners, focusing on numerical efficiency and theoretical properties.

Eigenvalue solvers for nonsymmetric problems (se abrirá en una nueva ventana)

Evaluation of new eigenvalue solvers for the non-symmetric eigenvalue problem, including Krylov methods.

Draft specification for Hybrid BLAS (se abrirá en una nueva ventana)

Requirements and draft specification for a common set of high performance linear algebra kernels on hybrid systems: Hybrid BLAS.

Evaluation of software prototypes (se abrirá en una nueva ventana)

Report evaluating the prototype software developed in task 6.1 with regard to overall system performance on a selection of linear algebra algorithms.

Integration (se abrirá en una nueva ventana)

Report on the integration of preconditioners and iterative methods from D4.3 into the NLAFET library. Evaluation of the parallel efficiency of the new preconditioned iterative solvers.

Algorithm design for highly unsymmetric factorizations (se abrirá en una nueva ventana)

Report on experimental algorithms for parallel Markowitz ordering, analyzing various approaches and highlighting issues arising. Includes reporting on prototype code testing possible algorithms and solutions.

Evaluation of auto-tuning techniques (se abrirá en una nueva ventana)

Report on the effect of applying the novel scheduling and auto-tuning prototypes to various linear algebra problems.

Novel methods for static and dynamic scheduling (se abrirá en una nueva ventana)

Evaluation of existing and novel methods for static and dynamic scheduling in various types of HPC systems. Includes documentation of algorithms and prototypes developed.

Requirements analysis (se abrirá en una nueva ventana)

Report describing the outcome of the requirements analysis for all applications.

First dissemination report (se abrirá en una nueva ventana)

Dissemination report for the first reporting period, M1-M18.

Dissemination and community outreach plan (se abrirá en una nueva ventana)

Plan for how to disseminate new results and interact with the broader community.

An off-line auto-tuning framework based on heuristic search (se abrirá en una nueva ventana)

Review of techniques for pruning the search space in the context of auto-tuning, resulting in prototypes for an offline auto-tuning framework based on heuristic search. Includes reporting on optimal circumstances for switching scheduling approaches at run-time.

Second dissemination report (se abrirá en una nueva ventana)

Final dissemination report, covering M19-M36.

Algorithm design for hybrid methods (se abrirá en una nueva ventana)

Report on partitioning techniques and performance bottlenecks for hybrid methods including block Cimmino. Analysis of methods for saddle-point and overdetermined systems.

Eigenvalue problem solvers (se abrirá en una nueva ventana)

Report on computation of eigenvectors and reordering of eigenvalues in Schur and generalized Schur forms. Includes evaluation of the scalability and tunability of the prototype software developed.

Theoretical bounds for communication in sparse operations (se abrirá en una nueva ventana)

Report on theoretical lower bounds for key sparse matrix operations such as matrix-matrix multiplication and factorization.

Performance evaluation (se abrirá en una nueva ventana)

Evaluation of the communication complexity and parallel performance of the prototypes from D4.3.

Final Hybrid BLAS specification (se abrirá en una nueva ventana)

Revised versions of the BLAS specification based on collaborations with academic institutions and hardware vendors.

Algorithm-based fault tolerance techniques (se abrirá en una nueva ventana)

Report on algorithm-based fault tolerance applied to the tiled Cholesky, LU, and/or QR factorizations.

Validation and evaluation (se abrirá en una nueva ventana)

Evaluation of the NLAFET library in the context of the applications, leading to validation of the library and recommendations for future improvements.

Collaborative infrastructure (se abrirá en una nueva ventana)

Project website (will contain both public parts, and parts that are restricted to the consortium), public and private source code repositories, bug tracking system, online forum, coding style, and developer guidelines.

Beta release of the NLAFET library (se abrirá en una nueva ventana)

Beta release of parts of the NLAFET library and User's Guide.

Release of the NLAFET library (se abrirá en una nueva ventana)

First complete release of the NLAFET library and associated User's Guide.

Publicaciones

A synchronization-free algorithm for parallel sparse triangular solves. (se abrirá en una nueva ventana)

Autores: W. Liu , A. Li , J. Hogg, I. Duff, B Vinter
Publicado en: Proceedings of Euro-Par 2016, Springer Lecture Notes, Edición 9833, 2016, Página(s) 617-630, ISBN 978-3-319-43658-6
Editor: Springer Verlag
DOI: 10.1007/978-3-319-43659-3_45

Creating a Standardised Set of Batched BLAS Routines

Autores: Jack Dongarra and Sven Hammarling and Nicholas J. Higham and Samuel D. Relton and Pedro Valero-Lara and Mawussi Zounon
Publicado en: Proceedings of the Fourth Workshop on Sustainable Software for Science: Practice and Experiences (WSSSPE4, 2016), 2016
Editor: CEUR Workshop Proceedings

A 3D Parallel Algorithm for QR Decomposition (se abrirá en una nueva ventana)

Autores: Grey Ballard, James Demmel, Laura Grigori, Mathias Jacquelin, Nicholas Knight
Publicado en: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18, 2018, Página(s) 55-65, ISBN 9781-450357999
Editor: ACM Press
DOI: 10.1145/3210377.3210415

An Auto-Tuning Framework for a NUMA-Aware Hessenberg Reduction Algorithm (se abrirá en una nueva ventana)

Autores: Mahmoud Eljammaly, Lars Karlsson, Bo Kågström
Publicado en: Companion of the 2018 ACM/SPEC International Conference on Performance Engineering - ICPE '18, 2018, Página(s) 5-8, ISBN 9781450356299
Editor: ACM Press
DOI: 10.1145/3185768.3186304

Harnessing GPU’s Tensor Cores for Fast FP16 Arithmetic to Speedup Mixed-Precision Iterative Refinement Solvers

Autores: Azzam Haidar, Stanimire Tomov, Jack Dongarra, Nick Higham
Publicado en: Proceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis, 2019
Editor: Association for Computing Machinery

Distributed One-Stage Hessenberg Triangular Reduction with Wavefront Scheduling

Autores: B. Adlerborn, L. Karlsson, and B. Kågström
Publicado en: NLAFET Working Papers, Edición 1, 2016
Editor: Umeå University, the NLAFET project

PDHGEQZ User Guide

Autores: B. Adlerborn, B. Kågström, D. Kressner
Publicado en: NLAFET Working Notes, Edición 2, 2016
Editor: Umeå University, NLAFET project

A Proposed API for Batched Basic Linear Algebra Subprograms

Autores: J. Dongarra, I. Duff, J Hogg, M. Gates, A. Haidar, S. Hammarling, N. J. Higham, P.V.-Lara, S.D. Relton, S. Tomov, M. Zounon
Publicado en: 2016, ISSN 1749-9097
Editor: University of Manchester

Experiments with sparse Cholesky using runtime systems

Autores: I. Duff, J. Hogg, and F. Lopez
Publicado en: NLAFET Working Notes, Edición 7, 2016
Editor: Umeå University, STFC

Workshop on Batched, Reproducible, and Reduced Precision BLAS

Autores: S. Hammarling
Publicado en: NLAFET Working Notes, Edición 4, 2016
Editor: Umeå University, University of Manchester

Low rank approximation of a sparse matrix based on LU factorization with column and row tournament pivoting

Autores: L. Grigori, S. Cayrols, and J. Demmel
Publicado en: NLAFET Working Notes, Edición 3, 2016
Editor: Umeå University, INRIA

A Comparison of Potential Interfaces for Batched BLAS Computations

Autores: S.D. Relton, P. Valero-Lara, and M. Zounon
Publicado en: NLAFET Working Notes, Edición 5, 2016
Editor: Umeå University, University of Manchester

A new sparse solver using a posteriori threshold pivoting

Autores: Jonathan Hogg
Publicado en: NLAFET Working Notes, Edición 6, 2016
Editor: Umeå University, STFC

Linear-time CUR approximation of BEM matrices

Autores: Ayala, Alan; Claeys, Xavier; Grigori, Laura
Publicado en: https://hal.inria.fr/hal-01893036, Edición 1, 2018
Editor: INRIA

A multilevel algebraic error estimator and the corresponding iterative solver with $p$-robust behavior

Autores: Miraçi, Ani; Papež, Jan; Vohralík, Martin
Publicado en: https://hal.archives-ouvertes.fr/hal-02070981, Edición 1, 2019
Editor: INRIA

Scalable Linear Solvers based on Enlarged Krylov subspaces with Dynamic Reduction of Search Directions

Autores: Laura Grigori, Olivier Tissot
Publicado en: 2018
Editor: INRIA

Reducing the communication and computational costs of enlarged Krylov subspaces conjugate gradient

Autores: Laura Grigori, Olivier Tissot
Publicado en: 2017
Editor: INRIA

A Multilevel Schwarz Preconditioner Based on a Hierarchy of Robust Coarse Spaces

Autores: Hussam Al Daas, Laura Grigori, Pierre Jolivet, Pierre-Henri Tournier
Publicado en: 2019
Editor: INRIA

Experiments with sparse Cholesky using a parametrized task graph implementation.

Autores: Iain Duff and Florent Lopez
Publicado en: NLAFET Working Notes, Edición 14, 2017
Editor: Umeå University, also as Technical Report RAL-TR-2017-006, Science & Technology Facilities Council, UK.

PLASMA 17 Functionality Report: Parallel BLAS and Norms, Linear Systems and Least Squares, Mixed Precision and Matrix Inversion

Autores: Maksims Abalenkovs, Jack Dongarra, Mark Gates, Azzam Haidar, Jakub Kurzak, Piotr Luszczek, Mawussi Zounon, Samuel Relton, Jakub Sistek, David Stevens, Ichitaro Yamazaki, Asim YarKhan
Publicado en: NLAFET Working Notes, Edición 15, 2017
Editor: Umeå University, also as LAPACK Working Notes 293

Solving linear equations with messenger-field and conjugate gradients techniques – an application to CMB data analysis

Autores: Jan Papez, Laura Grigori, Radoslav Stompor
Publicado en: NLAFET Working Notes, Edición 19, 2018
Editor: Umeå University. Also as INRIA Research Report 9157, France

Sparse direct solution on parallel computers

Autores: Iain Duff, Florent Lopez and Stojce Nakov
Publicado en: NLAFET Working Notes, Edición 17, 2017
Editor: Umeå University. Also published as Technical Report RAL-TR-2017-010, STFC, UK.

Parallelization of the solve phase in a task-based Cholesky solver using a sequential task flow model

Autores: Sébastien Cayrols, Iain Duff and Florent Lopez
Publicado en: NLAFET Working Notes, Edición 20, 2018
Editor: Umeå University. Also published as Technical Report RAL-TR-2018-008, STFC, UK

PLASMA 17 Performance Report. Linear Systems and Least Squares; Haswell, Knights Landing, POWER8.

Autores: Maksims Abalenkovs, Negin Bagherpour, Jack Dongarra, Mark Gates, Azzam Haidar, Jakub Kurzak, Piotr Luszczek, Samuel Relton, Jakub Sistek, David Stevens, PanruoWu, Ichitaro Yamazaki, Asim YarKhan, Mawussi Zounon
Publicado en: NLAFET Working Notes, Edición 16, 2017
Editor: Umeå university, also published as LAPACK Working Notes 292

An Auto-Tuning Framework for a NUMA-Aware Hessenberg Reduction Algorithm

Autores: Mahmoud Eljammaly, Lars Karlsson and Bo Kågström
Publicado en: NLAFET Working Notes, Edición 18, 2017
Editor: Umeå University

A new sparse symmetric indefinite solver using A Posteriori Threshold Pivoting

Autores: Iain Duff, Jonathan Hogg and Florent Lopez
Publicado en: NLAFET Working Notes, Edición 21, 2018
Editor: Umeå University. Also published as Technical Report RAL-TR-2018-012, STFC, UK

Design and implementation of a parallel Markowitz threshold algorithm

Autores: Timothy Davis, Iain Duff, Stojce Nakov
Publicado en: NLAFET Working Notes, Edición 22, 2019
Editor: Umeå University. Also published as Technical Report RAL-TR-2019-003, STFC, UK

Reducing the communication and computational costs of Enlarged Krylov subspaces Conjugate Gradient

Autores: L. Grigori and O. Tissot
Publicado en: NLAFET Working Note, Edición 13, 2017
Editor: Umeå University, also INRIA Research Report 9023

Evaluation of the Tunability of a New NUMA-Aware Hessenberg Reduction Algorithm

Autores: M. Eljammaly, L. Karlsson, and B. Kågström
Publicado en: NLAFET Working Notes, Edición 8, 2017
Editor: Umeå University, the NLAFET project

Second Workshop on Batched, Reproducible, and Reduced Precision BLAS.

Autores: Sven Hammarling
Publicado en: NLAFET Working Notes, Edición 12, 2017
Editor: Umeå University, University of Manchester

Towards Highly Parallel and Compute-Bound Computation of Eigenvectors of Matrices in Schur Form

Autores: B. Adlerborn, C.C. Kjelgaard Mikkelsen, L. Karlsson, and B. Kågström
Publicado en: NLAFET Working Notes, Edición 10, 2017
Editor: Umeå University, the NLAFET project

Robust solution of triangular linear systems

Autores: C.C. Kjelgaard Mikkelsen and L. Karlsson
Publicado en: NLAFET Working Notes, Edición 9, 2017
Editor: Umeå University

Task-Based Parallel Algorithms for Reordering of Matrices in Real Schur Form

Autores: M. Myllykoski, C.C. Kjelgaard Mikkelsen, L. Karlsson, and B. Kågström.
Publicado en: NLAFET Working Notes, Edición 11, 2017
Editor: Umeå University, the NLAFET project

Solving linear equations with messenger-field and conjugate gradient techniques: An application to CMB data analysis (se abrirá en una nueva ventana)

Autores: J. Papež, L. Grigori, R. Stompor
Publicado en: Astronomy & Astrophysics, Edición 620, 2018, Página(s) A59, ISSN 0004-6361
Editor: Springer Verlag
DOI: 10.1051/0004-6361/201832987

The Design and Performance of Batched BLAS on Modern High-Performance Computing Systems (se abrirá en una nueva ventana)

Autores: Jack Dongarra, Sven Hammarling, Nicholas J. Higham, Samuel D. Relton, Pedro Valero-Lara, Mawussi Zounon
Publicado en: Procedia Computer Science, Edición 108, 2017, Página(s) 495-504, ISSN 1877-0509
Editor: Elsevier
DOI: 10.1016/j.procs.2017.05.138

A Householder-Based Algorithm for Hessenberg-Triangular Reduction (se abrirá en una nueva ventana)

Autores: Zvonimir Bujanović, Lars Karlsson, Daniel Kressner
Publicado en: SIAM Journal on Matrix Analysis and Applications, Edición 39/3, 2018, Página(s) 1270-1294, ISSN 0895-4798
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/17m1153637

Distributed One-Stage Hessenberg-Triangular Reduction with Wavefront Scheduling (se abrirá en una nueva ventana)

Autores: Björn Adlerborn, Lars Karlsson, Bo Kågström
Publicado en: SIAM Journal on Scientific Computing, Edición 40/2, 2018, Página(s) C157-C180, ISSN 1064-8275
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/16m1103890

ALORA: Affine Low-Rank Approximations (se abrirá en una nueva ventana)

Autores: Alan Ayala, Xavier Claeys, Laura Grigori
Publicado en: Journal of Scientific Computing, Edición 79/2, 2019, Página(s) 1135-1160, ISSN 0885-7474
Editor: Kluwer Academic/Plenum Publishers
DOI: 10.1007/s10915-018-0885-5

PLASMA (se abrirá en una nueva ventana)

Autores: Jack Dongarra, Negin Bagherpour, Sven Hammarling, Jakub Šístek, David Stevens, Mawussi Zounon, Samuel D. Relton, Mark Gates, Azzam Haidar, Jakub Kurzak, Piotr Luszczek, Panruo Wu, Ichitaro Yamazaki, Asim Yarkhan, Maksims Abalenkovs
Publicado en: ACM Transactions on Mathematical Software, Edición 45/2, 2019, Página(s) 1-35, ISSN 0098-3500
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3264491

Experiments with sparse Cholesky using a sequential task-flow implementation (se abrirá en una nueva ventana)

Autores: Iain Duff, Jonathan Hogg, Florent Lopez
Publicado en: Numerical Algebra, Control & Optimization, Edición 8/2, 2018, Página(s) 237-260, ISSN 2155-3297
Editor: American Institute of Mathematical Sciences
DOI: 10.3934/naco.2018014

A Guide for Achieving High Performance with Very Small Matrices on GPU: A Case Study of Batched LU and Cholesky Factorizations (se abrirá en una nueva ventana)

Autores: Azzam Haidar, Ahmad Abdelfattah, Mawussi Zounon, Stanimire Tomov, Jack Dongarra
Publicado en: IEEE Transactions on Parallel and Distributed Systems, Edición 29/5, 2018, Página(s) 973-984, ISSN 1045-9219
Editor: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tpds.2017.2783929

Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting (se abrirá en una nueva ventana)

Autores: Laura Grigori, Sebastien Cayrols, James W. Demmel
Publicado en: SIAM Journal on Scientific Computing, Edición 40/2, 2018, Página(s) C181-C209, ISSN 1064-8275
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/16m1074527

Parallel robust solution of triangular linear systems (se abrirá en una nueva ventana)

Autores: Carl Christian Kjelgaard Mikkelsen, Angelika Beatrix Schwarz, Lars Karlsson
Publicado en: Concurrency and Computation: Practice and Experience, 2017, Página(s) e5064, ISSN 1532-0626
Editor: John Wiley & Sons Inc.
DOI: 10.1002/cpe.5064

Fast synchronization-free algorithms for parallel sparse triangular solves with multiple right-hand sides (se abrirá en una nueva ventana)

Autores: Weifeng Liu, Ang Li, Jonathan D. Hogg, Iain S. Duff, Brian Vinter
Publicado en: Concurrency and Computation: Practice and Experience, Edición 29/21, 2017, Página(s) e4244, ISSN 1532-0626
Editor: John Wiley & Sons Inc.
DOI: 10.1002/cpe.4244

On solving separable block tridiagonal linear systems using a GPU implementation of radix-4 PSCR method (se abrirá en una nueva ventana)

Autores: M. Myllykoski, T. Rossi, J. Toivanen
Publicado en: Journal of Parallel and Distributed Computing, Edición 115, 2018, Página(s) 56-66, ISSN 0743-7315
Editor: Academic Press
DOI: 10.1016/j.jpdc.2018.01.004

Scalable eigenvector computation for the non-symmetric eigenvalue problem (se abrirá en una nueva ventana)

Autores: Angelika Schwarz, Lars Karlsson
Publicado en: Parallel Computing, Edición 85, 2019, Página(s) 131-140, ISSN 0167-8191
Editor: Elsevier BV
DOI: 10.1016/j.parco.2019.04.001

Symmetric Indefinite Linear Solver Using OpenMP Task on Multicore Architectures (se abrirá en una nueva ventana)

Autores: Ichitaro Yamazaki, Jakub Kurzak, Panruo Wu, Mawussi Zounon, Jack Dongarra
Publicado en: IEEE Transactions on Parallel and Distributed Systems, Edición 29/8, 2018, Página(s) 1879-1892, ISSN 1045-9219
Editor: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tpds.2018.2808964

Optimized Batched Linear Algebra for Modern Architectures (se abrirá en una nueva ventana)

Autores: Jack Dongarra, Sven Hammarling, Nicholas J. Higham, Samuel D. Relton, Mawussi Zounon
Publicado en: Euro-Par 2017: Parallel Processing, Edición 10417, 2017, Página(s) 511-522, ISBN 978-3-319-64202-4
Editor: Springer International Publishing
DOI: 10.1007/978-3-319-64203-1_37

Sparse Direct Solution on Parallel Computers (se abrirá en una nueva ventana)

Autores: Iain Duff, Florent Lopez, Stojce Nakov
Publicado en: Numerical Analysis and Optimization, Edición 235, 2018, Página(s) 67-98, ISBN 978-3-319-90025-4
Editor: Springer International Publishing
DOI: 10.1007/978-3-319-90026-1_4

On the Tunability of a New Hessenberg Reduction Algorithm Using Parallel Cache Assignment (se abrirá en una nueva ventana)

Autores: Mahmoud Eljammaly, Lars Karlsson, Bo Kågström
Publicado en: Parallel Processing and Applied Mathematics, Edición 10777, 2018, Página(s) 579-589, ISBN 978-3-319-78023-8
Editor: Springer International Publishing
DOI: 10.1007/978-3-319-78024-5_50

Experiments with Sparse Cholesky Using a Parametrized Task Graph Implementation (se abrirá en una nueva ventana)

Autores: Iain Duff, Florent Lopez
Publicado en: Parallel Processing and Applied Mathematics, Edición 10777, 2018, Página(s) 197-206, ISBN 978-3-319-78023-8
Editor: Springer International Publishing
DOI: 10.1007/978-3-319-78024-5_18

The Design of Fast and Energy-Efficient Linear Solvers: On the Potential of Half-Precision Arithmetic and Iterative Refinement Techniques (se abrirá en una nueva ventana)

Autores: Azzam Haidar, Ahmad Abdelfattah, Mawussi Zounon, Panruo Wu, Srikara Pranesh, Stanimire Tomov, Jack Dongarra
Publicado en: Computational Science – ICCS 2018, Edición 10860, 2018, Página(s) 586-600, ISBN 978-3-319-93697-0
Editor: Springer International Publishing
DOI: 10.1007/978-3-319-93698-7_45

Blocked Algorithms for Robust Solution of Triangular Linear Systems (se abrirá en una nueva ventana)

Autores: Carl Christian Kjelgaard Mikkelsen, Lars Karlsson
Publicado en: Parallel Processing and Applied Mathematics, Edición 10777, 2018, Página(s) 68-78, ISBN 978-3-319-78023-8
Editor: Springer International Publishing
DOI: 10.1007/978-3-319-78024-5_7

A Task-Based Algorithm for Reordering the Eigenvalues of a Matrix in Real Schur Form (se abrirá en una nueva ventana)

Autores: Mirko Myllykoski
Publicado en: Parallel Processing and Applied Mathematics, Edición 10777, 2018, Página(s) 207-216, ISBN 978-3-319-78023-8
Editor: Springer International Publishing
DOI: 10.1007/978-3-319-78024-5_19

Buscando datos de OpenAIRE...

Se ha producido un error en la búsqueda de datos de OpenAIRE

No hay resultados disponibles

Mi folleto 0 0