全文获取类型
收费全文 | 17213篇 |
免费 | 2167篇 |
国内免费 | 594篇 |
专业分类
化学 | 5335篇 |
晶体学 | 97篇 |
力学 | 3595篇 |
综合类 | 112篇 |
数学 | 6379篇 |
物理学 | 4456篇 |
出版年
2023年 | 183篇 |
2022年 | 228篇 |
2021年 | 341篇 |
2020年 | 553篇 |
2019年 | 406篇 |
2018年 | 381篇 |
2017年 | 401篇 |
2016年 | 613篇 |
2015年 | 609篇 |
2014年 | 784篇 |
2013年 | 1303篇 |
2012年 | 955篇 |
2011年 | 1027篇 |
2010年 | 720篇 |
2009年 | 1048篇 |
2008年 | 1028篇 |
2007年 | 1101篇 |
2006年 | 1035篇 |
2005年 | 825篇 |
2004年 | 723篇 |
2003年 | 712篇 |
2002年 | 612篇 |
2001年 | 582篇 |
2000年 | 523篇 |
1999年 | 455篇 |
1998年 | 428篇 |
1997年 | 350篇 |
1996年 | 330篇 |
1995年 | 249篇 |
1994年 | 194篇 |
1993年 | 175篇 |
1992年 | 136篇 |
1991年 | 120篇 |
1990年 | 104篇 |
1989年 | 68篇 |
1988年 | 66篇 |
1987年 | 62篇 |
1986年 | 72篇 |
1985年 | 55篇 |
1984年 | 60篇 |
1983年 | 24篇 |
1982年 | 36篇 |
1981年 | 33篇 |
1980年 | 25篇 |
1979年 | 29篇 |
1978年 | 43篇 |
1977年 | 41篇 |
1976年 | 42篇 |
1975年 | 15篇 |
1974年 | 15篇 |
排序方式: 共有10000条查询结果,搜索用时 468 毫秒
941.
After studying Gaussian type quadrature formulae with mixed boundary conditions, we suggest a fast algorithm for computing their nodes and weights. It is shown that the latter are computed in the same manner as in the theory of the classical Gauss quadrature formulae. In fact, all nodes and weights are again computed as eigenvalues and eigenvectors of a real symmetric tridiagonal matrix. Hence, we can adapt existing procedures for generating such quadrature formulae. Comparative results with various methods now in use are given. In the second part of this paper, new algorithms for spectral approximations for second-order elliptic problems are derived. The key to the efficiency of our algorithms is to find an appropriate spectral approximation by using the most accurate quadrature formula, which takes the boundary conditions into account in such a way that the resulting discrete system has a diagonal mass matrix. Hence, our algorithms can be used to introduce explicit resolutions for the time-dependent problems. This is the so-called lumped mass method. The performance of the approach is illustrated with several numerical examples in one and two space dimensions.
942.
A. Auslender 《Journal of Optimization Theory and Applications》1992,73(3):427-449
We study dual functionals which have two fundamental properties. Firstly, they have a good asymptotical behavior. Secondly, to each dual sequence of subgradients converging to zero, one can associate a primal sequence which converges to an optimal solution of the primal problem. Furthermore, minimal conditions for the convergence of the Gauss-Seidel methods are given and applied to such kinds of functionals. 相似文献
943.
944.
解线性不等式的神经网络 总被引:2,自引:0,他引:2
本文提出两个解线性不等式的Hopfiedl-Tank型的神经网络。第一个网络模拟同时松弛投影方法,第二个网络是二次规划方法。当线性不等式的解集非空时,这两个方法都给出该线性不等式的解。同时我们还给出了这两个网络的数值模拟。 相似文献
945.
The importance of buried interfaces in our everyday lives and in current scientific research is highlighted, along with experimental difficulty associated with studying such systems. We present an overview of the application of second harmonic generation and sum-frequency spectroscopy to the study of buried interfaces. Several examples from the current literature are presented, ranging from chemical and biological, to electrical and magnetic interfaces. The importance of this work in the context of ongoing research in these areas is discussed. Finally, we provide a snapshot of the state of the art in non-linear optical spectroscopy by mentioning several new directions that are likely to have a large impact on future research into the physics and chemistry of buried interfaces. 相似文献
946.
We study local convergence of quasi-Newton methods for solving systems of nonlinear equations defined by B-differentiable functions. We extend the classical linear and superlinear convergence results for general quasi-Newton methods as well as for Broyden's method. We also show how Broyden's method may be applied to nonlinear complementarity problems and illustrate its computational performance on two small examples. 相似文献
947.
In this paper, we develop an algorithmic method for the evaluation of the steady state probability vector of a special class of finite state Markov chains. For the class of Markov chains considered here, it is assumed that the matrix associated with the set of linear equations for the steady state probabilities possess a special structure, such that it can be rearranged and decomposed as a sum of two matrices, one lower triangular with nonzero diagonal elements, and the other an upper triangular matrix with only very few nonzero columns. Almost all Markov chain models of queueing systems with finite source and/or finite capacity and first-come-first-served or head of the line nonpreemptive priority service discipline belongs to this special class. 相似文献
948.
S. K. Zavriev 《Journal of Optimization Theory and Applications》1996,91(1):185-214
The steepest-descent technique dealing with the perturbed values of the objective function and its gradients and with nonexact line searches is considered. Attention is given to the case where the perturbations do not decrease on the algorithm trajectories; the aim is to investigate how perturbations at every iteration of the algorithm perturb its original attractor set.Based on the Liapunov direct method for attraction analysis of discrete-time processes, a sharp estimation of the attractor set generated by a perturbed steepest-descent technique with respect to the perturbation magnitudes is obtained. Some global optimization properties of finite-difference analogues of the gradient method are discovered. These properties are not inherent in methods which use exact gradients.The author is grateful to the referees for many useful suggestions. 相似文献
949.
The multigrid method based on multi-stage Jacobi relaxation, earlier developed by the authors for structured grid calculations with Euler equations, is extended to unstructured grid applications. The meshes are generated with Delaunay triangulation algorithms and are adapted to the flow solution. 相似文献
950.