A linear \(\theta\) time-marching algorithm in 3D BEM formulation for elastodynamics (Q1568434): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4240961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250513 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0955-7997(99)00026-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034520999 / rank
 
Normal rank

Latest revision as of 09:24, 30 July 2024

scientific article
Language Label Description Also known as
English
A linear \(\theta\) time-marching algorithm in 3D BEM formulation for elastodynamics
scientific article

    Statements

    A linear \(\theta\) time-marching algorithm in 3D BEM formulation for elastodynamics (English)
    0 references
    0 references
    0 references
    0 references
    21 June 2000
    0 references
    A time-marching procedure similar to the well-known Wilson theta-method is used in order to carry out three-dimensional time-domain analyses by the boundary element method. The scheme can improve substantially the stability of traction time responses for both bounded and unbounded domains. Linear time interpolation functions for displacements and tractions are employed. The authors discuss computational aspects of this time-domain BEM algorithm, and verify the stability of the method by numerical experiments.
    0 references
    traction time response
    0 references
    linear time interpolation
    0 references
    time-marching procedure
    0 references
    Wilson theta-method
    0 references
    three-dimensional time-domain analyses
    0 references
    boundary element method
    0 references
    stability
    0 references
    0 references
    0 references
    0 references

    Identifiers