全文获取类型
收费全文 | 13357篇 |
免费 | 963篇 |
国内免费 | 1520篇 |
专业分类
化学 | 2832篇 |
晶体学 | 27篇 |
力学 | 730篇 |
综合类 | 145篇 |
数学 | 3592篇 |
物理学 | 1751篇 |
综合类 | 6763篇 |
出版年
2024年 | 44篇 |
2023年 | 130篇 |
2022年 | 204篇 |
2021年 | 231篇 |
2020年 | 257篇 |
2019年 | 301篇 |
2018年 | 288篇 |
2017年 | 315篇 |
2016年 | 347篇 |
2015年 | 353篇 |
2014年 | 584篇 |
2013年 | 735篇 |
2012年 | 688篇 |
2011年 | 723篇 |
2010年 | 642篇 |
2009年 | 807篇 |
2008年 | 912篇 |
2007年 | 1073篇 |
2006年 | 1023篇 |
2005年 | 859篇 |
2004年 | 764篇 |
2003年 | 729篇 |
2002年 | 650篇 |
2001年 | 535篇 |
2000年 | 523篇 |
1999年 | 370篇 |
1998年 | 346篇 |
1997年 | 264篇 |
1996年 | 212篇 |
1995年 | 183篇 |
1994年 | 154篇 |
1993年 | 108篇 |
1992年 | 103篇 |
1991年 | 81篇 |
1990年 | 60篇 |
1989年 | 43篇 |
1988年 | 45篇 |
1987年 | 37篇 |
1986年 | 24篇 |
1985年 | 18篇 |
1984年 | 18篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 7篇 |
1980年 | 9篇 |
1979年 | 9篇 |
1978年 | 7篇 |
1976年 | 5篇 |
1957年 | 2篇 |
1955年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 18 毫秒
981.
《Journal of Graph Theory》2018,89(1):26-39
The Turán number of a graph H, , is the maximum number of edges in any graph of order n that does not contain an H as a subgraph. A graph on vertices consisting of k triangles that intersect in exactly one common vertex is called a k‐fan, and a graph consisting of k cycles that intersect in exactly one common vertex is called a k‐flower. In this article, we determine the Turán number of any k‐flower containing at least one odd cycle and characterize all extremal graphs provided n is sufficiently large. Erdős, Füredi, Gould, and Gunderson determined the Turán number for the k‐fan. Our result is a generalization of their result. The addition aim of this article is to draw attention to a powerful tool, the so‐called progressive induction lemma of Simonovits. 相似文献
982.
In this paper, we introduce and analyze a new singular value decomposition (SVD) called weighted SVD (WSVD) using a new inner product instead of the Euclidean one. We use the WSVD to approximate the singular values and the singular functions of the Fredholm integral operators. In this case, the new inner product arises from the numerical integration used to discretize the operator. Then, the truncated WSVD (TWSVD) is used to regularize the Nyström discretization of the first‐kind Fredholm integral equations. Also, we consider the weighted LSQR (WLSQR) to approximate the solution obtained by the TWSVD method for large problems. Numerical experiments on a few problems are used to illustrate that the TWSVD can perform better than the TSVD. 相似文献
983.
We analyze two‐level overlapping Schwarz domain decomposition methods for vector‐valued piecewise linear finite element discretizations of the PDE system of linear elasticity. The focus of our study lies in the application to compressible, particle‐reinforced composites in 3D with large jumps in their material coefficients. We present coefficient‐explicit bounds for the condition number of the two‐level additive Schwarz preconditioned linear system. Thereby, we do not require that the coefficients are resolved by the coarse mesh. The bounds show a dependence of the condition number on the energy of the coarse basis functions, the coarse mesh, and the overlap parameters, as well as the coefficient variation. Similar estimates have been developed for scalar elliptic PDEs by Graham et al. 1 The coarse spaces to which they apply here are assumed to contain the rigid body modes and can be considered as generalizations of the space of piecewise linear vector‐valued functions on a coarse triangulation. The developed estimates provide a concept for the construction of coarse spaces, which can lead to preconditioners that are robust with respect to high contrasts in Young's modulus and the Poisson ratio of the underlying composite. To confirm the sharpness of the theoretical findings, we present numerical results in 3D using vector‐valued linear, multiscale finite element and energy‐minimizing coarse spaces. The theory is not restricted to the isotropic (Lamé) case, extends to the full‐tensor case, and allows applications to multiphase materials with anisotropic constituents in two and three spatial dimensions. However, the bounds will depend on the ratio of largest to smallest eigenvalue of the elasticity tensor. 相似文献
984.
In this paper, a conservative parallel difference scheme, which is based on domain decomposition method, for 2-dimension diffusion equation is proposed. In the construction of this scheme, we use the numerical solution on the previous time step to give a weighted approximation of the numerical flux. Then the sub-problems with Neumann boundary are computed by fully implicit scheme. What is more, only local message communication is needed in the program. We use the method of discrete functional analysis to give the proof of the unconditional stability and second-order convergence accuracy. Some numerical tests are given to verify the theory results. 相似文献
985.
蒋先江 《宁波大学学报(理工版)》2011,24(1):46-48
若p调和函数u属于W^1,q〉p-1〉0,且满足|p-2|或|p—g|足够小,证明了△↓一定是Holder连续的.这个结果推广了调和函数(p=2)的正则性结论,其证明主要运用了Hodge分解及反Holder不等式. 相似文献
986.
一个图G的路分解是指一路集合使得G的每条边恰好出现在其中一条路上.记Pl长度为l-1的路,如果G能够分解成若干个Pl,则称G存在{Pl}—分解.关于图的给定长路分解问题主要结果有:(i)连通图G存在{P3}—分解当且仅当G有偶数条边(见[1]);(ii)连通图G存在{P3,P4}—分解当且仅当G不是C3和奇树,这里C3的长度为3的圈而奇树是所有顶点皆度数为奇数的树(见[3]).本文讨论了3正则图的{P4}—分解情况,并构造证明了边数为3k(k热∈Z且k≥2)的完全图Kn和完全二部图Kr,s存在{P4}—分解. 相似文献
987.
Given a complex matrix , we consider the decomposition , where is upper triangular and and have orthonormal columns. Special instances of this decomposition include the singular value decomposition (SVD) and the Schur decomposition where is an upper triangular matrix with the eigenvalues of on the diagonal. We show that any diagonal for can be achieved that satisfies Weyl's multiplicative majorization conditions: where is the rank of , is the -th largest singular value of , and is the -th largest (in magnitude) diagonal element of . Given a vector which satisfies Weyl's conditions, we call the decomposition , where is upper triangular with prescribed diagonal , the generalized triangular decomposition (GTD). A direct (nonrecursive) algorithm is developed for computing the GTD. This algorithm starts with the SVD and applies a series of permutations and Givens rotations to obtain the GTD. The numerical stability of the GTD update step is established. The GTD can be used to optimize the power utilization of a communication channel, while taking into account quality of service requirements for subchannels. Another application of the GTD is to inverse eigenvalue problems where the goal is to construct matrices with prescribed eigenvalues and singular values.
988.
Fu Liu 《Transactions of the American Mathematical Society》2008,360(6):3041-3069
There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper is to show that the same formula holds for a more general class of polytopes, lattice-face polytopes. We develop a way of decomposing any -dimensional simplex in general position into signed sets, each of which corresponds to a permutation in the symmetric group and reduce the problem of counting lattice points in a polytope in general position to that of counting lattice points in these special signed sets. Applying this decomposition to a lattice-face simplex, we obtain signed sets with special properties that allow us to count the number of lattice points inside them. We are thus able to conclude the desired formula for the Ehrhart polynomials of lattice-face polytopes.
989.
990.
Egbert Harzheim 《Order》2008,25(2):79-83
We construct a subset of the set R of real numbers of cardinality |R| which has a similarity decomposition, and which has
an ordertype < that of R. Seymour Ginsburg had posed the question whether there exist sets with another ordertype than that
of R which also have a similarity decomposition.
相似文献