Interior penalty preconditioners for mixed finite element approximations of elliptic problems
DOI10.1090/S0025-5718-96-00720-XzbMath0857.65117OpenAlexW1973312823MaRDI QIDQ4878563
Panayot S. Vassilevski, Ragnar Winther, Torgeir Rusten
Publication date: 18 June 1996
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-96-00720-x
finite elementspreconditionerssecond-order elliptic probleminterior penalty methodoverlapping domain decomposition methods
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)
Related Items (25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two families of mixed finite elements for second order elliptic problems
- A class of iterative methods for solving saddle point problems
- Efficient rectangular mixed finite elements in two and three space variables
- A combined conjugate gradient - multi-grid algorithm for the numerical solution of the Stokes problem
- Finite Element Methods for Navier-Stokes Equations
- An Iterative Method for Elliptic Problems on Regions Partitioned into Substructures
- A Preconditioning Technique for Indefinite Systems Resulting from Mixed Approximations of Elliptic Problems
- The Convergence Factor of Preconditioned Algorithms of the Arrow–Hurwicz Type
- An Interior Penalty Finite Element Method with Discontinuous Elements
- A Black Box Generalized Conjugate Gradient Solver with Inner Iterations and Variable-Step Preconditioning
- Mixed and Hybrid Finite Element Methods
- A Preconditioned Iterative Method for Saddlepoint Problems
- Iterative Methods by Space Decomposition and Subspace Correction
- Solution of Sparse Indefinite Systems of Linear Equations
- Substructure Preconditioners for Elliptic Saddle Point Problems
- Fast Iterative Solution of Stabilised Stokes Systems Part II: Using General Block Preconditioners
- Inexact and Preconditioned Uzawa Algorithms for Saddle Point Problems
- Schwarz Analysis of Iterative Substructuring Algorithms for Elliptic Problems in Three Dimensions
- Analysis of the Inexact Uzawa Algorithm for Saddle Point Problems
- The Construction of Preconditioners for Elliptic Problems by Substructuring. I
- Iterative Methods for the Solution of Elliptic Problems on Regions Partitioned into Substructures
- Balancing Domain Decomposition for Mixed Finite Elements
- The Analysis of Multigrid Algorithms with Nonnested Spaces or Noninherited Quadratic Forms
This page was built for publication: Interior penalty preconditioners for mixed finite element approximations of elliptic problems