Conditioning of linear systems arising from penalty methods
From MaRDI portal
Abstract: Penalizing incompressibility in the Stokes problem leads, under mild assumptions, to matrices with condition numbers , penalty parameter , and mesh width . Although is large, practical tests seldom report difficulty in solving these systems. In the SPD case, using the conjugate gradient method, this is usually explained by spectral gaps occurring in the penalized coefficient matrix. Herein we point out a second contributing factor. Since the solution is approximately incompressible, solution components in the eigenspaces associated with the penalty terms can be small. As a result, the effective condition number can be much smaller than the standard condition number.
Recommendations
- The conditioning of the stiffness matrix for certain elements approximating the incompressibility condition in fluid dynamics
- Numerical approximation of incompressible flows with net flux defective boundary conditions by means of penalty techniques
- Analysis of the iterative penalty method for the Stokes equations
- A penalty algorithm for the spectral element discretization of the Stokes problem
- Two-level penalty method for the steady incompressible Stokes equations
Cites work
- Condition numbers of rectangular systems and bounds for generalized inverses
- Effective condition number for numerical partial differential equations.
- Effectively Well-Conditioned Linear Systems
- Error Estimates for the Solution of Linear Systems
- Error norm estimation and stopping criteria in preconditioned conjugate gradient iterations
- scientific article; zbMATH DE number 1024452 (Why is no real title available?)
- Iterative Solution Methods
- New convergence results and preconditioning strategies for the conjugate gradient method
- Numerical inverting of matrices of high order
- On adaptive grad-div parameter selection
- On Mesh Geometry and Stiffness Matrix Conditioning for General Finite Element Spaces
- On the divergence constraint in mixed finite element methods for incompressible flows
- On the sublinear and superlinear rate of convergence of conjugate gradient methods
- Penalty approximation of Stokes flow
- ROUNDING-OFF ERRORS IN MATRIX PROCESSES
- Smooth analysis of the condition number and the least singular value
- Superconvergence and stability for boundary penalty techniques of finite difference methods
- The effective condition number applied to error analysis of certain boundary collocation methods
- The finite element methods for elliptic problems.
- The Lack of Influence of the Right-Hand Side on the Accuracy of Linear System Solution
- The Mathematical Theory of Finite Element Methods
Cited in
(7)- A penalty continuation method for the _ solution of overdetermined linear systems
- Regarding a method of improving the conditionality of a system of linear equations
- Fast and accurate artificial compressibility ensemble algorithms for computing parameterized Stokes-Darcy flow ensembles
- Sufficient conditions for penalty formulation methods in analytical dynamics
- Numerical analysis of penalty-based ensemble methods
- A review on some discrete variational techniques for the approximation of essential boundary conditions
- A hybrid regularization for the Navier-Stokes equations
This page was built for publication: Conditioning of linear systems arising from penalty methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6105418)