全文获取类型
收费全文 | 3759篇 |
免费 | 175篇 |
国内免费 | 222篇 |
专业分类
化学 | 303篇 |
晶体学 | 2篇 |
力学 | 34篇 |
综合类 | 67篇 |
数学 | 2292篇 |
物理学 | 340篇 |
综合类 | 1118篇 |
出版年
2024年 | 4篇 |
2023年 | 37篇 |
2022年 | 45篇 |
2021年 | 54篇 |
2020年 | 64篇 |
2019年 | 88篇 |
2018年 | 89篇 |
2017年 | 86篇 |
2016年 | 89篇 |
2015年 | 53篇 |
2014年 | 134篇 |
2013年 | 310篇 |
2012年 | 120篇 |
2011年 | 177篇 |
2010年 | 133篇 |
2009年 | 215篇 |
2008年 | 201篇 |
2007年 | 205篇 |
2006年 | 222篇 |
2005年 | 198篇 |
2004年 | 156篇 |
2003年 | 168篇 |
2002年 | 138篇 |
2001年 | 120篇 |
2000年 | 140篇 |
1999年 | 112篇 |
1998年 | 106篇 |
1997年 | 109篇 |
1996年 | 82篇 |
1995年 | 68篇 |
1994年 | 73篇 |
1993年 | 63篇 |
1992年 | 48篇 |
1991年 | 35篇 |
1990年 | 34篇 |
1989年 | 33篇 |
1988年 | 23篇 |
1987年 | 20篇 |
1986年 | 18篇 |
1985年 | 13篇 |
1984年 | 11篇 |
1983年 | 4篇 |
1982年 | 7篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 7篇 |
1978年 | 8篇 |
1977年 | 7篇 |
1976年 | 4篇 |
1973年 | 3篇 |
排序方式: 共有4156条查询结果,搜索用时 15 毫秒
41.
Various tests have been carried out in order to compare the performances of several methods used to solve the non-symmetric linear systems of equations arising from implicit discretizations of CFD problems, namely the scalar advection-diffusion equation and the compressible Euler equations. The iterative schemes under consideration belong to three families of algorithms: relaxation (Jacobi and Gauss-Seidel), gradient and Newton methods. Two gradient methods have been selected: a Krylov subspace iteration method (GMRES) and a non-symmetric extension of the conjugate gradient method (CGS). Finally, a quasi-Newton method has also been considered (Broyden). The aim of this paper is to provide indications of which appears to be the most adequate method according to the particular circumstances as well as to discuss the implementation aspects of each scheme. 相似文献
42.
Block-diagonalization of sparse equivariant discretization matrices is studied. Such matrices typically arise when partial
differential equations that evolve in symmetric geometries are discretized via the finite element method or via finite differences.
By considering sparse equivariant matrices as equivariant graphs, we identify a condition for when block-diagonalization via
a sparse variant of a generalized Fourier transform (GFT) becomes particularly simple and fast.
Characterizations for finite element triangulations of a symmetric domain are given, and formulas for assembling the block-diagonalized
matrix directly are presented. It is emphasized that the GFT preserves symmetric (Hermitian) properties of an equivariant
matrix.
By simulating the heat equation at the surface of a sphere discretized by an icosahedral grid, it is demonstrated that the
block-diagonalization is beneficial. The gain is significant for a direct method, and modest for an iterative method.
A comparison with a block-diagonalization approach based upon the continuous formulation is made. It is found that the sparse
GFT method is an appropriate way to discretize the resulting continuous subsystems, since the spectrum and the symmetry are
preserved.
AMS subject classification (2000) 43A30, 65T99, 20B25 相似文献
43.
运用一种新的动力学突变检测方法——排列熵(permutation entropy,PE)算法,计算并分析了中国华北地区52个站点1960年—2000年逐日平均气温资料的排列熵演化情况,发现中国华北地区气温在20世纪70年代中期、80年代初均发生了较大突变;进一步用经验模态分解(empirical mode decomposition,EMD)方法对排列熵序列进行逐级平稳化处理,结果发现这一地区的气温突变与准10年这一年代际时间尺度的周期变率密切相关,其原因与太阳黑子活动有着密切联系.
关键词:
华北
突变
排列熵算法
经验模态分解 相似文献
44.
In this paper we consider certain matrix equations in the field of Mikusiński operators, and construct a method for obtaining an approximate solution which allows working with numerical constants instead of operators. The theory of diagonally dominant matrices is applied for the analysis, existence and character of the obtained solutions. We introduce a method for determining approximate solutions of a discrete analogue for operational differential equations and give conditions for their existence. The error of the approximation is estimated. 相似文献
45.
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. 相似文献
46.
Mathematical Notes - 相似文献
47.
吴松年 《江南大学学报(自然科学版)》2002,1(1):86-91
基于两个矩阵方程,讨论了矩阵的一种快速求逆算法。在考虑矩阵的对称性,稀疏怀及减缩部分逆阵元素后,推导出逆阵块元素B11^-,B12^- 和B12^-的计算公式并给出算法程序实现方案与算例,是一种大幅减少计算机存贮量与计算次数的快速有效算法。 相似文献
48.
环上矩阵的广义Moore-Penrose逆 总被引:14,自引:0,他引:14
本文给出带有对合的有1的结合环上一类矩阵的广义Moore-Penrose逆存在的充要条件,而这类矩阵概括了左右主理想整环,单Artin环上所有矩阵。 相似文献
49.
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. 相似文献
50.
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 相似文献