全文获取类型
收费全文 | 838篇 |
免费 | 40篇 |
国内免费 | 32篇 |
专业分类
化学 | 33篇 |
力学 | 79篇 |
综合类 | 6篇 |
数学 | 708篇 |
物理学 | 84篇 |
出版年
2023年 | 4篇 |
2022年 | 7篇 |
2021年 | 8篇 |
2020年 | 17篇 |
2019年 | 16篇 |
2018年 | 22篇 |
2017年 | 14篇 |
2016年 | 25篇 |
2015年 | 23篇 |
2014年 | 36篇 |
2013年 | 51篇 |
2012年 | 48篇 |
2011年 | 38篇 |
2010年 | 39篇 |
2009年 | 57篇 |
2008年 | 53篇 |
2007年 | 51篇 |
2006年 | 43篇 |
2005年 | 27篇 |
2004年 | 37篇 |
2003年 | 41篇 |
2002年 | 48篇 |
2001年 | 21篇 |
2000年 | 36篇 |
1999年 | 19篇 |
1998年 | 22篇 |
1997年 | 23篇 |
1996年 | 9篇 |
1995年 | 9篇 |
1994年 | 7篇 |
1993年 | 12篇 |
1992年 | 10篇 |
1991年 | 1篇 |
1990年 | 10篇 |
1989年 | 3篇 |
1988年 | 4篇 |
1987年 | 3篇 |
1986年 | 3篇 |
1985年 | 2篇 |
1984年 | 4篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1971年 | 1篇 |
排序方式: 共有910条查询结果,搜索用时 0 毫秒
821.
Jian-lin Jiang Kun ChengCan-Can Wang Li-ping Wang 《Applied mathematics and computation》2012,218(12):6814-6824
The modified Weiszfeld method [Y. Vardi, C.H. Zhang, A modified Weiszfeld algorithm for the Fermat-Weber location problem, Mathematical Programming 90 (2001) 559-566] is perhaps the most widely-used algorithm for the single-source Weber problem (SWP). In this paper, in order to accelerate the efficiency for solving SWP, a new numerical method, called Weiszfeld-Newton method, is developed by combining the modified Weiszfeld method with the well-known Newton method. Global convergence of the new Weiszfeld-Newton method is proved under mild assumptions. For the multi-source Weber problem (MWP), a new location-allocation heuristic, Cooper-Weiszfeld-Newton method, is presented in the spirit of Cooper algorithm [L. Cooper, Heuristic methods for location-allocation problems, SIAM Review 6 (1964) 37-53], using the new Weiszfeld-Newton method in the location phase to locate facilities and adopting the nearest center reclassification algorithm (NCRA) in the allocation phase to allocate the customers. Preliminary numerical results are reported to verify the evident effectiveness of Weiszfeld-Newton method for SWP and Cooper-Weiszfeld-Newton method for MWP. 相似文献
822.
The generalized Nash equilibrium problem (GNEP) is a generalization of the standard Nash equilibrium problem (NEP),in which both the utility function and the strategy space of each player depend on the strategies chosen by all other players.This problem has been used to model various problems in applications.However,the convergent solution algorithms are extremely scare in the literature.In this paper,we present an incremental penalty method for the GNEP,and show that a solution of the GNEP can be found by solving a sequence of smooth NEPs.We then apply the semismooth Newton method with Armijo line search to solve latter problems and provide some results of numerical experiments to illustrate the proposed approach. 相似文献
823.
《Optimization》2012,61(9):1935-1955
The second-order cone complementarity problem (denoted by SOCCP) can be effectively solved by smoothing-type algorithms, which in general are designed based on some monotone line search. In this paper, based on a new smoothing function of the Fischer–Burmeister function, we propose a smoothing-type algorithm for solving the SOCCP. The proposed algorithm uses a new nonmonotone line search scheme, which contains the usual monotone line search as a special case. Under suitable assumptions, we show that the proposed algorithm is globally and locally quadratically convergent. Some numerical results are reported which indicate the effectiveness of the proposed algorithm. 相似文献
824.
非线性方程组的Newton流线法 总被引:2,自引:0,他引:2
为求解非线性方程组F(x)=0, 研究了Newton流方程xt=V(x)=-(DF(x))-1F(x),x(0)=x0,及数值Newton流xj+1=xj+hV(xj),h∈(0,1].导出了减幅指标gj(h)=||F(xj+1)||/||F(xj)||=1-h+h2djh<1和m重根x*附近的表示gj(h)=(1-h/m)m+h2O(||xj-x*||).最后基于4个可计算量gj,dj,Kj,qj,提出了新的Newton流线法,如果投入大量的随机初始点, 能找到所有实根、重根和复根. 相似文献
825.
用矩阵符号函数解(广义)周期Sylvester方程 总被引:1,自引:0,他引:1
(广义)周期Sylvester方程来源于周期离散线性系统. 本文主要研究这类方程满足特征值分别位于开左半复平面和开右半复平面或位于单位圆周内和单位圆周外条件时用矩阵符号函数求解的数值方法.并通过数值例子说明我们的结论. 相似文献
826.
827.
《Optimization》2012,61(1-2):191-203
On the basis of a work by B.Döring for ?1→ ?1maps we give a thourough proof of the convergence and on the convergence speed of the Newton Method for C 1αmaps in Banach spaces. We describe the application of this classical method for the existence (and local uniqueness and approximation) of nonlinear eigenvalue problems - abstractly - and for the concrete case of nonlinear Dirichlet problem which was for- merly attacked by variational methods 相似文献
828.
在大数据时代,随着数据采集手段的不断提升,大规模复合凸优化问题大量的出现在包括统计数据分析,机器与统计学习以及信号与图像处理等应用中.本文针对大规模复合凸优化问题介绍了一类快速邻近点算法.在易计算的近似准则和较弱的平稳性条件下,本文给出了该算法的全局收敛与局部渐近超线性收敛结果.同时,我们设计了基于对偶原理的半光滑牛顿法来高效稳定求解邻近点算法所涉及的重要子问题.最后,本文还讨论了如何通过深入挖掘并利用复合凸优化问题中由非光滑正则函数所诱导的非光滑二阶信息来极大减少半光滑牛顿算法中求解牛顿线性系统所需的工作量,从而进一步加速邻近点算法. 相似文献
829.
In dimension 2, we give a local characterization of Levi-Civita connections, improving a result by G. Thompson (1991), and of Newton–Cartan connections (connections which are limit of Levi-Civita connections). 相似文献
830.