全文获取类型
收费全文 | 2529篇 |
免费 | 12篇 |
国内免费 | 7篇 |
专业分类
化学 | 20篇 |
力学 | 2篇 |
数学 | 2449篇 |
物理学 | 26篇 |
综合类 | 51篇 |
出版年
2023年 | 1篇 |
2021年 | 1篇 |
2019年 | 2篇 |
2018年 | 2篇 |
2017年 | 1篇 |
2016年 | 1篇 |
2015年 | 5篇 |
2014年 | 5篇 |
2013年 | 349篇 |
2012年 | 62篇 |
2011年 | 14篇 |
2010年 | 24篇 |
2009年 | 16篇 |
2008年 | 80篇 |
2007年 | 35篇 |
2006年 | 14篇 |
2005年 | 24篇 |
2004年 | 21篇 |
2003年 | 28篇 |
2002年 | 98篇 |
2001年 | 145篇 |
2000年 | 107篇 |
1999年 | 125篇 |
1998年 | 134篇 |
1997年 | 55篇 |
1996年 | 3篇 |
1995年 | 21篇 |
1994年 | 28篇 |
1993年 | 18篇 |
1992年 | 55篇 |
1991年 | 71篇 |
1990年 | 117篇 |
1989年 | 144篇 |
1988年 | 86篇 |
1987年 | 68篇 |
1986年 | 99篇 |
1985年 | 68篇 |
1984年 | 81篇 |
1983年 | 13篇 |
1982年 | 69篇 |
1981年 | 39篇 |
1980年 | 74篇 |
1979年 | 56篇 |
1978年 | 65篇 |
1977年 | 18篇 |
1975年 | 2篇 |
1974年 | 2篇 |
1973年 | 2篇 |
排序方式: 共有2548条查询结果,搜索用时 15 毫秒
21.
Yosihiko Ogata 《Numerische Mathematik》1989,55(2):137-157
Summary A new method for the numerical integration of very high dimensional functions is introduced and implemented based on the Metropolis' Monte Carlo algorithm. The logarithm of the high dimensional integral is reduced to a 1-dimensional integration of a certain statistical function with respect to a scale parameter over the range of the unit interval. The improvement in accuracy is found to be substantial comparing to the conventional crude Monte Carlo integration. Several numerical demonstrations are made, and variability of the estimates are shown. 相似文献
22.
A posteriori error estimators for the Stokes equations 总被引:5,自引:0,他引:5
Summary We present two a posteriori error estimators for the mini-element discretization of the Stokes equations. One is based on a suitable evaluation of the residual of the finite element solution. The other one is based on the solution of suitable local Stokes problems involving the residual of the finite element solution. Both estimators are globally upper and locally lower bounds for the error of the finite element discretization. Numerical examples show their efficiency both in estimating the error and in controlling an automatic, self-adaptive mesh-refinement process. The methods presented here can easily be generalized to the Navier-Stokes equations and to other discretization schemes.This work was accomplished at the Universität Heidelberg with the support of the Deutsche Forschungsgemeinschaft 相似文献
23.
Summary We study the augmented system approach for the solution of sparse linear least-squares problems. It is well known that this method has better numerical properties than the method based on the normal equations. We use recent work by Arioli et al. (1988) to introduce error bounds and estimates for the components of the solution of the augmented system. In particular, we find that, using iterative refinement, we obtain a very robust algorithm and our estimates of the error are accurate and cheap to compute. The final error and all our error estimates are much better than the classical or Skeel's error analysis (1979) indicates. Moreover, we prove that our error estimates are independent of the row scaling of the augmented system and we analyze the influence of the Björck scaling (1967) on these estimates. We illustrate this with runs both on large-scale practical problems and contrived examples, comparing the numerical behaviour of the augmented systems approach with a code using the normal equations. These experiments show that while the augmented system approach with iterative refinement can sometimes be less efficient than the normal equations approach, it is comparable or better when the least-squares matrix has a full row, and is, in any case, much more stable and robust.This author was visiting Harwell and was funded by a grant from the Italian National Council of Research (CNR), Istituto di Elaborazione dell'Informazione-CNR, via S. Maria 46, I-56100 Pisa, ItalyThis author was visiting Harwell from Faculty of Mathematics and Computer Science of the University of Amsterdam 相似文献
24.
Numerical methods for ordinary initial value problems that do not depend on special properties of the system are usually found in the class of linear multistage multivalue methods, first formulated by J.C. Butcher. Among these the explicit methods are easiest to implement. For these reasons there has been considerable research activity devoted to generating methods of this class which utilize independent function evaluations that can be performed in parallel. Each such group of concurrent function evaluations can be regarded as a stage of the method. However, it turns out that parallelism affords only limited opportunity for reducing the computing time with such methods. This is most evident for the simple linear homogeneous constant-coefficient test problem, whose solution is essentially a matter of approximating the exponential by an algebraic function. For a given number of stages and a given number of saved values, parallelism offers a somewhat enlarged set of algebraic functions from which to choose. However, there is absolutely no benefit in having the degree of parallelism (number of processors) exceed the number of saved values of the method. Thus, in particular, parallel one-step methods offer no speedup over serial one-step methods for the standard linear test problem. Although the implication of this result for general nonlinear problems is unclear, there are indications that dramatic speedups are not possible in general. Also given are some results relevant to the construction of methods.Work supported in part by National Science Foundation grants DMS 89 11410 and DMS 90 15533 and by US Department of Energy grant DOE DEFG02-87ER25026. Work of the second author was completed while at the University of Illinois. 相似文献
25.
Our object of study is the asymptotic behavior of the sequence of polynomials orthogonal with respect to the discrete Sobolev
inner product <formula> \langle f, g \rangle = ∈t_{E} f(ξ) \overline{g(ξ)} ρ(ξ) |d ξ|+ f(Z) A g(Z)^H, </formula> where E is a rectifiable Jordan curve or arc in the complex plane
f(Z) = (f(z_1), \ldots, f^{(l_1)}(z_1) , \ldots , f(z_m) , \ldots ,f^{(l_m)}(z_m)),
A is an M \times M Hermitian matrix, M l
1
+ ⋅s + l
m
+ m , |d ξ| denotes the arc length measure, ρ is a nonnegative function on E , and z
i
∈Ω,
i=1,2,\ldots,m , where Ω is the exterior region to E .
July 23, 1999. Dates revised: September 11, 2000 and February 16, 2001. Date accepted: February 26, 2001. 相似文献
26.
Claire Cates Haulk John Drew Charles R. Johnson J. Hunter Tart 《Linear and Multilinear Algebra》1997,43(1):35-51
For a given n-by-n matrix A, we consider the set of matrices which commute with A and all of whose principal submatrices commute with the corresponding principal submatrices of A. The properties of this set are examined, with particular attention to its dimension. 相似文献
27.
《Linear and Multilinear Algebra》2007,55(6):521-533
For each k≥ 0, those nonsingular matrices that transform the set of totally nonzero vectors with k sign variations into (respectively, onto) itself are studied. Necessary and sufficient conditions are provided. The cases k=0,1,2,n-3,n-2,n-1 are completely characterized. 相似文献
28.
We consider the semilinear Cauchy problem for a class of pseudo-differential operators generating sub-Markovian semigroups.
Solutions of such problems with negative definite nonlinearity play an important role in constructing branching measure-valued
processes. We establish local existence and uniqueness of solutions in the context of the Dirichlet space associated to the
problem. Comparison and global properties of solutions are also studied.
Accepted 29 August 2001. Online publication 17 December 2001. 相似文献
29.
A. Louise Perkins 《BIT Numerical Mathematics》1992,32(4):598-608
The choice of data structures influences the parallelization, efficiency and the manageability of a mesh refinement program. We introduce a mixed directed-undirected graph that combines both communication and scheduling needs. An inverted index is maintained for the directed graph to improve code performance and readability.This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under contract No. W-7405-Eng-48. 相似文献
30.
R. Pendavingh 《Combinatorica》1998,18(2):281-292
, where μ and λ are minor-monotone graph invariants introduced by Colin de Verdière [3] and van der Holst, Laurent, and Schrijver
[5]. It is also shown that a graph G exists with . The graphs G with maximal planar complement and , characterised by Kotlov, Lovász, and Vempala, are shown to be forbidden minors for .
Received: June 13, 1997 相似文献