LA: phase out Matrix.CreateMatrix/CreateVector (no longer needed)

src/FSharp/LinearAlgebra.Matrix.fs

@@ -304,8 +304,8 @@ module Matrix =
         A.MapIndexedInplace((fun i j x -> f i j), true)
 
         /// Fold all columns into one row vector.
-    let inline foldByCol f acc (A: #Matrix<_>) =
-        let v = A.CreateVector(A.ColumnCount)
+    let inline foldByCol f acc (A: #Matrix<'T>) =
+        let v = Vector<'T>.Build.SameAs(A, A.ColumnCount)
         for k=0 to A.ColumnCount-1 do
             let mutable macc = acc
             for i=0 to A.RowCount-1 do
@@ -314,8 +314,8 @@ module Matrix =
         v :> _ Vector
 
     /// Fold all rows into one column vector.
-    let inline foldByRow f acc (A: #Matrix<_>) =
-        let v = A.CreateVector(A.RowCount)
+    let inline foldByRow f acc (A: #Matrix<'T>) =
+        let v = Vector<'T>.Build.SameAs(A, A.RowCount)
         for k=0 to A.RowCount-1 do
             let mutable macc = acc
             for i=0 to A.ColumnCount-1 do

src/Numerics/Distributions/InverseWishart.cs

@@ -187,18 +187,12 @@ namespace MathNet.Numerics.Distributions
         {
             get
             {
-                var res = _scale.CreateMatrix(_scale.RowCount, _scale.ColumnCount);
-                for (var i = 0; i < res.RowCount; i++)
+                return Matrix<double>.Build.Dense(_scale.RowCount, _scale.ColumnCount, (i, j) =>
                 {
-                    for (var j = 0; j < res.ColumnCount; j++)
-                    {
-                        var num1 = ((_freedom - _scale.RowCount + 1)*_scale.At(i, j)*_scale.At(i, j)) + ((_freedom - _scale.RowCount - 1)*_scale.At(i, i)*_scale.At(j, j));
-                        var num2 = (_freedom - _scale.RowCount)*(_freedom - _scale.RowCount - 1)*(_freedom - _scale.RowCount - 1)*(_freedom - _scale.RowCount - 3);
-                        res.At(i, j, num1/num2);
-                    }
-                }
-
-                return res;
+                    var num1 = ((_freedom - _scale.RowCount + 1)*_scale.At(i, j)*_scale.At(i, j)) + ((_freedom - _scale.RowCount - 1)*_scale.At(i, i)*_scale.At(j, j));
+                    var num2 = (_freedom - _scale.RowCount)*(_freedom - _scale.RowCount - 1)*(_freedom - _scale.RowCount - 1)*(_freedom - _scale.RowCount - 3);
+                    return num1/num2;
+                });
             }
         }
 

src/Numerics/Distributions/Wishart.cs

@@ -207,16 +207,8 @@ namespace MathNet.Numerics.Distributions
         {
             get
             {
-                var res = _scale.CreateMatrix(_scale.RowCount, _scale.ColumnCount);
-                for (var i = 0; i < res.RowCount; i++)
-                {
-                    for (var j = 0; j < res.ColumnCount; j++)
-                    {
-                        res.At(i, j, _degreesOfFreedom*((_scale.At(i, j)*_scale.At(i, j)) + (_scale.At(i, i)*_scale.At(j, j))));
-                    }
-                }
-
-                return res;
+                return Matrix<double>.Build.Dense(_scale.RowCount, _scale.ColumnCount,
+                    (i, j) => _degreesOfFreedom*((_scale.At(i, j)*_scale.At(i, j)) + (_scale.At(i, i)*_scale.At(j, j))));
             }
         }
 

src/Numerics/LinearAlgebra/Builder.cs

@@ -39,8 +39,6 @@ using MathNet.Numerics.LinearAlgebra.Storage;
 
 namespace MathNet.Numerics.LinearAlgebra.Double
 {
-    using Solvers;
-
     internal class MatrixBuilder : MatrixBuilder<double>
     {
         public override double Zero
@@ -116,8 +114,6 @@ namespace MathNet.Numerics.LinearAlgebra.Double
 
 namespace MathNet.Numerics.LinearAlgebra.Single
 {
-    using Solvers;
-
     internal class MatrixBuilder : MatrixBuilder<float>
     {
         public override float Zero
@@ -193,8 +189,6 @@ namespace MathNet.Numerics.LinearAlgebra.Single
 
 namespace MathNet.Numerics.LinearAlgebra.Complex
 {
-    using Solvers;
-
 #if NOSYSNUMERICS
     using Complex = Numerics.Complex;
 #else
@@ -276,8 +270,6 @@ namespace MathNet.Numerics.LinearAlgebra.Complex
 
 namespace MathNet.Numerics.LinearAlgebra.Complex32
 {
-    using Solvers;
-
     internal class MatrixBuilder : MatrixBuilder<Numerics.Complex32>
     {
         public override Numerics.Complex32 Zero
@@ -399,28 +391,52 @@ namespace MathNet.Numerics.LinearAlgebra
         /// <summary>
         /// Create a new matrix with the same kind of the provided example.
         /// </summary>
-        public Matrix<T> SameType(Matrix<T> example, int rows, int columns)
+        public Matrix<T> SameAs(Matrix<T> example, int rows, int columns, bool fullyMutable = false)
         {
             var storage = example.Storage;
             if (storage is DenseColumnMajorMatrixStorage<T>) return Dense(rows, columns);
-            if (storage is DiagonalMatrixStorage<T>) return Diagonal(rows, columns);
+            if (!fullyMutable && storage is DiagonalMatrixStorage<T>) return Diagonal(rows, columns);
             if (storage is SparseCompressedRowMatrixStorage<T>) return Sparse(rows, columns);
             return Dense(rows, columns);
         }
 
+        /// <summary>
+        /// Create a new matrix with the same kind and dimensions of the provided example.
+        /// </summary>
+        public Matrix<T> SameAs(Matrix<T> example)
+        {
+            return SameAs(example, example.RowCount, example.ColumnCount);
+        }
+
+        /// <summary>
+        /// Create a new matrix with the same kind of the provided example.
+        /// </summary>
+        public Matrix<T> SameAs(Vector<T> example, int rows, int columns)
+        {
+            return example.Storage.IsDense ? Dense(rows, columns) : Sparse(rows, columns);
+        }
+
         /// <summary>
         /// Create a new matrix with a type that can represent and is closest to both provided samples.
         /// </summary>
-        public Matrix<T> SameType(Matrix<T> example1, Matrix<T> example2 , int rows, int columns)
+        public Matrix<T> SameAs(Matrix<T> example, Matrix<T> otherExample, int rows, int columns, bool fullyMutable = false)
         {
-            var storage1 = example1.Storage;
-            var storage2 = example2.Storage;
+            var storage1 = example.Storage;
+            var storage2 = otherExample.Storage;
             if (storage1 is DenseColumnMajorMatrixStorage<T> || storage2 is DenseColumnMajorMatrixStorage<T>) return Dense(rows, columns);
-            if (storage1 is DiagonalMatrixStorage<T> && storage2 is DiagonalMatrixStorage<T>) return Diagonal(rows, columns);
+            if (!fullyMutable && storage1 is DiagonalMatrixStorage<T> && storage2 is DiagonalMatrixStorage<T>) return Diagonal(rows, columns);
             if (storage1 is SparseCompressedRowMatrixStorage<T> || storage2 is SparseCompressedRowMatrixStorage<T>) return Sparse(rows, columns);
             return Dense(rows, columns);
         }
 
+        /// <summary>
+        /// Create a new matrix with a type that can represent and is closest to both provided samples and the dimensions of example.
+        /// </summary>
+        public Matrix<T> SameAs(Matrix<T> example, Matrix<T> otherExample)
+        {
+            return SameAs(example, otherExample, example.RowCount, example.ColumnCount);
+        }
+
         /// <summary>
         /// Create a new dense matrix with values sampled from the provided random distribution.
         /// </summary>
@@ -1278,7 +1294,23 @@ namespace MathNet.Numerics.LinearAlgebra
         /// <summary>
         /// Create a new vector with the same kind of the provided example.
         /// </summary>
-        public Vector<T> SameType(Vector<T> example, int length)
+        public Vector<T> SameAs(Vector<T> example, int length)
+        {
+            return example.Storage.IsDense ? Dense(length) : Sparse(length);
+        }
+
+        /// <summary>
+        /// Create a new vector with the same kind and dimension of the provided example.
+        /// </summary>
+        public Vector<T> SameAs(Vector<T> example)
+        {
+            return example.Storage.IsDense ? Dense(example.Count) : Sparse(example.Count);
+        }
+
+        /// <summary>
+        /// Create a new vector with the same kind of the provided example.
+        /// </summary>
+        public Vector<T> SameAs(Matrix<T> example, int length)
         {
             return example.Storage.IsDense ? Dense(length) : Sparse(length);
         }
@@ -1286,9 +1318,17 @@ namespace MathNet.Numerics.LinearAlgebra
         /// <summary>
         /// Create a new vector with a type that can represent and is closest to both provided samples.
         /// </summary>
-        public Vector<T> SameType(Vector<T> example1, Vector<T> example2, int length)
+        public Vector<T> SameAs(Vector<T> example, Vector<T> otherExample, int length)
+        {
+            return example.Storage.IsDense || otherExample.Storage.IsDense ? Dense(length) : Sparse(length);
+        }
+
+        /// <summary>
+        /// Create a new vector with a type that can represent and is closest to both provided samples and the dimensions of example.
+        /// </summary>
+        public Vector<T> SameAs(Vector<T> example, Vector<T> otherExample)
         {
-            return example1.Storage.IsDense || example2.Storage.IsDense ? Dense(length) : Sparse(length);
+            return example.Storage.IsDense || otherExample.Storage.IsDense ? Dense(example.Count) : Sparse(example.Count);
         }
 
         /// <summary>

src/Numerics/LinearAlgebra/Complex/Factorization/UserEvd.cs

@@ -75,7 +75,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex.Factorization
 
             // Initialize matricies for eigenvalues and eigenvectors
             var eigenVectors = DenseMatrix.CreateIdentity(order);
-            var blockDiagonal = matrix.CreateMatrix(order, order);
+            var blockDiagonal = Matrix<Complex>.Build.SameAs(matrix, order, order);
             var eigenValues = new DenseVector(order);
 
             var isSymmetric = true;

src/Numerics/LinearAlgebra/Complex/Factorization/UserGramSchmidt.cs

@@ -65,7 +65,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex.Factorization
             }
 
             var q = matrix.Clone();
-            var r = matrix.CreateMatrix(matrix.ColumnCount, matrix.ColumnCount);
+            var r = Matrix<Complex>.Build.SameAs(matrix, matrix.ColumnCount, matrix.ColumnCount);
 
             for (var k = 0; k < q.ColumnCount; k++)
             {

src/Numerics/LinearAlgebra/Complex/Factorization/UserLU.cs

@@ -302,7 +302,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex.Factorization
         public override Matrix<Complex> Inverse()
         {
             var order = Factors.RowCount;
-            var inverse = Factors.CreateMatrix(order, order);
+            var inverse = Matrix<Complex>.Build.SameAs(Factors, order, order);
             for (var i = 0; i < order; i++)
             {
                 inverse.At(i, i, 1.0);

src/Numerics/LinearAlgebra/Complex/Factorization/UserQR.cs

@@ -77,7 +77,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex.Factorization
             if (method == QRMethod.Full)
             {
                 r = matrix.Clone();
-                q = matrix.CreateMatrix(matrix.RowCount, matrix.RowCount);
+                q = Matrix<Complex>.Build.SameAs(matrix, matrix.RowCount, matrix.RowCount);
 
                 for (var i = 0; i < matrix.RowCount; i++)
                 {

src/Numerics/LinearAlgebra/Complex/Factorization/UserSvd.cs

@@ -69,9 +69,9 @@ namespace MathNet.Numerics.LinearAlgebra.Complex.Factorization
             var nm = Math.Min(matrix.RowCount + 1, matrix.ColumnCount);
             var matrixCopy = matrix.Clone();
 
-            var s = matrixCopy.CreateVector(nm);
-            var u = matrixCopy.CreateMatrix(matrixCopy.RowCount, matrixCopy.RowCount);
-            var vt = matrixCopy.CreateMatrix(matrixCopy.ColumnCount, matrixCopy.ColumnCount);
+            var s = Vector<Complex>.Build.SameAs(matrixCopy, nm);
+            var u = Matrix<Complex>.Build.SameAs(matrixCopy, matrixCopy.RowCount, matrixCopy.RowCount);
+            var vt = Matrix<Complex>.Build.SameAs(matrixCopy, matrixCopy.ColumnCount, matrixCopy.ColumnCount);
 
             const int maxiter = 1000;
             var e = new Complex[matrixCopy.ColumnCount];
@@ -592,7 +592,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex.Factorization
             if (matrixCopy.RowCount < matrixCopy.ColumnCount)
             {
                 nm--;
-                var tmp = matrixCopy.CreateVector(nm);
+                var tmp = Vector<Complex>.Build.SameAs(matrixCopy, nm);
                 for (i = 0; i < nm; i++)
                 {
                     tmp[i] = s[i];

src/Numerics/LinearAlgebra/Complex/Matrix.cs

@@ -112,7 +112,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex
         /// <returns>The conjugate transpose of this matrix.</returns>
         public override Matrix<Complex> ConjugateTranspose()
         {
-            var ret = CreateMatrix(ColumnCount, RowCount);
+            var ret = Build.SameAs(this, ColumnCount, RowCount);
             for (var j = 0; j < ColumnCount; j++)
             {
                 for (var i = 0; i < RowCount; i++)

src/Numerics/LinearAlgebra/Complex/SparseMatrix.cs

@@ -382,7 +382,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex
         /// <returns>The lower triangle of this matrix.</returns>
         public override Matrix<Complex> LowerTriangle()
         {
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             LowerTriangleImpl(result);
             return result;
         }
@@ -407,7 +407,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex
 
             if (ReferenceEquals(this, result))
             {
-                var tmp = result.CreateMatrix(result.RowCount, result.ColumnCount);
+                var tmp = Build.SameAs(result);
                 LowerTriangle(tmp);
                 tmp.CopyTo(result);
             }
@@ -447,7 +447,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex
         /// <returns>The upper triangle of this matrix.</returns>
         public override Matrix<Complex> UpperTriangle()
         {
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             UpperTriangleImpl(result);
             return result;
         }
@@ -472,7 +472,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex
 
             if (ReferenceEquals(this, result))
             {
-                var tmp = result.CreateMatrix(result.RowCount, result.ColumnCount);
+                var tmp = Build.SameAs(result);
                 UpperTriangle(tmp);
                 tmp.CopyTo(result);
             }
@@ -513,7 +513,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex
         /// <returns>The lower triangle of this matrix.</returns>
         public override Matrix<Complex> StrictlyLowerTriangle()
         {
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             StrictlyLowerTriangleImpl(result);
             return result;
         }
@@ -538,7 +538,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex
 
             if (ReferenceEquals(this, result))
             {
-                var tmp = result.CreateMatrix(result.RowCount, result.ColumnCount);
+                var tmp = Build.SameAs(result);
                 StrictlyLowerTriangle(tmp);
                 tmp.CopyTo(result);
             }
@@ -579,7 +579,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex
         /// <returns>The upper triangle of this matrix.</returns>
         public override Matrix<Complex> StrictlyUpperTriangle()
         {
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             StrictlyUpperTriangleImpl(result);
             return result;
         }
@@ -604,7 +604,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex
 
             if (ReferenceEquals(this, result))
             {
-                var tmp = result.CreateMatrix(result.RowCount, result.ColumnCount);
+                var tmp = Build.SameAs(result);
                 StrictlyUpperTriangle(tmp);
                 tmp.CopyTo(result);
             }

src/Numerics/LinearAlgebra/Complex32/Factorization/UserEvd.cs

@@ -74,7 +74,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32.Factorization
 
             // Initialize matricies for eigenvalues and eigenvectors
             var eigenVectors = DenseMatrix.CreateIdentity(order);
-            var blockDiagonal = matrix.CreateMatrix(order, order);
+            var blockDiagonal = Matrix<Complex32>.Build.SameAs(matrix, order, order);
             var eigenValues = new LinearAlgebra.Complex.DenseVector(order);
 
             var isSymmetric = true;

src/Numerics/LinearAlgebra/Complex32/Factorization/UserGramSchmidt.cs

@@ -60,7 +60,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32.Factorization
             }
 
             var q = matrix.Clone();
-            var r = matrix.CreateMatrix(matrix.ColumnCount, matrix.ColumnCount);
+            var r = Matrix<Complex32>.Build.SameAs(matrix, matrix.ColumnCount, matrix.ColumnCount);
 
             for (var k = 0; k < q.ColumnCount; k++)
             {

src/Numerics/LinearAlgebra/Complex32/Factorization/UserLU.cs

@@ -297,7 +297,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32.Factorization
         public override Matrix<Complex32> Inverse()
         {
             var order = Factors.RowCount;
-            var inverse = Factors.CreateMatrix(order, order);
+            var inverse = Matrix<Complex32>.Build.SameAs(Factors, order, order);
             for (var i = 0; i < order; i++)
             {
                 inverse.At(i, i, 1.0f);

src/Numerics/LinearAlgebra/Complex32/Factorization/UserQR.cs

@@ -72,7 +72,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32.Factorization
             if (method == QRMethod.Full)
             {
                 r = matrix.Clone();
-                q = matrix.CreateMatrix(matrix.RowCount, matrix.RowCount);
+                q = Matrix<Complex32>.Build.SameAs(matrix, matrix.RowCount, matrix.RowCount);
 
                 for (var i = 0; i < matrix.RowCount; i++)
                 {

src/Numerics/LinearAlgebra/Complex32/Factorization/UserSvd.cs

@@ -64,9 +64,9 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32.Factorization
             var nm = Math.Min(matrix.RowCount + 1, matrix.ColumnCount);
             var matrixCopy = matrix.Clone();
 
-            var s = matrixCopy.CreateVector(nm);
-            var u = matrixCopy.CreateMatrix(matrixCopy.RowCount, matrixCopy.RowCount);
-            var vt = matrixCopy.CreateMatrix(matrixCopy.ColumnCount, matrixCopy.ColumnCount);
+            var s = Vector<Complex32>.Build.SameAs(matrixCopy, nm);
+            var u = Matrix<Complex32>.Build.SameAs(matrixCopy, matrixCopy.RowCount, matrixCopy.RowCount);
+            var vt = Matrix<Complex32>.Build.SameAs(matrixCopy, matrixCopy.ColumnCount, matrixCopy.ColumnCount);
 
             const int maxiter = 1000;
             var e = new Complex32[matrixCopy.ColumnCount];
@@ -587,7 +587,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32.Factorization
             if (matrixCopy.RowCount < matrixCopy.ColumnCount)
             {
                 nm--;
-                var tmp = matrixCopy.CreateVector(nm);
+                var tmp = Vector<Complex32>.Build.SameAs(matrixCopy, nm);
                 for (i = 0; i < nm; i++)
                 {
                     tmp[i] = s[i];

src/Numerics/LinearAlgebra/Complex32/Matrix.cs

@@ -106,7 +106,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32
         /// <returns>The conjugate transpose of this matrix.</returns>
         public override Matrix<Complex32> ConjugateTranspose()
         {
-            var ret = CreateMatrix(ColumnCount, RowCount);
+            var ret = Build.SameAs(this, ColumnCount, RowCount);
             for (var j = 0; j < ColumnCount; j++)
             {
                 for (var i = 0; i < RowCount; i++)

src/Numerics/LinearAlgebra/Complex32/SparseMatrix.cs

@@ -377,7 +377,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32
         /// <returns>The lower triangle of this matrix.</returns>
         public override Matrix<Complex32> LowerTriangle()
         {
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             LowerTriangleImpl(result);
             return result;
         }
@@ -402,7 +402,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32
 
             if (ReferenceEquals(this, result))
             {
-                var tmp = result.CreateMatrix(result.RowCount, result.ColumnCount);
+                var tmp = Build.SameAs(result);
                 LowerTriangle(tmp);
                 tmp.CopyTo(result);
             }
@@ -442,7 +442,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32
         /// <returns>The upper triangle of this matrix.</returns>
         public override Matrix<Complex32> UpperTriangle()
         {
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             UpperTriangleImpl(result);
             return result;
         }
@@ -467,7 +467,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32
 
             if (ReferenceEquals(this, result))
             {
-                var tmp = result.CreateMatrix(result.RowCount, result.ColumnCount);
+                var tmp = Build.SameAs(result);
                 UpperTriangle(tmp);
                 tmp.CopyTo(result);
             }
@@ -508,7 +508,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32
         /// <returns>The lower triangle of this matrix.</returns>
         public override Matrix<Complex32> StrictlyLowerTriangle()
         {
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             StrictlyLowerTriangleImpl(result);
             return result;
         }
@@ -533,7 +533,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32
 
             if (ReferenceEquals(this, result))
             {
-                var tmp = result.CreateMatrix(result.RowCount, result.ColumnCount);
+                var tmp = Build.SameAs(result);
                 StrictlyLowerTriangle(tmp);
                 tmp.CopyTo(result);
             }
@@ -574,7 +574,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32
         /// <returns>The upper triangle of this matrix.</returns>
         public override Matrix<Complex32> StrictlyUpperTriangle()
         {
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             StrictlyUpperTriangleImpl(result);
             return result;
         }
@@ -599,7 +599,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32
 
             if (ReferenceEquals(this, result))
             {
-                var tmp = result.CreateMatrix(result.RowCount, result.ColumnCount);
+                var tmp = Build.SameAs(result);
                 StrictlyUpperTriangle(tmp);
                 tmp.CopyTo(result);
             }

src/Numerics/LinearAlgebra/Double/Factorization/UserEvd.cs

@@ -74,8 +74,8 @@ namespace MathNet.Numerics.LinearAlgebra.Double.Factorization
             var order = matrix.RowCount;
 
             // Initialize matricies for eigenvalues and eigenvectors
-            var eigenVectors = matrix.CreateMatrix(order, order);
-            var blockDiagonal = matrix.CreateMatrix(order, order);
+            var eigenVectors = Matrix<double>.Build.SameAs(matrix, order, order);
+            var blockDiagonal = Matrix<double>.Build.SameAs(matrix, order, order);
             var eigenValues = new LinearAlgebra.Complex.DenseVector(order);
 
             var isSymmetric = true;

src/Numerics/LinearAlgebra/Double/Factorization/UserGramSchmidt.cs

@@ -58,7 +58,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double.Factorization
             }
 
             var q = matrix.Clone();
-            var r = matrix.CreateMatrix(matrix.ColumnCount, matrix.ColumnCount);
+            var r = Matrix<double>.Build.SameAs(matrix, matrix.ColumnCount, matrix.ColumnCount);
 
             for (var k = 0; k < q.ColumnCount; k++)
             {

src/Numerics/LinearAlgebra/Double/Factorization/UserLU.cs

@@ -295,7 +295,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double.Factorization
         public override Matrix<double> Inverse()
         {
             var order = Factors.RowCount;
-            var inverse = Factors.CreateMatrix(order, order);
+            var inverse = Matrix<double>.Build.SameAs(Factors, order, order);
             for (var i = 0; i < order; i++)
             {
                 inverse.At(i, i, 1.0);

src/Numerics/LinearAlgebra/Double/Factorization/UserQR.cs

@@ -70,7 +70,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double.Factorization
             if (method == QRMethod.Full)
             {
                 r = matrix.Clone();
-                q = matrix.CreateMatrix(matrix.RowCount, matrix.RowCount);
+                q = Matrix<double>.Build.SameAs(matrix, matrix.RowCount, matrix.RowCount);
 
                 for (var i = 0; i < matrix.RowCount; i++)
                 {

src/Numerics/LinearAlgebra/Double/Factorization/UserSvd.cs

@@ -62,9 +62,9 @@ namespace MathNet.Numerics.LinearAlgebra.Double.Factorization
             var nm = Math.Min(matrix.RowCount + 1, matrix.ColumnCount);
             var matrixCopy = matrix.Clone();
 
-            var s = matrixCopy.CreateVector(nm);
-            var u = matrixCopy.CreateMatrix(matrixCopy.RowCount, matrixCopy.RowCount);
-            var vt = matrixCopy.CreateMatrix(matrixCopy.ColumnCount, matrixCopy.ColumnCount);
+            var s = Vector<double>.Build.SameAs(matrixCopy, nm);
+            var u = Matrix<double>.Build.SameAs(matrixCopy, matrixCopy.RowCount, matrixCopy.RowCount);
+            var vt = Matrix<double>.Build.SameAs(matrixCopy, matrixCopy.ColumnCount, matrixCopy.ColumnCount);
 
             const int maxiter = 1000;
             var e = new double[matrixCopy.ColumnCount];
@@ -570,7 +570,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double.Factorization
             if (matrixCopy.RowCount < matrixCopy.ColumnCount)
             {
                 nm--;
-                var tmp = matrixCopy.CreateVector(nm);
+                var tmp = Vector<double>.Build.SameAs(matrixCopy, nm);
                 for (i = 0; i < nm; i++)
                 {
                     tmp[i] = s[i];

src/Numerics/LinearAlgebra/Double/SparseMatrix.cs

@@ -375,7 +375,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double
         /// <returns>The lower triangle of this matrix.</returns>
         public override Matrix<double> LowerTriangle()
         {
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             LowerTriangleImpl(result);
             return result;
         }
@@ -400,7 +400,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double
 
             if (ReferenceEquals(this, result))
             {
-                var tmp = result.CreateMatrix(result.RowCount, result.ColumnCount);
+                var tmp = Build.SameAs(result);
                 LowerTriangle(tmp);
                 tmp.CopyTo(result);
             }
@@ -440,7 +440,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double
         /// <returns>The upper triangle of this matrix.</returns>
         public override Matrix<double> UpperTriangle()
         {
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             UpperTriangleImpl(result);
             return result;
         }
@@ -465,7 +465,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double
 
             if (ReferenceEquals(this, result))
             {
-                var tmp = result.CreateMatrix(result.RowCount, result.ColumnCount);
+                var tmp = Build.SameAs(result);
                 UpperTriangle(tmp);
                 tmp.CopyTo(result);
             }
@@ -506,7 +506,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double
         /// <returns>The lower triangle of this matrix.</returns>
         public override Matrix<double> StrictlyLowerTriangle()
         {
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             StrictlyLowerTriangleImpl(result);
             return result;
         }
@@ -531,7 +531,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double
 
             if (ReferenceEquals(this, result))
             {
-                var tmp = result.CreateMatrix(result.RowCount, result.ColumnCount);
+                var tmp = Build.SameAs(result);
                 StrictlyLowerTriangle(tmp);
                 tmp.CopyTo(result);
             }
@@ -572,7 +572,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double
         /// <returns>The upper triangle of this matrix.</returns>
         public override Matrix<double> StrictlyUpperTriangle()
         {
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             StrictlyUpperTriangleImpl(result);
             return result;
         }
@@ -597,7 +597,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double
 
             if (ReferenceEquals(this, result))
             {
-                var tmp = result.CreateMatrix(result.RowCount, result.ColumnCount);
+                var tmp = Build.SameAs(result);
                 StrictlyUpperTriangle(tmp);
                 tmp.CopyTo(result);
             }

src/Numerics/LinearAlgebra/Factorization/Cholesky.cs

@@ -72,7 +72,7 @@ namespace MathNet.Numerics.LinearAlgebra.Factorization
         /// <returns>The left hand side <see cref="Matrix{T}"/>, <b>X</b>.</returns>
         public virtual Matrix<T> Solve(Matrix<T> input)
         {
-            var x = input.CreateMatrix(input.RowCount, input.ColumnCount);
+            var x = Matrix<T>.Build.SameAs(input, input.RowCount, input.ColumnCount);
             Solve(input, x);
             return x;
         }
@@ -91,7 +91,7 @@ namespace MathNet.Numerics.LinearAlgebra.Factorization
         /// <returns>The left hand side <see cref="Vector{T}"/>, <b>x</b>.</returns>
         public virtual Vector<T> Solve(Vector<T> input)
         {
-            var x = input.CreateVector(input.Count);
+            var x = Vector<T>.Build.SameAs(input, input.Count);
             Solve(input, x);
             return x;
         }

src/Numerics/LinearAlgebra/Factorization/Evd.cs

@@ -109,9 +109,9 @@ namespace MathNet.Numerics.LinearAlgebra.Factorization
         /// <returns>The left hand side <see cref="Matrix{T}"/>, <b>X</b>.</returns>
         public virtual Matrix<T> Solve(Matrix<T> input)
         {
-            var result = EigenVectors.CreateMatrix(EigenVectors.ColumnCount, input.ColumnCount);
-            Solve(input, result);
-            return result;
+            var x = Matrix<T>.Build.SameAs(EigenVectors, EigenVectors.ColumnCount, input.ColumnCount);
+            Solve(input, x);
+            return x;
         }
 
         /// <summary>
@@ -128,7 +128,7 @@ namespace MathNet.Numerics.LinearAlgebra.Factorization
         /// <returns>The left hand side <see cref="Vector{T}"/>, <b>x</b>.</returns>
         public virtual Vector<T> Solve(Vector<T> input)
         {
-            var x = EigenVectors.CreateVector(EigenVectors.ColumnCount);
+            var x = Vector<T>.Build.SameAs(EigenVectors, EigenVectors.ColumnCount);
             Solve(input, x);
             return x;
         }

src/Numerics/LinearAlgebra/Factorization/LU.cs

@@ -111,7 +111,7 @@ namespace MathNet.Numerics.LinearAlgebra.Factorization
         /// <returns>The left hand side <see cref="Matrix{T}"/>, <b>X</b>.</returns>
         public virtual Matrix<T> Solve(Matrix<T> input)
         {
-            var x = input.CreateMatrix(input.RowCount, input.ColumnCount);
+            var x = Matrix<T>.Build.SameAs(input, input.RowCount, input.ColumnCount);
             Solve(input, x);
             return x;
         }
@@ -130,7 +130,7 @@ namespace MathNet.Numerics.LinearAlgebra.Factorization
         /// <returns>The left hand side <see cref="Vector{T}"/>, <b>x</b>.</returns>
         public virtual Vector<T> Solve(Vector<T> input)
         {
-            var x = input.CreateVector(input.Count);
+            var x = Vector<T>.Build.SameAs(input, input.Count);
             Solve(input, x);
             return x;
         }

src/Numerics/LinearAlgebra/Factorization/QR.cs

@@ -109,9 +109,9 @@ namespace MathNet.Numerics.LinearAlgebra.Factorization
         /// <returns>The left hand side <see cref="Matrix{T}"/>, <b>X</b>.</returns>
         public virtual Matrix<T> Solve(Matrix<T> input)
         {
-            var matrixX = input.CreateMatrix(FullR.ColumnCount, input.ColumnCount);
-            Solve(input, matrixX);
-            return matrixX;
+            var x = Matrix<T>.Build.SameAs(input, FullR.ColumnCount, input.ColumnCount);
+            Solve(input, x);
+            return x;
         }
 
         /// <summary>
@@ -128,7 +128,7 @@ namespace MathNet.Numerics.LinearAlgebra.Factorization
         /// <returns>The left hand side <see cref="Vector{T}"/>, <b>x</b>.</returns>
         public virtual Vector<T> Solve(Vector<T> input)
         {
-            var x = input.CreateVector(FullR.ColumnCount);
+            var x = Vector<T>.Build.SameAs(input, FullR.ColumnCount);
             Solve(input, x);
             return x;
         }

src/Numerics/LinearAlgebra/Factorization/Svd.cs

@@ -71,7 +71,7 @@ namespace MathNet.Numerics.LinearAlgebra.Factorization
         {
             var rows = U.RowCount;
             var columns = VT.ColumnCount;
-            var result = U.CreateMatrix(rows, columns);
+            var result = Matrix<T>.Build.SameAs(U, rows, columns);
             for (var i = 0; i < rows; i++)
             {
                 for (var j = 0; j < columns; j++)
@@ -145,9 +145,9 @@ namespace MathNet.Numerics.LinearAlgebra.Factorization
                 throw new InvalidOperationException(Resources.SingularVectorsNotComputed);
             }
 
-            var result = U.CreateMatrix(VT.ColumnCount, input.ColumnCount);
-            Solve(input, result);
-            return result;
+            var x = Matrix<T>.Build.SameAs(U, VT.ColumnCount, input.ColumnCount);
+            Solve(input, x);
+            return x;
         }
 
         /// <summary>
@@ -169,7 +169,7 @@ namespace MathNet.Numerics.LinearAlgebra.Factorization
                 throw new InvalidOperationException(Resources.SingularVectorsNotComputed);
             }
 
-            var x = U.CreateVector(VT.ColumnCount);
+            var x = Vector<T>.Build.SameAs(U, VT.ColumnCount);
             Solve(input, x);
             return x;
         }

src/Numerics/LinearAlgebra/Matrix.Arithmetic.cs

@@ -204,7 +204,7 @@ namespace MathNet.Numerics.LinearAlgebra
                 return Clone();
             }
 
-            var result = Build.SameType(this, RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             DoAdd(scalar, result);
             return result;
         }
@@ -244,7 +244,7 @@ namespace MathNet.Numerics.LinearAlgebra
                 throw DimensionsDontMatch<ArgumentOutOfRangeException>(this, other);
             }
 
-            var result = Build.SameType(this, other, RowCount, ColumnCount);
+            var result = Build.SameAs(this, other, RowCount, ColumnCount);
             DoAdd(other, result);
             return result;
         }
@@ -282,7 +282,7 @@ namespace MathNet.Numerics.LinearAlgebra
                 return Clone();
             }
 
-            var result = Build.SameType(this, RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             DoSubtract(scalar, result);
             return result;
         }
@@ -316,7 +316,7 @@ namespace MathNet.Numerics.LinearAlgebra
         /// <returns>A new matrix containing the subtraction of the scalar and this matrix.</returns>
         public Matrix<T> SubtractFrom(T scalar)
         {
-            var result = Build.SameType(this, RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             DoSubtractFrom(scalar, result);
             return result;
         }
@@ -350,7 +350,7 @@ namespace MathNet.Numerics.LinearAlgebra
                 throw DimensionsDontMatch<ArgumentOutOfRangeException>(this, other);
             }
 
-            var result = Build.SameType(this, other, RowCount, ColumnCount);
+            var result = Build.SameAs(this, other, RowCount, ColumnCount);
             DoSubtract(other, result);
             return result;
         }
@@ -390,10 +390,10 @@ namespace MathNet.Numerics.LinearAlgebra
 
             if (scalar.Equals(Zero))
             {
-                return CreateMatrix(RowCount, ColumnCount);
+                return Build.SameAs(this);
             }
 
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             DoMultiply(scalar, result);
             return result;
         }
@@ -448,7 +448,7 @@ namespace MathNet.Numerics.LinearAlgebra
                 throw new DivideByZeroException();
             }
 
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             DoDivide(scalar, result);
             return result;
         }
@@ -492,7 +492,7 @@ namespace MathNet.Numerics.LinearAlgebra
         /// <returns>The result of the division.</returns>
         public Matrix<T> DivideByThis(T scalar)
         {
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             DoDivideByThis(scalar, result);
             return result;
         }
@@ -531,7 +531,7 @@ namespace MathNet.Numerics.LinearAlgebra
                 throw DimensionsDontMatch<ArgumentException>(this, rightSide, "rightSide");
             }
 
-            var ret = CreateVector(RowCount);
+            var ret = Vector<T>.Build.SameAs(this, RowCount);
             DoMultiply(rightSide, ret);
             return ret;
         }
@@ -580,7 +580,7 @@ namespace MathNet.Numerics.LinearAlgebra
                 throw DimensionsDontMatch<ArgumentException>(this, leftSide, "leftSide");
             }
 
-            var ret = CreateVector(ColumnCount);
+            var ret = Vector<T>.Build.SameAs(this, ColumnCount);
             DoLeftMultiply(leftSide, ret);
             return ret;
         }
@@ -642,7 +642,7 @@ namespace MathNet.Numerics.LinearAlgebra
 
             if (ReferenceEquals(this, result) || ReferenceEquals(other, result))
             {
-                var tmp = Build.SameType(result, result.RowCount, result.ColumnCount);
+                var tmp = Build.SameAs(result);
                 DoMultiply(other, tmp);
                 tmp.CopyTo(result);
             }
@@ -665,7 +665,7 @@ namespace MathNet.Numerics.LinearAlgebra
                 throw DimensionsDontMatch<ArgumentException>(this, other);
             }
 
-            var result = Build.SameType(this, other, RowCount, other.ColumnCount);
+            var result = Build.SameAs(this, other, RowCount, other.ColumnCount);
             DoMultiply(other, result);
             return result;
         }
@@ -686,7 +686,7 @@ namespace MathNet.Numerics.LinearAlgebra
 
             if (ReferenceEquals(this, result) || ReferenceEquals(other, result))
             {
-                var tmp = Build.SameType(result, result.RowCount, result.ColumnCount);
+                var tmp = Build.SameAs(result);
                 DoTransposeAndMultiply(other, tmp);
                 tmp.CopyTo(result);
             }
@@ -709,7 +709,7 @@ namespace MathNet.Numerics.LinearAlgebra
                 throw DimensionsDontMatch<ArgumentException>(this, other);
             }
 
-            var result = Build.SameType(this, other, RowCount, other.RowCount);
+            var result = Build.SameAs(this, other, RowCount, other.RowCount);
             DoTransposeAndMultiply(other, result);
             return result;
         }
@@ -727,7 +727,7 @@ namespace MathNet.Numerics.LinearAlgebra
                 throw DimensionsDontMatch<ArgumentException>(this, rightSide, "rightSide");
             }
 
-            var result = CreateVector(ColumnCount);
+            var result = Vector<T>.Build.SameAs(this, ColumnCount);
             DoTransposeThisAndMultiply(rightSide, result);
             return result;
         }
@@ -779,7 +779,7 @@ namespace MathNet.Numerics.LinearAlgebra
 
             if (ReferenceEquals(this, result) || ReferenceEquals(other, result))
             {
-                var tmp = Build.SameType(result, result.RowCount, result.ColumnCount);
+                var tmp = Build.SameAs(result);
                 DoTransposeThisAndMultiply(other, tmp);
                 tmp.CopyTo(result);
             }
@@ -802,7 +802,7 @@ namespace MathNet.Numerics.LinearAlgebra
                 throw DimensionsDontMatch<ArgumentException>(this, other);
             }
 
-            var result = Build.SameType(this, other, ColumnCount, other.ColumnCount);
+            var result = Build.SameAs(this, other, ColumnCount, other.ColumnCount);
             DoTransposeThisAndMultiply(other, result);
             return result;
         }
@@ -813,7 +813,7 @@ namespace MathNet.Numerics.LinearAlgebra
         /// <returns>A matrix containing the negated values.</returns>
         public Matrix<T> Negate()
         {
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             DoNegate(result);
             return result;
         }
@@ -839,7 +839,7 @@ namespace MathNet.Numerics.LinearAlgebra
         /// <returns>A matrix containing the conjugated values.</returns>
         public Matrix<T> Conjugate()
         {
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             DoConjugate(result);
             return result;
         }
@@ -866,7 +866,7 @@ namespace MathNet.Numerics.LinearAlgebra
         /// <returns>A matrix containing the results.</returns>
         public Matrix<T> Modulus(T divisor)
         {
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             DoModulus(divisor, result);
             return result;
         }
@@ -893,7 +893,7 @@ namespace MathNet.Numerics.LinearAlgebra
         /// <returns>A matrix containing the results.</returns>
         public Matrix<T> ModulusByThis(T dividend)
         {
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             DoModulusByThis(dividend, result);
             return result;
         }
@@ -926,7 +926,7 @@ namespace MathNet.Numerics.LinearAlgebra
                 throw DimensionsDontMatch<ArgumentException>(this, other, "other");
             }
 
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             DoPointwiseMultiply(other, result);
             return result;
         }
@@ -961,7 +961,7 @@ namespace MathNet.Numerics.LinearAlgebra
                 throw DimensionsDontMatch<ArgumentException>(this, divisor);
             }
 
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             DoPointwiseDivide(divisor, result);
             return result;
         }
@@ -996,7 +996,7 @@ namespace MathNet.Numerics.LinearAlgebra
                 throw DimensionsDontMatch<ArgumentException>(this, divisor);
             }
 
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             DoPointwiseModulus(divisor, result);
             return result;
         }
@@ -1074,7 +1074,7 @@ namespace MathNet.Numerics.LinearAlgebra
         /// <returns>The kronecker product of the two matrices.</returns>
         public Matrix<T> KroneckerProduct(Matrix<T> other)
         {
-            var result = CreateMatrix(RowCount*other.RowCount, ColumnCount*other.ColumnCount);
+            var result = Build.SameAs(this, RowCount*other.RowCount, ColumnCount*other.ColumnCount);
             KroneckerProduct(other, result);
             return result;
         }
@@ -1115,14 +1115,13 @@ namespace MathNet.Numerics.LinearAlgebra
                 throw new ArgumentOutOfRangeException("p", Resources.ArgumentMustBePositive);
             }
 
-            var ret = CreateMatrix(RowCount, ColumnCount);
-
+            var result = Build.SameAs(this);
             for (var index = 0; index < ColumnCount; index++)
             {
-                ret.SetColumn(index, Column(index).Normalize(p));
+                result.SetColumn(index, Column(index).Normalize(p));
             }
 
-            return ret;
+            return result;
         }
 
         /// <summary>
@@ -1138,8 +1137,7 @@ namespace MathNet.Numerics.LinearAlgebra
                 throw new ArgumentOutOfRangeException("p", Resources.ArgumentMustBePositive);
             }
 
-            var ret = CreateMatrix(RowCount, ColumnCount);
-
+            var ret = Build.SameAs(this);
             for (var index = 0; index < RowCount; index++)
             {
                 ret.SetRow(index, Row(index).Normalize(p));

src/Numerics/LinearAlgebra/Matrix.Solve.cs

@@ -127,9 +127,9 @@ namespace MathNet.Numerics.LinearAlgebra
         /// <returns>The left hand side <see cref="Matrix{T}"/>, <b>X</b>.</returns>
         public Matrix<T> Solve(Matrix<T> input)
         {
-            var matrixX = CreateMatrix(ColumnCount, input.ColumnCount);
-            Solve(input, matrixX);
-            return matrixX;
+            var x = Build.SameAs(this, ColumnCount, input.ColumnCount);
+            Solve(input, x);
+            return x;
         }
 
 
@@ -140,7 +140,7 @@ namespace MathNet.Numerics.LinearAlgebra
         /// <returns>The left hand side <see cref="Vector{T}"/>, <b>x</b>.</returns>
         public Vector<T> Solve(Vector<T> input)
         {
-            var x = CreateVector(ColumnCount);
+            var x = Vector<T>.Build.SameAs(this, ColumnCount);
             Solve(input, x);
             return x;
         }

src/Numerics/LinearAlgebra/Matrix.cs

@@ -204,7 +204,7 @@ namespace MathNet.Numerics.LinearAlgebra
         /// </returns>
         public Matrix<T> Clone()
         {
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             Storage.CopyToUnchecked(result.Storage, skipClearing: true);
             return result;
         }
@@ -231,31 +231,6 @@ namespace MathNet.Numerics.LinearAlgebra
             Storage.CopyTo(target.Storage);
         }
 
-        /// <summary>
-        /// Create a matrix of the same kind for the given number of rows and columns.
-        /// </summary>
-        /// <param name="rows">The number of rows.</param>
-        /// <param name="columns">The number of columns.</param>
-        /// <remarks>Creates a matrix of the same matrix type as the current matrix.</remarks>
-        public Matrix<T> CreateMatrix(int rows, int columns)
-        {
-            return Storage.IsDense
-                ? Build.Dense(rows, columns)
-                : Build.Sparse(rows, columns);
-        }
-
-        /// <summary>
-        /// Create a vector of the same kind with the given size.
-        /// </summary>
-        /// <param name="size">The size of the vector.</param>
-        /// <remarks>Creates a vector of the same type as the current matrix.</remarks>
-        public Vector<T> CreateVector(int size)
-        {
-            return Storage.IsDense
-                ? Vector<T>.Build.Dense(size)
-                : Vector<T>.Build.Sparse(size);
-        }
-
         /// <summary>
         /// Copies a row into an Vector.
         /// </summary>
@@ -270,7 +245,7 @@ namespace MathNet.Numerics.LinearAlgebra
                 throw new ArgumentOutOfRangeException("index");
             }
 
