变质量非完整系统打击运动的Kane方程

本文建立变质量非完整系统Routh形式的Kane方程,并由此导出变质量完整系统和非完整系统打击运动的Kane方程,其次指出Lagrange形式的打击运动方程与Kane方程的等价性。最后举例说明新方程的应用。     

非线性发展方程的无网格比高精度有限元方法

对于几类非线性的发展型方程——非线性抛物方程、非线性Schr?dinger方程、非线性Sobolev方程、非线性双曲方程,本文从协调有限元方法、非协调有限元方法、混合有限元方法等不同角度,利用不同技巧深入系统地研究了其线性化的全离散格式的构造、无网格比约束下的超逼近和超收敛分析.     

用Riccati方程的新解求Fitzhugh-Nagumo方程的新行波解

本文研究了Riccati方程和Fitzhugh-Nagumo方程的新精确解的构造.利用试探函数法找到了Riccati方程的八种类型的新显式精确解.用广义Tanh函数法结合Riccati方程的新精确解,获得了Fitzhugh-Nagumo方程、Huxley方程、广义KPP方程及Newell-Whitehead方程的许多新...     

应用改进的Kudryashov法求非线性方程的精确解

利用Kudryashov法分别得到(1+1)维Benjiamin Ono方程、(2+1)维AKNS方程、分数阶生物群体模型方程的精确解.实践证明,这种方法简洁方便,对于研究非线性发展方程具有十分重要的意义.     

一类非自共轭非线性Schrdinger方程的显式差分格式

在量子力学与高能物理中,非线性Schrodinger方程很重要,它和KdV方程、BBM方程及Sine-Gordon方程一样,早就引起了人们的注意.郭柏灵讨论了非线性Sch-rodinger方程的适定性与数值方法;吴相辉研究了四点和六点隐差分格式的收敛性和稳定性;常谦顺探讨了守恒差分格式.在[1]中研究了一维晶体和α-螺旋生物分子所产     

一类非自共轭非线性Schrdinger方程的显式差分格式

在量子力学与高能物理中,非线性Schrodinger方程很重要,它和KdV方程、BBM方程及Sine-Gordon方程一样,早就引起了人们的注意.郭柏灵讨论了非线性Sch-rodinger方程的适定性与数值方法;吴相辉研究了四点和六点隐差分格式的收敛性和稳定性;常谦顺探讨了守恒差分格式.在[1]中研究了一维晶体和α-螺旋生物分子所产     

具有确定运动姿势的柔性体的动力学分析研究

讨论了具有确定运动姿态的柔性多体系统的非线性动力学控制方程． 将飞行器在空间的运动看作是已知的,分析了飞行器上的挠性构件对飞行器运动和姿态的影响,利用假设模态,将挠性构件的变形,看作是空间直角坐标轴方向的线元振动所构成的,根据动力学中的Kane方法,建立了动力学方程,方程中包含表示弹性变形的结构刚度矩阵及表示变形体非线性变形几何刚度矩阵,方程推导从应力-应变关系入手,使用了有限元法．经简化,得到了带帆板结构的平面挠性体对飞行器运动影响的动力学方程,这种方程可通过计算机实现其数值解．     

利用Hirota双线性法求解一类非线性发展方程

利用hirota双线性法和Hopf-Cole变换,得到(3+1)维广义KP方程、广义(3+1)维浅水波方程、(1+1)维Boussinesq方程、(2+1)维Nizhnik方程的精确解,并做出一部分解的图形,进一步研究解的结构和性质.实践证明,方法对于研究非线性发展方程具有十分重要的作用.     

一类非线性数学物理方程的精确解

利用改进的辅助方程法,分别获得(1+1)维Benjiamin Ono方程、Phi-4方程、(3+1)维YTSF方程、foam drainage方程的精确解,进一步扩大了解的范围,丰富了解的结构.实践证明,利用这种辅助方程法对于研究非线性数学物理方程具有十分重要的作用.     

几类非线性发展方程的解析解

研究下列偏微分方程:广义五阶KdV方程,水波方程,Kupershmidt方程,耦合KdV方程。通过引进一个二阶常微分方程,采用不同的ansatzes方法找到了这些问题的解析解。     

Conservative methods of controlling the rotation of a gyrostat

A method for shaping the control of the rotation of a gyrostat consisting of a rigid body, within which there are three rotors rotating about non-coplanar axes rigidly connected to the body, is discussed. The state of the system is defined by the position and angular velocity of rotation of the body, as well as by the angular velocities of the rotors. Control is achieved by torques applied to the rotors. The idea behind the proposed control method is to choose the controlling torques so that the angular velocities of rotation of the rotors are linear functions of the components of the angular velocity vector of the body. The linear dependence thus specified defines a 3 × 3 matrix, that is, a “controlled inertia tensor.” This matrix, which is specified by the parameters of the control selected, does not necessarily have the properties of an inertia tensor. As a result of such a choice of controls, the equations that define the variation of the angular velocity of the body are written in a form similar to Euler's dynamical equations. The system of equations obtained is used to formulate and solve problems of controlling the angular motion of a satellite in a circular orbit. The proposed method for constructing controlling actions enables both the Lagrangian structure of the equations of motion and the fundamental symmetries of the problem to be maintained. Expressions for the torques acting on the rotors and realizing the motion of the required classes are written in explicit form.     

一种经典时空理论(Ⅰ)——基础

