全文获取类型
收费全文 | 10390篇 |
免费 | 1805篇 |
国内免费 | 619篇 |
专业分类
化学 | 1142篇 |
晶体学 | 144篇 |
力学 | 2304篇 |
综合类 | 158篇 |
数学 | 5071篇 |
物理学 | 3995篇 |
出版年
2024年 | 14篇 |
2023年 | 88篇 |
2022年 | 147篇 |
2021年 | 175篇 |
2020年 | 263篇 |
2019年 | 227篇 |
2018年 | 205篇 |
2017年 | 317篇 |
2016年 | 341篇 |
2015年 | 239篇 |
2014年 | 425篇 |
2013年 | 711篇 |
2012年 | 517篇 |
2011年 | 503篇 |
2010年 | 479篇 |
2009年 | 533篇 |
2008年 | 590篇 |
2007年 | 694篇 |
2006年 | 629篇 |
2005年 | 649篇 |
2004年 | 551篇 |
2003年 | 597篇 |
2002年 | 515篇 |
2001年 | 452篇 |
2000年 | 425篇 |
1999年 | 393篇 |
1998年 | 304篇 |
1997年 | 294篇 |
1996年 | 186篇 |
1995年 | 175篇 |
1994年 | 133篇 |
1993年 | 147篇 |
1992年 | 110篇 |
1991年 | 95篇 |
1990年 | 83篇 |
1989年 | 47篇 |
1988年 | 57篇 |
1987年 | 52篇 |
1986年 | 44篇 |
1985年 | 62篇 |
1984年 | 52篇 |
1983年 | 26篇 |
1982年 | 35篇 |
1981年 | 46篇 |
1980年 | 26篇 |
1979年 | 34篇 |
1978年 | 42篇 |
1977年 | 32篇 |
1976年 | 20篇 |
1971年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
102.
含高阶非线性效应的薛定谔方程的精确解研究 总被引:1,自引:0,他引:1
利用孤子理论,研究了含三次和五次非线性项的非线性薛定谔方程,在参数取不同值时得到了方程的新型亮孤子解、新型暗孤子解和新的三角函数周期解。 相似文献
103.
本文我们给出一个修正的非线性扩散方程模型,与Cotte Lions和Morel的模型相比该模型有许多实质上的优点。主要的想法是把原来去噪声部分:卷积Gauss过程替代为解一个有界区域上的线性抛物方程问题,因此避开了对初始数值如何全平面延拓的问题。我们从数学上的证明该问题解的存在性和适定性,同时给出对矩形域情况的解的级数形式。最后我们给基于本模型的数值计算差分模型,并且给出几个具体图像在该模型下处理结果。 相似文献
104.
在backstepping程序中,把非线性自适应控制和鲁棒控制连接起来,为参数化的严格反馈系统在不确定性存在的情况下,建立了一种鲁棒自适应控制方案.非线性自适应控制被用来处理系统的线性参数化部分,而鲁棒控制通过引进非线性阻尼项被用来处理不确定性部分.与现有的方案不同,作者给出了非线性阻尼项的无限种选择,而不是仅仅一种选择.通过使用一种合适的选择,能够设计一个鲁棒自适应控制器.它不仅能够保证对不确定性的鲁棒性,而且能够使输出误差任意小,以及用较小的控制努力取得较好的性能. 相似文献
105.
本文利用势井理论讨论一类非线性波动方程的初边值问题 .我们构造其稳定集 W和不稳定集 V,证明了当初值属于 W时 ,对 β∈ R整体弱解存在并且利用乘子法得到当 β>0解的指数衰减估计 ;当初值属于 V时 ,而 β<0时 ,解将爆破 相似文献
106.
107.
Jinyan Fan 《Computational Optimization and Applications》2006,34(2):215-227
In this paper, we present the new trust region method for nonlinear equations with the trust region converging to zero. The
new method preserves the global convergence of the traditional trust region methods in which the trust region radius will
be larger than a positive constant. We study the convergence rate of the new method under the local error bound condition
which is weaker than the nonsingularity. An example given by Y.X. Yuan shows that the convergence rate can not be quadratic.
Finally, some numerical results are given.
This work is supported by Chinese NSFC grants 10401023 and 10371076, Research Grants for Young Teachers of Shanghai Jiao Tong
University, and E-Institute of Computational Sciences of Shanghai Universities.
An erratum to this article is available at . 相似文献
108.
Ronald H. Nickel Igor Mikolic-Torreira Jon W. Tolle 《Computational Optimization and Applications》2006,35(1):109-126
Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked
on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready
to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the
cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the
Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements
of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear
and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization
viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions
are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives
are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult
to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation
and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this
problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed
version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern
search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned
as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous
computers in an office environment, thus, drastically reducing the time required to find the solution. 相似文献
109.
Successive column correction algorithms for solving sparse nonlinear systems of equations 总被引:1,自引:0,他引:1
Guangye Li 《Mathematical Programming》1989,43(1-3):187-207
This paper presents two algorithms for solving sparse nonlinear systems of equations: the CM-successive column correction algorithm and a modified CM-successive column correction algorithm. Aq-superlinear convergence theorem and anr-convergence order estimate are given for both algorithms. Some numerical results and the detailed comparisons with some previously established algorithms show that the new algorithms have some promise of being very effective in practice.This research was partially supported by contracts and grants: DOE DE-AS05-82ER1-13016, AFOSR 85-0243 at Rice University, Houston, U.S.A. and Natural Sciences and Engineering Research Council of Canada grant A-8639. 相似文献
110.