全文获取类型
收费全文 | 1217篇 |
免费 | 135篇 |
国内免费 | 55篇 |
专业分类
化学 | 108篇 |
晶体学 | 2篇 |
力学 | 490篇 |
综合类 | 31篇 |
数学 | 449篇 |
物理学 | 327篇 |
出版年
2024年 | 1篇 |
2023年 | 10篇 |
2022年 | 19篇 |
2021年 | 25篇 |
2020年 | 24篇 |
2019年 | 26篇 |
2018年 | 28篇 |
2017年 | 51篇 |
2016年 | 42篇 |
2015年 | 28篇 |
2014年 | 54篇 |
2013年 | 86篇 |
2012年 | 60篇 |
2011年 | 90篇 |
2010年 | 45篇 |
2009年 | 71篇 |
2008年 | 62篇 |
2007年 | 67篇 |
2006年 | 83篇 |
2005年 | 65篇 |
2004年 | 72篇 |
2003年 | 59篇 |
2002年 | 50篇 |
2001年 | 41篇 |
2000年 | 43篇 |
1999年 | 43篇 |
1998年 | 42篇 |
1997年 | 23篇 |
1996年 | 19篇 |
1995年 | 12篇 |
1994年 | 15篇 |
1993年 | 11篇 |
1992年 | 6篇 |
1991年 | 15篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1986年 | 3篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1982年 | 1篇 |
1975年 | 2篇 |
排序方式: 共有1407条查询结果,搜索用时 15 毫秒
81.
This paper deals with the direct identification of the in-plane elastic properties of orthotropic composite plates from heterogeneous strain fields. The shape of the tested specimen is that of a T subjected to a complex stress state. As a result, the entire set of unknown parameters is directly involved in the strain and displacement responses of the sample. No exact analytical solution is available for such a geometry, and a specific strategy is used to identify the different stiffness components from the whole-field displacements measured over the tested specimen with a suitable optical method. The paper focuses mainly on the experimental aspects of the procedure, and an example of mechanical characterization of a fabric-reinforced composite plate is given. 相似文献
82.
This paper reports on a numerical algorithm for the steady flow of viscoelastic fluid. The conservative and constitutive equations are solved using the finite volume method (FVM) with a hybrid scheme for the velocities and first‐order upwind approximation for the viscoelastic stress. A non‐uniform staggered grid system is used. The iterative SIMPLE algorithm is employed to relax the coupled momentum and continuity equations. The non‐linear algebraic equations over the flow domain are solved iteratively by the symmetrical coupled Gauss–Seidel (SCGS) method. In both, the full approximation storage (FAS) multigrid algorithm is used. An Oldroyd‐B fluid model was selected for the calculation. Results are reported for planar 4:1 abrupt contraction at various Weissenberg numbers. The solutions are found to be stable and smooth. The solutions show that at high Weissenberg number the domain must be long enough. The convergence of the method has been verified with grid refinement. All the calculations have been performed on a PC equipped with a Pentium III processor at 550 MHz. Copyright © 2001 John Wiley & Sons, Ltd. 相似文献
83.
We consider the application of a four‐dimensional variational data assimilation method to a numerical model, which employs local mesh refinement to improve its solution. We focus on structured meshes where a high‐resolution grid is embedded in a coarser resolution one, which covers the entire domain. The formulation of the nested variational data assimilation algorithm was derived in a preliminary work (Int. J. Numer. Meth. Fluids 2008; under review). We are interested here in complementary theoretical aspects. We present first a model for the multi‐grid background error covariance matrix. Then, we propose a variant of our algorithms based on the addition of control variables in the inter‐grid transfers in order to allow for a reduction of the errors linked to the interactions between the grids. These formulations are illustrated and discussed in the test case experiment of a 2D shallow water model. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
84.
In this article, the depth‐averaged transport equations are written in a new way so that it is possible to solve the transport equations for very small water depths. Variables are interpolated into the cell face with two different schemes and, the schemes are compared in terms of computational cost and accuracy. The bed source terms are computed using two different assumptions. The effect of these assumptions on numerical simulations is then investigated. Solutions of transport equations on different types of unstructured triangular grids are compared and, an appropriate choice of grid is suggested. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
85.
A robust aspect ratio‐based agglomeration algorithm to generate high quality of coarse grids for unstructured and hybrid grids is proposed in this paper. The algorithm focuses on multigrid techniques for the numerical solution of Euler and Navier–Stokes equations, which conform to cell‐centered finite volume special discretization scheme, combines vertex‐based isotropic agglomeration and cell‐based directional agglomeration to yield large increases in convergence rates. Aspect ratio is used as fusing weight to capture the degree of cell convexity and give an indication of cell stretching. Agglomeration front queue is established to propagate inward from the boundaries, which stores isotropic vertex and also high‐stretched cell marked with different flag according to aspect ratio. We conduct the present method to solve Euler and Navier–Stokes equations on unstructured and hybrid grids and compare the results with single grid as well as MGridGen, which shows that the present method is efficient in reducing computational time for large‐scale system equations. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
86.
A. Pascau 《国际流体数值方法杂志》2011,65(7):812-833
The use of a colocated variable arrangement for the numerical solution of fluid flow is becoming more and more popular due to its coding simplicity. The inherent decoupling of the pressure and velocity fields in this arrangement can be handled via a special interpolation procedure for the calculation of the cell face velocity named pressure‐weighted interpolation method (PWIM) (AIAA J. 1983; 21 (11):1525–1532). In this paper a discussion on the alternatives to extend PWIM to unsteady flows is presented along with a very simple criterion to ascertain if a given interpolation practice will produce steady results that are relaxation dependent or time step dependent. Following this criterion it will be shown that some prior schemes presented as time step independent are actually not, although by using special interpolations can be readily adapted to be. A systematic way of deriving different cell face velocity expressions will be presented and new formulae free of Δt dependence will be derived. Several computational exercises will accompany the theoretical discussion to support our claims. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
87.
Binary 3-point scheme, developed by Hormann and Sabin [Hormann, K. and Sabin, Malcolm A., 2008, A family of subdivision schemes with cubic precision, Computer Aided Geometric Design, 25, 41-52], has been modified by introducing a tension parameter which generates a family of C1 limiting curves for certain range of tension parameter. Ternary 3-point scheme, introduced by Siddiqi and Rehan [Siddiqi, Shahid S. and Rehan, K., 2009, A ternary three point scheme for curve designing, International Journal of Computer Mathematics, In Press, DOI: 10.1080/00207160802428220], has also been modified by introducing a tension parameter which generates family of C1 and C2 limiting curves for certain range of tension parameter. Laurent polynomial method is used to investigate the continuity of the subdivision schemes. The performance of modified schemes has been demonstrated by considering different examples along with its comparison with the established subdivision schemes. 相似文献
88.
The proposed all-optical 2-D switching networks are (i) M×N-gon prism switches (M2, N3) and (ii) 3-D grids of any geometry N3. For the routing we assume (1) the projection of the spatial architectures onto plane graphs (2) the embedding of the latter guest graphs into (in)complete host hypercubes (N=4) and generally, into N-cube networks (N3) and (3) routing by means of the cube algorithms of the host. By the embedding mainly faulty cubes (synonyms: injured cubes, incomplete cubes) arise which complicate the routing and analysis. The application of N-cube networks (i) extend the hypercube principles to any N3 (ii) increase the number of plane host graphs and (iii) reduce the incompleteness of the host cubes. Several different embeddings of the intersection graphs (IGs) of 2-D switching networks and several different routings are explained for N=4 and 6 by various examples. By the expansion of the grids (enlargement) internal waveguides (WGs) and internal switches are introduced which interact with the switches of the original 3-D grid without increasing the number of stages (NS). The embeddings by expansion apply to interconnection networks whereas dilation-2 embeddings (dilation ≡ distance of the nearest-neighbour nodes of the guest graph at the host) are rather suitable for the emulation of algorithms. Concepts for fault-tolerant routing and algorithm mapping are briefly explained. 相似文献
89.
四阶奇异摄动边值问题在自适应网格上的一致收敛分析 总被引:1,自引:0,他引:1
we study a difference scheme for the fourth-order singular pertur-bation differential equation on the Bakhvalov-Shishkin grid by Green‘‘s function.The method is shown to be uniformly convergent with respect to the perturbation parameter,of order N^-2 in the maxmum norm on Bakhvalov-Shishkin meshes.Numerical results support our theoretical results. 相似文献
90.
In our previous work, we have given an algorithm for segmenting a simplex in the n-dimensional space into rt n+ 1 polyhedrons and provided map F which maps the n-dimensional unit cube to these polyhedrons. In this paper, we prove that the map F is a one to one correspondence at least in lower dimensional spaces (n _〈 3). Moreover, we propose the approximating subdivision and the interpolatory subdivision schemes and the estimation of computational complexity for triangular Bézier patches on a 2-dimensional space. Finally, we compare our schemes with Goldman's in computational complexity and speed. 相似文献