-            var ret = CreateVector(ColumnCount);
+            var ret = Vector<T>.Build.SameAs(this, ColumnCount);
             Storage.CopySubRowToUnchecked(ret.Storage, index, 0, 0, ColumnCount);
             return ret;
         }
@@ -310,7 +285,7 @@ namespace MathNet.Numerics.LinearAlgebra
         /// <exception cref="ArgumentOutOfRangeException">If <paramref name="length"/> is not positive.</exception>
         public Vector<T> Row(int rowIndex, int columnIndex, int length)
         {
-            var ret = CreateVector(length);
+            var ret = Vector<T>.Build.SameAs(this, length);
             Storage.CopySubRowTo(ret.Storage, rowIndex, columnIndex, 0, length);
             return ret;
         }
@@ -355,7 +330,7 @@ namespace MathNet.Numerics.LinearAlgebra
                 throw new ArgumentOutOfRangeException("index");
             }
 
-            var ret = CreateVector(RowCount);
+            var ret = Vector<T>.Build.SameAs(this, RowCount);
             Storage.CopySubColumnToUnchecked(ret.Storage, index, 0, 0, RowCount);
             return ret;
         }
@@ -396,7 +371,7 @@ namespace MathNet.Numerics.LinearAlgebra
         /// <exception cref="ArgumentOutOfRangeException">If <paramref name="length"/> is not positive.</exception>
         public Vector<T> Column(int columnIndex, int rowIndex, int length)
         {
-            var ret = CreateVector(length);
+            var ret = Vector<T>.Build.SameAs(this, length);
             Storage.CopySubColumnTo(ret.Storage, columnIndex, rowIndex, 0, length);
             return ret;
         }
