Partitioning Sparse Rectangular Matrices for Parallel Processing

doi 10.2172/658436
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Office of Scientific and Technical Information (OSTI)

Related search

Partitioning Sparse Matrices for Parallel Preconditioned Iterative Methods

SIAM Journal of Scientific Computing
Computational MathematicsApplied Mathematics
2007English

Parallel Skeletons for Sparse Matrices in SkeTo Skeleton Library

IPSJ Digital Courier
2008English

High-Performance Graph Algorithms From Parallel Sparse Matrices

English

Parallel Imaging Reconstruction for Arbitrary Trajectories Usingk-Space Sparse Matrices (kSPA)

Magnetic Resonance in Medicine
Nuclear MedicineRadiologyImaging
2007English

Reducing Elimination Tree Height for Parallel LU Factorization of Sparse Unsymmetric Matrices

2014English

Ordering Methods for Sparse Matrices.

1982English

Parallel Memetic Algorithm for VLSI Circuit Partitioning Problem Using Graphical Processing Units

Journal of Computer Science
Computer NetworksSoftwareArtificial IntelligenceCommunications
2012English

Parallel Processing of Big Point Clouds Using Z-Order-Based Partitioning

ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
2016English

Sparse Precision Matrices for Minimum Variance Portfolios

Computational Management Science
Information SystemsManagement Information Systems
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy