Multi-symplectic methods for membrane free vibration equation

In this paper, the multi-symplectic formulations of the membrane free vibration equation with periodic boundary conditions in Hamilton space are considered. The complex method is introduced and a semi-implicit twenty-seven-points scheme with certain discrete conservation laws-a multi-symplectic conservation law （CLS）, a local energy conservation law （ECL） as well as a local momentum conservation law （MCL） --is constructed to discrete the PDEs that are derived from the membrane free vibration equation. The results of the numerical experiments show that the multi-symplectic scheme has excellent long-time numerical behavior,

A Family of Inertial Manifolds for a Class of Asymmetrically Coupled Generalized Higher-Order Kirchhoff Equations

In this paper, we study the inertial manifolds for a class of asymmetrically coupled generalized Higher-order Kirchhoff equations. Under appropriate assumptions, we firstly exist Hadamard’s graph transformation method to structure a graph norm of a Lipschitz continuous function, then we prove the existence of a family of inertial manifolds by showing that the spectral gap condition is true.

Exploring geometry of genome space via Grassmann manifolds

It is important to understand the geometry of genome space in biology.After transforming genome sequences into frequency matrices of the chaos game representation(FCGR),we regard a genome sequence as a point in a suitable Grassmann manifold by analyzing the column space of the corresponding FCGR.To assess the sequence similarity,we employ the generalized Grassmannian distance,an intrinsic geometric distance that differs from the traditional Euclidean distance used in the classical k-mer frequency-based methods.With this method,we constructed phylogenetic trees for various genome datasets,including influenza A virus hemagglutinin gene,Orthocoronavirinae genome,and SARS-CoV-2 complete genome sequences.Our comparative analysis with multiple sequence alignment and alignment-free methods for large-scale sequences revealed that our method,which employs the subspace distance between the column spaces of different FCGRs(FCGR-SD),outperformed its competitors in terms of both speed and accuracy.In addition,we used low-dimensional visualization of the SARS-CoV-2 genome sequences and spike protein nucleotide sequences with our methods,resulting in some intriguing findings.We not only propose a novel and efficient algorithm for comparing genome sequences but also demonstrate that genome data have some intrinsic manifold structures,providing a new geometric perspective for molecular biology studies.

Preservation of Equilibria for Symplectic Methods Applied to Hamiltonian Systems

In this paper, the linear stability of symplectic methods for Hamiltonian systems is studied. In par- ticular, three classes of symplectic methods are considered： symplectic Runge-Kutta （SRK） methods, symplectic partitioned Runge-Kutta （SPRK） methods and the composition methods based on SRK or SPRK methods. It is shown that the SRK methods and their compositions preserve the ellipticity of equilibrium points uncondi- tionally, whereas the SPRK methods and their compositions have some restrictions on the time-step.

Inexact Proximal Point Methods for Quasiconvex Minimization on Hadamard Manifolds

In this paper we present two inexact proximal point algorithms to solve minimization problems for quasiconvex objective functions on Hadamard manifolds.We prove that under natural assumptions the sequence generated by the algorithms are well defined and converge to critical points of the problem.We also present an application of the method to demand theory in economy.

Proximal Methods with Bregman Distances to Solve VIP on Hadamard Manifolds with Null Sectional Curvature

We present an extension of the proximal point method with Bregman distances to solve variational inequality problems(VIP)on Hadamard manifolds with null sectional curvature.Under some natural assumptions,as for example,the existence of solutions of the VIP and the monotonicity of the multivalued vector field,we prove that the sequence of the iterates given by the method converges to a solution of the problem.Furthermore,this convergence is linear or superlinear with respect to the Bregman distance.

Multi-revolution low-thrust trajectory optimization using symplectic methods

Optimization of low-thrust trajectories that involve a larger number of orbit revolutions is considered as a challenging problem.This paper describes a high-precision symplectic method and optimization techniques to solve the minimum-energy low-thrust multi-revolution orbit transfer problem. First, the optimal orbit transfer problem is posed as a constrained nonlinear optimal control problem. Then, the constrained nonlinear optimal control problem is converted into an equivalent linear quadratic form near a reference solution. The reference solution is updated iteratively by solving a sequence of linear-quadratic optimal control sub-problems, until convergence. Each sub-problem is solved via a symplectic method in discrete form. To facilitate the convergence of the algorithm, the spacecraft dynamics are expressed via modified equinoctial elements. Interpolating the non-singular equinoctial orbital elements and the spacecraft mass between the initial point and end point is proven beneficial to accelerate the convergence process. Numerical examples reveal that the proposed method displays high accuracy and efficiency.

