INNER CODE UNIT · C

d

lh3/yak · 6gjdn.c:55

		d = a[k * n + k];
		for (j = k + 1; j <= n - 1; j++) {
			p = k * n + j;
			a[p] = a[p] / d;
		}
		for (j = 0; j <= m - 1; j++) {
			p = k * m + j;
			b[p] = b[p] / d;
		}
		for (j = k + 1; j <= n - 1; j++)
			for (i = 0; i <= n - 1; i++) {
				p = i * n + j;
				if (i != k)
					a[p] = a[p] - a[i * n + k] * a[k * n + j];
			}
		for (j = 0; j <= m - 1; j++)
			for (i = 0; i <= n - 1; i++) {
				p = i * m + j;

View source record →

📰 Research Paper
Loading…
⏳ Fetching content…