> On Jun 11, 2019, at 10:29 AM, Zhang, Hong via petsc-users
> wrote:
>
>
> Ian,
> I would suggest start using AIJ format.
>
> I am Ian. I trying to implement a solver which involves a sparse symmetric
> matrix A multiplied by a dense matrix X. And because of the nature of the
> problem,
Do you mean A * X where A is sparse and X is dense where the result is dense
or X * A where the result is dense?
We have code for A * X that is reasonably efficient. The second case I don't
know how to do efficient.
> On Jun 11, 2019, at 9:03 AM, Chih-Chuen Lin via petsc-users
>
Ian,
I would suggest start using AIJ format.
I am Ian. I trying to implement a solver which involves a sparse symmetric
matrix A multiplied by a dense matrix X. And because of the nature of the
problem, the bandwidth of the matrix A would be kind of large.For A*X, I am
thinking using reverse
Chih-Chuen Lin via petsc-users writes:
> Dear PETSc users,
>
> I am Ian. I trying to implement a solver which involves a sparse symmetric
> matrix A multiplied by a dense matrix X. And because of the nature of the
> problem, the bandwidth of the matrix A would be kind of large.For A*X, I am
>
Dear PETSc users,
I am Ian. I trying to implement a solver which involves a sparse symmetric
matrix A multiplied by a dense matrix X. And because of the nature of the
problem, the bandwidth of the matrix A would be kind of large.For A*X, I am
thinking using reverse Cuthill-Mckee algorithm to
