全文获取类型
收费全文 | 20892篇 |
免费 | 2327篇 |
国内免费 | 1015篇 |
专业分类
化学 | 4655篇 |
晶体学 | 77篇 |
力学 | 2382篇 |
综合类 | 493篇 |
数学 | 11834篇 |
物理学 | 4793篇 |
出版年
2024年 | 47篇 |
2023年 | 228篇 |
2022年 | 552篇 |
2021年 | 717篇 |
2020年 | 547篇 |
2019年 | 558篇 |
2018年 | 556篇 |
2017年 | 778篇 |
2016年 | 908篇 |
2015年 | 646篇 |
2014年 | 1136篇 |
2013年 | 1376篇 |
2012年 | 1262篇 |
2011年 | 1181篇 |
2010年 | 1025篇 |
2009年 | 1250篇 |
2008年 | 1265篇 |
2007年 | 1333篇 |
2006年 | 1097篇 |
2005年 | 960篇 |
2004年 | 810篇 |
2003年 | 776篇 |
2002年 | 657篇 |
2001年 | 577篇 |
2000年 | 539篇 |
1999年 | 436篇 |
1998年 | 417篇 |
1997年 | 393篇 |
1996年 | 292篇 |
1995年 | 290篇 |
1994年 | 227篇 |
1993年 | 204篇 |
1992年 | 177篇 |
1991年 | 135篇 |
1990年 | 130篇 |
1989年 | 95篇 |
1988年 | 88篇 |
1987年 | 68篇 |
1986年 | 74篇 |
1985年 | 82篇 |
1984年 | 80篇 |
1983年 | 27篇 |
1982年 | 41篇 |
1981年 | 26篇 |
1980年 | 23篇 |
1979年 | 39篇 |
1978年 | 22篇 |
1977年 | 35篇 |
1976年 | 20篇 |
1957年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
11.
杨晓光 《应用数学学报(英文版)》1997,13(4):337-341
1.IntroductionIntillspaperweanalyzetheconvergenceonmultiplicativeiterativealgorithmsfortheIninimizationofadiffcrentiablefunctiondefinedonthepositiveorthantofR".ThealgorithmissllggestedbyEggermolltl'],andisrelatedtotheEM[2](Expextation--Maximization)algoritllnlforPositronemissiontonlography[']andimagereconstructi..14].Wecollsidertheproblenl"linf(x)s.t.x20.Themultiplicativeiterativealgorithmshavethel'orlniforj=l,2,',n,withAhdeterminedthroughalinesearch.Whilelusem[5]establishedanelegantconv… 相似文献
12.
Ji-Ming Peng 《Mathematical Programming》1997,78(3):347-355
In this paper we propose a class of merit functions for variational inequality problems (VI). Through these merit functions,
the variational inequality problem is cast as unconstrained minimization problem. We estimate the growth rate of these merit
functions and give conditions under which the stationary points of these functions are the solutions of VI.
This work was supported by the state key project “Scientific and Engineering Computing”. 相似文献
13.
Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when
viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms
whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential
equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration
process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using
the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order
algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions”
defined by nonvanishing Lie brackets. 相似文献
14.
Jinchao Xu 《应用数学学报(英文版)》2002,18(2):185-200
Abstract Some new local and parallel finite element algorithms are proposed and analyzed in this paper foreigenvalue problems.With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced tothe solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraicsystems on fine grid by using some local and parallel procedure.A theoretical tool for analyzing these algorithmsis some local error estimate that is also obtained in this paper for finite element approximations of eigenvectorson general shape-regular grids. 相似文献
15.
M. M. Kostreva 《Journal of Optimization Theory and Applications》1989,62(1):63-76
Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments. 相似文献
16.
17.
Well-Posedness by Perturbations of Variational Problems 总被引:3,自引:0,他引:3
Lemaire B. Ould Ahmed Salem C. Revalski J. P. 《Journal of Optimization Theory and Applications》2002,115(2):345-368
In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented. 相似文献
18.
This paper presents an adaptive memory-based method for solving the Capacitated Vehicle Routing Problem (CVRP), called BoneRoute. The CVRP deals with the problem of finding the optimal sequence of deliveries conducted by a fleet of homogeneous vehicles, based at one depot, to serve a set of customers. The computational performance of the BoneRoute was found to be very efficient, producing high quality solutions over two sets of well known case studies examined. 相似文献
19.
R. J. Vanderbei 《Mathematical Programming》1989,43(1-3):31-44
The affine-scaling modification of Karmarkar's algorithm is extended to solve problems with free variables. This extended primal algorithm is used to prove two important results. First the geometrically elegant feasibility algorithm proposed by Chandru and Kochar is the same algorithm as the one obtained by appending a single column of residuals to the constraint matrix. Second the dual algorithm as first described by Adler et al., is the same as the extended primal algorithm applied to the dual. 相似文献
20.
In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system
of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem
in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these
algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid
are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset
of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven. 相似文献