全文获取类型
收费全文 | 5450篇 |
免费 | 243篇 |
国内免费 | 243篇 |
专业分类
化学 | 605篇 |
晶体学 | 2篇 |
力学 | 150篇 |
综合类 | 37篇 |
数学 | 1324篇 |
物理学 | 331篇 |
综合类 | 3487篇 |
出版年
2024年 | 4篇 |
2023年 | 31篇 |
2022年 | 49篇 |
2021年 | 39篇 |
2020年 | 85篇 |
2019年 | 89篇 |
2018年 | 84篇 |
2017年 | 96篇 |
2016年 | 101篇 |
2015年 | 126篇 |
2014年 | 306篇 |
2013年 | 316篇 |
2012年 | 297篇 |
2011年 | 422篇 |
2010年 | 352篇 |
2009年 | 368篇 |
2008年 | 469篇 |
2007年 | 511篇 |
2006年 | 371篇 |
2005年 | 328篇 |
2004年 | 231篇 |
2003年 | 235篇 |
2002年 | 196篇 |
2001年 | 160篇 |
2000年 | 130篇 |
1999年 | 96篇 |
1998年 | 89篇 |
1997年 | 59篇 |
1996年 | 50篇 |
1995年 | 45篇 |
1994年 | 37篇 |
1993年 | 29篇 |
1992年 | 19篇 |
1991年 | 17篇 |
1990年 | 17篇 |
1989年 | 15篇 |
1988年 | 13篇 |
1987年 | 11篇 |
1986年 | 7篇 |
1985年 | 4篇 |
1984年 | 7篇 |
1981年 | 3篇 |
1980年 | 6篇 |
1979年 | 4篇 |
1978年 | 5篇 |
1977年 | 3篇 |
1976年 | 1篇 |
1974年 | 1篇 |
1955年 | 1篇 |
1936年 | 1篇 |
排序方式: 共有5936条查询结果,搜索用时 15 毫秒
11.
Steen Ryom-Hansen 《Journal of Algebraic Combinatorics》2006,23(1):5-20
We generalize Soergel's tilting algorithm to singular weights and deduce from this the validity of the Lascoux-Leclerc-Thibon
conjecture on the connection between the canonical basis of the basic submodule of the Fock module and the representation
theory of the Hecke-algebras at root of unity.
Supported in part by Programa Reticulados y Ecuaciones and by FONDECYT grant 1051024. 相似文献
12.
J. J. EGOZCUE J. L. DIAZ-BARRERO V. PAWLOWSKY-GLAHN 《数学学报(英文版)》2006,22(4):1175-1182
The set of probability functions is a convex subset of L1 and it does not have a linear space structure when using ordinary sum and multiplication by real constants. Moreover, difficulties arise when dealing with distances between densities. The crucial point is that usual distances are not invariant under relevant transformations of densities. To overcome these limitations, Aitchison's ideas on compositional data analysis are used, generalizing perturbation and power transformation, as well as the Aitchison inner product, to operations on probability density functions with support on a finite interval. With these operations at hand, it is shown that the set of bounded probability density functions on finite intervals is a pre-Hilbert space. A Hilbert space of densities, whose logarithm is square-integrable, is obtained as the natural completion of the pre-Hilbert space. 相似文献
13.
Preconditioners based on various multilevel extensions of two‐level finite element methods (FEM) lead to iterative methods which have an optimal order computational complexity with respect to the size of the system. Such methods were first presented in Axelsson and Padiy (SIAM. J. Sci. Stat. Comp. 1990; 20 :1807) and Axelsson and Vassilevski (Numer. Math. 1989; 56 :157), and are based on (recursive) two‐level splittings of the finite element space. The key role in the derivation of optimal convergence rate estimates is played by the constant γ in the so‐called Cauchy–Bunyakowski–Schwarz (CBS) inequality, associated with the angle between the two subspaces of the splitting. It turns out that only existence of uniform estimates for this constant is not enough but accurate quantitative bounds for γ have to be found as well. More precisely, the value of the upper bound for γ∈(0,1) is part of the construction of various multilevel extensions of the related two‐level methods. In this paper, an algebraic two‐level preconditioning algorithm for second‐order elliptic boundary value problems is constructed, where the discretization is done using Crouzeix–Raviart non‐conforming linear finite elements on triangles. An important point to make is that in this case the finite element spaces corresponding to two successive levels of mesh refinements are not nested. To handle this, a proper two‐level basis is considered, which enables us to fit the general framework for the construction of two‐level preconditioners for conforming finite elements and to generalize the method to the multilevel case. The major contribution of this paper is the derived estimates of the related constant γ in the strengthened CBS inequality. These estimates are uniform with respect to both coefficient and mesh anisotropy. To our knowledge, the results presented in the paper are the first such estimates for non‐conforming FEM systems. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
14.
Yanghyun Byun 《Foundations of Physics》2004,34(6):987-1003
We consider a representation of the state reduction which depends neither on its reality nor on the details of when and how it emerges. Then by means of the representation we find necessary conditions, even if not the sufficient ones, for a decomposition of the state vector space to be a solution to the basis problem. The conditions are that the decomposition should be Lorentz invariant and orthogonal and that the associated projections should be continuous. They are shown to be able to determine a decomposition in each of a few examples considered if the other circumstances are taken into account together. 相似文献
15.
马科维兹资产组合选择模型的旋转算法 总被引:2,自引:0,他引:2
提出线性不等式组的一种旋转算法,并用其求解马科维兹资产组合选择模型,此算法每次迭代约需n^2次乘法和加法,其中n是模型中变量的数目,在微机上运行Delphi程序的实验结果表明,从上海和深圳股市1072支股票70期周末收盘价计算出20个最优投资组合仅需314次迭代和45s。 相似文献
16.
In the present work we consider the problem of interpolating scattered data using radial basis functions (RBF). In general, it is well known that this leads to a discrete linear inverse problem that needs to be regularized in order to provide a meaningful solution. The work focuses on a metric-regularization approach, based on a new class of RBF, called anisotropic RBF. The work provides theoretical justifications for the regularization approach and it considers a suitable proposal for the metric, supporting it by numerical examples. 相似文献
17.
Gerhard Starke 《Numerische Mathematik》1997,78(1):103-117
Summary. The convergence rate of Krylov subspace methods for the solution of nonsymmetric systems of linear equations, such as GMRES
or FOM, is studied. Bounds on the convergence rate are presented which are based on the smallest real part of the field of
values of the coefficient matrix and of its inverse. Estimates for these quantities are available during the iteration from
the underlying Arnoldi process. It is shown how these bounds can be used to study the convergence properties, in particular,
the dependence on the mesh-size and on the size of the skew-symmetric part, for preconditioners for finite element discretizations
of nonsymmetric elliptic boundary value problems. This is illustrated for the hierarchical basis and multilevel preconditioners
which constitute popular preconditioning strategies for such problems.
Received May 3, 1996 相似文献
18.
Paul Howard 《Mathematical Logic Quarterly》2007,53(3):247-254
Two theorems are proved: First that the statement “there exists a field F such that for every vector space over F, every generating set contains a basis” implies the axiom of choice. This generalizes theorems of Halpern, Blass, and Keremedis. Secondly, we prove that the assertion that every vector space over ?2 has a basis implies that every well‐ordered collection of two‐element sets has a choice function. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
19.
O. A. Veliev 《Mathematical Notes》2007,81(3-4):440-448
We obtain asymptotic formulas for non-self-adjoint operators generated by the Sturm-Liouville system and quasiperiodic boundary conditions. Using these asymptotic formulas, we obtain conditions on the potential for which the system of root vectors of the operator under consideration forms a Riesz basis. 相似文献
20.
Roland Opfer 《Advances in Computational Mathematics》2006,25(4):357-380
This paper reconstructs multivariate functions from scattered data by a new multiscale technique. The reconstruction uses
standard methods of interpolation by positive definite reproducing kernels in Hilbert spaces. But it adopts techniques from
wavelet theory and shift-invariant spaces to construct a new class of kernels as multiscale superpositions of shifts and scales
of a single compactly supported function φ. This means that the advantages of scaled regular grids are used to construct the
kernels, while the advantages of unrestricted scattered data interpolation are maintained after the kernels are constructed.
Using such a multiscale kernel, the reconstruction method interpolates at given scattered data. No manipulations of the data
(e.g., thinning or separation into subsets of certain scales) are needed. Then, the multiscale structure of the kernel allows
to represent the interpolant on regular grids on all scales involved, with cheap evaluation due to the compact support of
the function φ, and with a recursive evaluation technique if φ is chosen to be refinable. There also is a wavelet-like data
reduction effect, if a suitable thresholding strategy is applied to the coefficients of the interpolant when represented over
a scaled grid. Various numerical examples are presented, illustrating the multiresolution and data compression effects. 相似文献