全文获取类型
收费全文 | 20049篇 |
免费 | 449篇 |
国内免费 | 443篇 |
专业分类
化学 | 3960篇 |
晶体学 | 934篇 |
力学 | 385篇 |
综合类 | 44篇 |
数学 | 11938篇 |
物理学 | 3680篇 |
出版年
2023年 | 59篇 |
2022年 | 185篇 |
2021年 | 153篇 |
2020年 | 161篇 |
2019年 | 371篇 |
2018年 | 394篇 |
2017年 | 270篇 |
2016年 | 331篇 |
2015年 | 324篇 |
2014年 | 598篇 |
2013年 | 1358篇 |
2012年 | 525篇 |
2011年 | 1578篇 |
2010年 | 1388篇 |
2009年 | 1279篇 |
2008年 | 1377篇 |
2007年 | 1355篇 |
2006年 | 1018篇 |
2005年 | 891篇 |
2004年 | 785篇 |
2003年 | 600篇 |
2002年 | 619篇 |
2001年 | 416篇 |
2000年 | 397篇 |
1999年 | 370篇 |
1998年 | 382篇 |
1997年 | 292篇 |
1996年 | 334篇 |
1995年 | 336篇 |
1994年 | 318篇 |
1993年 | 244篇 |
1992年 | 248篇 |
1991年 | 173篇 |
1990年 | 183篇 |
1989年 | 171篇 |
1988年 | 106篇 |
1987年 | 124篇 |
1986年 | 89篇 |
1985年 | 158篇 |
1984年 | 114篇 |
1983年 | 68篇 |
1982年 | 91篇 |
1981年 | 121篇 |
1980年 | 106篇 |
1979年 | 61篇 |
1978年 | 108篇 |
1977年 | 91篇 |
1976年 | 90篇 |
1975年 | 39篇 |
1974年 | 44篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
Peter Köhler 《Aequationes Mathematicae》1990,39(1):6-18
LetC
m
be a compound quadrature formula, i.e.C
m
is obtained by dividing the interval of integration [a, b] intom subintervals of equal length, and applying the same quadrature formulaQ
n
to every subinterval. LetR
m
be the corresponding error functional. Iff
(r)
> 0 impliesR
m
[f] > 0 (orR
m
[f] < 0),=" then=" we=" say=">C
m
is positive definite (or negative definite, respectively) of orderr. This is the case for most of the well-known quadrature formulas. The assumption thatf
(r)
> 0 may be weakened to the requirement that all divided differences of orderr off are non-negative. Thenf is calledr-convex. Now letC
m
be positive definite or negative definite of orderr, and letf be continuous andr-convex. We prove the following direct and inverse theorems for the errorR
m
[f], where , denotes the modulus of continuity of orderr:
相似文献
52.
Summary We prove that the error inn-point Gaussian quadrature, with respect to the standard weight functionw1, is of best possible orderO(n
–2) for every bounded convex function. This result solves an open problem proposed by H. Braß and published in the problem section of the proceedings of the 2. Conference on Numerical Integration held in 1981 at the Mathematisches Forschungsinstitut Oberwolfach (Hämmerlin 1982; Problem 2). Furthermore, we investigate this problem for positive quadrature rules and for general product quadrature. In particular, for the special class of Jacobian weight functionsw
, (x)=(1–x)(1+x), we show that the above result for Gaussian quadrature is not valid precisely ifw
, is unbounded.Dedicated to Prof. H. Braß on the occasion of his 55th birthday 相似文献
53.
Summary Utilizing kernel structure properties a unified construction of Hankel matrix inversion algorithms is presented. Three types of algorithms are obtained: 1)O(n
2) complexity Levinson type, 2)O (n) parallel complexity Schur-type, and 3)O(n log2
n) complexity asymptotically fast ones. All algorithms work without additional assumption (like strong nonsingularity). 相似文献
54.
Summary We propose and analyse a method of estimating the poles near the unit circleT of a functionG whose values are given at a grid of points onT: we give an algorithm for performing this estimation and prove a convergence theorem. The method is to identify the phase for an estimate by considering the peaks of the absolute value ofG onT, and then to estimate the modulus by seeking a bestL
2 fit toG over a small arc by a first order rational function. These pole estimates lead to the construction of a basis ofL
2 which is well suited to the numerical representation of the Hankel operator with symbolG and thereby to the numerical solution of the Nehari problem (computing the bestH
, analytic, approximation toG relative to theL
norm), as analysed in [HY]. We present the results of numerical tests of these algorithms.Partially supported by grants from the AFOSR and NSF 相似文献
55.
E. Mieloszyk 《Periodica Mathematica Hungarica》1990,21(1):43-53
Applying Bittner's operational calculus we present a method to give approximate solutions of linear partial differential equations of first order
|
设为首页 | 免责声明 | 关于勤云 | 加入收藏 |
Copyright©北京勤云科技发展有限公司 京ICP备09084417号 |