全文获取类型
收费全文 | 10290篇 |
免费 | 1303篇 |
国内免费 | 455篇 |
专业分类
化学 | 834篇 |
晶体学 | 14篇 |
力学 | 1184篇 |
综合类 | 364篇 |
数学 | 6619篇 |
物理学 | 3033篇 |
出版年
2024年 | 24篇 |
2023年 | 102篇 |
2022年 | 317篇 |
2021年 | 292篇 |
2020年 | 220篇 |
2019年 | 234篇 |
2018年 | 257篇 |
2017年 | 371篇 |
2016年 | 487篇 |
2015年 | 340篇 |
2014年 | 611篇 |
2013年 | 691篇 |
2012年 | 547篇 |
2011年 | 615篇 |
2010年 | 516篇 |
2009年 | 653篇 |
2008年 | 673篇 |
2007年 | 673篇 |
2006年 | 572篇 |
2005年 | 509篇 |
2004年 | 438篇 |
2003年 | 380篇 |
2002年 | 376篇 |
2001年 | 306篇 |
2000年 | 277篇 |
1999年 | 235篇 |
1998年 | 220篇 |
1997年 | 183篇 |
1996年 | 173篇 |
1995年 | 136篇 |
1994年 | 86篇 |
1993年 | 87篇 |
1992年 | 80篇 |
1991年 | 42篇 |
1990年 | 49篇 |
1989年 | 31篇 |
1988年 | 35篇 |
1987年 | 26篇 |
1986年 | 33篇 |
1985年 | 32篇 |
1984年 | 34篇 |
1983年 | 12篇 |
1982年 | 23篇 |
1981年 | 7篇 |
1980年 | 6篇 |
1979年 | 8篇 |
1978年 | 6篇 |
1977年 | 7篇 |
1976年 | 3篇 |
1959年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
讨论了求解无约束线性最小二乘问题的一种并行单纯形法以及对它的改进算法并行共轭梯度—单纯形法 .算法本身具有很强的并行机制 ,能够充分地发挥并行机快速省时的特点 .本文也对算法做了理论分析 ,对算法的收敛性给予了证明 (在二维情形下 ) .最后做了数值实验 (由于软硬件条件的限制 ,并行算法未能在并行计算机上实现 ,鉴于这种情况 ,我们所做的数值实验均是在串行机上完成的 ) 相似文献
12.
曾六川 《高等学校计算数学学报(英文版)》2003,12(1)
The purpose of this paper is to investigate the problem of approximating fixed points of non-Lipschitizian asymptotically pseudocontractive mappings in an arbitrary real Banach space by the modified Ishikawa iterative sequences with errors. 相似文献
13.
A parallel method for time discretization of parabolic equations based on Laplace transformation and quadrature 总被引:5,自引:0,他引:5
We consider the discretization in time of an inhomogeneous parabolicequation in a Banach space setting, using a representation ofthe solution as an integral along a smooth curve in the complexleft half-plane which, after transformation to a finite interval,is then evaluated to high accuracy by a quadrature rule. Thisreduces the problem to a finite set of elliptic equations withcomplex coefficients, which may be solved in parallel. The paperis a further development of earlier work by the authors, wherewe treated the homogeneous equation in a Hilbert space framework.Special attention is given here to the treatment of the forcingterm. The method is combined with finite-element discretizationin spatial variables. 相似文献
14.
线性规划联合算法的理论与应用 总被引:6,自引:4,他引:2
本在[1]的基础上.较系统的叙述了线性规划联合算法的步骤、相关理论及其应用,指出该算法具有避免人工变量、减少迭代次数、使用灵活、应用方便等特点。 相似文献
15.
求解一类非单调线性互补问题的宽邻域内点方法及其计算复杂性 总被引:1,自引:0,他引:1
对于一类非单调线性互补问题给出了一种新的算法——宽邻域内点算法,并讨论了其计算复杂性。 相似文献
16.
We present a practical polynomial-time algorithm for computing the
zeta function of a Kummer curve over a finite field of small
characteristic. Such algorithms have recently been obtained using a
method of Kedlaya based upon Monsky–Washnitzer cohomology, and are of
interest in cryptography. We take a different approach.
The problem is reduced to that of computing the L-function
of a multiplicative character sum. This latter task is achieved via a
cohomological formula based upon the work of Dwork and Reich. We show,
however, that our method and that of Kedlaya are very closely related.Dedicated to the memory of Gian-Carlo Rota 相似文献
17.
On General Mixed Quasivariational Inequalities 总被引:5,自引:0,他引:5
In this paper, we suggest and analyze several iterative methods for solving general mixed quasivariational inequalities by using the technique of updating the solution and the auxiliary principle. It is shown that the convergence of these methods requires either the pseudomonotonicity or the partially relaxed strong monotonicity of the operator. Proofs of convergence is very simple. Our new methods differ from the existing methods for solving various classes of variational inequalities and related optimization problems. Various special cases are also discussed. 相似文献
18.
In this paper we focus on the problem of identifying the index sets P(x):=i|xi>0, N(x):={i|Fi(x)>0 and C(x):=i|xi=Fi(x)=0} for a solution x of the monotone nonlinear complementarity problem NCP(F). The correct identification of these sets is important from both theoretical and practical points of view. Such an identification enables us to remove complementarity conditions from the NCP and locally reduce the NCP to a system which can be dealt with more easily. We present a new technique that utilizes a sequence generated by the proximal point algorithm (PPA). Using the superlinear convergence property of PPA, we show that the proposed technique can identify the correct index sets without assuming the nondegeneracy and the local uniqueness of the solution.This work was supported in part by a Grant-in-Aid for Scientific Research from the Ministry of Education, Science, Sports and Culture of Japan.Mathematics Subject Classification (2000): 90C33, 65K10 相似文献
19.
Clemens Heuberger 《Periodica Mathematica Hungarica》2004,49(2):65-89
We study digit expansions with arbitrary integer digits in base q (q integer) and the Fibonacci base such that the sum of the absolute values of the digits is minimal. For the Fibonacci case, we describe a unique minimal expansion and give a greedy algorithm to compute it. Additionally, transducers to calculate minimal expansions from other expansions are given. For the case of even integer bases q, similar results are given which complement those given in [6]. 相似文献
20.
In this paper, a generalized anti–maximum principle for the second order differential operator with potentials is proved. As an application, we will give a monotone iterative scheme for periodic solutions of nonlinear second order equations. Such a scheme involves the Lp norms of the growth, 1 ≤ p ≤ ∞, while the usual one is just the case p = ∞. 相似文献