全文获取类型
收费全文 | 10103篇 |
免费 | 1107篇 |
国内免费 | 797篇 |
专业分类
化学 | 715篇 |
晶体学 | 6篇 |
力学 | 952篇 |
综合类 | 184篇 |
数学 | 6921篇 |
物理学 | 3229篇 |
出版年
2024年 | 7篇 |
2023年 | 99篇 |
2022年 | 123篇 |
2021年 | 152篇 |
2020年 | 219篇 |
2019年 | 199篇 |
2018年 | 207篇 |
2017年 | 292篇 |
2016年 | 345篇 |
2015年 | 243篇 |
2014年 | 471篇 |
2013年 | 781篇 |
2012年 | 551篇 |
2011年 | 580篇 |
2010年 | 470篇 |
2009年 | 622篇 |
2008年 | 673篇 |
2007年 | 671篇 |
2006年 | 650篇 |
2005年 | 540篇 |
2004年 | 456篇 |
2003年 | 464篇 |
2002年 | 426篇 |
2001年 | 393篇 |
2000年 | 345篇 |
1999年 | 334篇 |
1998年 | 278篇 |
1997年 | 211篇 |
1996年 | 218篇 |
1995年 | 144篇 |
1994年 | 105篇 |
1993年 | 95篇 |
1992年 | 77篇 |
1991年 | 59篇 |
1990年 | 62篇 |
1989年 | 32篇 |
1988年 | 52篇 |
1987年 | 40篇 |
1986年 | 32篇 |
1985年 | 52篇 |
1984年 | 45篇 |
1983年 | 20篇 |
1982年 | 31篇 |
1981年 | 19篇 |
1980年 | 23篇 |
1979年 | 30篇 |
1978年 | 13篇 |
1977年 | 15篇 |
1976年 | 11篇 |
1974年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
In this paper we derive a priori and a posteriori error estimates for cell centered finite volume approximations of nonlinear conservation laws on polygonal bounded domains. Numerical experiments show the applicability of the a posteriori result for the derivation of local adaptive solution strategies.
102.
103.
In this paper, we study the central limit theorem and its weak invariance principle for sums of a stationary sequence of random
variables, via a martingale decomposition. Our conditions involve the conditional expectation of sums of random variables
with respect to the distant past. The results contribute to the clarification of the central limit question for stationary
sequences.
Magda Peligrad is supported in part by a Charles Phelps Taft research support grant at the Univeristy of Cincinnati and the
NSA grant H98230-05-1-0066. 相似文献
104.
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. 相似文献
105.
首先用BFW势函数形式拟合了在CCSD(T)/aug-cc-pVQZ理论水平下计算的He-HCl相互作用能数据,获得了He原子与HCl分子相互作用的各向异性势;然后采用CC近似方法计算了He-HCl碰撞体系的微分散射截面和分波散射截面,并总结了分波散射截面的变化规律.结果表明,拟合势不但表达形式简洁,而且较好地描述了He-HCl系统相互作用的各向异性特征;利用碰撞体系分子间势的量子化学从头计算结果,可解决势能参数难以确定的问题.对进一步研究原子与分子碰撞机理有一定参考价值.
关键词:
各向异性势
势能参数
密耦近似
分波散射截面 相似文献
106.
Martin Skutella 《Mathematical Programming》2002,91(3):493-514
In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex
to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed
along a single path so that the total flow through any edge is at most its capacity. Moreover, the total cost must not exceed
a given budget. This problem has been introduced by Kleinberg [7] and generalizes several NP-complete problems from various
areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing, and virtual-circuit routing.
Kolliopoulos and Stein [9] and Dinitz, Garg, and Goemans [4] developed algorithms improving the first approximation results
of Kleinberg for the problem of minimizing the violation of edge capacities and for other variants. However, known techniques
do not seem to be capable of providing solutions without also violating the cost constraint. We give the first approximation
results with hard cost constraints. Moreover, all our results dominate the best known bicriteria approximations. Finally,
we provide results on the hardness of approximation for several variants of the problem.
Received: August 23, 2000 / Accepted: April 20, 2001?Published online October 2, 2001 相似文献
107.
Polyharmonic splines are used to interpolate data in a stationary multilevel iterative refinement scheme. By using such functions the necessary tools are provided to obtain simple pointwise error bounds on the approximation. Linear convergence between levels is shown for regular data on a scaled multiinteger grid, and a multilevel domain decomposition method. 相似文献
108.
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 . 相似文献
109.
110.
椭圆型问题一类广义差分法的L~2模误差估计 总被引:1,自引:0,他引:1
1.引 言 广义差分法作为处理偏微分方程的离散技术,能够保持质量,动量,能量等物理量的守恒.广义差分法(有些文献称为box method[3];finite volume element method[4],[5],[6])利用在对偶剖分体积单元积分原始方程,并将近似解限制于某一有限元空间而得到离散方程.因此,它在局部区域保持了原始方程的物理守恒性和其他重要特性.从而被广泛地应用于数值求解数学物理方程,特别是计算流体力学和热传导问题[11]. 对广义差分法的研究已有许多文献,专著[10]有详细的介绍.早期的工作主要考虑标准的重心对偶剖分.近年来Cai et,al[4],[5],[6],在某些假定下对较一般的对偶剖分给出了能量模误差估计,Huang and Xi[9]去掉了文献[6]中的这些限制.Chou,Li[8]和Li, 相似文献