全文获取类型
收费全文 | 2185篇 |
免费 | 77篇 |
国内免费 | 125篇 |
专业分类
化学 | 283篇 |
晶体学 | 2篇 |
力学 | 30篇 |
综合类 | 29篇 |
数学 | 1778篇 |
物理学 | 265篇 |
出版年
2023年 | 28篇 |
2022年 | 20篇 |
2021年 | 22篇 |
2020年 | 47篇 |
2019年 | 67篇 |
2018年 | 62篇 |
2017年 | 59篇 |
2016年 | 66篇 |
2015年 | 25篇 |
2014年 | 75篇 |
2013年 | 238篇 |
2012年 | 59篇 |
2011年 | 101篇 |
2010年 | 70篇 |
2009年 | 140篇 |
2008年 | 135篇 |
2007年 | 119篇 |
2006年 | 126篇 |
2005年 | 105篇 |
2004年 | 87篇 |
2003年 | 77篇 |
2002年 | 80篇 |
2001年 | 58篇 |
2000年 | 77篇 |
1999年 | 56篇 |
1998年 | 56篇 |
1997年 | 52篇 |
1996年 | 40篇 |
1995年 | 26篇 |
1994年 | 24篇 |
1993年 | 27篇 |
1992年 | 20篇 |
1991年 | 9篇 |
1990年 | 12篇 |
1989年 | 8篇 |
1988年 | 11篇 |
1987年 | 15篇 |
1986年 | 10篇 |
1985年 | 11篇 |
1984年 | 11篇 |
1983年 | 4篇 |
1982年 | 7篇 |
1981年 | 8篇 |
1980年 | 8篇 |
1979年 | 6篇 |
1978年 | 7篇 |
1977年 | 6篇 |
1976年 | 3篇 |
1973年 | 2篇 |
1972年 | 2篇 |
排序方式: 共有2387条查询结果,搜索用时 15 毫秒
71.
本文刻画了整环上的全矩阵空间、对称矩阵空间和上三角矩阵空间上保持伴随矩阵的线性算子的结构。 相似文献
72.
The accumulation of the Jacobian matrix F of a vector function can be regarded as a transformation of its linearized computational graph into a subgraph of the directed complete bipartite graph Kn,m. This transformation can be performed by applying different elimination techniques that may lead to varying costs for computing F. This paper introduces face elimination as the basic technique for accumulating Jacobian matrices by using a minimal number of arithmetic operations. Its superiority over both edge and vertex elimination methods is shown. The intention is to establish the conceptual basis for the ongoing development of algorithms for optimizing the computation of Jacobian matrices. 相似文献
73.
谱约束下对称正交对称矩阵束的最佳逼近 总被引:3,自引:0,他引:3
讨论了对称正交对称矩阵的广义逆特征值问题,得到了通解表达式和最佳解的表达式。 相似文献
74.
Weaving is a matrix construction developed in 1990 for the purpose of obtaining new weighing matrices. Hadamard matrices obtained by weaving have the same orders as those obtained using the Kronecker product, but weaving affords greater control over the internal structure of matrices constructed, leading to many new Hadamard equivalence classes among these known orders. It is known that different classes of Hadamard matrices may have different maximum excess. We explain why those classes with smaller excess may be of interest, apply the method of weaving to explore this question, and obtain constructions for new Hadamard matrices with maximum excess in their respective classes. With this method, we are also able to construct Hadamard matrices of near‐maximal excess with ease, in orders too large for other by‐hand constructions to be of much value. We obtain new lower bounds for the maximum excess among Hadamard matrices in some orders by constructing candidates for the largest excess. For example, we construct a Hadamard matrix with excess 1408 in order 128, larger than all previously known values. We obtain classes of Hadamard matrices of order 96 with maximum excess 912 and 920, which demonstrates that the maximum excess for classes of that order may assume at least three different values. Since the excess of a woven Hadamard matrix is determined by the row sums of the matrices used to weave it, we also investigate the properties of row sums of Hadamard matrices and give lists of them in small orders. © 2004 Wiley Periodicals, Inc. J Combin Designs 12: 233–255, 2004. 相似文献
75.
Mursaleen 《Journal of Mathematical Analysis and Applications》2004,293(2):523-531
The idea of almost convergence for double sequences was introduced by Moricz and Rhoades [Math. Proc. Cambridge Philos. Soc. 104 (1988) 283-294] and they also characterized the four dimensional strong regular matrices. In this paper we define and characterize the almost strongly regular matrices for double sequences and apply these matrices to establish a core theorem. 相似文献
76.
Máté Matolcsi 《Acta Mathematica Hungarica》2005,108(1-2):129-136
Summary He present work deals with estimations of the n-th linear polarization constant c(H)n of an n-dimensional real Hilbert space H. We provide some new lower bounds on the value of sup║y║=1 │1,y> ... n,y>│, where x1, ... ,xn are unit vectors in H. In particular, the results improve an earlier estimate of Marcus. However, the intriguing conjecture c(H) n= nn/2 remains open. 相似文献
77.
Let Um be an m×m Haar unitary matrix and U[m,n] be its n×n truncation. In this paper the large deviation is proven for the empirical eigenvalue density of U[m,n] as m/n→λ and n→∞. The rate function and the limit distribution are given explicitly. U[m,n] is the random matrix model of quq, where u is a Haar unitary in a finite von Neumann algebra, q is a certain projection and they are free. The limit distribution coincides with the Brown measure of the operator quq. 相似文献
78.
A hierarchical matrix is an efficient data-sparse representation of a matrix, especially useful for large dimensional problems. It consists of low-rank subblocks leading to low memory requirements as well as inexpensive computational costs. In this work, we discuss the use of the hierarchical matrix technique in the numerical solution of a large scale eigenvalue problem arising from a finite rank discretization of an integral operator. The operator is of convolution type, it is defined through the first exponential-integral function and, hence, it is weakly singular. We develop analytical expressions for the approximate degenerate kernels and deduce error upper bounds for these approximations. Some computational results illustrating the efficiency and robustness of the approach are presented. 相似文献
79.
Emmanuel Paradis 《Journal of computational and graphical statistics》2013,22(4):935-939
Multidimensional scaling has a wide range of applications when observations are not continuous but it is possible to define a distance (or dissimilarity) among them. However, standard implementations are limited when analyzing very large datasets because they rely on eigendecomposition of the full distance matrix and require very long computing times and large quantities of memory. Here, a new approach is developed based on projection of the observations in a space defined by a subset of the full dataset. The method is easily implemented. A simulation study showed that its performance are satisfactory in different situations and can be run in a short time when the standard method takes a very long time or cannot be run because of memory requirements. 相似文献
80.
Helena ?migoc 《Linear and Multilinear Algebra》2013,61(2):85-96
This article presents a technique for combining two matrices, an n?×?n matrix M and an m?×?m matrix B, with known spectra to create an (n?+?m???p)?×?(n?+?m???p) matrix N whose spectrum consists of the spectrum of the matrix M and m???p eigenvalues of the matrix B. Conditions are given when the matrix N obtained in this construction is nonnegative. Finally, these observations are used to obtain several results on how to construct a realizable list of n?+?1 complex numbers (λ1,λ2,λ3,σ) from a given realizable list of n complex numbers (c 1,c 2,σ), where c 1 is the Perron eigenvalue, c 2 is a real number and σ is a list of n???2 complex numbers. 相似文献