三阶泛函微分方程的周期解

利用Brouwer度理论得到了泛函微分方程x′″（t） ∑i=0^2[αix(i)(t) bix(i)(t-τi)] g1(x(t)) g2(x(t-τ））=p（t）存在2π周期解的充分性条件，推广了[1]中的有关结果．     

非线性二阶中立型时滞微分方程正解的存在性

考虑非线性二阶中立型微分方程,[a(t)x(t)-∑ from i=1 to m (p_i(t)x(τi(t)))]″-∫from n=a to b (f(t,ξ,x[g(t,ξ)])dσ(ξ))=0,t≥t_0,和相应不等式[a(t)x(t)-∑ from i=1 to m (p_i(t)x(τi(t)))]″-∫from n=a to b (f(t,ξ,x[g(t,ξ)])dσ(ξ))≥0,t≥t_0.存在正解是相互等价的.其中a(t),pi(t)∈C([t0,∞),R+),a(t)>0,τi(t)∈C(R~+,R~+),τi(t)t,limt→∞τi(t)=∞(i=1,2,…,m).g(t,ξ)∈C([t_0,∞)×[a,b],R+).g(t,ξ)是分别关于t和ξ的增函数.g(t,ξ)t,ξ∈[a,b],limt→∞,ξ∈[a,b]g(t,ξ)=∞.f(t,ξ,x)∈C([t_0,∞)×[a,b]×R,R+).当x>0时,xf(t,ξ,x)>0.σ(ξ)∈C([a,b],R),且σ(ξ)非减.     

非线性弦振动方程

1.问题和主要结果我们研究方程(Ⅰ)(?)非平凡周期解的存在性,这里(x,t)∈Ω={0ξg(x,t,ξ),(?)ξ∈(—r,r),ξ≠0.[g_3](?)(x,t,ξ)/ξ=+∞,对(x,t)∈Ω一致成立.注 如 g=ξ~α,0<α<1,所有这些假设满足。     

二阶中立型泛函微分方程的振动性

本文获得了一类具连续偏差变元的二阶中立型泛函微分方程[a(t)b(x(t))h((x(t) p(t)x(τ(t)))′]′] ∫baF(t,ξ,x[g(t,ξ)])dσ(ξ)=0振动的充分条件     

一类非线性高阶中立型方程的振动定理

本文对于一类具有连续分布滞量的高阶中立型微分方程dndtn[x( t) +c( t) x( t-τ) ]+∫baf ( t,ξ,x[g( t,ξ) ]) dσ(ξ) =0 ( 1 )进行讨论 ,得到了方程 ( 1 )的若干振动准则 .     

二阶拟线性中立型时滞微分方程的振动性

考虑二阶中立型时滞微分方程[a(t)|(x(t) p(t)x(t-τ)）′|^α-1(x(t) p(t)x(t-τ））′]′ f(t,x(t-σ））=0(E)其中α，τ，σ是非负常数，a(t),p(t)∈C([t0,∞），R），f(t,x)∈C(R,R)。建立了方程（E）的一些新的振动条件。     

TYPES AND CRITERIA OF NONOSCILLATORY SOLUTIONS FOR SOME SECOND ORDER NFDE

In this paper we discuss the following NFDE[r(t)[x(t)-cx(t-τ)]′]′ integral from a to b p(t,ξ)x[g(t,ξ)]dσ(ξ)=0where τ>0,1>c≥0,0≤g(t,ξ)≤t,r(t)>0,p(t,ξ)>0,and some sufficient and necessary conditionsare given,under which there are three types of nonoscillatory solutions for the above equation.     

具有变系数的二阶中立型差分方程

研究一类具有变系数的二阶中立型时滞差分方程 △τ^2[x（t）-c（t）x（t-τ）]=p（t）x（t-σ），t≥t0〉0 的解的振动性，给出了该类方程一切有界解振动的几个充分条件．     

一类高阶周期线性微分方程解的性质及复振荡

本文对一类超越型高阶周期线性微分方程解的性质及复振荡证明了：设B（ξ）=g1(1/ξ） g2(ξ），其中g1(t)和g2(t)是整函数，以及g1(t)(或g2(t))是超越的且级小于1／2。令A(z)=B(e^z)。（i)如果方程ω^(k) A(z)ω=0(k≥3)有解f(z)≡0满足log^ N(r,1/F)=0(γ），则f(z)和f(z 2πi)线性相关；（ii)如果B（ξ）在ξ＝∞（或相应地在ξ≠0）有一p阶极点，p不被整除，则前方程的任一解f(z)≠0的零收敛指数都是无究，且更强的结论log^ N(r,1/f)≠0（γ）成立。     

几类半线性椭圆共振问题

设Ω∪→R^n是一个有界正则区域，{λk}是－△在H0（Ω）上的一列特征值。假定对某个给定的k，λk是单重的，φ为其相应的特征函数，∫φ^2=1，固定h∈H^-1使∫hφ=0。对于方程（P1）{－△u-λu g（x，u）=tφ h，u=0。σΩ本文利用连通技巧和闭联集理论，推广了文[1]、[3]、[4]中的一些结果。我们获得定理1 假设g:R^*→R满足（g1）g是具有周期原函数的连续周期函数，λk（k≥）简单。如果对任意s ∈R，有（H′4{λk-1≤λ g′（s）≤λk 1k＞1。const≤λ g′（s）≤λ2。则任意h∈H^1,E←τ1,τ2∈R。τ1≤0≤τ2使（i）（P1）有解当且仅当t∈[τ1,τ2]。(ii)如果t∈[τ1,τ2]－{0}，则（P1）至少有两个不同的解。定理2 假设（H′4）成立，λk简单，g满足（H2）任意s，g按x在Ω上可测；g∈C^1对a.e.x∈Ω。（H5）g有界limsg(x,s)=μ＞0。|s|→∞则任意h∈H′0, E←τ1,τ2∈R，τ1＜0＜τ2使（i）（P1）有解当且仅当t∈[τ1,τ2]。（ii）若t∈[τ1,τ2]－{0}，则（Pt）至少有两个不同的解。定理3 [3,prop.2.4]中的条件q＜v（-△-λkI）换成q≤v（-△-λkI）结论仍然成立。     

Graphical Diagnostics for Markov Models for Categorical Data

Markov models are widely used as a method for describing categorical data that exhibit stationary and nonstationary autocorrelation. However, diagnostic methods are a largely overlooked topic for Markov models. We introduce two types of residuals for this purpose: one for assessing the length of runs between state changes, and the other for assessing the frequency with which the process moves from any given state to the other states. Methods for calculating the sampling distribution of both types of residuals are presented, enabling objective interpretation through graphical summaries. The graphical summaries are formed using a modification of the probability integral transformation that is applicable for discrete data. Residuals from simulated datasets are presented to demonstrate when the model is, and is not, adequate for the data. The two types of residuals are used to highlight inadequacies of a model posed for real data on seabed fauna from the marine environment.

Supplemental materials, including an R-package RMC with functions to perform the diagnostic measures on the class of models considered in this article, are at the journal’s website. The R-package is also available at CRAN.     

Polytope Lyapunov Functions for Stable and for Stabilizable LSS

We present a new approach for constructing polytope Lyapunov functions for continuous-time linear switching systems (LSS). This allows us to decide the stability of LSS and to compute the Lyapunov exponent with a good precision in relatively high dimensions. The same technique is also extended for stabilizability of positive systems by evaluating a polytope concave Lyapunov function (“antinorm”) in the cone. The method is based on a suitable discretization of the underlying continuous system and provides both a lower and an upper bound for the Lyapunov exponent. The absolute error in the Lyapunov exponent computation is estimated from above and proved to be linear in the dwell time. The practical efficiency of the new method is demonstrated in several examples and in the list of numerical experiments with randomly generated matrices of dimensions up to 10 (for general linear systems) and up to 100 (for positive systems). The development of the method is based on several theoretical results proved in the paper: the existence of monotone invariant norms and antinorms for positively irreducible systems, the equivalence of all contractive norms for stable systems and the linear convergence theorem.     

Monotonicity criteria for difference schemes designed for hyperbolic equations

Previously formulated monotonicity criteria for explicit two-level difference schemes designed for hyperbolic equations (S.K. Godunov’s, A. Harten’s (TVD schemes), characteristic criteria) are extended to multileveled, including implicit, stencils. The characteristic monotonicity criterion is used to develop a universal algorithm for constructing high-order accurate nonlinear monotone schemes (for an arbitrary form of the desired solution) based on their analysis in the space of grid functions. Several new fourth-to-third-order accurate monotone difference schemes on a compact three-level stencil and nonexpanding (three-point) stencils are proposed for an extended system, which ensures their monotonicity for both the desired function and its derivatives. The difference schemes are tested using the characteristic monotonicity criterion and are extended to systems of hyperbolic equations.     

Polynomial cost for solving IVP for high-index DAE

We show that the cost of solving initial value problems for high-index differential algebraic equations is polynomial in the number of digits of accuracy requested. The algorithm analyzed is built on a Taylor series method developed by Pryce for solving a general class of differential algebraic equations. The problem may be fully implicit, of arbitrarily high fixed index and contain derivatives of any order. We give estimates of the residual which are needed to design practical error control algorithms for differential algebraic equations. We show that adaptive meshes are always more efficient than non-adaptive meshes. Finally, we construct sufficiently smooth interpolants of the discrete solution. AMS subject classification (2000) 34A09, 65L80, 68Q25     

Direct solution method for the equilibrium problem for elastic stents

We are interested in numerical methods for approximating vector‐valued functions on a metric graph. As a model problem, we formulate and analyze a numerical method for the solution of the stationary problem for the one‐dimensional elastic stent model. The approximation is built using the mixed finite element method. The discretization matrix is a symmetric saddle‐point matrix, and we discuss sparse direct methods for the fast and robust solution of the associated equilibrium system. The convergence of the numerical method is proven and the error estimate is obtained. Numerical examples confirm the theoretical estimates.     

Projection Method for Cauchy Problem for an Operator-Differential Equation

In the current paper, we study a projection method for a Cauchy problem for an operator-differential equation with a leading self-adjoint operator A(t) and a subordinate linear operator K(t) in a Hilbert space. The projection subspaces are linear spans of eigenvectors of an operator similar to A(t). It is assumed that the operators A(t) and K(t) are sufficiently smooth. Error estimates for the approximate solutions and their derivatives are obtained. The application of the developed method for solving the initial boundary value problems is given.     

Construction algorithms for polynomial lattice rules for multivariate integration

We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.

We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.

We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.

     

Basin attractors for various methods for multiple roots

There are several methods for approximating the multiple zeros of a nonlinear function when the multiplicity is known. The methods are classified by the order, informational efficiency and efficiency index. Here we consider other criteria, namely the basin of attraction of the method and its dependence on the order. We discuss all known methods of orders two to four and present the basin of attraction for several examples.     

Prosessdataenhet for GIER

The paper describes a new analog-to-digital linkage system for the GIER digital computer, intended for real time data processing and control. The system comprises a peripheral unit with several analog and digital input/output channels, and an automatic program interrupt feature. The development work has been carried out as a joint effort by Regnecentralen, the Danish Institute for Computing Machinery and the Division of Automatic Control at the Technical University of Norway.