首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2353篇
  免费   80篇
  国内免费   128篇
化学   370篇
晶体学   2篇
力学   30篇
综合类   29篇
数学   1859篇
物理学   271篇
  2023年   30篇
  2022年   24篇
  2021年   24篇
  2020年   51篇
  2019年   75篇
  2018年   66篇
  2017年   62篇
  2016年   69篇
  2015年   26篇
  2014年   83篇
  2013年   258篇
  2012年   65篇
  2011年   114篇
  2010年   82篇
  2009年   153篇
  2008年   144篇
  2007年   131篇
  2006年   139篇
  2005年   108篇
  2004年   91篇
  2003年   77篇
  2002年   82篇
  2001年   61篇
  2000年   79篇
  1999年   58篇
  1998年   57篇
  1997年   53篇
  1996年   41篇
  1995年   30篇
  1994年   25篇
  1993年   28篇
  1992年   21篇
  1991年   10篇
  1990年   13篇
  1989年   9篇
  1988年   11篇
  1987年   15篇
  1986年   11篇
  1985年   13篇
  1984年   11篇
  1983年   4篇
  1982年   8篇
  1981年   9篇
  1980年   8篇
  1979年   6篇
  1978年   8篇
  1977年   7篇
  1976年   3篇
  1973年   2篇
  1972年   2篇
排序方式: 共有2561条查询结果,搜索用时 15 毫秒
61.
Differential equations of different types and orders are of utmost importance for mathematical modeling of control system problems. State variable method uses the concept of expressing n number of first order differential equations in vector matrix form to model and analyze/synthesize control systems.The present work proposes a new set of orthogonal hybrid functions (HF) which evolved from synthesis of sample-and-hold functions (SHF) and triangular functions (TF). This HF set is used to approximate a time function in a piecewise linear manner with the mean integral square error (MISE) much less than block pulse function based approximation which always provides staircase solutions.The operational matrices for integration and differentiation in HF domain are also derived and employed for solving non-homogeneous and homogeneous differential equations of the first order as well as state equations. The results are compared with exact solutions, the 4th order Runge-Kutta method and its further improved versions proposed by Simos [6]. The presented HF domain theory is well supported by a few illustrations.  相似文献   
62.
The main purpose of this paper is to determine two new algorithmsfor the division of the polynomial matrix B(s) R[s]pxq by A(s) R[s]pxp (a) based on the Laurent matrix expansion at s = =of the inverse of A(s), i.e. A(s)–1, and (b) in a waysimilar to the one presented by Gantmacher (1959).  相似文献   
63.
We discovered a simple quadratic equation, which relates scattering phases of particles on Fermi surface. We consider one-dimensional Bose gas and XXZ Heisenberg quantum spin chain. Received: 4 December 1997 / Accepted: 17 March 1998  相似文献   
64.
65.
Sufficient conditions are given for the Q-superlinear convergence of the iterates produced by primal-dual interior-point methods for linear complementarity problems. It is shown that those conditions are satisfied by several well known interior-point methods. In particular it is shown that the iteration sequences produced by the simplified predictor–corrector method of Gonzaga and Tapia, the simplified largest step method of Gonzaga and Bonnans, the LPF+ algorithm of Wright, the higher order methods of Wright and Zhang, Potra and Sheng, and Stoer, Wechs and Mizuno are Q-superlinearly convergent. Received: February 9, 2000 / Accepted: February 20, 2001?Published online May 3, 2001  相似文献   
66.
We obtain a few structural theorems for circulant weighing matrices whose weight is the square of a prime number. Our results provide new schemes to search for these objects. We also establish the existence status of several previously open cases of circulant weighing matrices. More specifically we show their nonexistence for the parameter pairs (n, k) (here n is the order of the matrix and k its weight) = (147, 49), (125, 25), (200, 25), (55, 25), (95, 25), (133, 49), (195, 25), (11 w, 121) for w < 62.  相似文献   
67.
In this paper, we are mainly concerned with 2 types of constrained matrix equation problems of the form AXB=C, the least squares problem and the optimal approximation problem, and we consider several constraint matrices, such as general Toeplitz matrices, upper triangular Toeplitz matrices, lower triangular Toeplitz matrices, symmetric Toeplitz matrices, and Hankel matrices. In the first problem, owing to the special structure of the constraint matrix , we construct special algorithms; necessary and sufficient conditions are obtained about the existence and uniqueness for the solutions. In the second problem, we use von Neumann alternating projection algorithm to obtain the solutions of problem. Then we give 2 numerical examples to demonstrate the effectiveness of the algorithms.  相似文献   
68.
This paper presents results of research related to multicriteria decision making under information uncertainty. The Bellman–Zadeh approach to decision making in a fuzzy environment is utilized for analyzing multicriteria optimization models (X,M models) under deterministic information. Its application conforms to the principle of guaranteed result and provides constructive lines in obtaining harmonious solutions on the basis of analyzing associated maxmin problems. This circumstance permits one to generalize the classic approach to considering the uncertainty of quantitative information (based on constructing and analyzing payoff matrices reflecting effects which can be obtained for different combinations of solution alternatives and the so-called states of nature) in monocriteria decision making to multicriteria problems. Considering that the uncertainty of information can produce considerable decision uncertainty regions, the resolving capacity of this generalization does not always permit one to obtain unique solutions. Taking this into account, a proposed general scheme of multicriteria decision making under information uncertainty also includes the construction and analysis of the so-called X,R models (which contain fuzzy preference relations as criteria of optimality) as a means for the subsequent contraction of the decision uncertainty regions. The paper results are of a universal character and are illustrated by a simple example.  相似文献   
69.
The structure of polynomial matrices in connection with their reducibility by semiscalar-equivalent transformations and similarity transformations to simpler forms is considered. In particular, the canonical form of polynomial matrices without multiple characteristic roots with respect to the above transformations is indicated. This allows one to establish a canonical form with respect to similarity for a certain type of finite collections of numerical matrices. Translated fromMatematicheskie Zametki, Vol. 64, No. 5, pp. 769–782, November, 1998.  相似文献   
70.
In this article, we establish a bijection between the set of mutation classes of mutation-cyclic skew-symmetric integral 3 × 3-matrices and the set of triples of integers (a, b, c) such that 2 ≤ a ≤ b ≤ c and ab ≥ c. We also give an algorithm allowing to verify whether a matrix is mutation-cyclic or not. We prove that given a, b, the two cases depend on whether c is large enough or not.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号