A shape and topology optimization technique for solving a class of linear complementarity problems in function space (Q989848): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q115155180, #quickstatements; #temporary_batch_1721927112556
 
Property / Wikidata QID
 
Property / Wikidata QID: Q115155180 / rank
 
Normal rank

Latest revision as of 19:06, 25 July 2024

scientific article
Language Label Description Also known as
English
A shape and topology optimization technique for solving a class of linear complementarity problems in function space
scientific article

    Statements

    A shape and topology optimization technique for solving a class of linear complementarity problems in function space (English)
    0 references
    23 August 2010
    0 references
    Linear complementarity problems (LCPs) in function spaces arise in many practical applications ranging from engineering science to computational finance. In this paper, the authors consider a shape and topology optimization driven solution technique for a class of linear complementarity problems (LCPs) in function spaces. The main motivating application is given by obstacle problems. Based on the LCP together with its corresponding interface conditions on the boundary between the coincidence or active set and the inactive set, the original problem is reformulated as a shape optimization problem. The topological sensitivity of the new objective functional is used to estimate the ``topology'' of the active set. Then, for local correction purposes near the interface, a level set based shape sensitivity technique is employed. The authors present a TOPSHAPE algorithm (a combination of shape and topological sensitivity) and report on numerical results obtained by the TOPSHAPE algorithm. Numerical experiments indicate that only a very small number of topology optimization steps is necessary to obtain a good approximation of the active set at the solution. Moreover, the iterations based on topological sensitivity appear to be rather mesh independent. The combination of domain decomposition and topological sensitivity could be an interesting future direction.
    0 references
    0 references
    function space
    0 references
    level set method
    0 references
    linear complementarity problem
    0 references
    obstacle problem
    0 references
    shape and topology optimization
    0 references
    TOPSHAPE algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references