An inverse geometric problem: position and shape identification of inclusions in a conductor domain (Q2450989): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.enganabound.2013.07.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084567397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inverse geometry problem for the localisation of skin tumours by thermal analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principal component analysis and artificial neural network approach to electrical impedance tomography problems approximated by multi-region boundary element method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3882253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization algorithms for identification inverse problems with the boundary element method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Electrical Impedance Tomography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4868581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4148902 / rank
 
Normal rank

Latest revision as of 12:49, 8 July 2024

scientific article
Language Label Description Also known as
English
An inverse geometric problem: position and shape identification of inclusions in a conductor domain
scientific article

    Statements

    An inverse geometric problem: position and shape identification of inclusions in a conductor domain (English)
    0 references
    0 references
    0 references
    26 May 2014
    0 references
    inverse problems
    0 references
    boundary elements
    0 references
    optimization algorithms
    0 references
    sensitivity equations
    0 references

    Identifiers