Reordering strategy for blocking optimization in sparse linear solvers

DOI10.1137/16M1062454zbMATH Open1366.65047OpenAlexW4386017381MaRDI QIDQ5346752FDOQ5346752

Authors: Gregoire Pichon, Mathieu Faverge, P. Ramet, J. Roman 

Publication date: 29 May 2017

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/16m1062454

Recommendations

• A locally optimized reordering algorithm and its application to a parallel sparse linear system solver
• Improving the numerical stability and the performance of a parallel sparse solver
• The multiple minimum degree ordering with greedy graph compression for vector computers
• Direct methods for solving large sparse systems of equations based on the two by two block decomposition of the matrix
• Node Selection Strategies for Bottom-Up Sparse Matrix Ordering

zbMATH Keywords

algorithmnested dissectionsparse matrix orderingheterogeneous architecturessparse direct solverblock-symbolic factorizationsparse block linear solver

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)

Cites Work

• The university of Florida sparse matrix collection
• The traveling salesman problem. A computational study.
• PaStiX: A high-performance parallel direct solver for sparse symmetric positive definite systems
• Design of a multicore sparse Cholesky factorization using DAGs
• Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
• Title not available (Why is that?)
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• On Finding Supernodes for Sparse Matrix Computations
• Nested Dissection of a Regular Finite Element Mesh
• An Approximate Minimum Degree Ordering Algorithm
• Error Detecting and Error Correcting Codes
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• A Separator Theorem for Planar Graphs
• A set of level 3 basic linear algebra subprograms
• The Role of Elimination Trees in Sparse Factorization
• Algorithmic Aspects of Vertex Elimination on Directed Graphs
• Title not available (Why is that?)
• On the Application of the Minimum Degree Algorithm to Finite Element Systems
• Title not available (Why is that?)
• Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver)
• On the minimum FLOPs problem in the sparse Cholesky factorization

Cited In (3)

• Solving Parametric Sparse Linear Systems by Local Blocking
• Hierarchical Orthogonal Factorization: Sparse Square Matrices
• Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes

Uses Software

• HSL
• BLAS
• SparseMatrix
• Concorde
• Scotch
• HSL_MA87

This page was built for publication: Reordering strategy for blocking optimization in sparse linear solvers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346752)