临界或超临界增长分数阶Schrodinger-Poisson方程正解的存在性

本文研究如下分数阶Schrodinger-Poisson方程{(-△)^su+Vx(u)+K(x)φu=f(u)+λ|u|^q-2ux∈R³,(-△)^tφ=K(x)u²,x∈R³其中S∈(3/4,1),t∈(0,1),f是在原点超线性无穷远次临界的连续非线性项,指数q≥2_s^*=6/3-2x.当λ>0充分小时,我们利用变分方法证明上述问题正解的存在性.本文的主要贡献是处理了超临界情形.     

一类广义变分不等式组的隐迭代算法

依赖于投影映射的性质,许多学者在Hilbert空间研究了具不同映射的变分不等式组解的逼近问题,但在Banach空间的研究比较少.其主要原因是因为在Banach空间投影映射缺乏很好的性质.本文利用向阳非扩张保核映射(the sunny nonexpansiveretraction mapping)Q_K的性质,导出了一种隐迭代方法.用这一方法,本文的结果把[M.A.Noor,K.I.Noor,Projection algorithms for solving a system of generalvariational inequalities,Nonlinear Analysis,70(2009)2700-2706]的主要成果从Hilbert空间推广到了Banach空间.     

Banach空间中Mann迭代和Ishikawa迭代的等价性问题

用不同于已有的方法证明了任意实Banach空间中一致Lipschitz强连接伪压缩算子在具误差的修正的Mann迭代和具误差的修正的Ishikawa迭代下收敛和稳定的等价性,其中迭代参数{βn}仅需lim sup n→∞βn〈k/L（L＋1）,这推广和改进了目前需假设lim n→∞ βn=0和两迭代程序初始点的取值需相同条件下的已有结果.     

On the numerical determination of optimal inputs

The design of optimal inputs for linear and nonlinear system identification involves the maximization of a quadratic performance index subject to an input energy constraint. In the classical approach, a Lagrange multiplier is introduced whose value is an unknown constant. In recent papers, the Lagrange multiplier has been determined by plotting a curve of the Lagrange multiplier as a function of the critical interval length or a curve of input energy versus the interval length. A new approach is presented in this paper in which the Lagrange multiplier is introduced as a state variable and evaluated simultaneously with the optimal input. Numerical results are given for both a linear and a nonlinear dynamic system.     

New general convergence theory for iterative processes and its applications to Newton–Kantorovich type theorems

Let T:D⊂X→X$T:D\subset X\to X$ be an iteration function in a complete metric space X$X$. In this paper we present some new general complete convergence theorems for the Picard iteration _xn+1=T_xn$x_{n+1}=T{x}_n$ with order of convergence at least r≥1$r\ge 1$. Each of these theorems contains a priori and a posteriori error estimates as well as some other estimates. A central role in the new theory is played by the notions of a function of initial conditions   of T$T$ and a convergence function   of T$T$. We study the convergence of the Picard iteration associated to T$T$ with respect to a function of initial conditions E:D→X$E:D\to X$. The initial conditions in our convergence results utilize only information at the starting point _x0$x_0$. More precisely, the initial conditions are given in the form E(_x0)∈J$E\left(x_0\right)\in J$, where J$J$ is an interval on _R+${\mathbb{R}}_{+}$ containing 0. The new convergence theory is applied to the Newton iteration in Banach spaces. We establish three complete ω$\omega$-versions of the famous semilocal Newton–Kantorovich theorem as well as a complete version of the famous semilocal α$\alpha$-theorem of Smale for analytic functions.     

Doubly Periodic Wave Solutions of Jaulent-Miodek Equations Using Variational Iteration Method Combined with Jacobian-function Method

One of the advantages of the variational iteration method is the free choice of initial guess. In this paper we use the basic idea of the Jacobian-function method to construct a generalized trial function with some unknown parameters. The Jaulent-Miodek equations are used to illustrate effectiveness and convenience of this method, some new explicit exact travelling wave solutions have been obtained, which include bell-type soliton solution, kink-type soliton solutions, solitary wave solutions, and doubly periodic wave solutions.     

Design of quantum VQ iteration and quantum VQ encoding algorithm taking O（√N） steps for data compression

Vector quantization (VQ) is an important data compression method. The key of the encoding of VQ is to find the closest vector among N vectors for a feature vector. Many classical linear search algorithms take $O(N)$ steps of distance computing between two vectors. The quantum VQ iteration and corresponding quantum VQ encoding algorithm that takes $O(\sqrt N )$ steps are presented in this paper. The unitary operation of distance computing can be performed on a number of vectors simultaneously because the quantum state exists in a superposition of states. The quantum VQ iteration comprises three oracles, by contrast many quantum algorithms have only one oracle, such as Shor's factorization algorithm and Grover's algorithm. Entanglement state is generated and used, by contrast the state in Grover's algorithm is not an entanglement state. The quantum VQ iteration is a rotation over subspace, by contrast the Grover iteration is a rotation over global space. The quantum VQ iteration extends the Grover iteration to the more complex search that requires more oracles. The method of the quantum VQ iteration is universal.     

非制冷红外焦平面无效像元识别与实时补偿

非制冷红外焦平面阵列(UFPA)不可避免地存在无效像元, 这对UFPA的成像效果造成了极坏的影响。为解决这一问题, 在分析并总结各种非制冷红外焦平面无效像元识别算法优缺点的基础上, 提出一种新的无效像元识别与实时补偿方法。根据像元响应特性, 采用循环迭代法以搜索最优的无效像元判别阈值, 并据此标识出无效像元的位置。在硬件实现阶段, 对于M×N的UFPA器件, 在任意采样时刻, 利用移位寄存器保存当前采样点之前的M个响应值, 使其输出可实时更新为与采样点同列的上一个数据; 同时, 利用一般的寄存器实时保存与采样点同行的前一个数据, 采用同帧行列间内插法实现无效像元的实时补偿。该算法有效地解决了无效像元识别阈值选取困难及不易实时补偿的问题。针对320×240的UFPA器件, 该算法在基于FPGA的红外图像处理系统上得以实时实现, 成功地消除了无效像元对UFPA成像效果的影响。     

轴对称非静态电荷电流分布轴外场的交替迭代

在轴对称非静态电荷电流分布的情况下,利用麦克斯韦方程组和轴对称性,给出了计算轴外电磁场的交替迭代法.     

风险企业的委托-代理模型

传统的委托—代理理论在解释风险企业家的行为时遇到了困难。通过对传统的委托—代理理论进行重新构造和拓展，本提出逆反努力法则，验证了隐藏行动的道德风险的存在，并通过Newton迭代法和图形学方法对风险企业家的长期努力水平进行计算，发现努力水平对努力效应指数n表现出协同效应。