Convergence analysis of the formal energies of symplectic methods for Hamiltonian systems

Based on Feng's theory of formal vector fields and formal flows, we study the convergence problem of the formal energies of symplectic methods for Hamiltonian systems and give the clear growth of the coefficients in the formal energies. With the help of B-series and Bernoulli functions, we prove that in the formal energy of the mid-point rule, the coefficient sequence of the merging products of an arbitrarily given rooted tree and the bushy trees of height 1(whose subtrees are vertices), approaches 0 as the number of branches goes to ∞; in the opposite direction, the coefficient sequence of the bushy trees of height m(m ≥ 2), whose subtrees are all tall trees, approaches ∞ at large speed as the number of branches goes to +∞. The conclusion extends successfully to the modified differential equations of other Runge-Kutta methods. This disproves a conjecture given by Tang et al.(2002), and implies:(1) in the inequality of estimate given by Benettin and Giorgilli(1994) for the terms of the modified formal vector fields, the high order of the upper bound is reached in numerous cases;(2) the formal energies/formal vector fields are nonconvergent in general case.

Explicit Symplectic Methods for the Nonlinear Schrodinger Equation

By performing a particular spatial discretization to the nonlinear Schrodinger equation(NLSE),we obtain a non-integrable Hamiltonian system which can be decomposed into three integrable parts(L-L-N splitting).We integrate each part by calculating its phase flow,and develop explicit symplectic integrators of different orders for the original Hamiltonian by composing the phase flows.A 2nd-order reversible constructed symplectic scheme is employed to simulate solitons motion and invariants behavior of the NLSE.The simulation results are compared with a 3rd-order non-symplectic implicit Runge-Kutta method,and the convergence of the formal energy of this symplectic integrator is also verified.The numerical results indicate that the explicit symplectic scheme obtained via L-L-N splitting is an effective numerical tool for solving the NLSE.

Symmetric and symplectic methods for gyrocenter dynamics in time-independent magnetic fields

We apply a second-order symmetric Runge–Kutta method and a second-order symplectic Runge–Kutta method directly to the gyrocenter dynamics which can be expressed as a noncanonical Hamiltonian system.The numerical simulation results show the overwhelming superiorities of the two methods over a higher order nonsymmetric nonsymplectic Runge–Kutta method in long-term numerical accuracy and near energy conservation.Furthermore,they are much faster than the midpoint rule applied to the canonicalized system to reach given precision.

Multi-symplectic Runge-Kutta methods for Landau-Ginzburg-Higgs equation

Nonlinear wave equations have been extensively investigated in the last sev- eral decades. The Landau-Ginzburg-Higgs equation, a typical nonlinear wave equation, is studied in this paper based on the multi-symplectic theory in the Hamilton space. The multi-symplectic Runge-Kutta method is reviewed, and a semi-implicit scheme with certain discrete conservation laws is constructed to solve the first-order partial differential equations （PDEs） derived from the Landau-Ginzburg-Higgs equation. The numerical re- sults for the soliton solution of the Landau-Ginzburg-Higgs equation are reported, showing that the multi-symplectic Runge-Kutta method is an efficient algorithm with excellent long-time numerical behaviors.

Symplectic analysis for regulating wave propagation in a one-dimensional nonlinear graded metamaterial

An analytical method,called the symplectic mathematical method,is proposed to study the wave propagation in a spring-mass chain with gradient arranged local resonators and nonlinear ground springs.Combined with the linearized perturbation approach,the symplectic transform matrix for a unit cell of the weakly nonlinear graded metamaterial is derived,which only relies on the state vector.The results of the dispersion relation obtained with the symplectic mathematical method agree well with those achieved by the Bloch theory.It is shown that wider and lower frequency bandgaps are formed when the hardening nonlinearity and incident wave intensity increase.Subsequently,the displacement response and transmission performance of nonlinear graded metamaterials with finite length are studied.The dual tunable effects of nonlinearity and gradation on the wave propagation are explored under different excitation frequencies.For small excitation frequencies,the gradient parameter plays a dominant role compared with the nonlinearity.The reason is that the gradient tuning aims at the gradient arrangement of local resonators,which is limited by the critical value of the local resonator mass.In contrast,for larger excitation frequencies,the hardening nonlinearity is dominant and will contribute to the formation of a new bandgap.

Donaldson＇s Q-operators for symplectic manifolds

