The higher-order Kaup-Newell equation is examined by applying the Fokas unified method on the half-line.We demonstrate that the solution can be expressed in relation to the resolution of the Riemann-Hilbert problem.Th...The higher-order Kaup-Newell equation is examined by applying the Fokas unified method on the half-line.We demonstrate that the solution can be expressed in relation to the resolution of the Riemann-Hilbert problem.The jump matrix for this problem is derived from the spectral matrix,which is calculated based on both the initial conditions and the boundary conditions.The jump matrix is explicitly dependent and expressed through the spectral functions,which are derived from the initial and boundary information,respectively.These spectral functions are interdependent and adhere to a so-called global relationship.展开更多
We construct the Riemann-Hilbert problem of the Lakshmanan-Porsezian-Daniel equation with nonzero boundary conditions,and use the Laurent expansion and Taylor series expansion to obtain the exact formulas of the solit...We construct the Riemann-Hilbert problem of the Lakshmanan-Porsezian-Daniel equation with nonzero boundary conditions,and use the Laurent expansion and Taylor series expansion to obtain the exact formulas of the soliton solutions in the case of a higher-order pole and multiple higher-order poles.The dynamic behaviors of a simple pole,a second-order pole and a simple pole plus a second-order pole are demonstrated.展开更多
In this paper, a pair of Mond-Weir type higher-order symmetric dual programs over arbitrary cones is formulated. The appropriate duality theorems, such as weak duality theorem, strong duality theorem and converse dual...In this paper, a pair of Mond-Weir type higher-order symmetric dual programs over arbitrary cones is formulated. The appropriate duality theorems, such as weak duality theorem, strong duality theorem and converse duality theorem, are established under higher-order （strongly） cone pseudoinvexity assumptions.展开更多
In this paper,we consider the second-order cone tensor eigenvalue complementarity problem(SOCTEiCP)and present three different reformulations to the model under consideration.Specifically,for the general SOCTEiCP,we ...In this paper,we consider the second-order cone tensor eigenvalue complementarity problem(SOCTEiCP)and present three different reformulations to the model under consideration.Specifically,for the general SOCTEiCP,we first show its equivalence to a particular variational inequality under reasonable conditions.A notable benefit is that such a reformulation possibly provides an efficient way for the study of properties of the problem.Then,for the symmetric and sub-symmetric SOCTEiCPs,we reformulate them as appropriate nonlinear programming problems,which are extremely beneficial for designing reliable solvers to find solutions of the considered problem.Finally,we report some preliminary numerical results to verify our theoretical results.展开更多
The notion of higher-order B-type I functional is introduced in this paper.This notion is utilized to study optimality and duality for multiobjective semi-infinite variational problem in which the index set of inequal...The notion of higher-order B-type I functional is introduced in this paper.This notion is utilized to study optimality and duality for multiobjective semi-infinite variational problem in which the index set of inequality constraints is an infinite set.The concept of efficiency is used as a tool for optimization.Mond–Weir type of dual is proposed for which weak,strong,and strict converse duality theorems are proved to relate efficient solutions of primal and dual problems.展开更多
In this paper, we derive a priori bounds for global solutions of 2m-th order semilinear parabolic equations with superlinear and subcritical growth conditions. The proof is obtained by a bootstrap argument and maximal...In this paper, we derive a priori bounds for global solutions of 2m-th order semilinear parabolic equations with superlinear and subcritical growth conditions. The proof is obtained by a bootstrap argument and maximal regularity estimates. If n≥ 10/3m, we also give another proof which does not use maximal regularity estimates.展开更多
We consider the higher-order Cauchy problem (ACP_n) x^(n)(t)=sum from i=0 to n-1 B_ix^(i)(t)_1x^(i)(0)=x_i for 0≤i≤n-1,where B_i(0≤i≤n-1) are closed linear operators on a Banach space X such that D=∩ i=0 n-1 D(B_...We consider the higher-order Cauchy problem (ACP_n) x^(n)(t)=sum from i=0 to n-1 B_ix^(i)(t)_1x^(i)(0)=x_i for 0≤i≤n-1,where B_i(0≤i≤n-1) are closed linear operators on a Banach space X such that D=∩ i=0 n-1 D(B_i)is dense in X. It is well known that the solvability and the well-posedness of (ACP_n)were studied only in some special cases, such as D(B_(n-1))?D(B_i) for 0≤i≤n-2 by F. Neu-brander and a factoring case by J. T. Sandefur. In this paper, by using some new results ofvector valued Laplace transforms given by W. Arenddt, we obtain some characterizations ofthe solvability and some sufficiency conditions of the well-posedness for general (ACP_n),which generalize F. Neubrander's results and the famous results for (ACP_1)展开更多
.In this paper,a quadratic finite volume method(FVM)for parabolic problems is studied.We first discretize the spatial variables using a quadratic FVM to obtain a semi-discrete scheme.We then employ the backward Euler ....In this paper,a quadratic finite volume method(FVM)for parabolic problems is studied.We first discretize the spatial variables using a quadratic FVM to obtain a semi-discrete scheme.We then employ the backward Euler method and the Crank-Nicolson method respectively to further disctetize the time vatiable so as to derive two full-discrete schemes.The existence and uniqueness of the semi-discrete and full-discrete FVM solutions are established and their optimal error estimates are derived.Finally,we give numerical examples to illustrate the theoretical results.展开更多
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem.Traditionally,such analyses are performed using paper-and-pencil...Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem.Traditionally,such analyses are performed using paper-and-pencil proofs and the results are sometimes validated using simulation techniques.These techniques are informal and thus may result in an inaccurate analysis.In this paper,we propose a formal technique for analyzing the expected time complexity of algorithms using higher-order-logic theorem proving.The approach calls for mathematically modeling the algorithm along with its inputs,using indicator random variables,in higher-order logic.This model is then used to formally reason about the expected time complexity of the underlying algorithm in a theorem prover.The paper includes the higher-order-logic formalization of indicator random variables,which are fundamental to the proposed infrastructure.In order to illustrate the practical effiectiveness and utilization of the proposed infrastructure,the paper also includes the analysis of algorithms for three well-known problems,i.e.,the hat-check problem,the birthday paradox and the hiring problem.展开更多
A hierarchy of multidimensional Hénon-Heiles(M-H-H)systems are constructed via the x-and t_n-higher-order-constrained flows of KdV hierarchy.The Lax representation for the M-H-H hierarchy is determined from the a...A hierarchy of multidimensional Hénon-Heiles(M-H-H)systems are constructed via the x-and t_n-higher-order-constrained flows of KdV hierarchy.The Lax representation for the M-H-H hierarchy is determined from the adjoint representation of the auxiliary linear problem for the KdV hierarchy.By using the Lax representation the classical Poisson structure and r-matrix for the hierarchy are found and the Jacobi inversion problem for the hierarchy is constructed.展开更多
文摘The higher-order Kaup-Newell equation is examined by applying the Fokas unified method on the half-line.We demonstrate that the solution can be expressed in relation to the resolution of the Riemann-Hilbert problem.The jump matrix for this problem is derived from the spectral matrix,which is calculated based on both the initial conditions and the boundary conditions.The jump matrix is explicitly dependent and expressed through the spectral functions,which are derived from the initial and boundary information,respectively.These spectral functions are interdependent and adhere to a so-called global relationship.
基金supported by the National Natural Science Foundation of China under Grant Nos.12175111,12275144 and 12235007the KC Wong Magna Fund in Ningbo University。
文摘We construct the Riemann-Hilbert problem of the Lakshmanan-Porsezian-Daniel equation with nonzero boundary conditions,and use the Laurent expansion and Taylor series expansion to obtain the exact formulas of the soliton solutions in the case of a higher-order pole and multiple higher-order poles.The dynamic behaviors of a simple pole,a second-order pole and a simple pole plus a second-order pole are demonstrated.
基金Supported by the National Natural Science Foundation of China(No.11431004,11271391 and 11201511)the Natural Science Foundation of Chongqing(CSTC2014pt-sy00001,CSTC2015jcyj A00005)the Education Committee Project Research Foundation of Chongqing(KJ1500309,KJ1400519)
文摘In this paper, a pair of Mond-Weir type higher-order symmetric dual programs over arbitrary cones is formulated. The appropriate duality theorems, such as weak duality theorem, strong duality theorem and converse duality theorem, are established under higher-order （strongly） cone pseudoinvexity assumptions.
基金the National Natural Science Foundation of China(Nos.11171083,11301123,and 11571087)the Natural Science Foundation of Zhejiang Province(Nos.LZ14A010003 and LY17A010028).
文摘In this paper,we consider the second-order cone tensor eigenvalue complementarity problem(SOCTEiCP)and present three different reformulations to the model under consideration.Specifically,for the general SOCTEiCP,we first show its equivalence to a particular variational inequality under reasonable conditions.A notable benefit is that such a reformulation possibly provides an efficient way for the study of properties of the problem.Then,for the symmetric and sub-symmetric SOCTEiCPs,we reformulate them as appropriate nonlinear programming problems,which are extremely beneficial for designing reliable solvers to find solutions of the considered problem.Finally,we report some preliminary numerical results to verify our theoretical results.
基金Jyoti was supported by University Grant Commission Non-NET research fellowship,India(No.Schs/Non-NET/139/Ext-142/2015-16/1931).
文摘The notion of higher-order B-type I functional is introduced in this paper.This notion is utilized to study optimality and duality for multiobjective semi-infinite variational problem in which the index set of inequality constraints is an infinite set.The concept of efficiency is used as a tool for optimization.Mond–Weir type of dual is proposed for which weak,strong,and strict converse duality theorems are proved to relate efficient solutions of primal and dual problems.
文摘In this paper, we derive a priori bounds for global solutions of 2m-th order semilinear parabolic equations with superlinear and subcritical growth conditions. The proof is obtained by a bootstrap argument and maximal regularity estimates. If n≥ 10/3m, we also give another proof which does not use maximal regularity estimates.
文摘We consider the higher-order Cauchy problem (ACP_n) x^(n)(t)=sum from i=0 to n-1 B_ix^(i)(t)_1x^(i)(0)=x_i for 0≤i≤n-1,where B_i(0≤i≤n-1) are closed linear operators on a Banach space X such that D=∩ i=0 n-1 D(B_i)is dense in X. It is well known that the solvability and the well-posedness of (ACP_n)were studied only in some special cases, such as D(B_(n-1))?D(B_i) for 0≤i≤n-2 by F. Neu-brander and a factoring case by J. T. Sandefur. In this paper, by using some new results ofvector valued Laplace transforms given by W. Arenddt, we obtain some characterizations ofthe solvability and some sufficiency conditions of the well-posedness for general (ACP_n),which generalize F. Neubrander's results and the famous results for (ACP_1)
基金supported in part by the National Natural Science Foundation of China under grant No.11901506by the Shandong Province Natural Science Foundation under grant No.ZR2018QA003 and ZR2021MA010.
文摘.In this paper,a quadratic finite volume method(FVM)for parabolic problems is studied.We first discretize the spatial variables using a quadratic FVM to obtain a semi-discrete scheme.We then employ the backward Euler method and the Crank-Nicolson method respectively to further disctetize the time vatiable so as to derive two full-discrete schemes.The existence and uniqueness of the semi-discrete and full-discrete FVM solutions are established and their optimal error estimates are derived.Finally,we give numerical examples to illustrate the theoretical results.
文摘Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem.Traditionally,such analyses are performed using paper-and-pencil proofs and the results are sometimes validated using simulation techniques.These techniques are informal and thus may result in an inaccurate analysis.In this paper,we propose a formal technique for analyzing the expected time complexity of algorithms using higher-order-logic theorem proving.The approach calls for mathematically modeling the algorithm along with its inputs,using indicator random variables,in higher-order logic.This model is then used to formally reason about the expected time complexity of the underlying algorithm in a theorem prover.The paper includes the higher-order-logic formalization of indicator random variables,which are fundamental to the proposed infrastructure.In order to illustrate the practical effiectiveness and utilization of the proposed infrastructure,the paper also includes the analysis of algorithms for three well-known problems,i.e.,the hat-check problem,the birthday paradox and the hiring problem.
基金Supported by National Research Project "Nonlinear Sciences"
文摘A hierarchy of multidimensional Hénon-Heiles(M-H-H)systems are constructed via the x-and t_n-higher-order-constrained flows of KdV hierarchy.The Lax representation for the M-H-H hierarchy is determined from the adjoint representation of the auxiliary linear problem for the KdV hierarchy.By using the Lax representation the classical Poisson structure and r-matrix for the hierarchy are found and the Jacobi inversion problem for the hierarchy is constructed.
