全文获取类型
收费全文 | 830篇 |
免费 | 122篇 |
国内免费 | 25篇 |
专业分类
化学 | 52篇 |
力学 | 255篇 |
综合类 | 15篇 |
数学 | 447篇 |
物理学 | 208篇 |
出版年
2024年 | 1篇 |
2023年 | 12篇 |
2022年 | 31篇 |
2021年 | 30篇 |
2020年 | 28篇 |
2019年 | 20篇 |
2018年 | 23篇 |
2017年 | 44篇 |
2016年 | 36篇 |
2015年 | 33篇 |
2014年 | 50篇 |
2013年 | 63篇 |
2012年 | 41篇 |
2011年 | 48篇 |
2010年 | 49篇 |
2009年 | 38篇 |
2008年 | 34篇 |
2007年 | 43篇 |
2006年 | 45篇 |
2005年 | 32篇 |
2004年 | 36篇 |
2003年 | 28篇 |
2002年 | 30篇 |
2001年 | 26篇 |
2000年 | 25篇 |
1999年 | 20篇 |
1998年 | 24篇 |
1997年 | 13篇 |
1996年 | 21篇 |
1995年 | 13篇 |
1994年 | 7篇 |
1993年 | 2篇 |
1992年 | 10篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1981年 | 2篇 |
1979年 | 1篇 |
排序方式: 共有977条查询结果,搜索用时 625 毫秒
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.
Deborah M. Greaves 《国际流体数值方法杂志》2006,50(6):693-711
An adaptive hierarchical grid‐based method for predicting complex free surface flows is used to simulate collapse of a water column. Adapting quadtree grids are combined with a high‐resolution interface‐capturing approach and pressure‐based coupling of the Navier–Stokes equations. The Navier–Stokes flow solution scheme is verified for simulation of flow in a lid‐driven cavity at Re=1000. Two approaches to the coupling of the Navier–Stokes equations are investigated as are alternative face velocity and hanging node interpolations. Collapse of a water column as well as collapse of a water column and its subsequent interaction with an obstacle are simulated. The calculations are made on uniform and adapting quadtree grids, and the accuracy of the quadtree calculations is shown to be the same as those made on the equivalent uniform grids. Results are in excellent agreement with experimental and other numerical data. A sharp interface is maintained at the free surface. The new adapting quadtree‐based method achieves a considerable saving in the size of the computational grid and CPU time in comparison with calculations made on equivalent uniform grids. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
6.
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. 相似文献
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.
P. W. Hemker 《Advances in Computational Mathematics》1995,4(1):83-110
We introduce a multigrid algorithm for the solution of a second order elliptic equation in three dimensions. For the approximation of the solution we use a partially ordered hierarchy of finite-volume discretisations. We show that there is a relation with semicoarsening and approximation by more-dimensional Haar wavelets. By taking a proper subset of all possible meshes in the hierarchy, a sparse grid finite-volume discretisation can be constructed.The multigrid algorithm consists of a simple damped point-Jacobi relaxation as the smoothing procedure, while the coarse grid correction is made by interpolation from several coarser grid levels.The combination of sparse grids and multigrid with semi-coarsening leads to a relatively small number of degrees of freedom,N, to obtain an accurate approximation, together with anO(N) method for the solution. The algorithm is symmetric with respect to the three coordinate directions and it is fit for combination with adaptive techniques.To analyse the convergence of the multigrid algorithm we develop the necessary Fourier analysis tools. All techniques, designed for 3D-problems, can also be applied for the 2D case, and — for simplicity — we apply the tools to study the convergence behaviour for the anisotropic Poisson equation for this 2D case. 相似文献
9.
A generalized formulation is applied to implement the quadratic upstream interpolation (QUICK) scheme, the second-order upwind (SOU) scheme and the second-order hybrid scheme (SHYBRID) on non-uniform grids. The implementation method is simple. The accuracy and efficiency of these higher-order schemes on non-uniform grids are assessed. Three well-known bench mark convection-diffusion problems and a fluid flow problem are revisited using non-uniform grids. These are: (1) transport of a scalar tracer by a uniform velocity field; (2) heat transport in a recirculating flow; (3) two-dimensional non-linear Burgers equations; and (4) a two-dimensional incompressible Navier-Stokes flow which is similar to the classical lid-driven cavity flow. The known exact solutions of the last three problems make it possible to thoroughly evaluate accuracies of various uniform and non-uniform grids. Higher accuracy is obtained for fewer grid points on non-uniform grids. The order of accuracy of the examined schemes is maintained for some tested problems if the distribution of non-uniform grid points is properly chosen. 相似文献
10.
Markus Hegland Jochen Garcke Vivien Challis 《Linear algebra and its applications》2007,420(2-3):249-275
The combination technique has repeatedly been shown to be an effective tool for the approximation with sparse grid spaces. Little is known about the reasons of this effectiveness and in some cases the combination technique can even break down. It is known, however, that the combination technique produces an exact result in the case of a projection into a sparse grid space if the involved partial projections commute.
The performance of the combination technique is analysed using a projection framework and the C/S decomposition. Error bounds are given in terms of angles between the spanning subspaces or the projections onto these subspaces. Based on this analysis modified combination coefficients are derived which are optimal in a certain sense and which can substantially extend the applicability and performance of the combination technique. 相似文献