全文获取类型
收费全文 | 2350篇 |
免费 | 111篇 |
国内免费 | 138篇 |
专业分类
化学 | 298篇 |
晶体学 | 3篇 |
力学 | 59篇 |
综合类 | 36篇 |
数学 | 1888篇 |
物理学 | 315篇 |
出版年
2023年 | 30篇 |
2022年 | 20篇 |
2021年 | 28篇 |
2020年 | 56篇 |
2019年 | 72篇 |
2018年 | 72篇 |
2017年 | 70篇 |
2016年 | 79篇 |
2015年 | 29篇 |
2014年 | 89篇 |
2013年 | 253篇 |
2012年 | 66篇 |
2011年 | 109篇 |
2010年 | 73篇 |
2009年 | 153篇 |
2008年 | 146篇 |
2007年 | 129篇 |
2006年 | 132篇 |
2005年 | 109篇 |
2004年 | 92篇 |
2003年 | 83篇 |
2002年 | 83篇 |
2001年 | 65篇 |
2000年 | 84篇 |
1999年 | 60篇 |
1998年 | 57篇 |
1997年 | 56篇 |
1996年 | 44篇 |
1995年 | 32篇 |
1994年 | 28篇 |
1993年 | 28篇 |
1992年 | 20篇 |
1991年 | 13篇 |
1990年 | 12篇 |
1989年 | 9篇 |
1988年 | 11篇 |
1987年 | 15篇 |
1986年 | 11篇 |
1985年 | 12篇 |
1984年 | 11篇 |
1983年 | 4篇 |
1982年 | 8篇 |
1981年 | 8篇 |
1980年 | 8篇 |
1979年 | 7篇 |
1978年 | 7篇 |
1977年 | 6篇 |
1976年 | 3篇 |
1973年 | 2篇 |
1972年 | 2篇 |
排序方式: 共有2599条查询结果,搜索用时 15 毫秒
11.
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. 相似文献
12.
Asymptotic chi-squared test statistics for testing the equality of moment vectors are developed. The test statistics proposed are generalized Wald test statistics that specialize for different settings by inserting an appropriate asymptotic variance matrix of sample moments. Scaled test statistics are also considered for dealing with nonstandard conditions. The specialization will be carried out for testing the equality of multinomial populations, and the equality of variance and correlation matrices for both normal and nonnormal data. When testing the equality of correlation matrices, a scaled version of the normal theory chi-squared statistic is proven to be an asymptotically exact chi-squared statistic in the case of elliptical data. 相似文献
13.
关于体上分块矩阵的群逆 总被引:1,自引:0,他引:1
本文利用分块矩阵方法.研究了体上两个矩阵乘积的群逆的存在性及表示形式,给出了体上两个矩阵乘积群逆存在的充分必要条件和表示形式.并且在一定条件下.给出了体上分块矩阵的群逆存在性及表示形式. 相似文献
14.
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. 相似文献
15.
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. 相似文献
16.
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.
17.
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. 相似文献
18.
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. 相似文献
19.
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. 相似文献
20.
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. 相似文献