The following pages link to An Algorithm for Scaling Matrices (Q3843908):
Displaying 15 items.
- Scaling linear optimization problems prior to application of the simplex method (Q453620) (← links)
- Applications of shortest path algorithms to matrix scalings (Q799343) (← links)
- Computational methods of linear algebra (Q1148099) (← links)
- An algorithm for scaling matrices and computing the minimum cycle mean in a digraph (Q1149744) (← links)
- On solving problems with sparse matrices (Q1245674) (← links)
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives (Q1954336) (← links)
- The Sylvester Resultant Matrix and Image Deblurring (Q2945991) (← links)
- A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds (Q3336583) (← links)
- Computing optimal scalings by parametric network algorithms (Q3691441) (← links)
- On scaling linear programs—some experimental results (Q3835674) (← links)
- Cones, graphs and optimal scalings of matrices (Q3871026) (← links)
- Characterizations of optimal scalings of matrices (Q3878655) (← links)
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results (Q4165158) (← links)
- A computational comparison of scaling techniques for linear optimization problems on a graphical processing unit (Q4983284) (← links)
- Some Results on Sparse Matrices (Q5641963) (← links)
