scientific article; zbMATH DE number 4117735
From MaRDI portal
Publication:4732027
[For the entire collection see Zbl 0676.00007.] Current techniques for the general-purpose treatment of sparse matrices are reviewed. Both direct and iterative methods for solving large sparse sets of linear algebraic equations are considered. Choosing suitable storage schemes, organizing the computation, finding permutations yielding a desirable form, numerical stability and checking the validity of the result are included. Eigenvalue problems (Lanczos algorithm) and least-squares calculations are mentioned.
Cited in
(74)- Algorithms for calculating quark propagators on large lattices
- Sparse matrix calculations on the CRAY-2
- A sparse matrix algorithm on the Boolean vector machine
- A survey of the advances in the exploitation of the sparsity in the solution of large problems
- Techniques for parallel manipulation of sparse matrices
- Selection of fictitious independent variables for the solution of sparse linear equations
- A hierarchical algorithm for making sparse matrices sparser
- Sparsification of rectangular matrices
- Matrix enlarging methods and their application
- Solving sparse linear least-squares problems on some supercomputers by using large dense blocks
- Effect of the storage format of sparse linear systems on parallel CFD computations
- A new sparse-matrix storage method for adaptively solving large systems of reaction-diffusion-transport equations
- Vector-sparse solver for unsymmetrical matrices
- A geometric framework for sparse matrix problems
- Sparse matrix multiplication package (SMMP)
- SPARSEM: A subroutine package to operate with large sparse matrices
- Cache oblivious sparse matrix multiplication
- Automating algorithm selection: checking for matrix properties that can simplify computations
- Sparse matrix approximations for multigrid methods
- Performance evaluation of domain decomposition method with sparse matrix storage schemes in modern supercomputer
- scientific article; zbMATH DE number 5929618 (Why is no real title available?)
- scientific article; zbMATH DE number 4131526 (Why is no real title available?)
- Efficient large scaled profile matrix computation programs
- scientific article; zbMATH DE number 3888795 (Why is no real title available?)
- scientific article; zbMATH DE number 3852305 (Why is no real title available?)
- scientific article; zbMATH DE number 3874478 (Why is no real title available?)
- scientific article; zbMATH DE number 3874487 (Why is no real title available?)
- scientific article; zbMATH DE number 3876467 (Why is no real title available?)
- scientific article; zbMATH DE number 3879988 (Why is no real title available?)
- SPARSE MATRIX MULTIPLICATION ON VECTOR COMPUTERS
- Sparse Matrix-Matrix Products Executed Through Coloring
- Use of the ${\text{P}}^4 $ and ${\text{P}}^5 $ Algorithms for In-Core Factorization of Sparse Matrices
- Sparse matrix storage formats and acceleration of iterative solution of linear algebraic systems with dense matrices
- Assembling sparse matrices in MATLAB
- Monte Carlo matrix computations based on compression
- scientific article; zbMATH DE number 3896181 (Why is no real title available?)
- scientific article; zbMATH DE number 3898113 (Why is no real title available?)
- scientific article; zbMATH DE number 3901904 (Why is no real title available?)
- The Software Scene in the Extraction of Eigenvalues from Sparse Matrices
- scientific article; zbMATH DE number 3923468 (Why is no real title available?)
- Reordering a sparse matrix to a sparse blocked form
- scientific article; zbMATH DE number 3940609 (Why is no real title available?)
- scientific article; zbMATH DE number 3949601 (Why is no real title available?)
- scientific article; zbMATH DE number 3958557 (Why is no real title available?)
- scientific article; zbMATH DE number 3963090 (Why is no real title available?)
- Sparse matrix factorizations of transfer matrices
- Sparse matrix test problems
- scientific article; zbMATH DE number 4100479 (Why is no real title available?)
- scientific article; zbMATH DE number 4104478 (Why is no real title available?)
- Level 3 basic linear algebra subprograms for sparse matrices
- scientific article; zbMATH DE number 17137 (Why is no real title available?)
- Sparse Matrices in MATLAB: Design and Implementation
- scientific article; zbMATH DE number 51442 (Why is no real title available?)
- Manipulation and Visualization of Sparse Matrices
- On Finding Supernodes for Sparse Matrix Computations
- scientific article; zbMATH DE number 193992 (Why is no real title available?)
- scientific article; zbMATH DE number 4123146 (Why is no real title available?)
- scientific article; zbMATH DE number 4124955 (Why is no real title available?)
- Simulated annealing for profile and fill reduction of sparse matrices
- scientific article; zbMATH DE number 671765 (Why is no real title available?)
- scientific article; zbMATH DE number 1083122 (Why is no real title available?)
- Computing the block triangular form of a sparse matrix
- SPAR: a new architecture for large finite element computations
- A relational approach to the compilation of sparse matrix programs
- On optimizing multiplications of sparse matrices
- Sparse Matrix Computations Arising in Distributed Parameter Identification
- Efficient Methods for Out-of-Core Sparse Cholesky Factorization
- scientific article; zbMATH DE number 3992804 (Why is no real title available?)
- scientific article; zbMATH DE number 3997028 (Why is no real title available?)
- Sparse matrix representations in a functional language
- The Zlatev method for sparse real matrices
- Storage formats for sparse matrices in Java
- Using dense matrix computations in the solution of sparse problems
- A method for the automatic selection and tuning of the parameters of a sparse SLE solver
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4732027)