C# (CSharp) MathNet.Numerics.Algorithms.LinearAlgebra.Mkl SafeNativeMethods.d_lu_inverse_factored Exemples

Exemple #1

Fichier : MklLinearAlgebraProvider.double.cs Projet : sweetie-bot-project/sw2urdf

        public override void LUInverseFactored(double[] a, int order, int[] ipiv, double[] work)
        {
            if (a == null)
            {
                throw new ArgumentNullException("a");
            }

            if (ipiv == null)
            {
                throw new ArgumentNullException("ipiv");
            }

            if (a.Length != order * order)
            {
                throw new ArgumentException(Resources.ArgumentArraysSameLength, "a");
            }

            if (ipiv.Length != order)
            {
                throw new ArgumentException(Resources.ArgumentArraysSameLength, "ipiv");
            }

            if (work == null)
            {
                throw new ArgumentNullException("work");
            }

            if (work.Length < order)
            {
                throw new ArgumentException(Resources.WorkArrayTooSmall, "work");
            }

            SafeNativeMethods.d_lu_inverse_factored(order, a, ipiv, work, order);
        }

Exemple #2

Fichier : MklLinearAlgebraProvider.double.cs Projet : sweetie-bot-project/sw2urdf

        public override void LUInverseFactored(double[] a, int order, int[] ipiv)
        {
            if (a == null)
            {
                throw new ArgumentNullException("a");
            }

            if (ipiv == null)
            {
                throw new ArgumentNullException("ipiv");
            }

            if (a.Length != order * order)
            {
                throw new ArgumentException(Resources.ArgumentArraysSameLength, "a");
            }

            if (ipiv.Length != order)
            {
                throw new ArgumentException(Resources.ArgumentArraysSameLength, "ipiv");
            }

            var work = new double[order];

            SafeNativeMethods.d_lu_inverse_factored(order, a, ipiv, work, order);
        }