全文获取类型
收费全文 | 2324篇 |
免费 | 327篇 |
国内免费 | 169篇 |
专业分类
化学 | 72篇 |
力学 | 407篇 |
综合类 | 40篇 |
数学 | 1511篇 |
物理学 | 790篇 |
出版年
2024年 | 5篇 |
2023年 | 30篇 |
2022年 | 57篇 |
2021年 | 55篇 |
2020年 | 50篇 |
2019年 | 74篇 |
2018年 | 69篇 |
2017年 | 62篇 |
2016年 | 89篇 |
2015年 | 67篇 |
2014年 | 90篇 |
2013年 | 265篇 |
2012年 | 102篇 |
2011年 | 119篇 |
2010年 | 105篇 |
2009年 | 121篇 |
2008年 | 161篇 |
2007年 | 149篇 |
2006年 | 150篇 |
2005年 | 138篇 |
2004年 | 101篇 |
2003年 | 111篇 |
2002年 | 102篇 |
2001年 | 73篇 |
2000年 | 77篇 |
1999年 | 64篇 |
1998年 | 69篇 |
1997年 | 43篇 |
1996年 | 29篇 |
1995年 | 40篇 |
1994年 | 24篇 |
1993年 | 13篇 |
1992年 | 14篇 |
1991年 | 10篇 |
1990年 | 12篇 |
1989年 | 11篇 |
1988年 | 10篇 |
1987年 | 11篇 |
1986年 | 8篇 |
1985年 | 6篇 |
1984年 | 5篇 |
1983年 | 2篇 |
1982年 | 5篇 |
1981年 | 2篇 |
1980年 | 4篇 |
1978年 | 7篇 |
1976年 | 3篇 |
1973年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有2820条查询结果,搜索用时 7 毫秒
1.
A new grid‐free upwind relaxation scheme for simulating inviscid compressible flows is presented in this paper. The non‐linear conservation equations are converted to linear convection equations with non‐linear source terms by using a relaxation system and its interpretation as a discrete Boltzmann equation. A splitting method is used to separate the convection and relaxation parts. Least squares upwinding is used for discretizing the convection equations, thus developing a grid‐free scheme which can operate on any arbitrary distribution of points. The scheme is grid free in the sense that it works on any arbitrary distribution of points and it does not require any topological information like elements, faces, edges, etc. This method is tested on some standard test cases. To explore the power of the grid‐free scheme, solution‐based adaptation of points is done and the results are presented, which demonstrate the efficiency of the new grid‐free scheme. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
2.
A complete study of the spectrum of a finite-dimensional Bose operator is carried out in the paper. The cases in which the
spectrum is discrete or continuous are studied.
Translated fromMatematicheskie Zametki, Vol. 61, No. 6, pp. 835–854, June, 1997.
Translated by A. M. Chebotarev 相似文献
3.
Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically
by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually
employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be
“close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence
many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report
results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process
can be improved to better reflect the actual properties sought.
In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend
themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms
of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling
approach may possibly lead to algorithms with improved efficiency.
AMS subject classification (2000) 65L05, 65M32, 65N21, 65N22, 65D18 相似文献
4.
WU Ke ZHAO Weizhong & GUO Hanying Department of Mathematics Capital Normal University Beijing China Institute of Theoretical Physics Chinese Academy of Sciences Beijing China 《中国科学A辑(英文版)》2006,(11)
In a way similar to the continuous case formally, we define in different but equivalent manners the difference discrete connection and curvature on discrete vector bundle over the regular lattice as base space. We deal with the difference operators as the discrete counterparts of the derivatives based upon the differential calculus on the lattice. One of the definitions can be extended to the case over the random lattice. We also discuss the relation between our approach and the lattice gauge theory and apply to the discrete integrable systems. 相似文献
5.
In this paper, nonconvex multiobjective optimization problems are studied. New characterizations of a properly efficient solution in the sense of Geoffrion's are established in terms of the stability of one scalar optimization problem and the existence of an exact penalty function of a scalar constrained program, respectively. One of the characterizations is applied to derive necessary conditions for a properly efficient control-parameter pair of a nonconvex multiobjective discrete optimal control problem with linear constraints. 相似文献
6.
M. A. Posypkin I. Kh. Sigal 《Computational Mathematics and Mathematical Physics》2006,46(12):2187-2202
The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered. 相似文献
7.
讨论了尘埃粒子解的时空结构及其性质,导出了尘埃粒子的内空间的离散结构.证明了尘埃粒子内部的物质球是一个无坐标的平直球,因而具有最小的体积和整体的关联性.导出了在尘埃粒子的内外时空中的径向测地线并说明其连续性.阐述了由这个解所揭示的物质、引力与时空之间的内在联系.
关键词:
尘埃粒子
离散时空
测地线 相似文献
8.
森林发展系统的一个非线性半离散模型 总被引:2,自引:2,他引:0
王定江 《数学的实践与认识》2003,33(2):86-90
本文建立了森林发展系统的一类非线性林龄面积结构的半离散模型 ,并讨论了半离散系统解的存在唯一性 ,给出了线性半离散系统稳定的一些充分条件 相似文献
9.
Adrian Vasiu 《Central European Journal of Mathematics》2005,3(1):14-25
We include short and elementary proofs of two theorems that characterize reductive group schemes over a discrete valuation
ring, in a slightly more general context. 相似文献
10.
This work is devoted to near-optimal controls of large-scale discrete-time nonlinear dynamic systems driven by Markov chains; the underlying problem is to minimize an expected cost function. Our main goal is to reduce the complexity of the underlying systems. To achieve this goal, discrete-time control models under singularly-perturbed Markov chains are introduced. Using a relaxed control representation, our effort is devoted to finding near-optimal controls. Lumping the states in each irreducible class into a single state gives rise to a limit system. Applying near-optimal controls of the limit system to the original system, near-optimal controls of the original system are derived. 相似文献