Two algorithms for a class of elliptic problems in shape optimization (Q1665068): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2015/241837 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1598445266 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59117708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology optimization of steady Navier-Stokes flow with body force / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-material level set-based topology and shape optimization method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural topology and shape optimization using a level set method with distance-suppression scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3960544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000354 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural optimization using sensitivity analysis and a level-set method. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Variational Binary Level Set Method for Structural Topology Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural topology optimization with design-dependent pressure loads / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology optimization with pressure load through a level set method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A level set method for shape and topology optimization of both structure and support of continuum structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Level set methods and dynamic implicit surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Level set methods: An overview and some recent results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy \(T\)-colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy algorithm for maximizing a linear objective function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characteristic centred finite difference method for a 2D air pollution model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Level set method with topological derivatives in shape optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5696763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Duality Approach for the Boundary Variation of Neumann Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:43, 16 July 2024

scientific article
Language Label Description Also known as
English
Two algorithms for a class of elliptic problems in shape optimization
scientific article

    Statements

    Two algorithms for a class of elliptic problems in shape optimization (English)
    0 references
    0 references
    0 references
    0 references
    27 August 2018
    0 references
    Summary: We propose two algorithms for elliptic boundary value problems in shape optimization. With the finite element method, the optimization problem is replaced by a discrete variational problem. We give rules and use them to decide which elements are to be reserved. Those rules are determined by the optimization; as a result, we get the optimal design in shape. Numerical examples are provided to show the effectiveness of our algorithms.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references