Amanote Research

Amanote Research

    RegisterSign In

Partitioning Sparse Matrices for Parallel Preconditioned Iterative Methods

SIAM Journal of Scientific Computing - United States
doi 10.1137/040617431
Full Text
Open PDF
Abstract

Available in full text

Categories
Computational MathematicsApplied Mathematics
Date

January 1, 2007

Authors
Bora UçarCevdet Aykanat
Publisher

Society for Industrial & Applied Mathematics (SIAM)


Related search

Partitioning Sparse Rectangular Matrices for Parallel Processing

1998English

Ordering Methods for Sparse Matrices.

1982English

Preconditioned Iterative Methods for Weighted Toeplitz Least Squares Problems

SIAM Journal on Matrix Analysis and Applications
Analysis
2006English

On the Preconditioned Projective Iterative Methods for the Linear Complementarity Problem

RAIRO - Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchTheoretical Computer Science
2020English

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

Convergence Analysis of Some Factorization Iterative Methods for M-Matrices

1973English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy