def annular(xi_count, eta_count, min_radius, max_radius, alpha=None): from numpy import zeros, float_, int_, linspace, delete, s_ from math import cos, sin, sqrt, tanh, pi nodes = zeros((xi_count * eta_count, 2), dtype=float_) elements = zeros(((xi_count - 1) * (eta_count - 1), 4), dtype=int_) hxi = 1.0 / float(xi_count - 1) points_xi = linspace(0.0, 1.0, num=xi_count) points_eta = linspace(0.0, 1.0, num=eta_count) angle = alpha if alpha is None: angle = 2.0 * pi p = sqrt((min_radius - min_radius * cos(angle * hxi)) ** 2.0 + (min_radius * sin(angle * hxi)) ** 2.0) q = 2.0 - p for i in range(xi_count): xi = points_xi[i] for j in range(eta_count): eta = points_eta[j] s = p * eta + (1.0 - p) * (1.0 - tanh(q * (1.0 - eta)) / tanh(q)) x = (min_radius + (max_radius - min_radius) * s) * cos(angle * xi) y = (min_radius + (max_radius - min_radius) * s) * sin(angle * xi) nodes[i * eta_count + j, 0] = x nodes[i * eta_count + j, 1] = y for i in range(xi_count - 1): for j in range(eta_count - 1): elements[i * (eta_count - 1) + j, 0] = i * eta_count + j elements[i * (eta_count - 1) + j, 1] = i * eta_count + (j + 1) elements[i * (eta_count - 1) + j, 2] = (i + 1) * eta_count + (j + 1) elements[i * (eta_count - 1) + j, 3] = (i + 1) * eta_count + j if alpha is None: i = xi_count - 2 for j in range(eta_count - 1): elements[i * (eta_count - 1) + j, 0] = i * eta_count + j elements[i * (eta_count - 1) + j, 1] = i * eta_count + (j + 1) elements[i * (eta_count - 1) + j, 2] = (j + 1) elements[i * (eta_count - 1) + j, 3] = j nodes = delete(nodes, s_[(xi_count - 1) * eta_count: xi_count * eta_count], 0) return nodes, elements