// // Math.NET Numerics, part of the Math.NET Project // http://mathnet.opensourcedotnet.info // Copyright (c) 2009 Math.NET // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation // files (the "Software"), to deal in the Software without // restriction, including without limitation the rights to use, // copy, modify, merge, publish, distribute, sublicense, and/or sell // 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 // NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT // HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, // WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING // FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR // OTHER DEALINGS IN THE SOFTWARE. // namespace MathNet.Numerics.Algorithms.LinearAlgebra { using System; using Properties; using Threading; /// /// The managed linear algebra provider. /// public class ManagedLinearAlgebraProvider : ILinearAlgebraProvider { #region ILinearAlgebraProvider Members /// /// Adds a scaled vector to another: y += alpha*x. /// /// The vector to update. /// The value to scale by. /// The vector to add to . /// This equivalent to the AXPY BLAS routine. public void AddVectorToScaledVector(double[] y, double alpha, double[] x) { if (y == null) { throw new ArgumentNullException("y"); } if (x == null) { throw new ArgumentNullException("x"); } if (y.Length != x.Length) { throw new ArgumentException(Resources.ArgumentVectorsSameLength); } if (alpha == 0.0) { return; } if (alpha == 1.0) { Parallel.For(0, y.Length, i => y[i] += x[i]); } else { Parallel.For(0, y.Length, i => y[i] += alpha * x[i]); } } /// /// Scales an array. Can be used to scale a vector and a matrix. /// /// The scalar. /// The values to scale. /// This is equivalent to the SCAL BLAS routine. public void ScaleArray(double alpha, double[] x) { if (alpha == 1.0) { return; } Parallel.For(0, x.Length, i => x[i] = alpha * x[i]); } public int QueryWorkspaceBlockSize(string methodName) { throw new NotImplementedException(); } public double DotProduct(double[] x, double[] y) { throw new NotImplementedException(); } public void AddArrays(double[] x, double[] y, double[] result) { throw new NotImplementedException(); } public void SubtractArrays(double[] x, double[] y, double[] result) { throw new NotImplementedException(); } public void PointWiseMultiplyArrays(double[] x, double[] y, double[] result) { throw new NotImplementedException(); } public double MatrixNorm(Norm norm, double[] matrix) { throw new NotImplementedException(); } public double MatrixNorm(Norm norm, double[] matrix, double[] work) { throw new NotImplementedException(); } public void MatrixMultiply(double[] x, double[] y, double[] result) { throw new NotImplementedException(); } public void MatrixMultiplyWithUpdate(Transpose transposeA, Transpose transposeB, double alpha, double[] a, double[] b, double beta, double[] c) { throw new NotImplementedException(); } public void LUFactor(double[] a, int[] ipiv) { throw new NotImplementedException(); } public void LUInverse(double[] a) { throw new NotImplementedException(); } public void LUInverseFactored(double[] a, int[] ipiv) { throw new NotImplementedException(); } public void LUInverse(double[] a, double[] work) { throw new NotImplementedException(); } public void LUInverseFactored(double[] a, int[] ipiv, double[] work) { throw new NotImplementedException(); } public void LUSolve(int columnsOfB, double[] a, double[] b) { throw new NotImplementedException(); } public void LUSolveFactored(int columnsOfB, double[] a, int ipiv, double[] b) { throw new NotImplementedException(); } public void LUSolve(Transpose transposeA, int columnsOfB, double[] a, double[] b) { throw new NotImplementedException(); } public void LUSolveFactored(Transpose transposeA, int columnsOfB, double[] a, int ipiv, double[] b) { throw new NotImplementedException(); } public void CholeskyFactor(double[] a) { throw new NotImplementedException(); } public void CholeskySolve(int columnsOfB, double[] a, double[] b) { throw new NotImplementedException(); } public void CholeskySolveFactored(int columnsOfB, double[] a, double[] b) { throw new NotImplementedException(); } public void QRFactor(double[] r, double[] q) { throw new NotImplementedException(); } public void QRFactor(double[] r, double[] q, double[] work) { throw new NotImplementedException(); } public void QRSolve(int columnsOfB, double[] q, double[] r, double[] b, double[] x) { throw new NotImplementedException(); } public void SinguarValueDecomposition(bool computeVectors, double[] a, double[] s, double[] u, double[] vt) { throw new NotImplementedException(); } public void SingularValueDecomposition( bool computeVectors, double[] a, double[] s, double[] u, double[] vt, double[] work) { throw new NotImplementedException(); } public void SvdSolve(double[] s, double[] u, double[] vt, double[] b, double[] x) { throw new NotImplementedException(); } #endregion } }