From: Wolfgang Bangerth Date: Wed, 27 Feb 2008 17:09:46 +0000 (+0000) Subject: Indent, leave a comment. X-Git-Tag: v8.0.0~9350 X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=1b45b969bda308b4f9511caf6b597a9c52f4c78f;p=dealii.git Indent, leave a comment. git-svn-id: https://svn.dealii.org/trunk@15808 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/lac/include/lac/sparse_ilu.templates.h b/deal.II/lac/include/lac/sparse_ilu.templates.h index c0a0c75e81..fb3d6722ab 100644 --- a/deal.II/lac/include/lac/sparse_ilu.templates.h +++ b/deal.II/lac/include/lac/sparse_ilu.templates.h @@ -75,14 +75,14 @@ void SparseILU::decompose (const SparseMatrix &matrix, (indices=0..N-1) for i=1..N-1 - a[i-1,i-1] = a[i-1,i-1]^{-1} + a[i-1,i-1] = a[i-1,i-1]^{-1} - for k=0..i-1 - a[i,k] = a[i,k] * a[k,k] + for k=0..i-1 + a[i,k] = a[i,k] * a[k,k] - for j=k+1..N-1 - if (a[i,j] exists & a[k,j] exists) - a[i,j] -= a[i,k] * a[k,j] + for j=k+1..N-1 + if (a[i,j] exists & a[k,j] exists) + a[i,j] -= a[i,k] * a[k,j] */ @@ -97,7 +97,7 @@ void SparseILU::decompose (const SparseMatrix &matrix, // and since it makes the backward // step when applying the decomposition // significantly faster - AssertThrow((this->global_entry(rowstart_indices[row-1]) !=0), + AssertThrow((this->global_entry(rowstart_indices[row-1]) != 0), ExcDivideByZero()); this->global_entry (rowstart_indices[row-1]) @@ -138,6 +138,10 @@ void SparseILU::decompose (const SparseMatrix &matrix, j<&column_numbers[rowstart_indices[row+1]]; ++j) { + // get the locations of + // entries ij and kj in + // the matrix. note that k