Preconditioning techniques based on the Birkhoff-von Neumann decomposition
DOI10.1515/CMAM-2016-0040zbMATH Open1359.65062OpenAlexW2531605218MaRDI QIDQ521649FDOQ521649
Authors: Michele Benzi, Bora Uçar 
Publication date: 11 April 2017
Published in: Computational Methods in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/cmam-2016-0040
Recommendations
- Preconditioning Techniques for the Bidomain Equations
- On the preconditioning of the bidiagonalization technique
- Preconditioners for domain decomposition methods
- Preconditioning of spectral methods via Birkhoff interpolation
- Preconditioning for boundary element methods in domain decomposition
- scientific article; zbMATH DE number 1163757
- scientific article; zbMATH DE number 77936
- scientific article; zbMATH DE number 794070
- scientific article; zbMATH DE number 54281
- scientific article; zbMATH DE number 2145387
preconditioningBirkhoff-von Neumann decompositiondoubly stochastic matrixparallel computingbipartite graphs
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Preconditioners for iterative methods (65F08) Numerical computation of matrix norms, conditioning, scaling (65F35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Stochastic matrices (15B51)
Cites Work
- The University of Florida sparse matrix collection
- Concerning nonnegative matrices and doubly stochastic matrices
- A Symmetry Preserving Algorithm for Matrix Scaling
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- Assignment Problems
- Title not available (Why is that?)
- Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function
- Notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices
- On algorithms for permuting large entries to the diagonal of a sparse matrix
- Notes on the Birkhoff Algorithm for Doubly Stochastic Matrices
- Combinatorial matrix theory
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- Title not available (Why is that?)
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- Preconditioning highly indefinite and nonsymmetric matrices
- Updating incomplete factorization preconditioners for model order reduction
- Fine-grained parallel incomplete LU factorization
- Algorithms for two bottleneck optimization problems
- Direct methods for sparse matrices
- A fast algorithm for matrix balancing
- Weighted matrix ordering and parallel banded preconditioners for iterative linear system solvers
- A Parallel Matrix Scaling Algorithm
Cited In (5)
Uses Software
This page was built for publication: Preconditioning techniques based on the Birkhoff-von Neumann decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q521649)
