全文获取类型
收费全文 | 10522篇 |
免费 | 1124篇 |
国内免费 | 753篇 |
专业分类
化学 | 2122篇 |
晶体学 | 27篇 |
力学 | 830篇 |
综合类 | 239篇 |
数学 | 6427篇 |
物理学 | 2754篇 |
出版年
2024年 | 24篇 |
2023年 | 117篇 |
2022年 | 194篇 |
2021年 | 243篇 |
2020年 | 293篇 |
2019年 | 294篇 |
2018年 | 274篇 |
2017年 | 339篇 |
2016年 | 426篇 |
2015年 | 276篇 |
2014年 | 520篇 |
2013年 | 920篇 |
2012年 | 456篇 |
2011年 | 621篇 |
2010年 | 567篇 |
2009年 | 619篇 |
2008年 | 633篇 |
2007年 | 675篇 |
2006年 | 586篇 |
2005年 | 549篇 |
2004年 | 467篇 |
2003年 | 463篇 |
2002年 | 425篇 |
2001年 | 341篇 |
2000年 | 319篇 |
1999年 | 264篇 |
1998年 | 248篇 |
1997年 | 195篇 |
1996年 | 180篇 |
1995年 | 142篇 |
1994年 | 101篇 |
1993年 | 92篇 |
1992年 | 86篇 |
1991年 | 80篇 |
1990年 | 40篇 |
1989年 | 46篇 |
1988年 | 36篇 |
1987年 | 23篇 |
1986年 | 31篇 |
1985年 | 30篇 |
1984年 | 27篇 |
1983年 | 14篇 |
1982年 | 17篇 |
1981年 | 20篇 |
1980年 | 15篇 |
1979年 | 19篇 |
1978年 | 12篇 |
1977年 | 14篇 |
1976年 | 7篇 |
1973年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
2.
G. Peruginelli 《代数通讯》2018,46(11):4724-4738
We classify the maximal subrings of the ring of n×n matrices over a finite field, and show that these subrings may be divided into three types. We also describe all of the maximal subrings of a finite semisimple ring, and categorize them into two classes. As an application of these results, we calculate the covering number of a finite semisimple ring. 相似文献
3.
本文基于新的Kronecker型替换,给出两个由黑盒表示的稀疏多项式的新确定性插值算法.令f∈R[x1,……,xn]是一个稀疏黑盒多项式,其次数上界为D.当R是C或者是有限域时,相对于已有算法,新算法具有更好的计算复杂度或者关于D的复杂度更低.特别地,对于一般黑盒模型,D是复杂度中的主要因素,而在所有的确定性算法中,本文的第二个算法的复杂度关于D是最低的. 相似文献
4.
Ieva
Dauickait Amos S. Lawless Jennifer A. Scott Peter Jan van Leeuwen 《Numerical Linear Algebra with Applications》2020,27(5)
We consider the large sparse symmetric linear systems of equations that arise in the solution of weak constraint four‐dimensional variational data assimilation, a method of high interest for numerical weather prediction. These systems can be written as saddle point systems with a 3 × 3 block structure but block eliminations can be performed to reduce them to saddle point systems with a 2 × 2 block structure, or further to symmetric positive definite systems. In this article, we analyse how sensitive the spectra of these matrices are to the number of observations of the underlying dynamical system. We also obtain bounds on the eigenvalues of the matrices. Numerical experiments are used to confirm the theoretical analysis and bounds. 相似文献
5.
In this paper, we study the existence of the uniformly minimum risk equivariant (UMRE) estimators of parameters in a class
of normal linear models, which include the normal variance components model, the growth curve model, the extended growth curve
model, and the seemingly unrelated regression equations model, and so on. The necessary and sufficient conditions are given
for the existence of UMRE estimators of the estimable linear functions of regression coefficients, the covariance matrixV and (trV)α, where α > 0 is known, in the models under an affine group of transformations for quadratic losses and matrix losses, respectively.
Under the (extended) growth curve model and the seemingly unrelated regression equations model, the conclusions given in literature
for estimating regression coefficients can be derived by applying the general results in this paper, and the sufficient conditions
for non-existence of UMRE estimators ofV and tr(V) are expanded to be necessary and sufficient conditions. In addition, the necessary and sufficient conditions that there
exist UMRE estimators of parameters in the variance components model are obtained for the first time. 相似文献
6.
G. Montero L. Gonzlez E. Flrez M. D. García A. Surez 《Numerical Linear Algebra with Applications》2002,9(3):239-247
Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, minM∈??∥AM?I∥ F and matrix M0∈?? corresponding to this minimum (?? being any vectorial subspace of ??n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
7.
施国勇 《宁波大学学报(理工版)》1998,(2)
提出了一个线性双向联想存储器的模型,一组有限个向量对由一线性算子建立起双向联想关系,此线性算于是一个网络的联结权重矩阵。该权矩阵由最小二乘法决定。由权矩阵的解导出一特殊类型的Lyapunov矩阵方程.本文提供了这种Lyapunov矩阵方程的解。 相似文献
8.
9.
Algebra matrix and similarity classification of operators 总被引:1,自引:0,他引:1
ZHANG Zilong & LI Yucheng Department of Mathematics Hebei Normal University Shijiazhuang China 《中国科学A辑(英文版)》2006,49(3):398-409
In this paper, by the Gelfand representation theory and the Silov idempotents theorem, we first obtain a central decomposition theorem related to a unital semi-simple n-homogeneous Banach algebra, and then give a similarity classification of two strongly irreducible Cowen-Douglas operators using this theorem. 相似文献
10.