首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1496篇
  免费   18篇
  国内免费   60篇
化学   409篇
力学   24篇
综合类   2篇
数学   879篇
物理学   260篇
  2023年   13篇
  2022年   27篇
  2021年   22篇
  2020年   23篇
  2019年   39篇
  2018年   23篇
  2017年   24篇
  2016年   33篇
  2015年   31篇
  2014年   62篇
  2013年   191篇
  2012年   70篇
  2011年   88篇
  2010年   69篇
  2009年   137篇
  2008年   106篇
  2007年   110篇
  2006年   88篇
  2005年   56篇
  2004年   62篇
  2003年   54篇
  2002年   30篇
  2001年   19篇
  2000年   16篇
  1999年   24篇
  1998年   30篇
  1997年   29篇
  1996年   23篇
  1995年   19篇
  1994年   10篇
  1993年   9篇
  1992年   3篇
  1991年   5篇
  1990年   7篇
  1989年   4篇
  1987年   2篇
  1985年   4篇
  1984年   4篇
  1983年   2篇
  1982年   2篇
  1981年   2篇
  1980年   1篇
  1979年   1篇
排序方式: 共有1574条查询结果,搜索用时 15 毫秒
71.
Let E\subset \Bbb R s be compact and let d n E denote the dimension of the space of polynomials of degree at most n in s variables restricted to E . We introduce the notion of an asymptotic interpolation measure (AIM). Such a measure, if it exists , describes the asymptotic behavior of any scheme τ n ={ \bf x k,n } k=1 dnE , n=1,2,\ldots , of nodes for multivariate polynomial interpolation for which the norms of the corresponding interpolation operators do not grow geometrically large with n . We demonstrate the existence of AIMs for the finite union of compact subsets of certain algebraic curves in R 2 . It turns out that the theory of logarithmic potentials with external fields plays a useful role in the investigation. Furthermore, for the sets mentioned above, we give a computationally simple construction for ``good' interpolation schemes. November 9, 2000. Date revised: August 4, 2001. Date accepted: September 14, 2001.  相似文献   
72.
We prove that the zeros of the polynomials Pm(a) of degree m, defined by Boros and Moll via
  相似文献   
