Two points of the infinite dimensional complex projective space CP∞ with homogeneous coordinates a = （a0, a1, a2, ） and b = （b0, b1, b2, ）, respectively, are conjugate if and only if they are complex orthogonal, ...Two points of the infinite dimensional complex projective space CP∞ with homogeneous coordinates a = （a0, a1, a2, ） and b = （b0, b1, b2, ）, respectively, are conjugate if and only if they are complex orthogonal, i.e., ab = ∞∑j=0 ajbj = 0. For a complete ortho-normal system φ（t） = （φ0（t）, φ1（t）, φ2（t）, ） of L2H（D）, the space of the holomorphic and absolutely square integrable functions in the bounded domain D of Cn, φ（t）, t ∈ D, is considered as the homogeneous coordinate of a point in CP∞. The correspondence t →φ（t） induces a holomorphic imbedding ιφ ： D → CP∞. It is proved that the Bergman kernel K（t, v） of D equals to zero for the two points t and v in D if and only if their image points under ιφ are conjugate points of CP∞.展开更多
An interpolating reproducing kernel particle method for two-dimensional （2D） scatter points is introduced. It elim- inates the dependency of gridding in numerical calculations. The interpolating shape function in th...An interpolating reproducing kernel particle method for two-dimensional （2D） scatter points is introduced. It elim- inates the dependency of gridding in numerical calculations. The interpolating shape function in the interpolating repro- ducing kernel particle method satisfies the property of the Kronecker delta function. This method offers a mathematics basis for recognition technology and simulation analysis, which can be expressed as simultaneous differential equations in science or project problems. Mathematical examples are given to show the validity of the interpolating reproducing kernel particle method.展开更多
A polynomial interior-point algorithm is presented for monotone linear complementarity problem （MLCP） based on a class of kernel functions with the general barrier term, which are called general kernel functions. Un...A polynomial interior-point algorithm is presented for monotone linear complementarity problem （MLCP） based on a class of kernel functions with the general barrier term, which are called general kernel functions. Under the mild conditions for the barrier term, the complexity bound of algorithm in terms of such kernel function and its derivatives is obtained. The approach is actually an extension of the existing work which only used the specific kernel functions for the MLCP.展开更多
In this paper, we propose a new infeasible interior-point algorithm with full NesterovTodd (NT) steps for semidefinite programming (SDP). The main iteration consists of a feasibility step and several centrality steps....In this paper, we propose a new infeasible interior-point algorithm with full NesterovTodd (NT) steps for semidefinite programming (SDP). The main iteration consists of a feasibility step and several centrality steps. We used a specific kernel function to induce the feasibility step. The analysis is more simplified. The iteration bound coincides with the currently best known bound for infeasible interior-point methods.展开更多
This paper proposes a new full Nesterov-Todd(NT) step infeasible interior-point algorithm for semidefinite programming. Our algorithm uses a specific kernel function, which is adopted by Liu and Sun, to deduce the fea...This paper proposes a new full Nesterov-Todd(NT) step infeasible interior-point algorithm for semidefinite programming. Our algorithm uses a specific kernel function, which is adopted by Liu and Sun, to deduce the feasibility step. By using the step, it is remarkable that in each iteration of the algorithm it needs only one full-NT step, and can obtain an iterate approximate to the central path. Moreover, it is proved that the iterative bound corresponds with the known optimal one for semidefinite optimization problems.展开更多
Many mechanical problems can be induced from differential equations with boundary conditions; there exist analytic and numerical methods for solving the differential equations. Usually it is not so easy to obtain anal...Many mechanical problems can be induced from differential equations with boundary conditions; there exist analytic and numerical methods for solving the differential equations. Usually it is not so easy to obtain analytic solutions. So it is necessary to give numerical solutions. The reproducing kernel particle （RKP） method is based on the Carlerkin Meshless method. According to the Sobolev space and Fourier transform, the RKP shape function is mathematically proved in this paper.展开更多
For the detection and tracking of dim point targets with SNR<2 dB, the combined SPRT and FSS method is given to accomplish detection in which likelihood testing are carried out twice to prune constantly. Firstly, t...For the detection and tracking of dim point targets with SNR<2 dB, the combined SPRT and FSS method is given to accomplish detection in which likelihood testing are carried out twice to prune constantly. Firstly, the SPRT is developed aiming at the heuristic segments formed by correlation analysis. In order to avoid missing detection the threshold is chosen much lower. Secondly, by adding samples and choosing the one most similar to the heuristic segment to make state estimation FSS is implemented. This time we choose a higher threshold. Moreover in preprocessing the compound kernel estimation is designed to depress varying background clutter. Multiple experimental sequences validate that the method is more suitable for the dim targets detection and tracking compared with the scheme choosing the higher intensity pixel in tracking. It not only has perfect detection performance but also can greatly enhance tracking performance.展开更多
A meshfree method based on reproducing kernel approximation and point collocation is presented for analysis of metal ring compression. The point collocation method is a true meshfree method without the employment of a...A meshfree method based on reproducing kernel approximation and point collocation is presented for analysis of metal ring compression. The point collocation method is a true meshfree method without the employment of a background mesh. It is shown that, in a point collocation approach, the remesh problem because of the mesh distortion in FEM （finite element method） and the low efficiency in Galerkin-based meshfree method are avoided. The corrected kernel functions are introduced to the stabilization of free-surface boundary conditions. The solution of symmetric ring compression problem is compared with a conventional finite element solution, and reasonable results have been obtained.展开更多
基金Partially support by NSF of China (A01010501 and10731080)
文摘Two points of the infinite dimensional complex projective space CP∞ with homogeneous coordinates a = （a0, a1, a2, ） and b = （b0, b1, b2, ）, respectively, are conjugate if and only if they are complex orthogonal, i.e., ab = ∞∑j=0 ajbj = 0. For a complete ortho-normal system φ（t） = （φ0（t）, φ1（t）, φ2（t）, ） of L2H（D）, the space of the holomorphic and absolutely square integrable functions in the bounded domain D of Cn, φ（t）, t ∈ D, is considered as the homogeneous coordinate of a point in CP∞. The correspondence t →φ（t） induces a holomorphic imbedding ιφ ： D → CP∞. It is proved that the Bergman kernel K（t, v） of D equals to zero for the two points t and v in D if and only if their image points under ιφ are conjugate points of CP∞.
基金supported by the National Natural Science Foundation of China(Grant No.11171208)the Natural Science Foundation of Shanxi Province,China(Grant No.2013011022-6)
文摘An interpolating reproducing kernel particle method for two-dimensional （2D） scatter points is introduced. It elim- inates the dependency of gridding in numerical calculations. The interpolating shape function in the interpolating repro- ducing kernel particle method satisfies the property of the Kronecker delta function. This method offers a mathematics basis for recognition technology and simulation analysis, which can be expressed as simultaneous differential equations in science or project problems. Mathematical examples are given to show the validity of the interpolating reproducing kernel particle method.
基金supported by the National Natural Science Foundation of China (Grant No.10771133)the Shanghai Pujiang Program (Grant No.06PJ14039)
文摘A polynomial interior-point algorithm is presented for monotone linear complementarity problem （MLCP） based on a class of kernel functions with the general barrier term, which are called general kernel functions. Under the mild conditions for the barrier term, the complexity bound of algorithm in terms of such kernel function and its derivatives is obtained. The approach is actually an extension of the existing work which only used the specific kernel functions for the MLCP.
文摘In this paper, we propose a new infeasible interior-point algorithm with full NesterovTodd (NT) steps for semidefinite programming (SDP). The main iteration consists of a feasibility step and several centrality steps. We used a specific kernel function to induce the feasibility step. The analysis is more simplified. The iteration bound coincides with the currently best known bound for infeasible interior-point methods.
基金Sponsored by the National Natural Science Foundation of China(Grant No.11461021)the Natural Science Basic Research Plan in Shaanxi Province of China(Grant No.2017JM1014)Scientific Research Project of Hezhou University(Grant Nos.2014YBZK06 and 2016HZXYSX03)
文摘This paper proposes a new full Nesterov-Todd(NT) step infeasible interior-point algorithm for semidefinite programming. Our algorithm uses a specific kernel function, which is adopted by Liu and Sun, to deduce the feasibility step. By using the step, it is remarkable that in each iteration of the algorithm it needs only one full-NT step, and can obtain an iterate approximate to the central path. Moreover, it is proved that the iterative bound corresponds with the known optimal one for semidefinite optimization problems.
文摘Many mechanical problems can be induced from differential equations with boundary conditions; there exist analytic and numerical methods for solving the differential equations. Usually it is not so easy to obtain analytic solutions. So it is necessary to give numerical solutions. The reproducing kernel particle （RKP） method is based on the Carlerkin Meshless method. According to the Sobolev space and Fourier transform, the RKP shape function is mathematically proved in this paper.
文摘For the detection and tracking of dim point targets with SNR<2 dB, the combined SPRT and FSS method is given to accomplish detection in which likelihood testing are carried out twice to prune constantly. Firstly, the SPRT is developed aiming at the heuristic segments formed by correlation analysis. In order to avoid missing detection the threshold is chosen much lower. Secondly, by adding samples and choosing the one most similar to the heuristic segment to make state estimation FSS is implemented. This time we choose a higher threshold. Moreover in preprocessing the compound kernel estimation is designed to depress varying background clutter. Multiple experimental sequences validate that the method is more suitable for the dim targets detection and tracking compared with the scheme choosing the higher intensity pixel in tracking. It not only has perfect detection performance but also can greatly enhance tracking performance.
基金the National Natural Science Foundation of China （No. 50275059）.
文摘A meshfree method based on reproducing kernel approximation and point collocation is presented for analysis of metal ring compression. The point collocation method is a true meshfree method without the employment of a background mesh. It is shown that, in a point collocation approach, the remesh problem because of the mesh distortion in FEM （finite element method） and the low efficiency in Galerkin-based meshfree method are avoided. The corrected kernel functions are introduced to the stabilization of free-surface boundary conditions. The solution of symmetric ring compression problem is compared with a conventional finite element solution, and reasonable results have been obtained.
