Results 111 to 120 of about 24,609 (137)
Some of the next articles are maybe not open access.
Ordering Methods for Sparse Matrices and Vector Computers.
1986Abstract : This report summarizes the activities at Boeing Computer Service Company from April 15, 1985 until August 15, 1986. Five tasks are defined in our analysis of quotient tree algorithms and frontal methods: analysis of multifrontal methods, creation of symmetric indefinite out - of-core minimal storage elimination schemes, analyses of quotient ...
openaire +1 more source
Ordering Methods for Sparse Matrices and Vector Computers
1988Abstract : Direct factorization methods for solving large sparse linear equations are used as fundamental building blocks for the numerical solution of many scientific and computational problems. It is well known that reordering the variables and equations is crucial in reducing the cost of performing direct solution techniques.
openaire +1 more source
An Integrated Method to Deal with Partial Stragglers and Sparse Matrices in Distributed Computations
2022 IEEE International Symposium on Information Theory (ISIT), 2022Anindya Bijoy Das, Aditya Ramamoorthy
openaire +1 more source
ITERATIVE METHODS FOR COMPUTING A FEW EIGENPAIRS OR SINGULAR TRIPLETS OF LARGE SPARSE MATRICES
2022openaire +1 more source
Computing Interior Eigenvalues of Large Sparse Symmetric Matrices
International Journal of Applied and Computational Mathematics, 2021Achiya Dax, Dax Achiya
exaly
A Deep Latent Factor Model for High-Dimensional and Sparse Matrices in Recommender Systems
IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2021Di Wu, Xin Luo, Yi He
exaly
A combined unifrontal/multifrontal method for unsymmetric sparse matrices
ACM Transactions on Mathematical Software, 1999Davistimothy A +2 more
exaly
Computational complexity of operations involving perfect elimination sparse matrices
International Journal of Computer Mathematics, 1977Fernando L Alvarado
exaly