首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
3.
4.
We present an approximation method of circular arcs using linear-normal (LN) Bézier curves of even degree, four and higher. Our method achieves GmGm continuity for endpoint interpolation of a circular arc by a LN Bézier curve of degree 2m  , for m=2,3m=2,3. We also present the exact Hausdorff distance between the circular arc and the approximating LN Bézier curve. We show that the LN curve has an approximation order of 2m+22m+2, for m=2,3m=2,3. Our approximation method can be applied to offset approximation, so obtaining a rational Bézier curve as an offset approximant. We derive an algorithm for offset approximation based on the LN circle approximation and illustrate our method with some numerical examples.  相似文献   

5.
In this paper, we give some necessary and sufficient conditions for the existence of Re-nnd and nonnegative definite {1,3}{1,3}- and {1,4}{1,4}-inverses of a matrix A∈Cn×nACn×n and completely described these sets. Moreover, we prove that the existence of nonnegative definite {1,3}{1,3}-inverse of a matrix A   is equivalent with the existence of its nonnegative definite {1,2,3}{1,2,3}-inverse and present the necessary and sufficient conditions for the existence of Re-nnd {1,3,4}{1,3,4}-inverse of A.  相似文献   

6.
This paper is devoted to a problem of finding the smallest positive integer s(m,n,k)s(m,n,k) such that (m+1)(m+1) generic skew-symmetric (k+1)(k+1)-forms in (n+1)(n+1) variables as linear combinations of the same s(m,n,k)s(m,n,k) decomposable skew-symmetric (k+1)(k+1)-forms.  相似文献   

7.
8.
The dimension of a point x   in Euclidean space (meaning the constructive Hausdorff dimension of the singleton set {x}{x}) is the algorithmic information density of x  . Roughly speaking, this is the least real number dim(x)dim(x) such that r×dim(x)r×dim(x) bits suffice to specify x   on a general-purpose computer with arbitrarily high precision 2−r2r. The dimension spectrum of a set X   in Euclidean space is the subset of [0,n][0,n] consisting of the dimensions of all points in X.  相似文献   

9.
For an algebraically closed field FF, we show that any matrix polynomial P(λ)∈F[λ]n×mP(λ)F[λ]n×m, n?mn?m, can be reduced to triangular form, preserving the degree and the finite and infinite elementary divisors. We also characterize the real matrix polynomials that are triangularizable over the real numbers and show that those that are not triangularizable are quasi-triangularizable with diagonal blocks of sizes 1×11×1 and 2×22×2. The proofs we present solve the structured inverse problem of building up triangular matrix polynomials starting from lists of elementary divisors.  相似文献   

10.
Let KK be a closed convex subset of a qq-uniformly smooth separable Banach space, T:K→KT:KK a strictly pseudocontractive mapping, and f:K→Kf:KK an LL-Lispschitzian strongly pseudocontractive mapping. For any t∈(0,1)t(0,1), let xtxt be the unique fixed point of tf+(1-t)Ttf+(1-t)T. We prove that if TT has a fixed point, then {xt}{xt} converges to a fixed point of TT as tt approaches to 0.  相似文献   

11.
We show that for each p∈(0,1]p(0,1] there exists a separable p  -Banach space GpGp of almost universal disposition, that is, having the following extension property: for each ε>0ε>0 and each isometric embedding g:X→Yg:XY, where Y is a finite-dimensional p-Banach space and X   is a subspace of GpGp, there is an ε  -isometry f:Y→Gpf:YGp such that x=f(g(x))x=f(g(x)) for all x∈XxX.  相似文献   

12.
13.
Let FF be an infinite field with characteristic not equal to two. For a graph G=(V,E)G=(V,E) with V={1,…,n}V={1,,n}, let S(G;F)S(G;F) be the set of all symmetric n×nn×n matrices A=[ai,j]A=[ai,j] over FF with ai,j≠0ai,j0, i≠jij if and only if ij∈EijE. We show that if G is the complement of a partial k  -tree and m?k+2m?k+2, then for all nonsingular symmetric m×mm×m matrices K   over FF, there exists an m×nm×n matrix U   such that UTKU∈S(G;F)UTKUS(G;F). As a corollary we obtain that, if k+2?m?nk+2?m?n and G is the complement of a partial k-tree, then for any two nonnegative integers p and q   with p+q=mp+q=m, there exists a matrix in S(G;R)S(G;R) with p positive and q negative eigenvalues.  相似文献   

14.
In the present paper we consider the Volterra integration operator V   on the Wiener algebra W(D)W(D) of analytic functions on the unit disc DD of the complex plane CC. A complex number λλ is called an extended eigenvalue of V if there exists a nonzero operator A   satisfying the equation AVVAAV=λVA. We prove that the set of all extended eigenvalues of V   is precisely the set C?{0}C?{0}, and describe in terms of Duhamel operators and composition operators the set of corresponding extended eigenvectors of VV. The similar result for some weighted shift operator on ?p?p spaces is also obtained.  相似文献   

15.
Let (X,d,μ)(X,d,μ) be a complete, locally doubling metric measure space that supports a local weak L2L2-Poincaré inequality. We show that optimal gradient estimates for Cheeger-harmonic functions imply local isoperimetric inequalities.  相似文献   

16.
17.
18.
In this article we derive differential recursion relations for the Laguerre functions on the cone ΩΩ of positive definite real matrices. The highest weight representations of the group Sp(n,R)Sp(n,R) play a fundamental role. Each such representation acts on a Hilbert space of holomorphic functions on the tube domain Ω+iSym(n,R)Ω+iSym(n,R). We then use the Laplace transform to carry the Lie algebra action over to L2(Ω,dμν)L2(Ω,dμν). The differential recursion relations result by restricting to a distinguished three-dimensional subalgebra, which is isomorphic to sl(2,R).sl(2,R).  相似文献   

19.
20.
We study the problem of propagation of analytic regularity for semi-linear symmetric hyperbolic systems. We adopt a global perspective and we prove that if the initial datum extends to a holomorphic function in a strip of radius (= width) ε0ε0, the same happens for the solution u(t,⋅)u(t,) for a certain radius ε(t)ε(t), as long as the solution exists. Our focus is on precise lower bounds on the spatial radius of analyticity ε(t)ε(t) as t grows.  相似文献   

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

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