Results 261 to 270 of about 53,148 (301)
Some of the next articles are maybe not open access.
Manipulation and Visualization of Sparse Matrices
ORSA Journal on Computing, 1990An open architecture software environment for handling sparse matrices and interchanging sparse matrix data is proposed. The proposed educational and research environment includes tools for the visualization of sparse matrices. A prototype implementation of these ideas called the Sparse Matrix Manipulation System is described.
Fernando L Alvarado
exaly +3 more sources
Parallel Inversion of Sparse Matrices.
IEEE Transactions on Power Systems, 1986This paper presents a parallel algorithm for obtaining the inverse of a large, nonsingular symmetric matrix A of dimension nxn. The inversion method proposed is based on the triangular factors of A. The task of obtaining the "sparse inverse' of A is represented by a directed acyclic graph.
Fernando L Alvarado
exaly +2 more sources
The structure of sparse resultant matrices
Proceedings of the 1997 international symposium on Symbolic and algebraic computation - ISSAC '97, 1997 Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a problem in linear algebra.
Ioannis Z. Emiris, Victor Y. Pan
openaire +2 more sources
Deterministic construction of sparse binary matrices via incremental integer optimization
Information Sciences, 2018 A central problem in compressed sensing (CS) is the design of measurement matrices. Compared with the conventional random matrices, sparse binary matrices have some attractive properties, such as lower storage/encoding cost and easy hardware ...
Zhu Liang Yu, Ling Cen, Zhenghui Gu
exaly +2 more sources
On Sparse Parity Check Matrices
Designs, Codes and Cryptography, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hanno Lefmann +2 more
openaire +1 more source
Journal of Soviet Mathematics, 1986
Translation from Itogi Nauki Tekh., Ser. Mat. Anal. 20, 179-260 (Russian) (1982; Zbl 0565.65017).
openaire +3 more sources
Translation from Itogi Nauki Tekh., Ser. Mat. Anal. 20, 179-260 (Russian) (1982; Zbl 0565.65017).
openaire +3 more sources
A Note on Fill for Sparse Matrices
SIAM Journal on Numerical Analysis, 1975Suppose the sparse matrix A has a triangular factorization $LU$, where L is lower triangular and U is upper triangular. With the usual assumption that exact numerical cancellation does not occur during the factorization, $L + U$ is generally fuller than A. It is well known that this fill is confined to the envelope of A; that is, to positions which are
George, Alan, Liu, Wai-Hung
openaire +2 more sources
Learning the Domain of Sparse Matrices
2016 15th IEEE International Conference on Machine Learning and Applications (ICMLA), 2016Large sparse linear system of equations arise in many areas of science and engineering. Although, there are several black-box general sparse solvers, usually they are not as effective as domain specific solvers. In addition, most solvers contain multiple choices during the solution process which can be tailored to a specific domain.
Suleyman Salin +2 more
openaire +1 more source