@@ -433,17 +408,15 @@ namespace MathNet.Numerics.LinearAlgebra
         /// <returns>The upper triangle of this matrix.</returns>
         public virtual Matrix<T> UpperTriangle()
         {
-            var ret = CreateMatrix(RowCount, ColumnCount);
-
+            var result = Build.SameAs(this);
             for (var row = 0; row < RowCount; row++)
             {
                 for (var column = row; column < ColumnCount; column++)
                 {
-                    ret.At(row, column, At(row, column));
+                    result.At(row, column, At(row, column));
                 }
             }
-
-            return ret;
+            return result;
         }
 
         /// <summary>
@@ -452,17 +425,15 @@ namespace MathNet.Numerics.LinearAlgebra
         /// <returns>The lower triangle of this matrix.</returns>
         public virtual Matrix<T> LowerTriangle()
         {
-            var ret = CreateMatrix(RowCount, ColumnCount);
-
+            var result = Build.SameAs(this);
             for (var row = 0; row < RowCount; row++)
             {
                 for (var column = 0; column <= row && column < ColumnCount; column++)
                 {
-                    ret.At(row, column, At(row, column));
+                    result.At(row, column, At(row, column));
                 }
             }
-
-            return ret;
+            return result;
         }
 
         /// <summary>
@@ -537,9 +508,9 @@ namespace MathNet.Numerics.LinearAlgebra
         /// is not positive.</exception>
         public virtual Matrix<T> SubMatrix(int rowIndex, int rowCount, int columnIndex, int columnCount)
         {
-            var target = CreateMatrix(rowCount, columnCount);
-            Storage.CopySubMatrixTo(target.Storage, rowIndex, 0, rowCount, columnIndex, 0, columnCount, skipClearing: true);
-            return target;
+            var result = Build.SameAs(this, rowCount, columnCount);
+            Storage.CopySubMatrixTo(result.Storage, rowIndex, 0, rowCount, columnIndex, 0, columnCount, skipClearing: true);
+            return result;
         }
 
         /// <summary>
