ufkc7e3d
/
mathnet-numerics
forked from tsai/mathnet-numerics
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
Browse Source

LA: sparse implementation of Kroenecker product

la-knuth
Christoph Ruegg 14 years ago
parent
d47895aeaf
commit
5264d178d8
4 changed files with 172 additions and 24 deletions
Whitespace
Show all changes Ignore whitespace when comparing lines Ignore changes in amount of whitespace Ignore changes in whitespace at EOL
Split View
Diff Options
Show Stats Download Patch File Download Diff File
  1. 49
      src/Numerics/LinearAlgebra/Complex/SparseMatrix.cs
  2. 49
      src/Numerics/LinearAlgebra/Complex32/SparseMatrix.cs
  3. 49
      src/Numerics/LinearAlgebra/Double/SparseMatrix.cs
  4. 49
      src/Numerics/LinearAlgebra/Single/SparseMatrix.cs

49
src/Numerics/LinearAlgebra/Complex/SparseMatrix.cs
View File

@ -1057,7 +1057,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex
var values = _storage.Values;
var valueCount = _storage.ValueCount;
for (var i = 0; i < other.RowCount; i++)
for (var i = 0; i < RowCount; i++)
{
// Get the begin / end index for the current row
var startIndex = rowPointers[i];
@ -1065,7 +1065,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex
for (var j = startIndex; j < endIndex; j++)
{
var resVal = values[j] * other.At(i, columnIndices[j]);
var resVal = values[j]*other.At(i, columnIndices[j]);
if (!resVal.IsZero())
{
result.At(i, columnIndices[j], resVal);
@ -1088,7 +1088,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex
var values = _storage.Values;
var valueCount = _storage.ValueCount;
for (var i = 0; i < other.RowCount; i++)
for (var i = 0; i < RowCount; i++)
{
// Get the begin / end index for the current row
var startIndex = rowPointers[i];
@ -1096,10 +1096,47 @@ namespace MathNet.Numerics.LinearAlgebra.Complex
for (var j = startIndex; j < endIndex; j++)
{
var resVal = values[j] / other.At(i, columnIndices[j]);
if (!resVal.IsZero())
if (!values[j].IsZero())
{
result.At(i, columnIndices[j], resVal);
result.At(i, columnIndices[j], values[j]/other.At(i, columnIndices[j]));
}
}
}
}
public override void KroneckerProduct(Matrix<Complex> other, Matrix<Complex> result)
{
if (other == null)
{
throw new ArgumentNullException("other");
}
if (result == null)
{
throw new ArgumentNullException("result");
}
if (result.RowCount != (RowCount*other.RowCount) || result.ColumnCount != (ColumnCount*other.ColumnCount))
{
throw DimensionsDontMatch<ArgumentOutOfRangeException>(this, other, result);
}
var rowPointers = _storage.RowPointers;
var columnIndices = _storage.ColumnIndices;
var values = _storage.Values;
var valueCount = _storage.ValueCount;
for (var i = 0; i < RowCount; i++)
{
// Get the begin / end index for the current row
var startIndex = rowPointers[i];
var endIndex = i < rowPointers.Length - 1 ? rowPointers[i + 1] : valueCount;
for (var j = startIndex; j < endIndex; j++)
{
if (!values[j].IsZero())
{
result.SetSubMatrix(i*other.RowCount, other.RowCount, columnIndices[j]*other.ColumnCount, other.ColumnCount, values[j]*other);
}
}
}

49
src/Numerics/LinearAlgebra/Complex32/SparseMatrix.cs
View File

@ -1056,7 +1056,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32
var values = _storage.Values;
var valueCount = _storage.ValueCount;
for (var i = 0; i < other.RowCount; i++)
for (var i = 0; i < RowCount; i++)
{
// Get the begin / end index for the current row
var startIndex = rowPointers[i];
@ -1064,7 +1064,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32
for (var j = startIndex; j < endIndex; j++)
{
var resVal = values[j] * other.At(i, columnIndices[j]);
var resVal = values[j]*other.At(i, columnIndices[j]);
if (!resVal.IsZero())
{
result.At(i, columnIndices[j], resVal);
@ -1087,7 +1087,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32
var values = _storage.Values;
var valueCount = _storage.ValueCount;
for (var i = 0; i < other.RowCount; i++)
for (var i = 0; i < RowCount; i++)
{
// Get the begin / end index for the current row
var startIndex = rowPointers[i];
@ -1095,10 +1095,47 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32
for (var j = startIndex; j < endIndex; j++)
{
var resVal = values[j] / other.At(i, columnIndices[j]);
if (!resVal.IsZero())
if (!values[j].IsZero())
{
result.At(i, columnIndices[j], resVal);
result.At(i, columnIndices[j], values[j]/other.At(i, columnIndices[j]));
}
}
}
}
public override void KroneckerProduct(Matrix<Complex32> other, Matrix<Complex32> result)
{
if (other == null)
{
throw new ArgumentNullException("other");
}
if (result == null)
{
throw new ArgumentNullException("result");
}
if (result.RowCount != (RowCount*other.RowCount) || result.ColumnCount != (ColumnCount*other.ColumnCount))
{
throw DimensionsDontMatch<ArgumentOutOfRangeException>(this, other, result);
}
var rowPointers = _storage.RowPointers;
var columnIndices = _storage.ColumnIndices;
var values = _storage.Values;
var valueCount = _storage.ValueCount;
for (var i = 0; i < RowCount; i++)
{
// Get the begin / end index for the current row
var startIndex = rowPointers[i];
var endIndex = i < rowPointers.Length - 1 ? rowPointers[i + 1] : valueCount;
for (var j = startIndex; j < endIndex; j++)
{
if (!values[j].IsZero())
{
result.SetSubMatrix(i*other.RowCount, other.RowCount, columnIndices[j]*other.ColumnCount, other.ColumnCount, values[j]*other);
}
}
}

49
src/Numerics/LinearAlgebra/Double/SparseMatrix.cs
View File

@ -1055,7 +1055,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double
var values = _storage.Values;
var valueCount = _storage.ValueCount;
for (var i = 0; i < other.RowCount; i++)
for (var i = 0; i < RowCount; i++)
{
// Get the begin / end index for the current row
var startIndex = rowPointers[i];
@ -1063,7 +1063,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double
for (var j = startIndex; j < endIndex; j++)
{
var resVal = values[j] * other.At(i, columnIndices[j]);
var resVal = values[j]*other.At(i, columnIndices[j]);
if (resVal != 0d)
{
result.At(i, columnIndices[j], resVal);
@ -1086,7 +1086,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double
var values = _storage.Values;
var valueCount = _storage.ValueCount;
for (var i = 0; i < other.RowCount; i++)
for (var i = 0; i < RowCount; i++)
{
// Get the begin / end index for the current row
var startIndex = rowPointers[i];
@ -1094,10 +1094,47 @@ namespace MathNet.Numerics.LinearAlgebra.Double
for (var j = startIndex; j < endIndex; j++)
{
var resVal = values[j] / other.At(i, columnIndices[j]);
if (resVal != 0d)
if (values[j] != 0d)
{
result.At(i, columnIndices[j], resVal);
result.At(i, columnIndices[j], values[j]/other.At(i, columnIndices[j]));
}
}
}
}
public override void KroneckerProduct(Matrix<double> other, Matrix<double> result)
{
if (other == null)
{
throw new ArgumentNullException("other");
}
if (result == null)
{
throw new ArgumentNullException("result");
}
if (result.RowCount != (RowCount*other.RowCount) || result.ColumnCount != (ColumnCount*other.ColumnCount))
{
throw DimensionsDontMatch<ArgumentOutOfRangeException>(this, other, result);
}
var rowPointers = _storage.RowPointers;
var columnIndices = _storage.ColumnIndices;
var values = _storage.Values;
var valueCount = _storage.ValueCount;
for (var i = 0; i < RowCount; i++)
{
// Get the begin / end index for the current row
var startIndex = rowPointers[i];
var endIndex = i < rowPointers.Length - 1 ? rowPointers[i + 1] : valueCount;
for (var j = startIndex; j < endIndex; j++)
{
if (values[j] != 0d)
{
result.SetSubMatrix(i*other.RowCount, other.RowCount, columnIndices[j]*other.ColumnCount, other.ColumnCount, values[j]*other);
}
}
}

49
src/Numerics/LinearAlgebra/Single/SparseMatrix.cs
View File

@ -1054,7 +1054,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single
var values = _storage.Values;
var valueCount = _storage.ValueCount;
for (var i = 0; i < other.RowCount; i++)
for (var i = 0; i < RowCount; i++)
{
// Get the begin / end index for the current row
var startIndex = rowPointers[i];
@ -1062,7 +1062,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single
for (var j = startIndex; j < endIndex; j++)
{
var resVal = values[j] * other.At(i, columnIndices[j]);
var resVal = values[j]*other.At(i, columnIndices[j]);
if (resVal != 0f)
{
result.At(i, columnIndices[j], resVal);
@ -1085,7 +1085,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single
var values = _storage.Values;
var valueCount = _storage.ValueCount;
for (var i = 0; i < other.RowCount; i++)
for (var i = 0; i < RowCount; i++)
{
// Get the begin / end index for the current row
var startIndex = rowPointers[i];
@ -1093,10 +1093,47 @@ namespace MathNet.Numerics.LinearAlgebra.Single
for (var j = startIndex; j < endIndex; j++)
{
var resVal = values[j] / other.At(i, columnIndices[j]);
if (resVal != 0f)
if (values[j] != 0f)
{
result.At(i, columnIndices[j], resVal);
result.At(i, columnIndices[j], values[j]/other.At(i, columnIndices[j]));
}
}
}
}
public override void KroneckerProduct(Matrix<float> other, Matrix<float> result)
{
if (other == null)
{
throw new ArgumentNullException("other");
}
if (result == null)
{
throw new ArgumentNullException("result");
}
if (result.RowCount != (RowCount*other.RowCount) || result.ColumnCount != (ColumnCount*other.ColumnCount))
{
throw DimensionsDontMatch<ArgumentOutOfRangeException>(this, other, result);
}
var rowPointers = _storage.RowPointers;
var columnIndices = _storage.ColumnIndices;
var values = _storage.Values;
var valueCount = _storage.ValueCount;
for (var i = 0; i < RowCount; i++)
{
// Get the begin / end index for the current row
var startIndex = rowPointers[i];
var endIndex = i < rowPointers.Length - 1 ? rowPointers[i + 1] : valueCount;
for (var j = startIndex; j < endIndex; j++)
{
if (values[j] != 0f)
{
result.SetSubMatrix(i*other.RowCount, other.RowCount, columnIndices[j]*other.ColumnCount, other.ColumnCount, values[j]*other);
}
}
}

Write Preview
Loading…
Cancel
Save