On the Automatic Scaling of Matrices for Gaussian Elimination

From MaRDI portal
Revision as of 04:23, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5663311

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




Related Items (32)

Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problemsImproving the preconditioning of linear systems from interior point methodsScaling and structural condition numbersA new pivoting strategy for Gaussian eliminationNumerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimizationA polynomial arc-search interior-point algorithm for linear programmingLocal Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing ProblemsComputational methods of linear algebraPreconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectivesScaling linear optimization problems prior to application of the simplex methodScaling nonlinear programsPerformance and robustness of block constraint preconditioners in finite element coupled consolidation problemsA scaling algorithm for polynomial constraint satisfaction problemsOn scaling linear programs—some experimental resultsA conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper boundsNew crash procedures for large systems of linear constraintsThe efficient solution of large-scale linear programming problems—some algorithmic techniques and computational resultsCharacterizations of optimal scalings of matricesOn two methods for elimination of non-unique solutions of an integral equation with logarithmic kernel/Computation of system zeros with balancingOn accurate and time efficient solution of primal-mixed finite element equations in multiscale solid mechanicsA triangulation and fill-reducing initialization procedure for the simplex algorithmA computational comparison of scaling techniques for linear optimization problems on a graphical processing unitAn Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized SamplingImplementation of warm-start strategies in interior-point methods for linear programming in fixed dimensionThe role of preconditioning in the solution to FE coupled consolidation equations by Krylov subspace methodsPreconditioners in computational geomechanics: A surveyPCx: an interior-point code for linear programmingAdvances in design and implementation of optimization softwareDiagonal Scaling of Ill-Conditioned Matrixes by Genetic AlgorithmA sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming basesComputing optimal scalings by parametric network algorithms







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