全文获取类型
收费全文 | 7009篇 |
免费 | 86篇 |
国内免费 | 3篇 |
专业分类
化学 | 25篇 |
力学 | 39篇 |
综合类 | 1篇 |
数学 | 6691篇 |
物理学 | 342篇 |
出版年
2023年 | 3篇 |
2022年 | 4篇 |
2021年 | 3篇 |
2020年 | 4篇 |
2019年 | 61篇 |
2018年 | 80篇 |
2017年 | 37篇 |
2016年 | 27篇 |
2015年 | 35篇 |
2014年 | 99篇 |
2013年 | 331篇 |
2012年 | 167篇 |
2011年 | 354篇 |
2010年 | 391篇 |
2009年 | 521篇 |
2008年 | 517篇 |
2007年 | 463篇 |
2006年 | 247篇 |
2005年 | 174篇 |
2004年 | 100篇 |
2003年 | 125篇 |
2002年 | 149篇 |
2001年 | 169篇 |
2000年 | 188篇 |
1999年 | 197篇 |
1998年 | 245篇 |
1997年 | 202篇 |
1996年 | 137篇 |
1995年 | 136篇 |
1994年 | 159篇 |
1993年 | 148篇 |
1992年 | 171篇 |
1991年 | 153篇 |
1990年 | 159篇 |
1989年 | 167篇 |
1988年 | 110篇 |
1987年 | 96篇 |
1986年 | 120篇 |
1985年 | 94篇 |
1984年 | 113篇 |
1983年 | 41篇 |
1982年 | 90篇 |
1981年 | 53篇 |
1980年 | 89篇 |
1979年 | 62篇 |
1978年 | 68篇 |
1977年 | 24篇 |
1976年 | 7篇 |
1973年 | 3篇 |
1971年 | 2篇 |
排序方式: 共有7098条查询结果,搜索用时 0 毫秒
31.
Diem Ho 《Numerische Mathematik》1989,56(7):721-734
Summary The acceleration by Tchebychev iteration for solving nonsymmetric eigenvalue problems is dicussed. A simple algorithm is derived to obtain the optimal ellipse which passes through two eigenvalues in a complex plane relative to a reference complex eigenvalue. New criteria are established to identify the optimal ellipse of the eigenspectrum. The algorithm is fast, reliable and does not require a search for all possible ellipses which enclose the spectrum. The procedure is applicable to nonsymmetric linear systems as well. 相似文献
32.
We describe a procedure for determining a few of the largest singular values of a large sparse matrix. The method by Golub and Kent which uses the method of modified moments for estimating the eigenvalues of operators used in iterative methods for the solution of linear systems of equations is appropriately modified in order to generate a sequence of bidiagonal matrices whose singular values approximate those of the original sparse matrix. A simple Lanczos recursion is proposed for determining the corresponding left and right singular vectors. The potential asynchronous computation of the bidiagonal matrices using modified moments with the iterations of an adapted Chebyshev semi-iterative (CSI) method is an attractive feature for parallel computers. Comparisons in efficiency and accuracy with an appropriate Lanczos algorithm (with selective re-orthogonalization) are presented on large sparse (rectangular) matrices arising from applications such as information retrieval and seismic reflection tomography. This procedure is essentially motivated by the theory of moments and Gauss quadrature.This author's work was supported by the National Science Foundation under grants NSF CCR-8717492 and CCR-910000N (NCSA), the U.S. Department of Energy under grant DOE DE-FG02-85ER25001, and the Air Force Office of Scientific Research under grant AFOSR-90-0044 while at the University of Illinois at Urbana-Champaign Center for Supercomputing Research and Development.This author's work was supported by the U.S. Army Research Office under grant DAAL03-90-G-0105, and the National Science Foundation under grant NSF DCR-8412314. 相似文献
33.
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. 相似文献
34.
Summary. The perfectly matched layer (PML) is an efficient tool to simulate propagation phenomena in free space on unbounded domain.
In this paper we consider a new type of absorbing layer for Maxwell's equations and the linearized Euler equations which is
also valid for several classes of first order hyperbolic systems. The definition of this layer appears as a slight modification
of the PML technique. We show that the associated Cauchy problem is well-posed in suitable spaces. This theory is finally
illustrated by some numerical results. It must be underlined that the discretization of this layer leads to a new discretization
of the classical PML formulation.
Received May 5, 2000 / Published online November 15, 2001 相似文献
35.
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 相似文献
36.
Raiko P. Zaikov 《Letters in Mathematical Physics》1994,32(4):283-297
Higher spin extensions of the non-Abelian gauge symmetries for the classical WZNW model are considered. Both linear and nonlinear realizations of the extended affine Kac-Moody algebra are obtained. It is a characteristic property of the WZNW model that it admits a higher spin linear realization of the extended affine Kac-Moody algebra which is equivalent to the corresponding higher spin nonlinear realization of the same algebra. However, in both cases, the higher spin Noether currents do not span an invariant space with respect to their generating transformations. Here, the current space is extended to an invariant space which allows us to gauge the symmetry.Supported by Bulgarian Foundation on Fundamental Research under contract Ph-318/93-95. 相似文献
37.
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. 相似文献
38.
Summary. In this paper we are interested in two phase flow problems in porous media. We use a Dual Mesh Method to discretize this
problem with finite volume schemes. In a simplified case (elliptic - hyperbolic system) we prove the convergence of approximate
solutions to the exact solutions. We use the Dual Mesh Method in physically complex problems (heterogeneous cases with non
constant total mobility). We validate numerically the Dual Mesh Method on practical examples by computing error estimates
for different test-cases.
Received March 21, 1997 / Revised version received October 13, 1997 相似文献
39.
Michael J. Puls 《Archiv der Mathematik》2007,88(6):500-506
Let p be a real number greater than one. In this paper we study the vanishing and nonvanishing of the first L
p
-cohomology space of some groups that have one end. We also make a connection between the first L
p
-cohomolgy space and the Floyd boundary of the Cayley graph of a group. We apply the result about Floyd boundaries to show
that there exists a real number p such that the first L
p
-cohomology space of a nonelementary hyperbolic group does not vanish.
Received: 4 August 2006 Revised: 2 November 2006 相似文献
40.
Summary. We examine the convergence characteristics of iterative methods based on a new preconditioning operator for solving the linear
systems arising from discretization and linearization of the steady-state Navier-Stokes equations. With a combination of analytic
and empirical results, we study the effects of fundamental parameters on convergence. We demonstrate that the preconditioned
problem has an eigenvalue distribution consisting of a tightly clustered set together with a small number of outliers. The
structure of these distributions is independent of the discretization mesh size, but the cardinality of the set of outliers
increases slowly as the viscosity becomes smaller. These characteristics are directly correlated with the convergence properties
of iterative solvers.
Received August 5, 2000 / Published online June 20, 2001 相似文献