@@ -551,7 +522,7 @@ namespace MathNet.Numerics.LinearAlgebra
         public virtual Vector<T> Diagonal()
         {
             var min = Math.Min(RowCount, ColumnCount);
-            var diagonal = CreateVector(min);
+            var diagonal = Vector<T>.Build.SameAs(this, min);
 
             for (var i = 0; i < min; i++)
             {
@@ -568,8 +539,7 @@ namespace MathNet.Numerics.LinearAlgebra
         /// <returns>The lower triangle of this matrix.</returns>
         public virtual Matrix<T> StrictlyLowerTriangle()
         {
-            var result = CreateMatrix(RowCount, ColumnCount);
-
+            var result = Build.SameAs(this);
             for (var row = 0; row < RowCount; row++)
             {
                 for (var column = 0; column < row; column++)
@@ -577,7 +547,6 @@ namespace MathNet.Numerics.LinearAlgebra
                     result.At(row, column, At(row, column));
                 }
             }
-
             return result;
         }
 
@@ -615,8 +584,7 @@ namespace MathNet.Numerics.LinearAlgebra
         /// <returns>The upper triangle of this matrix.</returns>
         public virtual Matrix<T> StrictlyUpperTriangle()
         {
-            var result = CreateMatrix(RowCount, ColumnCount);
-
+            var result = Build.SameAs(this);
             for (var row = 0; row < RowCount; row++)
             {
                 for (var column = row + 1; column < ColumnCount; column++)
@@ -624,7 +592,6 @@ namespace MathNet.Numerics.LinearAlgebra
                     result.At(row, column, At(row, column));
                 }
             }
-
             return result;
         }
 
