全文获取类型
收费全文 | 353篇 |
免费 | 26篇 |
国内免费 | 25篇 |
专业分类
化学 | 10篇 |
晶体学 | 1篇 |
力学 | 19篇 |
综合类 | 6篇 |
数学 | 299篇 |
物理学 | 69篇 |
出版年
2024年 | 7篇 |
2023年 | 9篇 |
2022年 | 6篇 |
2021年 | 7篇 |
2020年 | 10篇 |
2019年 | 12篇 |
2018年 | 9篇 |
2017年 | 3篇 |
2016年 | 14篇 |
2015年 | 7篇 |
2014年 | 12篇 |
2013年 | 18篇 |
2012年 | 20篇 |
2011年 | 12篇 |
2010年 | 10篇 |
2009年 | 19篇 |
2008年 | 16篇 |
2007年 | 23篇 |
2006年 | 20篇 |
2005年 | 27篇 |
2004年 | 13篇 |
2003年 | 13篇 |
2002年 | 10篇 |
2001年 | 12篇 |
2000年 | 14篇 |
1999年 | 9篇 |
1998年 | 16篇 |
1997年 | 11篇 |
1996年 | 4篇 |
1995年 | 6篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1992年 | 4篇 |
1991年 | 5篇 |
1990年 | 5篇 |
1989年 | 3篇 |
1986年 | 2篇 |
1985年 | 4篇 |
1984年 | 1篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1973年 | 2篇 |
1959年 | 1篇 |
排序方式: 共有404条查询结果,搜索用时 171 毫秒
21.
The logarithmic norm. History and modern theory 总被引:1,自引:0,他引:1
Gustaf Söderlind 《BIT Numerical Mathematics》2006,46(3):631-652
In his 1958 thesis Stability and Error Bounds, Germund Dahlquist introduced the logarithmic norm in order to derive error bounds in initial value problems, using differential inequalities that distinguished between forward and reverse time integration. Originally defined for matrices, the logarithmic norm can be extended to bounded linear operators, but the extensions to nonlinear maps and unbounded operators have required a functional analytic redefinition of the concept.This compact survey is intended as an elementary, but broad and largely self-contained, introduction to the versatile and powerful modern theory. Its wealth of applications range from the stability theory of IVPs and BVPs, to the solvability of algebraic, nonlinear, operator, and functional equations. In memory of Germund Dahlquist (1925–2005).AMS subject classification (2000) 65L05 相似文献
22.
本文给出对数K-Carleson测度的一个新特征,并以此为工具研究QK空间的乘子代数M(QK),给出乘子代数M(QK)的某些特征描述.利用对数K-Carleson测度及QK空间的一个新特征,建立乘子代数M(QK)上的Corona定理和Wolff定理. 相似文献
23.
We consider the maximum function f resulting from a finite number of smooth functions. The logarithmic barrier function of the epigraph of f gives rise to a smooth approximation g
of f itself, where >0 denotes the approximation parameter. The one-parametric family g
converges – relative to a compact subset – uniformly to the function f as tends to zero. Under nondegeneracy assumptions we show that the stationary points of g
and f correspond to each other, and that their respective Morse indices coincide. The latter correspondence is obtained by establishing smooth curves x() of stationary points for g
, where each x() converges to the corresponding stationary point of f as tends to zero. In case of a strongly unique local minimizer, we show that the nondegeneracy assumption may be relaxed in order to obtain a smooth curve x(). 相似文献
24.
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. 相似文献
25.
Marcus Porembski 《Journal of Global Optimization》2001,20(2):109-132
In 1964 Tuy introduced a new type of cutting plane, the concavity cut, in the context of concave minimization. These cutting planes, which are also known as convexity cuts, intersection cuts and Tuy cuts, have found application in several algorithms, e.g., branch and bound algorithm, conical algorithm and cutting plane algorithm, and also in algorithms for other optimization problems, e.g., reverse convex programming, bilinear programming and Lipschitzian optimization. Up to now, however, it has not been possible to either prove or disprove the finite convergence of a pure cutting plane algorithm for concave minimization based solely on these cutting planes. In the present paper a modification of the concavity cut is proposed that yields deeper cutting planes and ensures the finite convergence of a pure cutting plane algorithm based on these cuts. 相似文献
26.
Young Ja Park 《Proceedings of the American Mathematical Society》2004,132(7):2075-2083
A logarithmic Sobolev trace inequality is derived. Bounds on the best constant for this inequality from above and below are investigated using the sharp Sobolev inequality and the sharp logarithmic Sobolev inequality.
27.
Direct approach to quantum extensions of Fisher information 总被引:1,自引:0,他引:1
By manipulating classical Fisher information and employing various derivatives of density operators, and using entirely intuitive
and direct methods, we introduce two families of quantum extensions of Fisher information that include those defined via the
symmetric logarithmic derivative, via the right logarithmic derivative, via the Bogoliubov-Kubo-Mori derivative, as well as
via the derivative in terms of commutators, as special cases. Some fundamental properties of these quantum extensions of Fisher
information are investigated, a multi-parameter quantum Cramér-Rao inequality is established, and applications to characterizing
quantum uncertainty are illustrated.
相似文献
28.
29.
30.
Oliver Roth 《Proceedings of the American Mathematical Society》2007,135(7):2051-2054
We prove the sharp inequality for the logarithmic coefficients of a normalized univalent function in the unit disk.