diff --git a/src/Numerics/Complex32.cs b/src/Numerics/Complex32.cs index 10abc015..50e3417c 100644 --- a/src/Numerics/Complex32.cs +++ b/src/Numerics/Complex32.cs @@ -1167,9 +1167,9 @@ namespace MathNet.Numerics } /// - /// Implicit conversion of a unsgined real short to a Complex32. + /// Implicit conversion of a unsigned real short to a Complex32. /// - /// The unsgined short value to convert. + /// The unsigned short value to convert. /// The result of the conversion. [CLSCompliant(false)] public static implicit operator Complex32(ushort value) diff --git a/src/Numerics/Complex64.cs b/src/Numerics/Complex64.cs index 126072a9..63cf10a2 100644 --- a/src/Numerics/Complex64.cs +++ b/src/Numerics/Complex64.cs @@ -838,9 +838,9 @@ namespace MathNet.Numerics } /// - /// Implicit conversion of a unsgined real short to a Complex. + /// Implicit conversion of a unsigned real short to a Complex. /// - /// The unsgined short value to convert. + /// The unsigned short value to convert. /// The result of the conversion. [CLSCompliant(false)] public static implicit operator Complex(ushort value) diff --git a/src/Numerics/ComplexExtensions.cs b/src/Numerics/ComplexExtensions.cs index 1826ba93..1d0a11fd 100644 --- a/src/Numerics/ComplexExtensions.cs +++ b/src/Numerics/ComplexExtensions.cs @@ -48,7 +48,7 @@ namespace MathNet.Numerics /// /// Gets the squared magnitude of the Complex number. /// - /// The number to perfom this operation on. + /// The number to perform this operation on. /// The squared magnitude of the Complex number. public static double MagnitudeSquared(this Complex32 complex) { @@ -58,7 +58,7 @@ namespace MathNet.Numerics /// /// Gets the squared magnitude of the Complex number. /// - /// The number to perfom this operation on. + /// The number to perform this operation on. /// The squared magnitude of the Complex number. public static double MagnitudeSquared(this Complex complex) { @@ -104,7 +104,7 @@ namespace MathNet.Numerics /// /// Gets the conjugate of the Complex number. /// - /// The number to perfom this operation on. + /// The number to perform this operation on. /// /// The semantic of setting the conjugate is such that /// @@ -136,7 +136,7 @@ namespace MathNet.Numerics /// /// Exponential of this Complex (exp(x), E^x). /// - /// The number to perfom this operation on. + /// The number to perform this operation on. /// /// The exponential of this complex number. /// @@ -149,7 +149,7 @@ namespace MathNet.Numerics /// /// Natural Logarithm of this Complex (Base E). /// - /// The number to perfom this operation on. + /// The number to perform this operation on. /// /// The natural logarithm of this complex number. /// @@ -182,7 +182,7 @@ namespace MathNet.Numerics /// /// Raise this Complex to the given value. /// - /// The number to perfom this operation on. + /// The number to perform this operation on. /// /// The exponent. /// @@ -219,7 +219,7 @@ namespace MathNet.Numerics /// /// Raise this Complex to the inverse of the given value. /// - /// The number to perfom this operation on. + /// The number to perform this operation on. /// /// The root exponent. /// @@ -234,7 +234,7 @@ namespace MathNet.Numerics /// /// The Square (power 2) of this Complex /// - /// The number to perfom this operation on. + /// The number to perform this operation on. /// /// The square of this complex number. /// @@ -251,7 +251,7 @@ namespace MathNet.Numerics /// /// The Square Root (power 1/2) of this Complex /// - /// The number to perfom this operation on. + /// The number to perform this operation on. /// /// The square root of this complex number. /// @@ -324,7 +324,7 @@ namespace MathNet.Numerics /// /// Gets a value indicating whether the Complex32 is zero. /// - /// The number to perfom this operation on. + /// The number to perform this operation on. /// true if this instance is zero; otherwise, false. public static bool IsZero(this Complex complex) { @@ -334,7 +334,7 @@ namespace MathNet.Numerics /// /// Gets a value indicating whether the Complex32 is one. /// - /// The number to perfom this operation on. + /// The number to perform this operation on. /// true if this instance is one; otherwise, false. public static bool IsOne(this Complex complex) { @@ -345,7 +345,7 @@ namespace MathNet.Numerics /// Gets a value indicating whether the Complex32 is the imaginary unit. /// /// true if this instance is ImaginaryOne; otherwise, false. - /// The number to perfom this operation on. + /// The number to perform this operation on. public static bool IsImaginaryOne(this Complex complex) { return complex.Real == 0.0 && complex.Imaginary == 1.0; @@ -355,7 +355,7 @@ namespace MathNet.Numerics /// Gets a value indicating whether the provided Complex32evaluates /// to a value that is not a number. /// - /// The number to perfom this operation on. + /// The number to perform this operation on. /// /// true if this instance is NaN; otherwise, /// false. @@ -369,7 +369,7 @@ namespace MathNet.Numerics /// Gets a value indicating whether the provided Complex32 evaluates to an /// infinite value. /// - /// The number to perfom this operation on. + /// The number to perform this operation on. /// /// true if this instance is infinite; otherwise, false. /// @@ -385,7 +385,7 @@ namespace MathNet.Numerics /// /// Gets a value indicating whether the provided Complex32 is real. /// - /// The number to perfom this operation on. + /// The number to perform this operation on. /// true if this instance is a real number; otherwise, false. public static bool IsReal(this Complex complex) { @@ -395,7 +395,7 @@ namespace MathNet.Numerics /// /// Gets a value indicating whether the provided Complex32 is real and not negative, that is >= 0. /// - /// The number to perfom this operation on. + /// The number to perform this operation on. /// /// true if this instance is real nonnegative number; otherwise, false. /// diff --git a/src/Numerics/Constants.cs b/src/Numerics/Constants.cs index feaf81f2..5b6fb130 100644 --- a/src/Numerics/Constants.cs +++ b/src/Numerics/Constants.cs @@ -287,7 +287,7 @@ namespace MathNet.Numerics /// Classical Electron Radius: [m] (2007 CODATA) public const double ClassicalElectronRadius = 2.8179402894e-15; - /// Tomson Cross Section: [m^2] (2002 CODATA) + /// Thomson Cross Section: [m^2] (2002 CODATA) public const double ThomsonCrossSection = 0.6652458558e-28; /// Electron Magnetic Moment: [J T^-1] (2007 CODATA) @@ -462,4 +462,4 @@ namespace MathNet.Numerics public const double Yocto = 1e-24; #endregion } -} \ No newline at end of file +} diff --git a/src/Numerics/Control.cs b/src/Numerics/Control.cs index d8738472..5543edd6 100644 --- a/src/Numerics/Control.cs +++ b/src/Numerics/Control.cs @@ -260,7 +260,7 @@ namespace MathNet.Numerics } /// - /// Gets or sets the fourier transform provider. Consider to use UseNativeMKL or UseManaged instead. + /// Gets or sets the Fourier transform provider. Consider to use UseNativeMKL or UseManaged instead. /// /// The linear algebra provider. public static IFourierTransformProvider FourierTransformProvider @@ -313,7 +313,7 @@ namespace MathNet.Numerics public static TaskScheduler TaskScheduler { get; set; } /// - /// Gets or sets the the block size to use for + /// Gets or sets the block size to use for /// the native linear algebra provider. /// /// The block size. Default 512, must be at least 32. diff --git a/src/Numerics/Differentiation/FiniteDifferenceCoefficients.cs b/src/Numerics/Differentiation/FiniteDifferenceCoefficients.cs index 624f9474..eab541ba 100644 --- a/src/Numerics/Differentiation/FiniteDifferenceCoefficients.cs +++ b/src/Numerics/Differentiation/FiniteDifferenceCoefficients.cs @@ -95,7 +95,7 @@ namespace MathNet.Numerics.Differentiation /// Gets the finite difference coefficients for all orders at a specified center. /// /// Current function position with respect to coefficients. Must be within point range. - /// Rectangular array of coefficients, with columns specifing order. + /// Rectangular array of coefficients, with columns specifying order. public double[,] GetCoefficientsForAllOrders(int center) { if (center >= _coefficients.Length) diff --git a/src/Numerics/Differentiation/NumericalDerivative.cs b/src/Numerics/Differentiation/NumericalDerivative.cs index 2a0bdda4..d85c40e9 100644 --- a/src/Numerics/Differentiation/NumericalDerivative.cs +++ b/src/Numerics/Differentiation/NumericalDerivative.cs @@ -53,7 +53,7 @@ namespace MathNet.Numerics.Differentiation /// /// A base step size value, eps (typically machine precision), is scaled according to the finite difference coefficient order /// and function input parameter. The initial scaling according to finite different coefficient order can be thought of as producing a - /// base step size, h, that is equivalent to scaling. This stepsize is then scaled according to the function + /// base step size, h, that is equivalent to scaling. This step size is then scaled according to the function /// input parameter. Although implementation may vary, an example of second order accurate scaling may be (eps)^(1/3)*(1+abs(x)). /// Relative @@ -101,7 +101,7 @@ namespace MathNet.Numerics.Differentiation } /// - /// Sets and gets the finite difference step size. This value is for each function evaluation if relative stepsize types are used. + /// Sets and gets the finite difference step size. This value is for each function evaluation if relative step size types are used. /// If the base step size used in scaling is desired, see . /// /// @@ -120,7 +120,7 @@ namespace MathNet.Numerics.Differentiation } /// - /// Sets and gets the base fininte difference step size. This assigned value to this parameter is only used if is set to RelativeX. + /// Sets and gets the base finite difference step size. This assigned value to this parameter is only used if is set to RelativeX. /// However, if the StepType is Relative, it will contain the base step size computed from based on the finite difference order. /// public double BaseStepSize diff --git a/src/Numerics/Differentiation/NumericalHessian.cs b/src/Numerics/Differentiation/NumericalHessian.cs index 1a18af28..7b7f0f82 100644 --- a/src/Numerics/Differentiation/NumericalHessian.cs +++ b/src/Numerics/Differentiation/NumericalHessian.cs @@ -77,7 +77,7 @@ namespace MathNet.Numerics.Differentiation /// Evaluates the Hessian of a multivariate function f at points x. /// /// - /// This method of computing the Hessian is only vaid for Lipschitz continuous functions. + /// This method of computing the Hessian is only valid for Lipschitz continuous functions. /// The function mirrors the Hessian along the diagonal since d2f/dxdy = d2f/dydx for continuously differentiable functions. /// /// Multivariate function handle.> diff --git a/src/Numerics/Distributions/Erlang.cs b/src/Numerics/Distributions/Erlang.cs index fa129e2f..66d69fb4 100644 --- a/src/Numerics/Distributions/Erlang.cs +++ b/src/Numerics/Distributions/Erlang.cs @@ -36,7 +36,7 @@ namespace MathNet.Numerics.Distributions { /// /// Continuous Univariate Erlang distribution. - /// This distribution is is a continuous probability distribution with wide applicability primarily due to its + /// This distribution is a continuous probability distribution with wide applicability primarily due to its /// relation to the exponential and Gamma distributions. /// Wikipedia - Erlang distribution. /// diff --git a/src/Numerics/Exceptions.cs b/src/Numerics/Exceptions.cs index 53544974..00d02d95 100644 --- a/src/Numerics/Exceptions.cs +++ b/src/Numerics/Exceptions.cs @@ -57,7 +57,7 @@ namespace MathNet.Numerics } /// - /// An error occured calling native provider function. + /// An error occurred calling native provider function. /// [Serializable] public abstract class NativeInterfaceException : Exception @@ -84,7 +84,7 @@ namespace MathNet.Numerics } /// - /// An error occured calling native provider function. + /// An error occurred calling native provider function. /// [Serializable] public class InvalidParameterException : NativeInterfaceException @@ -112,7 +112,7 @@ namespace MathNet.Numerics } /// - /// Native provider was unable to allocate sufficent memory. + /// Native provider was unable to allocate sufficient memory. /// [Serializable] public class MemoryAllocationException : NativeInterfaceException diff --git a/src/Numerics/Integrate.cs b/src/Numerics/Integrate.cs index 6efb2f1c..2d708fdf 100644 --- a/src/Numerics/Integrate.cs +++ b/src/Numerics/Integrate.cs @@ -70,7 +70,7 @@ namespace MathNet.Numerics /// Where the interval ends for the first (inside) integral, exclusive and finite. /// Where the interval starts for the second (outside) integral, exclusive and finite. /// /// Where the interval ends for the second (outside) integral, exclusive and finite. - /// Defines an Nth order Gauss-Legendre rule. The order also defines the number of abscissas and weights for the rule. Precomputed Gauss-Legendre abscissas/weights for orders 2-20, 32, 64, 96, 100, 128, 256, 512, 1024 are used, otherwise they're calulcated on the fly. + /// Defines an Nth order Gauss-Legendre rule. The order also defines the number of abscissas and weights for the rule. Precomputed Gauss-Legendre abscissas/weights for orders 2-20, 32, 64, 96, 100, 128, 256, 512, 1024 are used, otherwise they're calculated on the fly. /// Approximation of the finite integral in the given interval. public static double OnRectangle(Func f, double invervalBeginA, double invervalEndA, double invervalBeginB, double invervalEndB, int order) { diff --git a/src/Numerics/Integration/DoubleExponentialTransformation.cs b/src/Numerics/Integration/DoubleExponentialTransformation.cs index 204fcf67..bd9ddd83 100644 --- a/src/Numerics/Integration/DoubleExponentialTransformation.cs +++ b/src/Numerics/Integration/DoubleExponentialTransformation.cs @@ -115,7 +115,7 @@ namespace MathNet.Numerics.Integration double arg = offset + t; t += step; - // TODO: reuse abcissas as computed in EvaluateAbcissas + // TODO: reuse abscissas as computed in EvaluateAbcissas double abcissa = Math.Tanh(Constants.PiOver2*Math.Sinh(arg)); weights[i] = Constants.PiOver2*(1 - (abcissa*abcissa))*Math.Cosh(arg); } @@ -123,7 +123,7 @@ namespace MathNet.Numerics.Integration return weights; } - #region Precomputed Abcissas and Weights + #region Precomputed Abscissas and Weights /// /// Precomputed abscissa vector per level. diff --git a/src/Numerics/Integration/GaussLegendreRule.cs b/src/Numerics/Integration/GaussLegendreRule.cs index bd4aedc0..60bed83f 100644 --- a/src/Numerics/Integration/GaussLegendreRule.cs +++ b/src/Numerics/Integration/GaussLegendreRule.cs @@ -33,7 +33,7 @@ using MathNet.Numerics.Integration.GaussRule; namespace MathNet.Numerics.Integration { /// - /// Approximates a definite integral using an Nth order Gauss-Legendre rule. Precomputed Gauss-Legendre abscissas/weights for orders 2-20, 32, 64, 96, 100, 128, 256, 512, 1024 are used, otherwise they're calulcated on the fly. + /// Approximates a definite integral using an Nth order Gauss-Legendre rule. Precomputed Gauss-Legendre abscissas/weights for orders 2-20, 32, 64, 96, 100, 128, 256, 512, 1024 are used, otherwise they're calculated on the fly. /// public class GaussLegendreRule { @@ -44,7 +44,7 @@ namespace MathNet.Numerics.Integration /// /// Where the interval starts, inclusive and finite. /// Where the interval stops, inclusive and finite. - /// Defines an Nth order Gauss-Legendre rule. The order also defines the number of abscissas and weights for the rule. Precomputed Gauss-Legendre abscissas/weights for orders 2-20, 32, 64, 96, 100, 128, 256, 512, 1024 are used, otherwise they're calulcated on the fly. + /// Defines an Nth order Gauss-Legendre rule. The order also defines the number of abscissas and weights for the rule. Precomputed Gauss-Legendre abscissas/weights for orders 2-20, 32, 64, 96, 100, 128, 256, 512, 1024 are used, otherwise they're calculated on the fly. public GaussLegendreRule(double intervalBegin, double intervalEnd, int order) { _gaussLegendrePoint = GaussLegendrePointFactory.GetGaussPoint(intervalBegin, intervalEnd, order); @@ -131,7 +131,7 @@ namespace MathNet.Numerics.Integration /// The analytic smooth function to integrate. /// Where the interval starts, exclusive and finite. /// Where the interval ends, exclusive and finite. - /// Defines an Nth order Gauss-Legendre rule. The order also defines the number of abscissas and weights for the rule. Precomputed Gauss-Legendre abscissas/weights for orders 2-20, 32, 64, 96, 100, 128, 256, 512, 1024 are used, otherwise they're calulcated on the fly. + /// Defines an Nth order Gauss-Legendre rule. The order also defines the number of abscissas and weights for the rule. Precomputed Gauss-Legendre abscissas/weights for orders 2-20, 32, 64, 96, 100, 128, 256, 512, 1024 are used, otherwise they're calculated on the fly. /// Approximation of the finite integral in the given interval. public static double Integrate(Func f, double invervalBegin, double invervalEnd, int order) { @@ -174,7 +174,7 @@ namespace MathNet.Numerics.Integration /// Where the interval ends for the first (inside) integral, exclusive and finite. /// Where the interval starts for the second (outside) integral, exclusive and finite. /// /// Where the interval ends for the second (outside) integral, exclusive and finite. - /// Defines an Nth order Gauss-Legendre rule. The order also defines the number of abscissas and weights for the rule. Precomputed Gauss-Legendre abscissas/weights for orders 2-20, 32, 64, 96, 100, 128, 256, 512, 1024 are used, otherwise they're calulcated on the fly. + /// Defines an Nth order Gauss-Legendre rule. The order also defines the number of abscissas and weights for the rule. Precomputed Gauss-Legendre abscissas/weights for orders 2-20, 32, 64, 96, 100, 128, 256, 512, 1024 are used, otherwise they're calculated on the fly. /// Approximation of the finite integral in the given interval. public static double Integrate(Func f, double invervalBeginA, double invervalEndA, double invervalBeginB, double invervalEndB, int order) { diff --git a/src/Numerics/Integration/GaussRule/GaussLegendrePointFactory.cs b/src/Numerics/Integration/GaussRule/GaussLegendrePointFactory.cs index 634856db..b503c097 100644 --- a/src/Numerics/Integration/GaussRule/GaussLegendrePointFactory.cs +++ b/src/Numerics/Integration/GaussRule/GaussLegendrePointFactory.cs @@ -42,7 +42,7 @@ namespace MathNet.Numerics.Integration.GaussRule /// /// Getter for the GaussPoint. /// - /// Defines an Nth order Gauss-Legendre rule. Precomputed Gauss-Legendre abscissas/weights for orders 2-20, 32, 64, 96, 100, 128, 256, 512, 1024 are used, otherwise they're calulcated on the fly. + /// Defines an Nth order Gauss-Legendre rule. Precomputed Gauss-Legendre abscissas/weights for orders 2-20, 32, 64, 96, 100, 128, 256, 512, 1024 are used, otherwise they're calculated on the fly. /// Object containing the non-negative abscissas/weights, order, and intervalBegin/intervalEnd. The non-negative abscissas/weights are generated over the interval [-1,1] for the given order. public static GaussPoint GetGaussPoint(int order) { @@ -65,7 +65,7 @@ namespace MathNet.Numerics.Integration.GaussRule /// /// Where the interval starts, inclusive and finite. /// Where the interval stops, inclusive and finite. - /// Defines an Nth order Gauss-Legendre rule. Precomputed Gauss-Legendre abscissas/weights for orders 2-20, 32, 64, 96, 100, 128, 256, 512, 1024 are used, otherwise they're calulcated on the fly. + /// Defines an Nth order Gauss-Legendre rule. Precomputed Gauss-Legendre abscissas/weights for orders 2-20, 32, 64, 96, 100, 128, 256, 512, 1024 are used, otherwise they're calculated on the fly. /// Object containing the abscissas/weights, order, and intervalBegin/intervalEnd. public static GaussPoint GetGaussPoint(double intervalBegin, double intervalEnd, int order) { diff --git a/src/Numerics/Interpolate.cs b/src/Numerics/Interpolate.cs index 21c380e7..7dc481a9 100644 --- a/src/Numerics/Interpolate.cs +++ b/src/Numerics/Interpolate.cs @@ -59,7 +59,7 @@ namespace MathNet.Numerics } /// - /// Create a floater hormann rational pole-free interpolation based on arbitrary points. + /// Create a Floater-Hormann rational pole-free interpolation based on arbitrary points. /// /// The sample points t. /// The sample point values x(t). diff --git a/src/Numerics/Interpolation/CubicSpline.cs b/src/Numerics/Interpolation/CubicSpline.cs index 4a14ef46..b96a32f2 100644 --- a/src/Numerics/Interpolation/CubicSpline.cs +++ b/src/Numerics/Interpolation/CubicSpline.cs @@ -73,7 +73,7 @@ namespace MathNet.Numerics.Interpolation } /// - /// Create a hermite cubic spline interpolation from a set of (x,y) value pairs and their slope (first derivative), sorted ascendingly by x. + /// Create a Hermite cubic spline interpolation from a set of (x,y) value pairs and their slope (first derivative), sorted ascendingly by x. /// public static CubicSpline InterpolateHermiteSorted(double[] x, double[] y, double[] firstDerivatives) { @@ -105,7 +105,7 @@ namespace MathNet.Numerics.Interpolation } /// - /// Create a hermite cubic spline interpolation from an unsorted set of (x,y) value pairs and their slope (first derivative). + /// Create a Hermite cubic spline interpolation from an unsorted set of (x,y) value pairs and their slope (first derivative). /// WARNING: Works in-place and can thus causes the data array to be reordered. /// public static CubicSpline InterpolateHermiteInplace(double[] x, double[] y, double[] firstDerivatives) @@ -125,7 +125,7 @@ namespace MathNet.Numerics.Interpolation } /// - /// Create a hermite cubic spline interpolation from an unsorted set of (x,y) value pairs and their slope (first derivative). + /// Create a Hermite cubic spline interpolation from an unsorted set of (x,y) value pairs and their slope (first derivative). /// public static CubicSpline InterpolateHermite(IEnumerable x, IEnumerable y, IEnumerable firstDerivatives) { diff --git a/src/Numerics/LinearAlgebra/Complex/DenseMatrix.cs b/src/Numerics/LinearAlgebra/Complex/DenseMatrix.cs index 1dd3f723..310f5536 100644 --- a/src/Numerics/LinearAlgebra/Complex/DenseMatrix.cs +++ b/src/Numerics/LinearAlgebra/Complex/DenseMatrix.cs @@ -1264,7 +1264,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex } /// - /// Evaluates whether this matrix is hermitian (conjugate symmetric). + /// Evaluates whether this matrix is Hermitian (conjugate symmetric). /// public override bool IsHermitian() { diff --git a/src/Numerics/LinearAlgebra/Complex/DiagonalMatrix.cs b/src/Numerics/LinearAlgebra/Complex/DiagonalMatrix.cs index 12c35d9d..6ad63e2d 100644 --- a/src/Numerics/LinearAlgebra/Complex/DiagonalMatrix.cs +++ b/src/Numerics/LinearAlgebra/Complex/DiagonalMatrix.cs @@ -1012,7 +1012,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex } /// - /// Evaluates whether this matrix is hermitian (conjugate symmetric). + /// Evaluates whether this matrix is Hermitian (conjugate symmetric). /// public sealed override bool IsHermitian() { diff --git a/src/Numerics/LinearAlgebra/Complex/Factorization/DenseEvd.cs b/src/Numerics/LinearAlgebra/Complex/Factorization/DenseEvd.cs index 6715ab95..eac98bb9 100644 --- a/src/Numerics/LinearAlgebra/Complex/Factorization/DenseEvd.cs +++ b/src/Numerics/LinearAlgebra/Complex/Factorization/DenseEvd.cs @@ -43,8 +43,8 @@ namespace MathNet.Numerics.LinearAlgebra.Complex.Factorization /// Eigenvalues and eigenvectors of a complex matrix. /// /// - /// If A is hermitan, then A = V*D*V' where the eigenvalue matrix D is - /// diagonal and the eigenvector matrix V is hermitan. + /// If A is Hermitian, then A = V*D*V' where the eigenvalue matrix D is + /// diagonal and the eigenvector matrix V is Hermitian. /// I.e. A = V*D*V' and V*VH=I. /// If A is not symmetric, then the eigenvalue matrix D is block diagonal /// with the real eigenvalues in 1-by-1 blocks and any complex eigenvalues, @@ -103,7 +103,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex.Factorization } /// - /// Reduces a complex hermitian matrix to a real symmetric tridiagonal matrix using unitary similarity transformations. + /// Reduces a complex Hermitian matrix to a real symmetric tridiagonal matrix using unitary similarity transformations. /// /// Source matrix to reduce /// Output: Arrays for internal storage of real parts of eigenvalues diff --git a/src/Numerics/LinearAlgebra/Complex/Factorization/QR.cs b/src/Numerics/LinearAlgebra/Complex/Factorization/QR.cs index 4e9a5fe1..64e4bd1a 100644 --- a/src/Numerics/LinearAlgebra/Complex/Factorization/QR.cs +++ b/src/Numerics/LinearAlgebra/Complex/Factorization/QR.cs @@ -48,7 +48,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex.Factorization /// /// /// The computation of the QR decomposition is done at construction time by Householder transformation. - /// If a factorization is peformed, the resulting Q matrix is an m x m matrix + /// If a factorization is performed, the resulting Q matrix is an m x m matrix /// and the R matrix is an m x n matrix. If a factorization is performed, the /// resulting Q matrix is an m x n matrix and the R matrix is an n x n matrix. /// diff --git a/src/Numerics/LinearAlgebra/Complex/Factorization/UserEvd.cs b/src/Numerics/LinearAlgebra/Complex/Factorization/UserEvd.cs index ae7c1ceb..add638a3 100644 --- a/src/Numerics/LinearAlgebra/Complex/Factorization/UserEvd.cs +++ b/src/Numerics/LinearAlgebra/Complex/Factorization/UserEvd.cs @@ -43,8 +43,8 @@ namespace MathNet.Numerics.LinearAlgebra.Complex.Factorization /// Eigenvalues and eigenvectors of a complex matrix. /// /// - /// If A is hermitan, then A = V*D*V' where the eigenvalue matrix D is - /// diagonal and the eigenvector matrix V is hermitan. + /// If A is Hermitian, then A = V*D*V' where the eigenvalue matrix D is + /// diagonal and the eigenvector matrix V is Hermitian. /// I.e. A = V*D*V' and V*VH=I. /// If A is not symmetric, then the eigenvalue matrix D is block diagonal /// with the real eigenvalues in 1-by-1 blocks and any complex eigenvalues, @@ -73,7 +73,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex.Factorization var order = matrix.RowCount; - // Initialize matricies for eigenvalues and eigenvectors + // Initialize matrices for eigenvalues and eigenvectors var eigenVectors = DenseMatrix.CreateIdentity(order); var blockDiagonal = Matrix.Build.SameAs(matrix, order, order); var eigenValues = new DenseVector(order); @@ -126,7 +126,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex.Factorization } /// - /// Reduces a complex hermitian matrix to a real symmetric tridiagonal matrix using unitary similarity transformations. + /// Reduces a complex Hermitian matrix to a real symmetric tridiagonal matrix using unitary similarity transformations. /// /// Source matrix to reduce /// Output: Arrays for internal storage of real parts of eigenvalues diff --git a/src/Numerics/LinearAlgebra/Complex/Factorization/UserSvd.cs b/src/Numerics/LinearAlgebra/Complex/Factorization/UserSvd.cs index 0a5ff5c5..48f0d529 100644 --- a/src/Numerics/LinearAlgebra/Complex/Factorization/UserSvd.cs +++ b/src/Numerics/LinearAlgebra/Complex/Factorization/UserSvd.cs @@ -357,11 +357,11 @@ namespace MathNet.Numerics.LinearAlgebra.Complex.Factorization } // This section of the program inspects for negligible elements in the s and e arrays. On - // completion the variables kase and l are set as follows. - // Kase = 1 if VectorS[m] and e[l-1] are negligible and l < m - // Kase = 2 if VectorS[l] is negligible and l < m - // Kase = 3 if e[l-1] is negligible, l < m, and VectorS[l, ..., VectorS[m] are not negligible (qr step). - // Лase = 4 if e[m-1] is negligible (convergence). + // completion the variables case and l are set as follows. + // Case = 1 if VectorS[m] and e[l-1] are negligible and l < m + // Case = 2 if VectorS[l] is negligible and l < m + // Case = 3 if e[l-1] is negligible, l < m, and VectorS[l, ..., VectorS[m] are not negligible (qr step). + // Case = 4 if e[m-1] is negligible (convergence). double ztest; double test; for (l = m - 2; l >= 0; l--) @@ -421,7 +421,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex.Factorization l = l + 1; - // Perform the task indicated by kase. + // Perform the task indicated by case. int k; double f; double cs; @@ -667,7 +667,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex.Factorization } /// - /// Given the Cartesian coordinates (da, db) of a point p, these fucntion return the parameters da, db, c, and s + /// Given the Cartesian coordinates (da, db) of a point p, these function return the parameters da, db, c, and s /// associated with the Givens rotation that zeros the y-coordinate of the point. /// /// Provides the x-coordinate of the point p. On exit contains the parameter r associated with the Givens rotation diff --git a/src/Numerics/LinearAlgebra/Complex/Matrix.cs b/src/Numerics/LinearAlgebra/Complex/Matrix.cs index 39d648d3..9842d874 100644 --- a/src/Numerics/LinearAlgebra/Complex/Matrix.cs +++ b/src/Numerics/LinearAlgebra/Complex/Matrix.cs @@ -797,7 +797,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex } /// - /// Evaluates whether this matrix is hermitian (conjugate symmetric). + /// Evaluates whether this matrix is Hermitian (conjugate symmetric). /// public override bool IsHermitian() { diff --git a/src/Numerics/LinearAlgebra/Complex/Solvers/ILUTPPreconditioner.cs b/src/Numerics/LinearAlgebra/Complex/Solvers/ILUTPPreconditioner.cs index 42792c6f..6523b625 100644 --- a/src/Numerics/LinearAlgebra/Complex/Solvers/ILUTPPreconditioner.cs +++ b/src/Numerics/LinearAlgebra/Complex/Solvers/ILUTPPreconditioner.cs @@ -588,11 +588,11 @@ namespace MathNet.Numerics.LinearAlgebra.Complex.Solvers } /// - /// Sort vector descending, not changing vector but placing sorted indicies to + /// Sort vector descending, not changing vector but placing sorted indices to /// /// Start sort form /// Sort till upper bound - /// Array with sorted vector indicies + /// Array with sorted vector indices /// Source static void FindLargestItems(int lowerBound, int upperBound, int[] sortedIndices, Vector values) { @@ -742,11 +742,11 @@ namespace MathNet.Numerics.LinearAlgebra.Complex.Solvers } /// - /// Build heap for double indicies + /// Build heap for double indices /// /// Root position /// Length of - /// Indicies of + /// Indices of /// Target private static void BuildDoubleIndexHeap(int start, int count, int[] sortedIndices, Vector values) { @@ -758,9 +758,9 @@ namespace MathNet.Numerics.LinearAlgebra.Complex.Solvers } /// - /// Sift double indicies + /// Sift double indices /// - /// Indicies of + /// Indices of /// Target /// Root position /// Length of diff --git a/src/Numerics/LinearAlgebra/Complex/Solvers/MILU0Preconditioner.cs b/src/Numerics/LinearAlgebra/Complex/Solvers/MILU0Preconditioner.cs index 7ddb99a7..c8594b13 100644 --- a/src/Numerics/LinearAlgebra/Complex/Solvers/MILU0Preconditioner.cs +++ b/src/Numerics/LinearAlgebra/Complex/Solvers/MILU0Preconditioner.cs @@ -45,7 +45,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex.Solvers /// A simple milu(0) preconditioner. /// /// - /// Original Fortran code by Youcef Saad (07 January 2004) + /// Original Fortran code by Yousef Saad (07 January 2004) /// public sealed class MILU0Preconditioner : IPreconditioner { diff --git a/src/Numerics/LinearAlgebra/Complex/Solvers/MlkBiCgStab.cs b/src/Numerics/LinearAlgebra/Complex/Solvers/MlkBiCgStab.cs index 9150dea0..388e3aef 100644 --- a/src/Numerics/LinearAlgebra/Complex/Solvers/MlkBiCgStab.cs +++ b/src/Numerics/LinearAlgebra/Complex/Solvers/MlkBiCgStab.cs @@ -56,7 +56,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex.Solvers /// The algorithm was taken from:
/// ML(k)BiCGSTAB: A BiCGSTAB variant based on multiple Lanczos starting vectors ///
- /// Man-chung Yeung and Tony F. Chan + /// Man-Chung Yeung and Tony F. Chan ///
/// SIAM Journal of Scientific Computing ///
@@ -206,7 +206,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex.Solvers } /// - /// Create random vecrors array + /// Create random vectors array /// /// Number of vectors /// Size of each vector diff --git a/src/Numerics/LinearAlgebra/Complex/SparseMatrix.cs b/src/Numerics/LinearAlgebra/Complex/SparseMatrix.cs index 788280e5..a8f94bda 100644 --- a/src/Numerics/LinearAlgebra/Complex/SparseMatrix.cs +++ b/src/Numerics/LinearAlgebra/Complex/SparseMatrix.cs @@ -1274,7 +1274,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex } /// - /// Evaluates whether this matrix is hermitian (conjugate symmetric). + /// Evaluates whether this matrix is Hermitian (conjugate symmetric). /// public override bool IsHermitian() { diff --git a/src/Numerics/LinearAlgebra/Complex/SparseVector.cs b/src/Numerics/LinearAlgebra/Complex/SparseVector.cs index cbb04ced..7c422c93 100644 --- a/src/Numerics/LinearAlgebra/Complex/SparseVector.cs +++ b/src/Numerics/LinearAlgebra/Complex/SparseVector.cs @@ -173,7 +173,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex vnonZeroValues[indices[j]] = values[j] + scalar; } - //assign this vectors arrary to the new arrays. + //assign this vectors array to the new arrays. _storage.Values = vnonZeroValues; _storage.Indices = vnonZeroIndices; _storage.ValueCount = Count; diff --git a/src/Numerics/LinearAlgebra/Complex32/DenseMatrix.cs b/src/Numerics/LinearAlgebra/Complex32/DenseMatrix.cs index c7f49435..928c2f08 100644 --- a/src/Numerics/LinearAlgebra/Complex32/DenseMatrix.cs +++ b/src/Numerics/LinearAlgebra/Complex32/DenseMatrix.cs @@ -1261,7 +1261,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32 } /// - /// Evaluates whether this matrix is hermitian (conjugate symmetric). + /// Evaluates whether this matrix is Hermitian (conjugate symmetric). /// public override bool IsHermitian() { diff --git a/src/Numerics/LinearAlgebra/Complex32/DiagonalMatrix.cs b/src/Numerics/LinearAlgebra/Complex32/DiagonalMatrix.cs index b5e7c58d..c1e8871a 100644 --- a/src/Numerics/LinearAlgebra/Complex32/DiagonalMatrix.cs +++ b/src/Numerics/LinearAlgebra/Complex32/DiagonalMatrix.cs @@ -1006,7 +1006,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32 } /// - /// Evaluates whether this matrix is hermitian (conjugate symmetric). + /// Evaluates whether this matrix is Hermitian (conjugate symmetric). /// public sealed override bool IsHermitian() { diff --git a/src/Numerics/LinearAlgebra/Complex32/Factorization/DenseEvd.cs b/src/Numerics/LinearAlgebra/Complex32/Factorization/DenseEvd.cs index bcaf6f70..892b890d 100644 --- a/src/Numerics/LinearAlgebra/Complex32/Factorization/DenseEvd.cs +++ b/src/Numerics/LinearAlgebra/Complex32/Factorization/DenseEvd.cs @@ -44,8 +44,8 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32.Factorization /// Eigenvalues and eigenvectors of a complex matrix. /// /// - /// If A is hermitan, then A = V*D*V' where the eigenvalue matrix D is - /// diagonal and the eigenvector matrix V is hermitan. + /// If A is Hermitian, then A = V*D*V' where the eigenvalue matrix D is + /// diagonal and the eigenvector matrix V is Hermitian. /// I.e. A = V*D*V' and V*VH=I. /// If A is not symmetric, then the eigenvalue matrix D is block diagonal /// with the real eigenvalues in 1-by-1 blocks and any complex eigenvalues, @@ -104,7 +104,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32.Factorization } /// - /// Reduces a complex hermitian matrix to a real symmetric tridiagonal matrix using unitary similarity transformations. + /// Reduces a complex Hermitian matrix to a real symmetric tridiagonal matrix using unitary similarity transformations. /// /// Source matrix to reduce /// Output: Arrays for internal storage of real parts of eigenvalues diff --git a/src/Numerics/LinearAlgebra/Complex32/Factorization/QR.cs b/src/Numerics/LinearAlgebra/Complex32/Factorization/QR.cs index e7713c04..b4148fa0 100644 --- a/src/Numerics/LinearAlgebra/Complex32/Factorization/QR.cs +++ b/src/Numerics/LinearAlgebra/Complex32/Factorization/QR.cs @@ -43,7 +43,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32.Factorization /// /// /// The computation of the QR decomposition is done at construction time by Householder transformation. - /// If a factorization is peformed, the resulting Q matrix is an m x m matrix + /// If a factorization is performed, the resulting Q matrix is an m x m matrix /// and the R matrix is an m x n matrix. If a factorization is performed, the /// resulting Q matrix is an m x n matrix and the R matrix is an n x n matrix. /// diff --git a/src/Numerics/LinearAlgebra/Complex32/Factorization/UserEvd.cs b/src/Numerics/LinearAlgebra/Complex32/Factorization/UserEvd.cs index 75ef1b7f..fd5a2264 100644 --- a/src/Numerics/LinearAlgebra/Complex32/Factorization/UserEvd.cs +++ b/src/Numerics/LinearAlgebra/Complex32/Factorization/UserEvd.cs @@ -42,8 +42,8 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32.Factorization /// Eigenvalues and eigenvectors of a complex matrix. /// /// - /// If A is hermitan, then A = V*D*V' where the eigenvalue matrix D is - /// diagonal and the eigenvector matrix V is hermitan. + /// If A is Hermitian, then A = V*D*V' where the eigenvalue matrix D is + /// diagonal and the eigenvector matrix V is Hermitian. /// I.e. A = V*D*V' and V*VH=I. /// If A is not symmetric, then the eigenvalue matrix D is block diagonal /// with the real eigenvalues in 1-by-1 blocks and any complex eigenvalues, @@ -72,7 +72,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32.Factorization var order = matrix.RowCount; - // Initialize matricies for eigenvalues and eigenvectors + // Initialize matrices for eigenvalues and eigenvectors var eigenVectors = DenseMatrix.CreateIdentity(order); var blockDiagonal = Matrix.Build.SameAs(matrix, order, order); var eigenValues = new LinearAlgebra.Complex.DenseVector(order); @@ -128,7 +128,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32.Factorization } /// - /// Reduces a complex hermitian matrix to a real symmetric tridiagonal matrix using unitary similarity transformations. + /// Reduces a complex Hermitian matrix to a real symmetric tridiagonal matrix using unitary similarity transformations. /// /// Source matrix to reduce /// Output: Arrays for internal storage of real parts of eigenvalues diff --git a/src/Numerics/LinearAlgebra/Complex32/Factorization/UserSvd.cs b/src/Numerics/LinearAlgebra/Complex32/Factorization/UserSvd.cs index b4fca51c..9e672e32 100644 --- a/src/Numerics/LinearAlgebra/Complex32/Factorization/UserSvd.cs +++ b/src/Numerics/LinearAlgebra/Complex32/Factorization/UserSvd.cs @@ -352,11 +352,11 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32.Factorization } // This section of the program inspects for negligible elements in the s and e arrays. On - // completion the variables kase and l are set as follows. - // Kase = 1 if VectorS[m] and e[l-1] are negligible and l < m - // Kase = 2 if VectorS[l] is negligible and l < m - // Kase = 3 if e[l-1] is negligible, l < m, and VectorS[l, ..., VectorS[m] are not negligible (qr step). - // Лase = 4 if e[m-1] is negligible (convergence). + // completion the variables case and l are set as follows. + // Case = 1 if VectorS[m] and e[l-1] are negligible and l < m + // Case = 2 if VectorS[l] is negligible and l < m + // Case = 3 if e[l-1] is negligible, l < m, and VectorS[l, ..., VectorS[m] are not negligible (qr step). + // Case = 4 if e[m-1] is negligible (convergence). float ztest; float test; for (l = m - 2; l >= 0; l--) @@ -416,7 +416,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32.Factorization l = l + 1; - // Perform the task indicated by kase. + // Perform the task indicated by case. int k; float f; float sn; @@ -662,7 +662,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32.Factorization } /// - /// Given the Cartesian coordinates (da, db) of a point p, these fucntion return the parameters da, db, c, and s + /// Given the Cartesian coordinates (da, db) of a point p, these function return the parameters da, db, c, and s /// associated with the Givens rotation that zeros the y-coordinate of the point. /// /// Provides the x-coordinate of the point p. On exit contains the parameter r associated with the Givens rotation diff --git a/src/Numerics/LinearAlgebra/Complex32/Matrix.cs b/src/Numerics/LinearAlgebra/Complex32/Matrix.cs index c44ea42f..831a8532 100644 --- a/src/Numerics/LinearAlgebra/Complex32/Matrix.cs +++ b/src/Numerics/LinearAlgebra/Complex32/Matrix.cs @@ -792,7 +792,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32 } /// - /// Evaluates whether this matrix is hermitian (conjugate symmetric). + /// Evaluates whether this matrix is Hermitian (conjugate symmetric). /// public override bool IsHermitian() { diff --git a/src/Numerics/LinearAlgebra/Complex32/Solvers/ILUTPPreconditioner.cs b/src/Numerics/LinearAlgebra/Complex32/Solvers/ILUTPPreconditioner.cs index 140f6998..a4423def 100644 --- a/src/Numerics/LinearAlgebra/Complex32/Solvers/ILUTPPreconditioner.cs +++ b/src/Numerics/LinearAlgebra/Complex32/Solvers/ILUTPPreconditioner.cs @@ -583,11 +583,11 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32.Solvers } /// - /// Sort vector descending, not changing vector but placing sorted indicies to + /// Sort vector descending, not changing vector but placing sorted indices to /// /// Start sort form /// Sort till upper bound - /// Array with sorted vector indicies + /// Array with sorted vector indices /// Source static void FindLargestItems(int lowerBound, int upperBound, int[] sortedIndices, Vector values) { @@ -737,11 +737,11 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32.Solvers } /// - /// Build heap for double indicies + /// Build heap for double indices /// /// Root position /// Length of - /// Indicies of + /// Indices of /// Target private static void BuildDoubleIndexHeap(int start, int count, int[] sortedIndices, Vector values) { @@ -753,9 +753,9 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32.Solvers } /// - /// Sift double indicies + /// Sift double indices /// - /// Indicies of + /// Indices of /// Target /// Root position /// Length of diff --git a/src/Numerics/LinearAlgebra/Complex32/Solvers/MILU0Preconditioner.cs b/src/Numerics/LinearAlgebra/Complex32/Solvers/MILU0Preconditioner.cs index 82393d6f..8cc8edd4 100644 --- a/src/Numerics/LinearAlgebra/Complex32/Solvers/MILU0Preconditioner.cs +++ b/src/Numerics/LinearAlgebra/Complex32/Solvers/MILU0Preconditioner.cs @@ -40,7 +40,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32.Solvers /// A simple milu(0) preconditioner. /// /// - /// Original Fortran code by Youcef Saad (07 January 2004) + /// Original Fortran code by Yousef Saad (07 January 2004) /// public sealed class MILU0Preconditioner : IPreconditioner { diff --git a/src/Numerics/LinearAlgebra/Complex32/Solvers/MlkBiCgStab.cs b/src/Numerics/LinearAlgebra/Complex32/Solvers/MlkBiCgStab.cs index ecad0754..a358af00 100644 --- a/src/Numerics/LinearAlgebra/Complex32/Solvers/MlkBiCgStab.cs +++ b/src/Numerics/LinearAlgebra/Complex32/Solvers/MlkBiCgStab.cs @@ -49,7 +49,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32.Solvers /// The algorithm was taken from:
/// ML(k)BiCGSTAB: A BiCGSTAB variant based on multiple Lanczos starting vectors ///
- /// Man-chung Yeung and Tony F. Chan + /// Man-Chung Yeung and Tony F. Chan ///
/// SIAM Journal of Scientific Computing ///
diff --git a/src/Numerics/LinearAlgebra/Complex32/SparseMatrix.cs b/src/Numerics/LinearAlgebra/Complex32/SparseMatrix.cs index d11af508..5c0eef58 100644 --- a/src/Numerics/LinearAlgebra/Complex32/SparseMatrix.cs +++ b/src/Numerics/LinearAlgebra/Complex32/SparseMatrix.cs @@ -1268,7 +1268,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32 } /// - /// Evaluates whether this matrix is hermitian (conjugate symmetric). + /// Evaluates whether this matrix is Hermitian (conjugate symmetric). /// public override bool IsHermitian() { diff --git a/src/Numerics/LinearAlgebra/Complex32/SparseVector.cs b/src/Numerics/LinearAlgebra/Complex32/SparseVector.cs index 3a3193c9..582576ce 100644 --- a/src/Numerics/LinearAlgebra/Complex32/SparseVector.cs +++ b/src/Numerics/LinearAlgebra/Complex32/SparseVector.cs @@ -168,7 +168,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32 vnonZeroValues[indices[j]] = values[j] + scalar; } - //assign this vectors arrary to the new arrays. + //assign this vectors array to the new arrays. _storage.Values = vnonZeroValues; _storage.Indices = vnonZeroIndices; _storage.ValueCount = Count; diff --git a/src/Numerics/LinearAlgebra/Double/Factorization/UserEvd.cs b/src/Numerics/LinearAlgebra/Double/Factorization/UserEvd.cs index f254b7cf..71c32907 100644 --- a/src/Numerics/LinearAlgebra/Double/Factorization/UserEvd.cs +++ b/src/Numerics/LinearAlgebra/Double/Factorization/UserEvd.cs @@ -73,7 +73,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double.Factorization var order = matrix.RowCount; - // Initialize matricies for eigenvalues and eigenvectors + // Initialize matrices for eigenvalues and eigenvectors var eigenVectors = Matrix.Build.SameAs(matrix, order, order, fullyMutable: true); var blockDiagonal = Matrix.Build.SameAs(matrix, order, order); var eigenValues = new LinearAlgebra.Complex.DenseVector(order); diff --git a/src/Numerics/LinearAlgebra/Double/Factorization/UserSvd.cs b/src/Numerics/LinearAlgebra/Double/Factorization/UserSvd.cs index e7e5022f..5aeb792b 100644 --- a/src/Numerics/LinearAlgebra/Double/Factorization/UserSvd.cs +++ b/src/Numerics/LinearAlgebra/Double/Factorization/UserSvd.cs @@ -336,11 +336,11 @@ namespace MathNet.Numerics.LinearAlgebra.Double.Factorization } // This section of the program inspects for negligible elements in the s and e arrays. On - // completion the variables kase and l are set as follows. - // Kase = 1 if VectorS[m] and e[l-1] are negligible and l < m - // Kase = 2 if VectorS[l] is negligible and l < m - // Kase = 3 if e[l-1] is negligible, l < m, and VectorS[l, ..., VectorS[m] are not negligible (qr step). - // Лase = 4 if e[m-1] is negligible (convergence). + // completion the variables case and l are set as follows. + // Case = 1 if VectorS[m] and e[l-1] are negligible and l < m + // Case = 2 if VectorS[l] is negligible and l < m + // Case = 3 if e[l-1] is negligible, l < m, and VectorS[l, ..., VectorS[m] are not negligible (qr step). + // Case = 4 if e[m-1] is negligible (convergence). double ztest; double test; for (l = m - 2; l >= 0; l--) @@ -400,7 +400,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double.Factorization l = l + 1; - // Perform the task indicated by kase. + // Perform the task indicated by case. int k; double f; double sn; @@ -645,7 +645,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double.Factorization } /// - /// Given the Cartesian coordinates (da, db) of a point p, these fucntion return the parameters da, db, c, and s + /// Given the Cartesian coordinates (da, db) of a point p, these function return the parameters da, db, c, and s /// associated with the Givens rotation that zeros the y-coordinate of the point. /// /// Provides the x-coordinate of the point p. On exit contains the parameter r associated with the Givens rotation diff --git a/src/Numerics/LinearAlgebra/Double/Matrix.cs b/src/Numerics/LinearAlgebra/Double/Matrix.cs index c85a8052..eec49cf8 100644 --- a/src/Numerics/LinearAlgebra/Double/Matrix.cs +++ b/src/Numerics/LinearAlgebra/Double/Matrix.cs @@ -762,7 +762,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double } /// - /// Evaluates whether this matrix is hermitian (conjugate symmetric). + /// Evaluates whether this matrix is Hermitian (conjugate symmetric). /// public sealed override bool IsHermitian() { diff --git a/src/Numerics/LinearAlgebra/Double/Solvers/ILUTPPreconditioner.cs b/src/Numerics/LinearAlgebra/Double/Solvers/ILUTPPreconditioner.cs index da4199d8..61466030 100644 --- a/src/Numerics/LinearAlgebra/Double/Solvers/ILUTPPreconditioner.cs +++ b/src/Numerics/LinearAlgebra/Double/Solvers/ILUTPPreconditioner.cs @@ -581,11 +581,11 @@ namespace MathNet.Numerics.LinearAlgebra.Double.Solvers } /// - /// Sort vector descending, not changing vector but placing sorted indicies to + /// Sort vector descending, not changing vector but placing sorted indices to /// /// Start sort form /// Sort till upper bound - /// Array with sorted vector indicies + /// Array with sorted vector indices /// Source static void FindLargestItems(int lowerBound, int upperBound, int[] sortedIndices, Vector values) { @@ -735,11 +735,11 @@ namespace MathNet.Numerics.LinearAlgebra.Double.Solvers } /// - /// Build heap for double indicies + /// Build heap for double indices /// /// Root position /// Length of - /// Indicies of + /// Indices of /// Target private static void BuildDoubleIndexHeap(int start, int count, int[] sortedIndices, Vector values) { @@ -751,9 +751,9 @@ namespace MathNet.Numerics.LinearAlgebra.Double.Solvers } /// - /// Sift double indicies + /// Sift double indices /// - /// Indicies of + /// Indices of /// Target /// Root position /// Length of diff --git a/src/Numerics/LinearAlgebra/Double/Solvers/MILU0Preconditioner.cs b/src/Numerics/LinearAlgebra/Double/Solvers/MILU0Preconditioner.cs index fd3d78da..1606a805 100644 --- a/src/Numerics/LinearAlgebra/Double/Solvers/MILU0Preconditioner.cs +++ b/src/Numerics/LinearAlgebra/Double/Solvers/MILU0Preconditioner.cs @@ -38,7 +38,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double.Solvers /// A simple milu(0) preconditioner. /// /// - /// Original Fortran code by Youcef Saad (07 January 2004) + /// Original Fortran code by Yousef Saad (07 January 2004) /// public sealed class MILU0Preconditioner : IPreconditioner { diff --git a/src/Numerics/LinearAlgebra/Double/Solvers/MlkBiCgStab.cs b/src/Numerics/LinearAlgebra/Double/Solvers/MlkBiCgStab.cs index c7bd9603..c22802c2 100644 --- a/src/Numerics/LinearAlgebra/Double/Solvers/MlkBiCgStab.cs +++ b/src/Numerics/LinearAlgebra/Double/Solvers/MlkBiCgStab.cs @@ -49,7 +49,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double.Solvers /// The algorithm was taken from:
/// ML(k)BiCGSTAB: A BiCGSTAB variant based on multiple Lanczos starting vectors ///
- /// Man-chung Yeung and Tony F. Chan + /// Man-Chung Yeung and Tony F. Chan ///
/// SIAM Journal of Scientific Computing ///
@@ -199,7 +199,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double.Solvers } /// - /// Create random vecrors array + /// Create random vectors array /// /// Number of vectors /// Size of each vector diff --git a/src/Numerics/LinearAlgebra/Matrix.Arithmetic.cs b/src/Numerics/LinearAlgebra/Matrix.Arithmetic.cs index ed5d903a..01e437e2 100644 --- a/src/Numerics/LinearAlgebra/Matrix.Arithmetic.cs +++ b/src/Numerics/LinearAlgebra/Matrix.Arithmetic.cs @@ -1568,7 +1568,7 @@ namespace MathNet.Numerics.LinearAlgebra /// Function which takes two matrices, modifies the second in place and returns void /// The other matrix to be passed to the function as argument. It is not modified /// The resulting matrix - /// If this amtrix and are not the same dimension. + /// If this matrix and are not the same dimension. protected Matrix PointwiseBinary(Action, Matrix> f, Matrix other) { if (ColumnCount != other.ColumnCount || RowCount != other.RowCount) diff --git a/src/Numerics/LinearAlgebra/Matrix.Operators.cs b/src/Numerics/LinearAlgebra/Matrix.Operators.cs index ee19f15c..6a139c4e 100644 --- a/src/Numerics/LinearAlgebra/Matrix.Operators.cs +++ b/src/Numerics/LinearAlgebra/Matrix.Operators.cs @@ -135,7 +135,7 @@ namespace MathNet.Numerics.LinearAlgebra } /// - /// Substracts each element of a matrix from a scalar. + /// Subtracts each element of a matrix from a scalar. /// /// This operator will allocate new memory for the result. It will /// choose the representation of the provided matrix. diff --git a/src/Numerics/LinearAlgebra/Matrix.cs b/src/Numerics/LinearAlgebra/Matrix.cs index 0ae1e2d0..6a9849c3 100644 --- a/src/Numerics/LinearAlgebra/Matrix.cs +++ b/src/Numerics/LinearAlgebra/Matrix.cs @@ -1278,7 +1278,7 @@ namespace MathNet.Numerics.LinearAlgebra } /// - /// Evaluates whether this matrix is hermitian (conjugate symmetric). + /// Evaluates whether this matrix is Hermitian (conjugate symmetric). /// public abstract bool IsHermitian(); diff --git a/src/Numerics/LinearAlgebra/Options.cs b/src/Numerics/LinearAlgebra/Options.cs index 61641694..73dcbd99 100644 --- a/src/Numerics/LinearAlgebra/Options.cs +++ b/src/Numerics/LinearAlgebra/Options.cs @@ -73,7 +73,7 @@ namespace MathNet.Numerics.LinearAlgebra Symmetric = 1, /// - /// A matrix is hermitian (conjugate symmetric). + /// A matrix is Hermitian (conjugate symmetric). /// Hermitian = 2, diff --git a/src/Numerics/LinearAlgebra/Single/Factorization/QR.cs b/src/Numerics/LinearAlgebra/Single/Factorization/QR.cs index 150da465..d587f1a1 100644 --- a/src/Numerics/LinearAlgebra/Single/Factorization/QR.cs +++ b/src/Numerics/LinearAlgebra/Single/Factorization/QR.cs @@ -41,7 +41,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single.Factorization /// /// /// The computation of the QR decomposition is done at construction time by Householder transformation. - /// If a factorization is peformed, the resulting Q matrix is an m x m matrix + /// If a factorization is performed, the resulting Q matrix is an m x m matrix /// and the R matrix is an m x n matrix. If a factorization is performed, the /// resulting Q matrix is an m x n matrix and the R matrix is an n x n matrix. /// diff --git a/src/Numerics/LinearAlgebra/Single/Factorization/UserEvd.cs b/src/Numerics/LinearAlgebra/Single/Factorization/UserEvd.cs index bb2a21ae..6a7b49ed 100644 --- a/src/Numerics/LinearAlgebra/Single/Factorization/UserEvd.cs +++ b/src/Numerics/LinearAlgebra/Single/Factorization/UserEvd.cs @@ -72,7 +72,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single.Factorization var order = matrix.RowCount; - // Initialize matricies for eigenvalues and eigenvectors + // Initialize matrices for eigenvalues and eigenvectors var eigenVectors = Matrix.Build.SameAs(matrix, order, order, fullyMutable: true); var blockDiagonal = Matrix.Build.SameAs(matrix, order, order); var eigenValues = new LinearAlgebra.Complex.DenseVector(order); diff --git a/src/Numerics/LinearAlgebra/Single/Factorization/UserSvd.cs b/src/Numerics/LinearAlgebra/Single/Factorization/UserSvd.cs index f0cf4480..b618a083 100644 --- a/src/Numerics/LinearAlgebra/Single/Factorization/UserSvd.cs +++ b/src/Numerics/LinearAlgebra/Single/Factorization/UserSvd.cs @@ -336,11 +336,11 @@ namespace MathNet.Numerics.LinearAlgebra.Single.Factorization } // This section of the program inspects for negligible elements in the s and e arrays. On - // completion the variables kase and l are set as follows. - // Kase = 1 if VectorS[m] and e[l-1] are negligible and l < m - // Kase = 2 if VectorS[l] is negligible and l < m - // Kase = 3 if e[l-1] is negligible, l < m, and VectorS[l, ..., VectorS[m] are not negligible (qr step). - // Лase = 4 if e[m-1] is negligible (convergence). + // completion the variables case and l are set as follows. + // Case = 1 if VectorS[m] and e[l-1] are negligible and l < m + // Case = 2 if VectorS[l] is negligible and l < m + // Case = 3 if e[l-1] is negligible, l < m, and VectorS[l, ..., VectorS[m] are not negligible (qr step). + // Case = 4 if e[m-1] is negligible (convergence). float ztest; float test; for (l = m - 2; l >= 0; l--) @@ -400,7 +400,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single.Factorization l = l + 1; - // Perform the task indicated by kase. + // Perform the task indicated by case. int k; float f; float sn; @@ -645,7 +645,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single.Factorization } /// - /// Given the Cartesian coordinates (da, db) of a point p, these fucntion return the parameters da, db, c, and s + /// Given the Cartesian coordinates (da, db) of a point p, these function return the parameters da, db, c, and s /// associated with the Givens rotation that zeros the y-coordinate of the point. /// /// Provides the x-coordinate of the point p. On exit contains the parameter r associated with the Givens rotation diff --git a/src/Numerics/LinearAlgebra/Single/Matrix.cs b/src/Numerics/LinearAlgebra/Single/Matrix.cs index 32896be7..ea81116a 100644 --- a/src/Numerics/LinearAlgebra/Single/Matrix.cs +++ b/src/Numerics/LinearAlgebra/Single/Matrix.cs @@ -763,7 +763,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single } /// - /// Evaluates whether this matrix is hermitian (conjugate symmetric). + /// Evaluates whether this matrix is Hermitian (conjugate symmetric). /// public sealed override bool IsHermitian() { diff --git a/src/Numerics/LinearAlgebra/Single/Solvers/ILUTPPreconditioner.cs b/src/Numerics/LinearAlgebra/Single/Solvers/ILUTPPreconditioner.cs index acd27f4f..cb16391f 100644 --- a/src/Numerics/LinearAlgebra/Single/Solvers/ILUTPPreconditioner.cs +++ b/src/Numerics/LinearAlgebra/Single/Solvers/ILUTPPreconditioner.cs @@ -581,11 +581,11 @@ namespace MathNet.Numerics.LinearAlgebra.Single.Solvers } /// - /// Sort vector descending, not changing vector but placing sorted indicies to + /// Sort vector descending, not changing vector but placing sorted indices to /// /// Start sort form /// Sort till upper bound - /// Array with sorted vector indicies + /// Array with sorted vector indices /// Source static void FindLargestItems(int lowerBound, int upperBound, int[] sortedIndices, Vector values) { @@ -735,11 +735,11 @@ namespace MathNet.Numerics.LinearAlgebra.Single.Solvers } /// - /// Build heap for double indicies + /// Build heap for double indices /// /// Root position /// Length of - /// Indicies of + /// Indices of /// Target private static void BuildDoubleIndexHeap(int start, int count, int[] sortedIndices, Vector values) { @@ -751,9 +751,9 @@ namespace MathNet.Numerics.LinearAlgebra.Single.Solvers } /// - /// Sift double indicies + /// Sift double indices /// - /// Indicies of + /// Indices of /// Target /// Root position /// Length of diff --git a/src/Numerics/LinearAlgebra/Single/Solvers/MILU0Preconditioner.cs b/src/Numerics/LinearAlgebra/Single/Solvers/MILU0Preconditioner.cs index a6c64bf1..1d058639 100644 --- a/src/Numerics/LinearAlgebra/Single/Solvers/MILU0Preconditioner.cs +++ b/src/Numerics/LinearAlgebra/Single/Solvers/MILU0Preconditioner.cs @@ -38,7 +38,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single.Solvers /// A simple milu(0) preconditioner. /// /// - /// Original Fortran code by Youcef Saad (07 January 2004) + /// Original Fortran code by Yousef Saad (07 January 2004) /// public sealed class MILU0Preconditioner : IPreconditioner { diff --git a/src/Numerics/LinearAlgebra/Single/Solvers/MlkBiCgStab.cs b/src/Numerics/LinearAlgebra/Single/Solvers/MlkBiCgStab.cs index 86de1fd5..121d6572 100644 --- a/src/Numerics/LinearAlgebra/Single/Solvers/MlkBiCgStab.cs +++ b/src/Numerics/LinearAlgebra/Single/Solvers/MlkBiCgStab.cs @@ -48,7 +48,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single.Solvers /// The algorithm was taken from:
/// ML(k)BiCGSTAB: A BiCGSTAB variant based on multiple Lanczos starting vectors ///
- /// Man-chung Yeung and Tony F. Chan + /// Man-Chung Yeung and Tony F. Chan ///
/// SIAM Journal of Scientific Computing ///
diff --git a/src/Numerics/LinearAlgebra/Single/SparseVector.cs b/src/Numerics/LinearAlgebra/Single/SparseVector.cs index 0a88758d..012ce589 100644 --- a/src/Numerics/LinearAlgebra/Single/SparseVector.cs +++ b/src/Numerics/LinearAlgebra/Single/SparseVector.cs @@ -168,7 +168,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single vnonZeroValues[indices[j]] = values[j] + scalar; } - //assign this vectors arrary to the new arrays. + //assign this vectors array to the new arrays. _storage.Values = vnonZeroValues; _storage.Indices = vnonZeroIndices; _storage.ValueCount = Count; diff --git a/src/Numerics/LinearAlgebra/Storage/SparseVectorStorage.cs b/src/Numerics/LinearAlgebra/Storage/SparseVectorStorage.cs index 9ec937ad..3d4a58cd 100644 --- a/src/Numerics/LinearAlgebra/Storage/SparseVectorStorage.cs +++ b/src/Numerics/LinearAlgebra/Storage/SparseVectorStorage.cs @@ -83,7 +83,7 @@ namespace MathNet.Numerics.LinearAlgebra.Storage /// public override T At(int index) { - // Search if item idex exists in NonZeroIndices array in range "0 - nonzero values count" + // Search if item index exists in NonZeroIndices array in range "0 - nonzero values count" var itemIndex = Array.BinarySearch(Indices, 0, ValueCount, index); return itemIndex >= 0 ? Values[itemIndex] : Zero; } diff --git a/src/Numerics/LinearAlgebra/Vector.Arithmetic.cs b/src/Numerics/LinearAlgebra/Vector.Arithmetic.cs index bb99d051..cb14d027 100644 --- a/src/Numerics/LinearAlgebra/Vector.Arithmetic.cs +++ b/src/Numerics/LinearAlgebra/Vector.Arithmetic.cs @@ -431,7 +431,7 @@ namespace MathNet.Numerics.LinearAlgebra /// Subtracts another vector from this vector. /// /// The vector to subtract from this one. - /// A new vector containing the subtraction of the the two vectors. + /// A new vector containing the subtraction of the two vectors. /// If this vector and are not the same size. public Vector Subtract(Vector other) { diff --git a/src/Numerics/LinearAlgebra/Vector.BCL.cs b/src/Numerics/LinearAlgebra/Vector.BCL.cs index c9d917ca..de5c8a08 100644 --- a/src/Numerics/LinearAlgebra/Vector.BCL.cs +++ b/src/Numerics/LinearAlgebra/Vector.BCL.cs @@ -353,9 +353,9 @@ namespace MathNet.Numerics.LinearAlgebra /// Returns a string that represents the content of this vector, column by column. /// /// Maximum number of entries and thus lines per column. Typical value: 12; Minimum: 3. - /// Maximum number of chatacters per line over all columns. Typical value: 80; Minimum: 16. + /// Maximum number of characters per line over all columns. Typical value: 80; Minimum: 16. /// Character to use to print if there is not enough space to print all entries. Typical value: "..". - /// Character to use to separate two coluns on a line. Typical value: " " (2 spaces). + /// Character to use to separate two columns on a line. Typical value: " " (2 spaces). /// Character to use to separate two rows/lines. Typical value: Environment.NewLine. /// Function to provide a string for any given entry value. public string ToVectorString(int maxPerColumn, int maxCharactersWidth, string ellipsis, string columnSeparator, string rowSeparator, Func formatValue) @@ -369,7 +369,7 @@ namespace MathNet.Numerics.LinearAlgebra /// Returns a string that represents the content of this vector, column by column. /// /// Maximum number of entries and thus lines per column. Typical value: 12; Minimum: 3. - /// Maximum number of chatacters per line over all columns. Typical value: 80; Minimum: 16. + /// Maximum number of characters per line over all columns. Typical value: 80; Minimum: 16. /// Floating point format string. Can be null. Default value: G6. /// Format provider or culture. Can be null. public string ToVectorString(int maxPerColumn, int maxCharactersWidth, string format = null, IFormatProvider provider = null) @@ -401,7 +401,7 @@ namespace MathNet.Numerics.LinearAlgebra /// Returns a string that summarizes this vector, column by column and with a type header. /// /// Maximum number of entries and thus lines per column. Typical value: 12; Minimum: 3. - /// Maximum number of chatacters per line over all columns. Typical value: 80; Minimum: 16. + /// Maximum number of characters per line over all columns. Typical value: 80; Minimum: 16. /// Floating point format string. Can be null. Default value: G6. /// Format provider or culture. Can be null. public string ToString(int maxPerColumn, int maxCharactersWidth, string format = null, IFormatProvider provider = null) diff --git a/src/Numerics/LinearAlgebra/Vector.Operators.cs b/src/Numerics/LinearAlgebra/Vector.Operators.cs index 9f8b031c..20b74e60 100644 --- a/src/Numerics/LinearAlgebra/Vector.Operators.cs +++ b/src/Numerics/LinearAlgebra/Vector.Operators.cs @@ -120,7 +120,7 @@ namespace MathNet.Numerics.LinearAlgebra } /// - /// Substracts each element of a vector from a scalar. + /// Subtracts each element of a vector from a scalar. /// /// The scalar value to subtract from. /// The vector to subtract. diff --git a/src/Numerics/LinearAlgebra/Vector.cs b/src/Numerics/LinearAlgebra/Vector.cs index 21ab4a03..73e436b2 100644 --- a/src/Numerics/LinearAlgebra/Vector.cs +++ b/src/Numerics/LinearAlgebra/Vector.cs @@ -205,7 +205,7 @@ namespace MathNet.Numerics.LinearAlgebra /// Copies the values of a given vector into a region in this vector. /// /// The field to start copying to - /// The number of fields to cpy. Must be positive. + /// The number of fields to copy. Must be positive. /// The sub-vector to copy from. /// If is public void SetSubVector(int index, int count, Vector subVector) diff --git a/src/Numerics/Optimization/BfgsMinimizer.cs b/src/Numerics/Optimization/BfgsMinimizer.cs index a1837378..cd4df010 100644 --- a/src/Numerics/Optimization/BfgsMinimizer.cs +++ b/src/Numerics/Optimization/BfgsMinimizer.cs @@ -43,7 +43,7 @@ namespace MathNet.Numerics.Optimization /// /// The gradient tolerance /// The parameter tolerance - /// The funciton progress tolerance + /// The function progress tolerance /// The maximum number of iterations public BfgsMinimizer(double gradientTolerance, double parameterTolerance, double functionProgressTolerance, int maximumIterations=1000) :base(gradientTolerance,parameterTolerance,functionProgressTolerance,maximumIterations) diff --git a/src/Numerics/Optimization/LineSearch/WeakWolfeLineSearch.cs b/src/Numerics/Optimization/LineSearch/WeakWolfeLineSearch.cs index 5048fdee..a0df6761 100644 --- a/src/Numerics/Optimization/LineSearch/WeakWolfeLineSearch.cs +++ b/src/Numerics/Optimization/LineSearch/WeakWolfeLineSearch.cs @@ -33,7 +33,7 @@ using MathNet.Numerics.LinearAlgebra; namespace MathNet.Numerics.Optimization.LineSearch { /// - /// Search for a step size alpha that satisfies the weak wolfe conditions. The weak Wolfe + /// Search for a step size alpha that satisfies the weak Wolfe conditions. The weak Wolfe /// Conditions are /// i) Armijo Rule: f(x_k + alpha_k p_k) <= f(x_k) + c1 alpha_k p_k^T g(x_k) /// ii) Curvature Condition: p_k^T g(x_k + alpha_k p_k) >= c2 p_k^T g(x_k) diff --git a/src/Numerics/Optimization/MinimizerBase.cs b/src/Numerics/Optimization/MinimizerBase.cs index e7f27c7f..9996eae5 100644 --- a/src/Numerics/Optimization/MinimizerBase.cs +++ b/src/Numerics/Optimization/MinimizerBase.cs @@ -48,7 +48,7 @@ namespace MathNet.Numerics.Optimization /// /// The gradient tolerance /// The parameter tolerance - /// The funciton progress tolerance + /// The function progress tolerance /// The maximum number of iterations protected MinimizerBase(double gradientTolerance, double parameterTolerance, double functionProgressTolerance, int maximumIterations) { diff --git a/src/Numerics/Optimization/NelderMeadSimplex.cs b/src/Numerics/Optimization/NelderMeadSimplex.cs index 088f3d82..c33a7a1b 100644 --- a/src/Numerics/Optimization/NelderMeadSimplex.cs +++ b/src/Numerics/Optimization/NelderMeadSimplex.cs @@ -27,7 +27,7 @@ // OTHER DEALINGS IN THE SOFTWARE. // -// Converted from code relased with a MIT liscense available at https://code.google.com/p/nelder-mead-simplex/ +// Converted from code released with a MIT license available at https://code.google.com/p/nelder-mead-simplex/ using MathNet.Numerics.LinearAlgebra; using System; @@ -55,12 +55,12 @@ namespace MathNet.Numerics.Optimization } /// - /// Finds the minimum of the objective function without an intial pertubation, the default values used + /// Finds the minimum of the objective function without an initial perturbation, the default values used /// by fminsearch() in Matlab are used instead /// http://se.mathworks.com/help/matlab/math/optimizing-nonlinear-functions.html#bsgpq6p-11 /// /// The objective function, no gradient or hessian needed - /// The intial guess + /// The initial guess /// The minimum point public MinimizationResult FindMinimum(IObjectiveFunction objectiveFunction, Vector initialGuess) { @@ -68,11 +68,11 @@ namespace MathNet.Numerics.Optimization } /// - /// Finds the minimum of the objective function with an intial pertubation + /// Finds the minimum of the objective function with an initial perturbation /// /// The objective function, no gradient or hessian needed - /// The intial guess - /// The inital pertubation + /// The initial guess + /// The initial perturbation /// The minimum point public MinimizationResult FindMinimum(IObjectiveFunction objectiveFunction, Vector initialGuess, Vector initalPertubation) { @@ -80,12 +80,12 @@ namespace MathNet.Numerics.Optimization } /// - /// Finds the minimum of the objective function without an intial pertubation, the default values used + /// Finds the minimum of the objective function without an initial perturbation, the default values used /// by fminsearch() in Matlab are used instead /// http://se.mathworks.com/help/matlab/math/optimizing-nonlinear-functions.html#bsgpq6p-11 /// /// The objective function, no gradient or hessian needed - /// The intial guess + /// The initial guess /// The minimum point public static MinimizationResult Minimum(IObjectiveFunction objectiveFunction, Vector initialGuess, double convergenceTolerance=1e-8, int maximumIterations=1000) { @@ -98,11 +98,11 @@ namespace MathNet.Numerics.Optimization } /// - /// Finds the minimum of the objective function with an intial pertubation + /// Finds the minimum of the objective function with an initial perturbation /// /// The objective function, no gradient or hessian needed - /// The intial guess - /// The inital pertubation + /// The initial guess + /// The initial perturbation /// The minimum point public static MinimizationResult Minimum(IObjectiveFunction objectiveFunction, Vector initialGuess, Vector initalPertubation, double convergenceTolerance=1e-8, int maximumIterations=1000) { diff --git a/src/Numerics/Precision.Equality.cs b/src/Numerics/Precision.Equality.cs index 068061db..48e8754e 100644 --- a/src/Numerics/Precision.Equality.cs +++ b/src/Numerics/Precision.Equality.cs @@ -258,7 +258,7 @@ namespace MathNet.Numerics } /// - /// Checks whether two Compex numbers are almost equal. + /// Checks whether two Complex numbers are almost equal. /// /// The first number /// The second number @@ -269,7 +269,7 @@ namespace MathNet.Numerics } /// - /// Checks whether two Compex numbers are almost equal. + /// Checks whether two Complex numbers are almost equal. /// /// The first number /// The second number @@ -302,7 +302,7 @@ namespace MathNet.Numerics } /// - /// Checks whether two Compex numbers are almost equal. + /// Checks whether two Complex numbers are almost equal. /// /// The first number /// The second number @@ -313,7 +313,7 @@ namespace MathNet.Numerics } /// - /// Checks whether two Compex numbers are almost equal. + /// Checks whether two Complex numbers are almost equal. /// /// The first number /// The second number diff --git a/src/Numerics/Providers/FourierTransform/Mkl/MklFourierTransformProvider.cs b/src/Numerics/Providers/FourierTransform/Mkl/MklFourierTransformProvider.cs index 23515319..219eb218 100644 --- a/src/Numerics/Providers/FourierTransform/Mkl/MklFourierTransformProvider.cs +++ b/src/Numerics/Providers/FourierTransform/Mkl/MklFourierTransformProvider.cs @@ -72,7 +72,7 @@ namespace MathNet.Numerics.Providers.FourierTransform.Mkl int fftMinor = SafeNativeMethods.query_capability((int) ProviderCapability.FourierTransformMinor); if (!(fftMajor == 1 && fftMinor >= 0)) { - throw new NotSupportedException(string.Format("MKL Native Provider not compatible. Expecting fourier transform v1 but provider implements v{0}.", fftMajor)); + throw new NotSupportedException(string.Format("MKL Native Provider not compatible. Expecting Fourier transform v1 but provider implements v{0}.", fftMajor)); } } diff --git a/src/Numerics/Providers/LinearAlgebra/Cuda/CudaLinearAlgebraProvider.cs b/src/Numerics/Providers/LinearAlgebra/Cuda/CudaLinearAlgebraProvider.cs index bfd0cd99..717bd370 100644 --- a/src/Numerics/Providers/LinearAlgebra/Cuda/CudaLinearAlgebraProvider.cs +++ b/src/Numerics/Providers/LinearAlgebra/Cuda/CudaLinearAlgebraProvider.cs @@ -88,7 +88,7 @@ namespace MathNet.Numerics.Providers.LinearAlgebra.Cuda throw new ArgumentException("Invalid value"); case 8: // CUBLAS_STATUS_ARCH_MISMATCH - throw new NotSupportedException("The device does not support this opeation."); + throw new NotSupportedException("The device does not support this operation."); case 11: // CUBLAS_STATUS_MAPPING_ERROR throw new Exception("Mapping error."); diff --git a/src/Numerics/Providers/LinearAlgebra/ILinearAlgebraProvider.cs b/src/Numerics/Providers/LinearAlgebra/ILinearAlgebraProvider.cs index a246c3b7..0565f3db 100644 --- a/src/Numerics/Providers/LinearAlgebra/ILinearAlgebraProvider.cs +++ b/src/Numerics/Providers/LinearAlgebra/ILinearAlgebraProvider.cs @@ -438,10 +438,10 @@ namespace MathNet.Numerics.Providers.LinearAlgebra /// /// Whether the matrix is symmetric or not. /// The order of the matrix. - /// The matrix to decompose. The lenth of the array must be order * order. - /// On output, the matrix contains the eigen vectors. The lenth of the array must be order * order. - /// On output, the eigen values (λ) of matrix in ascending value. The length of the arry must . - /// On output, the block diagonal eigenvalue matrix. The lenth of the array must be order * order. + /// The matrix to decompose. The length of the array must be order * order. + /// On output, the matrix contains the eigen vectors. The length of the array must be order * order. + /// On output, the eigen values (λ) of matrix in ascending value. The length of the array must . + /// On output, the block diagonal eigenvalue matrix. The length of the array must be order * order. void EigenDecomp(bool isSymmetric, int order, T[] matrix, T[] matrixEv, Complex[] vectorEv, T[] matrixD); } } diff --git a/src/Numerics/Providers/LinearAlgebra/ManagedLinearAlgebraProvider.Complex.cs b/src/Numerics/Providers/LinearAlgebra/ManagedLinearAlgebraProvider.Complex.cs index fa7649df..48657a4f 100644 --- a/src/Numerics/Providers/LinearAlgebra/ManagedLinearAlgebraProvider.Complex.cs +++ b/src/Numerics/Providers/LinearAlgebra/ManagedLinearAlgebraProvider.Complex.cs @@ -2400,11 +2400,11 @@ namespace MathNet.Numerics.Providers.LinearAlgebra } // This section of the program inspects for negligible elements in the s and e arrays, - // on completion the variables kase and l are set as follows: - // kase = 1: if mS[m] and e[l-1] are negligible and l < m - // kase = 2: if mS[l] is negligible and l < m - // kase = 3: if e[l-1] is negligible, l < m, and mS[l, ..., mS[m] are not negligible (qr step). - // kase = 4: if e[m-1] is negligible (convergence). + // on completion the variables case and l are set as follows: + // case = 1: if mS[m] and e[l-1] are negligible and l < m + // case = 2: if mS[l] is negligible and l < m + // case = 3: if e[l-1] is negligible, l < m, and mS[l, ..., mS[m] are not negligible (qr step). + // case = 4: if e[m-1] is negligible (convergence). double ztest; double test; for (l = m - 2; l >= 0; l--) @@ -2464,7 +2464,7 @@ namespace MathNet.Numerics.Providers.LinearAlgebra l = l + 1; - // Perform the task indicated by kase. + // Perform the task indicated by case. int k; double f; double cs; @@ -2827,10 +2827,10 @@ namespace MathNet.Numerics.Providers.LinearAlgebra /// /// Whether the matrix is symmetric or not. /// The order of the matrix. - /// The matrix to decompose. The lenth of the array must be order * order. - /// On output, the matrix contains the eigen vectors. The lenth of the array must be order * order. - /// On output, the eigen values (λ) of matrix in ascending value. The length of the arry must . - /// On output, the block diagonal eigenvalue matrix. The lenth of the array must be order * order. + /// The matrix to decompose. The length of the array must be order * order. + /// On output, the matrix contains the eigen vectors. The length of the array must be order * order. + /// On output, the eigen values (λ) of matrix in ascending value. The length of the array must . + /// On output, the block diagonal eigenvalue matrix. The length of the array must be order * order. public virtual void EigenDecomp(bool isSymmetric, int order, Complex[] matrix, Complex[] matrixEv, Complex[] vectorEv, Complex[] matrixD) { if (matrix == null) diff --git a/src/Numerics/Providers/LinearAlgebra/ManagedLinearAlgebraProvider.Complex32.cs b/src/Numerics/Providers/LinearAlgebra/ManagedLinearAlgebraProvider.Complex32.cs index f266641c..0d9cd9bb 100644 --- a/src/Numerics/Providers/LinearAlgebra/ManagedLinearAlgebraProvider.Complex32.cs +++ b/src/Numerics/Providers/LinearAlgebra/ManagedLinearAlgebraProvider.Complex32.cs @@ -2400,11 +2400,11 @@ namespace MathNet.Numerics.Providers.LinearAlgebra } // This section of the program inspects for negligible elements in the s and e arrays, - // on completion the variables kase and l are set as follows: - // kase = 1: if mS[m] and e[l-1] are negligible and l < m - // kase = 2: if mS[l] is negligible and l < m - // kase = 3: if e[l-1] is negligible, l < m, and mS[l, ..., mS[m] are not negligible (qr step). - // kase = 4: if e[m-1] is negligible (convergence). + // on completion the variables case and l are set as follows: + // case = 1: if mS[m] and e[l-1] are negligible and l < m + // case = 2: if mS[l] is negligible and l < m + // case = 3: if e[l-1] is negligible, l < m, and mS[l, ..., mS[m] are not negligible (qr step). + // case = 4: if e[m-1] is negligible (convergence). float ztest; float test; for (l = m - 2; l >= 0; l--) @@ -2464,7 +2464,7 @@ namespace MathNet.Numerics.Providers.LinearAlgebra l = l + 1; - // Perform the task indicated by kase. + // Perform the task indicated by case. int k; float f; float sn; @@ -2827,10 +2827,10 @@ namespace MathNet.Numerics.Providers.LinearAlgebra /// /// Whether the matrix is symmetric or not. /// The order of the matrix. - /// The matrix to decompose. The lenth of the array must be order * order. - /// On output, the matrix contains the eigen vectors. The lenth of the array must be order * order. - /// On output, the eigen values (λ) of matrix in ascending value. The length of the arry must . - /// On output, the block diagonal eigenvalue matrix. The lenth of the array must be order * order. + /// The matrix to decompose. The length of the array must be order * order. + /// On output, the matrix contains the eigen vectors. The length of the array must be order * order. + /// On output, the eigen values (λ) of matrix in ascending value. The length of the array must . + /// On output, the block diagonal eigenvalue matrix. The length of the array must be order * order. public virtual void EigenDecomp(bool isSymmetric, int order, Complex32[] matrix, Complex32[] matrixEv, Complex[] vectorEv, Complex32[] matrixD) { if (matrix == null) diff --git a/src/Numerics/Providers/LinearAlgebra/ManagedLinearAlgebraProvider.Double.cs b/src/Numerics/Providers/LinearAlgebra/ManagedLinearAlgebraProvider.Double.cs index 84325cd2..3dc2e890 100644 --- a/src/Numerics/Providers/LinearAlgebra/ManagedLinearAlgebraProvider.Double.cs +++ b/src/Numerics/Providers/LinearAlgebra/ManagedLinearAlgebraProvider.Double.cs @@ -2287,11 +2287,11 @@ namespace MathNet.Numerics.Providers.LinearAlgebra } // This section of the program inspects for negligible elements in the s and e arrays, - // on completion the variables kase and l are set as follows: - // kase = 1: if mS[m] and e[l-1] are negligible and l < m - // kase = 2: if mS[l] is negligible and l < m - // kase = 3: if e[l-1] is negligible, l < m, and mS[l, ..., mS[m] are not negligible (qr step). - // kase = 4: if e[m-1] is negligible (convergence). + // on completion the variables case and l are set as follows: + // case = 1: if mS[m] and e[l-1] are negligible and l < m + // case = 2: if mS[l] is negligible and l < m + // case = 3: if e[l-1] is negligible, l < m, and mS[l, ..., mS[m] are not negligible (qr step). + // case = 4: if e[m-1] is negligible (convergence). double ztest; double test; for (l = m - 2; l >= 0; l--) @@ -2351,7 +2351,7 @@ namespace MathNet.Numerics.Providers.LinearAlgebra l = l + 1; - // Perform the task indicated by kase. + // Perform the task indicated by case. int k; double f; double cs; @@ -2772,10 +2772,10 @@ namespace MathNet.Numerics.Providers.LinearAlgebra /// /// Whether the matrix is symmetric or not. /// The order of the matrix. - /// The matrix to decompose. The lenth of the array must be order * order. - /// On output, the matrix contains the eigen vectors. The lenth of the array must be order * order. - /// On output, the eigen values (λ) of matrix in ascending value. The length of the arry must . - /// On output, the block diagonal eigenvalue matrix. The lenth of the array must be order * order. + /// The matrix to decompose. The length of the array must be order * order. + /// On output, the matrix contains the eigen vectors. The length of the array must be order * order. + /// On output, the eigen values (λ) of matrix in ascending value. The length of the array must . + /// On output, the block diagonal eigenvalue matrix. The length of the array must be order * order. public virtual void EigenDecomp(bool isSymmetric, int order, double[] matrix, double[] matrixEv, Complex[] vectorEv, double[] matrixD) { if (matrix == null) diff --git a/src/Numerics/Providers/LinearAlgebra/ManagedLinearAlgebraProvider.Single.cs b/src/Numerics/Providers/LinearAlgebra/ManagedLinearAlgebraProvider.Single.cs index a6919d35..c8b0b9fc 100644 --- a/src/Numerics/Providers/LinearAlgebra/ManagedLinearAlgebraProvider.Single.cs +++ b/src/Numerics/Providers/LinearAlgebra/ManagedLinearAlgebraProvider.Single.cs @@ -2292,11 +2292,11 @@ namespace MathNet.Numerics.Providers.LinearAlgebra } // This section of the program inspects for negligible elements in the s and e arrays, - // on completion the variables kase and l are set as follows: - // kase = 1: if mS[m] and e[l-1] are negligible and l < m - // kase = 2: if mS[l] is negligible and l < m - // kase = 3: if e[l-1] is negligible, l < m, and mS[l, ..., mS[m] are not negligible (qr step). - // kase = 4: if e[m-1] is negligible (convergence). + // on completion the variables case and l are set as follows: + // case = 1: if mS[m] and e[l-1] are negligible and l < m + // case = 2: if mS[l] is negligible and l < m + // case = 3: if e[l-1] is negligible, l < m, and mS[l, ..., mS[m] are not negligible (qr step). + // case = 4: if e[m-1] is negligible (convergence). double ztest; double test; for (l = m - 2; l >= 0; l--) @@ -2356,7 +2356,7 @@ namespace MathNet.Numerics.Providers.LinearAlgebra l = l + 1; - // Perform the task indicated by kase. + // Perform the task indicated by case. int k; float f; float cs; @@ -2778,10 +2778,10 @@ namespace MathNet.Numerics.Providers.LinearAlgebra /// /// Whether the matrix is symmetric or not. /// The order of the matrix. - /// The matrix to decompose. The lenth of the array must be order * order. - /// On output, the matrix contains the eigen vectors. The lenth of the array must be order * order. - /// On output, the eigen values (λ) of matrix in ascending value. The length of the arry must . - /// On output, the block diagonal eigenvalue matrix. The lenth of the array must be order * order. + /// The matrix to decompose. The length of the array must be order * order. + /// On output, the matrix contains the eigen vectors. The length of the array must be order * order. + /// On output, the eigen values (λ) of matrix in ascending value. The length of the array must . + /// On output, the block diagonal eigenvalue matrix. The length of the array must be order * order. public virtual void EigenDecomp(bool isSymmetric, int order, float[] matrix, float[] matrixEv, Complex[] vectorEv, float[] matrixD) { if (matrix == null) diff --git a/src/Numerics/Providers/LinearAlgebra/Mkl/MklLinearAlgebraProvider.Complex.cs b/src/Numerics/Providers/LinearAlgebra/Mkl/MklLinearAlgebraProvider.Complex.cs index e13bc58f..82f79d6b 100644 --- a/src/Numerics/Providers/LinearAlgebra/Mkl/MklLinearAlgebraProvider.Complex.cs +++ b/src/Numerics/Providers/LinearAlgebra/Mkl/MklLinearAlgebraProvider.Complex.cs @@ -1139,10 +1139,10 @@ namespace MathNet.Numerics.Providers.LinearAlgebra.Mkl /// /// Whether the matrix is symmetric or not. /// The order of the matrix. - /// The matrix to decompose. The lenth of the array must be order * order. - /// On output, the matrix contains the eigen vectors. The lenth of the array must be order * order. - /// On output, the eigen values (λ) of matrix in ascending value. The length of the arry must . - /// On output, the block diagonal eigenvalue matrix. The lenth of the array must be order * order. + /// The matrix to decompose. The length of the array must be order * order. + /// On output, the matrix contains the eigen vectors. The length of the array must be order * order. + /// On output, the eigen values (λ) of matrix in ascending value. The length of the array must . + /// On output, the block diagonal eigenvalue matrix. The length of the array must be order * order. public override void EigenDecomp(bool isSymmetric, int order, Complex[] matrix, Complex[] matrixEv, Complex[] vectorEv, Complex[] matrixD) { if (matrix == null) diff --git a/src/Numerics/Providers/LinearAlgebra/Mkl/MklLinearAlgebraProvider.Complex32.cs b/src/Numerics/Providers/LinearAlgebra/Mkl/MklLinearAlgebraProvider.Complex32.cs index 98d648ff..0c30f208 100644 --- a/src/Numerics/Providers/LinearAlgebra/Mkl/MklLinearAlgebraProvider.Complex32.cs +++ b/src/Numerics/Providers/LinearAlgebra/Mkl/MklLinearAlgebraProvider.Complex32.cs @@ -1134,10 +1134,10 @@ namespace MathNet.Numerics.Providers.LinearAlgebra.Mkl /// /// Whether the matrix is symmetric or not. /// The order of the matrix. - /// The matrix to decompose. The lenth of the array must be order * order. - /// On output, the matrix contains the eigen vectors. The lenth of the array must be order * order. - /// On output, the eigen values (λ) of matrix in ascending value. The length of the arry must . - /// On output, the block diagonal eigenvalue matrix. The lenth of the array must be order * order. + /// The matrix to decompose. The length of the array must be order * order. + /// On output, the matrix contains the eigen vectors. The length of the array must be order * order. + /// On output, the eigen values (λ) of matrix in ascending value. The length of the array must . + /// On output, the block diagonal eigenvalue matrix. The length of the array must be order * order. public override void EigenDecomp(bool isSymmetric, int order, Complex32[] matrix, Complex32[] matrixEv, Complex[] vectorEv, Complex32[] matrixD) { if (matrix == null) diff --git a/src/Numerics/Providers/LinearAlgebra/Mkl/MklLinearAlgebraProvider.Double.cs b/src/Numerics/Providers/LinearAlgebra/Mkl/MklLinearAlgebraProvider.Double.cs index d77994f6..c6d37d80 100644 --- a/src/Numerics/Providers/LinearAlgebra/Mkl/MklLinearAlgebraProvider.Double.cs +++ b/src/Numerics/Providers/LinearAlgebra/Mkl/MklLinearAlgebraProvider.Double.cs @@ -1139,10 +1139,10 @@ namespace MathNet.Numerics.Providers.LinearAlgebra.Mkl /// /// Whether the matrix is symmetric or not. /// The order of the matrix. - /// The matrix to decompose. The lenth of the array must be order * order. - /// On output, the matrix contains the eigen vectors. The lenth of the array must be order * order. - /// On output, the eigen values (λ) of matrix in ascending value. The length of the arry must . - /// On output, the block diagonal eigenvalue matrix. The lenth of the array must be order * order. + /// The matrix to decompose. The length of the array must be order * order. + /// On output, the matrix contains the eigen vectors. The length of the array must be order * order. + /// On output, the eigen values (λ) of matrix in ascending value. The length of the array must . + /// On output, the block diagonal eigenvalue matrix. The length of the array must be order * order. public override void EigenDecomp(bool isSymmetric, int order, double[] matrix, double[] matrixEv, Complex[] vectorEv, double[] matrixD) { if (matrix == null) diff --git a/src/Numerics/Providers/LinearAlgebra/Mkl/MklLinearAlgebraProvider.Single.cs b/src/Numerics/Providers/LinearAlgebra/Mkl/MklLinearAlgebraProvider.Single.cs index 0dc1d1c1..84d3b828 100644 --- a/src/Numerics/Providers/LinearAlgebra/Mkl/MklLinearAlgebraProvider.Single.cs +++ b/src/Numerics/Providers/LinearAlgebra/Mkl/MklLinearAlgebraProvider.Single.cs @@ -1134,10 +1134,10 @@ namespace MathNet.Numerics.Providers.LinearAlgebra.Mkl /// /// Whether the matrix is symmetric or not. /// The order of the matrix. - /// The matrix to decompose. The lenth of the array must be order * order. - /// On output, the matrix contains the eigen vectors. The lenth of the array must be order * order. - /// On output, the eigen values (λ) of matrix in ascending value. The length of the arry must . - /// On output, the block diagonal eigenvalue matrix. The lenth of the array must be order * order. + /// The matrix to decompose. The length of the array must be order * order. + /// On output, the matrix contains the eigen vectors. The length of the array must be order * order. + /// On output, the eigen values (λ) of matrix in ascending value. The length of the array must . + /// On output, the block diagonal eigenvalue matrix. The length of the array must be order * order. public override void EigenDecomp(bool isSymmetric, int order, float[] matrix, float[] matrixEv, Complex[] vectorEv, float[] matrixD) { if (matrix == null) diff --git a/src/Numerics/Providers/LinearAlgebra/OpenBlas/OpenBlasLinearAlgebraProvider.Complex.cs b/src/Numerics/Providers/LinearAlgebra/OpenBlas/OpenBlasLinearAlgebraProvider.Complex.cs index 3b70a81e..fbaa1283 100644 --- a/src/Numerics/Providers/LinearAlgebra/OpenBlas/OpenBlasLinearAlgebraProvider.Complex.cs +++ b/src/Numerics/Providers/LinearAlgebra/OpenBlas/OpenBlasLinearAlgebraProvider.Complex.cs @@ -959,10 +959,10 @@ namespace MathNet.Numerics.Providers.LinearAlgebra.OpenBlas /// /// Whether the matrix is symmetric or not. /// The order of the matrix. - /// The matrix to decompose. The lenth of the array must be order * order. - /// On output, the matrix contains the eigen vectors. The lenth of the array must be order * order. - /// On output, the eigen values (λ) of matrix in ascending value. The length of the arry must . - /// On output, the block diagonal eigenvalue matrix. The lenth of the array must be order * order. + /// The matrix to decompose. The length of the array must be order * order. + /// On output, the matrix contains the eigen vectors. The length of the array must be order * order. + /// On output, the eigen values (λ) of matrix in ascending value. The length of the array must . + /// On output, the block diagonal eigenvalue matrix. The length of the array must be order * order. public override void EigenDecomp(bool isSymmetric, int order, Complex[] matrix, Complex[] matrixEv, Complex[] vectorEv, Complex[] matrixD) { if (matrix == null) diff --git a/src/Numerics/Providers/LinearAlgebra/OpenBlas/OpenBlasLinearAlgebraProvider.Complex32.cs b/src/Numerics/Providers/LinearAlgebra/OpenBlas/OpenBlasLinearAlgebraProvider.Complex32.cs index 4ced017a..0e44fdfa 100644 --- a/src/Numerics/Providers/LinearAlgebra/OpenBlas/OpenBlasLinearAlgebraProvider.Complex32.cs +++ b/src/Numerics/Providers/LinearAlgebra/OpenBlas/OpenBlasLinearAlgebraProvider.Complex32.cs @@ -954,10 +954,10 @@ namespace MathNet.Numerics.Providers.LinearAlgebra.OpenBlas /// /// Whether the matrix is symmetric or not. /// The order of the matrix. - /// The matrix to decompose. The lenth of the array must be order * order. - /// On output, the matrix contains the eigen vectors. The lenth of the array must be order * order. - /// On output, the eigen values (λ) of matrix in ascending value. The length of the arry must . - /// On output, the block diagonal eigenvalue matrix. The lenth of the array must be order * order. + /// The matrix to decompose. The length of the array must be order * order. + /// On output, the matrix contains the eigen vectors. The length of the array must be order * order. + /// On output, the eigen values (λ) of matrix in ascending value. The length of the array must . + /// On output, the block diagonal eigenvalue matrix. The length of the array must be order * order. public override void EigenDecomp(bool isSymmetric, int order, Complex32[] matrix, Complex32[] matrixEv, Complex[] vectorEv, Complex32[] matrixD) { if (matrix == null) diff --git a/src/Numerics/Providers/LinearAlgebra/OpenBlas/OpenBlasLinearAlgebraProvider.Double.cs b/src/Numerics/Providers/LinearAlgebra/OpenBlas/OpenBlasLinearAlgebraProvider.Double.cs index 1efce075..c36d0857 100644 --- a/src/Numerics/Providers/LinearAlgebra/OpenBlas/OpenBlasLinearAlgebraProvider.Double.cs +++ b/src/Numerics/Providers/LinearAlgebra/OpenBlas/OpenBlasLinearAlgebraProvider.Double.cs @@ -959,10 +959,10 @@ namespace MathNet.Numerics.Providers.LinearAlgebra.OpenBlas /// /// Whether the matrix is symmetric or not. /// The order of the matrix. - /// The matrix to decompose. The lenth of the array must be order * order. - /// On output, the matrix contains the eigen vectors. The lenth of the array must be order * order. - /// On output, the eigen values (λ) of matrix in ascending value. The length of the arry must . - /// On output, the block diagonal eigenvalue matrix. The lenth of the array must be order * order. + /// The matrix to decompose. The length of the array must be order * order. + /// On output, the matrix contains the eigen vectors. The length of the array must be order * order. + /// On output, the eigen values (λ) of matrix in ascending value. The length of the array must . + /// On output, the block diagonal eigenvalue matrix. The length of the array must be order * order. public override void EigenDecomp(bool isSymmetric, int order, double[] matrix, double[] matrixEv, Complex[] vectorEv, double[] matrixD) { if (matrix == null) diff --git a/src/Numerics/Providers/LinearAlgebra/OpenBlas/OpenBlasLinearAlgebraProvider.Single.cs b/src/Numerics/Providers/LinearAlgebra/OpenBlas/OpenBlasLinearAlgebraProvider.Single.cs index fac06e34..ed05ee94 100644 --- a/src/Numerics/Providers/LinearAlgebra/OpenBlas/OpenBlasLinearAlgebraProvider.Single.cs +++ b/src/Numerics/Providers/LinearAlgebra/OpenBlas/OpenBlasLinearAlgebraProvider.Single.cs @@ -954,10 +954,10 @@ namespace MathNet.Numerics.Providers.LinearAlgebra.OpenBlas /// /// Whether the matrix is symmetric or not. /// The order of the matrix. - /// The matrix to decompose. The lenth of the array must be order * order. - /// On output, the matrix contains the eigen vectors. The lenth of the array must be order * order. - /// On output, the eigen values (λ) of matrix in ascending value. The length of the arry must . - /// On output, the block diagonal eigenvalue matrix. The lenth of the array must be order * order. + /// The matrix to decompose. The length of the array must be order * order. + /// On output, the matrix contains the eigen vectors. The length of the array must be order * order. + /// On output, the eigen values (λ) of matrix in ascending value. The length of the array must . + /// On output, the block diagonal eigenvalue matrix. The length of the array must be order * order. public override void EigenDecomp(bool isSymmetric, int order, float[] matrix, float[] matrixEv, Complex[] vectorEv, float[] matrixD) { if (matrix == null) diff --git a/src/Numerics/Random/RandomSource.cs b/src/Numerics/Random/RandomSource.cs index 6a2211f4..2f3633f5 100644 --- a/src/Numerics/Random/RandomSource.cs +++ b/src/Numerics/Random/RandomSource.cs @@ -531,7 +531,7 @@ namespace MathNet.Numerics.Random // every bit with independent uniform distribution uint uint32 = BitConverter.ToUInt32(bytes, 0); - // the least significant N bits with independend uniform distribution and the remaining bits zero + // the least significant N bits with independent uniform distribution and the remaining bits zero uint uintN = uint32 >> (32 - bitCount); return (int)uintN; } @@ -555,7 +555,7 @@ namespace MathNet.Numerics.Random // every bit with independent uniform distribution ulong uint64 = BitConverter.ToUInt64(bytes, 0); - // the least significant N bits with independend uniform distribution and the remaining bits zero + // the least significant N bits with independent uniform distribution and the remaining bits zero ulong uintN = uint64 >> (64 - bitCount); return (long)uintN; } diff --git a/src/Numerics/RootFinding/Brent.cs b/src/Numerics/RootFinding/Brent.cs index 7c76f2ed..aa493f91 100644 --- a/src/Numerics/RootFinding/Brent.cs +++ b/src/Numerics/RootFinding/Brent.cs @@ -33,7 +33,7 @@ using MathNet.Numerics.Properties; namespace MathNet.Numerics.RootFinding { /// - /// Algorithm by by Brent, Van Wijngaarden, Dekker et al. + /// Algorithm by Brent, Van Wijngaarden, Dekker et al. /// Implementation inspired by Press, Teukolsky, Vetterling, and Flannery, "Numerical Recipes in C", 2nd edition, Cambridge University Press /// public static class Brent diff --git a/src/Numerics/SpecialFunctions/Erf.cs b/src/Numerics/SpecialFunctions/Erf.cs index 6f2fb972..83c65124 100644 --- a/src/Numerics/SpecialFunctions/Erf.cs +++ b/src/Numerics/SpecialFunctions/Erf.cs @@ -57,7 +57,7 @@ namespace MathNet.Numerics /// private static readonly double[] ErfImpAn = { 0.00337916709551257388990745, -0.00073695653048167948530905, -0.374732337392919607868241, 0.0817442448733587196071743, -0.0421089319936548595203468, 0.0070165709512095756344528, -0.00495091255982435110337458, 0.000871646599037922480317225 }; - /// Polynomial coefficients for adenominator of ErfImp + /// Polynomial coefficients for a denominator of ErfImp /// calculation for Erf(x) in the interval [1e-10, 0.5]. /// private static readonly double[] ErfImpAd = { 1, -0.218088218087924645390535, 0.412542972725442099083918, -0.0841891147873106755410271, 0.0655338856400241519690695, -0.0120019604454941768171266, 0.00408165558926174048329689, -0.000615900721557769691924509 }; diff --git a/src/Numerics/SpecialFunctions/ModifiedBessel.cs b/src/Numerics/SpecialFunctions/ModifiedBessel.cs index 829af193..479d5828 100644 --- a/src/Numerics/SpecialFunctions/ModifiedBessel.cs +++ b/src/Numerics/SpecialFunctions/ModifiedBessel.cs @@ -50,7 +50,7 @@ namespace MathNet.Numerics // ReSharper restore CheckNamespace { /// - /// This partial implementation of the SpecialFunctions class contains all methods related to the modified bessel function. + /// This partial implementation of the SpecialFunctions class contains all methods related to the modified Bessel function. /// public static partial class SpecialFunctions { @@ -139,7 +139,7 @@ namespace MathNet.Numerics /// (8, infinity). Chebyshev polynomial expansions are employed /// in each interval. /// - /// The value to compute the bessel function of. + /// The value to compute the Bessel function of. /// public static double BesselI0(double x) { @@ -167,7 +167,7 @@ namespace MathNet.Numerics /// (8, infinity). Chebyshev polynomial expansions are employed /// in each interval. /// - /// The value to compute the bessel function of. + /// The value to compute the Bessel function of. /// public static double BesselI1(double x) { @@ -198,7 +198,7 @@ namespace MathNet.Numerics /// (8, infinity). Chebyshev polynomial expansions are employed /// in each interval. /// - /// The value to compute the bessel function of. + /// The value to compute the Bessel function of. /// public static double BesselK0(double x) { @@ -220,7 +220,7 @@ namespace MathNet.Numerics /// Returns the exponentially scaled modified Bessel function /// of the second kind of order 0 of the argument. /// - /// The value to compute the bessel function of. + /// The value to compute the Bessel function of. /// public static double BesselK0e(double x) { @@ -246,7 +246,7 @@ namespace MathNet.Numerics /// (2, infinity). Chebyshev polynomial expansions are employed /// in each interval. /// - /// The value to compute the bessel function of. + /// The value to compute the Bessel function of. /// public static double BesselK1(double x) { @@ -271,7 +271,7 @@ namespace MathNet.Numerics ///

