Structure of highly parallel, efficient, scalable, true robust pseudomultigrid technique for black-box solving a large class of the boundary value problems on high performance computing systems
DOI10.1134/S1995080218040157zbMATH Open1483.65201OpenAlexW2803473363MaRDI QIDQ1662800FDOQ1662800
Authors: D. Varlamov, A. Volokhov, V. M. Volokhov, P. D. Toktaliev, S. I. Martynenko, L. S. Yanovskiy, E. V. Amosova 
Publication date: 20 August 2018
Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1995080218040157
Recommendations
Parallel numerical computation (65Y05) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Numerical algorithms for specific classes of architectures (65Y10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Structure of highly parallel, efficient, scalable, true robust pseudomultigrid technique for black-box solving a large class of the boundary value problems on high performance computing systems
- Parallel multigrid technique: reduction to independent problems
- The robust multigrid technique. For black-box software
Cited In (4)
- Potentialities of the robust multigrid technique
- Structure of highly parallel, efficient, scalable, true robust pseudomultigrid technique for black-box solving a large class of the boundary value problems on high performance computing systems
- The robust multigrid technique. For black-box software
- Numerical methods for black-box software in computational continuum mechanics. Parallel high-performance computing
This page was built for publication: Structure of highly parallel, efficient, scalable, true robust pseudomultigrid technique for black-box solving a large class of the boundary value problems on high performance computing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662800)
