全文获取类型
收费全文 | 3110篇 |
免费 | 230篇 |
国内免费 | 325篇 |
专业分类
化学 | 88篇 |
力学 | 138篇 |
综合类 | 89篇 |
数学 | 3021篇 |
物理学 | 329篇 |
出版年
2024年 | 4篇 |
2023年 | 52篇 |
2022年 | 63篇 |
2021年 | 66篇 |
2020年 | 97篇 |
2019年 | 88篇 |
2018年 | 98篇 |
2017年 | 93篇 |
2016年 | 98篇 |
2015年 | 52篇 |
2014年 | 123篇 |
2013年 | 279篇 |
2012年 | 107篇 |
2011年 | 160篇 |
2010年 | 148篇 |
2009年 | 182篇 |
2008年 | 182篇 |
2007年 | 206篇 |
2006年 | 203篇 |
2005年 | 183篇 |
2004年 | 139篇 |
2003年 | 129篇 |
2002年 | 146篇 |
2001年 | 111篇 |
2000年 | 106篇 |
1999年 | 105篇 |
1998年 | 88篇 |
1997年 | 61篇 |
1996年 | 54篇 |
1995年 | 44篇 |
1994年 | 40篇 |
1993年 | 21篇 |
1992年 | 17篇 |
1991年 | 11篇 |
1990年 | 13篇 |
1989年 | 6篇 |
1988年 | 8篇 |
1987年 | 7篇 |
1986年 | 17篇 |
1985年 | 17篇 |
1984年 | 6篇 |
1983年 | 10篇 |
1982年 | 7篇 |
1981年 | 5篇 |
1979年 | 2篇 |
1978年 | 4篇 |
1976年 | 1篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1957年 | 3篇 |
排序方式: 共有3665条查询结果,搜索用时 9 毫秒
991.
D. Castro J. L. Montaña L. M. Pardo J. San Martín 《Foundations of Computational Mathematics》2002,2(1):1-52
We prove that rational data of bounded input length are uniformly distributed (in the classical sense of H. Weyl, in [42])
with respect to the probability distribution of condition numbers of numerical analysis. We deal both with condition numbers
of linear algebra and with condition numbers for systems of multivariate polynomial equations. For instance, we prove that
for a randomly chosen n\times n rational matrix M of bit length O(n
4
log n) + log w , the condition number k(M) satisfies k(M) ≤ w n
5/2
with probability at least 1-2w
-1
. Similar estimates are established for the condition number μ_ norm of M. Shub and S. Smale when applied to systems of multivariate homogeneous polynomial equations of bounded input length.
Finally, we apply these techniques to estimate the probability distribution of the precision (number of bits of the denominator)
required to write approximate zeros of systems of multivariate polynomial equations of bounded input length.
March 7, 2001. Final version received: June 7, 2001. 相似文献
992.
Cristina Caldeira 《Linear and Multilinear Algebra》1997,42(1):73-88
In [4] Dias da Silva and Hamidoune obtained a lower bound for the degree of the minimal polynomial of the Kronecker sum of two matrices in terms of the degrees of the minimal polynomials of the matrices. We determine the pairs of matrices for which this bound is reached. 相似文献
993.
Michael Arciero 《Journal of Mathematical Analysis and Applications》2005,304(1):321-335
We characterize limits for orthogonal Szegö polynomials of fixed degree k, with respect to certain measures on the unit circle which are weakly convergent to a sum of m<k point masses. Such measures arise, for example, as a convolution of point masses with an approximate identity. It is readily seen that the underlying measures in two recently-proposed methods for estimating the m frequencies, θj, of a discrete-time trigonometric signal using Szegö polynomials are of this form. We prove existence of Szegö polynomial limits associated with a general class of weakly convergent measures, and prove that for convolution of point masses with the Poisson kernel, which underlies one of the recently-proposed methods, the limit has as a factor the Szegö polynomial with respect to a related measure, which we specify. Since m of the zeros approach the eiθj, this result uniquely characterizes the limit. A similar result is obtained for measures consisting of point masses with additive absolutely continuous part. 相似文献
994.
Geno Nikolov 《Mathematische Nachrichten》2005,278(10):1190-1208
Denote by πn the set of all algebraic polynomials of degree at most n with complex coefficients. An inequality of I. Schur asserts that the first derivative of the transformed Tchebycheff polynomial has the greatest uniform norm in [?1, 1] among all f ∈ ??n, where (1) Here we show that this extremal property of persists in the wider class of polynomials f ∈ πn which vanish at ±1, and for which there exist n ? 1 points separating the zeros of and such that for j = 1, …, n ? 1. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
995.
996.
Rudolf Beran 《Annals of the Institute of Statistical Mathematics》2002,54(4):900-917
Estimation of the mean function in nonparametric regression is usefully separated into estimating the means at the observed factor levels—a one-way layout problem—and interpolation between the estimated means at adjacent factor levels. Candidate penalized least squares (PLS) estimators for the mean vector of a one-way layout are expressed as shrinkage estimators relative to an orthogonal regression basis determined by the penalty matrix. The shrinkage representation of PLS suggests a larger class of candidate monotone shrinkage (MS) estimators. Adaptive PLS and MS estimators choose the shrinkage vector and penalty matrix to minimize estimated risk. The actual risks of shrinkage-adaptive estimators depend strongly upon the economy of the penalty basis in representing the unknown mean vector. Local annihilators of polynomials, among them difference operators, generate penalty bases that are economical in a range of examples. Diagnostic techniques for adaptive PLS or MS estimators include basis-economy plots and estimates of loss or risk. 相似文献
997.
Abdulhamid A. Alzaid 《Annals of the Institute of Statistical Mathematics》1990,42(2):281-285
For a random sample from a population having a finite k-th moment, it is shown that the constancy of regression of polynomial statistics of order k in the mean implies that all higher moments exist and are uniquely determined by the first k moments. This result is utilized to give a moment's approach to some characterization results. 相似文献
998.
W. Pleśniak 《Numerical Algorithms》2003,33(1-4):415-420
Kiselman's method permitting one to estimate the volume of sublevel sets of a plurisubharmonic function f in C
n
with the aid of the Lelong number of f is applied to polynomial lemniscates in C
n
. In particular, it yields estimates from below of the volume of polynomial lemniscates which completes recent results of Cuyt, Driver and Lubinsky. 相似文献
999.
In an earlier paper, we used the absolute grading on Heegaard Floer homology HF+ to give restrictions on knots in S3 which admit lens space surgeries. The aim of the present article is to exhibit stronger restrictions on such knots, arising from knot Floer homology. One consequence is that the non-zero coefficients of the Alexander polynomial of such a knot are ±1. This information can in turn be used to prove that certain lens spaces are not obtained as integral surgeries on knots. In fact, combining our results with constructions of Berge, we classify lens spaces L(p,q) which arise as integral surgeries on knots in S3 with |p|?1500. Other applications include bounds on the four-ball genera of knots admitting lens space surgeries (which are sharp for Berge's knots), and a constraint on three-manifolds obtained as integer surgeries on alternating knots, which is closely to related to a theorem of Delman and Roberts. 相似文献
1000.
In this paper, the asymptotic optimality of the cross validation bandwidth selector for the local polynomial fitting under strongly mixing dependence is obtained. The asymptotic normality of the bandwidth selected by the cross-validation method is derived, which is an extension of W. Härdle, P. Hall, and J. S. Marron (1988, J. Am. Statist. Assoc.83, 86–101). 相似文献