Efficient iterative solvers for elliptic finite element problems on nonmatching grids

DOI10.1515/rnam.1995.10.3.187zbMath0839.65031OpenAlexW2092753238MaRDI QIDQ4859633

Yuri A. Kuznetsov

Publication date: 7 January 1996

Published in: Russian Journal of Numerical Analysis and Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/rnam.1995.10.3.187

zbMATH Keywords

Lagrange multipliersdomain decompositionLanczos methodconjugate gradient methoditerative methodspreconditionerselliptic problemsmixed problemarithmetical complexitymortar finite element methodmethod of minimal iterationssaddlepoint problem

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Complexity and performance of numerical algorithms (65Y20)

Related Items

Nonoverlapping domain decomposition methods with a simple coarse space for elliptic problems ⋮ Block steepest descent method based on nonoverlapping domain decomposition. I ⋮ Fast solvers for optimal control problems from pattern formation ⋮ A conforming finite element method for overlapping and nonmatching grids ⋮ Block preconditioners for linear systems arising from multiscale collocation with compactly supported RBFs ⋮ Preconditioned iterative methods for Navier-Stokes control problems ⋮ Preconditioned iterative methods for algebraic saddle-point problems ⋮ Preconditioning for diffusion problem with small size high resolution inclusions ⋮ A regularized domain decomposition method with Lagrange multiplier ⋮ Unnamed Item ⋮ Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization ⋮ Guaranteed lower bounds for cost functionals of time-periodic parabolic optimization problems ⋮ Preconditioners for Krylov subspace methods: An overview ⋮ A Robust Preconditioner for High-Contrast Problems (Research) ⋮ Discontinuous Galerkin and mimetic finite difference methods for coupled Stokes-Darcy flows on polygonal and polyhedral grids ⋮ Preconditioning for Allen-Cahn variational inequalities with non-local constraints ⋮ trlib: a vector-free implementation of the GLTR method for iterative solution of the trust region problem ⋮ Low rank updates in preconditioning the saddle point systems arising from data assimilation problems ⋮ Refined saddle-point preconditioners for discretized Stokes problems ⋮ Efficient Solvers for Saddle Point Problems with Applications to PDE–Constrained Optimization ⋮ Fast iterative solvers for an optimal transport problem ⋮ Numerical integrations and unit resolution multipliers for domain decomposition methods with nonmatching grids ⋮ Preconditioners for domain decomposition methods ⋮ Using partial spectral information for block diagonal preconditioning of saddle-point systems ⋮ Numerical Study of Two Sparse AMG-methods ⋮ A moving mesh fictitious domain approach for shape optimization problems ⋮ Fast iterative solvers for large matrix systems arising from time-dependent Stokes control problems ⋮ Natural Preconditioning and Iterative Methods for Saddle Point Systems ⋮ Multilevel preconditioning for the boundary concentrated \(hp\)-FEM ⋮ Distributed Lagrange multipliers based on fictitious domain method for second order elliptic problems ⋮ A new approximation of the Schur complement in preconditioners for PDE-constrained optimization ⋮ Preconditioners and Tensor Product Solvers for Optimal Control Problems from Chemotaxis ⋮ Block preconditioners for linear systems in interior point methods for convex constrained optimization ⋮ A domain decomposition method for domains with holes using a complementary decomposition