Composition Scheme

Kang Feng and Mengzhao Qin ()
Additional contact information
Kang Feng: Institute of Computational Mathematics and Scientific/Engineering Computing
Mengzhao Qin: Institute of Computational Mathematics and Scientific/Engineering Computing

Chapter Chapter 8 in Symplectic Geometric Algorithms for Hamiltonian Systems, 2010, pp 365-406 from Springer

Abstract: Abstract In this chapter, we consider a class of reversible schemes also called symmetrical schemes. In algebraic language, it is not other, just like self-adjoint schemes. Here, we only deal with one-step reversible schemes. We will introduce the concept of adjoint methods and some of their properties. We will show that there is a self-adjoint scheme of even order in every method. Using the self-adjoint schemes with lower order, we can construct higher order schemes by “composing” a method, and this constructing process can be continued to obtain arbitrary even order schemes. The composing method presented here can be used to in both non-symplectic and symplectic schemes.

Keywords: Hamiltonian System; Order Scheme; Adjoint Method; High Order Scheme; Symplectic Integrator (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-01777-3_9

Ordering information: This item can be ordered from
http://www.springer.com/9783642017773

DOI: 10.1007/978-3-642-01777-3_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().