全文获取类型
收费全文 | 5810篇 |
免费 | 570篇 |
国内免费 | 531篇 |
专业分类
化学 | 422篇 |
晶体学 | 5篇 |
力学 | 402篇 |
综合类 | 105篇 |
数学 | 4236篇 |
物理学 | 1741篇 |
出版年
2023年 | 46篇 |
2022年 | 71篇 |
2021年 | 71篇 |
2020年 | 109篇 |
2019年 | 117篇 |
2018年 | 105篇 |
2017年 | 128篇 |
2016年 | 158篇 |
2015年 | 127篇 |
2014年 | 215篇 |
2013年 | 476篇 |
2012年 | 279篇 |
2011年 | 332篇 |
2010年 | 281篇 |
2009年 | 379篇 |
2008年 | 409篇 |
2007年 | 394篇 |
2006年 | 402篇 |
2005年 | 308篇 |
2004年 | 274篇 |
2003年 | 261篇 |
2002年 | 250篇 |
2001年 | 224篇 |
2000年 | 200篇 |
1999年 | 204篇 |
1998年 | 168篇 |
1997年 | 123篇 |
1996年 | 132篇 |
1995年 | 72篇 |
1994年 | 76篇 |
1993年 | 63篇 |
1992年 | 44篇 |
1991年 | 39篇 |
1990年 | 42篇 |
1989年 | 24篇 |
1988年 | 41篇 |
1987年 | 25篇 |
1986年 | 21篇 |
1985年 | 33篇 |
1984年 | 34篇 |
1983年 | 16篇 |
1982年 | 27篇 |
1981年 | 17篇 |
1980年 | 17篇 |
1979年 | 21篇 |
1978年 | 10篇 |
1977年 | 14篇 |
1976年 | 8篇 |
1974年 | 7篇 |
1970年 | 3篇 |
排序方式: 共有6911条查询结果,搜索用时 0 毫秒
31.
Markus Hegland Jochen Garcke Vivien Challis 《Linear algebra and its applications》2007,420(2-3):249-275
The combination technique has repeatedly been shown to be an effective tool for the approximation with sparse grid spaces. Little is known about the reasons of this effectiveness and in some cases the combination technique can even break down. It is known, however, that the combination technique produces an exact result in the case of a projection into a sparse grid space if the involved partial projections commute.
The performance of the combination technique is analysed using a projection framework and the C/S decomposition. Error bounds are given in terms of angles between the spanning subspaces or the projections onto these subspaces. Based on this analysis modified combination coefficients are derived which are optimal in a certain sense and which can substantially extend the applicability and performance of the combination technique. 相似文献
32.
Numerical analysis for stochastic age-dependent population equations with Poisson jumps 总被引:1,自引:0,他引:1
In this paper, stochastic age-dependent population equations with Poisson jumps are considered. In general, most of stochastic age-dependent population equations with jumps do not have explicit solutions, thus numerical approximation schemes are invaluable tools for exploring their properties. The main purpose of this paper is to develop a numerical Euler scheme and show the convergence of the numerical approximation solution to the true solution. 相似文献
33.
设Λ={λn}n∞=1为正的实数数列,且当n→∞时,有λn↘0.本文给出了当λn≤Mn-1/2,n=1,2,…,(其中M>0为一正常数)时Müntz系统{xλn}的有理函数在Lp[0,1]空间的逼近速度,主要结论为Rn(f,Λ) Lp≤CMω(f,n-1/2)Lp,1≤p≤∞. 相似文献
34.
Andreas Rößler 《BIT Numerical Mathematics》2006,46(1):97-110
A general class of stochastic Runge–Kutta methods for Itô stochastic differential equation systems w.r.t. a one-dimensional Wiener process is introduced. The colored rooted tree analysis is applied to derive conditions for the coefficients of the stochastic Runge–Kutta method assuring convergence in the weak sense with a prescribed order. Some coefficients for new stochastic Runge–Kutta schemes of order two are calculated explicitly and a simulation study reveals their good performance. 相似文献
35.
In the present paper, we study the rate of convergence in simultaneous approximation for the Bézier variant of the Baskakov-Beta operators by using the decomposition technique of functions of bounded variation. 相似文献
36.
Two different problems are proposed as approximations of the usual system modelling natural convection under the Oberbeck-Boussinesq assumptions. The error is evaluated by means of the norm of its gradient in the Hilbert space. The average Nusselt number is also estimated. 相似文献
37.
In general, we will use the numerical differentiation when dealing with the differential equations. Thus the differential equations can be transformed into algebraic equations and then we can get the numerical solutions. But as we all have known, the numerical differentiation process is very sensitive to even a small level of errors. In contrast it is expected that on average the numerical integration process is much less sensitive to errors. In this paper, based on the Sinc method we provide a new method using Sinc method incorporated with the double exponential transformation based on the interpolation of the highest derivatives (SIHD) for the differential equations. The error in the approximation of the solution is shown to converge at an exponential rate. The numerical results show that compared with the exiting results, our method is of high accuracy, of good convergence with little computational efforts. It is easy to treat nonhomogeneous mixed boundary condition for our method, which is unlike the traditional Sinc method. 相似文献
38.
Jing-na Li Xiao-feng Wang Zheng-an Yao 《应用数学学报(英文版)》2007,23(3):421-432
In this paper, we propose a model in studying soft ferromagnetic films, which is readily accessible experimentally. By using penalty approximation and compensated compactness, we prove that the dynamical equation in thin film has a local weak solution. Moreover, the corresponding linear equation is also dealt with in great detail. 相似文献
39.
J. Keilson 《Annals of Operations Research》1987,9(1):439-447
A redundant system of independent repairable components with general failure time and repair time distributions is considered. It is shown that the system failure time has an expectation dependent only on the mean failure times and mean repair times of the components and not on their distributions. An intuitive argument is provided, based on the time of onset of the quasi-stationary distribution on the set of working states, to show that for highly reliable systems, the system failure time is exponentially distributed to good approximation. The argument also justifies a simple figure of merit for the quality of the exponential approximation. A key ingredient in the analysis is the system relaxation time, an informal review of which is provided. 相似文献
40.
Arne Barinka Stephan Dahlke Wolfgang Dahmen 《Advances in Computational Mathematics》2006,24(1-4):5-34
Recently adaptive wavelet methods have been developed which can be shown to exhibit an asymptotically optimal accuracy/work
balance for a wide class of variational problems including classical elliptic boundary value problems, boundary integral equations
as well as certain classes of noncoercive problems such as saddle point problems. A core ingredient of these schemes is the
approximate application of the involved operators in standard wavelet representation. Optimal computational complexity could
be shown under the assumption that the entries in properly compressed standard representations are known or computable in
average at unit cost. In this paper we propose concrete computational strategies and show under which circumstances this assumption
is justified in the context of elliptic boundary value problems.
Dedicated to Charles A. Micchelli on the occasion of his 60th birthday
Mathematics subject classifications (2000) 41A25, 41A46, 65F99, 65N12, 65N55.
This work has been supported in part by the Deutsche Forschungsgemeinschaft SFB 401, the first and third author are supported
in part by the European Community's Human Potential Programme under contract HPRN-CT-202-00286 (BREAKING COMPLEXITY). The
second author acknowledges the financial support provided through the European Union's Human Potential Programme, under contract
HPRN-CT-2002-00285 (HASSIP) and through DFG grant DA 360/4–1. 相似文献