39 research outputs found

    Virtual photons in imaginary time: Computing exact Casimir forces via standard numerical-electromagnetism techniques

    Full text link
    We describe a numerical method to compute Casimir forces in arbitrary geometries, for arbitrary dielectric and metallic materials, with arbitrary accuracy (given sufficient computational resources). Our approach, based on well-established integration of the mean stress tensor evaluated via the fluctuation-dissipation theorem, is designed to directly exploit fast methods developed for classical computational electromagnetism, since it only involves repeated evaluation of the Green's function for imaginary frequencies (equivalently, real frequencies in imaginary time). We develop the approach by systematically examining various formulations of Casimir forces from the previous decades and evaluating them according to their suitability for numerical computation. We illustrate our approach with a simple finite-difference frequency-domain implementation, test it for known geometries such as a cylinder and a plate, and apply it to new geometries. In particular, we show that a piston-like geometry of two squares sliding between metal walls, in both two and three dimensions with both perfect and realistic metallic materials, exhibits a surprising non-monotonic ``lateral'' force from the walls.Comment: Published in Physical Review A, vol. 76, page 032106 (2007

    A Real-Space Full Multigrid study of the fragmentation of Li11+ clusters

    Full text link
    We have studied the fragmentation of Li11+ clusters into the two experimentally observed products (Li9+,Li2) and (Li10+,Li) The ground state structures for the two fragmentation channels are found by Molecular Dynamics Simulated Annealing in the framework of Local Density Functional theory. Energetics considerations suggest that the fragmentation process is dominated by non-equilibrium processes. We use a real-space approach to solve the Kohn-Sham problem, where the Laplacian operator is discretized according to the Mehrstellen scheme, and take advantage of a Full MultiGrid (FMG) strategy to accelerate convergence. When applied to isolated clusters we find our FMG method to be more efficient than state-of-the-art plane wave calculations.Comment: 9 pages + 6 Figures (in gzipped tar file

    On the Relational Database Style Parallel Numerical Programming

    No full text

    The smoothing property for regular splittings

    No full text
    Abstract in tex

    An algorithm for total variation inpainting based on nonlinear multi-grid methods

    No full text
    Image inpainting refers to restoring a damaged image with missing information. The total variation (TV) inpainting model is one such method that simultaneously fills in the regions with available information from their surroundings and eliminates noises. The method works well with small narrow inpainting domains. However there remains an urgent need to develop fast iterative solvers, as the underlying problem sizes are large. In addition one needs to tackle the imbalance of results between inpainting and denoising. When the inpainting regions are thick and large, the procedure of inpainting works quite slowly and usually requires a significant number of iterations and leads inevitably to oversmoothing in the outside of the inpainting domain. To overcome these difficulties, we propose a solution for TV inpainting method based on the nonlinear multi-grid algorithm
    corecore