全文获取类型
收费全文 | 12367篇 |
免费 | 1424篇 |
国内免费 | 437篇 |
专业分类
化学 | 5292篇 |
晶体学 | 29篇 |
力学 | 1228篇 |
综合类 | 75篇 |
数学 | 5201篇 |
物理学 | 2403篇 |
出版年
2023年 | 169篇 |
2022年 | 214篇 |
2021年 | 250篇 |
2020年 | 437篇 |
2019年 | 313篇 |
2018年 | 289篇 |
2017年 | 274篇 |
2016年 | 495篇 |
2015年 | 506篇 |
2014年 | 649篇 |
2013年 | 1020篇 |
2012年 | 689篇 |
2011年 | 710篇 |
2010年 | 506篇 |
2009年 | 770篇 |
2008年 | 721篇 |
2007年 | 750篇 |
2006年 | 646篇 |
2005年 | 503篇 |
2004年 | 463篇 |
2003年 | 455篇 |
2002年 | 386篇 |
2001年 | 376篇 |
2000年 | 333篇 |
1999年 | 285篇 |
1998年 | 295篇 |
1997年 | 228篇 |
1996年 | 235篇 |
1995年 | 169篇 |
1994年 | 131篇 |
1993年 | 126篇 |
1992年 | 87篇 |
1991年 | 85篇 |
1990年 | 62篇 |
1989年 | 55篇 |
1988年 | 54篇 |
1987年 | 40篇 |
1986年 | 52篇 |
1985年 | 33篇 |
1984年 | 48篇 |
1983年 | 16篇 |
1982年 | 27篇 |
1981年 | 29篇 |
1980年 | 21篇 |
1979年 | 26篇 |
1978年 | 42篇 |
1977年 | 41篇 |
1976年 | 41篇 |
1975年 | 15篇 |
1974年 | 15篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
We discuss an error estimation procedure for the global error of collocation schemes applied to solve singular boundary value problems with a singularity of the first kind. This a posteriori estimate of the global error was proposed by Stetter in 1978 and is based on the idea of Defect Correction, originally due to Zadunaisky. Here, we present a new, carefully designed modification of this error estimate which not only results in less computational work but also appears to perform satisfactorily for singular problems. We give a full analytical justification for the asymptotical correctness of the error estimate when it is applied to a general nonlinear regular problem. For the singular case, we are presently only able to provide computational evidence for the full convergence order, the related analysis is still work in progress. This global estimate is the basis for a grid selection routine in which the grid is modified with the aim to equidistribute the global error. This procedure yields meshes suitable for an efficient numerical solution. Most importantly, we observe that the grid is refined in a way reflecting only the behavior of the solution and remains unaffected by the unsmooth direction field close to the singular point. 相似文献
12.
I.K. Argyros 《Applied Mathematics Letters》1997,10(6):21-28
In this note, we use inexact Newton-like methods to find solutions of nonlinear operator equations on Banach spaces with a convergence structure. Our technique involves the introduction of a generalized norm as an operator from a linear space into a partially ordered Banach space. In this way, the metric properties of the examined problem can be analyzed more precisely. Moreover, this approach allows us to derive from the same theorem, on the one hand, semilocal results of Kantorovich-type, and on the other hand, global results based on monotonicity considerations. By imposing very general Lipschitz-like conditions on the operators involved, on the one hand, we cover a wider range of problems, and on the other hand, by choosing our operators appropriately, we can find sharper error bounds on the distances involved than before. Furthermore, we show that special cases of our results reduce to the corresponding ones already in the literature. Finally, several examples are being provided where our results compare favorably with earlier ones. 相似文献
13.
J.V.P. de OliveiraA.V. Cardona M.T. VilhenaR.C. Barros 《Journal of Quantitative Spectroscopy & Radiative Transfer》2002,73(1):55-62
We describe a semi-analytical numerical method for coherent isotropic scattering time-dependent radiative transfer problems in slab geometry. This numerical method is based on a combination of two classes of numerical methods: the spectral methods and the Laplace transform (LTSN) methods applied to the radiative transfer equation in the discrete ordinates (SN) formulation. The basic idea is to use the essence of the spectral methods and expand the intensity of radiation in a truncated series of Laguerre polynomials in the time variable and then solve recursively the resulting set of “time-independent” SN problems by using the LTSN method. We show some numerical experiments for a typical model problem. 相似文献
14.
An Improved Gradient Projection-based Decomposition Technique for Support Vector Machines 总被引:2,自引:0,他引:2
Luca Zanni 《Computational Management Science》2006,3(2):131-145
In this paper we propose some improvements to a recent decomposition technique for the large quadratic program arising in
training support vector machines. As standard decomposition approaches, the technique we consider is based on the idea to
optimize, at each iteration, a subset of the variables through the solution of a quadratic programming subproblem. The innovative
features of this approach consist in using a very effective gradient projection method for the inner subproblems and a special
rule for selecting the variables to be optimized at each step. These features allow to obtain promising performance by decomposing
the problem into few large subproblems instead of many small subproblems as usually done by other decomposition schemes. We
improve this technique by introducing a new inner solver and a simple strategy for reducing the computational cost of each
iteration. We evaluate the effectiveness of these improvements by solving large-scale benchmark problems and by comparison
with a widely used decomposition package. 相似文献
15.
G. Dattoli 《Journal of Mathematical Analysis and Applications》2002,269(2):716-725
Bilateral generating functions are those involving products of different types of polynomials. We show that operational methods offer a powerful tool to derive these families of generating functions. We study cases relevant to products of Hermite polynomials with Laguerre, Legendre and other polynomials. We also propose further extensions of the method which we develop here. 相似文献
16.
P.A. Ramachandran 《Numerical Methods for Partial Differential Equations》2006,22(4):831-846
Time‐dependent differential equations can be solved using the concept of method of lines (MOL) together with the boundary element (BE) representation for the spatial linear part of the equation. The BE method alleviates the need for spatial discretization and casts the problem in an integral format. Hence errors associated with the numerical approximation of the spatial derivatives are totally eliminated. An element level local cubic approximation is used for the variable at each time step to facilitate the time marching and the nonlinear terms are represented in a semi‐implicit manner by a local linearization at each time step. The accuracy of the method has been illustrated on a number of test problems of engineering significance. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2006 相似文献
17.
Elena Kardash-Strochkova Yakov I. Tur’yan I. Kuselman Naphtali Brodsky 《Accreditation and quality assurance》2002,7(6):250-254
The results of two interlaboratory comparisons of acid number determinations in used motor oils are discussed. It is shown
that the comparability of the measurement results is not as good as that required by known standards for petroleum products.
The problem is motor oil contaminants which accumulated during use, and which are the source of a matrix effect in the acid
number determination. The standard methods’ drawbacks are analyzed and some improvements are proposed. Repeatability and accuracy
of the improved methods are evaluated.
Received: 11 December 2001 Accepted: 15 February 2002 相似文献
18.
Y. Wardi 《Journal of Optimization Theory and Applications》1989,61(3):473-485
A stochastic algorithm for finding stationary points of real-valued functions defined on a Euclidean space is analyzed. It is based on the Robbins-Monro stochastic approximation procedure. Gradient evaluations are done by means of Monte Carlo simulations. At each iteratex
i
, one sample point is drawn from an underlying probability space, based on which the gradient is approximated. The descent direction is against the approximation of the gradient, and the stepsize is 1/i. It is shown that, under broad conditions, w.p.1 if the sequence of iteratesx
1,x
2,...generated by the algorithm is bounded, then all of its accumulation points are stationary. 相似文献
19.
This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for solving general constrained optimization problems. At each iteration, our local quadratic subproblem includes the use of the Gauss–Newton approximation but also encompasses a structured secant approximation along with tests of when to use this approximation. This method has been tested on a selection of standard problems. The results indicate that, for least-squares problems, the approach taken here is a viable alternative to standard general optimization methods such as the Byrd–Omojokun trust-region method and the Powell damped BFGS line search method. 相似文献
20.
F. Iachello S. Oss 《The European Physical Journal D - Atomic, Molecular, Optical and Plasma Physics》2002,19(3):307-314
We present a brief review of algebraic techniques developed and applied in molecular spectroscopy in the last five years.
We also outline perspectives for new applications of the Lie algebraic method in the first decade of the new century.
Received 21 November 2001 相似文献