首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
大家都很熟悉L’Hospital法则,其叙述和证明如下:设f(x)和F(x)满足如下条件:(2)在点的某空心邻域O<|x-a|<σ内,f(x)与F’(x)存在,且f’(x)≠0.证明因为x→a时,f(x),F(x)的极限与在x=a处的值没有关系,因此我们定义f(a)=F(a)=O,则应用Cauchy中值定理,可得:当x→a时,由于介于x和a之间,所以,故由条件(3)得从这个证明过程中,我们不容易发现在不存在(不包括无穷大)时,为什么L’Hospital法则就不能用?定义设x→a,5介于x和a之间,则称liing(Z)为x、a时g(x)的子极限。从I,Uospital法则的证…  相似文献   

3.
Summary Let {X t } be a 1 process with stationary independent increments and its Lévy measurev be given byv{yy>x}=x –L 1 (x), v{yy<–x}=x –L 2 (x) whereL 1,L 2 are slowly varying at 0 and and 0<1. We construct two types of a nondecreasing functionh(t) depending on 0<<1 or =1 such that lim inf a.s. ast 0 andt for some positive finite constantC.This research is partialy supported by a grant from Korea University  相似文献   

4.
5.
6.
Rational Arnoldi is a powerful method for approximating functions of large sparse matrices times a vector. The selection of asymptotically optimal parameters for this method is crucial for its fast convergence. We present and investigate a novel strategy for the automated parameter selection when the function to be approximated is of Cauchy–Stieltjes (or Markov) type, such as the matrix square root or the logarithm. The performance of this approach is demonstrated by numerical examples involving symmetric and nonsymmetric matrices. These examples suggest that our black-box method performs at least as well, and typically better, as the standard rational Arnoldi method with parameters being manually optimized for a given matrix.  相似文献   

7.
In this paper, we derive some condensed Cramer’s rules for the general solution, the least squares solution and the least norm solution to some restricted quaternion matrix equations, respectively. The findings of this paper extend some known results in the literature.  相似文献   

8.
李勇  汪民乐  杜萍 《大学数学》2012,28(3):123-127
将一元函数的L’Hospital法则推广到多元函数,为求多元函数极限提供了一个有效的方法,从而丰富了L’Hospital法则的内容,使应用范围更广泛.  相似文献   

9.
In this paper the generalized factorization for a class of 2×2 piecewise continuous matrix functions on is studied. Using a space transformation the problem is reduced to the generalized factorization of a scalar piecewise continuous function on a contour in the complex plane. Both canonical and non-canonical generalized factorization of the original matrix function are studied.Sponsored by J.N.I.C.T. (Portugal) under grant no. 87422/MATM  相似文献   

10.
In this paper we give an exponential lower bound for Cunningham’s least recently considered (round-robin) rule as applied to parity games, Markov decision processes and linear programs. This improves a recent subexponential bound of Friedmann for this rule on these problems. The round-robin rule fixes a cyclical order of the variables and chooses the next pivot variable starting from the previously chosen variable and proceeding in the given circular order. It is perhaps the simplest example from the class of history-based pivot rules. Our results are based on a new lower bound construction for parity games. Due to the nature of the construction we are also able to obtain an exponential lower bound for the round-robin rule applied to acyclic unique sink orientations of hypercubes (AUSOs). Furthermore these AUSOs are realizable as polytopes. We believe these are the first such results for history based rules for AUSOs, realizable or not. The paper is self-contained and requires no previous knowledge of parity games.  相似文献   

11.
Let P,Q, and R denote the Ramanujan Eisenstein series. We compute algebraic relations in terms of P(q i ) (i=1,2,3,4), Q(q i ) (i=1,2,3), and R(q i ) (i=1,2,3). For complex algebraic numbers q with 0<|q|<1 we prove the algebraic independence over ? of any three-element subset of {P(q),P(q 2),P(q 3),P(q 4)} and of any two-element subset of {Q(q),Q(q 2),Q(q 3)} and {R(q),R(q 2),R(q 3)}, respectively. For all the results we use some expressions of $P(q^{i_{1}}), Q(q^{i_{2}}) $ , and $R(q^{i_{3}}) $ in terms of theta constants. Computer-assisted computations of functional determinants and resultants are essential parts of our proofs.  相似文献   

