Near-linear runtime for a classical matrix preconditioning algorithm

Cites work

scientific article; zbMATH DE number 6508162 (Why is no real title available?)
scientific article; zbMATH DE number 7376020 (Why is no real title available?)
A Comparative Study of Algorithms for Matrix Balancing
Analysis of a Classical Matrix Preconditioning Algorithm
Analyzing random permutations for cyclic coordinate descent
Approximating min-mean-cycle for low-diameter graphs in near-optimal time and memory
Balancing a matrix for calculation of eigenvalues and eigenvectors
Balancing sparse matrices for computing eigenvalues
Concerning Diagonal Similarity of Irreducible Matrices
Coordinate descent algorithms
Cyclic Coordinate Dual Averaging with Extrapolation
Depth-First Search and Linear Graph Algorithms
Diagonal Equivalence to Matrices with Prescribed Row and Column Sums
Faster parametric shortest path and minimum‐balance algorithms
Inexact variable metric stochastic block-coordinate descent for regularized optimization
LAPACK Users' Guide
Line-sum-symmetric scalings of square nonnegative matrices
Matrix balancing
Matrix balancing in \(L_p\) norms: bounding the convergence rate of Osborne's iteration
Max-Balancing Weighted Directed Graphs and Matrix Scaling
Near-linear convergence of the random Osborne algorithm for matrix balancing
Numerical Computation of the Matrix Exponential with Accuracy Estimate
Numerical recipes. The art of scientific computing.
On Pre-Conditioning of Matrices
On the Complexity of Matrix Balancing
On the convergence of block coordinate descent type methods
Random Graphs
The Scaling and Squaring Method for the Matrix Exponential Revisited
Worst-case complexity of cyclic coordinate descent: O(n^2) gap with randomized version

This page was built for publication: Near-linear runtime for a classical matrix preconditioning algorithm

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