An efficient algorithm for polarizable interactions: a uniformly distributed one-dimensional case

DOI10.1007/s10852-004-3526-yzbMath1108.65025OpenAlexW2058351764MaRDI QIDQ1778100

Gary A. Huber, Thuy-Linh Dinh

Publication date: 16 June 2005

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-004-3526-y

zbMATH Keywords

multigridmultipoleinduced dipolepolarizabilitydipole interaction model

Mathematics Subject Classification ID

Uses Software

• Wesseling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on \(\#\mathcal P\)-completeness of NP-witnessing relations
• Adaptive multigrid method for numerical solutions of elastic wave equation.
• Robust Parallel Smoothing for Multigrid Via Sparse Approximate Inverses
• Multigrid Methods for Nearly Singular Linear Equations and Eigenvalue Problems
• On the Robustness of ILU Smoothing
• Multi-Level Adaptive Solutions to Boundary-Value Problems
• An Algebraic Multigrid Approach for Image Analysis
• On Red-Black SOR Smoothing in Multigrid
• The speed of convergence of one iterative process
• A relaxation method for solving elliptic difference equations
• A fast algorithm for particle simulations
• A review of algebraic multigrid
• Geometric multigrid with applications to computational fluid dynamics

This page was built for publication: An efficient algorithm for polarizable interactions: a uniformly distributed one-dimensional case