We prove an estimate for Donaldson's Q-operator on a prequantized compact symplectic manifold.This estimate is an ingredient in the recent result of Keller and Lejmi(2017) about a symplectic generalization of Donaldson's lower bound for the L^2-norm of the Hermitian scalar curvature.

Lefschetz decomposition for de Rham cohomology on weakly Lefschetz symplectic manifolds

For a compact symplectic manifold which is s-Lefschetz which is weaker than the decomposition for de hard Lefschetz property, we prove that the Lefschetz Rham cohomology also holds.

Normal Crossings Degenerations of Symplectic Manifolds

We use local Hamiltonian torus actions to degenerate a symplectic manifold to a normal crossings symplectic variety in a smooth one-parameter family.This construction,motivated in part by the Gross-Siebert and B.Parker’s programs,contains a multifold version of the usual(two-fold)symplectic cut construction and in particular splits a symplectic manifold into several symplectic manifolds containing normal crossings symplectic divisors with shared irreducible components in one step.

Explicit Multi-Symplectic Methods for Hamiltonian Wave Equations

In this paper,based on the multi-symplecticity of concatenating symplectic Runge-Kutta-Nystrom(SRKN)methods and symplectic Runge-Kutta-type methods for numerically solving Hamiltonian PDEs,explicit multi-symplectic schemes are constructed and investigated,where the nonlinear wave equation is taken as a model problem.Numerical comparisons are made to illustrate the effectiveness of our newly derived explicit multi-symplectic integrators.

Numerical Dispersion Relation of Multi-symplectic Runge-Kutta Methods for Hamiltonian PDEs

Numerical dispersion relation of the multi-symplectic Runge-Kutta （MSRK） method for linear Hamiltonian PDEs is derived in the present paper, which is shown to be a discrete counterpart to that possessed by the differential equation. This provides further understanding of MSRK methods. However, much still remains to be investigated further.

A symplectic finite element method based on Galerkin discretization for solving linear systems

We propose a novel symplectic finite element method to solve the structural dynamic responses of linear elastic systems.For the dynamic responses of continuous medium structures,the traditional numerical algorithm is the dissipative algorithm and cannot maintain long-term energy conservation.Thus,a symplectic finite element method with energy conservation is constructed in this paper.A linear elastic system can be discretized into multiple elements,and a Hamiltonian system of each element can be constructed.The single element is discretized by the Galerkin method,and then the Hamiltonian system is constructed into the Birkhoffian system.Finally,all the elements are combined to obtain the vibration equation of the continuous system and solved by the symplectic difference scheme.Through the numerical experiments of the vibration response of the Bernoulli-Euler beam and composite plate,it is found that the vibration response solution and energy obtained with the algorithm are superior to those of the Runge-Kutta algorithm.The results show that the symplectic finite element method can keep energy conservation for a long time and has higher stability in solving the dynamic responses of linear elastic systems.

超大型航天结构动力学与控制的保辛方法

超大型航天器是空间资源探索和利用的重要空间基础设施,也是实现航天强国目标的重大战略性航天装备。由于这类结构的质量和尺寸巨大,将带来在轨运行中的姿-轨-结构耦合和在轨姿态控制问题。同时,结构的超大尺度、构型变化与空间环境相互作用将产生极复杂的结构振动和大型结构特有的波动现象。这些为其动力学建模与数值求解、在轨精确姿态控制、低频结构振动抑制和振动波动耦合的特性调控等提出了新的挑战。本文介绍了本团队近十年基于保辛方法针对上述问题取得的研究进展,包括超大型航天结构在轨耦合动力学与姿态控制、超大型航天结构波动力学行为与控制、可展开结构设计以及变刚度主动控制方法等。

计算最优控制辛数值方法

针对最优控制问题(OCP)的辛数值方法研究及应用进行综述。主要涉及内容包括,动力学系统为常微分方程描述的一般无约束、含不等式约束和状态时滞的最优控制问题,微分代数方程描述的一般无约束、含不等式约束和含切换系统的最优控制问题,以及闭环最优控制问题。从间接法和直接法两个求解框架出发,重点介绍本课题组在保辛算法方面的研究工作。在间接法框架下,首先基于生成函数和变分原理,将OCP保辛离散为非线性方程组,再数值求解方程组。在直接法框架下,将OCP保辛离散为有限维的非线性规划问题(NLP),再数值求解。针对闭环最优控制问题,提出了保辛模型预测控制、滚动时域估计和瞬时最优控制算法。研究表明,保辛算法具有高精度和高效率的特点,在航空航天和机器人等领域有着广泛应用前景和价值。