A new pivoting strategy for Gaussian elimination
From MaRDI portal
Publication:1915612
DOI10.1016/0024-3795(94)00192-8zbMath0852.65021OpenAlexW2041785146MaRDI QIDQ1915612
Markus Olschowska, Arnold Neumaier
Publication date: 5 December 1996
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(94)00192-8
Numerical computation of matrix norms, conditioning, scaling (65F35) Direct numerical methods for linear systems and matrix inversion (65F05) Conditioning of matrices (15A12)
Related Items
A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners, Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization, Linear-Time Approximation for Maximum Weight Matching, Scaling and structural condition numbers, Finite volume method for coupled subsurface flow problems. II: Poroelasticity, Adaptive AMG with coarsening based on compatible weighted matching, Incomplete LU Preconditioner Based on Max-Plus Approximation of LU Factorization, Hadamard Matrices: Insights into Their Growth Factor and Determinant Computations, On the complete pivoting conjecture for Hadamard matrices: further progress and a good pivots property, A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs, A high performance level-block approximate LU factorization preconditioner algorithm, State-of-the-Art Sparse Direct Solvers, A scaling algorithm for polynomial constraint satisfaction problems, A survey of direct methods for sparse linear systems, Preconditioning Helmholtz linear systems, Collocated finite-volume method for the incompressible Navier-Stokes problem, Combinatorial Aspects in Sparse Elimination Methods, \(\text{PSPIKE}+\): A family of parallel hybrid sparse linear system solvers, A two-level iterative scheme for general sparse linear systems based on approximate skew-symmetrizers, Approximation algorithms in combinatorial scientific computing, Parallel algorithms for solving linear systems with sparse triangular matrices, Max-Balanced Hungarian Scalings, Cell-centered finite-volume method for heterogeneous anisotropic poromechanics problem, Matrix Reordering Using Multilevel Graph Coarsening for ILU Preconditioning, Preconditioning techniques for large linear systems: A survey
Uses Software
Cites Work
- An efficient labeling technique for solving sparse assignment problems
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Methods for scaling to doubly stochastic form
- Error Analysis of Direct Methods of Matrix Inversion
- Maximum matching and a polyhedron with 0,1-vertices
- On the Automatic Scaling of Matrices for Gaussian Elimination
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
