全文获取类型
收费全文 | 15422篇 |
免费 | 1035篇 |
国内免费 | 857篇 |
专业分类
化学 | 285篇 |
晶体学 | 2篇 |
力学 | 1552篇 |
综合类 | 185篇 |
数学 | 14062篇 |
物理学 | 1228篇 |
出版年
2024年 | 31篇 |
2023年 | 146篇 |
2022年 | 177篇 |
2021年 | 216篇 |
2020年 | 333篇 |
2019年 | 342篇 |
2018年 | 394篇 |
2017年 | 408篇 |
2016年 | 392篇 |
2015年 | 299篇 |
2014年 | 630篇 |
2013年 | 1225篇 |
2012年 | 707篇 |
2011年 | 800篇 |
2010年 | 728篇 |
2009年 | 981篇 |
2008年 | 1036篇 |
2007年 | 1061篇 |
2006年 | 948篇 |
2005年 | 745篇 |
2004年 | 655篇 |
2003年 | 712篇 |
2002年 | 622篇 |
2001年 | 467篇 |
2000年 | 479篇 |
1999年 | 419篇 |
1998年 | 385篇 |
1997年 | 355篇 |
1996年 | 274篇 |
1995年 | 229篇 |
1994年 | 154篇 |
1993年 | 127篇 |
1992年 | 137篇 |
1991年 | 110篇 |
1990年 | 89篇 |
1989年 | 46篇 |
1988年 | 45篇 |
1987年 | 44篇 |
1986年 | 49篇 |
1985年 | 66篇 |
1984年 | 56篇 |
1983年 | 30篇 |
1982年 | 34篇 |
1981年 | 30篇 |
1980年 | 20篇 |
1979年 | 24篇 |
1978年 | 15篇 |
1977年 | 15篇 |
1976年 | 11篇 |
1936年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
161.
The parallel version of precondition techniques is developed for matrices arising from the Galerkin boundary element method for two-dimensional domains with Dirichlet boundary conditions. Results were obtained for implementations on a transputer network as well as on an nCUBE-2 parallel computer showing that iterative solution methods are very well suited for a MIMD computer. A comparison of numerical results for iterative and direct solution methods is presented and underlines the superiority of iterative methods for large systems. 相似文献
162.
无穷区间上二阶微分方程的边值问题 总被引:5,自引:0,他引:5
刘衍胜 《应用泛函分析学报》2002,4(3):211-216
利用Schauder不动点定理讨论了一类非线性二阶微分方程在无穷区间上的边值问题无界解的存在性,部分改进了郭大钧教授最近得到的结果。 相似文献
163.
几种约束广义逆矩阵的有限算法 总被引:2,自引:0,他引:2
陈永林 《高等学校计算数学学报》1997,19(3):232-240
1引言与引理众所周知,关于非奇异方阵的正则逆的有限算法是由Faddeev大给在1949年之前提出的,这就是著名的Faddeev算法[1,P…334-336]。自从五十年代中期广义逆矩阵的研究复兴与发展以来,有不少学者提出了关于广义逆矩阵的有限算法。第一个给出关于广义逆矩 相似文献
164.
A multidimensional version of the first Darboux problem is considered for a model second-order degenerating hyperbolic equation. Using the technique of functional spaces with a negative norm, the correct formulation of this problem in the Sobolev weighted space is proved. 相似文献
165.
G. A. Watson 《Advances in Computational Mathematics》1994,2(4):393-405
The orthogonal Procrustes problem involves finding an orthogonal matrix which transforms one given matrix into another in
the least-squares sense, and thus it requires the minimization of the Frobenius matrix norm. We consider, the solution of
this problem for a family of orthogonally invariant norms which includes the Frobenius norm as a special case. 相似文献
166.
Using the appropriate harmonic oscillator states and reasonable approximations, we construct coherent wavepackets corresponding
to the solutions of the Klein-Gordon equation for the attractive potentialV(r)=−k/r, k>0, in two and three space dimensions. We deduce the corresponding classical limit in two dimension by requiring that the
expectation value 〈r〉 of the radial variable is large. In the case of three dimensions, besides the condition of large 〈r〉, we make the uncertainty Δr=[〈r
2〉 − 〈r〉2]1/2 a minimum with respect to certain parameter of the wavepacket. We then investigate the trajectory traversed by the wavepacket
in the classical limit. We find that the classical limit of this relativistic quantal problem gives, in the leading order,
the same expression for the rate of motion of the perihelion as that given by the solution of the corresponding special relativistic
classical dynamical problem. We also briefly discuss some of the subtle aspects of the classical limit of the relativistic
quantal system, in general. 相似文献
167.
F. Blanchini 《Journal of Optimization Theory and Applications》1991,71(3):465-484
The linear state feedback synthesis problem for uncertain linear systems with state and control constraints is considered. We assume that the uncertainties are present in both the state and input matrices and they are bounded. The main goal is to find a linear control law assuring that both state and input constraints are fulfilled at each time. The problem is solved by confining the state within a compact and convex positively invariant set contained in the allowable state region.It is shown that, if the controls, the state, and the uncertainties are subject to linear inequality constraints and if a candidate compact and convex polyhedral set is assigned, a feedback matrix assuring that this region is positively invariant for the closed-loop system is found as a solution of a set of linear inequalities for both continuous and discrete time design problems.These results are extended to the case in which additive disturbances are present. The relationship between positive invariance and system stability is investigated and conditions for the existence of positively invariant regions of the polyhedral type are given.The author is grateful to Drs. Vito Cerone and Roberto Tempo for their comments. 相似文献
168.
A BRANCH BOUND METHOD FOR SUBSET SUM PROBLEM 总被引:1,自引:0,他引:1
吴士泉 《应用数学学报(英文版)》1994,10(3):302-314
ABRANCHBOUNDMETHODFORSUBSETSUMPROBLEMWUSHIQUAN(吴士泉)(InstituteofAppliedMathematics,theChineseAcademyofSciences,Beijing100080,C... 相似文献
169.
W. Brüggemann K. Fischer H. Jahnke 《Journal of Mathematical Modelling and Algorithms》2003,2(2):153-169
In Part I of this study, we suggest to identify an operations research (OR) problem with the equivalence class of models describing the problem and enhance the standard computer-science theory of computational complexity to be applicable to this situation of an often model-based OR context. The Discrete Lot-sizing and Scheduling Problem (DLSP) is analysed here in detail to demonstrate the difficulties which can arise if these aspects are neglected and to illustrate the new theoretical concept. In addition, a new minimal model is introduced for the DLSP which makes this problem eventually amenable to a rigorous analysis of its computational complexity. 相似文献
170.
We consider the least squares approximation of gridded 2D data by tensor product splines with free knots. The smoothing functional to be minimized—a generalization of the univariate Schoenberg functional—is chosen in such a way that the solution of the bivariate problem separates into the solution of a sequence of univariate problems in case of fixed knots. The resulting optimization problem is a constrained separable least squares problem with tensor product structure. Based on some ideas developed by the authors for the univariate case, an efficient method for solving the specially structured 2D problem is proposed, analyzed and tested on hand of some examples from the literature. 相似文献