An Algorithm for Scaling Matrices
D. R. Fulkerson, Patrick J. Wolfe · SIAM Review · 1962
Previous article Next article An Algorithm for Scaling MatricesD. R. Fulkerson and P. WolfeD. R. Fulkerson and P. Wolfehttps://doi.org/10.1137/1004032PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout Previous article Next article FiguresRelatedReferencesCited byDetails A generic optimization and learning framework for Parkinson disease via speech and handwritten records26 August 2022 | Journal of Ambient Intelligence and Humanized Computing, Vol. 157 Cross Ref From Linear Programming Approach to Metaheuristic Approach: Scaling TechniquesComplexity, Vol. 2021 Cross Ref User Control of the Optimization Process and Improving Efficiency13 April 2021 Cross Ref Scaling Techniques31 October 2017 Cross Ref The Sylvester Resultant Matrix and Image Deblurring14 August 2015 Cross Ref Introduction10 October 2013 Cross Ref Integer Linear Programming (ILP)10 October 2013 Cross Ref Pivot Rule10 October 2013 Cross Ref Dual Pivot Rule10 October 2013 Cross Ref Simplex Phase-I Method10 October 2013 Cross Ref Dual Simplex Phase-l Method10 October 2013 Cross Ref Reduced Simplex Method10 October 2013 Cross Ref Improved Reduced Simplex Method10 October 2013 Cross Ref D-Reduced Simplex Method10 October 2013 Cross Ref Criss-Cross Simplex Method10 October 2013 Cross Ref Generalizing Reduced Simplex Method10 October 2013 Cross Ref Geometry of the Feasible Region10 October 2013 Cross Ref Deficient-Basis Method10 October 2013 Cross Ref Dual Deficient-Basis Method10 October 2013 Cross Ref Face Method10 October 2013 Cross Ref Dual Face Method10 October 2013 Cross Ref Pivotal Interior-Point Method10 October 2013 Cross Ref Special Topics10 October 2013 Cross Ref Simplex Method10 October 2013 Cross Ref Duality Principle and Dual Simplex Method10 October 2013 Cross Ref Implementation of the Simplex Method10 October 2013 Cross Ref Sensitivity Analysis and Parametric LP10 October 2013 Cross Ref Variants of the Simplex Method10 October 2013 Cross Ref Decomposition Method10 October 2013 Cross Ref Interior-Point Method10 October 2013 Cross Ref Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomialsComputer Aided Geometric Design, Vol. 30, No. 4 Cross Ref Preconditioning for Sparse Linear Systems at the Dawn of the 21st Century: History, Current Developments, and Future PerspectivesISRN Applied Mathematics, Vol. 2012 Cross Ref Scaling linear optimization problems prior to application of the simplex method13 July 2011 | Computational Optimization and Applications, Vol. 52, No. 2 Cross Ref Symbolic-Numerical Method for the Stability Investigation of Difference Schemes on a Computer1 March 2011 Cross Ref An application of preconditioned conjugate gradients to relative placement in chip designInternational Journal for Numerical Methods in Engineering, Vol. 36, No. 2 Cross Ref On scaling linear programs—some experimental resultsOptimization, Vol. 27, No. 4 Cross Ref A monomial-based method for solving systems of non-linear algebraic equationsInternational Journal for Numerical Methods in Engineering, Vol. 31, No. 7 Cross Ref An Optimal Scaling MethodIEEE Transactions on Systems, Man, and Cybernetics, Vol. 17, No. 1 Cross Ref Computing optimal scalings by parametric network algorithmsMathematical Programming, Vol. 32, No. 1 Cross Ref Applications of shortest path algorithms to matrix scalingsNumerische Mathematik, Vol. 44, No. 1 Cross Ref Shortest Path Algorithms for the Approximation by Nomographic Functions Cross Ref References Cross Ref A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper boundsMathematical Programming, Vol. 27, No. 3 Cross Ref Computational methods of linear algebraJournal of Soviet Mathematics, Vol. 15, No. 5 Cross Ref Characterizations of optimal scalings of matricesMathematical Programming, Vol. 19, No. 1 Cross Ref An algorithm for scaling matrices and computing the minimum cycle mean in a digraphNumerische Mathematik, Vol. 35, No. 1 Cross Ref Approximation of Functions of Two Variables by the Sum of Two Functions of One Variable Cross Ref Best approximation in tensor product spaces14 October 2006 Cross Ref Cones, graphs and optimal scalings of matrices30 May 2007 | Linear and Multilinear Algebra, Vol. 8, No. 2 Cross Ref Delbert Ray Fulkerson27 February 2009 Cross Ref The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational resultsMathematical Programming, Vol. 13, No. 1 Cross Ref A survey of sparse matrix researchProceedings of the IEEE, Vol. 65, No. 4 Cross Ref Solution of linear systems of equations: Direct methods (general)3 December 2007 Cross Ref Research, Development, and LINPACK Cross Ref In memory of D. R. FulkersonJournal of Optimization Theory and Applications, Vol. 20, No. 4 Cross Ref On scaling linear programming problems23 February 2009 Cross Ref Some Experiments on Sparse Sets of Linear EquationsLjubomir B. Tosovic12 July 2006 | SIAM Journal on Applied Mathematics, Vol. 25, No. 2AbstractPDF (673 KB)References Cross Ref Computations with Sparse MatricesR. P. Tewarson18 July 2006 | SIAM Review, Vol. 12, No. 4AbstractPDF (1825 KB)Some results on sparse matrices1 January 1970 | Mathematics of Computation, Vol. 24, No. 112 Cross Ref Algorithm 348: matrix scaling by integer programming [F1]Communications of the ACM, Vol. 12, No. 4 Cross Ref Applications of Linear Programming to Numerical AnalysisPhilip Rabinowitz18 July 2006 | SIAM Review, Vol. 10, No. 2AbstractPDF (3637 KB)On the Product Form of Inverses of Sparse MatricesR. P. Tewarson18 July 2006 | SIAM Review, Vol. 8, No. 3AbstractPDF (748 KB)Calculating the Singular Values and Pseudo-Inverse of a MatrixG. Golub and W. Kahan14 July 2006 | Journal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis, Vol. 2, No. 2AbstractPDF (1596 KB) Volume 4, Issue 2| 1962SIAM Review History Submitted:02 October 1961Published online:18 July 2006 InformationCopyright © 1962 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1004032Article page range:pp. 142-146ISSN (print):0036-1445ISSN (online):1095-7200Publisher:Society for Industrial and Applied Mathematics