In the present letter, we get the appropriate bilinear forms of （2 ＋ 1）-dimensional KdV equation, extended （2 ＋ 1）-dimensional shallow water wave equation and （2 ＋ 1）-dimensional Sawada -Kotera equation in a ...In the present letter, we get the appropriate bilinear forms of （2 ＋ 1）-dimensional KdV equation, extended （2 ＋ 1）-dimensional shallow water wave equation and （2 ＋ 1）-dimensional Sawada -Kotera equation in a quick and natural manner, namely by appling the binary Bell polynomials. Then the Hirota direct method and Riemann theta function are combined to construct the periodic wave solutions of the three types nonlinear evolution equations. And the corresponding figures of the periodic wave solutions are given. Furthermore, the asymptotic properties of the periodic wave solutions indicate that the soliton solutions can be derived from the periodic wave solutions.展开更多
The elementary and systematic binary Bell polynomials method is applied to the generalized NizhnikNovikov-Veselov (GNNV) equation.The bilinear representation,bilinear B&cklund transformation,Lax pair and infinitec...The elementary and systematic binary Bell polynomials method is applied to the generalized NizhnikNovikov-Veselov (GNNV) equation.The bilinear representation,bilinear B&cklund transformation,Lax pair and infiniteconservation laws of the GNNV equation are obtained directly,without too much trick like Hirota’s bilinear method.展开更多
In this paper, the author presents a class of stationary ternary 4-point approximating symmetrical subdivision algorithm that reproduces cubic polynomials. By these subdivision algorithms at each refinement step, new ...In this paper, the author presents a class of stationary ternary 4-point approximating symmetrical subdivision algorithm that reproduces cubic polynomials. By these subdivision algorithms at each refinement step, new insertion control points on a finer grid are computed by weighted sums of already existing control points. In the limit of the recursive process, data is defined on a dense set of point, The objective is to find an improved subdivision approximating algorithm which has a smaller support and a higher approximating order. The author chooses a ternary scheme because the best way to get a smaller support is to pass from the binary to ternary or complex algorithm and uses polynomial reproducing propriety to get higher approximation order. Using the cardinal Lagrange polynomials the author has proposed a 4-point approximating ternary subdivision algorithm and found that a higher regularity of limit function does not guarantee a higher approximating order. The proposed 4-point ternary approximation subdivision family algorithms with the mask a have the limit function in C2 and have approximation order 4. Also the author has demonstrated that in this class there is no algorithm whose limit function is in C3. It can be seen that this stationary ternary 4-point approximating symmetrical subdivision algorithm has a lower computational cost than the 6-point binary approximation subdivision algorithm for a greater range of points.展开更多
基金Supported by the National Natural Science Foundation of China under Grant Nos.11075055,61021004,10735030Shanghai Leading Academic Discipline Project under Grant No.B412Program for Changjiang Scholars and Innovative Research Team in University(IRT0734)
文摘In the present letter, we get the appropriate bilinear forms of （2 ＋ 1）-dimensional KdV equation, extended （2 ＋ 1）-dimensional shallow water wave equation and （2 ＋ 1）-dimensional Sawada -Kotera equation in a quick and natural manner, namely by appling the binary Bell polynomials. Then the Hirota direct method and Riemann theta function are combined to construct the periodic wave solutions of the three types nonlinear evolution equations. And the corresponding figures of the periodic wave solutions are given. Furthermore, the asymptotic properties of the periodic wave solutions indicate that the soliton solutions can be derived from the periodic wave solutions.
基金Supported by the National Natural Science Foundation of China under Grant Nos.10735030,11075055,61021004,90718041,Shanghai Leading Academic Discipline Project (No. B412)Program for Changjiang Scholars and Innovative Research Team in University (IRT0734)
文摘The elementary and systematic binary Bell polynomials method is applied to the generalized NizhnikNovikov-Veselov (GNNV) equation.The bilinear representation,bilinear B&cklund transformation,Lax pair and infiniteconservation laws of the GNNV equation are obtained directly,without too much trick like Hirota’s bilinear method.
文摘In this paper, the author presents a class of stationary ternary 4-point approximating symmetrical subdivision algorithm that reproduces cubic polynomials. By these subdivision algorithms at each refinement step, new insertion control points on a finer grid are computed by weighted sums of already existing control points. In the limit of the recursive process, data is defined on a dense set of point, The objective is to find an improved subdivision approximating algorithm which has a smaller support and a higher approximating order. The author chooses a ternary scheme because the best way to get a smaller support is to pass from the binary to ternary or complex algorithm and uses polynomial reproducing propriety to get higher approximation order. Using the cardinal Lagrange polynomials the author has proposed a 4-point approximating ternary subdivision algorithm and found that a higher regularity of limit function does not guarantee a higher approximating order. The proposed 4-point ternary approximation subdivision family algorithms with the mask a have the limit function in C2 and have approximation order 4. Also the author has demonstrated that in this class there is no algorithm whose limit function is in C3. It can be seen that this stationary ternary 4-point approximating symmetrical subdivision algorithm has a lower computational cost than the 6-point binary approximation subdivision algorithm for a greater range of points.
