A note on optimal block-scaling of matrices
From MaRDI portal
Publication:797956
DOI10.1007/BF01389760zbMATH Open0546.65020OpenAlexW2094948651MaRDI QIDQ797956FDOQ797956
Authors: Ludwig Elsner
Publication date: 1984
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132923
Recommendations
- Optimal Block Diagonal $l_2 $-Scaling of Matrices
- An Algorithm for Optimal ℓ2 Scaling of Matrices
- Optimally conditioned block matrices
- Optimal sampling algorithms for block matrix multiplication
- On complexity of matrix scaling
- Existence and Uniqueness of Optimal Matrix Scalings
- Upper bounds for nearly optimal diagonal scaling of matrices
- Block scaling with optimal euclidean condition
- A Block Projection Method for Sparse Matrices
- Approximations for the general block distribution of a matrix
Cites Work
Cited In (6)
- Scalings of matrices which have prespecified row sums and column sums via optimization
- Optimal preconditioners of a given sparsity pattern
- A bound for the condition of a hyperbolic eigenvector matrix
- Scalable frames
- Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices
- Optimally conditioned block matrices
This page was built for publication: A note on optimal block-scaling of matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797956)