@@ -681,7 +648,7 @@ namespace MathNet.Numerics.LinearAlgebra
                 throw new ArgumentException(Resources.ArgumentMatrixSameRowDimension, "column");
             }
 
-            var result = CreateMatrix(RowCount, ColumnCount + 1);
+            var result = Build.SameAs(this, RowCount, ColumnCount + 1);
 
             for (var i = 0; i < columnIndex; i++)
             {
@@ -788,7 +755,7 @@ namespace MathNet.Numerics.LinearAlgebra
                 throw new ArgumentException(Resources.ArgumentMatrixSameRowDimension, "row");
             }
 
-            var result = CreateMatrix(RowCount + 1, ColumnCount);
+            var result = Build.SameAs(this, RowCount + 1, ColumnCount);
 
             for (var i = 0; i < rowIndex; i++)
             {
@@ -997,16 +964,15 @@ namespace MathNet.Numerics.LinearAlgebra
         /// <returns>The transpose of this matrix.</returns>
         public virtual Matrix<T> Transpose()
         {
-            var ret = CreateMatrix(ColumnCount, RowCount);
+            var result = Build.SameAs(this, ColumnCount, RowCount);
             for (var j = 0; j < ColumnCount; j++)
             {
                 for (var i = 0; i < RowCount; i++)
                 {
-                    ret.At(j, i, At(i, j));
+                    result.At(j, i, At(i, j));
                 }
             }
-
-            return ret;
+            return result;
         }
 
         /// <summary>
@@ -1092,7 +1058,7 @@ namespace MathNet.Numerics.LinearAlgebra
                 throw new ArgumentException(Resources.ArgumentMatrixSameRowDimension);
             }
 
