Papers › An iterative method for elliptic problems with rapidly oscillating coefficients
An iterative method for elliptic problems with rapidly oscillating coefficients
S. Armstrong, A. Hannukainen, T. Kuusi, J. -C. Mourrat
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address different length scales. However, we use here the homogenized equation on all scales larger than a fixed multiple of the scale of oscillation of the coefficients. While the performance of standard multigrid methods degrades rapidly under the regime of large scale separation that we consider here, we show an explicit estimate on the contraction factor of our method which is independent of the size of the domain. We also present numerical experiments which confirm the effectiveness of the method, with openly available source code.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections