Constant Field Values

org.episteme.*

  • org.episteme.apps.apps.framework.EpistemeTheme
    Modifier and Type
    Constant Field
    Value
    public static final String
    BUTTON_PRIMARY_STYLE
    "-fx-background-color: #2980b9; -fx-text-fill: white; -fx-font-weight: bold; -fx-padding: 10 20; -fx-background-radius: 5;"
    public static final String
    BUTTON_SECONDARY_STYLE
    "-fx-background-color: #ecf0f1; -fx-text-fill: #2c3e50; -fx-padding: 8 16; -fx-background-radius: 5; -fx-border-color: #bdc3c7; -fx-border-radius: 5;"
    public static final String
    CARD_STYLE
    "-fx-background-color: white; -fx-background-radius: 8; -fx-effect: dropshadow(gaussian, rgba(0,0,0,0.1), 10, 0, 0, 2);"
    public static final String
    HEADER_STYLE
    "-fx-font-size: 18px; -fx-font-weight: bold; -fx-text-fill: #2c3e50;"
    public static final String
    SUBHEADER_STYLE
    "-fx-font-size: 14px; -fx-font-weight: bold; -fx-text-fill: #7f8c8d;"
  • org.episteme.core.mathematics.geometry.csg.CSGUtils
    Modifier and Type
    Constant Field
    Value
    public static final int
    BACK
    2
    public static final int
    COPLANAR
    0
    public static final double
    EPSILON
    1.0E-5
    public static final int
    FRONT
    1
    public static final int
    SPANNING
    3
  • org.episteme.nativ.technical.backend.gpu.opencl.OpenCLKernels
    Modifier and Type
    Constant Field
    Value
    public static final String
    DENSE_DOUBLE_KERNELS
    "__kernel void matrixMultiply(__global const double *a, __global const double *b, __global double *c, const int m, const int n, const int k) {\n int row = get_global_id(1); int col = get_global_id(0);\n if (row < m && col < n) {\n double sum = 0.0;\n for (int i = 0; i < k; i++) sum += a[row*k+i] * b[i*n+col];\n c[row*n+col] = sum;\n }\n}\n__kernel void saxpy(__global const double *x, __global double *y, const double alpha, const int n) {\n int i = get_global_id(0);\n if (i < n) y[i] = alpha * x[i] + y[i];\n}\n__kernel void vec_dot(__global const double *a, __global const double *b, __global double *result, const int n) {\n int row = get_global_id(0);\n if (row == 0) {\n double sum = 0;\n for (int i = 0; i < n; i++) sum += a[i] * b[i];\n result[0] = sum;\n }\n}\n__kernel void vec_norm(__global const double *a, __global double *result, const int n) {\n int row = get_global_id(0);\n if (row == 0) {\n double sum = 0;\n for (int i = 0; i < n; i++) sum += a[i] * a[i];\n result[0] = sqrt(sum);\n }\n}\n__kernel void vec_sub(__global const double *a, __global const double *b, __global double *c, const int n) {\n int i = get_global_id(0); if (i < n) c[i] = a[i] - b[i];\n}\n__kernel void vec_scale(__global const double *a, const double s, __global double *c, const int n) {\n int i = get_global_id(0); if (i < n) c[i] = a[i] * s;\n}\n__kernel void vec_dot_partial(__global const double *a, __global const double *b, __global double *partial_sums, const int n, __local double *local_sums) {\n int local_id = get_local_id(0); int group_id = get_group_id(0); int local_size = get_local_size(0); int i = get_global_id(0);\n double val = (i < n) ? a[i] * b[i] : 0.0;\n local_sums[local_id] = val; barrier(CLK_LOCAL_MEM_FENCE);\n for (int stride = local_size / 2; stride > 0; stride /= 2) {\n if (local_id < stride) local_sums[local_id] += local_sums[local_id + stride];\n barrier(CLK_LOCAL_MEM_FENCE);\n }\n if (local_id == 0) partial_sums[group_id] = local_sums[0];\n}\n__kernel void gaussElimPhase1(__global double *a, const int n, const int k) {\n int i = get_global_id(0) + k + 1;\n if (i < n) {\n double factor = a[i*n + k] / a[k*n + k];\n for (int j = k + 1; j < n; j++) a[i*n + j] -= factor * a[k*n + j];\n a[i*n + k] = 0.0;\n }\n}\n__kernel void transpose(__global const double *a, __global double *b, const int rows, const int cols) {\n int r = get_global_id(1); int c = get_global_id(0);\n if (r < rows && c < cols) b[c * rows + r] = a[r * cols + c];\n}\n__kernel void vec_add(__global const double *a, __global const double *b, __global double *c, const int n) {\n int i = get_global_id(0); if (i < n) c[i] = a[i] + b[i];\n}\n__kernel void normalizeRow(__global double *a, const int rows, const int cols, const int k) {\n int j = get_global_id(0) + k + 1;\n double pivot = a[k * cols + k];\n if (j < cols) a[k * cols + j] /= pivot;\n if (j == k + 1) a[k * cols + k] = 1.0;\n}\n__kernel void gaussJordan(__global double *a, const int rows, const int cols, const int k) {\n int i = get_global_id(0);\n if (i < rows && i != k) {\n double pivot = a[k * cols + k];\n if (fabs(pivot) < 1e-15) return;\n double factor = a[i * cols + k] / pivot;\n for (int j = k + 1; j < cols; j++) a[i * cols + j] -= factor * a[k * cols + j];\n a[i * cols + k] = 0.0;\n }\n}\n__kernel void normalizeRowInv(__global double *a, __global double *inv, const int n, const int k) {\n int j = get_global_id(0);\n if (j < n) {\n double pivot = a[k * n + k];\n if (j > k) a[k * n + j] /= pivot;\n inv[k * n + j] /= pivot;\n if (j == k) a[k * n + k] = 1.0;\n }\n}\n__kernel void gaussJordanInv(__global double *a, __global double *inv, const int n, const int k) {\n int j = get_global_id(0); int i = get_global_id(1);\n if (i < n && j < n && i != k) {\n double factor = a[i * n + k];\n if (j > k) a[i * n + j] -= factor * a[k * n + j];\n inv[i * n + j] -= factor * inv[k * n + j];\n if (j == k) a[i * n + k] = 0.0;\n }\n}\n__kernel void swapRows(__global double *a, const int n, const int r1, const int r2) {\n int j = get_global_id(0);\n if (j < n) {\n double temp = a[r1 * n + j];\n a[r1 * n + j] = a[r2 * n + j];\n a[r2 * n + j] = temp;\n }\n}\n__kernel void gaussElimPhase1WithB(__global double *a, __global double *b, const int n, const int k) {\n int i = get_global_id(0) + k + 1;\n if (i < n) {\n double factor = a[i*n + k] / a[k*n + k];\n for (int j = k + 1; j < n; j++) a[i*n + j] -= factor * a[k*n + j];\n b[i] -= factor * b[k];\n a[i*n + k] = 0.0;\n }\n}\n__kernel void lu_decompose_step(__global double *a, const int n, const int k) {\n int i = get_global_id(1) + k + 1;\n int j = get_global_id(0) + k + 1;\n if (i < n && j < n) {\n if (j == k + 1) a[i * n + k] /= a[k * n + k];\n a[i * n + j] -= a[i * n + k] * a[k * n + j];\n }\n}\n__kernel void cholesky_decompose_step(__global double *a, const int n, const int k) {\n int i = get_global_id(0) + k + 1;\n if (i < n) {\n double sum = 0.0;\n for (int j = 0; j < k; j++) sum += a[i * n + j] * a[k * n + j];\n a[i * n + k] = (a[i * n + k] - sum) / a[k * n + k];\n }\n}\n__kernel void qr_householder_apply(__global double *a, const int rows, const int cols, const int k, __global const double *v) {\n int j = get_global_id(0) + k;\n int i = get_global_id(1) + k;\n if (i < rows && j < cols) {\n double dot = 0.0;\n for (int m = k; m < rows; m++) dot += v[m] * a[m * cols + j];\n a[i * cols + j] -= 2.0 * v[i] * dot;\n }\n}\ntypedef struct { double r; double i; } double2_custom;\n__kernel void complex_saxpy(__global const double2_custom *x, __global double2_custom *y, const double2_custom alpha, const int n) {\n int i = get_global_id(0); if (i < n) {\n double2_custom xv = x[i]; double2_custom yv = y[i];\n y[i].r = yv.r + alpha.r * xv.r - alpha.i * xv.i;\n y[i].i = yv.i + alpha.r * xv.i + alpha.i * xv.r;\n }\n}\n__kernel void complexMatrixMultiply(__global const double2_custom *a, __global const double2_custom *b, __global double2_custom *c, const int m, const int n, const int k) {\n int row = get_global_id(1); int col = get_global_id(0);\n if (row < m && col < n) {\n double2_custom sum = {0.0, 0.0};\n for (int i = 0; i < k; i++) {\n double2_custom av = a[row*k+i];\n double2_custom bv = b[i*n+col];\n sum.r += av.r * bv.r - av.i * bv.i;\n sum.i += av.r * bv.i + av.i * bv.r;\n }\n c[row*n+col] = sum;\n }\n}\n__kernel void complex_vec_add(__global const double2_custom *a, __global const double2_custom *b, __global double2_custom *c, const int n) {\n int i = get_global_id(0); if (i < n) { c[i].r = a[i].r + b[i].r; c[i].i = a[i].i + b[i].i; }\n}\n__kernel void complex_vec_sub(__global const double2_custom *a, __global const double2_custom *b, __global double2_custom *c, const int n) {\n int i = get_global_id(0); if (i < n) { c[i].r = a[i].r - b[i].r; c[i].i = a[i].i - b[i].i; }\n}\n__kernel void complex_vec_scale(__global const double2_custom *a, const double2_custom s, __global double2_custom *c, const int n) {\n int i = get_global_id(0); if (i < n) {\n double2_custom av = a[i];\n c[i].r = av.r * s.r - av.i * s.i;\n c[i].i = av.r * s.i + av.i * s.r;\n }\n}\n__kernel void complex_dot_partial(__global const double2_custom *a, __global const double2_custom *b, __global double2_custom *partial_sums, const int n, __local double2_custom *local_sums) {\n int local_id = get_local_id(0); int group_id = get_group_id(0); int local_size = get_local_size(0); int i = get_global_id(0);\n double2_custom val = {0.0, 0.0};\n if (i < n) {\n double2_custom av = a[i]; double2_custom bv = b[i];\n val.r = av.r * bv.r + av.i * bv.i;\n val.i = av.i * bv.r - av.r * bv.i;\n }\n local_sums[local_id] = val; barrier(CLK_LOCAL_MEM_FENCE);\n for (int stride = local_size / 2; stride > 0; stride /= 2) {\n if (local_id < stride) {\n local_sums[local_id].r += local_sums[local_id + stride].r;\n local_sums[local_id].i += local_sums[local_id + stride].i;\n }\n barrier(CLK_LOCAL_MEM_FENCE);\n }\n if (local_id == 0) partial_sums[group_id] = local_sums[0];\n}\n__kernel void hestenes_jacobi_dot(__global const double *a, int m, int n, int i_col, int j_col, __global double *out_dot) {\n if (get_global_id(0) == 0) {\n double s_ii = 0; double s_jj = 0; double s_ij = 0;\n for (int k = 0; k < m; k++) {\n double val_i = a[k * n + i_col]; double val_j = a[k * n + j_col];\n s_ii += val_i * val_i; s_jj += val_j * val_j; s_ij += val_i * val_j;\n }\n out_dot[0] = s_ii; out_dot[1] = s_jj; out_dot[2] = s_ij;\n }\n}\n__kernel void hestenes_jacobi_apply(__global double *a, __global double *v, int m, int n, int i_col, int j_col, double cos_v, double sin_v) {\n int row = get_global_id(0);\n if (row < m) {\n double ai = a[row * n + i_col]; double aj = a[row * n + j_col];\n a[row * n + i_col] = cos_v * ai + sin_v * aj;\n a[row * n + j_col] = -sin_v * ai + cos_v * aj;\n }\n if (row < n) {\n double vi = v[row * n + i_col]; double vj = v[row * n + j_col];\n v[row * n + i_col] = cos_v * vi + sin_v * vj;\n v[row * n + j_col] = -sin_v * vi + cos_v * vj;\n }\n}\n__kernel void solve_triangular_lower(__global const double *a, __global double *b, const int n, const int unit_diag) {\n for (int i = 0; i < n; i++) {\n if (get_global_id(0) == 0) {\n double sum = 0.0;\n for (int j = 0; j < i; j++) sum += a[i * n + j] * b[j];\n double diag = unit_diag ? 1.0 : a[i * n + i];\n b[i] = (b[i] - sum) / diag;\n }\n barrier(CLK_GLOBAL_MEM_FENCE);\n }\n}\n__kernel void solve_triangular_upper(__global const double *a, __global double *b, const int n, const int unit_diag) {\n for (int i = n - 1; i >= 0; i--) {\n if (get_global_id(0) == 0) {\n double sum = 0.0;\n for (int j = i + 1; j < n; j++) sum += a[i * n + j] * b[j];\n double diag = unit_diag ? 1.0 : a[i * n + i];\n b[i] = (b[i] - sum) / diag;\n }\n barrier(CLK_GLOBAL_MEM_FENCE);\n }\n}\n__kernel void complex_solve_triangular_lower(__global const double2_custom *a, __global double2_custom *b, const int n, const int unit_diag) {\n for (int i = 0; i < n; i++) {\n if (get_global_id(0) == 0) {\n double2_custom sum = {0.0, 0.0};\n for (int j = 0; j < i; j++) {\n double2_custom av = a[i * n + j]; double2_custom bv = b[j];\n sum.r += av.r * bv.r - av.i * bv.i;\n sum.i += av.r * bv.i + av.i * bv.r;\n }\n double2_custom bi = b[i]; double2_custom res;\n res.r = bi.r - sum.r; res.i = bi.i - sum.i;\n if (!unit_diag) {\n double2_custom diag = a[i * n + i];\n double d = diag.r * diag.r + diag.i * diag.i;\n double rr = (res.r * diag.r + res.i * diag.i) / d;\n double ri = (res.i * diag.r - res.r * diag.i) / d;\n res.r = rr; res.i = ri;\n }\n b[i] = res;\n }\n barrier(CLK_GLOBAL_MEM_FENCE);\n }\n}\n__kernel void complex_solve_triangular_upper(__global const double2_custom *a, __global double2_custom *b, const int n, const int unit_diag) {\n for (int i = n - 1; i >= 0; i--) {\n if (get_global_id(0) == 0) {\n double2_custom sum = {0.0, 0.0};\n for (int j = i + 1; j < n; j++) {\n double2_custom av = a[i * n + j]; double2_custom bv = b[j];\n sum.r += av.r * bv.r - av.i * bv.i;\n sum.i += av.r * bv.i + av.i * bv.r;\n }\n double2_custom bi = b[i]; double2_custom res;\n res.r = bi.r - sum.r; res.i = bi.i - sum.i;\n if (!unit_diag) {\n double2_custom diag = a[i * n + i];\n double d = diag.r * diag.r + diag.i * diag.i;\n double rr = (res.r * diag.r + res.i * diag.i) / d;\n double ri = (res.i * diag.r - res.r * diag.i) / d;\n res.r = rr; res.i = ri;\n }\n b[i] = res;\n }\n barrier(CLK_GLOBAL_MEM_FENCE);\n }\n}\n__kernel void trace_kernel(__global const double *a, __global double *result, const int n) {\n if (get_global_id(0) == 0) {\n double sum = 0.0;\n for (int i = 0; i < n; i++) sum += a[i * n + i];\n result[0] = sum;\n }\n}\n__kernel void conjugate_transpose_kernel(__global const double2_custom *a, __global double2_custom *b, const int rows, const int cols) {\n int r = get_global_id(1); int c = get_global_id(0);\n if (r < rows && c < cols) {\n b[c * rows + r].r = a[r * cols + c].r;\n b[c * rows + r].i = -a[r * cols + c].i;\n }\n}\n__kernel void normalize_vec_kernel(__global double *a, const double norm_inv, const int n) {\n int i = get_global_id(0); if (i < n) a[i] *= norm_inv;\n}\n"
    public static final String
    DENSE_FLOAT_COMPLEX_KERNELS
    "__kernel void complexMatrixMultiplyFloat(__global const float2 *a, __global const float2 *b, __global float2 *c, const int m, const int n, const int k) {\n int row = get_global_id(1); int col = get_global_id(0);\n if (row < m && col < n) {\n float2 sum = (float2)(0.0f, 0.0f);\n for (int i = 0; i < k; i++) {\n float2 av = a[row*k+i];\n float2 bv = b[i*n+col];\n sum.x += av.x * bv.x - av.y * bv.y;\n sum.y += av.x * bv.y + av.y * bv.x;\n }\n c[row*n+col] = sum;\n }\n}\n__kernel void complex_vec_add_float(__global const float2 *a, __global const float2 *b, __global float2 *c, const int n) {\n int i = get_global_id(0); if (i < n) { c[i].x = a[i].x + b[i].x; c[i].y = a[i].y + b[i].y; }\n}\n__kernel void complex_vec_sub_float(__global const float2 *a, __global const float2 *b, __global float2 *c, const int n) {\n int i = get_global_id(0); if (i < n) { c[i].x = a[i].x - b[i].x; c[i].y = a[i].y - b[i].y; }\n}\n__kernel void complex_vec_scale_float(__global const float2 *a, const float2 s, __global float2 *c, const int n) {\n int i = get_global_id(0); if (i < n) {\n float2 av = a[i];\n c[i].x = av.x * s.x - av.y * s.y;\n c[i].y = av.x * s.y + av.y * s.x;\n }\n}\n__kernel void vec_dot_partial_float(__global const float *a, __global const float *b, __global float *partial_sums, const int n, __local float *local_sums) {\n int local_id = get_local_id(0); int group_id = get_group_id(0); int local_size = get_local_size(0); int i = get_global_id(0);\n float val = (i < n) ? a[i] * b[i] : 0.0f;\n local_sums[local_id] = val; barrier(CLK_LOCAL_MEM_FENCE);\n for (int stride = local_size / 2; stride > 0; stride /= 2) {\n if (local_id < stride) local_sums[local_id] += local_sums[local_id + stride];\n barrier(CLK_LOCAL_MEM_FENCE);\n }\n if (local_id == 0) partial_sums[group_id] = local_sums[0];\n}\n__kernel void complex_dot_partial_float(__global const float2 *a, __global const float2 *b, __global float2 *partial_sums, const int n, __local float2 *local_sums) {\n int local_id = get_local_id(0); int group_id = get_group_id(0); int local_size = get_local_size(0); int i = get_global_id(0);\n float2 val = (float2)(0.0f, 0.0f);\n if (i < n) {\n float2 av = a[i]; float2 bv = b[i];\n val.x = av.x * bv.x + av.y * bv.y;\n val.y = av.y * bv.x - av.x * bv.y;\n }\n local_sums[local_id] = val; barrier(CLK_LOCAL_MEM_FENCE);\n for (int stride = local_size / 2; stride > 0; stride /= 2) {\n if (local_id < stride) {\n local_sums[local_id].x += local_sums[local_id + stride].x;\n local_sums[local_id].y += local_sums[local_id + stride].y;\n }\n barrier(CLK_LOCAL_MEM_FENCE);\n }\n if (local_id == 0) partial_sums[group_id] = local_sums[0];\n}\n"
    public static final String
    DENSE_FLOAT_KERNELS
    "__kernel void matrixMultiplyFloat(__global const float *a, __global const float *b, __global float *c, const int m, const int n, const int k) {\n int row = get_global_id(1); int col = get_global_id(0);\n if (row < m && col < n) {\n float sum = 0.0f;\n for (int i = 0; i < k; i++) sum += a[row*k+i] * b[i*n+col];\n c[row*n+col] = sum;\n }\n}\n__kernel void vec_add_float(__global const float *a, __global const float *b, __global float *c, const int n) {\n int i = get_global_id(0); if (i < n) c[i] = a[i] + b[i];\n}\n__kernel void vec_sub_float(__global const float *a, __global const float *b, __global float *c, const int n) {\n int i = get_global_id(0); if (i < n) c[i] = a[i] - b[i];\n}\n__kernel void vec_scale_float(__global const float *a, const float s, __global float *c, const int n) {\n int i = get_global_id(0); if (i < n) c[i] = a[i] * s;\n}\n__kernel void transposeFloat(__global const float *a, __global float *b, const int rows, const int cols) {\n int r = get_global_id(1); int c = get_global_id(0);\n if (r < rows && c < cols) b[c * rows + r] = a[r * cols + c];\n}\n__kernel void saxpy_float(__global const float *x, __global float *y, const float alpha, const int n) {\n int i = get_global_id(0);\n if (i < n) y[i] = alpha * x[i] + y[i];\n}\n__kernel void complex_saxpy_float(__global const float2 *x, __global float2 *y, const float2 alpha, const int n) {\n int i = get_global_id(0);\n if (i < n) {\n float2 xv = x[i]; float2 yv = y[i];\n y[i].x = yv.x + alpha.x * xv.x - alpha.y * xv.y;\n y[i].y = yv.y + alpha.x * xv.y + alpha.y * xv.x;\n }\n}\n__kernel void vec_dot_float(__global const float *a, __global const float *b, __global float *result, const int n) {\n int row = get_global_id(0);\n if (row == 0) {\n float sum = 0;\n for (int i = 0; i < n; i++) sum += a[i] * b[i];\n result[0] = sum;\n }\n}\n__kernel void vec_norm_float(__global const float *a, __global float *result, const int n) {\n int row = get_global_id(0);\n if (row == 0) {\n float sum = 0;\n for (int i = 0; i < n; i++) sum += a[i] * a[i];\n result[0] = sqrt(sum);\n }\n}\n__kernel void gaussElimPhase1Float(__global float *a, const int n, const int k) {\n int i = get_global_id(0) + k + 1;\n if (i < n) {\n float factor = a[i*n + k] / a[k*n + k];\n for (int j = k + 1; j < n; j++) a[i*n + j] -= factor * a[k*n + j];\n a[i*n + k] = 0.0f;\n }\n}\n__kernel void gaussJordanFloat(__global float *a, const int rows, const int cols, const int k) {\n int i = get_global_id(0);\n if (i < rows && i != k) {\n float pivot = a[k * cols + k];\n if (fabs(pivot) < 1e-7f) return;\n float factor = a[i * cols + k] / pivot;\n for (int j = k + 1; j < cols; j++) a[i * cols + j] -= factor * a[k * cols + j];\n a[i * cols + k] = 0.0f;\n }\n}\n__kernel void normalizeRowFloat(__global float *a, const int rows, const int cols, const int k) {\n int j = get_global_id(0) + k + 1;\n float pivot = a[k * cols + k];\n if (j < cols) a[k * cols + j] /= pivot;\n if (j == k + 1) a[k * cols + k] = 1.0f;\n}\n__kernel void normalizeRowInvFloat(__global float *a, __global float *inv, const int n, const int k) {\n int j = get_global_id(0);\n if (j < n) {\n float pivot = a[k * n + k];\n inv[k * n + j] /= pivot;\n }\n}\n__kernel void gaussJordanInvFloat(__global float *a, __global float *inv, const int n, const int k) {\n int i = get_global_id(0);\n if (i < n && i != k) {\n float factor = a[i * n + k];\n for (int j = 0; j < n; j++) inv[i * n + j] -= factor * inv[k * n + j];\n }\n}\n__kernel void lu_decompose_step_float(__global float *a, const int n, const int k) {\n int i = get_global_id(1) + k + 1;\n int j = get_global_id(0) + k + 1;\n if (i < n && j < n) {\n if (j == k + 1) a[i * n + k] /= a[k * n + k];\n a[i * n + j] -= a[i * n + k] * a[k * n + j];\n }\n}\n__kernel void cholesky_decompose_step_float(__global float *a, const int n, const int k) {\n int i = get_global_id(0) + k + 1;\n if (i < n) {\n float sum = 0.0f;\n for (int j = 0; j < k; j++) sum += a[i * n + j] * a[k * n + j];\n a[i * n + k] = (a[i * n + k] - sum) / a[k * n + k];\n }\n}\n__kernel void qr_householder_apply_float(__global float *a, const int rows, const int cols, const int k, __global const float *v) {\n int j = get_global_id(0) + k;\n int i = get_global_id(1) + k;\n if (i < rows && j < cols) {\n float dot = 0.0f;\n for (int m = k; m < rows; m++) dot += v[m] * a[m * cols + j];\n a[i * cols + j] -= 2.0f * v[i] * dot;\n }\n}\n__kernel void solve_triangular_lower_float(__global const float *a, __global float *b, const int n, const int unit_diag) {\n for (int i = 0; i < n; i++) {\n if (get_global_id(0) == 0) {\n float sum = 0.0f;\n for (int j = 0; j < i; j++) sum += a[i * n + j] * b[j];\n float diag = unit_diag ? 1.0f : a[i * n + i];\n b[i] = (b[i] - sum) / diag;\n }\n barrier(CLK_GLOBAL_MEM_FENCE);\n }\n}\n__kernel void solve_triangular_upper_float(__global const float *a, __global float *b, const int n, const int unit_diag) {\n for (int i = n - 1; i >= 0; i--) {\n if (get_global_id(0) == 0) {\n float sum = 0.0f;\n for (int j = i + 1; j < n; j++) sum += a[i * n + j] * b[j];\n float diag = unit_diag ? 1.0f : a[i * n + i];\n b[i] = (b[i] - sum) / diag;\n }\n barrier(CLK_GLOBAL_MEM_FENCE);\n }\n}\n__kernel void complex_solve_triangular_lower_float(__global const float2 *a, __global float2 *b, const int n, const int unit_diag) {\n for (int i = 0; i < n; i++) {\n if (get_global_id(0) == 0) {\n float2 sum = (float2)(0.0f, 0.0f);\n for (int j = 0; j < i; j++) {\n float2 av = a[i * n + j]; float2 bv = b[j];\n sum.x += av.x * bv.x - av.y * bv.y;\n sum.y += av.x * bv.y + av.y * bv.x;\n }\n float2 bi = b[i]; float2 res;\n res.x = bi.x - sum.x; res.y = bi.y - sum.y;\n if (!unit_diag) {\n float2 diag = a[i * n + i];\n float d = diag.x * diag.x + diag.y * diag.y;\n float rr = (res.x * diag.x + res.y * diag.y) / d;\n float ri = (res.y * diag.x - res.x * diag.y) / d;\n res.x = rr; res.y = ri;\n }\n b[i] = res;\n }\n barrier(CLK_GLOBAL_MEM_FENCE);\n }\n}\n__kernel void complex_solve_triangular_upper_float(__global const float2 *a, __global float2 *b, const int n, const int unit_diag) {\n for (int i = n - 1; i >= 0; i--) {\n if (get_global_id(0) == 0) {\n float2 sum = (float2)(0.0f, 0.0f);\n for (int j = i + 1; j < n; j++) {\n float2 av = a[i * n + j]; float2 bv = b[j];\n sum.x += av.x * bv.x - av.y * bv.y;\n sum.y += av.x * bv.y + av.y * bv.x;\n }\n float2 bi = b[i]; float2 res;\n res.x = bi.x - sum.x; res.y = bi.y - sum.y;\n if (!unit_diag) {\n float2 diag = a[i * n + i];\n float d = diag.x * diag.x + diag.y * diag.y;\n float rr = (res.x * diag.x + res.y * diag.y) / d;\n float ri = (res.y * diag.x - res.x * diag.y) / d;\n res.x = rr; res.y = ri;\n }\n b[i] = res;\n }\n barrier(CLK_GLOBAL_MEM_FENCE);\n }\n}\n__kernel void trace_kernel_float(__global const float *a, __global float *result, const int n) {\n if (get_global_id(0) == 0) {\n float sum = 0.0f;\n for (int i = 0; i < n; i++) sum += a[i * n + i];\n result[0] = sum;\n }\n}\n__kernel void hestenes_jacobi_dot_float(__global const float *a, int m, int n, int i_col, int j_col, __global float *out_dot) {\n if (get_global_id(0) == 0) {\n float s_ii = 0; float s_jj = 0; float s_ij = 0;\n for (int k = 0; k < m; k++) {\n float val_i = a[k * n + i_col]; float val_j = a[k * n + j_col];\n s_ii += val_i * val_i; s_jj += val_j * val_j; s_ij += val_i * val_j;\n }\n out_dot[0] = s_ii; out_dot[1] = s_jj; out_dot[2] = s_ij;\n }\n}\n__kernel void hestenes_jacobi_apply_float(__global float *a, __global float *v, int m, int n, int i_col, int j_col, float cos_v, float sin_v) {\n int row = get_global_id(0);\n if (row < m) {\n float ai = a[row * n + i_col]; float aj = a[row * n + j_col];\n a[row * n + i_col] = cos_v * ai + sin_v * aj;\n a[row * n + j_col] = -sin_v * ai + cos_v * aj;\n }\n if (row < n) {\n float vi = v[row * n + i_col]; float vj = v[row * n + j_col];\n v[row * n + i_col] = cos_v * vi + sin_v * vj;\n v[row * n + j_col] = -sin_v * vi + cos_v * vj;\n }\n}\n__kernel void conjugate_transpose_kernel_float(__global const float2 *a, __global float2 *b, const int rows, const int cols) {\n int r = get_global_id(1); int c = get_global_id(0);\n if (r < rows && c < cols) {\n b[c * rows + r].x = a[r * cols + c].x;\n b[c * rows + r].y = -a[r * cols + c].y;\n }\n}\n__kernel void normalize_vec_kernel_float(__global float *a, const float norm_inv, const int n) {\n int i = get_global_id(0); if (i < n) a[i] *= norm_inv;\n}\n"
    public static final String
    FP64_HEADER
    "#if defined(cl_khr_fp64)\n#pragma OPENCL EXTENSION cl_khr_fp64 : enable\n#elif defined(cl_amd_fp64)\n#pragma OPENCL EXTENSION cl_amd_fp64 : enable\n#endif\n\n"
    public static final String
    SPARSE_DOUBLE_KERNELS
    "__kernel void spmv_csr_double(int num_rows, __global const int* ptr, __global const int* indices, __global const double* values, __global const double* x, __global double* y) {\n int row = get_global_id(0);\n if (row < num_rows) {\n double dot = 0.0;\n int start = ptr[row];\n int end = ptr[row+1];\n for (int j = start; j < end; j++) {\n dot += values[j] * x[indices[j]];\n }\n y[row] = dot;\n }\n}\n__kernel void complex_spmv_csr_double(int num_rows, __global const int* ptr, __global const int* indices, __global const double2* values, __global const double2* x, __global double2* y) {\n int row = get_global_id(0);\n if (row < num_rows) {\n double2 dot = (double2)(0.0, 0.0);\n int start = ptr[row];\n int end = ptr[row+1];\n for (int j = start; j < end; j++) {\n double2 av = values[j];\n double2 xv = x[indices[j]];\n dot.x += av.x * xv.x - av.y * xv.y;\n dot.y += av.x * xv.y + av.y * xv.x;\n }\n y[row] = dot;\n }\n}\n"
    public static final String
    SPARSE_FLOAT_KERNELS
    "__kernel void spmv_csr_float(int num_rows, __global const int* ptr, __global const int* indices, __global const float* values, __global const float* x, __global float* y) {\n int row = get_global_id(0);\n if (row < num_rows) {\n float dot = 0.0f;\n int start = ptr[row];\n int end = ptr[row+1];\n for (int j = start; j < end; j++) {\n dot += values[j] * x[indices[j]];\n }\n y[row] = dot;\n }\n}\n__kernel void complex_spmv_csr_float(int num_rows, __global const int* ptr, __global const int* indices, __global const float2* values, __global const float2* x, __global float2* y) {\n int row = get_global_id(0);\n if (row < num_rows) {\n float2 dot = (float2)(0.0f, 0.0f);\n int start = ptr[row];\n int end = ptr[row+1];\n for (int j = start; j < end; j++) {\n float2 av = values[j];\n float2 xv = x[indices[j]];\n dot.x += av.x * xv.x - av.y * xv.y;\n dot.y += av.x * xv.y + av.y * xv.x;\n }\n y[row] = dot;\n }\n}\n"
  • org.episteme.natural.chemistry.electrochemistry.FaradayLaws
    Modifier and Type
    Constant Field
    Value
    public static final double
    F
    96485.33212
  • org.episteme.natural.chemistry.electrochemistry.NernstEquation
    Modifier and Type
    Constant Field
    Value
    public static final double
    F
    96485.33212
    public static final double
    R
    8.314462618
  • org.episteme.natural.earth.atmosphere.AtmosphericPressure
    Modifier and Type
    Constant Field
    Value
    public static final double
    g
    9.80665
    public static final double
    L
    0.0065
    public static final double
    M
    0.0289644
    public static final double
    P0
    101325.0
    public static final double
    R
    8.31447
    public static final double
    T0
    288.15
  • org.episteme.natural.earth.atmosphere.ClimateModel
    Modifier and Type
    Constant Field
    Value
    public static final double
    EARTH_ALBEDO
    0.3
  • org.episteme.natural.physics.astronomy.mechanics.OrbitSolver
    Modifier and Type
    Constant Field
    Value
    public static final double
    G
    6.6743E-11
  • org.episteme.natural.physics.astronomy.time.JulianDate
    Modifier and Type
    Constant Field
    Value
    public static final double
    B1950
    2433282.4235
    public static final double
    DAYS_PER_CENTURY
    36525.0
    public static final double
    J2000
    2451545.0
  • org.episteme.natural.physics.classical.matter.fluids.KEpsilonModel
    Modifier and Type
    Constant Field
    Value
    public static final double
    C_EPS1
    1.44
    public static final double
    C_EPS2
    1.92
    public static final double
    C_MU
    0.09
    public static final double
    SIGMA_EPS
    1.3
    public static final double
    SIGMA_K
    1.0
  • org.episteme.natural.physics.classical.waves.electromagnetism.circuit.RowInfo
    Modifier and Type
    Constant Field
    Value
    public static final int
    ROW_CONST
    1
    public static final int
    ROW_EQUAL
    2
    public static final int
    ROW_NORMAL
    0
  • org.episteme.social.economics.EconomicsConstants
    Modifier and Type
    Constant Field
    Value
    public static final int
    UNKNOWN
    -1
  • org.episteme.social.history.calendars.AlternateCalendar
    Modifier and Type
    Constant Field
    Value
    public static final double
    JD_EPOCH
    -1721424.5
  • org.episteme.social.history.calendars.ChineseCalendar
    Modifier and Type
    Constant Field
    Value
    public static final int
    EPOCHYEAR
    -2636
  • org.episteme.social.history.calendars.FrenchCalendar
    Modifier and Type
    Constant Field
    Value
    protected static final double
    TIMEZONE
    9.35
    protected static final double
    TROPYEAR
    365.242199
  • org.episteme.social.history.calendars.ModifiedHinduLunarBRCalendar
    Modifier and Type
    Constant Field
    Value
    protected static final int
    LUNARERA
    3044
  • org.episteme.social.history.calendars.ModifiedHinduLunarCalendar
    Modifier and Type
    Constant Field
    Value
    protected static final int
    LUNARERA
    3044
  • org.episteme.social.history.calendars.ModifiedHinduSolarBRCalendar
    Modifier and Type
    Constant Field
    Value
    protected static final int
    SOLARERA
    3179
  • org.episteme.social.history.calendars.ModifiedHinduSolarCalendar
    Modifier and Type
    Constant Field
    Value
    protected static final int
    SOLARERA
    3179
  • org.episteme.social.history.calendars.Moment
    Modifier and Type
    Constant Field
    Value
    public static final double
    MEANSYNODICMONTH
    29.530588853
  • org.episteme.social.history.calendars.SevenDaysWeek
    Modifier and Type
    Constant Field
    Value
    public static final int
    FRIDAY
    5
    public static final int
    MONDAY
    1
    public static final int
    SATURDAY
    6
    public static final int
    SUNDAY
    0
    public static final int
    THURSDAY
    4
    public static final int
    TUESDAY
    2
    public static final int
    WEDNESDAY
    3
  • org.episteme.social.politics.PoliticsConstants
    Modifier and Type
    Constant Field
    Value
    public static final int
    UNKNOWN
    0
  • org.episteme.social.politics.flags.Vexillology
    Modifier and Type
    Constant Field
    Value
    public static final double
    RATIO_1_2
    2.0
    public static final double
    RATIO_2_3
    1.5
    public static final double
    RATIO_3_5
    1.666
    public static final double
    RATIO_SQUARE
    1.0
  • org.episteme.social.psychology.Behavior
    Modifier and Type
    Constant Field
    Value
    public static final int
    INSTINCTIVE
    4
    public static final int
    REFLEX
    1
    public static final int
    SELF
    2
    public static final int
    SOCIAL
    3
    public static final int
    UNKNOWN
    0
  • org.episteme.social.psychology.Behavior.Type
    Modifier and Type
    Constant Field
    Value
    public static final int
    INSTINCTIVE
    4
    public static final int
    REFLEX
    1
    public static final int
    SELF
    2
    public static final int
    SOCIAL
    3