Searching for local contact constraints in isogeometric contact analysis

Abstract eng:
In this paper, the performance of local searching procedure was tested in proposed isogeometric contact algorithm. Recent study on the assessment of various unconstrained optimization methods for computing the closest point projection in local contact search was followed up and extended to problems discretized by spline representation (Bezier, B-spline, NURBS, etc.). It was shown that the sphere and the torus approximation methods significantly increase the robustness of the local contact search procedure in isogeometric contact algorithm.

• Export as: BibTeX | MARC | MARCXML | DC | EndNote | NLM | RefWorks
• Add to your basket