1991
DOI: 10.1016/0956-0521(91)90022-w
|View full text |Cite
|
Sign up to set email alerts
|

An unconditionally stable parallel transient algorithm with multi-step independent subdomain computation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1993
1993
2006
2006

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…Computational effort to compute the matrices Q and Z and to solve the sets of equations in (9) can be more than that of direct numerical integration of the system ( 1 ). With the advent of fast computers, the system (1) can be solved efficiently and accurately by direct numerical integration, and in particular by parallel integration algorithms when the system is large scale (see, e.g., Bennighof and Wu (1991), Harichandaran and Ye (1993), Shieh (19933, and the references therein).…”
Section: A=mentioning
confidence: 99%
“…Computational effort to compute the matrices Q and Z and to solve the sets of equations in (9) can be more than that of direct numerical integration of the system ( 1 ). With the advent of fast computers, the system (1) can be solved efficiently and accurately by direct numerical integration, and in particular by parallel integration algorithms when the system is large scale (see, e.g., Bennighof and Wu (1991), Harichandaran and Ye (1993), Shieh (19933, and the references therein).…”
Section: A=mentioning
confidence: 99%