Derives an explicit stability criterion for parquet fixed-point iterations showing convergence issues arise independently of vertex divergences and demonstrates a controlled stabilization method that reaches the physical solution across multiple divergence lines.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Asynchronous execution yields 2.9x-16.9x speedups across Jacobi, value iteration, and SCF methods; Anderson acceleration succeeds only under evaluation-level perturbation, not iterate-level corruption.
citing papers explorer
-
Stabilizing the parquet problem
Derives an explicit stability criterion for parquet fixed-point iterations showing convergence issues arise independently of vertex divergences and demonstrates a controlled stabilization method that reaches the physical solution across multiple divergence lines.
-
Fault Tolerance of Accelerated Asynchronous Fixed-Point Iterations on Flexible Computing Infrastructure
Asynchronous execution yields 2.9x-16.9x speedups across Jacobi, value iteration, and SCF methods; Anderson acceleration succeeds only under evaluation-level perturbation, not iterate-level corruption.