In the article, we discuss the conservation laws for the nonlinear Schrödinger equation with wave operator under multisymplectic integrator (MI). The discrete conservation laws of the numerical method are analyze...
In the article, we discuss the conservation laws for the nonlinear Schrödinger equation with wave operator under multisymplectic integrator (MI). The discrete conservation laws of the numerical method are analyzed. It is verified that the proposed MI can stably simulate the multisymplectic Hamiltonian system excellent over long time. It is more accurate than some energy-preserving schemes though they are of the same accuracy. Moreover, the residual of mass is less than energy-preserving schemes under the same mesh partition over long-term.
In this paper we investigate the stochastic multisymplectic methods to solve the stochastic partial differential equation. The stochastic KdV equations are considered. Besides conserving the multi-symplectic structure...
In this paper we investigate the stochastic multisymplectic methods to solve the stochastic partial differential equation. The stochastic KdV equations are considered. Besides conserving the multi-symplectic structure of original equation, the stochastic multi-symplectic methods are also investigated for the conservation of various conservation laws. We deduce the transit laws of the specific formal conservation laws. Numerical experiments are illustrated to verify the good behaviors of stochastic multisymplectic methods.
A sequential quadratic programming (SQP) method is proposed to solve the distributed beamforming problem in multiple relay networks. The problem is formulated as the minimization of the total relay transmit power, sub...
详细信息
A sequential quadratic programming (SQP) method is pro posed to solve the distributed beamforming problem in multiple relay networks. The problem is formulated as the minimization of the total relay transmit power, su...
详细信息
A sequential quadratic programming (SQP) method is pro posed to solve the distributed beamforming problem in multiple relay networks. The problem is formulated as the minimization of the total relay transmit power, subject to individual signal-to-interference-and-noise ratio constraints at each receiver, which is a nonconvex quadratic constraint quadratic programming. Rather than solving its semi-definite programming (SDP) relaxation, we apply the SQP method to solve its tightened form to replace its inequality constraints with equalities. Its global convergence is guaranteed. Simulations show that it not only runs much faster, but also performs as good as SDP for calculation results.
We present a new flexible alignment method to align two or more similar images, especially biological images. By minimizing an energy functional measuring the difference of the initial image and target image, an L2-gr...
详细信息
In this section, we introduce some outstanding research achievements made by CAS scientists in 2010, as listed in the Chinese version of Science Development Report published in March 2011.
In this section, we introduce some outstanding research achievements made by CAS scientists in 2010, as listed in the Chinese version of Science Development Report published in March 2011.
we present a new flexible alignment method to align two or more similar images, especially biological images. By minimizing an energy functional measuring the difference of the initial image and target image, an L...
详细信息
we present a new flexible alignment method to align two or more similar images, especially biological images. By minimizing an energy functional measuring the difference of the initial image and target image, an L2 -gradient flow is derived. The flow is integrated by a finite element method in the spatial direction and an explicit Euler scheme in the temporal direction. Multi-resolution representations are used for achieving efficient multi-scale alignment The experimental results on 2D images show that the proposed method is efficient, effective, robust and capable of capturing the variation of the initial and target images, from large to small scale.
For a general MIMO interference channel, we can determine the feasibility of linear interference alignment via minimizing the leakage interference. This paper gives a complete complexity characterization of the leakag...
详细信息
For a general MIMO interference channel, we can determine the feasibility of linear interference alignment via minimizing the leakage interference. This paper gives a complete complexity characterization of the leakage interference minimization problem. It is shown that, when each transmitter (receiver) is equipped with at least three antennas and each receiver (transmitter) is equipped with at least two antennas, the problem of checking whether the interference in the network can be perfectly aligned is strongly NP-hard. Moreover, when each transmit/receive node is equipped with two or more antennas, leakage interference minimization can not be solved (even approximately) in polynomial time, unless P = NP.
We prove that the error estimates of a large class of nonconforming finite elements are dominated by their approximation errors, which means that the well-known Cea’s lemma is still valid for these nonconforming fini...
详细信息
We prove that the error estimates of a large class of nonconforming finite elements are dominated by their approximation errors, which means that the well-known Cea’s lemma is still valid for these nonconforming finite element methods. Furthermore, we derive the error estimates in both energy and L2 norms under the regularity assumption u ∈ H1+s(Ω) with any s > 0. The extensions to other related problems are possible.
暂无评论