全文获取类型
收费全文 | 7724篇 |
免费 | 699篇 |
国内免费 | 601篇 |
专业分类
化学 | 1264篇 |
晶体学 | 12篇 |
力学 | 578篇 |
综合类 | 91篇 |
数学 | 4200篇 |
物理学 | 2879篇 |
出版年
2024年 | 6篇 |
2023年 | 55篇 |
2022年 | 89篇 |
2021年 | 137篇 |
2020年 | 157篇 |
2019年 | 202篇 |
2018年 | 173篇 |
2017年 | 211篇 |
2016年 | 243篇 |
2015年 | 186篇 |
2014年 | 320篇 |
2013年 | 649篇 |
2012年 | 375篇 |
2011年 | 466篇 |
2010年 | 402篇 |
2009年 | 510篇 |
2008年 | 544篇 |
2007年 | 555篇 |
2006年 | 491篇 |
2005年 | 385篇 |
2004年 | 321篇 |
2003年 | 354篇 |
2002年 | 312篇 |
2001年 | 240篇 |
2000年 | 222篇 |
1999年 | 178篇 |
1998年 | 195篇 |
1997年 | 179篇 |
1996年 | 131篇 |
1995年 | 97篇 |
1994年 | 83篇 |
1993年 | 72篇 |
1992年 | 50篇 |
1991年 | 41篇 |
1990年 | 43篇 |
1989年 | 40篇 |
1988年 | 67篇 |
1987年 | 39篇 |
1986年 | 25篇 |
1985年 | 37篇 |
1984年 | 23篇 |
1983年 | 14篇 |
1982年 | 24篇 |
1981年 | 21篇 |
1980年 | 11篇 |
1979年 | 6篇 |
1978年 | 7篇 |
1977年 | 7篇 |
1976年 | 11篇 |
1973年 | 5篇 |
排序方式: 共有9024条查询结果,搜索用时 120 毫秒
51.
Bernard Bialecki 《Numerical Algorithms》1994,8(2):167-184
Cyclic reduction and Fourier analysis-cyclic reduction (FACR) methods are presented for the solution of the linear systems which arise when orthogonal spline collocation with piecewise Hermite bicubics is applied to boundary value problems for certain separable partial differential equations on a rectangle. On anN×N uniform partition, the cyclic reduction and Fourier analysis-cyclic reduction methods requireO(N
2log2
N) andO(N
2log2log2
N) arithmetic operations, respectively. 相似文献
52.
53.
Bai-suo JIN~ 《中国科学A辑(英文版)》2007,50(9):1303-1315
In the factor analysis model with large cross-section and time-series dimensions,we pro- pose a new method to estimate the number of factors.Specially if the idiosyncratic terms satisfy a linear time series model,the estimators of the parameters can be obtained in the time series model. The theoretical properties of the estimators are also explored.A simulation study and an empirical analysis are conducted. 相似文献
54.
55.
Generators of some Ramanujan formulas 总被引:2,自引:0,他引:2
Jesús Guillera 《The Ramanujan Journal》2006,11(1):41-48
In this paper we prove some Ramanujan type formulas for 1/π but without using the theory of modular forms. Instead we use
the WZ—method created by H. Wilf and D. Zeilberger and find some hypergeometric functions in two variables which are second
components of WZ—pairs than can be certified using Zeilberger's EKHAD package. These certificates have an additional property
which allows us to get generalized Ramanujan's type series which are routinely proven by computer. We call these second hypergeometric
components of the WZ—pairs generators. Finding generators seems a hard task but using a kind of experimental research (explained
below), we have succeeded in finding some of them. Unfortunately we have not found yet generators for the most impressive
Ramanujan's formulas. We also prove some interesting binomial sums for the constant 1/π2. Finally we rewrite many of the obtained series using pochhammer symbols and study the rate of convergence.
2000 Mathematics Subject Classification Primary—33C20 相似文献
56.
Block-diagonalization of sparse equivariant discretization matrices is studied. Such matrices typically arise when partial
differential equations that evolve in symmetric geometries are discretized via the finite element method or via finite differences.
By considering sparse equivariant matrices as equivariant graphs, we identify a condition for when block-diagonalization via
a sparse variant of a generalized Fourier transform (GFT) becomes particularly simple and fast.
Characterizations for finite element triangulations of a symmetric domain are given, and formulas for assembling the block-diagonalized
matrix directly are presented. It is emphasized that the GFT preserves symmetric (Hermitian) properties of an equivariant
matrix.
By simulating the heat equation at the surface of a sphere discretized by an icosahedral grid, it is demonstrated that the
block-diagonalization is beneficial. The gain is significant for a direct method, and modest for an iterative method.
A comparison with a block-diagonalization approach based upon the continuous formulation is made. It is found that the sparse
GFT method is an appropriate way to discretize the resulting continuous subsystems, since the spectrum and the symmetry are
preserved.
AMS subject classification (2000) 43A30, 65T99, 20B25 相似文献
57.
V. V. Zudilin 《Mathematical Notes》2007,81(3-4):297-301
We prove two new series of Ramanujan type for 1/π2. 相似文献
58.
In the present paper, we consider the problem of the optimal reconstruction of the solution of the wave equation from the approximate values of the Fourier coefficients of the function specifying the initial form of the string. For an operator defined on the weight space of vectors from l 2, we present the solution of the more general problem of reconstruction from the approximate values of the coordinates of these vectors. 相似文献
59.
D. S. Barsegyan 《Mathematical Notes》2007,82(3-4):451-460
Applying the method proposed by Kashin for proving inequalities of Lieb-Thirring type for orthonormal systems, we prove a similar inequality in the multidimensional case. 相似文献
60.
R. N. Miroshin 《Mathematical Notes》2007,82(3-4):357-365
Multiple integrals generalizing the iterated kernels of integral operators are expressed as single integrals in the case of a special representation of the kernel (this is our theorem). Besides integral equations, Markov processes involve these integrals as well. As a consequence of the theorem, we obtain transition probability densities of certain Markov processes. As an illustration, we consider nine examples. 相似文献