PETSC_EXTERN PetscErrorCode MatConvert_SeqAIJ_SeqBAIJ(Mat A,MatType newtype,MatReuse reuse,Mat *newmat)
{
Mat B;
Mat_SeqAIJ *a = (Mat_SeqAIJ*)A->data;
Mat_SeqBAIJ *b;
PetscErrorCode ierr;
PetscInt *ai=a->i,m=A->rmap->N,n=A->cmap->N,i,*rowlengths;
PetscFunctionBegin;
if (n != m) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_WRONG,"Matrix must be square");
if (A->rmap->bs > 1) {
ierr = MatConvert_Basic(A,newtype,reuse,newmat);
CHKERRQ(ierr);
PetscFunctionReturn(0);
}
ierr = PetscMalloc1(m,&rowlengths);
CHKERRQ(ierr);
for (i=0; i<m; i++) {
rowlengths[i] = ai[i+1] - ai[i];
}
ierr = MatCreate(PetscObjectComm((PetscObject)A),&B);
CHKERRQ(ierr);
ierr = MatSetSizes(B,m,n,m,n);
CHKERRQ(ierr);
ierr = MatSetType(B,MATSEQBAIJ);
CHKERRQ(ierr);
ierr = MatSeqBAIJSetPreallocation_SeqBAIJ(B,1,0,rowlengths);
CHKERRQ(ierr);
ierr = PetscFree(rowlengths);
CHKERRQ(ierr);
ierr = MatSetOption(B,MAT_ROW_ORIENTED,PETSC_TRUE);
CHKERRQ(ierr);
b = (Mat_SeqBAIJ*)(B->data);
ierr = PetscMemcpy(b->i,a->i,(m+1)*sizeof(PetscInt));
CHKERRQ(ierr);
ierr = PetscMemcpy(b->ilen,a->ilen,m*sizeof(PetscInt));
CHKERRQ(ierr);
ierr = PetscMemcpy(b->j,a->j,a->nz*sizeof(PetscInt));
CHKERRQ(ierr);
ierr = PetscMemcpy(b->a,a->a,a->nz*sizeof(MatScalar));
CHKERRQ(ierr);
ierr = MatAssemblyBegin(B,MAT_FINAL_ASSEMBLY);
CHKERRQ(ierr);
ierr = MatAssemblyEnd(B,MAT_FINAL_ASSEMBLY);
CHKERRQ(ierr);
if (reuse == MAT_REUSE_MATRIX) {
ierr = MatHeaderReplace(A,B);
CHKERRQ(ierr);
} else {
*newmat = B;
}
PetscFunctionReturn(0);
}
EXTERN_C_END
EXTERN_C_BEGIN
#undef __FUNCT__
#define __FUNCT__ "MatConvert_SeqAIJ_SeqSBAIJ"
PetscErrorCode PETSCMAT_DLLEXPORT MatConvert_SeqAIJ_SeqSBAIJ(Mat A,const MatType newtype,MatReuse reuse,Mat *newmat) {
Mat B;
Mat_SeqAIJ *a = (Mat_SeqAIJ*)A->data;
Mat_SeqSBAIJ *b;
PetscErrorCode ierr;
PetscInt *ai=a->i,*aj,m=A->rmap->N,n=A->cmap->N,i,j,*bi,*bj,*rowlengths;
MatScalar *av,*bv;
PetscFunctionBegin;
if (n != m) SETERRQ(PETSC_ERR_ARG_WRONG,"Matrix must be square");
ierr = PetscMalloc(m*sizeof(PetscInt),&rowlengths);CHKERRQ(ierr);
for (i=0; i<m; i++) {
rowlengths[i] = ai[i+1] - a->diag[i];
}
ierr = MatCreate(((PetscObject)A)->comm,&B);CHKERRQ(ierr);
ierr = MatSetSizes(B,m,n,m,n);CHKERRQ(ierr);
ierr = MatSetType(B,newtype);CHKERRQ(ierr);
ierr = MatSeqSBAIJSetPreallocation_SeqSBAIJ(B,1,0,rowlengths);CHKERRQ(ierr);
ierr = MatSetOption(B,MAT_ROW_ORIENTED,PETSC_TRUE);CHKERRQ(ierr);
b = (Mat_SeqSBAIJ*)(B->data);
bi = b->i;
bj = b->j;
bv = b->a;
bi[0] = 0;
for (i=0; i<m; i++) {
aj = a->j + a->diag[i];
av = a->a + a->diag[i];
for (j=0; j<rowlengths[i]; j++){
*bj = *aj; bj++; aj++;
*bv = *av; bv++; av++;
}
bi[i+1] = bi[i] + rowlengths[i];
b->ilen[i] = rowlengths[i];
}
ierr = PetscFree(rowlengths);CHKERRQ(ierr);
ierr = MatAssemblyBegin(B,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr);
ierr = MatAssemblyEnd(B,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr);
if (A->hermitian){
ierr = MatSetOption(B,MAT_HERMITIAN,PETSC_TRUE);CHKERRQ(ierr);
}
if (reuse == MAT_REUSE_MATRIX) {
ierr = MatHeaderReplace(A,B);CHKERRQ(ierr);
} else {
*newmat = B;
}
PetscFunctionReturn(0);
}
PetscErrorCode PETSCMAT_DLLEXPORT MatConvertFrom_MPIAdj(Mat A,const MatType type,MatReuse reuse,Mat *newmat)
{
Mat B;
PetscErrorCode ierr;
PetscInt i,m,N,nzeros = 0,*ia,*ja,len,rstart,cnt,j,*a;
const PetscInt *rj;
const PetscScalar *ra;
MPI_Comm comm;
PetscFunctionBegin;
ierr = MatGetSize(A,PETSC_NULL,&N);CHKERRQ(ierr);
ierr = MatGetLocalSize(A,&m,PETSC_NULL);CHKERRQ(ierr);
ierr = MatGetOwnershipRange(A,&rstart,PETSC_NULL);CHKERRQ(ierr);
/* count the number of nonzeros per row */
for (i=0; i<m; i++) {
ierr = MatGetRow(A,i+rstart,&len,&rj,PETSC_NULL);CHKERRQ(ierr);
for (j=0; j<len; j++) {
if (rj[j] == i+rstart) {len--; break;} /* don't count diagonal */
}
ierr = MatRestoreRow(A,i+rstart,&len,&rj,PETSC_NULL);CHKERRQ(ierr);
nzeros += len;
}
/* malloc space for nonzeros */
ierr = PetscMalloc((nzeros+1)*sizeof(PetscInt),&a);CHKERRQ(ierr);
ierr = PetscMalloc((N+1)*sizeof(PetscInt),&ia);CHKERRQ(ierr);
ierr = PetscMalloc((nzeros+1)*sizeof(PetscInt),&ja);CHKERRQ(ierr);
nzeros = 0;
ia[0] = 0;
for (i=0; i<m; i++) {
ierr = MatGetRow(A,i+rstart,&len,&rj,&ra);CHKERRQ(ierr);
cnt = 0;
for (j=0; j<len; j++) {
if (rj[j] != i+rstart) { /* if not diagonal */
a[nzeros+cnt] = (PetscInt) PetscAbsScalar(ra[j]);
ja[nzeros+cnt++] = rj[j];
}
}
ierr = MatRestoreRow(A,i+rstart,&len,&rj,&ra);CHKERRQ(ierr);
nzeros += cnt;
ia[i+1] = nzeros;
}
ierr = PetscObjectGetComm((PetscObject)A,&comm);CHKERRQ(ierr);
ierr = MatCreate(comm,&B);CHKERRQ(ierr);
ierr = MatSetSizes(B,m,PETSC_DETERMINE,PETSC_DETERMINE,N);CHKERRQ(ierr);
ierr = MatSetType(B,type);CHKERRQ(ierr);
ierr = MatMPIAdjSetPreallocation(B,ia,ja,a);CHKERRQ(ierr);
if (reuse == MAT_REUSE_MATRIX) {
ierr = MatHeaderReplace(A,B);CHKERRQ(ierr);
} else {
*newmat = B;
}
PetscFunctionReturn(0);
}
/*
MatConvert_Basic - Converts from any input format to another format. For
parallel formats, the new matrix distribution is determined by PETSc.
Does not do preallocation so in general will be slow
*/
PETSC_INTERN PetscErrorCode MatConvert_Basic(Mat mat, MatType newtype,MatReuse reuse,Mat *newmat)
{
Mat M;
const PetscScalar *vwork;
PetscErrorCode ierr;
PetscInt nz,i,m,n,rstart,rend,lm,ln;
const PetscInt *cwork;
PetscBool isSBAIJ;
PetscFunctionBegin;
ierr = PetscObjectTypeCompare((PetscObject)mat,MATSEQSBAIJ,&isSBAIJ);CHKERRQ(ierr);
if (!isSBAIJ) {
ierr = PetscObjectTypeCompare((PetscObject)mat,MATMPISBAIJ,&isSBAIJ);CHKERRQ(ierr);
}
if (isSBAIJ) SETERRQ(PetscObjectComm((PetscObject)mat),PETSC_ERR_SUP,"Cannot convert from SBAIJ matrix since cannot obtain entire rows of matrix");
ierr = MatGetSize(mat,&m,&n);CHKERRQ(ierr);
ierr = MatGetLocalSize(mat,&lm,&ln);CHKERRQ(ierr);
if (ln == n) ln = PETSC_DECIDE; /* try to preserve column ownership */
ierr = MatCreate(PetscObjectComm((PetscObject)mat),&M);CHKERRQ(ierr);
ierr = MatSetSizes(M,lm,ln,m,n);CHKERRQ(ierr);
ierr = MatSetBlockSizesFromMats(M,mat,mat);CHKERRQ(ierr);
ierr = MatSetType(M,newtype);CHKERRQ(ierr);
ierr = MatSeqDenseSetPreallocation(M,NULL);CHKERRQ(ierr);
ierr = MatMPIDenseSetPreallocation(M,NULL);CHKERRQ(ierr);
ierr = MatSetUp(M);CHKERRQ(ierr);
ierr = MatSetOption(M,MAT_NEW_NONZERO_LOCATION_ERR,PETSC_FALSE);CHKERRQ(ierr);
ierr = MatSetOption(M,MAT_NEW_NONZERO_ALLOCATION_ERR,PETSC_FALSE);CHKERRQ(ierr);
ierr = PetscObjectTypeCompare((PetscObject)M,MATSEQSBAIJ,&isSBAIJ);CHKERRQ(ierr);
if (!isSBAIJ) {
ierr = PetscObjectTypeCompare((PetscObject)M,MATMPISBAIJ,&isSBAIJ);CHKERRQ(ierr);
}
if (isSBAIJ) {
ierr = MatSetOption(M,MAT_IGNORE_LOWER_TRIANGULAR,PETSC_TRUE);CHKERRQ(ierr);
}
ierr = MatGetOwnershipRange(mat,&rstart,&rend);CHKERRQ(ierr);
for (i=rstart; i<rend; i++) {
ierr = MatGetRow(mat,i,&nz,&cwork,&vwork);CHKERRQ(ierr);
ierr = MatSetValues(M,1,&i,nz,cwork,vwork,INSERT_VALUES);CHKERRQ(ierr);
ierr = MatRestoreRow(mat,i,&nz,&cwork,&vwork);CHKERRQ(ierr);
}
ierr = MatAssemblyBegin(M,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr);
ierr = MatAssemblyEnd(M,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr);
if (reuse == MAT_INPLACE_MATRIX) {
ierr = MatHeaderReplace(mat,&M);CHKERRQ(ierr);
} else {
*newmat = M;
}
PetscFunctionReturn(0);
}
EXTERN_C_BEGIN
#undef __FUNCT__
#define __FUNCT__ "MatConvert_SeqBAIJ_SeqAIJ"
PetscErrorCode MatConvert_SeqBAIJ_SeqAIJ(Mat A, MatType newtype,MatReuse reuse,Mat *newmat)
{
Mat B;
Mat_SeqBAIJ *a = (Mat_SeqBAIJ*)A->data;
PetscErrorCode ierr;
PetscInt bs = A->rmap->bs,*ai = a->i,*aj = a->j,n = A->rmap->N/bs,i,j,k;
PetscInt *rowlengths,*rows,*cols,maxlen = 0,ncols;
MatScalar *aa = a->a;
PetscFunctionBegin;
ierr = PetscMalloc(n*bs*sizeof(PetscInt),&rowlengths);CHKERRQ(ierr);
for (i=0; i<n; i++) {
maxlen = PetscMax(maxlen,(ai[i+1] - ai[i]));
for (j=0; j<bs; j++) {
rowlengths[i*bs+j] = bs*(ai[i+1] - ai[i]);
}
}
ierr = MatCreate(((PetscObject)A)->comm,&B);CHKERRQ(ierr);
ierr = MatSetSizes(B,A->rmap->n,A->cmap->n,A->rmap->N,A->cmap->N);CHKERRQ(ierr);
ierr = MatSetType(B,MATSEQAIJ);CHKERRQ(ierr);
ierr = MatSeqAIJSetPreallocation(B,0,rowlengths);CHKERRQ(ierr);
ierr = MatSetOption(B,MAT_ROW_ORIENTED,PETSC_FALSE);CHKERRQ(ierr);
ierr = PetscFree(rowlengths);CHKERRQ(ierr);
ierr = PetscMalloc(bs*sizeof(PetscInt),&rows);CHKERRQ(ierr);
ierr = PetscMalloc(bs*maxlen*sizeof(PetscInt),&cols);CHKERRQ(ierr);
for (i=0; i<n; i++) {
for (j=0; j<bs; j++) {
rows[j] = i*bs+j;
}
ncols = ai[i+1] - ai[i];
for (k=0; k<ncols; k++) {
for (j=0; j<bs; j++) {
cols[k*bs+j] = bs*(*aj) + j;
}
aj++;
}
ierr = MatSetValues(B,bs,rows,bs*ncols,cols,aa,INSERT_VALUES);CHKERRQ(ierr);
aa += ncols*bs*bs;
}
ierr = PetscFree(cols);CHKERRQ(ierr);
ierr = PetscFree(rows);CHKERRQ(ierr);
ierr = MatAssemblyBegin(B,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr);
ierr = MatAssemblyEnd(B,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr);
B->rmap->bs = A->rmap->bs;
if (reuse == MAT_REUSE_MATRIX) {
ierr = MatHeaderReplace(A,B);CHKERRQ(ierr);
} else {
*newmat = B;
}
PetscFunctionReturn(0);
}
EXTERN_C_BEGIN
#undef __FUNCT__
#define __FUNCT__ "MatConvert_MPIAIJ_MPISBAIJ"
PetscErrorCode MatConvert_MPIAIJ_MPISBAIJ(Mat A, MatType newtype,MatReuse reuse,Mat *newmat)
{
PetscErrorCode ierr;
Mat M;
Mat_MPIAIJ *mpimat = (Mat_MPIAIJ*)A->data;
Mat_SeqAIJ *Aa = (Mat_SeqAIJ*)mpimat->A->data,*Ba = (Mat_SeqAIJ*)mpimat->B->data;
PetscInt *d_nnz,*o_nnz;
PetscInt i,j,nz;
PetscInt m,n,lm,ln;
PetscInt rstart,rend;
const PetscScalar *vwork;
const PetscInt *cwork;
PetscFunctionBegin;
if (!A->symmetric) SETERRQ(((PetscObject)A)->comm,PETSC_ERR_USER,"Matrix must be symmetric. Call MatSetOption(mat,MAT_SYMMETRIC,PETSC_TRUE)");
ierr = MatGetSize(A,&m,&n);CHKERRQ(ierr);
ierr = MatGetLocalSize(A,&lm,&ln);CHKERRQ(ierr);
ierr = PetscMalloc2(lm,PetscInt,&d_nnz,lm,PetscInt,&o_nnz);CHKERRQ(ierr);
ierr = MatMarkDiagonal_SeqAIJ(mpimat->A);CHKERRQ(ierr);
for (i=0;i<lm;i++){
d_nnz[i] = Aa->i[i+1] - Aa->diag[i];
o_nnz[i] = Ba->i[i+1] - Ba->i[i];
}
ierr = MatCreate(((PetscObject)A)->comm,&M);CHKERRQ(ierr);
ierr = MatSetSizes(M,lm,ln,m,n);CHKERRQ(ierr);
ierr = MatSetType(M,MATMPISBAIJ);CHKERRQ(ierr);
ierr = MatSeqSBAIJSetPreallocation(M,1,0,d_nnz);CHKERRQ(ierr);
ierr = MatMPISBAIJSetPreallocation(M,1,0,d_nnz,0,o_nnz);CHKERRQ(ierr);
ierr = PetscFree2(d_nnz,o_nnz);CHKERRQ(ierr);
ierr = MatGetOwnershipRange(A,&rstart,&rend);CHKERRQ(ierr);
for (i=rstart;i<rend;i++){
ierr = MatGetRow(A,i,&nz,&cwork,&vwork);CHKERRQ(ierr);
j = 0;
while (cwork[j] < i){ j++; nz--;}
ierr = MatSetValues(M,1,&i,nz,cwork+j,vwork+j,INSERT_VALUES);CHKERRQ(ierr);
ierr = MatRestoreRow(A,i,&nz,&cwork,&vwork);CHKERRQ(ierr);
}
ierr = MatAssemblyBegin(M,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr);
ierr = MatAssemblyEnd(M,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr);
if (reuse == MAT_REUSE_MATRIX) {
ierr = MatHeaderReplace(A,M);CHKERRQ(ierr);
} else {
*newmat = M;
}
PetscFunctionReturn(0);
}
PETSC_INTERN PetscErrorCode MatConvert_Shell(Mat oldmat, MatType newtype,MatReuse reuse,Mat *newmat)
{
Mat mat;
Vec in,out;
PetscErrorCode ierr;
PetscInt i,M,m,*rows,start,end;
MPI_Comm comm;
PetscScalar *array,zero = 0.0,one = 1.0;
PetscFunctionBegin;
ierr = PetscObjectGetComm((PetscObject)oldmat,&comm);CHKERRQ(ierr);
ierr = MatGetOwnershipRange(oldmat,&start,&end);CHKERRQ(ierr);
ierr = VecCreateMPI(comm,end-start,PETSC_DECIDE,&in);CHKERRQ(ierr);
ierr = VecDuplicate(in,&out);CHKERRQ(ierr);
ierr = VecGetSize(in,&M);CHKERRQ(ierr);
ierr = VecGetLocalSize(in,&m);CHKERRQ(ierr);
ierr = PetscMalloc1(m+1,&rows);CHKERRQ(ierr);
for (i=0; i<m; i++) rows[i] = start + i;
ierr = MatCreate(comm,&mat);CHKERRQ(ierr);
ierr = MatSetSizes(mat,m,M,M,M);CHKERRQ(ierr);
ierr = MatSetType(mat,newtype);CHKERRQ(ierr);
ierr = MatSetBlockSizesFromMats(mat,oldmat,oldmat);CHKERRQ(ierr);
ierr = MatSetUp(mat);CHKERRQ(ierr);
for (i=0; i<M; i++) {
ierr = VecSet(in,zero);CHKERRQ(ierr);
ierr = VecSetValues(in,1,&i,&one,INSERT_VALUES);CHKERRQ(ierr);
ierr = VecAssemblyBegin(in);CHKERRQ(ierr);
ierr = VecAssemblyEnd(in);CHKERRQ(ierr);
ierr = MatMult(oldmat,in,out);CHKERRQ(ierr);
ierr = VecGetArray(out,&array);CHKERRQ(ierr);
ierr = MatSetValues(mat,m,rows,1,&i,array,INSERT_VALUES);CHKERRQ(ierr);
ierr = VecRestoreArray(out,&array);CHKERRQ(ierr);
}
ierr = PetscFree(rows);CHKERRQ(ierr);
ierr = VecDestroy(&in);CHKERRQ(ierr);
ierr = VecDestroy(&out);CHKERRQ(ierr);
ierr = MatAssemblyBegin(mat,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr);
ierr = MatAssemblyEnd(mat,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr);
if (reuse == MAT_INPLACE_MATRIX) {
ierr = MatHeaderReplace(oldmat,&mat);CHKERRQ(ierr);
} else {
*newmat = mat;
}
PetscFunctionReturn(0);
}
PETSC_EXTERN PetscErrorCode MatConvert_MPIBAIJ_MPISBAIJ(Mat A, MatType newtype,MatReuse reuse,Mat *newmat)
{
PetscErrorCode ierr;
Mat M;
Mat_MPIBAIJ *mpimat = (Mat_MPIBAIJ*)A->data;
Mat_SeqBAIJ *Aa = (Mat_SeqBAIJ*)mpimat->A->data,*Ba = (Mat_SeqBAIJ*)mpimat->B->data;
PetscInt *d_nnz,*o_nnz;
PetscInt i,j,nz;
PetscInt m,n,lm,ln;
PetscInt rstart,rend;
const PetscScalar *vwork;
const PetscInt *cwork;
PetscInt bs = A->rmap->bs;
PetscFunctionBegin;
ierr = MatGetSize(A,&m,&n);CHKERRQ(ierr);
ierr = MatGetLocalSize(A,&lm,&ln);CHKERRQ(ierr);
ierr = PetscMalloc2(lm/bs,&d_nnz,lm/bs,&o_nnz);CHKERRQ(ierr);
ierr = MatMarkDiagonal_SeqBAIJ(mpimat->A);CHKERRQ(ierr);
for (i=0; i<lm/bs; i++) {
d_nnz[i] = Aa->i[i+1] - Aa->diag[i];
o_nnz[i] = Ba->i[i+1] - Ba->i[i];
}
ierr = MatCreate(PetscObjectComm((PetscObject)A),&M);CHKERRQ(ierr);
ierr = MatSetSizes(M,lm,ln,m,n);CHKERRQ(ierr);
ierr = MatSetType(M,MATMPISBAIJ);CHKERRQ(ierr);
ierr = MatSeqSBAIJSetPreallocation(M,bs,0,d_nnz);CHKERRQ(ierr);
ierr = MatMPISBAIJSetPreallocation(M,bs,0,d_nnz,0,o_nnz);CHKERRQ(ierr);
ierr = PetscFree2(d_nnz,o_nnz);CHKERRQ(ierr);
ierr = MatGetOwnershipRange(A,&rstart,&rend);CHKERRQ(ierr);
ierr = MatSetOption(M,MAT_IGNORE_LOWER_TRIANGULAR,PETSC_TRUE);CHKERRQ(ierr);
for (i=rstart; i<rend; i++) {
ierr = MatGetRow(A,i,&nz,&cwork,&vwork);CHKERRQ(ierr);
j = 0;
ierr = MatSetValues(M,1,&i,nz,cwork+j,vwork+j,INSERT_VALUES);CHKERRQ(ierr);
ierr = MatRestoreRow(A,i,&nz,&cwork,&vwork);CHKERRQ(ierr);
}
ierr = MatAssemblyBegin(M,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr);
ierr = MatAssemblyEnd(M,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr);
if (reuse == MAT_REUSE_MATRIX) {
ierr = MatHeaderReplace(A,&M);CHKERRQ(ierr);
} else {
*newmat = M;
}
PetscFunctionReturn(0);
}
/*@C
MatCompositeMerge - Given a composite matrix, replaces it with a "regular" matrix
by summing all the matrices inside the composite matrix.
Collective on MPI_Comm
Input Parameters:
. mat - the composite matrix
Options Database:
. -mat_composite_merge (you must call MatAssemblyBegin()/MatAssemblyEnd() to have this checked)
Level: advanced
Notes:
The MatType of the resulting matrix will be the same as the MatType of the FIRST
matrix in the composite matrix.
.seealso: MatDestroy(), MatMult(), MatCompositeAddMat(), MatCreateComposite(), MATCOMPOSITE
@*/
PetscErrorCode MatCompositeMerge(Mat mat)
{
Mat_Composite *shell = (Mat_Composite*)mat->data;
Mat_CompositeLink next = shell->head, prev = shell->tail;
PetscErrorCode ierr;
Mat tmat,newmat;
Vec left,right;
PetscScalar scale;
PetscFunctionBegin;
if (!next) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_WRONGSTATE,"Must provide at least one matrix with MatCompositeAddMat()");
PetscFunctionBegin;
if (shell->type == MAT_COMPOSITE_ADDITIVE) {
ierr = MatDuplicate(next->mat,MAT_COPY_VALUES,&tmat);CHKERRQ(ierr);
while ((next = next->next)) {
ierr = MatAXPY(tmat,1.0,next->mat,DIFFERENT_NONZERO_PATTERN);CHKERRQ(ierr);
}
} else {
ierr = MatDuplicate(next->mat,MAT_COPY_VALUES,&tmat);CHKERRQ(ierr);
while ((prev = prev->prev)) {
ierr = MatMatMult(tmat,prev->mat,MAT_INITIAL_MATRIX,PETSC_DECIDE,&newmat);CHKERRQ(ierr);
ierr = MatDestroy(&tmat);CHKERRQ(ierr);
tmat = newmat;
}
}
scale = shell->scale;
if ((left = shell->left)) {ierr = PetscObjectReference((PetscObject)left);CHKERRQ(ierr);}
if ((right = shell->right)) {ierr = PetscObjectReference((PetscObject)right);CHKERRQ(ierr);}
ierr = MatHeaderReplace(mat,&tmat);CHKERRQ(ierr);
ierr = MatDiagonalScale(mat,left,right);CHKERRQ(ierr);
ierr = MatScale(mat,scale);CHKERRQ(ierr);
ierr = VecDestroy(&left);CHKERRQ(ierr);
ierr = VecDestroy(&right);CHKERRQ(ierr);
PetscFunctionReturn(0);
}
/*
MatConvert_Basic - Converts from any input format to another format. For
parallel formats, the new matrix distribution is determined by PETSc.
Does not do preallocation so in general will be slow
*/
PetscErrorCode MatConvert_Basic(Mat mat, const MatType newtype,MatReuse reuse,Mat *newmat)
{
Mat M;
const PetscScalar *vwork;
PetscErrorCode ierr;
PetscInt i,nz,m,n,rstart,rend,lm,ln;
const PetscInt *cwork;
PetscFunctionBegin;
ierr = MatGetSize(mat,&m,&n);CHKERRQ(ierr);
ierr = MatGetLocalSize(mat,&lm,&ln);CHKERRQ(ierr);
if (ln == n) ln = PETSC_DECIDE; /* try to preserve column ownership */
ierr = MatCreate(((PetscObject)mat)->comm,&M);CHKERRQ(ierr);
ierr = MatSetSizes(M,lm,ln,m,n);CHKERRQ(ierr);
ierr = MatSetType(M,newtype);CHKERRQ(ierr);
ierr = MatGetOwnershipRange(mat,&rstart,&rend);CHKERRQ(ierr);
for (i=rstart; i<rend; i++) {
ierr = MatGetRow(mat,i,&nz,&cwork,&vwork);CHKERRQ(ierr);
ierr = MatSetValues(M,1,&i,nz,cwork,vwork,INSERT_VALUES);CHKERRQ(ierr);
ierr = MatRestoreRow(mat,i,&nz,&cwork,&vwork);CHKERRQ(ierr);
}
ierr = MatAssemblyBegin(M,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr);
ierr = MatAssemblyEnd(M,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr);
if (mat->hermitian){
ierr = MatSetOption(M,MAT_HERMITIAN,PETSC_TRUE);CHKERRQ(ierr);
}
if (reuse == MAT_REUSE_MATRIX) {
ierr = MatHeaderReplace(mat,M);CHKERRQ(ierr);
} else {
*newmat = M;
}
PetscFunctionReturn(0);
}
EXTERN_C_END
EXTERN_C_BEGIN
#undef __FUNCT__
#define __FUNCT__ "MatConvert_SeqSBAI_SeqBAIJ"
PetscErrorCode PETSCMAT_DLLEXPORT MatConvert_SeqSBAIJ_SeqBAIJ(Mat A, MatType newtype,MatReuse reuse,Mat *newmat)
{
Mat B;
Mat_SeqSBAIJ *a = (Mat_SeqSBAIJ*)A->data;
Mat_SeqBAIJ *b;
PetscErrorCode ierr;
PetscInt *ai=a->i,*aj=a->j,m=A->rmap->N,n=A->cmap->n,i,k,*bi,*bj,*browlengths,nz,*browstart,itmp;
PetscInt bs=A->rmap->bs,bs2=bs*bs,mbs=m/bs;
MatScalar *av,*bv;
PetscFunctionBegin;
/* compute browlengths of newmat */
ierr = PetscMalloc2(mbs,PetscInt,&browlengths,mbs,PetscInt,&browstart);CHKERRQ(ierr);
for (i=0; i<mbs; i++) browlengths[i] = 0;
aj = a->j;
for (i=0; i<mbs; i++) {
nz = ai[i+1] - ai[i];
aj++; /* skip diagonal */
for (k=1; k<nz; k++) { /* no. of lower triangular blocks */
browlengths[*aj]++; aj++;
}
browlengths[i] += nz; /* no. of upper triangular blocks */
}
ierr = MatCreate(((PetscObject)A)->comm,&B);CHKERRQ(ierr);
ierr = MatSetSizes(B,m,n,m,n);CHKERRQ(ierr);
ierr = MatSetType(B,newtype);CHKERRQ(ierr);
ierr = MatSeqBAIJSetPreallocation(B,bs,0,browlengths);CHKERRQ(ierr);
ierr = MatSetOption(B,MAT_ROW_ORIENTED,PETSC_TRUE);CHKERRQ(ierr);
b = (Mat_SeqBAIJ*)(B->data);
bi = b->i;
bj = b->j;
bv = b->a;
/* set b->i */
bi[0] = 0;
for (i=0; i<mbs; i++){
b->ilen[i] = browlengths[i];
bi[i+1] = bi[i] + browlengths[i];
browstart[i] = bi[i];
}
if (bi[mbs] != 2*a->nz - mbs) SETERRQ2(PETSC_ERR_PLIB,"bi[mbs]: %D != 2*a->nz - mbs: %D\n",bi[mbs],2*a->nz - mbs);
/* set b->j and b->a */
aj = a->j; av = a->a;
for (i=0; i<mbs; i++) {
/* diagonal block */
*(bj + browstart[i]) = *aj; aj++;
itmp = bs2*browstart[i];
for (k=0; k<bs2; k++){
*(bv + itmp + k) = *av; av++;
}
browstart[i]++;
nz = ai[i+1] - ai[i] -1;
while (nz--){
/* lower triangular blocks */
*(bj + browstart[*aj]) = i;
itmp = bs2*browstart[*aj];
for (k=0; k<bs2; k++){
*(bv + itmp + k) = *(av + k);
}
browstart[*aj]++;
/* upper triangular blocks */
*(bj + browstart[i]) = *aj; aj++;
itmp = bs2*browstart[i];
for (k=0; k<bs2; k++){
*(bv + itmp + k) = *av; av++;
}
browstart[i]++;
}
}
ierr = PetscFree2(browlengths,browstart);CHKERRQ(ierr);
ierr = MatAssemblyBegin(B,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr);
ierr = MatAssemblyEnd(B,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr);
if (reuse == MAT_REUSE_MATRIX) {
ierr = MatHeaderReplace(A,B);CHKERRQ(ierr);
} else {
*newmat = B;
}
PetscFunctionReturn(0);
}
PETSC_INTERN PetscErrorCode MatConvert_SeqSBAIJ_SeqAIJ(Mat A, MatType newtype,MatReuse reuse,Mat *newmat)
{
Mat B;
Mat_SeqSBAIJ *a = (Mat_SeqSBAIJ*)A->data;
Mat_SeqAIJ *b;
PetscErrorCode ierr;
PetscInt *ai=a->i,*aj=a->j,m=A->rmap->N,n=A->cmap->n,i,j,k,*bi,*bj,*rowlengths,nz,*rowstart,itmp;
PetscInt bs =A->rmap->bs,bs2=bs*bs,mbs=A->rmap->N/bs,diagcnt=0;
MatScalar *av,*bv;
PetscFunctionBegin;
/* compute rowlengths of newmat */
ierr = PetscMalloc2(m,&rowlengths,m+1,&rowstart);
CHKERRQ(ierr);
for (i=0; i<mbs; i++) rowlengths[i*bs] = 0;
k = 0;
for (i=0; i<mbs; i++) {
nz = ai[i+1] - ai[i];
if (nz) {
rowlengths[k] += nz; /* no. of upper triangular blocks */
if (*aj == i) {
aj++; /* skip diagonal */
diagcnt++;
nz--;
}
for (j=0; j<nz; j++) { /* no. of lower triangular blocks */
rowlengths[(*aj)*bs]++;
aj++;
}
}
rowlengths[k] *= bs;
for (j=1; j<bs; j++) {
rowlengths[k+j] = rowlengths[k];
}
k += bs;
/* printf(" rowlengths[%d]: %d\n",i, rowlengths[i]); */
}
ierr = MatCreate(PetscObjectComm((PetscObject)A),&B);
CHKERRQ(ierr);
ierr = MatSetSizes(B,m,n,m,n);
CHKERRQ(ierr);
ierr = MatSetType(B,MATSEQAIJ);
CHKERRQ(ierr);
ierr = MatSeqAIJSetPreallocation(B,0,rowlengths);
CHKERRQ(ierr);
ierr = MatSetOption(B,MAT_ROW_ORIENTED,PETSC_FALSE);
CHKERRQ(ierr);
B->rmap->bs = A->rmap->bs;
b = (Mat_SeqAIJ*)(B->data);
bi = b->i;
bj = b->j;
bv = b->a;
/* set b->i */
bi[0] = 0;
rowstart[0] = 0;
for (i=0; i<mbs; i++) {
for (j=0; j<bs; j++) {
b->ilen[i*bs+j] = rowlengths[i*bs];
rowstart[i*bs+j+1] = rowstart[i*bs+j] + rowlengths[i*bs];
}
bi[i+1] = bi[i] + rowlengths[i*bs]/bs;
}
if (bi[mbs] != 2*a->nz - diagcnt) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_PLIB,"bi[mbs]: %D != 2*a->nz-diagcnt: %D\n",bi[mbs],2*a->nz - diagcnt);
/* set b->j and b->a */
aj = a->j;
av = a->a;
for (i=0; i<mbs; i++) {
nz = ai[i+1] - ai[i];
/* diagonal block */
if (nz && *aj == i) {
nz--;
for (j=0; j<bs; j++) { /* row i*bs+j */
itmp = i*bs+j;
for (k=0; k<bs; k++) { /* col i*bs+k */
*(bj + rowstart[itmp]) = (*aj)*bs+k;
*(bv + rowstart[itmp]) = *(av+k*bs+j);
rowstart[itmp]++;
}
}
aj++;
av += bs2;
}
while (nz--) {
/* lower triangular blocks */
for (j=0; j<bs; j++) { /* row (*aj)*bs+j */
itmp = (*aj)*bs+j;
for (k=0; k<bs; k++) { /* col i*bs+k */
*(bj + rowstart[itmp]) = i*bs+k;
*(bv + rowstart[itmp]) = *(av+j*bs+k);
rowstart[itmp]++;
}
}
/* upper triangular blocks */
for (j=0; j<bs; j++) { /* row i*bs+j */
itmp = i*bs+j;
for (k=0; k<bs; k++) { /* col (*aj)*bs+k */
*(bj + rowstart[itmp]) = (*aj)*bs+k;
*(bv + rowstart[itmp]) = *(av+k*bs+j);
rowstart[itmp]++;
}
}
aj++;
av += bs2;
}
}
ierr = PetscFree2(rowlengths,rowstart);
CHKERRQ(ierr);
ierr = MatAssemblyBegin(B,MAT_FINAL_ASSEMBLY);
CHKERRQ(ierr);
ierr = MatAssemblyEnd(B,MAT_FINAL_ASSEMBLY);
CHKERRQ(ierr);
if (reuse == MAT_INPLACE_MATRIX) {
ierr = MatHeaderReplace(A,&B);
CHKERRQ(ierr);
} else {
*newmat = B;
}
PetscFunctionReturn(0);
}
PETSC_INTERN PetscErrorCode MatConvert_SeqBAIJ_SeqSBAIJ(Mat A, MatType newtype,MatReuse reuse,Mat *newmat)
{
Mat B;
Mat_SeqBAIJ *a = (Mat_SeqBAIJ*)A->data;
Mat_SeqSBAIJ *b;
PetscErrorCode ierr;
PetscInt *ai=a->i,*aj,m=A->rmap->N,n=A->cmap->n,i,j,k,*bi,*bj,*browlengths;
PetscInt bs =A->rmap->bs,bs2=bs*bs,mbs=m/bs,dd;
MatScalar *av,*bv;
PetscBool flg;
PetscFunctionBegin;
if (!A->symmetric) SETERRQ(PetscObjectComm((PetscObject)A),PETSC_ERR_USER,"Matrix must be symmetric. Call MatSetOption(mat,MAT_SYMMETRIC,PETSC_TRUE)");
if (n != m) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_WRONG,"Matrix must be square");
ierr = MatMissingDiagonal_SeqBAIJ(A,&flg,&dd);
CHKERRQ(ierr); /* check for missing diagonals, then mark diag */
if (flg) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_ARG_WRONGSTATE,"Matrix is missing diagonal %D",dd);
ierr = PetscMalloc1(mbs,&browlengths);
CHKERRQ(ierr);
for (i=0; i<mbs; i++) {
browlengths[i] = ai[i+1] - a->diag[i];
}
ierr = MatCreate(PetscObjectComm((PetscObject)A),&B);
CHKERRQ(ierr);
ierr = MatSetSizes(B,m,n,m,n);
CHKERRQ(ierr);
ierr = MatSetType(B,MATSEQSBAIJ);
CHKERRQ(ierr);
ierr = MatSeqSBAIJSetPreallocation(B,bs,0,browlengths);
CHKERRQ(ierr);
ierr = MatSetOption(B,MAT_ROW_ORIENTED,PETSC_TRUE);
CHKERRQ(ierr);
b = (Mat_SeqSBAIJ*)(B->data);
bi = b->i;
bj = b->j;
bv = b->a;
bi[0] = 0;
for (i=0; i<mbs; i++) {
aj = a->j + a->diag[i];
av = a->a + (a->diag[i])*bs2;
for (j=0; j<browlengths[i]; j++) {
*bj = *aj;
bj++;
aj++;
for (k=0; k<bs2; k++) {
*bv = *av;
bv++;
av++;
}
}
bi[i+1] = bi[i] + browlengths[i];
b->ilen[i] = browlengths[i];
}
ierr = PetscFree(browlengths);
CHKERRQ(ierr);
ierr = MatAssemblyBegin(B,MAT_FINAL_ASSEMBLY);
CHKERRQ(ierr);
ierr = MatAssemblyEnd(B,MAT_FINAL_ASSEMBLY);
CHKERRQ(ierr);
if (reuse == MAT_INPLACE_MATRIX) {
ierr = MatHeaderReplace(A,&B);
CHKERRQ(ierr);
} else {
*newmat = B;
}
PetscFunctionReturn(0);
}
PETSC_INTERN PetscErrorCode MatConvert_SeqSBAIJ_SeqBAIJ(Mat A, MatType newtype,MatReuse reuse,Mat *newmat)
{
Mat B;
Mat_SeqSBAIJ *a = (Mat_SeqSBAIJ*)A->data;
Mat_SeqBAIJ *b;
PetscErrorCode ierr;
PetscInt *ai=a->i,*aj=a->j,m=A->rmap->N,n=A->cmap->n,i,k,*bi,*bj,*browlengths,nz,*browstart,itmp;
PetscInt bs =A->rmap->bs,bs2=bs*bs,mbs=m/bs,col,row;
MatScalar *av,*bv;
PetscFunctionBegin;
/* compute browlengths of newmat */
ierr = PetscMalloc2(mbs,&browlengths,mbs,&browstart);
CHKERRQ(ierr);
for (i=0; i<mbs; i++) browlengths[i] = 0;
for (i=0; i<mbs; i++) {
nz = ai[i+1] - ai[i];
aj++; /* skip diagonal */
for (k=1; k<nz; k++) { /* no. of lower triangular blocks */
browlengths[*aj]++;
aj++;
}
browlengths[i] += nz; /* no. of upper triangular blocks */
}
ierr = MatCreate(PetscObjectComm((PetscObject)A),&B);
CHKERRQ(ierr);
ierr = MatSetSizes(B,m,n,m,n);
CHKERRQ(ierr);
ierr = MatSetType(B,MATSEQBAIJ);
CHKERRQ(ierr);
ierr = MatSeqBAIJSetPreallocation(B,bs,0,browlengths);
CHKERRQ(ierr);
ierr = MatSetOption(B,MAT_ROW_ORIENTED,PETSC_TRUE);
CHKERRQ(ierr);
b = (Mat_SeqBAIJ*)(B->data);
bi = b->i;
bj = b->j;
bv = b->a;
/* set b->i */
bi[0] = 0;
for (i=0; i<mbs; i++) {
b->ilen[i] = browlengths[i];
bi[i+1] = bi[i] + browlengths[i];
browstart[i] = bi[i];
}
if (bi[mbs] != 2*a->nz - mbs) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_PLIB,"bi[mbs]: %D != 2*a->nz - mbs: %D\n",bi[mbs],2*a->nz - mbs);
/* set b->j and b->a */
aj = a->j;
av = a->a;
for (i=0; i<mbs; i++) {
/* diagonal block */
*(bj + browstart[i]) = *aj;
aj++;
itmp = bs2*browstart[i];
for (k=0; k<bs2; k++) {
*(bv + itmp + k) = *av;
av++;
}
browstart[i]++;
nz = ai[i+1] - ai[i] -1;
while (nz--) {
/* lower triangular blocks - transpose blocks of A */
*(bj + browstart[*aj]) = i; /* block col index */
itmp = bs2*browstart[*aj]; /* row index */
for (col=0; col<bs; col++) {
k = col;
for (row=0; row<bs; row++) {
bv[itmp + col*bs+row] = av[k];
k+=bs;
}
}
browstart[*aj]++;
/* upper triangular blocks */
*(bj + browstart[i]) = *aj;
aj++;
itmp = bs2*browstart[i];
for (k=0; k<bs2; k++) {
bv[itmp + k] = av[k];
}
av += bs2;
browstart[i]++;
}
}
ierr = PetscFree2(browlengths,browstart);
CHKERRQ(ierr);
ierr = MatAssemblyBegin(B,MAT_FINAL_ASSEMBLY);
CHKERRQ(ierr);
ierr = MatAssemblyEnd(B,MAT_FINAL_ASSEMBLY);
CHKERRQ(ierr);
if (reuse == MAT_INPLACE_MATRIX) {
ierr = MatHeaderReplace(A,&B);
CHKERRQ(ierr);
} else {
*newmat = B;
}
PetscFunctionReturn(0);
}
PETSC_INTERN PetscErrorCode MatConvert_SeqAIJ_SeqSBAIJ(Mat A,MatType newtype,MatReuse reuse,Mat *newmat)
{
Mat B;
Mat_SeqAIJ *a = (Mat_SeqAIJ*)A->data;
Mat_SeqSBAIJ *b;
PetscErrorCode ierr;
PetscInt *ai=a->i,*aj,m=A->rmap->N,n=A->cmap->N,i,j,*bi,*bj,*rowlengths;
MatScalar *av,*bv;
PetscFunctionBegin;
if (!A->symmetric) SETERRQ(PetscObjectComm((PetscObject)A),PETSC_ERR_USER,"Matrix must be symmetric. Call MatSetOption(mat,MAT_SYMMETRIC,PETSC_TRUE)");
if (n != m) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_WRONG,"Matrix must be square");
ierr = PetscMalloc1(m,&rowlengths);
CHKERRQ(ierr);
for (i=0; i<m; i++) {
rowlengths[i] = ai[i+1] - a->diag[i];
}
ierr = MatCreate(PetscObjectComm((PetscObject)A),&B);
CHKERRQ(ierr);
ierr = MatSetSizes(B,m,n,m,n);
CHKERRQ(ierr);
ierr = MatSetType(B,MATSEQSBAIJ);
CHKERRQ(ierr);
ierr = MatSeqSBAIJSetPreallocation(B,1,0,rowlengths);
CHKERRQ(ierr);
ierr = MatSetOption(B,MAT_ROW_ORIENTED,PETSC_TRUE);
CHKERRQ(ierr);
b = (Mat_SeqSBAIJ*)(B->data);
bi = b->i;
bj = b->j;
bv = b->a;
bi[0] = 0;
for (i=0; i<m; i++) {
aj = a->j + a->diag[i];
av = a->a + a->diag[i];
for (j=0; j<rowlengths[i]; j++) {
*bj = *aj;
bj++;
aj++;
*bv = *av;
bv++;
av++;
}
bi[i+1] = bi[i] + rowlengths[i];
b->ilen[i] = rowlengths[i];
}
ierr = PetscFree(rowlengths);
CHKERRQ(ierr);
ierr = MatAssemblyBegin(B,MAT_FINAL_ASSEMBLY);
CHKERRQ(ierr);
ierr = MatAssemblyEnd(B,MAT_FINAL_ASSEMBLY);
CHKERRQ(ierr);
if (reuse == MAT_INPLACE_MATRIX) {
ierr = MatHeaderReplace(A,&B);
CHKERRQ(ierr);
} else {
*newmat = B;
}
PetscFunctionReturn(0);
}
/*
MatConvert_Basic - Converts from any input format to another format. For
parallel formats, the new matrix distribution is determined by PETSc.
Does not do preallocation so in general will be slow
*/
PetscErrorCode MatConvert_Basic(Mat mat, MatType newtype,MatReuse reuse,Mat *newmat)
{
Mat M;
const PetscScalar *vwork;
PetscErrorCode ierr;
PetscInt i,j,nz,m,n,rstart,rend,lm,ln,prbs,pcbs,cstart,cend,*dnz,*onz;
const PetscInt *cwork;
PetscBool isseqsbaij,ismpisbaij,isseqbaij,ismpibaij,isseqdense,ismpidense;
PetscFunctionBegin;
ierr = MatGetSize(mat,&m,&n);CHKERRQ(ierr);
ierr = MatGetLocalSize(mat,&lm,&ln);CHKERRQ(ierr);
if (ln == n) ln = PETSC_DECIDE; /* try to preserve column ownership */
ierr = MatCreate(PetscObjectComm((PetscObject)mat),&M);CHKERRQ(ierr);
ierr = MatSetSizes(M,lm,ln,m,n);CHKERRQ(ierr);
ierr = MatSetBlockSizes(M,mat->rmap->bs,mat->cmap->bs);CHKERRQ(ierr);
ierr = MatSetType(M,newtype);CHKERRQ(ierr);
ierr = MatGetOwnershipRange(mat,&rstart,&rend);CHKERRQ(ierr);
ierr = PetscObjectTypeCompare((PetscObject)M,MATSEQSBAIJ,&isseqsbaij);CHKERRQ(ierr);
ierr = PetscObjectTypeCompare((PetscObject)M,MATMPISBAIJ,&ismpisbaij);CHKERRQ(ierr);
if (isseqsbaij || ismpisbaij) {ierr = MatSetOption(M,MAT_IGNORE_LOWER_TRIANGULAR,PETSC_TRUE);CHKERRQ(ierr);}
ierr = PetscObjectTypeCompare((PetscObject)M,MATSEQBAIJ,&isseqbaij);CHKERRQ(ierr);
ierr = PetscObjectTypeCompare((PetscObject)M,MATMPIBAIJ,&ismpibaij);CHKERRQ(ierr);
ierr = PetscObjectTypeCompare((PetscObject)M,MATSEQDENSE,&isseqdense);CHKERRQ(ierr);
ierr = PetscObjectTypeCompare((PetscObject)M,MATMPIDENSE,&ismpidense);CHKERRQ(ierr);
if (isseqdense) {
ierr = MatSeqDenseSetPreallocation(M,NULL);CHKERRQ(ierr);
} else if (ismpidense) {
ierr = MatMPIDenseSetPreallocation(M,NULL);CHKERRQ(ierr);
} else {
/* Preallocation block sizes. (S)BAIJ matrices will have one index per block. */
prbs = (isseqbaij || ismpibaij || isseqsbaij || ismpisbaij) ? M->rmap->bs : 1;
pcbs = (isseqbaij || ismpibaij || isseqsbaij || ismpisbaij) ? M->cmap->bs : 1;
ierr = PetscMalloc2(lm/prbs,&dnz,lm/prbs,&onz);CHKERRQ(ierr);
ierr = MatGetOwnershipRangeColumn(mat,&cstart,&cend);CHKERRQ(ierr);
for (i=0; i<lm; i+=prbs) {
ierr = MatGetRow(mat,rstart+i,&nz,&cwork,NULL);CHKERRQ(ierr);
dnz[i] = 0;
onz[i] = 0;
for (j=0; j<nz; j+=pcbs) {
if ((isseqsbaij || ismpisbaij) && cwork[j] < rstart+i) continue;
if (cstart <= cwork[j] && cwork[j] < cend) dnz[i]++;
else onz[i]++;
}
ierr = MatRestoreRow(mat,rstart+i,&nz,&cwork,NULL);CHKERRQ(ierr);
}
ierr = MatXAIJSetPreallocation(M,M->rmap->bs,dnz,onz,dnz,onz);CHKERRQ(ierr);
ierr = PetscFree2(dnz,onz);CHKERRQ(ierr);
}
for (i=rstart; i<rend; i++) {
ierr = MatGetRow(mat,i,&nz,&cwork,&vwork);CHKERRQ(ierr);
ierr = MatSetValues(M,1,&i,nz,cwork,vwork,INSERT_VALUES);CHKERRQ(ierr);
ierr = MatRestoreRow(mat,i,&nz,&cwork,&vwork);CHKERRQ(ierr);
}
ierr = MatAssemblyBegin(M,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr);
ierr = MatAssemblyEnd(M,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr);
if (reuse == MAT_REUSE_MATRIX) {
ierr = MatHeaderReplace(mat,M);CHKERRQ(ierr);
} else {
*newmat = M;
}
PetscFunctionReturn(0);
}
EXTERN_C_END
EXTERN_C_BEGIN
#undef __FUNCT__
#define __FUNCT__ "MatConvert_SeqBAIJ_SeqSBAIJ"
PetscErrorCode PETSCMAT_DLLEXPORT MatConvert_SeqBAIJ_SeqSBAIJ(Mat A, MatType newtype,MatReuse reuse,Mat *newmat)
{
Mat B;
Mat_SeqBAIJ *a = (Mat_SeqBAIJ*)A->data;
Mat_SeqSBAIJ *b;
PetscErrorCode ierr;
PetscInt *ai=a->i,*aj,m=A->rmap->N,n=A->cmap->n,i,j,k,*bi,*bj,*browlengths;
PetscInt bs=A->rmap->bs,bs2=bs*bs,mbs=m/bs,dd;
MatScalar *av,*bv;
PetscTruth flg;
PetscFunctionBegin;
if (n != m) SETERRQ(PETSC_ERR_ARG_WRONG,"Matrix must be square");
ierr = MatMissingDiagonal_SeqBAIJ(A,&flg,&dd);CHKERRQ(ierr); /* check for missing diagonals, then mark diag */
if (flg) SETERRQ1(PETSC_ERR_ARG_WRONGSTATE,"Matrix is missing diagonal %D",dd);
ierr = PetscMalloc(mbs*sizeof(PetscInt),&browlengths);CHKERRQ(ierr);
for (i=0; i<mbs; i++) {
browlengths[i] = ai[i+1] - a->diag[i];
}
ierr = MatCreate(((PetscObject)A)->comm,&B);CHKERRQ(ierr);
ierr = MatSetSizes(B,m,n,m,n);CHKERRQ(ierr);
ierr = MatSetType(B,newtype);CHKERRQ(ierr);
ierr = MatSeqSBAIJSetPreallocation_SeqSBAIJ(B,bs,0,browlengths);CHKERRQ(ierr);
ierr = MatSetOption(B,MAT_ROW_ORIENTED,PETSC_TRUE);CHKERRQ(ierr);
b = (Mat_SeqSBAIJ*)(B->data);
bi = b->i;
bj = b->j;
bv = b->a;
bi[0] = 0;
for (i=0; i<mbs; i++) {
aj = a->j + a->diag[i];
av = a->a + (a->diag[i])*bs2;
for (j=0; j<browlengths[i]; j++){
*bj = *aj; bj++; aj++;
for (k=0; k<bs2; k++){
*bv = *av; bv++; av++;
}
}
bi[i+1] = bi[i] + browlengths[i];
b->ilen[i] = browlengths[i];
}
ierr = PetscFree(browlengths);CHKERRQ(ierr);
ierr = MatAssemblyBegin(B,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr);
ierr = MatAssemblyEnd(B,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr);
if (reuse == MAT_REUSE_MATRIX) {
ierr = MatHeaderReplace(A,B);CHKERRQ(ierr);
} else {
*newmat = B;
}
PetscFunctionReturn(0);
}
