The Solution of Large Sparse Unsymmetric Systems of Linear Equations
From MaRDI portal
Publication:5637814
DOI10.1093/imamat/8.3.344zbMath0229.65032MaRDI QIDQ5637814
Publication date: 1971
Published in: IMA Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imamat/8.3.344
65F50: Computational methods for sparse matrices
Related Items
Computing with sparse matrices, Application of the Cramer rule in the solution of sparse systems of linear algebraic equations, A survey of the advances in the exploitation of the sparsity in the solution of large problems, Sparse linear problems and the least squares method, Computational methods of linear algebra, Modified ROW methods for stiff problems, Pivot selection and row ordering in Givens reduction on sparse matrices, Factorizing symmetric indefinite matrices, Conjugate gradient method for computing the Moore-Penrose inverse and rank of a matrix, An exact solution to a class of queueing systems with multipurpose counters, Maintaining LU factors of a general sparse matrix, A wavenumber based extrapolation and interpolation method for use in conjunction with high-order finite difference schemes, A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\), Tecniche di riordinamento delle equazioni per la risoluzione dei sistemi lineari sparsi, Unnamed Item, Band algorithm for unsymmetric matrices in finite element and semi-discrete methods, 𝑆𝑂𝑅-methods for the eigenvalue problem with large sparse matrices, An alternate implementation of Goldfarb's minimization algorithm, A kinetic study of enzyme systems, Matrix factorizations in optimization of nonlinear functions subject to linear constraints
