全文获取类型
收费全文 | 2720篇 |
免费 | 253篇 |
国内免费 | 217篇 |
专业分类
化学 | 212篇 |
晶体学 | 1篇 |
力学 | 120篇 |
综合类 | 44篇 |
数学 | 2023篇 |
物理学 | 790篇 |
出版年
2024年 | 4篇 |
2023年 | 28篇 |
2022年 | 71篇 |
2021年 | 77篇 |
2020年 | 83篇 |
2019年 | 72篇 |
2018年 | 88篇 |
2017年 | 88篇 |
2016年 | 90篇 |
2015年 | 62篇 |
2014年 | 134篇 |
2013年 | 236篇 |
2012年 | 84篇 |
2011年 | 115篇 |
2010年 | 110篇 |
2009年 | 153篇 |
2008年 | 180篇 |
2007年 | 173篇 |
2006年 | 146篇 |
2005年 | 143篇 |
2004年 | 94篇 |
2003年 | 123篇 |
2002年 | 116篇 |
2001年 | 103篇 |
2000年 | 98篇 |
1999年 | 71篇 |
1998年 | 76篇 |
1997年 | 68篇 |
1996年 | 57篇 |
1995年 | 34篇 |
1994年 | 28篇 |
1993年 | 15篇 |
1992年 | 24篇 |
1991年 | 14篇 |
1990年 | 14篇 |
1989年 | 6篇 |
1988年 | 15篇 |
1987年 | 11篇 |
1986年 | 8篇 |
1985年 | 9篇 |
1984年 | 8篇 |
1983年 | 7篇 |
1982年 | 11篇 |
1981年 | 4篇 |
1980年 | 8篇 |
1979年 | 6篇 |
1978年 | 6篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1974年 | 3篇 |
排序方式: 共有3190条查询结果,搜索用时 218 毫秒
1.
2.
3.
《Journal of Pure and Applied Algebra》2022,226(8):107024
We solve a combinatorial question concerning eigenvalues of the universal intertwining endomorphism of a subset representation. 相似文献
4.
5.
《Indagationes Mathematicae》2022,33(1):218-237
We define the notion of basic set data for finite groups (building on the notion of basic set, but including an order on the irreducible characters as part of the structure), and we prove that the Springer correspondence provides basic set data for Weyl groups. Then we use this to determine explicitly the modular Springer correspondence for classical types (defined over a base field of odd characteristic , and with coefficients in a field of odd characteristic ): the modular case is obtained as a restriction of the ordinary case to a basic set. In order to do so, we compare the order on bipartitions introduced by Dipper and James with the order induced by the Springer correspondence. We provide a quick proof, by sorting characters according to the dimension of the corresponding Springer fibre, an invariant which is directly computable from symbols. 相似文献
6.
本文基于新的Kronecker型替换,给出两个由黑盒表示的稀疏多项式的新确定性插值算法.令f∈R[x1,……,xn]是一个稀疏黑盒多项式,其次数上界为D.当R是C或者是有限域时,相对于已有算法,新算法具有更好的计算复杂度或者关于D的复杂度更低.特别地,对于一般黑盒模型,D是复杂度中的主要因素,而在所有的确定性算法中,本文的第二个算法的复杂度关于D是最低的. 相似文献
7.
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. 相似文献
8.
The finiteness is proved of the set of isomorphism classes of potentially abelian geometric Galois representations with a given set of data. This is a special case of the finiteness conjecture of Fontaine and Mazur. 相似文献
9.
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. 相似文献
10.
本文是文[1-7]的继续,研究变权综合问题,从确定变权的经验公式入手引出了变权原理,给出了变权的公理化定义,讨论了与之有关的均衡函数及其梯度向量。 相似文献