全文获取类型
收费全文 | 4274篇 |
免费 | 416篇 |
国内免费 | 312篇 |
专业分类
化学 | 72篇 |
力学 | 406篇 |
综合类 | 40篇 |
数学 | 1508篇 |
物理学 | 790篇 |
综合类 | 2186篇 |
出版年
2024年 | 15篇 |
2023年 | 50篇 |
2022年 | 78篇 |
2021年 | 83篇 |
2020年 | 86篇 |
2019年 | 104篇 |
2018年 | 92篇 |
2017年 | 102篇 |
2016年 | 129篇 |
2015年 | 134篇 |
2014年 | 182篇 |
2013年 | 329篇 |
2012年 | 217篇 |
2011年 | 226篇 |
2010年 | 182篇 |
2009年 | 216篇 |
2008年 | 276篇 |
2007年 | 301篇 |
2006年 | 272篇 |
2005年 | 250篇 |
2004年 | 200篇 |
2003年 | 190篇 |
2002年 | 174篇 |
2001年 | 146篇 |
2000年 | 150篇 |
1999年 | 127篇 |
1998年 | 122篇 |
1997年 | 86篇 |
1996年 | 68篇 |
1995年 | 78篇 |
1994年 | 56篇 |
1993年 | 33篇 |
1992年 | 46篇 |
1991年 | 34篇 |
1990年 | 35篇 |
1989年 | 34篇 |
1988年 | 22篇 |
1987年 | 18篇 |
1986年 | 14篇 |
1985年 | 11篇 |
1984年 | 5篇 |
1983年 | 2篇 |
1982年 | 5篇 |
1981年 | 2篇 |
1980年 | 4篇 |
1978年 | 7篇 |
1976年 | 3篇 |
1973年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有5002条查询结果,搜索用时 31 毫秒
1.
In this paper, we investigate the evolution of joint invariants under invariant geometric flows using the theory of equivariant moving frames and the induced invariant discrete variational complex. For certain arc length preserving planar curve flows invariant under the special Euclidean group , the special linear group , and the semidirect group , we find that the induced evolution of the discrete curvature satisfies the differential‐difference mKdV, KdV, and Burgers' equations, respectively. These three equations are completely integrable, and we show that a recursion operator can be constructed by precomposing the characteristic operator of the curvature by a certain invariant difference operator. Finally, we derive the constraint for the integrability of the discrete curvature evolution to lift to the evolution of the discrete curve itself. 相似文献
2.
R. S. Martynov Yu. M. Nechepurenko 《Computational Mathematics and Mathematical Physics》2006,46(7):1155-1167
For a discrete linear stochastic dynamical system, computation of the response matrix to the external action from a subspace using given observational data is examined. An algorithm is proposed and substantiated that makes it possible to improve the numerical accuracy and to reduce the amount of observational data compared to the general case where an arbitrary external action is allowed. As an illustration, a discrete system arising in the analysis of a linear stochastic dynamical continuous-time system is considered more thoroughly. Some numerical results are presented. 相似文献
3.
Teresa Regińska 《BIT Numerical Mathematics》2004,44(1):119-133
The paper concerns conditioning aspects of finite-dimensional problems arising when the Tikhonov regularization is applied
to discrete ill-posed problems. A relation between the regularization parameter and the sensitivity of the regularized solution
is investigated. The main conclusion is that the condition number can be decreased only to the square root of that for the
nonregularized problem. The convergence of solutions of regularized discrete problems to the exact generalized solution is
analyzed just in the case when the regularization corresponds to the minimal condition number. The convergence theorem is
proved under the assumption of the suitable relation between the discretization level and the data error. As an example the
method of truncated singular value decomposition with regularization is considered.
This revised version was published online in July 2006 with corrections to the Cover Date. 相似文献
4.
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. 相似文献
5.
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 相似文献
6.
WANG Yuzhu LIAO Xiaofeng 《武汉大学学报:自然科学英文版》2006,11(6):1715-1717
0 IntroductionNowthere are many well known cryptosystems based ondiscrete logarithms , such as the ElGamal cryptosys-tem[1]and the digital signature algorithm(DSA)[2]. Discretelogarithms have many advantages . Breaking the discrete log-arithm modulo pri mepappears to be somewhat harder thanfactoringintegern,and elliptic curve cryptosystems may usemuchsmaller keysizesthan RSA-basedcryptosystems of com-parable security.The discrete logarithmproblemover a group can be bro-ken down into a numb… 相似文献
7.
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 相似文献
8.
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. 相似文献
9.
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. 相似文献
10.
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. 相似文献