首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1452篇
  免费   162篇
  国内免费   159篇
数理化   1773篇
  2023年   20篇
  2022年   13篇
  2021年   18篇
  2020年   39篇
  2019年   39篇
  2018年   35篇
  2017年   61篇
  2016年   52篇
  2015年   43篇
  2014年   69篇
  2013年   86篇
  2012年   53篇
  2011年   81篇
  2010年   58篇
  2009年   94篇
  2008年   85篇
  2007年   101篇
  2006年   82篇
  2005年   95篇
  2004年   62篇
  2003年   72篇
  2002年   80篇
  2001年   68篇
  2000年   63篇
  1999年   56篇
  1998年   46篇
  1997年   35篇
  1996年   36篇
  1995年   24篇
  1994年   15篇
  1993年   22篇
  1992年   9篇
  1991年   9篇
  1990年   8篇
  1989年   3篇
  1988年   3篇
  1987年   4篇
  1986年   4篇
  1985年   5篇
  1984年   3篇
  1983年   1篇
  1982年   5篇
  1981年   3篇
  1980年   4篇
  1979年   1篇
  1977年   1篇
  1976年   3篇
  1975年   1篇
  1957年   1篇
  1936年   1篇
排序方式: 共有1773条查询结果,搜索用时 0 毫秒
1.
Over the last 20 years a large number of algorithms has been published to improve the speed and domain of convergence of continued fractions. In this survey we show that these algorithms are strongly related. Actually, they essentially boil down to two main principles.We also prove some results on asymptotic expansions of tail values of limit periodic continued fractions.Dedicated to Luigi Gatteschi on his seventieth birthdayThis research was partially supported by The Norwegian Research Council and by the HMC project ROLLS, under contract CHRX-CT93-0416.  相似文献   
2.
In this paper, we prove Brennan's conjecture for conformal mappings f of the disk {z : | z| < 1} assuming that the Taylor coefficients of the function log(zf′(z)/f(z)) at zero are nonnegative. We also obtain inequalities for the integral means over the circle |z| = r of the squared modulus of the function zf′(z)/f(z).  相似文献   
3.
Given the operator product BA in which both A and B are symmetric positive‐definite operators, for which symmetric positive‐definite operators C is BA symmetric positive‐definite in the C inner product 〈x, yC? This question arises naturally in preconditioned iterative solution methods, and will be answered completely here. Copyright © 2004 John Wiley & Sons, Ltd.  相似文献   
4.
李玉成 《数学杂志》2005,25(3):312-316
本文考虑广义C-R组^[1](H)的解f=u iv jw∈C^2的一些性质,提出与之相关的两个边值问题,用积分方程方法和调和函数性质证明了边值问题解的存在唯一性,并写出解的积分表达式.  相似文献   
5.
We examine several interesting relationships and expressions involving Fourier-Feynman transform, convolution product and first variation for functionals in the Fresnel class F(B) of an abstract Wiener space B. We also prove a translation theorem and Parseval's identity for the analytic Feynman integral. This revised version was published online in June 2006 with corrections to the Cover Date.  相似文献   
6.
黄翔 《运筹学学报》2005,9(4):74-80
近年来,决定椭圆型方程系数反问题在地磁、地球物理、冶金和生物等实际问题上有着广泛的应用.本文讨论了二维的决定椭圆型方程系数反问题的数值求解方法.由误差平方和最小原则,这个反问题可化为一个变分问题,并进一步离散化为一个最优化问题,其目标函数依赖于要决定的方程系数.本文着重考察非线性共轭梯度法在此最优化问题数值计算中的表现,并与拟牛顿法作为对比.为了提高算法的效率我们适当选择加快收敛速度的预处理矩阵.同时还考察了线搜索方法的不同对优化算法的影响.数值实验的结果表明,非线性共轭梯度法在这类大规模优化问题中相对于拟牛顿法更有效.  相似文献   
7.
He  Qi-Ming  Li  Hui 《Queueing Systems》2003,44(2):137-160
In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically.  相似文献   
8.
Typical behaviour of the solution of a linear system of equations obtained iteratively by Krylov methods can be characterized by three stages. Initially the residual diminishes steadily; this is followed by stagnation and finally rapid convergence near the algebraic grade. This study examines this behaviour in terms of the concepts of approximately invariant subspace and what we have called the analytic grade of a Krylov sequence. It is shown how the small Ritz values play a vital role in the convergence and how this knowledge helps in the construction of an effective preconditioner. Copyright © 2004 John Wiley & Sons, Ltd.  相似文献   
9.
In this paper we are concerned with the initial boundary value problem of the micropolar fluid system in a three dimensional bounded domain. We study the resolvent problem of the linearized equations and prove the generation of analytic semigroup and its time decay estimates. In particular, LpLq type estimates are obtained. By use of the LpLq estimates for the semigroup, we prove the existence theorem of global in time solution to the original nonlinear problem for small initial data. Furthermore, we study the magneto‐micropolar fluid system in the final section. Copyright © 2005 John Wiley & Sons, Ltd.  相似文献   
10.
Integration of the subsurface flow equation by finite elements (FE) in space and finite differences (FD) in time requires the repeated solution to sparse symmetric positive definite systems of linear equations. Iterative techniques based on preconditioned conjugate gradients (PCG) are one of the most attractive tool to solve the problem on sequential computers. A present challenge is to make PCG attractive in a parallel computing environment as well. To this aim a key factor is the development of an efficient parallel preconditioner. FSAI (factorized sparse approximate inverse) and enlarged FSAI relying on the approximate inverse of the coefficient matrix appears to be a most promising parallel preconditioner. In the present paper PCG using FSAI, diagonal and pARMS (parallel algebraic recursive multilevel solvers) preconditioners is implemented on the IBM SP4/512 and CLX/768 supercomputers with up to 32 processors to solve underground flow problems of a large size. The results show that FSAI may allow for a parallel relative efficiency larger than 50% on the largest problems with p=32 processors. Moreover, FSAI turns out to be significantly less expensive and more robust than pARMS. Finally, it is shown that for p in the upper range may be much improved if PCG–FSAI is implemented on CLX.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号