12.
We present improvements of approximation formula for Wallis ratio related to a class of inequalities stated in [D.-J. Zhao, On a two-sided inequality involving Wallis’s formula, Math. Practice Theory, 34 (2004), 166-168], [Y. Zhao and Q. Wu, Wallis inequality with a parameter, J. Inequal. Pure Appl. Math., 7(2) (2006), Art. 56] and [C. Mortici, Completely monotone functions and the Wallis ratio, Applied Mathematics Letters, 25 (2012), 717-722]. Some sharp inequalities are obtained as a result of monotonicity of some functions involving gamma function.  相似文献   

13.
We prove an analogue of Sadullaev’s theorem concerning the size of the set where a maximal totally real manifold M can meet a pluripolar set. M has to be of class C 1 only. This readily leads to a version of Shcherbina’s theorem for C 1 functions f that are defined in a neighborhood of certain compact sets ${K\subset\mathbb{C}}We prove an analogue of Sadullaev’s theorem concerning the size of the set where a maximal totally real manifold M can meet a pluripolar set. M has to be of class C 1 only. This readily leads to a version of Shcherbina’s theorem for C 1 functions f that are defined in a neighborhood of certain compact sets K ì \mathbbC{K\subset\mathbb{C}}. If the graph Γ f (K) is pluripolar, then \frac?f?[`(z)]=0{\frac{\partial f}{\partial\bar z}=0} in the closure of the fine interior of K.  相似文献   

14.
对改进的L’Hospital法则提供了一个证明,所用的知识主要是函数极限的定义和柯西中值定理,而后又提供四个例子,作为改进的L’Hospital法则的应用.  相似文献   

15.
王秀英 《大学数学》2007,23(6):178-181
阐述了应用Stolz定理求数列极限时应注意的问题,并从Stolz定理与L’Hospital法则相互呼应的角度,指出了∞∞型的L’Hospital法则可改进为*∞型.这些工作,不但扩大了其应用范围,而且还给求极限带来许多方便.  相似文献   

16.
Büchi’s nth power problem asks is there a positive integer M such that any sequence ${(x_1^n,\ldots ,x_M^n)}$ of nth powers of integers with nth difference equal to n! is necessarily a sequence of nth powers of successive integers. In this paper, we study an analogue of this problem for meromorphic functions and algebraic functions.  相似文献   

17.
Mathematical Programming - The question whether the Simplex Algorithm admits an efficient pivot rule remains one of the most important open questions in discrete optimization. While many natural,...  相似文献   

18.
We extend some classical theorems in the theory of orthogonal polynomials on the unit circle to the matrix case. In particular, we prove a matrix analogue of Szeg?’s theorem. As a by-product, we also obtain an elementary proof of the distance formula by Helson and Lowdenslager.  相似文献   

19.
We investigate an mth-order discrete problem with additional conditions, described by m linearly independent linear functionals. We find the solution to this problem and present a formula and the existence condition of Green??s function if the general solution of a homogeneous equation is known. We obtain a relation between Green??s functions of two nonhomogeneous problems. It allows us to find Green??s function for the same equation, but with different additional conditions. The obtained results are applied to problems with nonlocal boundary conditions.  相似文献   

20.
In this paper we use basic properties of strongly convex functions to obtain new inequalities including Jensen type and Jensen–Mercer type inequalities. Applications for special means are pointed out as well. We also give a Jensen’s operator inequality for strongly convex functions. As a corollary, we improve the Hölder-McCarthy inequality under suitable conditions. More precisely we show that if \(Sp\left( A \right) \subset \left( 1,\infty \right) \), then
$$\begin{aligned} {{\left\langle Ax,x \right\rangle }^{r}}\le \left\langle {{A}^{r}}x,x \right\rangle -\frac{{{r}^{2}}-r}{2}\left( \left\langle {{A}^{2}}x,x \right\rangle -{{\left\langle Ax,x \right\rangle }^{2}} \right) ,\quad r\ge 2 \end{aligned}$$
and if \(Sp\left( A \right) \subset \left( 0,1 \right) \), then
$$\begin{aligned} \left\langle {{A}^{r}}x,x \right\rangle \le {{\left\langle Ax,x \right\rangle }^{r}}+\frac{r-{{r}^{2}}}{2}\left( {{\left\langle Ax,x \right\rangle }^{2}}-\left\langle {{A}^{2}}x,x \right\rangle \right) ,\quad 0<r<1 \end{aligned}$$
for each positive operator A and \(x\in \mathcal {H}\) with \(\left\| x \right\| =1\).
  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号