Efficient iterative solvers for elliptic finite element problems on nonmatching grids
DOI10.1515/RNAM.1995.10.3.187zbMATH Open0839.65031OpenAlexW2092753238MaRDI QIDQ4859633FDOQ4859633
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
Recommendations
- On preconditioners for mortar discretization of elliptic problems
- scientific article; zbMATH DE number 1827883
- A hierarchical preconditioner for the mortar finite element method
- Multigrid on the interface for mortar mixed finite element methods for elliptic problems
- Iterative Substructuring Preconditioners for Mortar Element Methods in Two Dimensions
Lagrange multipliersdomain decompositioniterative methodsconjugate gradient methodpreconditionersLanczos methodelliptic problemsmixed problemarithmetical complexitymortar finite element methodmethod of minimal iterationssaddlepoint problem
Complexity and performance of numerical algorithms (65Y20) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Cited In (42)
- Numerical Study of Two Sparse AMG-methods
- A conforming finite element method for overlapping and nonmatching grids
- Block preconditioners for linear systems in interior point methods for convex constrained optimization
- A Dirichlet-Neumann algorithm for mortar saddle point problems
- Natural preconditioning and iterative methods for saddle point systems
- Discontinuous Galerkin and mimetic finite difference methods for coupled Stokes-Darcy flows on polygonal and polyhedral grids
- Nonoverlapping domain decomposition methods with a simple coarse space for elliptic problems
- Distributed Lagrange multipliers based on fictitious domain method for second order elliptic problems
- Fast solution of incompressible flow problems with two-level pressure approximation
- Title not available (Why is that?)
- Block steepest descent method based on nonoverlapping domain decomposition. I
- Preconditioned iterative methods for algebraic saddle-point problems
- Fast solvers for optimal control problems from pattern formation
- Fast iterative solvers for an optimal transport problem
- Title not available (Why is that?)
- Preconditioning of grid Lame equations in the nonconforming finite element method
- Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization
- Using partial spectral information for block diagonal preconditioning of saddle-point systems
- Title not available (Why is that?)
- Preconditioning for Allen-Cahn variational inequalities with non-local constraints
- A regularized domain decomposition method with Lagrange multiplier
- Fast iterative solvers for large matrix systems arising from time-dependent Stokes control problems
- Preconditioned iterative methods for Navier-Stokes control problems
- Refined saddle-point preconditioners for discretized Stokes problems
- Numerical integrations and unit resolution multipliers for domain decomposition methods with nonmatching grids
- trlib: a vector-free implementation of the GLTR method for iterative solution of the trust region problem
- Efficient Implementation of Finite Element Methods on Nonmatching and Overlapping Meshes in Three Dimensions
- Preconditioners for Krylov subspace methods: An overview
- Preconditioners for domain decomposition methods
- Efficient Solvers for Saddle Point Problems with Applications to PDE–Constrained Optimization
- Efficient solution of nonlinear elliptic problems using hierarchical matrices with Broyden updates
- Preconditioning for diffusion problem with small size high resolution inclusions
- Multilevel preconditioning for the boundary concentrated \(hp\)-FEM
- A new approximation of the Schur complement in preconditioners for PDE-constrained optimization.
- A moving mesh fictitious domain approach for shape optimization problems
- Title not available (Why is that?)
- Block preconditioners for linear systems arising from multiscale collocation with compactly supported RBFs
- A Robust Preconditioner for High-Contrast Problems (Research)
- Guaranteed lower bounds for cost functionals of time-periodic parabolic optimization problems
- Preconditioners and Tensor Product Solvers for Optimal Control Problems from Chemotaxis
- A domain decomposition method for domains with holes using a complementary decomposition
- Low rank updates in preconditioning the saddle point systems arising from data assimilation problems
This page was built for publication: Efficient iterative solvers for elliptic finite element problems on nonmatching grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4859633)
