全文获取类型
收费全文 | 69146篇 |
免费 | 3871篇 |
国内免费 | 3592篇 |
专业分类
化学 | 25133篇 |
晶体学 | 658篇 |
力学 | 4362篇 |
综合类 | 550篇 |
数学 | 19597篇 |
物理学 | 26309篇 |
出版年
2023年 | 478篇 |
2022年 | 1042篇 |
2021年 | 1095篇 |
2020年 | 1181篇 |
2019年 | 1474篇 |
2018年 | 1239篇 |
2017年 | 1374篇 |
2016年 | 1414篇 |
2015年 | 1118篇 |
2014年 | 1740篇 |
2013年 | 3897篇 |
2012年 | 2328篇 |
2011年 | 3002篇 |
2010年 | 2171篇 |
2009年 | 3458篇 |
2008年 | 3785篇 |
2007年 | 4144篇 |
2006年 | 3618篇 |
2005年 | 2775篇 |
2004年 | 2819篇 |
2003年 | 3208篇 |
2002年 | 4134篇 |
2001年 | 3544篇 |
2000年 | 3294篇 |
1999年 | 3162篇 |
1998年 | 2848篇 |
1997年 | 1746篇 |
1996年 | 1261篇 |
1995年 | 930篇 |
1994年 | 957篇 |
1993年 | 647篇 |
1992年 | 721篇 |
1991年 | 494篇 |
1990年 | 560篇 |
1989年 | 455篇 |
1988年 | 373篇 |
1987年 | 356篇 |
1986年 | 368篇 |
1985年 | 403篇 |
1984年 | 393篇 |
1983年 | 209篇 |
1982年 | 310篇 |
1981年 | 394篇 |
1980年 | 342篇 |
1979年 | 246篇 |
1978年 | 283篇 |
1977年 | 214篇 |
1976年 | 140篇 |
1975年 | 114篇 |
1974年 | 109篇 |
排序方式: 共有10000条查询结果,搜索用时 578 毫秒
941.
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. 相似文献
942.
Summary The problem of the construction of an equilibrium surface taking the surface tension into account leads to Laplace-Young equation which is a nonlinear elliptic free-boundary problem. In contrast to Orr et al. where an iterative technique is used for direct solution of the equation for problems with simple geometry, we propose here an alternative approach based on shape optimization techniques. The shape of the domain of the liquid is varied to attain the optimality condition. Using optimal control theory to derive expressions for the gradient, a numerical scheme is proposed and simple model problems are solved to validate the scheme. 相似文献
943.
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 相似文献
944.
Richard F. Serfozo 《Queueing Systems》1989,5(1-3):5-36
A Markovian network process describes the movement of discrete units among a set of nodes that process the units. There is considerable knowledge of such networks, often called queueing networks, in which the nodes operate independently and the routes of the units are independent. The focus of this study, in contrast, is on networks with dependent nodes and routings. Examples of dependencies are parallel processing across several nodes, blocking of transitions because of capacity constraints on nodes, alternate routing of units to avoid congestion, and accelerating or decelerating the processing rate at a node depending on downstream congestion. We introduce a general network process representing the numbers of units at the nodes and derive its equilibrium distribution. This distribution takes the form of a product of functions of vectors in which the arguments of the functions satisfy an interchangeability property. This new type of distribution may apply to other multi-variate processes as well. A basic idea in our approach is a linking of certain micro-level balance properties of the network routing to the processing rates at the nodes. The link is via routing-balance partitions of nodes that are inherent in any network. A byproduct of this approach is a general characterization of blocking of transitions without the restriction that the process is reversible, which had been a standard assumption. We also give necessary and sufficient conditions under which a unit moving in the network sees a time average for the unmoved units (called the MUSTA property). Finally, we discuss when certain flows between nodes in an open network are Poisson processes.This research was sponsored in part by Air Force Office of Scientific Research contract 84-0367. 相似文献
945.
Junping Wang 《Numerische Mathematik》1989,55(4):401-430
Summary Asymptotic expansions for mixed finite element approximations of the second order elliptic problem are derived and Richardson extrapolation can be applied to increase the accuracy of the approximations. A new procedure, which is called the error corrected method, is presented as a further application of the asymptotic error expansion for the first order BDM approximation of the scalar field. The key point in deriving the asymptotic expansions for the error is an establishment ofL
1-error estimates for mixed finite element approximations for the regularized Green's functions. As another application of theL
1-error estimates for the regularized Green's functions, we shall present maximum norm error estimates for mixed finite element methods for second order elliptic problems. 相似文献
946.
A. Girard 《Numerische Mathematik》1989,56(1):1-23
Summary We propose a fast Monte-Carlo algorithm for calculating reliable estimates of the trace of the influence matrixA
involved in regularization of linear equations or data smoothing problems, where is the regularization or smoothing parameter. This general algorithm is simply as follows: i) generaten pseudo-random valuesw
1, ...,w
n
, from the standard normal distribution (wheren is the number of data points) and letw=(w
1, ...,w
n
)
T
, ii) compute the residual vectorw–A
w, iii) take the normalized inner-product (w
T
(w–A
w))/(w
T
w) as an approximation to (1/n)tr(I–A
). We show, both by theoretical bounds and by numerical simulations on some typical problems, that the expected relative precision of these estimates is very good whenn is large enough, and that they can be used in practice for the minimization with respect to of the well known Generalized Cross-Validation (GCV) function. This permits the use of the GCV method for choosing in any particular large-scale application, with only a similar amount of work as the standard residual method. Numerical applications of this procedure to optimal spline smoothing in one or two dimensions show its efficiency. 相似文献
947.
Wilhelm Heinrichs 《Numerische Mathematik》1989,56(1):25-41
Summary Spectral methods employ global polynomials for approximation. Hence they give very accurate approximations for smooth solutions. Unfortunately, for Dirichlet problems the matrices involved are dense and have condition numbers growing asO(N
4) for polynomials of degree N in each variable. We propose a new spectral method for the Helmholtz equation with a symmetric and sparse matrix whose condition number grows only asO(N
2). Certain algebraic spectral multigrid methods can be efficiently used for solving the resulting system. Numerical results are presented which show that we have probably found the most effective solver for spectral systems. 相似文献
948.
Stability regions of -methods for the linear delay differential test equations
0, \hfill \\ y(t) = \varphi (t),t \in [ - \tau ,0], \hfill \\ \end{gathered}$$ " align="middle" vspace="20%" border="0"> 相似文献 |