-            var result = CreateMatrix(RowCount, ColumnCount + right.ColumnCount);
+            var result = Build.SameAs(this, right, RowCount, ColumnCount + right.ColumnCount, fullyMutable: true);
             Storage.CopySubMatrixToUnchecked(result.Storage, 0, 0, RowCount, 0, 0, ColumnCount, skipClearing: true);
             right.Storage.CopySubMatrixToUnchecked(result.Storage, 0, 0, right.RowCount, 0, ColumnCount, right.ColumnCount, skipClearing: true);
             return result;
@@ -1152,7 +1118,7 @@ namespace MathNet.Numerics.LinearAlgebra
                 throw new ArgumentException(Resources.ArgumentMatrixSameColumnDimension, "lower");
             }
 
-            var result = CreateMatrix(RowCount + lower.RowCount, ColumnCount);
+            var result = Build.SameAs(this, lower, RowCount + lower.RowCount, ColumnCount, fullyMutable: true);
             Storage.CopySubMatrixToUnchecked(result.Storage, 0, 0, RowCount, 0, 0, ColumnCount, skipClearing: true);
             lower.Storage.CopySubMatrixToUnchecked(result.Storage, 0, RowCount, lower.RowCount, 0, 0, lower.ColumnCount, skipClearing: true);
             return result;