尽管广义相对论形式优美,成果辉煌,但在以下几个方面却未尽完善:(1)它不能容纳不对称的总能量-动量张量,这种不对称性已经在电磁理论中被证明是存在的.(2)场方程可以导出线动量平衡定律,却不能导出角动量平衡定律的精确方程.(3)如果没有附加(非物理)的假设,缩并的第二Bianchi恒等式的四度任意性使场方程无法获得唯一解.为了解决这些问题,我们在本文提出,把纤维丛P[M,SU(2)]定律作为四维时空的基本几何结构.于此,结构群SU(2)是特殊二维复酉群的实表示.SU(2)同时使定义在整个M上的度规型dS2=g_αβdxαdxβ和基本二型φ=(1/2₁)a_αβdxα∧dxβ不变.以SU(2)连络定义的爱因斯坦方程利用了时空流形以及把非齐次麦克斯韦方程作为辅助条件.于此,电磁张量与曲率张量的缩并形式是等价的.我们得到的结果是关于16个未知场变量(g_αβ,a_αβ)的16个独立的基本方程.另外,角动量平衡定律恰好是推广的爱因斯坦方程的斜对称部分.这里,自旋角动量张量直接被证明与扭转张量成比例.     

柔性杆柔性铰机器人动力学分析

研究由N柔性杆和N柔性铰组成的空间机器人的动力学问题．把柔性铰简化成一个线性扭转弹簧,采用假设模态法表示杆件的弹性变形,运用Kane方法对全柔机器人进行动力学建模,推导出完整的系统动力学方程组．通过一个数值仿真算例,验证所做工作的可行性,并分析了柔性效应对机器人动力学响应的影响．     

The Algebra of the Riemann Curvature Tensor in General Relativity: Preliminaries

In a four-dimensional curved space-time it is well-known that the Riemann curvature tensor has twenty independent components; ten of these components appear in the Weyl tensor, and nine of these components appear in the Einstein curvature tensor. It is also known that there are fourteen combinations of these components which are invariant under local Lorentz transformations. In this paper, we derive explicitly closed form expressions which contain these twenty independent components in a manifest way. We also write the fourteen invariants in two ways; firstly, we write them in terms of the components; and, secondly, we write them in a covariant fashion, and we further derive the appropriate characteristic value equations and the corresponding Cayley-Hamilton equations for these invariants. We also show explicitly how all of the relevant components transform under a Lorentz transformation. We shall follow the very general and powerful methods of Sachs [1]. We shall not point out at every stage of the calculation which equations are due to Sachs, and which equations are new; this is easily ascertained. Generally speaking, however, the equations depending on the Einstein curvature tensor, and the emphasis placed on this tensor, appear to be new.     

Adjusted Sparse Tensor Product Spectral Galerkin Method for Solving Pseudodifferential Equations on the Sphere with Random Input Data

An adjusted sparse tensor product spectral Galerkin approximation method based on spherical harmonics is introduced and analyzed for solving pseudodifferential equations on the sphere with random input data. These equations arise from geodesy where the sphere is taken as a model of the earth. Numerical solutions to the corresponding \(k\)-th order statistical moment equations are found in adjusted sparse tensor approximation spaces which are accordingly designed to the regularity of the data and the equation. Established convergence theorem shows that the adjusted sparse tensor Galerkin discretization is superior not only to the full tensor product but also to the standard sparse tensor counterpart when the statistical moments of the data are of mixed unequal regularity. Numerical experiments illustrate our theoretical results.

     

Tensor absolute value equations

This paper is concerned with solving some structured multi-linear systems, which are called tensor absolute value equations. This kind of absolute value equations is closely related to tensor complementarity problems and is a generalization of the well-known absolute value equations in the matrix case. We prove that tensor absolute value equations are equivalent to some special structured tensor complementary problems. Some sufficient conditions are given to guarantee the existence of solutions for tensor absolute value equations. We also propose a Levenberg-Marquardt-type algorithm for solving some given tensor absolute value equations and preliminary numerical results are reported to indicate the efficiency of the proposed algorithm.     

The Average Condition Number of Most Tensor Rank Decomposition Problems is Infinite

The tensor rank decomposition, or canonical polyadic decomposition, is the decomposition of a tensor into a sum of rank-1 tensors. The condition number of the tensor rank decomposition measures the sensitivity of the rank-1 summands with respect to structured perturbations. Those are perturbations preserving the rank of the tensor that is decomposed. On the other hand, the angular condition number measures the perturbations of the rank-1 summands up to scaling. We show for random rank-2 tensors that the expected value of the condition number is infinite for a wide range of choices of the density. Under a mild additional assumption, we show that the same is true for most higher ranks \(r\ge 3\) as well. In fact, as the dimensions of the tensor tend to infinity, asymptotically all ranks are covered by our analysis. On the contrary, we show that rank-2 tensors have finite expected angular condition number. Based on numerical experiments, we conjecture that this could also be true for higher ranks. Our results underline the high computational complexity of computing tensor rank decompositions. We discuss consequences of our results for algorithm design and for testing algorithms computing tensor rank decompositions.

     

Tensor Green Function for the System of Maxwell's Equations in a Layered Medium

A general method is considered for the construction of the tensor Green function for Maxwell's equations in a layered medium. An efficient algorithm for the evaluation of the tensor Green function is proposed. The properties of various components of the Green tensor are investigated.