On Some Pivotal Strategies in Gaussian Elimination by Sparse Technique

DOI10.1137/0717003zbMath0427.65016OpenAlexW2020017929MaRDI QIDQ3862947

Zahari Zlatev

Publication date: 1980

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0717003

zbMATH Keywords

Gaussian eliminationefficient implementationpivotal strategiespivotal interchangeslarge and sparse systems of linear algebraic equationsMarkowitz strategy

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (11)

A survey of the advances in the exploitation of the sparsity in the solution of large problems ⋮ MATRIX OPERATIONS USING ARRAYS WITH RECONFIGURABLE OPTICAL BUSES∗ ⋮ Applying approximate LU-factorizations as preconditioners in eight iterative methods for solving systems of linear algebraic equations ⋮ Techniques for parallel manipulation of sparse matrices ⋮ Efficient implementation of stable Richardson extrapolation algorithms ⋮ Implementation of sparse matrix algorithms in an advection-diffusion-chemistry module ⋮ A survey of direct methods for sparse linear systems ⋮ Efficient computation of the compositional model for gas condensate reservoirs ⋮ Maintaining LU factors of a general sparse matrix ⋮ General scheme for solving linear algebraic problems by direct methods ⋮ Exploiting the sparsity in the solution of linear ordinary differential equations

This page was built for publication: On Some Pivotal Strategies in Gaussian Elimination by Sparse Technique