@@ -1210,7 +1176,7 @@ namespace MathNet.Numerics.LinearAlgebra
                 throw new ArgumentNullException("lower");
             }
 
-            var result = CreateMatrix(RowCount + lower.RowCount, ColumnCount + lower.ColumnCount);
+            var result = Build.SameAs(this, lower, RowCount + lower.RowCount, ColumnCount + lower.ColumnCount);
             Storage.CopySubMatrixToUnchecked(result.Storage, 0, 0, RowCount, 0, 0, ColumnCount);
             lower.Storage.CopySubMatrixToUnchecked(result.Storage, 0, RowCount, lower.RowCount, 0, ColumnCount, lower.ColumnCount);
             return result;

src/Numerics/LinearAlgebra/Single/Factorization/UserEvd.cs

@@ -73,8 +73,8 @@ namespace MathNet.Numerics.LinearAlgebra.Single.Factorization
             var order = matrix.RowCount;
 
             // Initialize matricies for eigenvalues and eigenvectors
-            var eigenVectors = matrix.CreateMatrix(order, order);
-            var blockDiagonal = matrix.CreateMatrix(order, order);
+            var eigenVectors = Matrix<float>.Build.SameAs(matrix, order, order);
+            var blockDiagonal = Matrix<float>.Build.SameAs(matrix, order, order);
             var eigenValues = new LinearAlgebra.Complex.DenseVector(order);
 
             var isSymmetric = true;

