2005
DOI: 10.1016/j.apnum.2004.09.003
|View full text |Cite
|
Sign up to set email alerts
|

Runge–Kutta–Nyström methods with maximized stability domain in structural dynamics

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
5
0

Year Published

2008
2008
2015
2015

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 9 publications
0
5
0
Order By: Relevance
“…A seventh-order explicit symplectic Nyström algorithm was obtained by Calvo and Sanz-Serna (1993). Some optimized symplectic Nyström algorithms have also been developed (Blanes and Moan 2002;Lunk and Simen 2005). Some optimized symplectic Nyström algorithms have also been developed (Blanes and Moan 2002;Lunk and Simen 2005).…”
Section: Nyström Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…A seventh-order explicit symplectic Nyström algorithm was obtained by Calvo and Sanz-Serna (1993). Some optimized symplectic Nyström algorithms have also been developed (Blanes and Moan 2002;Lunk and Simen 2005). Some optimized symplectic Nyström algorithms have also been developed (Blanes and Moan 2002;Lunk and Simen 2005).…”
Section: Nyström Methodsmentioning
confidence: 99%
“…Tsitouras (1999) developed a tenthorder explicit symplectic Nyström algorithm. Some optimized symplectic Nyström algorithms have also been developed (Blanes and Moan 2002;Lunk and Simen 2005).…”
Section: Nyström Methodsmentioning
confidence: 99%
“…Theoretically, a numerical method for Hamiltonian dynamical systems can be called a symplectic algorithm if the resulting numerical solution is also a symplectic mapping. Some symplectic algorithms for partial differential equations have been developed and used, such as Lax–Wendroff methods (Lax & Wendroff 1960; Carcione et al 2002) and Nyström methods (Qin & Zhu 1991; Okunbor & Skeel 1992; Calvo & Sanz‐Serna 1993; Hairer et al 1993; Tsitouras 1999; Blanes & Moan 2002; Lunk & Simen 2005). Chen (2009) discussed the structure‐preserving property of Lax–Wendroff and Nyström methods in detail.…”
Section: Introductionmentioning
confidence: 99%
“…A numerical algorithm for Hamiltonian dynamical systems can be termed a symplectic scheme if the resulting solution is also a symplectic mapping. Some symplectic schemes for partial differential equations have been proposed and applied, such as Lax-Wendroff algorithms [1,2] and Nyström algorithms [3][4][5][6][7][8][9]. Chen [10] minutely discussed the structure-preserving property of these algorithms.…”
Section: Introductionmentioning
confidence: 99%