/// k1e(x) = exp(x) * k1(x). /// - /// The value to compute the bessel function of. + /// The value to compute the Bessel function of. /// public static double BesselK1e(double x) { diff --git a/src/Numerics/SpecialFunctions/ModifiedStruve.cs b/src/Numerics/SpecialFunctions/ModifiedStruve.cs index e73c7dc1..124762b3 100644 --- a/src/Numerics/SpecialFunctions/ModifiedStruve.cs +++ b/src/Numerics/SpecialFunctions/ModifiedStruve.cs @@ -50,7 +50,7 @@ namespace MathNet.Numerics // ReSharper restore CheckNamespace { ///

- /// This partial implementation of the SpecialFunctions class contains all methods related to the modified bessel function. + /// This partial implementation of the SpecialFunctions class contains all methods related to the modified Bessel function. /// public static partial class SpecialFunctions { diff --git a/src/Numerics/Statistics/ArrayStatistics.Single.cs b/src/Numerics/Statistics/ArrayStatistics.Single.cs index 0bd1efd5..20235466 100644 --- a/src/Numerics/Statistics/ArrayStatistics.Single.cs +++ b/src/Numerics/Statistics/ArrayStatistics.Single.cs @@ -514,7 +514,7 @@ namespace MathNet.Numerics.Statistics /// /// Estimates the tau-th quantile from the unsorted data array. /// The tau-th quantile is the data value where the cumulative distribution - /// function crosses tau. The quantile defintion can be specified + /// function crosses tau. The quantile definition can be specified /// by 4 parameters a, b, c and d, consistent with Mathematica. /// WARNING: Works inplace and can thus causes the data array to be reordered. /// diff --git a/src/Numerics/Statistics/ArrayStatistics.cs b/src/Numerics/Statistics/ArrayStatistics.cs index acd59dfc..d4452db5 100644 --- a/src/Numerics/Statistics/ArrayStatistics.cs +++ b/src/Numerics/Statistics/ArrayStatistics.cs @@ -524,7 +524,7 @@ namespace MathNet.Numerics.Statistics /// /// Estimates the tau-th quantile from the unsorted data array. /// The tau-th quantile is the data value where the cumulative distribution - /// function crosses tau. The quantile defintion can be specified + /// function crosses tau. The quantile definition can be specified /// by 4 parameters a, b, c and d, consistent with Mathematica. /// WARNING: Works inplace and can thus causes the data array to be reordered. /// diff --git a/src/Numerics/Statistics/DescriptiveStatistics.cs b/src/Numerics/Statistics/DescriptiveStatistics.cs index ce10609c..7e01ee75 100644 --- a/src/Numerics/Statistics/DescriptiveStatistics.cs +++ b/src/Numerics/Statistics/DescriptiveStatistics.cs @@ -44,7 +44,7 @@ namespace MathNet.Numerics.Statistics /// This type declares a DataContract for out of the box ephemeral serialization /// with engines like DataContractSerializer, Protocol Buffers and FsPickler, /// but does not guarantee any compatibility between versions. - /// It is not recommended to rely on this mechanism for durable persistance. + /// It is not recommended to rely on this mechanism for durable persistence. /// [DataContract(Namespace = "urn:MathNet/Numerics")] public class DescriptiveStatistics diff --git a/src/Numerics/Statistics/Histogram.cs b/src/Numerics/Statistics/Histogram.cs index c7c51ba5..a7d998d9 100644 --- a/src/Numerics/Statistics/Histogram.cs +++ b/src/Numerics/Statistics/Histogram.cs @@ -43,7 +43,7 @@ namespace MathNet.Numerics.Statistics /// This type declares a DataContract for out of the box ephemeral serialization /// with engines like DataContractSerializer, Protocol Buffers and FsPickler, /// but does not guarantee any compatibility between versions. - /// It is not recommended to rely on this mechanism for durable persistance. + /// It is not recommended to rely on this mechanism for durable persistence. /// [Serializable] [DataContract(Namespace = "urn:MathNet/Numerics")] @@ -281,7 +281,7 @@ namespace MathNet.Numerics.Statistics /// Constructs a Histogram with a specific number of equally sized buckets. The upper and lower bound of the histogram /// will be set to the smallest and largest datapoint. /// - /// The datasequence to build a histogram on. + /// The data sequence to build a histogram on. /// The number of buckets to use. public Histogram(IEnumerable data, int nbuckets) : this() @@ -317,7 +317,7 @@ namespace MathNet.Numerics.Statistics /// /// Constructs a Histogram with a specific number of equally sized buckets. /// - /// The datasequence to build a histogram on. + /// The data sequence to build a histogram on. /// The number of buckets to use. /// The histogram lower bound. /// The histogram upper bound. diff --git a/src/Numerics/Statistics/MCMC/HybridMC.cs b/src/Numerics/Statistics/MCMC/HybridMC.cs index 3281d80a..8d3e78b0 100644 --- a/src/Numerics/Statistics/MCMC/HybridMC.cs +++ b/src/Numerics/Statistics/MCMC/HybridMC.cs @@ -79,8 +79,8 @@ namespace MathNet.Numerics.Statistics.Mcmc /// /// The initial sample. /// The log density of the distribution we want to sample from. - /// Number frogleap simulation steps. - /// Size of the frogleap simulation steps. + /// Number frog leap simulation steps. + /// Size of the frog leap simulation steps. /// The number of iterations in between returning samples. /// When the number of burnInterval iteration is negative. public HybridMC(double[] x0, DensityLn pdfLnP, int frogLeapSteps, double stepSize, int burnInterval = 0) @@ -101,8 +101,8 @@ namespace MathNet.Numerics.Statistics.Mcmc /// /// The initial sample. /// The log density of the distribution we want to sample from. - /// Number frogleap simulation steps. - /// Size of the frogleap simulation steps. + /// Number frog leap simulation steps. + /// Size of the frog leap simulation steps. /// The number of iterations in between returning samples. /// The standard deviations of the normal distributions that are used to sample /// the components of the momentum. @@ -121,8 +121,8 @@ namespace MathNet.Numerics.Statistics.Mcmc /// /// The initial sample. /// The log density of the distribution we want to sample from. - /// Number frogleap simulation steps. - /// Size of the frogleap simulation steps. + /// Number frog leap simulation steps. + /// Size of the frog leap simulation steps. /// The number of iterations in between returning samples. /// The standard deviations of the normal distributions that are used to sample /// the components of the momentum. @@ -141,8 +141,8 @@ namespace MathNet.Numerics.Statistics.Mcmc /// /// The initial sample. /// The log density of the distribution we want to sample from. - /// Number frogleap simulation steps. - /// Size of the frogleap simulation steps. + /// Number frog leap simulation steps. + /// Size of the frog leap simulation steps. /// The number of iterations in between returning samples. /// The standard deviations of the normal distributions that are used to sample /// the components of the momentum. diff --git a/src/Numerics/Statistics/MCMC/HybridMCGeneric.cs b/src/Numerics/Statistics/MCMC/HybridMCGeneric.cs index a0c1ec2b..2113d78b 100644 --- a/src/Numerics/Statistics/MCMC/HybridMCGeneric.cs +++ b/src/Numerics/Statistics/MCMC/HybridMCGeneric.cs @@ -96,7 +96,7 @@ namespace MathNet.Numerics.Statistics.Mcmc /// /// Gets or sets the number of iterations in the Hamiltonian equation. /// - /// When frogleap steps is negative or zero. + /// When frog leap steps is negative or zero. public int FrogLeapSteps { get { return _frogLeapSteps; } @@ -124,8 +124,8 @@ namespace MathNet.Numerics.Statistics.Mcmc /// /// The initial sample. /// The log density of the distribution we want to sample from. - /// Number frogleap simulation steps. - /// Size of the frogleap simulation steps. + /// Number frog leap simulation steps. + /// Size of the frog leap simulation steps. /// The number of iterations in between returning samples. /// Random number generator used for sampling the momentum. /// The method used for differentiation. diff --git a/src/Numerics/Statistics/MCMC/MetropolisHastingsSampler.cs b/src/Numerics/Statistics/MCMC/MetropolisHastingsSampler.cs index 929345e9..20d818e8 100644 --- a/src/Numerics/Statistics/MCMC/MetropolisHastingsSampler.cs +++ b/src/Numerics/Statistics/MCMC/MetropolisHastingsSampler.cs @@ -34,7 +34,7 @@ namespace MathNet.Numerics.Statistics.Mcmc using Distributions; /// - /// Metropolis-Hastings sampling produces samples from distribition P by sampling from a proposal distribution Q + /// Metropolis-Hastings sampling produces samples from distribution P by sampling from a proposal distribution Q /// and accepting/rejecting based on the density of P. Metropolis-Hastings sampling doesn't require that the /// proposal distribution Q is symmetric in comparison to . It does need to /// be able to evaluate the proposal sampler's log density though. All densities are required to be in log space. @@ -158,4 +158,4 @@ namespace MathNet.Numerics.Statistics.Mcmc return _current; } } -} \ No newline at end of file +} diff --git a/src/Numerics/Statistics/MCMC/MetropolisSampler.cs b/src/Numerics/Statistics/MCMC/MetropolisSampler.cs index 2d53d895..0a2a6ebd 100644 --- a/src/Numerics/Statistics/MCMC/MetropolisSampler.cs +++ b/src/Numerics/Statistics/MCMC/MetropolisSampler.cs @@ -34,7 +34,7 @@ namespace MathNet.Numerics.Statistics.Mcmc using Distributions; /// - /// Metropolis sampling produces samples from distribition P by sampling from a proposal distribution Q + /// Metropolis sampling produces samples from distribution P by sampling from a proposal distribution Q /// and accepting/rejecting based on the density of P. Metropolis sampling requires that the proposal /// distribution Q is symmetric. All densities are required to be in log space. /// @@ -145,4 +145,4 @@ namespace MathNet.Numerics.Statistics.Mcmc return _current; } } -} \ No newline at end of file +} diff --git a/src/Numerics/Statistics/MCMC/RejectionSampler.cs b/src/Numerics/Statistics/MCMC/RejectionSampler.cs index 7135a570..9cc94639 100644 --- a/src/Numerics/Statistics/MCMC/RejectionSampler.cs +++ b/src/Numerics/Statistics/MCMC/RejectionSampler.cs @@ -33,7 +33,7 @@ namespace MathNet.Numerics.Statistics.Mcmc using Properties; /// - /// Rejection sampling produces samples from distribition P by sampling from a proposal distribution Q + /// Rejection sampling produces samples from distribution P by sampling from a proposal distribution Q /// and accepting/rejecting based on the density of P and Q. The density of P and Q don't need to /// to be normalized, but we do need that for each x, P(x) < Q(x). /// @@ -100,4 +100,4 @@ namespace MathNet.Numerics.Statistics.Mcmc } } } -} \ No newline at end of file +} diff --git a/src/Numerics/Statistics/MCMC/UnivariateHybridMC.cs b/src/Numerics/Statistics/MCMC/UnivariateHybridMC.cs index bd09530a..30bd5e27 100644 --- a/src/Numerics/Statistics/MCMC/UnivariateHybridMC.cs +++ b/src/Numerics/Statistics/MCMC/UnivariateHybridMC.cs @@ -75,8 +75,8 @@ namespace MathNet.Numerics.Statistics.Mcmc /// /// The initial sample. /// The log density of the distribution we want to sample from. - /// Number frogleap simulation steps. - /// Size of the frogleap simulation steps. + /// Number frog leap simulation steps. + /// Size of the frog leap simulation steps. /// The number of iterations in between returning samples. /// The standard deviation of the normal distribution that is used to sample /// the momentum. @@ -95,8 +95,8 @@ namespace MathNet.Numerics.Statistics.Mcmc /// /// The initial sample. /// The log density of the distribution we want to sample from. - /// Number frogleap simulation steps. - /// Size of the frogleap simulation steps. + /// Number frog leap simulation steps. + /// Size of the frog leap simulation steps. /// The number of iterations in between returning samples. /// The standard deviation of the normal distribution that is used to sample /// the momentum. @@ -116,8 +116,8 @@ namespace MathNet.Numerics.Statistics.Mcmc /// /// The initial sample. /// The log density of the distribution we want to sample from. - /// Number frogleap simulation steps. - /// Size of the frogleap simulation steps. + /// Number frog leap simulation steps. + /// Size of the frog leap simulation steps. /// The number of iterations in between returning samples. /// The standard deviation of the normal distribution that is used to sample /// the momentum. diff --git a/src/Numerics/Statistics/MCMC/UnivariateSliceSampler.cs b/src/Numerics/Statistics/MCMC/UnivariateSliceSampler.cs index 6a9a5c85..0e466837 100644 --- a/src/Numerics/Statistics/MCMC/UnivariateSliceSampler.cs +++ b/src/Numerics/Statistics/MCMC/UnivariateSliceSampler.cs @@ -33,7 +33,7 @@ namespace MathNet.Numerics.Statistics.Mcmc using Properties; /// - /// Slice sampling produces samples from distribition P by uniformly sampling from under the pdf of P using + /// Slice sampling produces samples from distribution P by uniformly sampling from under the pdf of P using /// a technique described in "Slice Sampling", R. Neal, 2003. All densities are required to be in log space. /// /// The slice sampler is a stateful sampler. It keeps track of where it currently is in the domain diff --git a/src/Numerics/Statistics/RunningStatistics.cs b/src/Numerics/Statistics/RunningStatistics.cs index 72f3c839..9a8a7870 100644 --- a/src/Numerics/Statistics/RunningStatistics.cs +++ b/src/Numerics/Statistics/RunningStatistics.cs @@ -44,7 +44,7 @@ namespace MathNet.Numerics.Statistics /// This type declares a DataContract for out of the box ephemeral serialization /// with engines like DataContractSerializer, Protocol Buffers and FsPickler, /// but does not guarantee any compatibility between versions. - /// It is not recommended to rely on this mechanism for durable persistance. + /// It is not recommended to rely on this mechanism for durable persistence. /// [DataContract(Namespace = "urn:MathNet/Numerics")] public class RunningStatistics diff --git a/src/Numerics/Statistics/SortedArrayStatistics.Single.cs b/src/Numerics/Statistics/SortedArrayStatistics.Single.cs index 6764d5f0..ea115a5b 100644 --- a/src/Numerics/Statistics/SortedArrayStatistics.Single.cs +++ b/src/Numerics/Statistics/SortedArrayStatistics.Single.cs @@ -193,7 +193,7 @@ namespace MathNet.Numerics.Statistics /// /// Estimates the tau-th quantile from the sorted data array (ascending). /// The tau-th quantile is the data value where the cumulative distribution - /// function crosses tau. The quantile defintion can be specified + /// function crosses tau. The quantile definition can be specified /// by 4 parameters a, b, c and d, consistent with Mathematica. /// /// Sample array, must be sorted ascendingly. diff --git a/src/Numerics/Statistics/SortedArrayStatistics.cs b/src/Numerics/Statistics/SortedArrayStatistics.cs index 83092021..bc50b04b 100644 --- a/src/Numerics/Statistics/SortedArrayStatistics.cs +++ b/src/Numerics/Statistics/SortedArrayStatistics.cs @@ -197,7 +197,7 @@ namespace MathNet.Numerics.Statistics /// /// Estimates the tau-th quantile from the sorted data array (ascending). /// The tau-th quantile is the data value where the cumulative distribution - /// function crosses tau. The quantile defintion can be specified + /// function crosses tau. The quantile definition can be specified /// by 4 parameters a, b, c and d, consistent with Mathematica. /// /// Sample array, must be sorted ascendingly. diff --git a/src/Numerics/Statistics/Statistics.cs b/src/Numerics/Statistics/Statistics.cs index b3c3d64b..ff6de1bd 100644 --- a/src/Numerics/Statistics/Statistics.cs +++ b/src/Numerics/Statistics/Statistics.cs @@ -403,7 +403,7 @@ namespace MathNet.Numerics.Statistics /// /// Evaluates the variance from the provided full population. - /// On a dataset of size N will use an N normalize and would thus be biased if applied to a subsetr. + /// On a dataset of size N will use an N normalize and would thus be biased if applied to a subset. /// Returns NaN if data is empty or if any entry is NaN. /// Null-entries are ignored. /// diff --git a/src/Numerics/Trigonometry.cs b/src/Numerics/Trigonometry.cs index 73c6c5c6..0a350594 100644 --- a/src/Numerics/Trigonometry.cs +++ b/src/Numerics/Trigonometry.cs @@ -288,7 +288,7 @@ namespace MathNet.Numerics /// /// Trigonometric principal Arc Sine in radian /// - /// The opposite for a unit hypotenuse (i.e. opposite / hyptenuse). + /// The opposite for a unit hypotenuse (i.e. opposite / hypotenuse). /// The angle in radian. public static double Asin(double opposite) { diff --git a/src/Numerics/Window.cs b/src/Numerics/Window.cs index 13bf6fb2..66278fb0 100644 --- a/src/Numerics/Window.cs +++ b/src/Numerics/Window.cs @@ -354,7 +354,7 @@ namespace MathNet.Numerics } /// - /// Uniform rectangular (dirichlet) window. + /// Uniform rectangular (Dirichlet) window. /// public static double[] Dirichlet(int width) {