src/Numerics/LinearAlgebra/Single/Factorization/UserGramSchmidt.cs

@@ -58,7 +58,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single.Factorization
             }
 
             var q = matrix.Clone();
-            var r = matrix.CreateMatrix(matrix.ColumnCount, matrix.ColumnCount);
+            var r = Matrix<float>.Build.SameAs(matrix, matrix.ColumnCount, matrix.ColumnCount);
 
             for (var k = 0; k < q.ColumnCount; k++)
             {

src/Numerics/LinearAlgebra/Single/Factorization/UserLU.cs

@@ -295,7 +295,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single.Factorization
         public override Matrix<float> Inverse()
         {
             var order = Factors.RowCount;
-            var inverse = Factors.CreateMatrix(order, order);
+            var inverse = Matrix<float>.Build.SameAs(Factors, order, order);
             for (var i = 0; i < order; i++)
             {
                 inverse.At(i, i, 1.0f);

src/Numerics/LinearAlgebra/Single/Factorization/UserQR.cs

@@ -70,7 +70,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single.Factorization
             if (method == QRMethod.Full)
             {
                 r = matrix.Clone();
-                q = matrix.CreateMatrix(matrix.RowCount, matrix.RowCount);
+                q = Matrix<float>.Build.SameAs(matrix, matrix.RowCount, matrix.RowCount);
 
                 for (var i = 0; i < matrix.RowCount; i++)
                 {

src/Numerics/LinearAlgebra/Single/Factorization/UserSvd.cs

@@ -62,9 +62,9 @@ namespace MathNet.Numerics.LinearAlgebra.Single.Factorization
             var nm = Math.Min(matrix.RowCount + 1, matrix.ColumnCount);
             var matrixCopy = matrix.Clone();
 
-            var s = matrixCopy.CreateVector(nm);
-            var u = matrixCopy.CreateMatrix(matrixCopy.RowCount, matrixCopy.RowCount);
-            var vt = matrixCopy.CreateMatrix(matrixCopy.ColumnCount, matrixCopy.ColumnCount);
+            var s = Vector<float>.Build.SameAs(matrixCopy, nm);
+            var u = Matrix<float>.Build.SameAs(matrixCopy, matrixCopy.RowCount, matrixCopy.RowCount);
+            var vt = Matrix<float>.Build.SameAs(matrixCopy, matrixCopy.ColumnCount, matrixCopy.ColumnCount);
 
             const int maxiter = 1000;
             var e = new float[matrixCopy.ColumnCount];
@@ -570,7 +570,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single.Factorization
             if (matrixCopy.RowCount < matrixCopy.ColumnCount)
             {
                 nm--;
-                var tmp = matrixCopy.CreateVector(nm);
+                var tmp = Vector<float>.Build.SameAs(matrixCopy, nm);
                 for (i = 0; i < nm; i++)
                 {
                     tmp[i] = s[i];

src/Numerics/LinearAlgebra/Single/SparseMatrix.cs

@@ -375,7 +375,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single
         /// <returns>The lower triangle of this matrix.</returns>
         public override Matrix<float> LowerTriangle()
         {
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             LowerTriangleImpl(result);
             return result;
         }
@@ -400,7 +400,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single
 
             if (ReferenceEquals(this, result))
             {
-                var tmp = result.CreateMatrix(result.RowCount, result.ColumnCount);
+                var tmp = Build.SameAs(result);
                 LowerTriangle(tmp);
                 tmp.CopyTo(result);
             }
@@ -440,7 +440,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single
         /// <returns>The upper triangle of this matrix.</returns>
         public override Matrix<float> UpperTriangle()
         {
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             UpperTriangleImpl(result);
             return result;
         }
@@ -465,7 +465,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single
 
             if (ReferenceEquals(this, result))
             {
-                var tmp = result.CreateMatrix(result.RowCount, result.ColumnCount);
+                var tmp = Build.SameAs(result);
                 UpperTriangle(tmp);
                 tmp.CopyTo(result);
             }
@@ -506,7 +506,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single
         /// <returns>The lower triangle of this matrix.</returns>
         public override Matrix<float> StrictlyLowerTriangle()
         {
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             StrictlyLowerTriangleImpl(result);
             return result;
         }
@@ -531,7 +531,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single
 
             if (ReferenceEquals(this, result))
             {
-                var tmp = result.CreateMatrix(result.RowCount, result.ColumnCount);
+                var tmp = Build.SameAs(result);
                 StrictlyLowerTriangle(tmp);
                 tmp.CopyTo(result);
             }
@@ -572,7 +572,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single
         /// <returns>The upper triangle of this matrix.</returns>
         public override Matrix<float> StrictlyUpperTriangle()
         {
-            var result = CreateMatrix(RowCount, ColumnCount);
+            var result = Build.SameAs(this);
             StrictlyUpperTriangleImpl(result);
             return result;
         }
@@ -597,7 +597,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single
 
             if (ReferenceEquals(this, result))
             {
-                var tmp = result.CreateMatrix(result.RowCount, result.ColumnCount);
+                var tmp = Build.SameAs(result);
                 StrictlyUpperTriangle(tmp);
                 tmp.CopyTo(result);
             }

src/UnitTests/LinearAlgebraTests/MatrixStructureTheory.cs

@@ -155,7 +155,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests
         [Theory]
         public void CanGetHashCode(Matrix<T> matrix)
         {
-            Assert.That(matrix.GetHashCode(), Is.Not.EqualTo(matrix.CreateMatrix(matrix.RowCount, matrix.ColumnCount).GetHashCode()));
+            Assert.That(matrix.GetHashCode(), Is.Not.EqualTo(Matrix<T>.Build.SameAs(matrix).GetHashCode()));
         }
 
         [Theory]
@@ -163,7 +163,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests
         {
             var cleared = matrix.Clone();
             cleared.Clear();
-            Assert.That(cleared, Is.EqualTo(matrix.CreateMatrix(matrix.RowCount, matrix.ColumnCount)));
+            Assert.That(cleared, Is.EqualTo(Matrix<T>.Build.SameAs(matrix)));
         }
 
         [Theory]
@@ -220,13 +220,13 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests
         [Theory]
         public void CanCreateSameKind(Matrix<T> matrix)
         {
-            var empty = matrix.CreateMatrix(5, 6);
+            var empty = Matrix<T>.Build.SameAs(matrix, 5, 6);
             Assert.That(empty, Is.EqualTo(CreateDenseZero(5, 6)));
             Assert.That(empty.Storage.IsDense, Is.EqualTo(matrix.Storage.IsDense));
 
-            Assert.That(() => matrix.CreateMatrix(0, 2), Throws.InstanceOf<ArgumentOutOfRangeException>());
-            Assert.That(() => matrix.CreateMatrix(2, 0), Throws.InstanceOf<ArgumentOutOfRangeException>());
-            Assert.That(() => matrix.CreateMatrix(-1, -1), Throws.InstanceOf<ArgumentOutOfRangeException>());
+            Assert.That(() => Matrix<T>.Build.SameAs(matrix, 0, 2), Throws.InstanceOf<ArgumentOutOfRangeException>());
+            Assert.That(() => Matrix<T>.Build.SameAs(matrix, 2, 0), Throws.InstanceOf<ArgumentOutOfRangeException>());
+            Assert.That(() => Matrix<T>.Build.SameAs(matrix, -1, -1), Throws.InstanceOf<ArgumentOutOfRangeException>());
         }
 
         [Test]