OpenAlex
PricingAboutJobs
Log inGet started
Work

Highly scalable parallel algorithms for sparse matrix factorization

HTML

Year: 1997
Type: article
Source: IEEE Transactions on Parallel and Distributed Systems
DOI: 10.1109/71.598277
Authors: A. Gupta, G. Karypis, V. Kumar
Institutions: IBM Research - Thomas J. Watson Research Center, University of Minnesota
Language: English

Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: sparse matrix factorization, parallel algorithms, Cholesky decomposition, symmetric positive definite matrices, sparse linear systems, scalability, communication overhead, linear least squares, diagonally dominant matrices, structural engineering, linear programming

Open Access status: closed
OpenAlex ID: W2127144731
FWCI: 15.89
Cites: 66
Cited by: 255
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms