关于一类半线性高阶障碍问题解的存在性与正则性

本文考虑一类带互补边界条件的四阶半线性椭圆型变分不等式,应用临界点理论,证明了当半线性项具有超线性增长时解的存在性,并利用L~p估计得到了解的正则性.     

一类二阶非自治Hamilton系统的周期解

在线性增长和次线性增长条件下,利用临界点理论中的极小作用原理和鞍点定理,研究了二阶非自治Hamilton系统周期解的存在性问题,获得了一些新的可解性条件．     

用线性弱正算子逼近

用线性正算子的逼近理论飞速发展,但正性是一个较强的限制,孙永生,王仁宏等研究过减弱正性限制,作者研究用线性弱正算子逼近,推广Korovkin定理和Grundmann定理等等.     

时间尺度上二阶线性动力学方程的一般解与Ulam稳定性

本文利用参数变易法研究了时间尺度上二阶变系数线性动力学方程的解与Ulam稳定性问题. 特别地,在不同的系数情形下建立了二阶常系数线性动力学方程的Ulam稳定性理论.     

一类脉冲分数阶半线性泛函微分方程的弱解的存在性

在本文中,我们通过利用线性算子的解析半群理论和不动点定理对一类脉冲分数阶半线性泛函微分方程的弱解的存在性进行讨论．     

张量空间上的线性互补问题

借助于一类张量收缩积,本文定义一类张量空间上的线性互补问题,简称张量线性互补问题.当所涉及的张量变量退化为向量时,所考虑的问题退化为经典的线性互补问题.对此,首先讨论张量收缩积的一些性质,然后建立张量线性互补问题的理论与算法.具体地,讨论张量线性互补问题的等价模型、可行性与可解性理论、解集的凸性等,提出一个求解张量线性互补问题的外梯度算法,在一定条件下证明算法的收敛性,并给出初步的数值实验结果.     

一类Kirchhoff型p(t)-Laplace系统的无穷多周期解北大核心CSCD

利用变指数Sobolev空间理论和临界点理论,研究Kirchhoff型p(t)-Laplace系统的周期解.当非线性项在零点附近次线性或在无穷远处超线性增长时,得到了此类系统无穷多个周期解的存在性.     

二阶线性发展方程初值问题的某些推广

本文用压缩半群理论讨论了二阶线性发展方程组的初值问题;还用解析半群讨论了一类变系数的二阶线性发展方程的初值问题,使这一类初值问题的可解性与含t的算子的一阶线性发展方程解的理论统一起来,这是数学力学中的一类重要方程。     

一类二阶退化半线性椭圆型方程边值问题的适定性及解的正则性

本文考虑一类二阶退化半线性椭圆型方程边值问题.由椭圆正则化方法建立能量不等式,利用紧性推理,Banach—Saks定理,弱解与强解一致性,解常微分方程,椭圆型方程正则性定理,迭代方法.极值原理和Fredholm—Riesz-Schauder理论,可得相应线性问题适定性及解的高阶正则性;再由Moser引理和Banach不动点定理可得半线性问题解的存在性.这类问题与几何中无穷小等距形变刚性问题密切相关,其高阶正则性解的存在性对几何应用尤为重要.     

2p和2q阶微分方程组正解的存在性

利用拓扑度乘积理论研究2p和2q阶非线性高阶微分方程组边值问题,通过相应的线性问题的第一特征值和拓扑度乘积理论建立了其正解的存在性定理,给出了利用特征值刻划的较为本质的结果,且突破了以往文献要求的方程组同阶和非线性项同是次线性或超线性的要求.     

Sparse Dynamic Programming for Longest Common Subsequence from Fragments

Sparse Dynamic Programming has emerged as an essential tool for the design of efficient algorithms for optimization problems coming from such diverse areas as computer science, computational biology, and speech recognition. We provide a new sparse dynamic programming technique that extends the Hunt–Szymanski paradigm for the computation of the longest common subsequence (LCS) and apply it to solve the LCS from Fragments problem: given a pair of strings X and Y (of length n and m, respectively) and a set M of matching substrings of X and Y, find the longest common subsequence based only on the symbol correspondences induced by the substrings. This problem arises in an application to analysis of software systems. Our algorithm solves the problem in O(|M| log |M|) time using balanced trees, or O(|M| log log min(|M|, nm/|M|)) time using Johnson's version of Flat Trees. These bounds apply for two cost measures. The algorithm can also be adapted to finding the usual LCS in O((m + n) log |Σ| + |M| log |M|) time using balanced trees or O((m + n) log |Σ| + |M| log log min (|M|, nm/|M|)) time using Johnson's version of Flat Trees, where M is the set of maximal matches between substrings of X and Y and Σ is the alphabet. These bounds improve on those of the original Hunt–Szymanski algorithm while retaining the overall approach.     

非线性奇异边值问题的正解

该文利用锥上的不动点定理, 在较弱的条件下,讨论了非线性Sturm-Liouville方程奇异边值问题正解的存在性, 并获得了当特征值λ在某一范围内取值时, 边值问题至少存在一个正解的结论.作者的结果包含推广并改进了许多已知的结果。     

A GPU-based algorithm for efficient LES of high Reynolds number flows in heterogeneous CPU/GPU supercomputers

Αn optimized MPI+OpenACC implementation model that performs efficiently in CPU/GPU systems using large-eddy simulation is presented. The code was validated for the simulation of wave boundary-layer flows against numerical and experimental data in the literature. A direct Fast-Fourier-Transform-based solver was developed for the solution of the Poisson equation for pressure taking advantage of the periodic boundary conditions. This solver was optimized for parallel execution in CPUs and outperforms by 10 times in computational time a typical iterative preconditioned conjugate gradient solver in GPUs. In terms of parallel performance, an overlapping strategy was developed to reduce the overhead of performing MPI communications using GPUs. As a result, the weak scaling of the algorithm was improved up to 30%. Finally, a large-scale simulation (Re = 2 × 10⁵) using a grid of 4 × 10⁸ cells was executed, and the performance of the code was analyzed. The simulation was launched using up to 512 nodes (512 GPUs + 6144 CPU-cores) on one of the current top 10 supercomputers of the world (Piz Daint). A comparison of the overall computational time showed that the GPU version was 4.2 times faster than the CPU one. The parallel efficiency of this strategy (47%) is competitive compared with the state-of-the-art CPU implementations, and it has the potential to take advantage of modern supercomputing capabilities.     

2族3 -紧优的有向双环网络无限族

该文给出一种寻找k -紧优的双环网络无限族(k>=0)的方法, 利用此方法得到了2族3 -紧优的有向双环网络无限族     

删失数据下单指标模型的经验似然推断

考虑删失数据下单指标模型, 研究了模型中参数的经验似然推断, 证明了所提出的调整的经验对数似然比渐近于卡方分布, 由此构造相应兴趣参数的置信域. 进一步, 由于模型中参数向量的范数等于1,利用该约束条件来降低参数的维数, 从而增加置信域的精度.模拟研究比较了经验似然方法和正态逼近方法的有限样本性质,从置信域的面积和覆盖概率两方面进行了比较,模拟结果表明经验似然方法优于正态逼近方法.     

Optimal solutions of a (3 + 1)-dimensional B-Kadomtsev-Petviashvii equation

We explored and specialized new Lie infinitesimals for the (3 + 1)-dimensional B-Kadomtsev-Petviashvii (BKP) using the commutation product, which results a system of nonlinear ODEs manually solved. Through two stages of Lie symmetry reduction, (3 + 1)-dimensional BKP equation is reduced to nonsolvable nonlinear ODEs using various combinations of optimal Lie vectors. Using the integration and Riccati equation methods, we investigate new analytical solutions for these ODEs. Back substituting to the original variables generates new solutions for BKP. Some selected solutions illustrated through three-dimensional plots.     

h-可积条件下混合随机阵列的Lr收敛性

在h-可积的条件下,利用(ρ)混合、(Ψ)混合序列矩不等式和截尾法,探讨了(ρ)混合、(Ψ)混合阵列行和的Lr收敛性,获得了一些新结果并推广了有关结论.     

Magneto-Sensitive Elastomers: An Experimental Point of View

Magneto-sensitive elastomers (MSEs) are smart materials changing their shape and mechanical properties in the presence of a magnetic field. Focussing on model systems, silicone based MSEs are prepared by a multi-step mixing process and characterised using a rotational rheometer (plate-plate). Data obtained by relaxation tests is used to set-up a material model coupling the theories of viscoelasticity and magnetoelasticity. The behaviour of MSEs in quasi-static and dynamic mechanical shear experiments can be successfully predicted by the analytical model using parameters received by fitting the transient experiments. The model is validated for small shear deformations (γ = 0.02) and low magnetic fields (𝔹 = 0.2 T). (© 2014 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

The minimax approach for a class of variable order fractional differential equation

This paper introduces an approximate solution for Liouville‐Caputo variable order fractional differential equations with order 0 < α(t) ≤ 1 . The solution is adapted using a family of fractional‐order Chebyshev functions with unknown coefficients. These coefficients have been obtained by using an optimization approach based on minimax technique and the least pth optimization function. Several linear and nonlinear fractional‐order differential equations are discussed using the proposed technique for fixed and variable order fractional‐order derivatives. Moreover, the response of RC charging circuit with variable order fractional capacitor is studied for different cases. Several comparisons with related published techniques have been added to illustrate the accuracy of the proposed approach.     

Inexact Newton-type methods

We introduce the new idea of recurrent functions to provide a semilocal convergence analysis for an inexact Newton-type method, using outer inverses. It turns out that our sufficient convergence conditions are weaker than in earlier studies in many interesting cases (Argyros, 2004 [5] and [6], Argyros, 2007 [7], Dennis, 1971 [14], Deuflhard and Heindl, 1979 [15], Gutiérrez, 1997 [16], Gutiérrez et al., 1995 [17], Häubler, 1986 [18], Huang, 1993 [19], Kantorovich and Akilov, 1982 [20], Nashed and Chen, 1993 [21], Potra, 1982 [22], Potra, 1985 [23]).