73.
本文提出一种解析法和数值法相结合的方法,用来计算多项式微分系统的极限环,极限环表示为x=∑k≥0(ak cos kφ bk sin kφ),y=∑k≥0(ck cos kφ dk sin kφ),先用解析法求出小参数时极限环的初始表达式,然后用增量法和迭代法求出任意参数时极限环满足给定精度的表达式,半稳定极限环和分叉值也可以计算。  相似文献   
74.
The main goals of this paper are to: i) relate two iteration-complexity bounds derived for the Mizuno-Todd-Ye predictor-corrector (MTY P-C) algorithm for linear programming (LP), and; ii) study the geometrical structure of the LP central path. The first iteration-complexity bound for the MTY P-C algorithm considered in this paper is expressed in terms of the integral of a certain curvature function over the traversed portion of the central path. The second iteration-complexity bound, derived recently by the authors using the notion of crossover events introduced by Vavasis and Ye, is expressed in terms of a scale-invariant condition number associated with m × n constraint matrix of the LP. In this paper, we establish a relationship between these bounds by showing that the first one can be majorized by the second one. We also establish a geometric result about the central path which gives a rigorous justification based on the curvature of the central path of a claim made by Vavasis and Ye, in view of the behavior of their layered least squares path following LP method, that the central path consists of long but straight continuous parts while the remaining curved part is relatively “short”. R. D. C. Monteiro was supported in part by NSF Grants CCR-0203113 and CCF-0430644 and ONR grant N00014-05-1-0183. T. Tsuchiya was supported in part by Japan-US Joint Research Projects of Japan Society for the Promotion of Science “Algorithms for linear programs over symmetric cones” and the Grants-in-Aid for Scientific Research (C) 15510144 of Japan Society for the Promotion of Science.  相似文献   
75.
We study the existence of atomic decompositions for tensor products of Banach spaces and spaces of homogeneous polynomials. If a Banach space X admits an atomic decomposition of a certain kind, we show that the symmetrized tensor product of the elements of the atomic decomposition provides an atomic decomposition for the symmetric tensor product , for any symmetric tensor norm μ. In addition, the reciprocal statement is investigated and analogous consequences for the full tensor product are obtained. Finally we apply the previous results to establish the existence of monomial atomic decompositions for certain ideals of polynomials on X.  相似文献   
76.
近红外光谱法快速评定牛肉品质   总被引:5,自引:0,他引:5  
应用近红外反射光谱技术(NIRS),采用偏最小二乘法(PLS),建立了牛肉理化特性的近红外预测模型。从屠宰加工厂选取经48 h排酸后的里脊、眼肉、腿肉、臀肉、外脊等部位的牛肉样品114份,采用多元散射校正(MSC)、一阶导数、标准正态变量(SNV)预处理方法,谱区为950~1 650 nm,建立牛肉水分、脂肪、蛋白质3个化学参数以及pH、肉色(CEI L*,a*, b*)和剪切力(WBSF)3个物理参数的校正模型。其校正相关系数(R2)分别为0.947 2(水分),0.924 5(脂肪),0.934 6(蛋白质),0.620 2(pH),0.820 3(L*),0.864 6(a*),0.753 0(b*),0.475 9(WBSF)。校正标准差(RMSEC)分别为0.313 3(水分), 0.221 0(脂肪), 1.243 2(蛋白), 0.744 6(pH),1.778 3(L*),1.394 2(a*),1.763 9(b*),1.074 3(WBSF)。应用所建立的模型对30个实际牛肉样品的理化参数进行预测,并对预测值与实测值进行t检验,检验结果显示预测值与实测值差异不显著,说明模型适合于快速评价牛肉的品质。从预测的准确度看,化学指标预测的精确度明显高于物理指标。  相似文献   
77.
近年来随着数字技术,以及彩色数字图像输入输出设备的不断发展和广泛使用,颜色在不同的设备之间精确的传递或再现成为该领域的重要课题。本论文以彩色数码相机特性化为研究内容,采用多项式转换方法,研究了多项式回归模型不同系数矩阵、不同训练样本对数码相机特性化精度的影响,得出了系数矩阵为11×3多项式模型时误差较小(2.874ΔE*ab)的结论,达到了实用水平。  相似文献   
78.
General local convergence theorems with order of convergence r≥1r1 are provided for iterative processes of the type xn+1=Txnxn+1=Txn, where T:D⊂X→XT:DXX is an iteration function in a metric space XX. The new local convergence theory is applied to Newton iteration for simple zeros of nonlinear operators in Banach spaces as well as to Schröder iteration for multiple zeros of polynomials and analytic functions. The theory is also applied to establish a general theorem for the uniqueness ball of nonlinear equations in Banach spaces. The new results extend and improve some results of [K. Do?ev, Über Newtonsche Iterationen, C. R. Acad. Bulg. Sci. 36 (1962) 695–701; J.F. Traub, H. Wo?niakowski, Convergence and complexity of Newton iteration for operator equations, J. Assoc. Comput. Mach. 26 (1979) 250–258; S. Smale, Newton’s method estimates from data at one point, in: R.E. Ewing, K.E. Gross, C.F. Martin (Eds.), The Merging of Disciplines: New Direction in Pure, Applied, and Computational Mathematics, Springer, New York, 1986, pp. 185–196; P. Tilli, Convergence conditions of some methods for the simultaneous computation of polynomial zeros, Calcolo 35 (1998) 3–15; X.H. Wang, Convergence of Newton’s method and uniqueness of the solution of equations in Banach space, IMA J. Numer. Anal. 20 (2000) 123–134; I.K. Argyros, J.M. Gutiérrez, A unified approach for enlarging the radius of convergence for Newton’s method and applications, Nonlinear Funct. Anal. Appl. 10 (2005) 555–563; M. Giusti, G. Lecerf, B. Salvy, J.-C. Yakoubsohn, Location and approximation of clusters of zeros of analytic functions, Found. Comput. Math. 5 (3) (2005) 257–311], and others.  相似文献   
79.
This paper investigates the capabilities of several non-quadratic polynomial yield functions to model the plastic anisotropy of orthotropic sheet metal (plane stress). Fourth, sixth and eighth-order homogeneous polynomials are considered. For the computation of the coefficients of the fourth-order polynomial an improved set of analytic formulas is proposed. For sixth and eighth-order polynomials the identification uses optimization. Simple constraints on the optimization process are shown to lead to real-valued convex functions. A general method to extend the above plane stress criteria to full 3D stress states is also suggested. Besides their simplicity in formulation, it is found that polynomial yield functions are capable to model a wide range of anisotropic plastic properties (e.g., the Numisheet’93 mild steel, AA2008-T4, AA2090-T3). The yield functions have then been implemented into a commercial finite element code as constitutive subroutines. The deep drawing of square (Numisheet’93) and cylindrical (AA2090-T3) cups have been simulated. In both cases excellent agreement with experimental data is obtained. In particular, it is shown that non-quadratic polynomial yield functions can simulate cylindrical cups with six or eight ears. We close with a discussion on earing and further examples.  相似文献   
80.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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