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

lu: removed redundant lu factor methods

la-knuth
Marcus Cuda 17 years ago
parent
c9d86d856f
commit
890f215ba5
3 changed files with 2 additions and 156 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. 58
      src/Numerics/Algorithms/LinearAlgebra/Atlas/AtlasLinearAlgebraProvider.cs
  2. 42
      src/Numerics/Algorithms/LinearAlgebra/ManagedLinearAlgebraProvider.cs
  3. 58
      src/Numerics/Algorithms/LinearAlgebra/Mkl/MklLinearAlgebraProvider.cs

58
src/Numerics/Algorithms/LinearAlgebra/Atlas/AtlasLinearAlgebraProvider.cs
View File

@ -24,7 +24,7 @@
/* This file is automatically generated - do not modify it.
Change NativeLinearAlgebraProvider.include instead.
Last generated on: 18/05/2010 22:54:23
Last generated on: 6/9/2010 7:30:08 AM
*/
namespace MathNet.Numerics.Algorithms.LinearAlgebra.Atlas
{
@ -2442,61 +2442,5 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.Atlas
}
#endregion
/// <summary>
/// Computes the LU factorization of A.
/// </summary>
/// <param name="a">An m by n matrix. The matrix is overwritten with the
/// the LU factorization On exit.</param>
/// <param name="order">The order of <paramref name="a"/></param>
/// <param name="ipiv">On exit, it contains the pivot indices. The size
/// of the array must be min(m,n).</param>
/// <remarks>This is equivalent to the GETRF LAPACK routine.</remarks>
public void LUFactor(double[] a, int order, int[] ipiv)
{
throw new NotImplementedException();
}
/// <summary>
/// Computes the LU factorization of A.
/// </summary>
/// <param name="a">An m by n matrix. The matrix is overwritten with the
/// the LU factorization On exit.</param>
/// <param name="order">The order of <paramref name="a"/></param>
/// <param name="ipiv">On exit, it contains the pivot indices. The size
/// of the array must be min(m,n).</param>
/// <remarks>This is equivalent to the GETRF LAPACK routine.</remarks>
public void LUFactor(float[] a, int order, int[] ipiv)
{
throw new NotImplementedException();
}
/// <summary>
/// Computes the LU factorization of A.
/// </summary>
/// <param name="a">An m by n matrix. The matrix is overwritten with the
/// the LU factorization On exit.</param>
/// <param name="order">The order of <paramref name="a"/></param>
/// <param name="ipiv">On exit, it contains the pivot indices. The size
/// of the array must be min(m,n).</param>
/// <remarks>This is equivalent to the GETRF LAPACK routine.</remarks>
public void LUFactor(Complex[] a, int order, int[] ipiv)
{
throw new NotImplementedException();
}
/// <summary>
/// Computes the LU factorization of A.
/// </summary>
/// <param name="a">An m by n matrix. The matrix is overwritten with the
/// the LU factorization On exit.</param>
/// <param name="order">The order of <paramref name="a"/></param>
/// <param name="ipiv">On exit, it contains the pivot indices. The size
/// of the array must be min(m,n).</param>
/// <remarks>This is equivalent to the GETRF LAPACK routine.</remarks>
public void LUFactor(Complex32[] a, int order, int[] ipiv)
{
throw new NotImplementedException();
}
}
}

42
src/Numerics/Algorithms/LinearAlgebra/ManagedLinearAlgebraProvider.cs
View File

