Efficient iterative solvers for elliptic finite element problems on nonmatching grids

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

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 multipliers; domain decomposition; Lanczos method; conjugate gradient method; iterative methods; preconditioners; elliptic problems; mixed problem; arithmetical complexity; mortar finite element method; method of minimal iterations; saddlepoint problem

Mathematics Subject Classification ID

65N55: Multigrid methods; domain decomposition for boundary value problems involving PDEs

35J25: Boundary value problems for second-order elliptic equations

65N30: Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs

65F10: Iterative numerical methods for linear systems

65F35: Numerical computation of matrix norms, conditioning, scaling

65Y20: Complexity and performance of numerical algorithms

Related Items

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