首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3000篇
  免费   115篇
  国内免费   294篇
化学   74篇
力学   80篇
综合类   35篇
数学   2931篇
物理学   289篇
  2024年   4篇
  2023年   38篇
  2022年   35篇
  2021年   40篇
  2020年   95篇
  2019年   85篇
  2018年   75篇
  2017年   81篇
  2016年   88篇
  2015年   61篇
  2014年   111篇
  2013年   290篇
  2012年   79篇
  2011年   160篇
  2010年   140篇
  2009年   186篇
  2008年   210篇
  2007年   211篇
  2006年   167篇
  2005年   155篇
  2004年   113篇
  2003年   141篇
  2002年   128篇
  2001年   102篇
  2000年   111篇
  1999年   107篇
  1998年   84篇
  1997年   86篇
  1996年   56篇
  1995年   33篇
  1994年   23篇
  1993年   14篇
  1992年   7篇
  1991年   6篇
  1990年   9篇
  1989年   13篇
  1988年   4篇
  1987年   12篇
  1986年   5篇
  1985年   11篇
  1984年   5篇
  1983年   4篇
  1982年   4篇
  1981年   5篇
  1980年   2篇
  1979年   2篇
  1978年   3篇
  1975年   2篇
  1974年   2篇
  1936年   2篇
排序方式: 共有3409条查询结果,搜索用时 109 毫秒
11.
Constructive Approximation - Let E = [–1, α] \cup [β, 1], –1 &;lt; α &;lt; β &;lt; 1, and let (pn) be orthogonal on E with respect to the weight function...  相似文献   
12.
Gilmer and Heinzer proved that given a reduced ring R, a polynomial f divides a monic polynomial in R[X] if and only if there exists a direct sum decomposition of R = R0 ⊕ … ⊕ Rm (m ≤ deg f), associated to a fundamental system of idempotents e0, … , em, such that the component of f in each Ri[X] has degree coefficient which is a unit of Ri. We propose to give an algorithm to explicitly find such a decomposition. Moreover, we extend this result to divisors of doubly monic Laurent polynomials.  相似文献   
13.
本文给出了 n阶 r-不可分矩阵的本原指数的上界 ,即任 n阶 r—不可分矩阵 A的本原指数 (A)≤n+(r- ) 2r (1≤ r相似文献   
14.
1 IntroductionLet Sd- 1 bethe unitsphere of Rd,Πdthe space of allpolynomialsofd variables,and x(i)= (x1 ,… ,xi) (i=1 ,… ,d) .In this paper,we are concerned with the homogeneous polyno-mials orthogonal with the weightfunction h(x(d) ) =x2 k11 …x2 kdd on Sd- 1 ,where ki≥ 0 (i=1 ,… ,d) .Connected with the weightfunction h(x(d) ) are the following differential-differenceoperators introduced by Charles F. Dunkl in [3 ] ,Dip(x(d) ) = p(x(d) ) xi+ di=1kip(x(d) ) -p(x1 ,… ,-xi,… ,xd)xi,Δ…  相似文献   
15.
We present an algorithm, based on approximation by Laguerre polynomials, for computing a point on the stable manifold of a stationary solution of an autonomous system. A superconvergence phenomenon means that the accuracy of our results is much higher than the usual spectral accuracy. Both the theory and the implementation of the method are considered. Finally, as an application of the algorithm, we describe a fully spectral approximation of homo- and heteroclinic orbits.

  相似文献   

16.
Inequalities satisfied by the zeros of the solutions of second-order hypergeometric equations are derived through a systematic use of Liouville transformations together with the application of classical Sturm theorems. This systematic study allows us to improve previously known inequalities and to extend their range of validity as well as to discover inequalities which appear to be new. Among other properties obtained, Szegő's bounds on the zeros of Jacobi polynomials for , are completed with results for the rest of parameter values, Grosjean's inequality (J. Approx. Theory 50 (1987) 84) on the zeros of Legendre polynomials is shown to be valid for Jacobi polynomials with |β|1, bounds on ratios of consecutive zeros of Gauss and confluent hypergeometric functions are derived as well as an inequality involving the geometric mean of zeros of Bessel functions.  相似文献   
17.
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║=11,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.  相似文献   
18.
19.
Let P(G,λ) be the chromatic polynomial of a graph G with n vertices, independence number α and clique number ω. We show that for every λ≥n, ()α≤≤ () n −ω. We characterize the graphs that yield the lower bound or the upper bound.?These results give new bounds on the mean colour number μ(G) of G: n− (n−ω)() n −ω≤μ(G)≤n−α() α. Received: December 12, 2000 / Accepted: October 18, 2001?Published online February 14, 2002  相似文献   
20.
Based on Bernstein's Theorem, Kalandia's Lemma describes the error estimate and the smoothness of the remainder under the second part of Hoelder norm when a HSlder function is approximated by its best polynomial approximation. In this paper, Kalandia's Lemma is generalized to the cases that the best polynomial is replaced by one of its four kinds of Chebyshev polynomial expansions, the error estimates of the remainder are given out under Hoeder norm or the weighted HSlder norms.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号