全文获取类型
收费全文 | 3866篇 |
免费 | 188篇 |
国内免费 | 304篇 |
专业分类
化学 | 1332篇 |
晶体学 | 3篇 |
力学 | 86篇 |
综合类 | 84篇 |
数学 | 2078篇 |
物理学 | 775篇 |
出版年
2024年 | 3篇 |
2023年 | 45篇 |
2022年 | 64篇 |
2021年 | 54篇 |
2020年 | 77篇 |
2019年 | 101篇 |
2018年 | 92篇 |
2017年 | 110篇 |
2016年 | 131篇 |
2015年 | 81篇 |
2014年 | 147篇 |
2013年 | 333篇 |
2012年 | 155篇 |
2011年 | 202篇 |
2010年 | 157篇 |
2009年 | 236篇 |
2008年 | 225篇 |
2007年 | 227篇 |
2006年 | 225篇 |
2005年 | 180篇 |
2004年 | 180篇 |
2003年 | 147篇 |
2002年 | 148篇 |
2001年 | 121篇 |
2000年 | 135篇 |
1999年 | 103篇 |
1998年 | 99篇 |
1997年 | 96篇 |
1996年 | 78篇 |
1995年 | 58篇 |
1994年 | 42篇 |
1993年 | 42篇 |
1992年 | 30篇 |
1991年 | 22篇 |
1990年 | 21篇 |
1989年 | 20篇 |
1988年 | 14篇 |
1987年 | 19篇 |
1986年 | 16篇 |
1985年 | 14篇 |
1984年 | 20篇 |
1983年 | 5篇 |
1982年 | 11篇 |
1981年 | 12篇 |
1980年 | 11篇 |
1979年 | 19篇 |
1978年 | 13篇 |
1977年 | 6篇 |
1976年 | 4篇 |
1974年 | 3篇 |
排序方式: 共有4358条查询结果,搜索用时 15 毫秒
21.
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 相似文献
22.
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. 相似文献
23.
环上矩阵的广义Moore-Penrose逆 总被引:14,自引:0,他引:14
本文给出带有对合的有1的结合环上一类矩阵的广义Moore-Penrose逆存在的充要条件,而这类矩阵概括了左右主理想整环,单Artin环上所有矩阵。 相似文献
24.
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. 相似文献
25.
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 相似文献
26.
Sajid Husain Ponnapalli Nageswara Sarma Sankarayya Swamy 《Journal of separation science》1995,18(7):422-424
A capillary GC method employing an internal standard has been developed and successfully used for quantitative determination both of the raw materials used for the manufacture of m-phenoxybenzaldehyde and for the components of the reaction mixtures obtained at various stages of the development of the process. A complete analysis can be performed in a single temperature programmed run. 相似文献
27.
28.
29.
30.
A q × n array with entries from 0, 1,…,q − 1 is said to form a difference matrix if the vector difference (modulo q) of each pair of columns consists of a permutation of [0, 1,… q − 1]; this definition is inverted from the more standard one to be found, e.g., in Colbourn and de Launey (1996). The following idea generalizes this notion: Given an appropriate δ (-[−1, 1]t, a λq × n array will be said to form a (t, q, λ, Δ) sign-balanced matrix if for each choice C1, C2,…, Ct of t columns and for each choice = (1,…,t) Δ of signs, the linear combination ∑j=1t jCj contains (mod q) each entry of [0, 1,…, q − 1] exactly λ times. We consider the following extremal problem in this paper: How large does the number k = k(n, t, q, λ, δ) of rows have to be so that for each choice of t columns and for each choice (1, …, t) of signs in δ, the linear combination ∑j=1t jCj contains each entry of [0, 1,…, q t- 1] at least λ times? We use probabilistic methods, in particular the Lovász local lemma and the Stein-Chen method of Poisson approximation to obtain general (logarithmic) upper bounds on the numbers k(n, t, q, λ, δ), and to provide Poisson approximations for the probability distribution of the number W of deficient sets of t columns, given a random array. It is proved, in addition, that arithmetic modulo q yields the smallest array - in a sense to be described. 相似文献