diff --git a/src/MathNet.Numerics.5.0.ReSharper b/src/MathNet.Numerics.5.0.ReSharper index 63627184..d76c21db 100644 --- a/src/MathNet.Numerics.5.0.ReSharper +++ b/src/MathNet.Numerics.5.0.ReSharper @@ -10,7 +10,8 @@ en-US false - pointwise + pointwise +Frobenius diff --git a/src/Numerics/Algorithms/LinearAlgebra/Atlas/AtlasLinearAlgebraProvider.cs b/src/Numerics/Algorithms/LinearAlgebra/Atlas/AtlasLinearAlgebraProvider.cs index c902958e..04f3841a 100644 --- a/src/Numerics/Algorithms/LinearAlgebra/Atlas/AtlasLinearAlgebraProvider.cs +++ b/src/Numerics/Algorithms/LinearAlgebra/Atlas/AtlasLinearAlgebraProvider.cs @@ -28,7 +28,7 @@ /* This file is automatically generated - do not modify it. Change NativeLinearAlgebraProvider.include instead. - Last generated on UTC 2010-06-09 08:17:09Z + Last generated on UTC 2010-06-27 13:08:29Z */ namespace MathNet.Numerics.Algorithms.LinearAlgebra.Atlas @@ -574,7 +574,7 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.Atlas /// If is true, on exit VT contains the transposed /// right singular vectors. /// This is equivalent to the GESVD LAPACK routine. - public void SinguarValueDecomposition(bool computeVectors, double[] a, double[] s, double[] u, double[] vt) + public void SingularValueDecomposition(bool computeVectors, double[] a, double[] s, double[] u, double[] vt) { throw new NotImplementedException(); } @@ -633,9 +633,9 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.Atlas /// Solves A*X=B for X using a previously SVD decomposed matrix. /// /// The number of columns of B. - /// The s values returned by . - /// The left singular vectors returned by . - /// The right singular vectors returned by . + /// The s values returned by . + /// The left singular vectors returned by . + /// The right singular vectors returned by . /// The B matrix. /// On exit, the solution matrix. public void SvdSolveFactored(int columnsOfB, double[] s, double[] u, double[] vt, double[] b, double[] x) @@ -1175,7 +1175,7 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.Atlas /// If is true, on exit VT contains the transposed /// right singular vectors. /// This is equivalent to the GESVD LAPACK routine. - public void SinguarValueDecomposition(bool computeVectors, float[] a, float[] s, float[] u, float[] vt) + public void SingularValueDecomposition(bool computeVectors, float[] a, float[] s, float[] u, float[] vt) { throw new NotImplementedException(); } @@ -1234,9 +1234,9 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.Atlas /// Solves A*X=B for X using a previously SVD decomposed matrix. /// /// The number of columns of B. - /// The s values returned by . - /// The left singular vectors returned by . - /// The right singular vectors returned by . + /// The s values returned by . + /// The left singular vectors returned by . + /// The right singular vectors returned by . /// The B matrix. /// On exit, the solution matrix. public void SvdSolveFactored(int columnsOfB, float[] s, float[] u, float[] vt, float[] b, float[] x) @@ -1776,7 +1776,7 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.Atlas /// If is true, on exit VT contains the transposed /// right singular vectors. /// This is equivalent to the GESVD LAPACK routine. - public void SinguarValueDecomposition(bool computeVectors, Complex[] a, Complex[] s, Complex[] u, Complex[] vt) + public void SingularValueDecomposition(bool computeVectors, Complex[] a, Complex[] s, Complex[] u, Complex[] vt) { throw new NotImplementedException(); } @@ -1835,9 +1835,9 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.Atlas /// Solves A*X=B for X using a previously SVD decomposed matrix. /// /// The number of columns of B. - /// The s values returned by . - /// The left singular vectors returned by . - /// The right singular vectors returned by . + /// The s values returned by . + /// The left singular vectors returned by . + /// The right singular vectors returned by . /// The B matrix. /// On exit, the solution matrix. public void SvdSolveFactored(int columnsOfB, Complex[] s, Complex[] u, Complex[] vt, Complex[] b, Complex[] x) @@ -2377,7 +2377,7 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.Atlas /// If is true, on exit VT contains the transposed /// right singular vectors. /// This is equivalent to the GESVD LAPACK routine. - public void SinguarValueDecomposition(bool computeVectors, Complex32[] a, Complex32[] s, Complex32[] u, Complex32[] vt) + public void SingularValueDecomposition(bool computeVectors, Complex32[] a, Complex32[] s, Complex32[] u, Complex32[] vt) { throw new NotImplementedException(); } @@ -2436,9 +2436,9 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.Atlas /// Solves A*X=B for X using a previously SVD decomposed matrix. /// /// The number of columns of B. - /// The s values returned by . - /// The left singular vectors returned by . - /// The right singular vectors returned by . + /// The s values returned by . + /// The left singular vectors returned by . + /// The right singular vectors returned by . /// The B matrix. /// On exit, the solution matrix. public void SvdSolveFactored(int columnsOfB, Complex32[] s, Complex32[] u, Complex32[] vt, Complex32[] b, Complex32[] x) diff --git a/src/Numerics/Algorithms/LinearAlgebra/Atlas/SafeNativeMethods.cs b/src/Numerics/Algorithms/LinearAlgebra/Atlas/SafeNativeMethods.cs index 1bf9f9e3..394d79ad 100644 --- a/src/Numerics/Algorithms/LinearAlgebra/Atlas/SafeNativeMethods.cs +++ b/src/Numerics/Algorithms/LinearAlgebra/Atlas/SafeNativeMethods.cs @@ -28,7 +28,7 @@ /* This file is automatically generated - do not modify it. Change SafeNativeMethods.include instead. - Last generated on UTC 2010-06-09 08:17:11Z + Last generated on UTC 2010-06-27 13:08:33Z */ using System.Numerics; diff --git a/src/Numerics/Algorithms/LinearAlgebra/ILinearAlgebraProviderOfT.cs b/src/Numerics/Algorithms/LinearAlgebra/ILinearAlgebraProviderOfT.cs index 02a536f4..1e6ea9d6 100644 --- a/src/Numerics/Algorithms/LinearAlgebra/ILinearAlgebraProviderOfT.cs +++ b/src/Numerics/Algorithms/LinearAlgebra/ILinearAlgebraProviderOfT.cs @@ -1,4 +1,4 @@ -// +// // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics @@ -14,10 +14,8 @@ // copies of the Software, and to permit persons to whom the // Software is furnished to do so, subject to the following // conditions: -// // The above copyright notice and this permission notice shall be // included in all copies or substantial portions of the Software. -// // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, // EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES // OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND @@ -31,6 +29,8 @@ // INITIAL DRAFT MISSING EXCEPTION SPECIFICATIONS namespace MathNet.Numerics.Algorithms.LinearAlgebra { + using System.Numerics; + /// /// How to transpose a matrix. /// @@ -393,12 +393,12 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra /// Compute the singular U and VT vectors or not. /// On entry, the M by N matrix to decompose. On exit, A may be overwritten. /// The singular values of A in ascending value. - /// If is true, on exit U contains the left + /// If is true, on exit U contains the left /// singular vectors. - /// If is true, on exit VT contains the transposed + /// If is true, on exit VT contains the transposed /// right singular vectors. /// This is equivalent to the GESVD LAPACK routine. - void SinguarValueDecomposition(bool computeVectors, T[] a, T[] s, T[] u, T[] vt); + void SingularValueDecomposition(bool computeVectors, T[] a, T[] s, T[] u, T[] vt); /// /// Computes the singular value decomposition of A. @@ -406,9 +406,9 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra /// Compute the singular U and VT vectors or not. /// On entry, the M by N matrix to decompose. On exit, A may be overwritten. /// The singular values of A in ascending value. - /// If is true, on exit U contains the left + /// If is true, on exit U contains the left /// singular vectors. - /// If is true, on exit VT contains the transposed + /// If is true, on exit VT contains the transposed /// right singular vectors. /// The work array. For real matrices, the work array should be at least /// Max(3*Min(M, N) + Max(M, N), 5*Min(M,N)). For complex matrices, 2*Min(M, N) + Max(M, N). @@ -447,9 +447,9 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra /// Solves A*X=B for X using a previously SVD decomposed matrix. /// /// The number of columns of B. - /// The s values returned by . - /// The left singular vectors returned by . - /// The right singular vectors returned by . + /// The s values returned by . + /// The left singular vectors returned by . + /// The right singular vectors returned by . /// The B matrix. /// On exit, the solution matrix. void SvdSolveFactored(int columnsOfB, T[] s, T[] u, T[] vt, T[] b, T[] x); diff --git a/src/Numerics/Algorithms/LinearAlgebra/ManagedLinearAlgebraProvider.cs b/src/Numerics/Algorithms/LinearAlgebra/ManagedLinearAlgebraProvider.cs index c972edd1..1096fc20 100644 --- a/src/Numerics/Algorithms/LinearAlgebra/ManagedLinearAlgebraProvider.cs +++ b/src/Numerics/Algorithms/LinearAlgebra/ManagedLinearAlgebraProvider.cs @@ -1149,7 +1149,7 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra } } - public void SinguarValueDecomposition(bool computeVectors, double[] a, double[] s, double[] u, double[] vt) + public void SingularValueDecomposition(bool computeVectors, double[] a, double[] s, double[] u, double[] vt) { throw new NotImplementedException(); } @@ -1968,7 +1968,7 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra throw new NotImplementedException(); } - public void SinguarValueDecomposition(bool computeVectors, float[] a, float[] s, float[] u, float[] vt) + public void SingularValueDecomposition(bool computeVectors, float[] a, float[] s, float[] u, float[] vt) { throw new NotImplementedException(); } @@ -2759,7 +2759,7 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra throw new NotImplementedException(); } - public void SinguarValueDecomposition(bool computeVectors, Complex[] a, Complex[] s, Complex[] u, Complex[] vt) + public void SingularValueDecomposition(bool computeVectors, Complex[] a, Complex[] s, Complex[] u, Complex[] vt) { throw new NotImplementedException(); } @@ -3550,7 +3550,7 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra throw new NotImplementedException(); } - public void SinguarValueDecomposition(bool computeVectors, Complex32[] a, Complex32[] s, Complex32[] u, Complex32[] vt) + public void SingularValueDecomposition(bool computeVectors, Complex32[] a, Complex32[] s, Complex32[] u, Complex32[] vt) { throw new NotImplementedException(); } diff --git a/src/Numerics/Algorithms/LinearAlgebra/Mkl/MklLinearAlgebraProvider.cs b/src/Numerics/Algorithms/LinearAlgebra/Mkl/MklLinearAlgebraProvider.cs index dd855174..7f182f37 100644 --- a/src/Numerics/Algorithms/LinearAlgebra/Mkl/MklLinearAlgebraProvider.cs +++ b/src/Numerics/Algorithms/LinearAlgebra/Mkl/MklLinearAlgebraProvider.cs @@ -573,7 +573,7 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.Mkl /// If is true, on exit VT contains the transposed /// right singular vectors. /// This is equivalent to the GESVD LAPACK routine. - public void SinguarValueDecomposition(bool computeVectors, double[] a, double[] s, double[] u, double[] vt) + public void SingularValueDecomposition(bool computeVectors, double[] a, double[] s, double[] u, double[] vt) { throw new NotImplementedException(); } @@ -632,9 +632,9 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.Mkl /// Solves A*X=B for X using a previously SVD decomposed matrix. /// /// The number of columns of B. - /// The s values returned by . - /// The left singular vectors returned by . - /// The right singular vectors returned by . + /// The s values returned by . + /// The left singular vectors returned by . + /// The right singular vectors returned by . /// The B matrix. /// On exit, the solution matrix. public void SvdSolveFactored(int columnsOfB, double[] s, double[] u, double[] vt, double[] b, double[] x) @@ -1174,7 +1174,7 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.Mkl /// If is true, on exit VT contains the transposed /// right singular vectors. /// This is equivalent to the GESVD LAPACK routine. - public void SinguarValueDecomposition(bool computeVectors, float[] a, float[] s, float[] u, float[] vt) + public void SingularValueDecomposition(bool computeVectors, float[] a, float[] s, float[] u, float[] vt) { throw new NotImplementedException(); } @@ -1233,9 +1233,9 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.Mkl /// Solves A*X=B for X using a previously SVD decomposed matrix. /// /// The number of columns of B. - /// The s values returned by . - /// The left singular vectors returned by . - /// The right singular vectors returned by . + /// The s values returned by . + /// The left singular vectors returned by . + /// The right singular vectors returned by . /// The B matrix. /// On exit, the solution matrix. public void SvdSolveFactored(int columnsOfB, float[] s, float[] u, float[] vt, float[] b, float[] x) @@ -1775,7 +1775,7 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.Mkl /// If is true, on exit VT contains the transposed /// right singular vectors. /// This is equivalent to the GESVD LAPACK routine. - public void SinguarValueDecomposition(bool computeVectors, Complex[] a, Complex[] s, Complex[] u, Complex[] vt) + public void SingularValueDecomposition(bool computeVectors, Complex[] a, Complex[] s, Complex[] u, Complex[] vt) { throw new NotImplementedException(); } @@ -1834,9 +1834,9 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.Mkl /// Solves A*X=B for X using a previously SVD decomposed matrix. /// /// The number of columns of B. - /// The s values returned by . - /// The left singular vectors returned by . - /// The right singular vectors returned by . + /// The s values returned by . + /// The left singular vectors returned by . + /// The right singular vectors returned by . /// The B matrix. /// On exit, the solution matrix. public void SvdSolveFactored(int columnsOfB, Complex[] s, Complex[] u, Complex[] vt, Complex[] b, Complex[] x) @@ -2376,7 +2376,7 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.Mkl /// If is true, on exit VT contains the transposed /// right singular vectors. /// This is equivalent to the GESVD LAPACK routine. - public void SinguarValueDecomposition(bool computeVectors, Complex32[] a, Complex32[] s, Complex32[] u, Complex32[] vt) + public void SingularValueDecomposition(bool computeVectors, Complex32[] a, Complex32[] s, Complex32[] u, Complex32[] vt) { throw new NotImplementedException(); } @@ -2435,9 +2435,9 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.Mkl /// Solves A*X=B for X using a previously SVD decomposed matrix. /// /// The number of columns of B. - /// The s values returned by . - /// The left singular vectors returned by . - /// The right singular vectors returned by . + /// The s values returned by . + /// The left singular vectors returned by . + /// The right singular vectors returned by . /// The B matrix. /// On exit, the solution matrix. public void SvdSolveFactored(int columnsOfB, Complex32[] s, Complex32[] u, Complex32[] vt, Complex32[] b, Complex32[] x) diff --git a/src/Numerics/Algorithms/LinearAlgebra/NativeAlgebraProvider.include b/src/Numerics/Algorithms/LinearAlgebra/NativeAlgebraProvider.include index 18681b59..170f9ed5 100644 --- a/src/Numerics/Algorithms/LinearAlgebra/NativeAlgebraProvider.include +++ b/src/Numerics/Algorithms/LinearAlgebra/NativeAlgebraProvider.include @@ -588,7 +588,7 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.<#=library#> /// If is true, on exit VT contains the transposed /// right singular vectors. /// This is equivalent to the GESVD LAPACK routine. - public void SinguarValueDecomposition(bool computeVectors, double[] a, double[] s, double[] u, double[] vt) + public void SingularValueDecomposition(bool computeVectors, double[] a, double[] s, double[] u, double[] vt) { throw new NotImplementedException(); } @@ -647,9 +647,9 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.<#=library#> /// Solves A*X=B for X using a previously SVD decomposed matrix. /// /// The number of columns of B. - /// The s values returned by . - /// The left singular vectors returned by . - /// The right singular vectors returned by . + /// The s values returned by . + /// The left singular vectors returned by . + /// The right singular vectors returned by . /// The B matrix. /// On exit, the solution matrix. public void SvdSolveFactored(int columnsOfB, double[] s, double[] u, double[] vt, double[] b, double[] x) @@ -1201,7 +1201,7 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.<#=library#> /// If is true, on exit VT contains the transposed /// right singular vectors. /// This is equivalent to the GESVD LAPACK routine. - public void SinguarValueDecomposition(bool computeVectors, float[] a, float[] s, float[] u, float[] vt) + public void SingularValueDecomposition(bool computeVectors, float[] a, float[] s, float[] u, float[] vt) { throw new NotImplementedException(); } @@ -1260,9 +1260,9 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.<#=library#> /// Solves A*X=B for X using a previously SVD decomposed matrix. /// /// The number of columns of B. - /// The s values returned by . - /// The left singular vectors returned by . - /// The right singular vectors returned by . + /// The s values returned by . + /// The left singular vectors returned by . + /// The right singular vectors returned by . /// The B matrix. /// On exit, the solution matrix. public void SvdSolveFactored(int columnsOfB, float[] s, float[] u, float[] vt, float[] b, float[] x) @@ -1814,7 +1814,7 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.<#=library#> /// If is true, on exit VT contains the transposed /// right singular vectors. /// This is equivalent to the GESVD LAPACK routine. - public void SinguarValueDecomposition(bool computeVectors, Complex[] a, Complex[] s, Complex[] u, Complex[] vt) + public void SingularValueDecomposition(bool computeVectors, Complex[] a, Complex[] s, Complex[] u, Complex[] vt) { throw new NotImplementedException(); } @@ -1873,9 +1873,9 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.<#=library#> /// Solves A*X=B for X using a previously SVD decomposed matrix. /// /// The number of columns of B. - /// The s values returned by . - /// The left singular vectors returned by . - /// The right singular vectors returned by . + /// The s values returned by . + /// The left singular vectors returned by . + /// The right singular vectors returned by . /// The B matrix. /// On exit, the solution matrix. public void SvdSolveFactored(int columnsOfB, Complex[] s, Complex[] u, Complex[] vt, Complex[] b, Complex[] x) @@ -2427,7 +2427,7 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.<#=library#> /// If is true, on exit VT contains the transposed /// right singular vectors. /// This is equivalent to the GESVD LAPACK routine. - public void SinguarValueDecomposition(bool computeVectors, Complex32[] a, Complex32[] s, Complex32[] u, Complex32[] vt) + public void SingularValueDecomposition(bool computeVectors, Complex32[] a, Complex32[] s, Complex32[] u, Complex32[] vt) { throw new NotImplementedException(); } @@ -2486,9 +2486,9 @@ namespace MathNet.Numerics.Algorithms.LinearAlgebra.<#=library#> /// Solves A*X=B for X using a previously SVD decomposed matrix. /// /// The number of columns of B. - /// The s values returned by . - /// The left singular vectors returned by . - /// The right singular vectors returned by . + /// The s values returned by . + /// The left singular vectors returned by . + /// The right singular vectors returned by . /// The B matrix. /// On exit, the solution matrix. public void SvdSolveFactored(int columnsOfB, Complex32[] s, Complex32[] u, Complex32[] vt, Complex32[] b, Complex32[] x)