全文获取类型
收费全文 | 627篇 |
免费 | 52篇 |
国内免费 | 44篇 |
专业分类
化学 | 8篇 |
力学 | 74篇 |
综合类 | 9篇 |
数学 | 569篇 |
物理学 | 63篇 |
出版年
2024年 | 2篇 |
2023年 | 5篇 |
2022年 | 5篇 |
2021年 | 13篇 |
2020年 | 8篇 |
2019年 | 8篇 |
2018年 | 10篇 |
2017年 | 10篇 |
2016年 | 23篇 |
2015年 | 11篇 |
2014年 | 30篇 |
2013年 | 43篇 |
2012年 | 15篇 |
2011年 | 47篇 |
2010年 | 26篇 |
2009年 | 46篇 |
2008年 | 38篇 |
2007年 | 35篇 |
2006年 | 52篇 |
2005年 | 53篇 |
2004年 | 22篇 |
2003年 | 26篇 |
2002年 | 19篇 |
2001年 | 24篇 |
2000年 | 16篇 |
1999年 | 21篇 |
1998年 | 25篇 |
1997年 | 18篇 |
1996年 | 19篇 |
1995年 | 3篇 |
1994年 | 8篇 |
1993年 | 7篇 |
1992年 | 1篇 |
1991年 | 2篇 |
1990年 | 3篇 |
1989年 | 5篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 5篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1977年 | 1篇 |
1976年 | 3篇 |
1973年 | 2篇 |
1969年 | 1篇 |
1936年 | 1篇 |
排序方式: 共有723条查询结果,搜索用时 15 毫秒
1.
2.
The Iyengar Type Inequalities with Exact Estimations and the Chebyshev Central Algorithms of Integrals 总被引:3,自引:0,他引:3
Xing Hua WANG Shi Jun YANG 《数学学报(英文版)》2005,21(6):1361-1376
In this paper, both low order and high order extensions of the Iyengar type inequality are obtained. Such extensions are the best possible in the same sense as that of the Iyengar inequality. hzrthermore, the Chebyshev central algorithms of integrals for some function classes and some related problems are also considered and investigated. 相似文献
3.
YaoKui ChenZhixiang 《分析论及其应用》2003,19(2):115-120
This paper gives the weighted Lp convergence rate estimations of the Gruenwald interpolatory polynomials based on the zeros of Chebyshev polymomials of the first kind,and proves that the order of the estimations is optimal for p≥1. 相似文献
4.
Jonathan M. Borwein 《Optimization Letters》2007,1(1):21-32
This paper is a companion to a lecture given at the Prague Spring School in Analysis in April 2006. It highlights four distinct variational methods of proving that a finite dimensional Chebyshev set is convex and hopes to inspire renewed work on the open question of whether every Chebyshev set in Hilbert space is convex. 相似文献
5.
Marie-Laurence Mazure 《Advances in Computational Mathematics》2007,26(1-3):305-322
In order to ensure existence of a de Boor algorithm (hence of a B-spline basis) in a given spline space with (n+1)-dimensional sections, it is important to be able to generate each spline by restriction to the diagonal of a symmetric function of n variables supposed to be pseudoaffine w.r. to each variable. We proved that a way to obtain these three properties (symmetry, n-pseudoaffinity, diagonal property) is to suppose the existence of blossoms on the set of admissible n-tuples, given that blossoms are defined in a geometric way by means of intersections of osculating flats. In the present paper, we examine the converse: do symmetry, n-pseudoaffinity, and diagonal property imply existence of blossoms? 相似文献
6.
Chin-Yuan Hu 《Journal of Mathematical Analysis and Applications》2007,328(1):201-219
Recently we established Matysiak and Szablowski's conjecture [V. Matysiak, P.J. Szablowski, Theory Probab. Appl. 45 (2001) 711-713] about a lower bound of real-valued characteristic functions. In this paper, applying an alternative approach we are able to give explicitly the ranges of argument for which the obtained inequalities hold true for general characteristic functions. 相似文献
7.
The von Neumann cellular automaton appears in many different settings in Operations Research varying from applications in Formal Languages to Biology. One of the major questions related to it is to find a general condition for irreversibility of a class of two-dimensional cellular automata on square grids (σ+-automata). This question is partially answered here with the proposal of a sufficient condition for the irreversibility of σ+-automata. 相似文献
8.
V. N. Dubinin 《Mathematical Notes》2006,80(1-2):31-35
It is shown that if P(z) = z n + ? is a polynomial with connected lemniscate E(P) = {z: ¦P(z)¦ ≤ 1} and m critical points, then, for any n? m+1 points on the lemniscate E(P), there exists a continuum γ ? E(P) of logarithmic capacity cap γ ≤ 2?1/n which contains these points and all zeros and critical points of the polynomial. As corollaries, estimates for continua of minimum capacity containing given points are obtained. 相似文献
9.
10.
Arno B. J. Kuijlaars. 《Mathematics of Computation》1996,65(213):151-156
It is shown that the zeros of the Faber polynomials generated by a regular -star are located on the -star. This proves a recent conjecture of J. Bartolomeo and M. He. The proof uses the connection between zeros of Faber polynomials and Chebyshev quadrature formulas.