全文获取类型
收费全文 | 3557篇 |
免费 | 364篇 |
国内免费 | 208篇 |
专业分类
化学 | 402篇 |
晶体学 | 21篇 |
力学 | 204篇 |
综合类 | 72篇 |
数学 | 2371篇 |
物理学 | 1059篇 |
出版年
2023年 | 49篇 |
2022年 | 76篇 |
2021年 | 63篇 |
2020年 | 94篇 |
2019年 | 114篇 |
2018年 | 118篇 |
2017年 | 131篇 |
2016年 | 122篇 |
2015年 | 62篇 |
2014年 | 151篇 |
2013年 | 358篇 |
2012年 | 134篇 |
2011年 | 197篇 |
2010年 | 153篇 |
2009年 | 241篇 |
2008年 | 239篇 |
2007年 | 203篇 |
2006年 | 202篇 |
2005年 | 179篇 |
2004年 | 155篇 |
2003年 | 133篇 |
2002年 | 135篇 |
2001年 | 105篇 |
2000年 | 106篇 |
1999年 | 89篇 |
1998年 | 80篇 |
1997年 | 72篇 |
1996年 | 54篇 |
1995年 | 42篇 |
1994年 | 31篇 |
1993年 | 37篇 |
1992年 | 27篇 |
1991年 | 19篇 |
1990年 | 17篇 |
1989年 | 12篇 |
1988年 | 12篇 |
1987年 | 19篇 |
1986年 | 12篇 |
1985年 | 12篇 |
1984年 | 13篇 |
1983年 | 4篇 |
1982年 | 8篇 |
1981年 | 8篇 |
1980年 | 8篇 |
1979年 | 8篇 |
1978年 | 8篇 |
1977年 | 6篇 |
1976年 | 4篇 |
1973年 | 2篇 |
1972年 | 2篇 |
排序方式: 共有4129条查询结果,搜索用时 15 毫秒
21.
Onofrio Mario Di Vincenzo Plamen Koshlukov Roberto La Scala 《Advances in Applied Mathematics》2006,37(4):541
In this paper we describe completely the involutions of the first kind of the algebra UTn(F) of n×n upper triangular matrices. Every such involution can be extended uniquely to an involution on the full matrix algebra. We describe the equivalence classes of involutions on the upper triangular matrices. There are two distinct classes for UTn(F) when n is even and a single class in the odd case.Furthermore we consider the algebra UT2(F) of the 2×2 upper triangular matrices over an infinite field F of characteristic different from 2. For every involution *, we describe the *-polynomial identities for this algebra. We exhibit bases of the corresponding ideals of identities with involution, and compute the Hilbert (or Poincaré) series and the codimension sequences of the respective relatively free algebras.Then we consider the *-polynomial identities for the algebra UT3(F) over a field of characteristic zero. We describe a finite generating set of the ideal of *-identities for this algebra. These generators are quite a few, and their degrees are relatively large. It seems to us that the problem of describing the *-identities for the algebra UTn(F) of the n×n upper triangular matrices may be much more complicated than in the case of ordinary polynomial identities. 相似文献
22.
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their elements converging to zero sufficiently slowly. When these sets are convex hulls of sets with power-type covering numbers, the bounds are tight. The arguments exploit properties of generalized Hadamard matrices. The results are illustrated by examples from machine learning, neurocomputing, and nonlinear approximation. 相似文献
24.
M. I. Gil' 《Proceedings of the American Mathematical Society》2003,131(12):3737-3746
A linear operator in a separable Hilbert space is called a quasinormal one if it is a sum of a normal operator and a compact one. In the paper, bounds for the spectrum of quasinormal operators are established. In addition, the lower estimate for the spectral radius is derived. Under some restrictions, that estimate improves the well-known results. Applications to integral operators and matrices are discussed. Our results are new even in the finite-dimensional case.
25.
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. 相似文献
26.
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. 相似文献
27.
极紫外望远镜各通道夹角的测量 总被引:1,自引:1,他引:0
极紫外望远镜是由四个单通道的望远镜捆绑在一起,以便同时对太阳的相同部分观测,由于受地面装调以及发射过程中的影响,无法保证四个通道光轴严格平行,必然带来观测位置上的误差。只要测出各通道之间的光轴夹角,便可在像面上采取适当的处理方法,以便减小这种误差,但这一夹角的测量精度必须控制在0.1″内。为达到如此高的精度,采用了太阳局部边缘探测的方法,很好地解决了这一问题。 相似文献
28.
This paper considers a new approach to a priori sparsification of the sparsity pattern of the factorized approximate inverses (FSAI) preconditioner using the so‐called vector aggregation technique. The suggested approach consists in construction of the FSAI preconditioner to the aggregated matrix with a prescribed sparsity pattern. Then small entries of the computed ‘aggregated’ FSAI preconditioning matrix are dropped, and the resulting pointwise sparsity pattern is used to construct the low‐density block sparsity pattern of the FSAI preconditioning matrix to the original matrix. This approach allows to minimize (sometimes significantly) the construction costs of low‐density high‐quality FSAI preconditioners. Numerical results with sample matrices from structural mechanics and thin shell problems are presented. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
29.
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. 相似文献
30.
Alvaro P. Raposo Hans J. Weber David E. Alvarez-Castillo Mariana Kirchbach 《Central European Journal of Physics》2007,5(3):253-284
We briefly review the five possible real polynomial solutions of hypergeometric differential equations. Three of them are
the well known classical orthogonal polynomials, but the other two are different with respect to their orthogonality properties.
We then focus on the family of polynomials which exhibits a finite orthogonality. This family, to be referred to as the Romanovski
polynomials, is required in exact solutions of several physics problems ranging from quantum mechanics and quark physics to
random matrix theory. It appears timely to draw attention to it by the present study. Our survey also includes several new
observations on the orthogonality properties of the Romanovski polynomials and new developments from their Rodrigues formula. 相似文献