全文获取类型
收费全文 | 2350篇 |
免费 | 111篇 |
国内免费 | 138篇 |
专业分类
化学 | 298篇 |
晶体学 | 3篇 |
力学 | 59篇 |
综合类 | 36篇 |
数学 | 1888篇 |
物理学 | 315篇 |
出版年
2023年 | 30篇 |
2022年 | 20篇 |
2021年 | 28篇 |
2020年 | 56篇 |
2019年 | 72篇 |
2018年 | 72篇 |
2017年 | 70篇 |
2016年 | 79篇 |
2015年 | 29篇 |
2014年 | 89篇 |
2013年 | 253篇 |
2012年 | 66篇 |
2011年 | 109篇 |
2010年 | 73篇 |
2009年 | 153篇 |
2008年 | 146篇 |
2007年 | 129篇 |
2006年 | 132篇 |
2005年 | 109篇 |
2004年 | 92篇 |
2003年 | 83篇 |
2002年 | 83篇 |
2001年 | 65篇 |
2000年 | 84篇 |
1999年 | 60篇 |
1998年 | 57篇 |
1997年 | 56篇 |
1996年 | 44篇 |
1995年 | 32篇 |
1994年 | 28篇 |
1993年 | 28篇 |
1992年 | 20篇 |
1991年 | 13篇 |
1990年 | 12篇 |
1989年 | 9篇 |
1988年 | 11篇 |
1987年 | 15篇 |
1986年 | 11篇 |
1985年 | 12篇 |
1984年 | 11篇 |
1983年 | 4篇 |
1982年 | 8篇 |
1981年 | 8篇 |
1980年 | 8篇 |
1979年 | 7篇 |
1978年 | 7篇 |
1977年 | 6篇 |
1976年 | 3篇 |
1973年 | 2篇 |
1972年 | 2篇 |
排序方式: 共有2599条查询结果,搜索用时 15 毫秒
31.
Arne Barinka Stephan Dahlke Wolfgang Dahmen 《Advances in Computational Mathematics》2006,24(1-4):5-34
Recently adaptive wavelet methods have been developed which can be shown to exhibit an asymptotically optimal accuracy/work
balance for a wide class of variational problems including classical elliptic boundary value problems, boundary integral equations
as well as certain classes of noncoercive problems such as saddle point problems. A core ingredient of these schemes is the
approximate application of the involved operators in standard wavelet representation. Optimal computational complexity could
be shown under the assumption that the entries in properly compressed standard representations are known or computable in
average at unit cost. In this paper we propose concrete computational strategies and show under which circumstances this assumption
is justified in the context of elliptic boundary value problems.
Dedicated to Charles A. Micchelli on the occasion of his 60th birthday
Mathematics subject classifications (2000) 41A25, 41A46, 65F99, 65N12, 65N55.
This work has been supported in part by the Deutsche Forschungsgemeinschaft SFB 401, the first and third author are supported
in part by the European Community's Human Potential Programme under contract HPRN-CT-202-00286 (BREAKING COMPLEXITY). The
second author acknowledges the financial support provided through the European Union's Human Potential Programme, under contract
HPRN-CT-2002-00285 (HASSIP) and through DFG grant DA 360/4–1. 相似文献
32.
本文研究了未知分布的逼近问题,利用随机加权法,给出了有Edgeworth展式的一类(未知)分布的模拟分布,证明了在一定条件下,模拟分布与未知分布的逼近精度达到O(n^-1√lnlnn),称之为随机加权逼近的重对数律。 相似文献
33.
环上矩阵的广义Moore-Penrose逆 总被引:14,自引:0,他引:14
本文给出带有对合的有1的结合环上一类矩阵的广义Moore-Penrose逆存在的充要条件,而这类矩阵概括了左右主理想整环,单Artin环上所有矩阵。 相似文献
34.
The adaptive cross approximation (ACA) algorithm (Numer. Math. 2000; 86 :565–589; Computing 2003; 70 (1):1–24) provides a means to compute data‐sparse approximants of discrete integral formulations of elliptic boundary value problems with almost linear complexity. ACA uses only few of the original entries for the approximation of the whole matrix and is therefore well‐suited to speed up existing computer codes. In this article we extend the convergence proof of ACA to Galerkin discretizations. Additionally, we prove that ACA can be applied to integral formulations of systems of second‐order elliptic operators without adaptation to the respective problem. The results of applying ACA to boundary integral formulations of linear elasticity are reported. Furthermore, we comment on recent implementation issues of ACA for non‐smooth boundaries. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
35.
Two matrix approximation problems are considered: approximation of a rectangular complex matrix by subunitary matrices with
respect to unitarily invariant norms and a minimal rank approximation with respect to the spectral norm. A characterization
of a subunitary approximant of a square matrix with respect to the Schatten norms, given by Maher, is extended to the case
of rectangular matrices and arbitrary unitarily invariant norms. Iterative methods, based on the family of Gander methods
and on Higham’s scaled method for polar decomposition of a matrix, are proposed for computing subunitary and minimal rank
approximants. Properties of Gander methods are investigated in details.
AMS subject classification (2000) 65F30, 15A18 相似文献
36.
37.
In this paper, based on the Pauli matrices, a notion of augmented spinor space is introduced, and a uniqueness of such augmented spinor space of rank n is proved. It may be expected that this new notion of spaces can be used in mathematical physics and geometry. 相似文献
38.
谱约束下对称正交对称矩阵束的最佳逼近 总被引:3,自引:0,他引:3
讨论了对称正交对称矩阵的广义逆特征值问题,得到了通解表达式和最佳解的表达式。 相似文献
39.
Sparse approximate inverse (SAI) techniques have recently emerged as a new class of parallel preconditioning techniques for
solving large sparse linear systems on high performance computers. The choice of the sparsity pattern of the SAI matrix is
probably the most important step in constructing an SAI preconditioner. Both dynamic and static sparsity pattern selection
approaches have been proposed by researchers. Through a few numerical experiments, we conduct a comparable study on the properties
and performance of the SAI preconditioners using the different sparsity patterns for solving some sparse linear systems.
This revised version was published online in July 2006 with corrections to the Cover Date. 相似文献
40.
Mursaleen 《Journal of Mathematical Analysis and Applications》2004,293(2):523-531
The idea of almost convergence for double sequences was introduced by Moricz and Rhoades [Math. Proc. Cambridge Philos. Soc. 104 (1988) 283-294] and they also characterized the four dimensional strong regular matrices. In this paper we define and characterize the almost strongly regular matrices for double sequences and apply these matrices to establish a core theorem. 相似文献