The block-P^3M algorithm
DOI10.1016/J.CPC.2008.01.043zbMATH Open1197.65214OpenAlexW2086882493MaRDI QIDQ711166FDOQ711166
Publication date: 25 October 2010
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cpc.2008.01.043
Recommendations
- A finite element based P\(^3\)M method for \(N\)-body problems
- About improving efficiency of the \(P^3 M\) algorithms when computing the inter-particle forces in beam dynamics
- Yet another fast multipole method without multipoles -- pseudoparticle multipole method
- Comments on P\(^3\)M, FMM, and the Ewald method for large periodic Coulombic systems
- A fast adaptive multipole algorithm in three dimensions
Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55) Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs (65M60) Numerical methods for integral transforms (65R10) Method of moments applied to problems in optics and electromagnetic theory (78M05)
Cites Work
- Multi-Level Adaptive Solutions to Boundary-Value Problems
- Title not available (Why is that?)
- Rapid solution of integral equations of classical potential theory
- Remarks on the solution of Poisson's equation for isolated systems
- A hierarchical \({\mathcal O}(N)\) force calculation algorithm
- Multilevel computations of integral transforms and particle interactions with oscillatory kernels
- Modeling quantum structures with the boundary element method
Cited In (5)
This page was built for publication: The block-P\(^{3}\)M algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q711166)
