全文获取类型
收费全文 | 4693篇 |
免费 | 317篇 |
国内免费 | 499篇 |
专业分类
化学 | 482篇 |
晶体学 | 5篇 |
力学 | 86篇 |
综合类 | 109篇 |
数学 | 4340篇 |
物理学 | 487篇 |
出版年
2024年 | 5篇 |
2023年 | 59篇 |
2022年 | 54篇 |
2021年 | 53篇 |
2020年 | 91篇 |
2019年 | 129篇 |
2018年 | 124篇 |
2017年 | 137篇 |
2016年 | 165篇 |
2015年 | 71篇 |
2014年 | 188篇 |
2013年 | 450篇 |
2012年 | 176篇 |
2011年 | 232篇 |
2010年 | 206篇 |
2009年 | 292篇 |
2008年 | 323篇 |
2007年 | 336篇 |
2006年 | 278篇 |
2005年 | 235篇 |
2004年 | 228篇 |
2003年 | 228篇 |
2002年 | 236篇 |
2001年 | 174篇 |
2000年 | 173篇 |
1999年 | 137篇 |
1998年 | 138篇 |
1997年 | 114篇 |
1996年 | 87篇 |
1995年 | 50篇 |
1994年 | 41篇 |
1993年 | 43篇 |
1992年 | 39篇 |
1991年 | 17篇 |
1990年 | 14篇 |
1989年 | 16篇 |
1988年 | 15篇 |
1987年 | 18篇 |
1986年 | 13篇 |
1985年 | 18篇 |
1984年 | 18篇 |
1983年 | 5篇 |
1982年 | 12篇 |
1981年 | 10篇 |
1980年 | 10篇 |
1979年 | 13篇 |
1978年 | 10篇 |
1977年 | 10篇 |
1976年 | 5篇 |
1972年 | 3篇 |
排序方式: 共有5509条查询结果,搜索用时 15 毫秒
61.
62.
A procedure for determining a few of the largest singular values and corresponding singular vectors of large sparse matrices is presented. Equivalent eigensystems are solved using a technique originally proposed by Golub and Kent based on the computation of modified moments. The asynchronicity in the computations of moments and eigenvalues makes this method attractive for parallel implementations on a network of workstations. Although no obvious relationship between modified moments and the corresponding eigenvectors is known to exist, a scheme to approximate both eigenvalues and eigenvectors (and subsequently singular values and singular vectors) has been produced. This scheme exploits both modified moments in conjunction with the Chebyshev semi-iterative method and deflation techniques to produce approximate eigenpairs of the equivalent sparse eigensystems. The performance of an ANSI-C implementation of this scheme on a network of UNIX workstations and a 256-processor Cray T3D is presented.This research was supported in part by the National Science Foundation under grant numbers NSF-ASC-92-03004 and NSF-ASC-94-11394. 相似文献
63.
Stefano Serra 《BIT Numerical Mathematics》1996,36(1):135-142
In this paper we are concerned with the asymptotic behavior of the smallest eigenvalue
1
(n)
of symmetric (Hermitian)n ×n Toeplitz matricesT
n
(f) generated by an integrable functionf defined in [–, ]. In [7, 8, 11] it is shown that
1
(n)
tends to essinff =m
f
in the following way:
1
(n)
–m
f
1/n
2k
. These authors use three assumptions:A1)f –m
f
has a zero inx =x
0 of order 2k.A2)f is continuous and at leastC
2k
in a neighborhood ofx
0.A3)x =x
0 is the unique global minimum off in [–, ]. In [10] we have proved that the hypothesis of smoothnessA2 is not necessary and that the same result holds under the weaker assumption thatf L
1[–, ]. In this paper we further extend this theory to the case of a functionf L
1[–, ] having several global minima by suppressing the hypothesisA3 and by showing that the maximal order 2k of the zeros off –m
f
is the only parameter which characterizes the rate of convergence of
1
(n)
tom
f
. 相似文献
64.
CompletelyPositiveDefiniteMapsOverTopological-algebrasXuTianzhou(DepartmentofAppliedMathematics,BeijingInstituteofTechnofogy,... 相似文献
65.
Best possibility of the Furuta inequality 总被引:5,自引:0,他引:5
Let , and . Furuta (1987) proved that if bounded linear operators on a Hilbert space satisfy , then . In this paper, we prove that the range and is best possible with respect to the Furuta inequality, that is, if or , then there exist which satisfy but .
66.
Varghese Mathai 《Proceedings of the American Mathematical Society》1996,124(8):2585-2588
In this paper, we prove that the Novikov-Shubin invariants satisfy a sequence of inequalities and deduce some useful consequences of this result.
67.
Sergiu Aizicovici Viorel Barbu 《NoDEA : Nonlinear Differential Equations and Applications》1996,3(1):1-18
A non-Fourier phase field model is considered. A global existence result for a Dirichlet, or generalized Neumann, initial-boundary value problem is obtained, followed by a discussion of the regularity and asymptotic properties of solutions ast.This research was supported in part by the National Science Foundation under Grant DMS 91-11794 and in part by the Italian M.U.R.S.T. project Problemi non lineari...Part of this author's work was done while visiting Ohio University. 相似文献
68.
Ron M. Roth 《Designs, Codes and Cryptography》1996,9(2):177-191
Codes
of length 2
m
over {1, -1} are defined as null spaces of certain submatrices of Hadamard matrices. It is shown that the codewords of
all have an rth order spectral null at zero frequency. Establishing the connection between
and the parity-check matrix of Reed-Muller codes, the minimum distance of
is obtained along with upper bounds on the redundancy of
. An efficient algorithm is presented for encoding unconstrained binary sequences into
. 相似文献
69.
Several new constructions for difference matrices are given. One classof constructions uses pairwise balanced designs to develop newdifference matrices over the additive group of GF (q). A second class of constructions gives difference matrices overgroups whose orders are not (necessarily) prime powers. 相似文献
70.