全文获取类型
收费全文 | 550篇 |
免费 | 32篇 |
国内免费 | 15篇 |
专业分类
化学 | 54篇 |
晶体学 | 3篇 |
力学 | 151篇 |
综合类 | 3篇 |
数学 | 291篇 |
物理学 | 95篇 |
出版年
2023年 | 6篇 |
2022年 | 10篇 |
2021年 | 7篇 |
2020年 | 13篇 |
2019年 | 8篇 |
2018年 | 11篇 |
2017年 | 22篇 |
2016年 | 10篇 |
2015年 | 18篇 |
2014年 | 22篇 |
2013年 | 49篇 |
2012年 | 22篇 |
2011年 | 47篇 |
2010年 | 41篇 |
2009年 | 28篇 |
2008年 | 34篇 |
2007年 | 37篇 |
2006年 | 26篇 |
2005年 | 23篇 |
2004年 | 22篇 |
2003年 | 18篇 |
2002年 | 17篇 |
2001年 | 14篇 |
2000年 | 13篇 |
1999年 | 7篇 |
1998年 | 12篇 |
1997年 | 10篇 |
1996年 | 6篇 |
1995年 | 6篇 |
1994年 | 3篇 |
1993年 | 5篇 |
1992年 | 4篇 |
1991年 | 10篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 3篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 3篇 |
1982年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有597条查询结果,搜索用时 125 毫秒
51.
We prove that the octonionic polynomials V ■k l 1 ··· l k are independent of the associative orders ■k . This improves the octonionic Taylor type theorem. 相似文献
52.
This article presents a Taylor collocation method for the approximate solution of high‐order linear Volterra‐Fredholm integrodifferential equations with linear functional arguments. This method is essentially based on the truncated Taylor series and its matrix representations with collocation points. Some numerical examples, which consist of initial and boundary conditions, are given to show the properties of the technique. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011 相似文献
53.
54.
55.
文献《On elementary bounds for ∑∞k=n 1/ks》(American Mathematical Monthly,2015,122(2):155-158)给出了p-级数余项的一个估计,本文利用Taylor展开公式进一步改进了这个估计. 相似文献
56.
给出一类离散变量函数展开的方法,给出对Van der Corput不等式的一个改进;将这个方法扩展后可以应用于更多的离散变量函数的展开与研究,例如对Stirling公式的改进. 相似文献
57.
Several improvements are made to an algorithm of Higham and Smith for computing the matrix cosine. The original algorithm
scales the matrix by a power of 2 to bring the ∞-norm to 1 or less, evaluates the [8/8] Padé approximant, then uses the double-angle
formula cos (2A)=2cos 2A−I to recover the cosine of the original matrix. The first improvement is to phrase truncation error bounds in terms of ‖A2‖1/2 instead of the (no smaller and potentially much larger quantity) ‖A‖. The second is to choose the degree of the Padé approximant to minimize the computational cost subject to achieving a desired
truncation error. A third improvement is to use an absolute, rather than relative, error criterion in the choice of Padé approximant;
this allows the use of higher degree approximants without worsening an a priori error bound. Our theory and experiments show
that each of these modifications brings a reduction in computational cost. Moreover, because the modifications tend to reduce
the number of double-angle steps they usually result in a more accurate computed cosine in floating point arithmetic. We also
derive an algorithm for computing both cos (A) and sin (A), by adapting the ideas developed for the cosine and intertwining the cosine and sine double angle recurrences.
AMS subject classification 65F30
Numerical Analysis Report 461, Manchester Centre for Computational Mathematics, February 2005.
Gareth I. Hargreaves: This work was supported by an Engineering and Physical Sciences Research Council Ph.D. Studentship.
Nicholas J. Higham: This work was supported by Engineering and Physical Sciences Research Council grant GR/T08739 and by a
Royal Society–Wolfson Research Merit Award. 相似文献
58.
Fu-Chuen Chang 《Annals of the Institute of Statistical Mathematics》2005,57(4):833-844
This paper is concerned with the problem of computing approximateD-optimal design for polynomial regression with analytic weight function on a interval [m
0-a,m
0+a]. It is shown that the structure of the optimal design depends ona and weight function. Moreover, the optimal support points and weights are analytic functions ofa ata=0. We make use of a Taylor expansion to provide a recursive procedure for calculating theD-optimal designs. 相似文献
59.
Vadim Dubovsky Alexander Yakhot 《Numerical Methods for Partial Differential Equations》2006,22(5):1070-1079
An approximation of function u(x) as a Taylor series expansion about a point x0 at M points xi, ~ i = 1,2,…,M is used where xi are arbitrary‐spaced. This approximation is a linear system for the derivatives u(k) with an arbitrary accuracy. An analytical expression for the inverse matrix A ?1 where A = [Aik] = (xi ? x0)k is found. A finite‐difference approximation of derivatives u(k) of a given function u(x) at point x0 is derived in terms of the values u(xi). © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006 相似文献
60.