Decomposition in multidimensional Boolean-optimization problems with sparse matrices

DOI10.1134/S1064230718010033MaRDI QIDQ1647455zbMATH OpenOpenAlexWikidataFDO

Authors D. Kovkov, D. V. Lemtyuzhnikova

Publication date 26 June 2018

Published in Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1064230718010033

Mathematics Subject Classification ID

Boolean programming (90C09)

Recommendations

• Large-scale problems with quasi-block matrices
• Sparsification of rectangular matrices
• scientific article; zbMATH DE number 5158614
• scientific article; zbMATH DE number 3905737
• A hierarchical algorithm for making sparse matrices sparser

Cites work

• Algorithmic Aspects of Vertex Elimination on Graphs
• An Approximate Minimum Degree Ordering Algorithm
• Computational models and task scheduling for parallel sparse Cholesky factorization
• Computing the Minimum Fill-In is NP-Complete
• Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
• Depth-First Search and Linear Graph Algorithms
• High Dimensional Low Rank Plus Sparse Matrix Decomposition
• scientific article; zbMATH DE number 3852305 (Why is no real title available?)
• scientific article; zbMATH DE number 3854298 (Why is no real title available?)
• scientific article; zbMATH DE number 3724611 (Why is no real title available?)
• scientific article; zbMATH DE number 3473182 (Why is no real title available?)
• scientific article; zbMATH DE number 1953444 (Why is no real title available?)
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• scientific article; zbMATH DE number 3248502 (Why is no real title available?)
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)
• scientific article; zbMATH DE number 3420184 (Why is no real title available?)
• scientific article; zbMATH DE number 3198397 (Why is no real title available?)
• Improving the Run Time and Quality of Nested Dissection Ordering
• Modification of the minimum-degree algorithm by multiple elimination
• Nested Dissection of a Regular Finite Element Mesh
• Robust Ordering of Sparse Matrices using Multisection
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Sparse Matrix Factorizations for Fast Linear Solvers with Application to Laplacian Systems
• Sparse matrix-vector multiplication on GPGPUs
• Sub-optimal control of sparsely coupled systems
• The Use of Linear Graphs in Gauss Elimination

Cited in

(2)

• Large-scale problems with quasi-block matrices
• Graph extensions and some optimization problems in sparse matrix computations

Describes a project that uses

Uses Software

• symrcm
• Scotch

This page was built for publication: Decomposition in multidimensional Boolean-optimization problems with sparse matrices

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