全文获取类型
收费全文 | 17535篇 |
免费 | 412篇 |
国内免费 | 310篇 |
专业分类
化学 | 2024篇 |
晶体学 | 75篇 |
力学 | 164篇 |
综合类 | 30篇 |
数学 | 14788篇 |
物理学 | 1176篇 |
出版年
2023年 | 58篇 |
2022年 | 128篇 |
2021年 | 115篇 |
2020年 | 95篇 |
2019年 | 419篇 |
2018年 | 423篇 |
2017年 | 226篇 |
2016年 | 191篇 |
2015年 | 241篇 |
2014年 | 504篇 |
2013年 | 983篇 |
2012年 | 617篇 |
2011年 | 1082篇 |
2010年 | 880篇 |
2009年 | 1164篇 |
2008年 | 1295篇 |
2007年 | 1247篇 |
2006年 | 997篇 |
2005年 | 728篇 |
2004年 | 603篇 |
2003年 | 493篇 |
2002年 | 316篇 |
2001年 | 335篇 |
2000年 | 318篇 |
1999年 | 395篇 |
1998年 | 331篇 |
1997年 | 258篇 |
1996年 | 311篇 |
1995年 | 348篇 |
1994年 | 333篇 |
1993年 | 276篇 |
1992年 | 227篇 |
1991年 | 140篇 |
1990年 | 220篇 |
1989年 | 233篇 |
1988年 | 149篇 |
1987年 | 178篇 |
1986年 | 193篇 |
1985年 | 224篇 |
1984年 | 149篇 |
1983年 | 95篇 |
1982年 | 143篇 |
1981年 | 118篇 |
1980年 | 99篇 |
1979年 | 70篇 |
1978年 | 84篇 |
1977年 | 89篇 |
1976年 | 76篇 |
1975年 | 19篇 |
1973年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
101.
Ravi Varadarajan 《BIT Numerical Mathematics》1990,30(3):450-463
We introduce a new kind of graph called multi-edge graph which arises in many applications such as finite state Markov chains and broadcasting communication networks. A cluster in such a graph is a set of nodes such that for any ordered pair of nodes, there is a path of multi-edges from one to the other such that these edges remain within the same set. We give two algorithms to partition a multi-edge graph into maximal clusters. Both these algorithms are based on the depth-first search algorithm to find strongly connected components of the directed graph. We also discuss some applications of clustering in multi-edge graphs. 相似文献
102.
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 相似文献
103.
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). 相似文献
104.
Summary The good Boussinesq equationu
tt
=–u
xxxx
+u
xx
+(u
2)
xx
has recently been found to possess an interesting soliton-interaction mechanism. In this paper we study the nonlinear stability and the convergence of some simple finite-difference schemes for the numerical solution of problems involving the good Boussinesq equation. Numerical experimentas are also reported. 相似文献
105.
G. Choudury 《Numerische Mathematik》1990,57(1):179-203
Summary In this paper we study the convergence properties of a fully discrete Galerkin approximation with a backwark Euler time discretization scheme. An approach based on semigroup theory is used to deal with the nonsmooth Dirichlet boundary data which cannot be handled by standard techniques. This approach gives rise to optimal rates of convergence inL
p[O,T;L
2()] norms for boundary conditions inL
p[O,T;L
2()], 1p. 相似文献
106.
K. H. Schild 《Numerische Mathematik》1990,58(1):369-386
Summary For the numerical integration of boundary value problems for first order ordinary differential systems, collocation on Gaussian points is known to provide a powerful method. In this paper we introduce a defect correction method for the iterative solution of such high order collocation equations. The method uses the trapezoidal scheme as the basic discretization and an adapted form of the collocation equations for defect evaluation. The error analysis is based on estimates of the contractive power of the defect correction iteration. It is shown that the iteration producesO(h
2), convergence rates for smooth starting vectors. A new result is that the iteration damps all kind of errors, so that it can also handle non-smooth starting vectors successfully. 相似文献
107.
John Todd 《Numerische Mathematik》1990,57(1):737-746
Theorem.Let the sequences {e
i
(n)
},i=1, 2, 3,n=0, 1, 2, ...be defined by
where the e
(0)
s satisfy
and where all square roots are taken positive. Then
where the convergence is quadratic and monotone and where
The discussions of convergence are entirely elementary. However, although the determination of the limits can be made in an elementary way, an acquaintance with elliptic objects is desirable for real understanding. 相似文献
108.
109.
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 相似文献
110.
E. Mieloszyk 《Periodica Mathematica Hungarica》1990,21(1):43-53