2003
DOI: 10.1016/s0168-874x(03)00056-8
|View full text |Cite
|
Sign up to set email alerts
|

On a novel design of a new unified variational framework of discontinuous/continuous time operators of high order and equivalence

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2004
2004
2017
2017

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(8 citation statements)
references
References 41 publications
0
8
0
Order By: Relevance
“…A variety of existing algorithms in the literature pertain to the Type 3 k q classification where it is computationally easy to implement, and to-date, are mostly being perceived and/or are considered as unique and/or unrelated; however, their novelty (if any) and/or associated relationships now can be clearly understood through their identical parent Type 2 k (p, q) algorithm. For example, time discontinuous integration operators are being considered as a unique class of time operators [50][51][52] although they pertain to the classification of the Type 3 k q , however, it has been shown that these time discontinuous integration operators have equivalence to the time continuous integration operators which also pertain to the same classification of the Type 3 k q since they both have the identical parent Type 2 k (p, q) algorithm [53,54]. It is to be noted that in the context of the Type 1 and Type 2 classification, the notion of time discontinuity is not meaningful.…”
Section: The Unified Theory Underlying Computational Algorithms For Tmentioning
confidence: 99%
“…A variety of existing algorithms in the literature pertain to the Type 3 k q classification where it is computationally easy to implement, and to-date, are mostly being perceived and/or are considered as unique and/or unrelated; however, their novelty (if any) and/or associated relationships now can be clearly understood through their identical parent Type 2 k (p, q) algorithm. For example, time discontinuous integration operators are being considered as a unique class of time operators [50][51][52] although they pertain to the classification of the Type 3 k q , however, it has been shown that these time discontinuous integration operators have equivalence to the time continuous integration operators which also pertain to the same classification of the Type 3 k q since they both have the identical parent Type 2 k (p, q) algorithm [53,54]. It is to be noted that in the context of the Type 1 and Type 2 classification, the notion of time discontinuity is not meaningful.…”
Section: The Unified Theory Underlying Computational Algorithms For Tmentioning
confidence: 99%
“…Below, we will shortly describe the second-and high-order implicit TCG methods derived in [32,35]. In the case of zero numerical dissipation, the high-order implicit TCG methods coincide with the known high-order accurate methods presented in [36][37][38] and correspond to the diagonal of the Padé approximation table. For these methods, we will derive an exact closed-form a priori global error estimator in time in Section 3.…”
Section: Second-and High-order Implicit Tcg Methodsmentioning
confidence: 98%
“…The choice of weighting function space and trial solution function space need not be the same, which leads to many different classes of algorithms (although the general convergence, stability, and error analyses associated with the time-discontinuous Galerkin approach cannot be used). Specific examples are given in Section 4.4; for a broader perspective, including a historical perspective see Bazzi and Anderheggen (1982), Hoff and Pahl (1988a,b), Kujawski and Desai (1984), Wood (1990), Sha (2000, 2001), Kanapady and Tamma (2003a), , Zhou and Tamma (2004), Fung (1999a,b), and Fung (2000).…”
Section: Weighted Residual Methods In Timementioning
confidence: 99%
“…The series of papers by Tamma and colleagues Sha 2000, 2001;Kanapady and Tamma, 2003a) aim at a general framework for the analysis and design of time integration algorithms. By starting from the most general weighted residual approach, they demonstrate that different choices for interpolations of the dynamic fields and different choices for the weighting functions can reproduce the existing one-step and LMS algorithms that have been published.…”
Section: Time Finite Element Algorithms and Other Formsmentioning
confidence: 99%