For p ：〉 1, many improved or generalized results of the well-known Hardy＇s inequality have been established： In this paper, by means of the weight coefficient method, we establish the following Hardy type inequali...For p ：〉 1, many improved or generalized results of the well-known Hardy＇s inequality have been established： In this paper, by means of the weight coefficient method, we establish the following Hardy type inequality for p = -1：∑^n i=1（1/i∑^i j=1 aj）^-1〈∑^n i=1（1-π^2-9/3i）ai^-1,where ai 〉 0, i = 1,2,... ,n. For any fixed positive integer n 〉 2, we study the best constant Cn such that the inequality ∑^ni=1（1/i∑^ij=1aj）^-1≤cn∑^ni=1ai^-1holds. Moreover, by means ofthe Mathematica software, we givesome examples.展开更多
This paper proved the following three facts about the Lipschitz continuous property of Bernstein polynomials and Bezier nets defined on a triangle: suppose f(P) is a real valued function defined on a triangle T, (1) I...This paper proved the following three facts about the Lipschitz continuous property of Bernstein polynomials and Bezier nets defined on a triangle: suppose f(P) is a real valued function defined on a triangle T, (1) If f(P) satisfies Lipschitz continuous condition, i. e. f(P)∈Lip4α, then the corresponding Bernstein Bezier net fn∈LipAsecαψα, here ψ is the half of the largest angle of triangle T; (2) If Bernstein Bezier net fn∈ LipBα, then its elevation Bezier net Efn∈LipBα; and (3) If f(P)∈Lipαa, then the corresponding Bernstein polynomials Bn(f;P)∈LipAsecαψα, and the constant Asecαψ best in some sense.展开更多
A set of methods for interprocedural analysis is proposed. First, an ap-proach for interprocedural constant propagation is given. Then the concept of constant propagation is extended so as to meet the needs of data de...A set of methods for interprocedural analysis is proposed. First, an ap-proach for interprocedural constant propagation is given. Then the concept of constant propagation is extended so as to meet the needs of data dependence analysis. Besides certain constant, constant range can also be propagated. The related propagating rules are introduced, and an idea for computing Return function is given. This approach can solve almost all interprocedural constant propagation problems with non-recursive calls. Second, a muItiple-version par-allelizing technique is also proposed for alias problem. The work related to this paper has been implemented on a shared-memory parallel computer.展开更多
基金Foundation item： the National Natural Science Foundation of China （No. 10671136） the Natural Science Foundation of Sichuan Provincial Education Department （No. 2005A201）.
文摘For p ：〉 1, many improved or generalized results of the well-known Hardy＇s inequality have been established： In this paper, by means of the weight coefficient method, we establish the following Hardy type inequality for p = -1：∑^n i=1（1/i∑^i j=1 aj）^-1〈∑^n i=1（1-π^2-9/3i）ai^-1,where ai 〉 0, i = 1,2,... ,n. For any fixed positive integer n 〉 2, we study the best constant Cn such that the inequality ∑^ni=1（1/i∑^ij=1aj）^-1≤cn∑^ni=1ai^-1holds. Moreover, by means ofthe Mathematica software, we givesome examples.
基金Supported by NSF and SF of National Educational Committee
文摘This paper proved the following three facts about the Lipschitz continuous property of Bernstein polynomials and Bezier nets defined on a triangle: suppose f(P) is a real valued function defined on a triangle T, (1) If f(P) satisfies Lipschitz continuous condition, i. e. f(P)∈Lip4α, then the corresponding Bernstein Bezier net fn∈LipAsecαψα, here ψ is the half of the largest angle of triangle T; (2) If Bernstein Bezier net fn∈ LipBα, then its elevation Bezier net Efn∈LipBα; and (3) If f(P)∈Lipαa, then the corresponding Bernstein polynomials Bn(f;P)∈LipAsecαψα, and the constant Asecαψ best in some sense.
文摘A set of methods for interprocedural analysis is proposed. First, an ap-proach for interprocedural constant propagation is given. Then the concept of constant propagation is extended so as to meet the needs of data dependence analysis. Besides certain constant, constant range can also be propagated. The related propagating rules are introduced, and an idea for computing Return function is given. This approach can solve almost all interprocedural constant propagation problems with non-recursive calls. Second, a muItiple-version par-allelizing technique is also proposed for alias problem. The work related to this paper has been implemented on a shared-memory parallel computer.
