Gaussian elimination for the solution of linear systems of equations
algorithmsbipartite matching algorithmserror analysisGaussian eliminationlinear equationsLU factorizationnumerical examplesparallel computationresearch surveyscalingsoftware systems BLAS and LAPACKsparse matrices
Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)
This is a review of the main stream of research on Gaussian elimination done during the last thirty years. In five chapters, the author has done an excellent job of covering the research and development of related important algorithms. The review starts with a chapter on numerical solution of general linear systems. In this chapter Gaussian elimination for symmetric and non symmetric systems, block methods and related topics are described. This is followed by a chapter on error analysis. The third chapter is on vector and parallel algorithms for general systems. In this chapter, the well known software systems BLAS and LAPACK, as well as, triangular system solvers and LU factorization on distributed memory computers are discussed. The last two chapters are concerned with sparse matrices containing excellent descriptions of a wide variety of theoretical contributions and related computational algorithms for sparse symmetric and non symmetric systems available for serial and parallel computers. NEWLINENEWLINENEWLINEThe authors show how bipartite matching algorithms can be used to permute the rows and columns of a matrix so that the diagonal of the permuted matrix is large. The proposed algorithm computes a matching that corresponds to a permutation of a sparse matrix such that the product (or sum) of the diagonal entries is maximized. They also consider a modified version of this algorithm to compute a permutation that maximizes the smallest diagonal entry. They also investigate the influence of scaling the matrix. Results of some computational experiments are also given.NEWLINENEWLINEFor the entire collection see [Zbl 0953.00016].
- Parallel sparse Gaussian elimination with partial pivoting
- Distributed Sparse Gaussian Elimination and Orthogonal Factorization
- A parallel gaussian elimination method for general linear systems
- scientific article; zbMATH DE number 1256355
- On algorithms for permuting large entries to the diagonal of a sparse matrix
- Gaussian elimination is optimal for solving linear equations in dimension two
- On algorithms for permuting large entries to the diagonal of a sparse matrix
- scientific article; zbMATH DE number 5972272 (Why is no real title available?)
- Numerical Linear Algebra for Model Reduction in Control and Simulation
- scientific article; zbMATH DE number 3970037 (Why is no real title available?)
- scientific article; zbMATH DE number 32256 (Why is no real title available?)
- Fast algorithms for placing large entries along the diagonal of a sparse matrix
- On the solution of the polynomial systems arising in the discretization of certain ODEs
This page was built for publication: Gaussian elimination for the solution of linear systems of equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2702611)
