全文获取类型
收费全文 | 17849篇 |
免费 | 1954篇 |
国内免费 | 1056篇 |
专业分类
化学 | 5815篇 |
晶体学 | 42篇 |
力学 | 1621篇 |
综合类 | 152篇 |
数学 | 9319篇 |
物理学 | 3910篇 |
出版年
2023年 | 193篇 |
2022年 | 198篇 |
2021年 | 293篇 |
2020年 | 543篇 |
2019年 | 422篇 |
2018年 | 389篇 |
2017年 | 392篇 |
2016年 | 641篇 |
2015年 | 615篇 |
2014年 | 830篇 |
2013年 | 1475篇 |
2012年 | 955篇 |
2011年 | 1034篇 |
2010年 | 756篇 |
2009年 | 1149篇 |
2008年 | 1110篇 |
2007年 | 1156篇 |
2006年 | 1061篇 |
2005年 | 812篇 |
2004年 | 749篇 |
2003年 | 715篇 |
2002年 | 631篇 |
2001年 | 592篇 |
2000年 | 538篇 |
1999年 | 492篇 |
1998年 | 469篇 |
1997年 | 357篇 |
1996年 | 360篇 |
1995年 | 236篇 |
1994年 | 204篇 |
1993年 | 186篇 |
1992年 | 129篇 |
1991年 | 122篇 |
1990年 | 106篇 |
1989年 | 83篇 |
1988年 | 98篇 |
1987年 | 65篇 |
1986年 | 76篇 |
1985年 | 68篇 |
1984年 | 85篇 |
1983年 | 37篇 |
1982年 | 55篇 |
1981年 | 51篇 |
1980年 | 38篇 |
1979年 | 48篇 |
1978年 | 52篇 |
1977年 | 54篇 |
1976年 | 48篇 |
1975年 | 18篇 |
1974年 | 21篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
101.
102.
Jean-Pierre Dedieu Gregorio Malajovich Mike Shub 《Foundations of Computational Mathematics》2005,5(2):145-171
We prove a linear bound on the average total curvature of the
central path of linear programming theory in terms of the number
of independent variables of the primal problem, and independent of
the number of constraints. 相似文献
103.
104.
Numerical schemes for systems with multiple spatio-temporal scales are investigated. The multiscale schemes use asymptotic results for this type of systems which guarantee the existence of an effective dynamics for some suitably defined modes varying slowly on the largest scales. The multiscale schemes are analyzed in general, then illustrated on a specific example of a moderately large deterministic system displaying chaotic behavior due to Lorenz. Issues like consistency, accuracy, and efficiency are discussed in detail. The role of possible hidden slow variables as well as additional effects arising on the diffusive time-scale are also investigated. As a byproduct we obtain a rather complete characterization of the effective dynamics in Lorenz model. 相似文献
105.
Spectral and Pseudospectral Approximations Using Hermite Functions: Application to the Dirac Equation 总被引:1,自引:0,他引:1
We consider in this paper spectral and pseudospectral approximations using Hermite functions for PDEs on the whole line. We first develop some basic approximation results associated with the projections and interpolations in the spaces spanned by Hermite functions. These results play important roles in the analysis of the related spectral and pseudospectral methods. We then consider, as an example of applications, spectral and pseudospectral approximations of the Dirac equation using Hermite functions. In particular, these schemes preserve the essential conservation property of the Dirac equation. We also present some numerical results which illustrate the effectiveness of these methods. 相似文献
106.
D. Barrios Rolanía G. Lpez Lagomasino E. B. Saff 《Journal of Approximation Theory》2003,124(2):263-281
Using a convergence theorem for Fourier–Padé approximants constructed from orthogonal polynomials on the unit circle, we prove an analogue of Hadamard's theorem for determining the radius of m-meromorphy of a function analytic on the unit disk and apply this to the location of poles of the reciprocal of Szeg
functions. 相似文献
107.
Standard ODE methods such as linear multistep methods encounter difficulties when applied to differential-algebraic equations (DAEs) of index greater than 1. In particular, previous results for index 2 DAEs have practically ruled out the use of all explicit methods and of implicit multistep methods other than backward difference formulas (BDFs) because of stability considerations. In this paper we embed known results for semi-explicit index 1 and 2 DAEs in a more comprehensive theory based on compound multistep and one-leg discretizations. This explains and characterizes the necessary requirements that a method must fulfill in order to be applicable to semi-explicit DAEs. Thus we conclude that the most useful discretizations are those that avoid discretization of the constraint. A freer use of e.g. explicit methods for the non-stiff differential part of the DAE is then possible.Dedicated to Germund Dahlquist on the occasion of his 70th birthdayThis author thanks the Centro de Estadística y Software Matemático de la Universidad Simón Bolivar (CESMa) for permitting her free use of its research facilities.Partial support by the Swedish Research Council for Engineering Sciences TFR under contract no. 222/91-405. 相似文献
108.
M.K. Gupta Vijay Gupta Manoj Kumar 《Journal of Mathematical Analysis and Applications》2007,330(2):799-816
In the present paper we introduce a new family of linear positive operators and study some direct and inverse results in simultaneous approximation. 相似文献
109.
Somyot Plubtieng Rattanaporn Punpaeng 《Journal of Mathematical Analysis and Applications》2007,336(1):455-469
In this paper, we introduce two iterative schemes by the general iterative method for finding a common element of the set of an equilibrium problem and the set of fixed points of a nonexpansive mapping in a Hilbert space. Then, we prove two strong convergence theorems for nonexpansive mappings to solve a unique solution of the variational inequality which is the optimality condition for the minimization problem. These results extended and improved the corresponding results of Marino and Xu [G. Marino, H.K. Xu, A general iterative method for nonexpansive mapping in Hilbert spaces, J. Math. Anal. Appl. 318 (2006) 43-52], S. Takahashi and W. Takahashi [S. Takahashi, W. Takahashi, Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces, J. Math. Anal. Appl. 331 (1) (2007) 506-515], and many others. 相似文献
110.
S. Al-Homidan 《Journal of Optimization Theory and Applications》2007,135(3):583-598
Given a data matrix, we find its nearest symmetric positive-semidefinite Toeplitz matrix. In this paper, we formulate the
problem as an optimization problem with a quadratic objective function and semidefinite constraints. In particular, instead
of solving the so-called normal equations, our algorithm eliminates the linear feasibility equations from the start to maintain
exact primal and dual feasibility during the course of the algorithm. Subsequently, the search direction is found using an
inexact Gauss-Newton method rather than a Newton method on a symmetrized system and is computed using a diagonal preconditioned
conjugate-gradient-type method. Computational results illustrate the robustness of the algorithm. 相似文献