全文获取类型
收费全文 | 2580篇 |
免费 | 105篇 |
国内免费 | 153篇 |
专业分类
化学 | 281篇 |
晶体学 | 2篇 |
力学 | 35篇 |
综合类 | 31篇 |
数学 | 2195篇 |
物理学 | 294篇 |
出版年
2023年 | 36篇 |
2022年 | 27篇 |
2021年 | 30篇 |
2020年 | 61篇 |
2019年 | 84篇 |
2018年 | 73篇 |
2017年 | 69篇 |
2016年 | 75篇 |
2015年 | 38篇 |
2014年 | 95篇 |
2013年 | 277篇 |
2012年 | 69篇 |
2011年 | 118篇 |
2010年 | 84篇 |
2009年 | 166篇 |
2008年 | 167篇 |
2007年 | 147篇 |
2006年 | 154篇 |
2005年 | 124篇 |
2004年 | 99篇 |
2003年 | 94篇 |
2002年 | 94篇 |
2001年 | 72篇 |
2000年 | 94篇 |
1999年 | 63篇 |
1998年 | 68篇 |
1997年 | 64篇 |
1996年 | 44篇 |
1995年 | 29篇 |
1994年 | 25篇 |
1993年 | 31篇 |
1992年 | 22篇 |
1991年 | 9篇 |
1990年 | 12篇 |
1989年 | 8篇 |
1988年 | 11篇 |
1987年 | 15篇 |
1986年 | 10篇 |
1985年 | 11篇 |
1984年 | 11篇 |
1983年 | 4篇 |
1982年 | 7篇 |
1981年 | 8篇 |
1980年 | 8篇 |
1979年 | 6篇 |
1978年 | 7篇 |
1977年 | 6篇 |
1976年 | 3篇 |
1974年 | 3篇 |
1972年 | 2篇 |
排序方式: 共有2838条查询结果,搜索用时 15 毫秒
41.
谱约束下对称正交对称矩阵束的最佳逼近 总被引:3,自引:0,他引:3
讨论了对称正交对称矩阵的广义逆特征值问题,得到了通解表达式和最佳解的表达式。 相似文献
42.
Zhang Zhongzhi Liu ChangrongSchool of Math. Science Central South Univ. Changsha China Dept. of Math. Hunan City Univ. Yiyang China. Faculty of Mathematics Econometrics Hunan Univ. Changsha China. 《高校应用数学学报(英文版)》2004,(3)
§1 IntroductionWe considerthe following inverse eigenvalue problem offinding an n-by-n matrix A∈S such thatAxi =λixi,i =1,2 ,...,m,where S is a given set of n-by-n matrices,x1 ,...,xm(m≤n) are given n-vectors andλ1 ,...,λmare given constants.Let X=(x1 ,...,xm) ,Λ=(λ1 ,λ2 ,...,λm) ,then the above inverse eigenvalue problemcan be written as followsProblem Given X∈Cn×m,Λ=(λ1 ,...,λm) ,find A∈S such thatAX =XΛ,where S is a given matrix set.We also discuss the so-called opti… 相似文献
43.
TheImprovementofFischer'sInequalityandHadamard'sInequalityHuangLiping(黄礼平)(DepartmentofBasicSciences,XiangtanMiningInstitute,... 相似文献
44.
Sparse approximate inverse (SAI) techniques have recently emerged as a new class of parallel preconditioning techniques for
solving large sparse linear systems on high performance computers. The choice of the sparsity pattern of the SAI matrix is
probably the most important step in constructing an SAI preconditioner. Both dynamic and static sparsity pattern selection
approaches have been proposed by researchers. Through a few numerical experiments, we conduct a comparable study on the properties
and performance of the SAI preconditioners using the different sparsity patterns for solving some sparse linear systems.
This revised version was published online in July 2006 with corrections to the Cover Date. 相似文献
45.
Takuji Sato 《Proceedings of the American Mathematical Society》2003,131(9):2903-2909
We obtain a non-Kähler almost Hermitian manifold of constant holomorphic sectional curvature by changing the almost complex structure in a Kähler manifold of constant holomorphic sectional curvature.
46.
Mursaleen 《Journal of Mathematical Analysis and Applications》2004,293(2):523-531
The idea of almost convergence for double sequences was introduced by Moricz and Rhoades [Math. Proc. Cambridge Philos. Soc. 104 (1988) 283-294] and they also characterized the four dimensional strong regular matrices. In this paper we define and characterize the almost strongly regular matrices for double sequences and apply these matrices to establish a core theorem. 相似文献
47.
48.
B.E. Rhoades 《Journal of Mathematical Analysis and Applications》2003,277(1):375-378
We modify some of the conditions of the theorem to make it more applicable. 相似文献
49.
A q × n array with entries from 0, 1,…,q − 1 is said to form a difference matrix if the vector difference (modulo q) of each pair of columns consists of a permutation of [0, 1,… q − 1]; this definition is inverted from the more standard one to be found, e.g., in Colbourn and de Launey (1996). The following idea generalizes this notion: Given an appropriate δ (-[−1, 1]t, a λq × n array will be said to form a (t, q, λ, Δ) sign-balanced matrix if for each choice C1, C2,…, Ct of t columns and for each choice = (1,…,t) Δ of signs, the linear combination ∑j=1t jCj contains (mod q) each entry of [0, 1,…, q − 1] exactly λ times. We consider the following extremal problem in this paper: How large does the number k = k(n, t, q, λ, δ) of rows have to be so that for each choice of t columns and for each choice (1, …, t) of signs in δ, the linear combination ∑j=1t jCj contains each entry of [0, 1,…, q t- 1] at least λ times? We use probabilistic methods, in particular the Lovász local lemma and the Stein-Chen method of Poisson approximation to obtain general (logarithmic) upper bounds on the numbers k(n, t, q, λ, δ), and to provide Poisson approximations for the probability distribution of the number W of deficient sets of t columns, given a random array. It is proved, in addition, that arithmetic modulo q yields the smallest array - in a sense to be described. 相似文献
50.
本文得到了正定Hermitian阵的Hadamard积的Schur补的一些不等式,进而,给出了他们的一些应用,这些改进了近期的一些结束. 相似文献