首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   8681篇
  免费   712篇
  国内免费   717篇
化学   263篇
晶体学   6篇
力学   404篇
综合类   204篇
数学   8695篇
物理学   538篇
  2024年   12篇
  2023年   87篇
  2022年   86篇
  2021年   149篇
  2020年   200篇
  2019年   214篇
  2018年   219篇
  2017年   264篇
  2016年   271篇
  2015年   169篇
  2014年   363篇
  2013年   700篇
  2012年   408篇
  2011年   471篇
  2010年   390篇
  2009年   570篇
  2008年   507篇
  2007年   521篇
  2006年   506篇
  2005年   398篇
  2004年   347篇
  2003年   343篇
  2002年   369篇
  2001年   332篇
  2000年   321篇
  1999年   274篇
  1998年   260篇
  1997年   234篇
  1996年   158篇
  1995年   139篇
  1994年   129篇
  1993年   93篇
  1992年   63篇
  1991年   65篇
  1990年   65篇
  1989年   37篇
  1988年   29篇
  1987年   34篇
  1986年   30篇
  1985年   46篇
  1984年   38篇
  1983年   18篇
  1982年   40篇
  1981年   27篇
  1980年   17篇
  1979年   20篇
  1978年   24篇
  1977年   20篇
  1976年   14篇
  1936年   5篇
排序方式: 共有10000条查询结果,搜索用时 781 毫秒
1.
In this paper, we study the local linear convergence properties of a versatile class of Primal–Dual splitting methods for minimizing composite non-smooth convex optimization problems. Under the assumption that the non-smooth components of the problem are partly smooth relative to smooth manifolds, we present a unified local convergence analysis framework for these methods. More precisely, in our framework, we first show that (i) the sequences generated by Primal–Dual splitting methods identify a pair of primal and dual smooth manifolds in a finite number of iterations, and then (ii) enter a local linear convergence regime, which is characterized based on the structure of the underlying active smooth manifolds. We also show how our results for Primal–Dual splitting can be specialized to cover existing ones on Forward–Backward splitting and Douglas–Rachford splitting/ADMM (alternating direction methods of multipliers). Moreover, based on these obtained local convergence analysis result, several practical acceleration techniques are discussed. To exemplify the usefulness of the obtained result, we consider several concrete numerical experiments arising from fields including signal/image processing, inverse problems and machine learning. The demonstration not only verifies the local linear convergence behaviour of Primal–Dual splitting methods, but also the insights on how to accelerate them in practice.  相似文献   
2.
This work is concerned with the extension of the Jacobi spectral Galerkin method to a class of nonlinear fractional pantograph differential equations. First, the fractional differential equation is converted to a nonlinear Volterra integral equation with weakly singular kernel. Second, we analyze the existence and uniqueness of solutions for the obtained integral equation. Then, the Galerkin method is used for solving the equivalent integral equation. The error estimates for the proposed method are also investigated. Finally, illustrative examples are presented to confirm our theoretical analysis.  相似文献   
3.
4.
5.
6.
非线性互补问题的一种全局收敛的显式光滑Newton方法   总被引:2,自引:0,他引:2  
本针对Po函数非线性互补问题,给出了一种显式光滑Newton方法,该方法将光滑参数μ进行显式迭代而不依赖于Newton方向的搜索过程,并在适当的假设条件下,证明了算法的全局收敛性。  相似文献   
7.
Let $\{\xi_{\bold t}, {\bold t} \in {\bold Z}^d\}$ be a nonuniform $\varphi$-mixing strictly stationary real random field with $E\xi_{\bold 0}=0, E|\xi_{\bold 0}|^{2+\delta}<\infty$ for some $0<\delta<1$. A sufficient condition is given for the sequence of partial sum set-indexed process $\{Z_n(A),\ A\in \Cal A\}$ to converge to Brownian motion. By a direct calculation, the author shows that the result holds for a more general class of set index ${\Cal A}$, where ${\Cal A}$ is assumed only to have the metric entropy exponent $r, 0相似文献   
8.
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…  相似文献   
9.
Over the last 20 years a large number of algorithms has been published to improve the speed and domain of convergence of continued fractions. In this survey we show that these algorithms are strongly related. Actually, they essentially boil down to two main principles.We also prove some results on asymptotic expansions of tail values of limit periodic continued fractions.Dedicated to Luigi Gatteschi on his seventieth birthdayThis research was partially supported by The Norwegian Research Council and by the HMC project ROLLS, under contract CHRX-CT93-0416.  相似文献   
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号