private d_qr_factor ( int m, int n, [ r, [ tau, [ q, [ work, int len ) : int | ||
m | int | |
n | int | |
r | [ | |
tau | [ | |
q | [ | |
work | [ | |
len | int | |
return | int |
public override void QRFactor(double[] r, int rowsR, int columnsR, double[] q, double[] tau) { if (r == null) { throw new ArgumentNullException(nameof(r)); } if (q == null) { throw new ArgumentNullException(nameof(q)); } if (r.Length != rowsR * columnsR) { throw new ArgumentException("The given array has the wrong length. Should be rowsR * columnsR.", nameof(r)); } if (tau.Length < Math.Min(rowsR, columnsR)) { throw new ArgumentException("The given array is too small. It must be at least min(m,n) long.", nameof(tau)); } if (q.Length != rowsR * rowsR) { throw new ArgumentException("The given array has the wrong length. Should be rowsR * rowsR.", nameof(q)); } var info = SafeNativeMethods.d_qr_factor(rowsR, columnsR, r, tau, q); if (info < 0) { throw new InvalidParameterException(Math.Abs(info)); } }
public override void QRFactor(double[] r, int rowsR, int columnsR, double[] q, double[] tau) { if (r == null) { throw new ArgumentNullException("r"); } if (q == null) { throw new ArgumentNullException("q"); } if (r.Length != rowsR * columnsR) { throw new ArgumentException(string.Format(Resources.ArgumentArrayWrongLength, "rowsR * columnsR"), "r"); } if (tau.Length < Math.Min(rowsR, columnsR)) { throw new ArgumentException(string.Format(Resources.ArrayTooSmall, "min(m,n)"), "tau"); } if (q.Length != rowsR * rowsR) { throw new ArgumentException(string.Format(Resources.ArgumentArrayWrongLength, "rowsR * rowsR"), "q"); } var info = SafeNativeMethods.d_qr_factor(rowsR, columnsR, r, tau, q); if (info < 0) { throw new InvalidParameterException(Math.Abs(info)); } }