book chapter · Springer eBooks · 2010

KAM Theorem of Symplectic Algorithms

Cited by 0Abstract and details only

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

Feng, K., & Qin, M. (2010). KAM Theorem of Symplectic Algorithms. Springer eBooks, 549–580. https://doi.org/10.1007/978-3-642-01777-3_14

MLA 9

Feng, Kang, and Mengzhao Qin. “KAM Theorem of Symplectic Algorithms.” Springer eBooks, 2010, pp. 549–80, https://doi.org/10.1007/978-3-642-01777-3_14.

Chicago

Feng, Kang, and Mengzhao Qin. 2010. “KAM Theorem of Symplectic Algorithms.” Springer eBooks: 549–80. https://doi.org/10.1007/978-3-642-01777-3_14.

Harvard

Feng, K. and Qin, M. (2010) ‘KAM Theorem of Symplectic Algorithms’, Springer eBooks, pp. 549–580. Available at: https://doi.org/10.1007/978-3-642-01777-3_14.

BibTeX

@incollection{feng2010theorem,
  title = {{KAM Theorem of Symplectic Algorithms}},
  author = {Feng, Kang and Qin, Mengzhao},
  booktitle = {Springer eBooks},
  pages = {549--580},
  year = {2010},
  doi = {10.1007/978-3-642-01777-3_14}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

KAM Theorem of Symplectic Algorithms

Abstract

Cite this paper

A KAM theorem of symplectic algorithms for nearly integrabel Hamiltonian systems

Does symplectic geometry yield useful numerical tricks

A survey on symplectic and multi-symplectic algorithms

Symplectic Runge-Kutta and related methods: recent results

Some aspects of Hamiltonian systems and symplectic algorithms