The boundary element-linear complementarity method for the Signorini problem (Q444800): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Jia-Lin Zhu / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 74M15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C33 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65N38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65K05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6071153 / rank
 
Normal rank
Property / zbMATH Keywords
 
Signorini problem
Property / zbMATH Keywords: Signorini problem / rank
 
Normal rank
Property / zbMATH Keywords
 
boundary integral equation
Property / zbMATH Keywords: boundary integral equation / rank
 
Normal rank
Property / zbMATH Keywords
 
linear complementarity problem
Property / zbMATH Keywords: linear complementarity problem / rank
 
Normal rank
Property / zbMATH Keywords
 
projected successive over-relaxation algorithm
Property / zbMATH Keywords: projected successive over-relaxation algorithm / rank
 
Normal rank

Revision as of 01:53, 30 June 2023

scientific article
Language Label Description Also known as
English
The boundary element-linear complementarity method for the Signorini problem
scientific article

    Statements

    The boundary element-linear complementarity method for the Signorini problem (English)
    0 references
    0 references
    0 references
    0 references
    24 August 2012
    0 references
    Signorini problem
    0 references
    boundary integral equation
    0 references
    linear complementarity problem
    0 references
    projected successive over-relaxation algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references