Name
Title | ||
|---|---|---|
A scalable FETI-DP algorithm with non-penetration mortar conditions on contact interface |
Abstract | ||
|---|---|---|
By combining FETI algorithms of dual-primal type with recent results for bound constrained quadratic programming problems, we develop an optimal algorithm for the numerical solution of coercive variational inequalities. The model problem is discretized using non-penetration conditions of mortar type across the potential contact interface, and a FETI-DP algorithm is formulated. The resulting quadratic programming problem with bound constraints is solved by a scalable algorithm with a known rate of convergence given in terms of the spectral condition number of the quadratic problem. Numerical experiments for non-matching meshes across the contact interface confirm the theoretical scalability of the algorithm. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.cam.2009.04.017 | J. Computational Applied Mathematics |
Keywords | Field | DocType |
mortar flnite elements,model problem,non-penetration mortar condition,quadratic programming problem,feti algorithm,modifled proportioning algorithms,dual-primal type,mortar type,scalable feti-dp algorithm,feti-dp algorithm,coercive variational inequalities,contact interface,scalable algorithm,optimal algorithm,quadratic problem,bound constraint,feti{dp algorithms,rate of convergence,variational inequality,quadratic program,condition number | FETI,FETI-DP,Mathematical optimization,Condition number,Algorithm,Quadratic equation,Rate of convergence,Quadratic programming,Numerical analysis,Mathematics,Variational inequality | Journal |
Volume | Issue | ISSN |
231 | 2 | 0377-0427 |
Citations | PageRank | References |
2 | 0.39 | 19 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zdenk Dostál | 1 | 2 | 1.07 |
| David Horák | 2 | 35 | 6.79 |
| Dan Stefanica | 3 | 11 | 1.93 |