ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1905.08423
  4. Cited By
Parallel memory-efficient all-at-once algorithms for the sparse matrix
  triple products in multigrid methods

Parallel memory-efficient all-at-once algorithms for the sparse matrix triple products in multigrid methods

21 May 2019
F. Kong
ArXiv (abs)PDFHTML

Papers citing "Parallel memory-efficient all-at-once algorithms for the sparse matrix triple products in multigrid methods"

1 / 1 papers shown
Title
A scalable multilevel domain decomposition preconditioner with a
  subspace-based coarsening algorithm for the neutron transport calculations
A scalable multilevel domain decomposition preconditioner with a subspace-based coarsening algorithm for the neutron transport calculations
F. Kong
Yaqi Wang
D. Gaston
A. Lindsay
C. Permann
R. Martineau
18
2
0
18 Jun 2019
1