全文获取类型
收费全文 | 27565篇 |
免费 | 2387篇 |
国内免费 | 2051篇 |
专业分类
化学 | 1735篇 |
晶体学 | 44篇 |
力学 | 2698篇 |
综合类 | 477篇 |
数学 | 23187篇 |
物理学 | 3862篇 |
出版年
2024年 | 57篇 |
2023年 | 241篇 |
2022年 | 353篇 |
2021年 | 388篇 |
2020年 | 588篇 |
2019年 | 628篇 |
2018年 | 697篇 |
2017年 | 792篇 |
2016年 | 844篇 |
2015年 | 593篇 |
2014年 | 1152篇 |
2013年 | 2199篇 |
2012年 | 1300篇 |
2011年 | 1484篇 |
2010年 | 1362篇 |
2009年 | 1801篇 |
2008年 | 1892篇 |
2007年 | 1910篇 |
2006年 | 1693篇 |
2005年 | 1405篇 |
2004年 | 1264篇 |
2003年 | 1278篇 |
2002年 | 1132篇 |
2001年 | 843篇 |
2000年 | 884篇 |
1999年 | 786篇 |
1998年 | 711篇 |
1997年 | 651篇 |
1996年 | 495篇 |
1995年 | 413篇 |
1994年 | 316篇 |
1993年 | 272篇 |
1992年 | 247篇 |
1991年 | 195篇 |
1990年 | 174篇 |
1989年 | 108篇 |
1988年 | 87篇 |
1987年 | 82篇 |
1986年 | 75篇 |
1985年 | 99篇 |
1984年 | 90篇 |
1983年 | 52篇 |
1982年 | 70篇 |
1981年 | 57篇 |
1980年 | 43篇 |
1979年 | 45篇 |
1978年 | 45篇 |
1977年 | 38篇 |
1976年 | 19篇 |
1973年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
851.
本文在给定的精度要求下,利用多项式及Fourier级数,给出了求热传导方程Cauchy问题在某处的近似解的方法,并把此方法推广成为求解任一有界域上满足给定精度要求的近似解的方法。 相似文献
852.
Pedro O. Cubillos 《Journal of Computational and Applied Mathematics》1984,10(1):25-31
A variant of the Nyström method based on Simpson's rule is presented. This is designed to deal with integral operators with kernels k(s, t) that are not continuous along the diagonal s = t. A complete analysis is carried out, generalizations for other interpolatory quadrature rules are proposed; also a variant using Gaussian quadrature is considered and examples are given. 相似文献
853.
Irwin Guttman Ulrich Menzefricke 《Annals of the Institute of Statistical Mathematics》1982,34(1):319-326
Summary We consider a sequence of independent random variables whose densities depend on a parameter which is subject to a change
at an unknown time point. A Bayesian decision-theoretic approach is used to obtain an optimal choice of changepoint. The exponential
and multivariate normal models are analyzed, and some numerical examples are given. 相似文献
854.
A new simplicial variable dimension restart algorithm is introduced to solve the nonlinear complementarity problem on the
product spaceS of unit simplices. The triangulation which underlies the algorithm differs from the triangulations ofS used thus far. Moreover, the number of rays along which the algorithm can leave the arbitrarily chosen starting point is
much larger. More precisely, there is a ray leading from the starting point to each vertex ofS. In caseS is the product ofn one-dimensional unit simplices the alogrithm is similar to the octahedral algorithm onR
n
having 2
n
rays. Also, the accuracy of an approximate solution in the terminal simplex of the algorithm is in general better than for
the other algorithms onS. Computational results will show that the number of iterations for the new algorithm is much less. The examples concern the
computation of equilibria in noncooperative games, exchange economies and trade models.
This author is financially supported by the Netherlands Organisation for the Advancement of Pure Research (ZWO), Grant 46-98.
This research is part of the VF-program “Equilibrium and Disequilibrium in Demand and Supply” which has been approved by the
Netherlands ministry of education and sciences. 相似文献
855.
Florian A. Potra 《Mathematical Programming》2001,91(1):99-115
Sufficient conditions are given for the Q-superlinear convergence of the iterates produced by primal-dual interior-point methods
for linear complementarity problems. It is shown that those conditions are satisfied by several well known interior-point
methods. In particular it is shown that the iteration sequences produced by the simplified predictor–corrector method of Gonzaga
and Tapia, the simplified largest step method of Gonzaga and Bonnans, the LPF+ algorithm of Wright, the higher order methods
of Wright and Zhang, Potra and Sheng, and Stoer, Wechs and Mizuno are Q-superlinearly convergent.
Received: February 9, 2000 / Accepted: February 20, 2001?Published online May 3, 2001 相似文献
856.
Several authors have demonstrated how reductions can be used to improve the efficiency with which the Steiner Problem in Graphs can be solved. Previous reduction algorithms have been largely ad hoc in nature. This paper uses a theory of confluence to show that, in many cases, all maximal reduction sequences are equivalent, gaining insights into the design of reduction algorithms that obtain a maximum degree of reduction. 相似文献
857.
An existence and uniqueness of solutions for boundary value problemsandare established, by employing a priori estimates for all solutions and the Schau-der fixed point theorem. Some of these results extend earlier results due toUsmani(1979), Yang(1988), and Pei(1997). 相似文献
858.
A note on the spectrum of an upper triangular operator matrix 总被引:1,自引:0,他引:1
Mohamed Barraa Mohamed Boumazgour 《Proceedings of the American Mathematical Society》2003,131(10):3083-3088
Let be a upper triangular operator matrix acting on the Banach space . We investigate the set of the operators for which , where denotes the spectrum.
859.
Minimizing risk models in stochastic shortest path problems 总被引:1,自引:0,他引:1
Yoshio Ohtsubo 《Mathematical Methods of Operations Research》2003,57(1):79-88
860.
We describe two new methods for locating the dew/bubble curves of fluids. One is a numerical method and the other an analytical method based on the use of series expansions. The utility of these two methods is illustrated by application to a simple one-component fluid model and to several model polydisperse fluids. The numerical method is based on a new geometric representation of the equilibrium conditions-similar in spirit to the geometric representations often used for solving the equilibrium conditions of pure fluids. Our calculations show that the series-expansion technique can be quite effective at producing accurate representations of the phase boundaries. 相似文献