全文获取类型
收费全文 | 10071篇 |
免费 | 1011篇 |
国内免费 | 742篇 |
专业分类
化学 | 2081篇 |
晶体学 | 27篇 |
力学 | 790篇 |
综合类 | 225篇 |
数学 | 6173篇 |
物理学 | 2528篇 |
出版年
2024年 | 17篇 |
2023年 | 102篇 |
2022年 | 122篇 |
2021年 | 213篇 |
2020年 | 269篇 |
2019年 | 276篇 |
2018年 | 250篇 |
2017年 | 304篇 |
2016年 | 397篇 |
2015年 | 255篇 |
2014年 | 482篇 |
2013年 | 891篇 |
2012年 | 440篇 |
2011年 | 605篇 |
2010年 | 548篇 |
2009年 | 606篇 |
2008年 | 620篇 |
2007年 | 658篇 |
2006年 | 571篇 |
2005年 | 530篇 |
2004年 | 462篇 |
2003年 | 450篇 |
2002年 | 413篇 |
2001年 | 332篇 |
2000年 | 305篇 |
1999年 | 256篇 |
1998年 | 239篇 |
1997年 | 188篇 |
1996年 | 173篇 |
1995年 | 140篇 |
1994年 | 99篇 |
1993年 | 92篇 |
1992年 | 81篇 |
1991年 | 79篇 |
1990年 | 40篇 |
1989年 | 45篇 |
1988年 | 34篇 |
1987年 | 22篇 |
1986年 | 30篇 |
1985年 | 29篇 |
1984年 | 25篇 |
1983年 | 14篇 |
1982年 | 17篇 |
1981年 | 18篇 |
1980年 | 15篇 |
1979年 | 18篇 |
1978年 | 12篇 |
1977年 | 14篇 |
1976年 | 7篇 |
1973年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
991.
The Cholesky decomposition of a symmetric positive semidefinite matrix A is a useful tool for solving the related consistent system of linear equations or evaluating the action of a generalized inverse, especially when A is relatively large and sparse. To use the Cholesky decomposition effectively, it is necessary to identify reliably the positions of zero rows or columns of the factors and to choose these positions so that the nonsingular submatrix of A of the maximal rank is reasonably conditioned. The point of this note is to show how to exploit information about the kernel of A to accomplish both tasks. The results are illustrated by numerical experiments. 相似文献
992.
By repeatedly combining the source node’s nearest neighbor, we propose a node combination (NC) method to implement the Dijkstra’s algorithm. The NC algorithm finds the shortest paths with three simple iterative steps: find the nearest neighbor of the source node, combine that node with the source node, and modify the weights on edges that connect to the nearest neighbor. The NC algorithm is more comprehensible and convenient for programming as there is no need to maintain a set with the nodes’ distances. Experimental evaluations on various networks reveal that the NC algorithm is as efficient as Dijkstra’s algorithm. As the whole process of the NC algorithm can be implemented with vectors, we also show how to find the shortest paths on a weight matrix. 相似文献
993.
Kinkar Ch. Das 《Applied mathematics and computation》2011,217(18):7420-7426
We consider weighted graphs, where the edge weights are positive definite matrices. The eigenvalues of a graph are the eigenvalues of its adjacency matrix. We obtain a lower bound and an upper bound on the spectral radius of the adjacency matrix of weighted graphs and characterize graphs for which the bounds are attained. 相似文献
994.
995.
The aim of this paper is to present a new approach to the finite time L2-norm polynomial approximation problem. A new formulation of this problem leads to an equivalent linear system whose solution can be investigated analytically. Such a solution is then specialized for a polynomial expressed in terms of Laguerre and Bernstein basis. 相似文献
996.
In this paper, the problem of controller design for Lur’e systems guaranteeing dichotomy is investigated. On the basis of Kalman-Yakubovich-Popov (KYP) lemma and two frequency equalities, a new methodology for the dichotomy analysis of the Lur’e systems is proposed. A linear matrix inequality (LMI) based criterion is derived, which is equivalent to the Leonov’s frequency-domain one, while for the dichotomy analysis and synthesis which is more straightforward than the frequency-domain one. In virtue of this result, a dynamic output feedback controller ensuring the dichotomy property for Lur’e systems is designed. Finally a numerical example is included to demonstrate the validity and the applicability of the proposed approach. 相似文献
997.
998.
Due to the extensive applications of nonnegative matrix factorizations (NMFs) of nonnegative matrices, such as in image processing, text mining, spectral data analysis, speech processing, etc., algorithms for NMF have been studied for years. In this paper, we propose a new algorithm for NMF, which is based on an alternating projected gradient (APG) approach. In particular, no zero entries appear in denominators in our algorithm which implies no breakdown occurs, and even if some zero entries appear in numerators new updates can always be improved in our algorithm. It is shown that the effect of our algorithm is better than that of Lee and Seung’s algorithm when we do numerical experiments on two known facial databases and one iris database. 相似文献
999.
Vasilios N. Katsikis Dimitrios Pappas Athanassios Petralias 《Applied mathematics and computation》2011,217(23):9828-9834
In this article we provide a fast computational method in order to calculate the Moore-Penrose inverse of singular square matrices and of rectangular matrices. The proposed method proves to be much faster and has significantly better accuracy than the already proposed methods, while works for full and sparse matrices. 相似文献
1000.