全文获取类型
收费全文 | 1838篇 |
免费 | 294篇 |
国内免费 | 117篇 |
专业分类
化学 | 526篇 |
晶体学 | 7篇 |
力学 | 209篇 |
综合类 | 43篇 |
数学 | 861篇 |
物理学 | 603篇 |
出版年
2024年 | 6篇 |
2023年 | 28篇 |
2022年 | 80篇 |
2021年 | 102篇 |
2020年 | 87篇 |
2019年 | 68篇 |
2018年 | 65篇 |
2017年 | 98篇 |
2016年 | 96篇 |
2015年 | 59篇 |
2014年 | 119篇 |
2013年 | 151篇 |
2012年 | 96篇 |
2011年 | 91篇 |
2010年 | 76篇 |
2009年 | 91篇 |
2008年 | 112篇 |
2007年 | 99篇 |
2006年 | 77篇 |
2005年 | 71篇 |
2004年 | 65篇 |
2003年 | 68篇 |
2002年 | 51篇 |
2001年 | 55篇 |
2000年 | 57篇 |
1999年 | 47篇 |
1998年 | 40篇 |
1997年 | 38篇 |
1996年 | 29篇 |
1995年 | 21篇 |
1994年 | 18篇 |
1993年 | 5篇 |
1992年 | 14篇 |
1991年 | 7篇 |
1990年 | 7篇 |
1989年 | 7篇 |
1988年 | 8篇 |
1987年 | 3篇 |
1986年 | 5篇 |
1985年 | 8篇 |
1984年 | 6篇 |
1983年 | 2篇 |
1982年 | 6篇 |
1981年 | 6篇 |
1980年 | 1篇 |
1979年 | 3篇 |
排序方式: 共有2249条查询结果,搜索用时 15 毫秒
1.
In this paper we consider a wavelet algorithm for the piecewise constant collocation method applied to the boundary element solution of a first kind integral equation arising in acoustic scattering. The conventional stiffness matrix is transformed into the corresponding matrix with respect to wavelet bases, and it is approximated by a compressed matrix. Finally, the stiffness matrix is multiplied by diagonal preconditioners such that the resulting matrix of the system of linear equations is well conditioned and sparse. Using this matrix, the boundary integral equation can be solved effectively. 相似文献
2.
We obtain a lower bound on the number of prime divisors of integers whose g-ary expansion contains a fixed number of nonzero digits.
This revised version was published online in August 2006 with corrections to the Cover Date. 相似文献
3.
This paper considers a new approach to a priori sparsification of the sparsity pattern of the factorized approximate inverses (FSAI) preconditioner using the so‐called vector aggregation technique. The suggested approach consists in construction of the FSAI preconditioner to the aggregated matrix with a prescribed sparsity pattern. Then small entries of the computed ‘aggregated’ FSAI preconditioning matrix are dropped, and the resulting pointwise sparsity pattern is used to construct the low‐density block sparsity pattern of the FSAI preconditioning matrix to the original matrix. This approach allows to minimize (sometimes significantly) the construction costs of low‐density high‐quality FSAI preconditioners. Numerical results with sample matrices from structural mechanics and thin shell problems are presented. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
4.
Bernard Bialecki 《Numerical Algorithms》1994,8(2):167-184
Cyclic reduction and Fourier analysis-cyclic reduction (FACR) methods are presented for the solution of the linear systems which arise when orthogonal spline collocation with piecewise Hermite bicubics is applied to boundary value problems for certain separable partial differential equations on a rectangle. On anN×N uniform partition, the cyclic reduction and Fourier analysis-cyclic reduction methods requireO(N
2log2
N) andO(N
2log2log2
N) arithmetic operations, respectively. 相似文献
5.
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 相似文献
6.
Lingsheng Shi 《Journal of Graph Theory》2005,50(3):175-185
The Ramsey number R(G1,G2) of two graphs G1 and G2 is the least integer p so that either a graph G of order p contains a copy of G1 or its complement Gc contains a copy of G2. In 1973, Burr and Erd?s offered a total of $25 for settling the conjecture that there is a constant c = c(d) so that R(G,G)≤ c|V(G)| for all d‐degenerate graphs G, i.e., the Ramsey numbers grow linearly for d‐degenerate graphs. We show in this paper that the Ramsey numbers grow linearly for degenerate graphs versus some sparser graphs, arrangeable graphs, and crowns for example. This implies that the Ramsey numbers grow linearly for degenerate graphs versus graphs with bounded maximum degree, planar graphs, or graphs without containing any topological minor of a fixed clique, etc. © 2005 Wiley Periodicals, Inc. J Graph Theory 相似文献
7.
In this paper, we present a new algorithm to estimate a regression function in a fixed design regression model, by piecewise
(standard and trigonometric) polynomials computed with an automatic choice of the knots of the subdivision and of the degrees
of the polynomials on each sub-interval. First we give the theoretical background underlying the method: the theoretical performances
of our penalized least-squares estimator are based on non-asymptotic evaluations of a mean-square type risk. Then we explain
how the algorithm is built and possibly accelerated (to face the case when the number of observations is great), how the penalty
term is chosen and why it contains some constants requiring an empirical calibration. Lastly, a comparison with some well-known
or recent wavelet methods is made: this brings out that our algorithm behaves in a very competitive way in term of denoising
and of compression. 相似文献
8.
Yuichiro Fujiwara 《组合设计杂志》2006,14(3):237-250
In this paper, we present three constructions for anti‐mitre Steiner triple systems and a construction for 5‐sparse ones. The first construction for anti‐mitre STSs settles two of the four unsettled admissible residue classes modulo 18 and the second construction covers such a class modulo 36. The third construction generates many infinite classes of anti‐mitre STSs in the remaining possible orders. As a consequence of these three constructions we can construct anti‐mitre systems for at least 13/14 of the admissible orders. For 5‐sparse STS(υ), we give a construction for υ ≡ 1, 19 (mod 54) and υ ≠ 109. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 237–250, 2006 相似文献
9.
P. S. Szczepaniak 《Journal of Optimization Theory and Applications》1989,63(3):459-468
This paper deals with dynamic systems described by nonlinear differential-difference equations of retarded type. The problem considered is to determine the initial function and certain system parameters which minimize a given cost functional. A computational method is presented and some convergence results are given. Numerical examples of linear and nonlinear systems are also included. 相似文献
10.
应用全倒易空间X 射线散射理论分析(FRS XRSA)与SAXS研究了HEPP在应变(ε)与回复(R)过程中结晶、取向与超结构的变化.结果指出,ε可以诱发结晶,但当ε≥30%后,结晶度(XWC)趋于不变:ε可以导致晶粒破碎;ε与R对取向分布与平均取向基本上无影响,这符合片晶平行分离模型,而非叶簧弯曲模型;发现,在ε≤30%时,层状片晶的分离为主要过程,而当ε>30%后,则分离的片晶会发生断层滑移;ε可以诱发微孔,类似地当ε>20%,微孔尺寸亦趋不变.从凝聚态结构阐明了HEPP在ε R过程中不同阶段的结构变化 相似文献