A consistency analysis of a class of concurrent transient implicit/explicit algorithms
type: Item
instance of: scholarly article
title: A consistency analysis of a class of concurrent transient implicit/explicit algorithms
zbMATH Open document ID: 0726.73069
DOI: 10.1016/0045-7825(90)90114-2
author: C. Farhat
author: Nahil Atef Sobh
published in: Computer Methods in Applied Mechanics and Engineering
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 74S05
Mathematics Subject Classification ID: 65N30
zbMATH DE Number: 4199765
zbMATH Keywords: unconditionally stable concurrent time-stepping algorithms
zbMATH Keywords: implicit integration
zbMATH Keywords: response within subdomains
zbMATH Keywords: explicit averaging rule
zbMATH Keywords: response at the interface between subdomains
zbMATH Keywords: factorization
MaRDI profile type: Publication
full work available at URL: 0045-7825(90)90114-2
OpenAlex ID: W2013673933
cites work: Unconditionally stable concurrent procedures for transient finite element analysis
cites work: Accuracy of a class of concurrent algorithms for transient finite element analysis
cites work: An analysis of an unconditionally stable explicit method
cites work: On the accuracy of some domain-by-domain algorithms for parallel processing of transient structural dynamics
cites work: Q5536978
cites work: A Pre´cis of Developments in Computational Methods for Transient Analysis
cites work: An element-by-element solution algorithm for problems of structural and solid mechanics
cites work: Unconditionally stable element-by-element algorithms for dynamic problems
cites work: A general approach to nonlinear FE compuations on shared-memory multiprocessors
cites work: DYNAMIC FINITE ELEMENT SIMULATIONS ON THE CONNECTION MACHINE
Recommended article: Q4411946
Recommended article: Concurrency Based Transition Refinement for the Verification of Distributed Algorithms
Recommended article: Distributed Computing
Recommended article: Interprocedural Analysis of Concurrent Programs Under a Context Bound
Recommended article: Elucidating concurrent algorithms via layers of abstraction and reification
Recommended article: On the complexity of verifying concurrent transition systems
Recommended article: A generic approach to the static analysis of concurrent programs with procedures
Recommended article: A Generic Approach to the Static Analysis of Concurrent Programs with Procedures
description: scientific article; zbMATH DE number 4199765