On the public citation graph

s-Step Krylov Subspace Methods as Bottom Solvers for Geometric Multigrid

https://doi.org/10.1109/ipdps.2014.119

0 signed · 38 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/nla.1808openalex-snapshot

Improving the arithmetic intensity of multigrid with the help of polynomial smoothers

inferredcites →https://doi.org/10.1006/jcss.1997.1473openalex-snapshot

Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers

inferredcites →https://doi.org/10.1007/978-3-642-33078-0_31openalex-snapshot

The Impact of Global Communication Latency at Extreme Scales on Krylov Methods

inferredcites →https://doi.org/10.1016/0168-9274(95)00079-aopenalex-snapshot

Reducing the effect of global communication in GMRES(m) and CG on parallel distributed memory computers

inferredcites →https://doi.org/10.1016/0377-0427(89)90045-9openalex-snapshot

s-step iterative methods for symmetric linear systems

inferredcites →https://doi.org/10.1016/j.apnum.2010.12.009openalex-snapshot

On the generation of Krylov subspace bases

inferredcites →https://doi.org/10.1016/j.parco.2007.04.004openalex-snapshot

Parallel Arnoldi eigensolvers with enhanced scalability via global communications rearrangement

inferredcites →https://doi.org/10.1016/j.parco.2013.06.001openalex-snapshot

Hiding global synchronization latency in the preconditioned Conjugate Gradient algorithm

inferredcites →https://doi.org/10.1080/00207169208804107openalex-snapshot

Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory

inferredcites →https://doi.org/10.1088/0004-637x/765/1/39openalex-snapshot

Nyx: A MASSIVELY PARALLEL AMR CODE FOR COMPUTATIONAL COSMOLOGY

inferredcites →https://doi.org/10.1093/imanum/14.4.563openalex-snapshot

A Newton basis GMRES implementation

inferredcites →https://doi.org/10.1109/apdc.1997.574029openalex-snapshot

Solving sparse least squares problems on massively distributed memory computers

inferredcites →https://doi.org/10.1109/sc.2012.85openalex-snapshot

Optimization of geometric multigrid for emerging multi- and manycore processors

inferredcites →https://doi.org/10.1109/sfcs.1993.366817openalex-snapshot

Efficient out-of-core algorithms for linear relaxation using blocking covers

inferredcites →https://doi.org/10.1137/0909010openalex-snapshot

Implementation of the GMRES Method Using Householder Transformations

inferredcites →https://doi.org/10.1137/1.9780898718003openalex-snapshot

Iterative Methods for Sparse Linear Systems

inferredcites →https://doi.org/10.1137/12086563xopenalex-snapshot

Hiding Global Communication Latency in the GMRES Algorithm on Massively Parallel Machines

inferredcites →https://doi.org/10.1137/120881191openalex-snapshot

Avoiding Communication in Nonsymmetric Lanczos-Based Krylov Subspace Methods

inferredcites →https://doi.org/10.1145/1089014.1089019openalex-snapshot

SLEPc

inferredcites →https://doi.org/10.5555/2388996.2389126openalex-snapshot

Optimization of geometric multigrid for emerging multi- and manycore processors

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/nla.2407openalex-snapshot

Block low‐rank single precision coarse grid solvers for extreme scale multigrid methods

inferred← citeshttps://doi.org/10.1007/978-3-319-40528-5_21openalex-snapshot

Automated Performance Modeling of the UG4 Simulation Framework

inferred← citeshttps://doi.org/10.1007/978-3-319-47066-5_45openalex-snapshot

A Massively Parallel Multigrid Method with Level Dependent Smoothers for Problems with High Anisotropies

inferred← citeshttps://doi.org/10.1007/978-3-662-48096-0_40openalex-snapshot

10,000 Performance Models per Minute – Scalability of the UG4 Simulation Framework

inferred← citeshttps://doi.org/10.1016/j.jocs.2016.06.006openalex-snapshot

A quantitative performance study for Stokes solvers at the extreme scale

inferred← citeshttps://doi.org/10.1017/s0962492914000038openalex-snapshot

Communication lower bounds and optimal algorithms for numerical linear algebra

inferred← citeshttps://doi.org/10.1080/13647830.2022.2142673openalex-snapshot

PeleLM-FDF large eddy simulator of turbulent reacting flows

inferred← citeshttps://doi.org/10.1109/ipdpsw.2018.00170openalex-snapshot

Algebraic Multigrid Solver Using Coarse Grid Aggregation with Independent Aggregation

inferred← citeshttps://doi.org/10.1109/sc.2016.67openalex-snapshot

Accelerating Lattice QCD Multigrid on GPUs Using Fine-Grained Parallelization

inferred← citeshttps://doi.org/10.1145/3539781.3539785openalex-snapshot

Reducing communication in the conjugate gradient method

inferred← citeshttps://doi.org/10.1145/3712031.3712034openalex-snapshot

Scalable Dual Coordinate Descent for Kernel Methods

inferred← citeshttps://doi.org/10.1145/3721145.3725764openalex-snapshot

CRAMG: A Communication-Reduced Algebraic Multigrid Method

inferred← citeshttps://doi.org/10.15748/jasse.7.117openalex-snapshot

Parallel 3d shape optimization for cellular composites on large distributed-memory clusters

inferred← citeshttps://doi.org/10.21136/am.2020.0136-19openalex-snapshot

An adaptive $s$-step conjugate gradient algorithm with dynamic basis updating

inferred← citeshttps://doi.org/10.21236/ada624905openalex-snapshot

Avoiding Communication in the Lanczos Bidiagonalization Routine and Associated Least Squares QR Solver

inferred← citeshttps://doi.org/10.23919/aces48530.2019.9060447openalex-snapshot

Parallel SDDM with Communication-Avoiding BICGSTAB for Large-Scale 3D Scattering Problems

inferred← citeshttps://doi.org/10.26599/tst.2019.9010057openalex-snapshot

Helmholtz solving and performance optimization in global/regional assimilation and prediction system

inferred← citeshttps://doi.org/10.48550/arxiv.1701.03989openalex-snapshot

The Adaptive $s$-step Conjugate Gradient Method

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.