全文获取类型
收费全文 | 503篇 |
免费 | 94篇 |
国内免费 | 31篇 |
专业分类
化学 | 29篇 |
力学 | 44篇 |
综合类 | 14篇 |
数学 | 420篇 |
物理学 | 121篇 |
出版年
2024年 | 1篇 |
2023年 | 13篇 |
2022年 | 28篇 |
2021年 | 27篇 |
2020年 | 25篇 |
2019年 | 15篇 |
2018年 | 18篇 |
2017年 | 39篇 |
2016年 | 31篇 |
2015年 | 18篇 |
2014年 | 37篇 |
2013年 | 42篇 |
2012年 | 17篇 |
2011年 | 18篇 |
2010年 | 19篇 |
2009年 | 20篇 |
2008年 | 27篇 |
2007年 | 22篇 |
2006年 | 22篇 |
2005年 | 23篇 |
2004年 | 17篇 |
2003年 | 22篇 |
2002年 | 16篇 |
2001年 | 14篇 |
2000年 | 17篇 |
1999年 | 12篇 |
1998年 | 15篇 |
1997年 | 14篇 |
1996年 | 12篇 |
1995年 | 3篇 |
1994年 | 3篇 |
1993年 | 1篇 |
1992年 | 5篇 |
1991年 | 2篇 |
1989年 | 1篇 |
1988年 | 2篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1981年 | 2篇 |
1979年 | 1篇 |
排序方式: 共有628条查询结果,搜索用时 109 毫秒
1.
本文基于新的Kronecker型替换,给出两个由黑盒表示的稀疏多项式的新确定性插值算法.令f∈R[x1,……,xn]是一个稀疏黑盒多项式,其次数上界为D.当R是C或者是有限域时,相对于已有算法,新算法具有更好的计算复杂度或者关于D的复杂度更低.特别地,对于一般黑盒模型,D是复杂度中的主要因素,而在所有的确定性算法中,本文的第二个算法的复杂度关于D是最低的. 相似文献
2.
Ieva
Dauickait Amos S. Lawless Jennifer A. Scott Peter Jan van Leeuwen 《Numerical Linear Algebra with Applications》2020,27(5)
We consider the large sparse symmetric linear systems of equations that arise in the solution of weak constraint four‐dimensional variational data assimilation, a method of high interest for numerical weather prediction. These systems can be written as saddle point systems with a 3 × 3 block structure but block eliminations can be performed to reduce them to saddle point systems with a 2 × 2 block structure, or further to symmetric positive definite systems. In this article, we analyse how sensitive the spectra of these matrices are to the number of observations of the underlying dynamical system. We also obtain bounds on the eigenvalues of the matrices. Numerical experiments are used to confirm the theoretical analysis and bounds. 相似文献
3.
G. Montero L. Gonzlez E. Flrez M. D. García A. Surez 《Numerical Linear Algebra with Applications》2002,9(3):239-247
Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, minM∈??∥AM?I∥ F and matrix M0∈?? corresponding to this minimum (?? being any vectorial subspace of ??n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
4.
Johan Helsing 《BIT Numerical Mathematics》2006,46(2):307-323
A sparse mesh-neighbour based approximate inverse preconditioner is proposed for a type of dense matrices whose entries come
from the evaluation of a slowly decaying free space Green’s function at randomly placed points in a unit cell. By approximating
distant potential fields originating at closely spaced sources in a certain way, the preconditioner is given properties similar
to, or better than, those of a standard least squares approximate inverse preconditioner while its setup cost is only that
of a diagonal block approximate inverse preconditioner. Numerical experiments on iterative solutions of linear systems with
up to four million unknowns illustrate how the new preconditioner drastically outperforms standard approximate inverse preconditioners
of otherwise similar construction, and especially so when the preconditioners are very sparse.
AMS subject classification (2000) 65F10, 65R20, 65F35, 78A30 相似文献
5.
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. 相似文献
6.
n阶矩阵A称为完全正的,如果A有分解:A=BBT,其中B为元素非负矩阵,B的最小可能列数称为A的分解指数.本文考察低阶双非负矩阵在整数环上的完全正分解及其分解指数. 相似文献
7.
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. 相似文献
8.
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 相似文献
9.
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 相似文献
10.
Sparse approximate inverse (SAI) techniques have recently emerged as a new class of parallel preconditioning techniques for
solving large sparse linear systems on high performance computers. The choice of the sparsity pattern of the SAI matrix is
probably the most important step in constructing an SAI preconditioner. Both dynamic and static sparsity pattern selection
approaches have been proposed by researchers. Through a few numerical experiments, we conduct a comparable study on the properties
and performance of the SAI preconditioners using the different sparsity patterns for solving some sparse linear systems.
This revised version was published online in July 2006 with corrections to the Cover Date. 相似文献