43,050 research outputs found

    Eigenmode-based capacitance calculations with applications in passivation layer design

    Get PDF
    The design of high-speed metallic interconnects such as microstrips requires the correct characterization of both the conductors and the surrounding dielectric environment, in order to accurately predict their propagation characteristics. A fast boundary integral equation approach is obtained by modeling all materials as equivalent surface charge densities in free space. The capacitive behavior of a finite dielectric environment can then be determined by means of a transformation matrix, relating these charge densities to the boundary value of the electric potential. In this paper, a new calculation method is presented for the important case that the dielectric environment is composed of homogeneous rectangles. The method, based on a surface charge expansion in terms of the Robin eigenfunctions of the considered rectangles, is not only more efficient than traditional methods, but is also more accurate, as shown in some numerical experiments. As an application, the design and behavior of a microstrip passivation layer is treated in some detail

    Green's functions for multiply connected domains via conformal mapping

    Get PDF
    A method is described for the computation of the Green's function in the complex plane corresponding to a set of K symmetrically placed polygons along the real axis. An important special case is a set of K real intervals. The method is based on a Schwarz-Christoffel conformal map of the part of the upper half-plane exterior to the problem domain onto a semi-infinite strip whose end contains K-1 slits. From the Green's function one can obtain a great deal of information about polynomial approximations, with applications in digital filters and matrix iteration. By making the end of the strip jagged, the method can be generalised to weighted Green's functions and weighted approximations

    Geodesics in Heat

    Full text link
    We introduce the heat method for computing the shortest geodesic distance to a specified subset (e.g., point or curve) of a given domain. The heat method is robust, efficient, and simple to implement since it is based on solving a pair of standard linear elliptic problems. The method represents a significant breakthrough in the practical computation of distance on a wide variety of geometric domains, since the resulting linear systems can be prefactored once and subsequently solved in near-linear time. In practice, distance can be updated via the heat method an order of magnitude faster than with state-of-the-art methods while maintaining a comparable level of accuracy. We provide numerical evidence that the method converges to the exact geodesic distance in the limit of refinement; we also explore smoothed approximations of distance suitable for applications where more regularity is required
    • …
    corecore