全文获取类型
收费全文 | 116篇 |
免费 | 14篇 |
国内免费 | 9篇 |
专业分类
电工技术 | 1篇 |
综合类 | 18篇 |
化学工业 | 2篇 |
建筑科学 | 4篇 |
能源动力 | 1篇 |
水利工程 | 1篇 |
无线电 | 10篇 |
一般工业技术 | 14篇 |
冶金工业 | 1篇 |
原子能技术 | 5篇 |
自动化技术 | 82篇 |
出版年
2024年 | 2篇 |
2023年 | 2篇 |
2022年 | 1篇 |
2020年 | 2篇 |
2019年 | 4篇 |
2018年 | 3篇 |
2017年 | 2篇 |
2016年 | 5篇 |
2015年 | 4篇 |
2014年 | 9篇 |
2013年 | 7篇 |
2012年 | 14篇 |
2011年 | 12篇 |
2010年 | 6篇 |
2009年 | 5篇 |
2008年 | 4篇 |
2007年 | 4篇 |
2006年 | 6篇 |
2005年 | 2篇 |
2004年 | 2篇 |
2003年 | 8篇 |
2002年 | 8篇 |
2001年 | 5篇 |
2000年 | 2篇 |
1999年 | 2篇 |
1998年 | 3篇 |
1997年 | 2篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1993年 | 4篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1981年 | 1篇 |
排序方式: 共有139条查询结果,搜索用时 15 毫秒
2.
混合Hermite-Lagrange插值之同时逼近 总被引:1,自引:1,他引:0
谢庭藩 《中国计量学院学报》1993,(2)
对于(-1,1)中的结点组{X_k}_(k=1)~n,记l_k(x)为相应的Lagrange插值基本多项式,又记A_n=‖∑(2-x~2-x_k~2)(1-x_k~2)~-1丨l_k(x)‖。对于f∈C_([-1,1)~q与r=[q+2/2],本文证明满足条件H_n(f,x_k)=f(x_k)(k=1,2,…,n),H_n~(s)(f,±1)=f~(s)(±1)(s=0,1,…,n-1)的n+2r-1次代数多项式H_n(f,x)有逼近性质H_n~(s)(f,x)-f~(s)(x)=(?)其中δ_n(x)=n~(-1)(1-x~2)~(1/2),△_n(x)=δ_n(x)+n~(-2).作为证明的重要工具,本文还对n次代数多项式P_n(x),建立了另一形式的Bernstein不等武:若 P_n(x)=O(1)δ_n~q(x)ω(δ_n(x)),则p_n~(S)(X)=O(1)δ_n~(q-2S)(X)ω(δ_n(X))△_n~s(X)。 相似文献
3.
J. C. Sevy 《Calcolo》1993,30(1):41-68
Explicit error estimates are given for the iterated Boolean sum of a sequence of simultaneous approximants; the rate of convergence
is shown to be improved for smooth functions. The general results are applied in the case of the Bernstein, Durrmeyer and
Stancu operators. 相似文献
4.
M. Arounassalame 《国际自动化与计算杂志》2012,9(1):81-86
In electrical circuit analysis, it is often necessary to find the set of all direct current (d.c.) operating points (either voltages or currents) of nonlinear circuits. In general, these nonlinear equations are often represented as polynomial systems. In this paper, we address the problem of finding the solutions of nonlinear electrical circuits, which are modeled as systems of n polynomial equations contained in an n-dimensional box. Branch and Bound algorithms based on interval methods can give guaranteed enclosures for the solution. However, because of repeated evaluations of the function values, these methods tend to become slower. Branch and Bound algorithm based on Bernstein coefficients can be used to solve the systems of polynomial equations. This avoids the repeated evaluation of function values, but maintains more or less the same number of iterations as that of interval branch and bound methods. We propose an algorithm for obtaining the solution of polynomial systems, which includes a pruning step using Bernstein Krawczyk operator and a Bernstein Coefficient Contraction algorithm to obtain Bernstein coefficients of the new domain. We solved three circuit analysis problems using our proposed algorithm. We compared the performance of our proposed algorithm with INTLAB based solver and found that our proposed algorithm is more efficient and fast. 相似文献
5.
本文以二次Bernstein基函数为例,首次提出了含双参数基函数的新扩展——αβQ—Bern-stein基函数,此类基函数具有新的特点,即基函数的扩展次数一次性升高两次,且包含了二次多项式和带一个参数的三次多项式基函数的所有性质。基于这组基函数定义了αβQ—Bézier曲线,该曲线也含有参数,具有形状可调性,当α与β取某些值时曲线能达到C4连续或在某个端点处C0连续。最后与含两个参数的升一次Bézier曲线进行比较,该曲线具有调节范围广、灵活性更强的优势。 相似文献
6.
In Winkel (2001) a generalization of Bernstein polynomials and Bézier curves based on umbral calculus has been introduced. In the present paper we describe new geometric and algorithmic properties of this generalization including: (1) families of polynomials introduced by Stancu (1968) and Goldman (1985), i.e., families that include both Bernstein and Lagrange polynomial, are generalized in a new way, (2) a generalized de Casteljau algorithm is discussed, (3) an efficient evaluation of generalized Bézier curves through a linear transformation of the control polygon is described, (4) a simple criterion for endpoint tangentiality is established. 相似文献
7.
假设函数f在端点处具有奇性,该文针对此类函数定义了一类修正的Bernstein算子,并在此基础上给出了修正的Bernstein算子的加权Bernstein-Markov型不等式,此类不等式推广了数学工作者们的结论。 相似文献
8.
D. Cárdenas-Morales 《Mathematics and computers in simulation》2011,81(10):2098-2102
In this paper we present a new result on the saturation of sequences of linear operators in a multivariate and simultaneous setting. Specifically, a small o saturation result is obtained for the partial derivatives of the classical Bernstein bivariate operators on the unit simplex. Solutions of boundary value problems for certain partial differential equations of elliptic type play an important role. 相似文献
9.
E. Berriochoa A. Cachafeiro J. García Amor 《Computers & Mathematics with Applications》2009,58(7):1370-1382
In the present paper we characterize the measures on the unit circle for which there exists a quadrature formula with a fixed number of nodes and weights and such that it exactly integrates all the polynomials with complex coefficients. As an application we obtain quadrature rules for polynomial modifications of the Bernstein measures on [−1,1], having a fixed number of nodes and quadrature coefficients and such that they exactly integrate all the polynomials with real coefficients. 相似文献
10.
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensorial Bernstein basis, which is exponential size in the number n of variables. In this paper, we consider methods to compute tight bounds for polynomials in n variables by solving two linear programming problems over a polytope. We formulate a polytope defined as the convex hull of the coefficients with respect to the tensorial Bernstein basis, and we formulate several polytopes based on the Bernstein polynomials of the domain. These Bernstein polytopes can be defined by a polynomial number of halfspaces. We give the number of vertices, the number of hyperfaces, and the volume of each polytope for n=1,2,3,4, and we compare the computed range widths for random n-variate polynomials for n?10. The Bernstein polytope of polynomial size gives only marginally worse range bounds compared to the range bounds obtained with the tensorial Bernstein basis of exponential size. 相似文献