@ -3388,47 +3388,5 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra
}
#endregion
/// <summary>
/// Computes the LU factorization of A.
/// </summary>
/// <param name="a">An m by n matrix. The matrix is overwritten with the
/// the LU factorization On exit.</param>
/// <param name="order">The order of <paramref name="a"/></param>
/// <param name="ipiv">On exit, it contains the pivot indices. The size
/// of the array must be min(m,n).</param>
/// <remarks>This is equivalent to the GETRF LAPACK routine.</remarks>
public void LUFactor(float[] a, int order, int[] ipiv)
{
throw new NotImplementedException();
}
/// <summary>
/// Computes the LU factorization of A.
/// </summary>
/// <param name="a">An m by n matrix. The matrix is overwritten with the
/// the LU factorization On exit.</param>
/// <param name="order">The order of <paramref name="a"/></param>
/// <param name="ipiv">On exit, it contains the pivot indices. The size
/// of the array must be min(m,n).</param>
/// <remarks>This is equivalent to the GETRF LAPACK routine.</remarks>
public void LUFactor(Complex[] a, int order, int[] ipiv)
{
throw new NotImplementedException();
}
/// <summary>
/// Computes the LU factorization of A.
/// </summary>
/// <param name="a">An m by n matrix. The matrix is overwritten with the
/// the LU factorization On exit.</param>
/// <param name="order">The order of <paramref name="a"/></param>
/// <param name="ipiv">On exit, it contains the pivot indices. The size
/// of the array must be min(m,n).</param>
/// <remarks>This is equivalent to the GETRF LAPACK routine.</remarks>
public void LUFactor(Complex32[] a, int order, int[] ipiv)
{
throw new NotImplementedException();
}
}
}

58
src/Numerics/Algorithms/LinearAlgebra/Mkl/MklLinearAlgebraProvider.cs
View File

@ -24,7 +24,7 @@
/* This file is automatically generated - do not modify it.
Change NativeLinearAlgebraProvider.include instead.
Last generated on: 18/05/2010 22:54:25
Last generated on: 6/9/2010 7:30:14 AM
*/
namespace MathNet.Numerics.Algorithms.LinearAlgebra.Mkl
{
@ -2441,61 +2441,5 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.Mkl
}
#endregion
/// <summary>
/// Computes the LU factorization of A.
/// </summary>
/// <param name="a">An m by n matrix. The matrix is overwritten with the
/// the LU factorization On exit.</param>
/// <param name="order">The order of <paramref name="a"/></param>
/// <param name="ipiv">On exit, it contains the pivot indices. The size
/// of the array must be min(m,n).</param>
/// <remarks>This is equivalent to the GETRF LAPACK routine.</remarks>
public void LUFactor(double[] a, int order, int[] ipiv)
{
throw new NotImplementedException();
}
/// <summary>
/// Computes the LU factorization of A.
/// </summary>
/// <param name="a">An m by n matrix. The matrix is overwritten with the
/// the LU factorization On exit.</param>
/// <param name="order">The order of <paramref name="a"/></param>
/// <param name="ipiv">On exit, it contains the pivot indices. The size
/// of the array must be min(m,n).</param>
/// <remarks>This is equivalent to the GETRF LAPACK routine.</remarks>
public void LUFactor(float[] a, int order, int[] ipiv)
{
throw new NotImplementedException();
}
/// <summary>
/// Computes the LU factorization of A.
/// </summary>
/// <param name="a">An m by n matrix. The matrix is overwritten with the
/// the LU factorization On exit.</param>
/// <param name="order">The order of <paramref name="a"/></param>
/// <param name="ipiv">On exit, it contains the pivot indices. The size
/// of the array must be min(m,n).</param>
/// <remarks>This is equivalent to the GETRF LAPACK routine.</remarks>
public void LUFactor(Complex[] a, int order, int[] ipiv)
{
throw new NotImplementedException();
}
/// <summary>
/// Computes the LU factorization of A.
/// </summary>
/// <param name="a">An m by n matrix. The matrix is overwritten with the
/// the LU factorization On exit.</param>
/// <param name="order">The order of <paramref name="a"/></param>
/// <param name="ipiv">On exit, it contains the pivot indices. The size
/// of the array must be min(m,n).</param>
/// <remarks>This is equivalent to the GETRF LAPACK routine.</remarks>
public void LUFactor(Complex32[] a, int order, int[] ipiv)
{
throw new NotImplementedException();
}
}
}
Write Preview
Loading…
Cancel
Save