Name
Abstract | ||
|---|---|---|
The FETI method with the natural coarse grid is combined with the penalty method to develop an efficient solver for elliptic variational inequalities. A proof is given that a prescribed bound on the norm of feasibility of solution may be achieved with a value of the penalty parameter that does not depend on the discretization parameter and that an approximate solution with the prescribed bound on violation of the Karush-Kuhn-Tucker conditions may be found in a number of steps that does not depend on the discretization parameter. Results of numerical experiments with parallel solution of a model problem discretized by up to more than eight million of nodal variables are in agreement with the theory and demonstrate numerically both optimality of the penalty and scalability of the algorithm presented. Copyright (C) 2004 John Wiley Sons, Ltd. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1002/nla.355 | NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS |
Keywords | Field | DocType |
penalty,domain decomposition,variational inequality,scalable algorithms,parallel programming | FETI,Discretization,Mathematical optimization,Solver,Grid,Mathematics,Domain decomposition methods,Penalty method,Scalability,Variational inequality | Journal |
Volume | Issue | ISSN |
11 | 5-6 | 1070-5325 |
Citations | PageRank | References |
5 | 0.75 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zdeněk Dostál | 1 | 92 | 10.72 |
| David Horák | 2 | 35 | 6.79 |