A Preconditioning Technique for Indefinite Systems Resulting from Mixed Approximations of Elliptic Problems
DOI10.2307/2007912zbMath0643.65017OpenAlexW4234517215MaRDI QIDQ3785817
James H. Bramble, Joseph E. Pasciak
Publication date: 1988
Full work available at URL: https://doi.org/10.2307/2007912
Lagrange multipliernumerical experimentspreconditioningStokes equationsaddle point problemmixed methodsconjugate gradient iterationequations of elasticitysymmetric positive definite system
Classical linear elasticity (74B05) Stokes and related (Oseen, etc.) flows (76D07) 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) Variational methods for second-order elliptic equations (35J20)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite element approximation of the Navier-Stokes equations
- A boundary parametric approximation to the linearized scalar potential magnetostatic field problem
- Éléments finis mixtes incompressibles pour l'équation de Stokes dans \(R^ 3\).
- Iterative methods for the solution of a linear operator equation in Hilbert space. A survey
- The finite element method with Lagrangian multipliers
- An Iterative Method for Elliptic Problems on Regions Partitioned into Substructures
- The Construction of Preconditioners for Elliptic Problems by Substructuring. II
- The Lagrange Multiplier Method for Dirichlet's Problem
- Analysis of Some Mixed Finite Element Methods Related to Reduced Integration
- Yale sparse matrix package I: The symmetric codes
- An Analysis of the Finite Element Method Using Lagrange Multipliers for the Stationary Stokes Equations
- The Methods of Cyclic Reduction, Fourier Analysis and the FACR Algorithm for the Discrete Solution of Poisson’s Equation on a Rectangle
- The Construction of Preconditioners for Elliptic Problems by Substructuring. I