全文获取类型
收费全文 | 3557篇 |
免费 | 364篇 |
国内免费 | 208篇 |
专业分类
化学 | 402篇 |
晶体学 | 21篇 |
力学 | 204篇 |
综合类 | 72篇 |
数学 | 2371篇 |
物理学 | 1059篇 |
出版年
2023年 | 49篇 |
2022年 | 76篇 |
2021年 | 63篇 |
2020年 | 94篇 |
2019年 | 114篇 |
2018年 | 118篇 |
2017年 | 131篇 |
2016年 | 122篇 |
2015年 | 62篇 |
2014年 | 151篇 |
2013年 | 358篇 |
2012年 | 134篇 |
2011年 | 197篇 |
2010年 | 153篇 |
2009年 | 241篇 |
2008年 | 239篇 |
2007年 | 203篇 |
2006年 | 202篇 |
2005年 | 179篇 |
2004年 | 155篇 |
2003年 | 133篇 |
2002年 | 135篇 |
2001年 | 105篇 |
2000年 | 106篇 |
1999年 | 89篇 |
1998年 | 80篇 |
1997年 | 72篇 |
1996年 | 54篇 |
1995年 | 42篇 |
1994年 | 31篇 |
1993年 | 37篇 |
1992年 | 27篇 |
1991年 | 19篇 |
1990年 | 17篇 |
1989年 | 12篇 |
1988年 | 12篇 |
1987年 | 19篇 |
1986年 | 12篇 |
1985年 | 12篇 |
1984年 | 13篇 |
1983年 | 4篇 |
1982年 | 8篇 |
1981年 | 8篇 |
1980年 | 8篇 |
1979年 | 8篇 |
1978年 | 8篇 |
1977年 | 6篇 |
1976年 | 4篇 |
1973年 | 2篇 |
1972年 | 2篇 |
排序方式: 共有4129条查询结果,搜索用时 31 毫秒
91.
Affine semigroups are convex sets on which there exists an associative binary operation which is affine separately in either variable. They were introduced by Cohen and Collins in 1959. We look at examples of affine semigroups which are of interest to matrix and operator theory and we prove some new results on the extreme points and the absorbing elements of certain types of affine semigroups. Most notably we improve a result of Wendel that every invertible element in a compact affine semigroup is extreme by extending this result to linearly bounded affine semigroups. 相似文献
92.
93.
The (mixed finite element) discretization of the linearized Navier–Stokes equations leads to a linear system of equations of saddle point type. The iterative solution of this linear system requires the construction of suitable preconditioners, especially in the case of high Reynolds numbers. In the past, a stabilizing approach has been suggested which does not change the exact solution but influences the accuracy of the discrete solution as well as the effectiveness of iterative solvers. This stabilization technique can be performed on the continuous side before the discretization, where it is known as ‘grad‐div’ (GD) stabilization, as well as on the discrete side where it is known as an ‘augmented Lagrangian’ (AL) technique (and does not change the discrete solution). In this paper, we study the applicability of ??‐LU factorizations to solve the arising subproblems in the different variants of stabilized saddle point systems. We consider both the saddle point systems that arise from the stabilization in the continuous as well as on the discrete setting. Recently, a modified AL preconditioner has been proposed for the system resulting from the discrete stabilization. We provide a straightforward generalization of this approach to the GD stabilization. We conclude the paper with numerical tests for a variety of problems to illustrate the behavior of the considered preconditioners as well as the suitability of ??‐LU factorization in the preconditioners. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
94.
95.
We prove an invariant Harnack’s inequality for operators in non-divergence form structured on Heisenberg vector fields when the coe?cient matrix is uniformly positive definite, continuous, and symplectic. The method consists in constructing appropriate barriers to obtain pointwise-to-measure estimates for supersolutions in small balls, and then invoking the axiomatic approach developed by Di Fazio, Gutiérrez, and Lanconelli to obtain Harnack’s inequality. 相似文献
96.
97.
A star edge coloring of a graph is a proper edge coloring such that every connected 2-colored subgraph is a path with at most 3 edges. Deng et al. and Bezegová et al. independently show that the star chromatic index of a tree with maximum degree is at most , which is tight. In this paper, we study the list star edge coloring of -degenerate graphs. Let be the list star chromatic index of : the minimum such that for every -list assignment for the edges, has a star edge coloring from . By introducing a stronger coloring, we show with a very concise proof that the upper bound on the star chromatic index of trees also holds for list star chromatic index of trees, i.e. for any tree with maximum degree . And then by applying some orientation technique we present two upper bounds for list star chromatic index of -degenerate graphs. 相似文献
98.
zcan Bekta 《Mathematical Methods in the Applied Sciences》2019,42(16):5215-5232
The split and hyperbolic (countercomplex) octonions are eight‐dimensional nonassociative algebras over the real numbers, which are in the form , where em's have different properties for them. The main purpose of this paper is to define the split‐type octonion and its matrix whose inputs are split‐type octonions and give some properties for them by using the real quaternions, split, and hyperbolic (countercomplex) octonions. On the other hand, to make some definitions, we present some operations on the split‐type octonions. Also, we show that every split‐type octonions can be represented by 2 × 2 real quaternion matrix and 4 × 4 complex number matrix. The information about the determinants of these matrix representations is also given. Besides, the main features of split‐type octonion matrix concept are given by using properties of real quaternion matrices. Then, 8n × 8nreal matrix representations of split‐type octonion matrices are shown, and some algebraic structures are examined. Additionally, we introduce real quaternion adjoint matrices of split‐type octonion matrices. Moreover, necessary and sufficient conditions and definitions are given for split‐type octonion matrices to be special split‐type octonion matrices. We describe some special split‐type octonion matrices. Finally, oct‐determinant of split‐type octonion matrices is defined. Definitive and understandable examples of all definitions, theorems, and conclusions were given for a better understanding of all these concepts. 相似文献
99.
Douglas R. Woodall 《Journal of Graph Theory》2019,92(4):488-490
In the article “The average degree of an edge-chromatic critical graph II” by Douglas R. Woodall (J. Graph Theory 56 (2007), 194-218), it was claimed that the average degree of an edge-chromatic critical graph with maximum degree is at least if , at least if , and at least if . Unfortunately there were mistakes in the proof of the last two of these results, which are now proved only if and , respectively. 相似文献
100.