全文获取类型
收费全文 | 898篇 |
免费 | 11篇 |
国内免费 | 41篇 |
专业分类
化学 | 17篇 |
力学 | 23篇 |
综合类 | 1篇 |
数学 | 850篇 |
物理学 | 59篇 |
出版年
2023年 | 10篇 |
2022年 | 17篇 |
2021年 | 16篇 |
2020年 | 17篇 |
2019年 | 22篇 |
2018年 | 18篇 |
2017年 | 14篇 |
2016年 | 14篇 |
2015年 | 13篇 |
2014年 | 35篇 |
2013年 | 138篇 |
2012年 | 28篇 |
2011年 | 49篇 |
2010年 | 43篇 |
2009年 | 84篇 |
2008年 | 70篇 |
2007年 | 59篇 |
2006年 | 48篇 |
2005年 | 24篇 |
2004年 | 27篇 |
2003年 | 24篇 |
2002年 | 15篇 |
2001年 | 13篇 |
2000年 | 13篇 |
1999年 | 17篇 |
1998年 | 21篇 |
1997年 | 23篇 |
1996年 | 18篇 |
1995年 | 17篇 |
1994年 | 8篇 |
1993年 | 8篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 4篇 |
1989年 | 1篇 |
1987年 | 2篇 |
1985年 | 4篇 |
1984年 | 4篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
排序方式: 共有950条查询结果,搜索用时 15 毫秒
871.
Robust Stability of Polynomials: New Approach 总被引:1,自引:0,他引:1
N. E. Mastorakis 《Journal of Optimization Theory and Applications》1997,93(3):635-638
The problem of the robust stability of a Hurwitz polynomial which is the characteristic polynomial of a discrete-time linear time-invariant system is investigated. A new approach based on the Rouché theorem of classical complex analysis is adopted. An interesting sufficient condition for robust stability is derived. Three examples are included to support the theoretical result. 相似文献
872.
W. Gehlen 《Constructive Approximation》1998,14(1):79-96
We consider the limit distribution of measures μ
n
, that appear in extremal signatures in the best polynomial approximation of a real-valued function . Relations between structural properties of the function f and weak-star limit points of (μ
n
)
n
are proved.
April 4, 1996. Date revised: October 25, 1996. 相似文献
873.
Elimination is a basic algebraic operation which geometrically corresponds to projections. This article describes using the numerical algebraic geometric concept of witness sets to compute the projection of an algebraic set. The ideas described in this article apply to computing the image of an algebraic set under any linear map. 相似文献
874.
For a compact set C, 1, we consider the Chebyshev problem
相似文献
875.
Amos Ron 《Constructive Approximation》1990,6(2):139-155
The interrelation between the shape of the support of a compactly supported function and the space of all exponential-polynomials spanned by its integer translates is examined. The results obtained are in terms of the behavior of these exponential-polynomials on certain finite subsets ofZ
s
, which are determined by the support of the given function. Several applications are discussed. Among these is the construction of quasi-interpolants of minimal support and the construction of a piecewise-polynomial whose integer translates span a polynomial space which is not scale-invariant. As to polynomial box splines, it is proved here that in many cases a polynomial box spline admits a certain optimality condition concerning the space of the total degree polynomials spanned by its integer translates: This space is maximal compared with the spaces corresponding to other functions with the same supportCommunicated by Klaus Höllig. 相似文献
876.
David W. Boyd. 《Mathematics of Computation》1997,66(220):1697-1703
We consider a question of Byrnes concerning the minimal degree of a polynomial with all coefficients in which has a zero of a given order at . For , we prove his conjecture that the monic polynomial of this type of minimal degree is given by , but we disprove this for . We prove that a polynomial of this type must have , which is in sharp contrast with the situation when one allows coefficients in . The proofs use simple number theoretic ideas and depend ultimately on the fact that .
877.
There are many interior-point algorithms for LP (linear programming), QP (quadratic programming), and LCPs (linear complementarity problems). While the algebraic definitions of these problems are different from each other, we show that they are all of the same general form when we define the problems geometrically. We derive some basic properties related to such geometrical (monotone) LCPs and based on these properties, we propose and analyze a simple infeasible-interior-point algorithm for solving geometrical LCPs. The algorithm can solve any instance of the above classes without making any assumptions on the problem. It features global convergence, polynomial-time convergence if there is a solution that is smaller than the initial point, and quadratic convergence if there is a strictly complementary solution.This research was performed while the first author was visiting the Institute of Applied Mathematics and Statistics, Würzburg University as a Research Fellow of the Alexander von Humboldt Foundation. 相似文献
878.
In this paper we will revise the mistakes in a previous paper of Zhang Xikang (Number of integral lines of polynomial systems of degree three and four, J. Nanjing Univ. Math. Biquarterly, Supplement, 1993, pp. 209-212) for the proof of the conjecture on the maximum number of invariant straight lines of cubic and quartic polynomial differential systems; and also prove the conjecture in a previous paper of the second author (Qualitative theory of polynomial differential systems, Shanghai Science-Technical Publishers, Shanghai, 1995, p. 474) for a certain special case of the degree polynomial systems. Furthermore, we will prove that cubic and quartic differential systems have invariant straight lines along at most six and nine different directions, respectively, and also show that the maximum number of the directions can be obtained.
879.
V. V Andrievskii 《Constructive Approximation》2005,22(3):297-308
We obtain a sharp upper bound on exponentials of logarithmic potentials at any point of the unit disk D, provided that the area of the subset of \overline{D}, where such exponentials are at most 1, is known. 相似文献
880.
Viktor Levandovskyy 《Journal of Differential Equations》2009,246(3):1274-1287
We present a method for investigating the cyclicity of an elementary focus or center of a polynomial system of differential equations by means of complexification of the system and application of algorithms of computational algebra, showing an approach to treating the case that the Bautin ideal B of focus quantities is not a radical ideal (more precisely, when the ideal BK is not radical, where BK is the ideal generated by the shortest initial string of focus quantities that, like the Bautin ideal, determines the center variety). We illustrate the method with a family of cubic systems. 相似文献
|