2009
DOI: 10.1007/s00607-009-0044-9
|View full text |Cite
|
Sign up to set email alerts
|

Scalable Total BETI based algorithm for 3D coercive contact problems of linear elastostatics

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2012
2012
2015
2015

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 13 publications
(3 citation statements)
references
References 40 publications
0
3
0
Order By: Relevance
“…b Boundary element mesh details around the portential contact zone solved using the same iterative techniques. To the best of the authors' knowledge, in spite of the BETI algorithm has been successfully extended to contact problems using SGBEM formulation [50,51], its application using a non-symmetrical boundary element formulation has not been completed. The extension of BETI technique to non-symmetrical boundary element formulations has only been only considered in domain decomposition elastic problems by González et al [52], but its extension to frictional contact problems is not straightforward.…”
Section: ψ (Z) ≤ ε Being ψ (Z) = H T (Z)h(z)/2)mentioning
confidence: 96%
“…b Boundary element mesh details around the portential contact zone solved using the same iterative techniques. To the best of the authors' knowledge, in spite of the BETI algorithm has been successfully extended to contact problems using SGBEM formulation [50,51], its application using a non-symmetrical boundary element formulation has not been completed. The extension of BETI technique to non-symmetrical boundary element formulations has only been only considered in domain decomposition elastic problems by González et al [52], but its extension to frictional contact problems is not straightforward.…”
Section: ψ (Z) ≤ ε Being ψ (Z) = H T (Z)h(z)/2)mentioning
confidence: 96%
“…These algorithms have elements of the conjugate gradient method and modifications of active set methods (and possibly of augmented Lagrangian methods as well) and possess the property that the number of iterations needed to find the approximate solution is uniformly bounded provided that the spectrum of the Hessian matrix of the cost function is confined to a given positive interval. Numerical results on asymptotically linear complexity of these algorithms can be found, for instance, in [13] (for two-dimensional scalar variational inequality) and [3,14] (for three-dimensional elasticity). Convergence rates of these nonlinear algorithms, applied in conjunction with the FETI methods, have been bounded in terms of C(H/h) or C(H/h) 2 (see, for instance, [15,12] and the references therein), where C is a constant independent of H and h.…”
Section: Introductionmentioning
confidence: 99%
“…The BETI algorithm has been successfully extended to the case of infinite subdomains and contact problems . But implementation of SGBEM, principal ingredient of BETI, is not straightforward, and if it is replaced by a non‐symmetrical BEM formulation to approximate the Steklov–Poincaré operators of the floating substructures, the obtained flexibility equations become non‐symmetric, and different solution strategies should be followed.…”
Section: Introductionmentioning
confidence: 99%