Learned multigrid components are often evaluated at a fixed iteration budget, but such comparisons do not distinguish local approximation gains from practical solver efficiency. We study this distinction for high-contrast elliptic problems on unstructured finite element meshes. A learned V-cycle uses operator-dependent transfers, Galerkin coarse operators, near-kernel deflation and an energy-norm safeguard; only its smoothers are trained. The architecture represents a specified class of fixed polynomial smoothers and is positively homogeneous in the load. On fresh conductive-channel problems, one learned pass reduces the energy error by factors of 5.7-6.1 relative to the same cycle with four-step Jacobi-preconditioned conjugate-gradient smoothing; the corresponding factors are 1.38-1.45 for insulating barriers. In a separate fixed-input test on channel problems, the fine-level learned smoother attains a smaller energy-norm error than the exact minimum over a five-dimensional Krylov space of its own input on 97-100 of 100 fresh inputs for each position and training initialization; this does not establish superiority over all polynomial-smoothed cycles. When the classical smoothing budget is increased, the paired geometric-mean accuracy crosses that of the learned cycle between 8 and 14 steps per smoothing call on channels and between 5 and 8 on barriers. The measured CPU implementation offers no computational advantage over the tested classical solvers, and load changes and floating islands further restrict its accuracy.
Efficient two-grid solvers for high-contrast parametric elliptic problems require coarse spaces that capture error components poorly reduced by local smoothing. As these components vary with the problem parameters, repeatedly constructing parameter-adaptive coarse spaces can be computationally expensive. We propose a c...
We consider the joint recovery of the state and diffusion coefficient in a high-contrast elliptic equation from sparse, noisy state measurements. We seek the coefficient in a parameterized family defined relative to a prescribed reference coefficient. We construct a generalized multiscale finite element basis from the...
Nearly incompressible elasticity is often discretized by mixed methods to avoid locking, but the resulting saddle-point systems can be expensive to solve. We consider a weakly symmetric multipoint stress discretization whose stress and rotation unknowns can be eliminated independently over vertex interaction regions, l...
Learning solution operators for partial differential equations (PDEs) requires models that can represent spatial structure across grids and scales. This becomes especially important in time-dependent problems, where the learned operator is often used autoregressively: each predicted state is fed back as input to predic...
The robustness of two-level overlapping additive Schwarz (OAS) preconditioners for highly heterogeneous elliptic problems hinges on the choice of the coarse space. We propose an algebraic multiscale (AM) coarse space built from the system matrix alone through an algebraic formulation of the multiscale finite element me...
Filipe Cumaru, H. Hajibeygi, C. Vuik et al.· 0 citations
Low-order refined (LOR) preconditioning replaces a high-order operator with a low-order discretisation on a refined nodal mesh. For tensor-product elements, the two operators are spectrally equivalent with bounds independent of the polynomial order $P$, but the construction does not extend directly to simplex and mixed...
P. Khurana, H. Wüstenberg, D. Moxey et al.· arXiv.org· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.