On the Automatic Scaling of Matrices for Gaussian Elimination

DOI10.1093/imamat/10.1.118zbMath0249.65026OpenAlexW2111577575MaRDI QIDQ5663311

John K. Reid, A. R. Curtis

Publication date: 1972

Published in: IMA Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imamat/10.1.118

Mathematics Subject Classification ID

Numerical computation of matrix norms, conditioning, scaling (65F35) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (32)

Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems ⋮ Improving the preconditioning of linear systems from interior point methods ⋮ Scaling and structural condition numbers ⋮ A new pivoting strategy for Gaussian elimination ⋮ Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization ⋮ A polynomial arc-search interior-point algorithm for linear programming ⋮ Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems ⋮ Computational methods of linear algebra ⋮ Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives ⋮ Scaling linear optimization problems prior to application of the simplex method ⋮ Scaling nonlinear programs ⋮ Performance and robustness of block constraint preconditioners in finite element coupled consolidation problems ⋮ A scaling algorithm for polynomial constraint satisfaction problems ⋮ On scaling linear programs—some experimental results ⋮ A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds ⋮ New crash procedures for large systems of linear constraints ⋮ The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results ⋮ Characterizations of optimal scalings of matrices ⋮ On two methods for elimination of non-unique solutions of an integral equation with logarithmic kernel/^† ⋮ Computation of system zeros with balancing ⋮ On accurate and time efficient solution of primal-mixed finite element equations in multiscale solid mechanics ⋮ A triangulation and fill-reducing initialization procedure for the simplex algorithm ⋮ A computational comparison of scaling techniques for linear optimization problems on a graphical processing unit ⋮ An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling ⋮ Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension ⋮ The role of preconditioning in the solution to FE coupled consolidation equations by Krylov subspace methods ⋮ Preconditioners in computational geomechanics: A survey ⋮ PCx: an interior-point code for linear programming ⋮ Advances in design and implementation of optimization software ⋮ Diagonal Scaling of Ill-Conditioned Matrixes by Genetic Algorithm ⋮ A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases ⋮ Computing optimal scalings by parametric network algorithms

This page was built for publication: On the Automatic Scaling of Matrices for Gaussian Elimination