全文获取类型
收费全文 | 2025篇 |
免费 | 161篇 |
国内免费 | 110篇 |
专业分类
化学 | 52篇 |
力学 | 247篇 |
综合类 | 29篇 |
数学 | 1671篇 |
物理学 | 297篇 |
出版年
2024年 | 2篇 |
2023年 | 18篇 |
2022年 | 25篇 |
2021年 | 26篇 |
2020年 | 39篇 |
2019年 | 43篇 |
2018年 | 63篇 |
2017年 | 44篇 |
2016年 | 58篇 |
2015年 | 46篇 |
2014年 | 97篇 |
2013年 | 142篇 |
2012年 | 100篇 |
2011年 | 109篇 |
2010年 | 106篇 |
2009年 | 130篇 |
2008年 | 142篇 |
2007年 | 129篇 |
2006年 | 105篇 |
2005年 | 80篇 |
2004年 | 84篇 |
2003年 | 71篇 |
2002年 | 92篇 |
2001年 | 78篇 |
2000年 | 70篇 |
1999年 | 60篇 |
1998年 | 56篇 |
1997年 | 53篇 |
1996年 | 31篇 |
1995年 | 25篇 |
1994年 | 20篇 |
1993年 | 28篇 |
1992年 | 23篇 |
1991年 | 17篇 |
1990年 | 17篇 |
1989年 | 8篇 |
1988年 | 11篇 |
1987年 | 5篇 |
1986年 | 3篇 |
1985年 | 6篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 3篇 |
1979年 | 3篇 |
1977年 | 5篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1971年 | 1篇 |
排序方式: 共有2296条查询结果,搜索用时 15 毫秒
1.
Let χ be an order c multiplicative character of a finite field and a binomial with . We study the twisted classical and T-adic Newton polygons of f. When , we give a lower bound of Newton polygons and show that they coincide if p does not divide a certain integral constant depending on .We conjecture that this condition holds if p is large enough with respect to by combining all known results and the conjecture given by Zhang-Niu. As an example, we show that it holds for . 相似文献
2.
3.
Alessandro Morando Paola Trebeschi Tao Wang 《Journal of Differential Equations》2019,266(9):5397-5430
We show the short-time existence and nonlinear stability of vortex sheets for the nonisentropic compressible Euler equations in two spatial dimensions, based on the weakly linear stability result of Morando and Trebeschi (2008) [20]. The missing normal derivatives are compensated through the equations of the linearized vorticity and entropy when deriving higher-order energy estimates. The proof of the resolution for this nonlinear problem follows from certain a priori tame estimates on the effective linear problem in the usual Sobolev spaces and a suitable Nash–Moser iteration scheme. 相似文献
4.
非线性互补问题的一种全局收敛的显式光滑Newton方法 总被引:2,自引:0,他引:2
本针对Po函数非线性互补问题,给出了一种显式光滑Newton方法,该方法将光滑参数μ进行显式迭代而不依赖于Newton方向的搜索过程,并在适当的假设条件下,证明了算法的全局收敛性。 相似文献
5.
This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for solving general constrained optimization problems. At each iteration, our local quadratic subproblem includes the use of the Gauss–Newton approximation but also encompasses a structured secant approximation along with tests of when to use this approximation. This method has been tested on a selection of standard problems. The results indicate that, for least-squares problems, the approach taken here is a viable alternative to standard general optimization methods such as the Byrd–Omojokun trust-region method and the Powell damped BFGS line search method. 相似文献
6.
When solving large complex optimization problems, the user is faced with three major problems. These are (i) the cost in human time in obtaining accurate expressions for the derivatives involved; (ii) the need to store second derivative information; and (iii), of lessening importance, the time taken to solve the problem on the computer. For many problems, a significant part of the latter can be attributed to solving Newton-like equations. In the algorithm described, the equations are solved using a conjugate direction method that only needs the Hessian at the current point when it is multiplied by a trial vector. In this paper, we present a method that finds this product using automatic differentiation while only requiring vector storage. The method takes advantage of any sparsity in the Hessian matrix and computes exact derivatives. It avoids the complexity of symbolic differentiation, the inaccuracy of numerical differentiation, the labor of finding analytic derivatives, and the need for matrix store. When far from a minimum, an accurate solution to the Newton equations is not justified, so an approximate solution is obtained by using a version of Dembo and Steihaug's truncated Newton algorithm (Ref. 1).This paper was presented at the SIAM National Meeting, Boston, Massachusetts, 1986. 相似文献
7.
本文主要解决奇异非光滑方程组的解法。应用一种新的次微分的外逆,我们提出了牛顿法和不精确牛顿法,它们的收敛性同时也得到了证明。这种方法能更容易在一引起实际应用中实现。这种方法可以看作是已存在的解非光滑方程组的方法的延伸。 相似文献
8.
曾六川 《数学物理学报(A辑)》2002,22(3):336-341
设犈是一致凸Banach空间,满足Opial条件或具有Frechet可微范数,犆是犈的非空闭凸子集,且犜:犆→犆是非扩张映象.又设对任何初始数据狓1 ∈犆,序列{狓狀}由下列修改了的Ishikawa迭代程序生成:狓狀+1 =狋狀犜狀(狊狀犜狀狓狀+ (1-狊狀)狓狀)+ (1-狋狀)狓狀, 狀≥1, (I)其中,数列{狋狀}与{狊狀}满足下列条件(i)和(ii)之一:(i)狋狀∈ [犪,犫]且狊狀∈ [0,犫];(ii)狋狀∈ [犪,1]且狊狀∈ [犪,犫],这里,常数犪,犫满足0<犪≤犫<1.作者证明了,犜有不动点的充要条件是,{狓狀}
弱收敛且{‖狓狀-犜狓狀‖}收敛到0.而且,由此即知,若犜有不动点,则{狓狀}弱收敛到犜的一个不动点. 相似文献
9.
By further generalizing the skew-symmetric triangular splitting iteration method studied by Krukier, Chikina and Belokon (Applied Numerical Mathematics, 41 (2002), pp. 89–105), in this paper, we present a new iteration scheme, called the modified skew-Hermitian triangular splitting iteration method, for solving the strongly non-Hermitian systems of linear equations with positive definite coefficient matrices. We discuss the convergence property and the optimal parameters of this new method in depth. Moreover, when it is applied to precondition the Krylov subspace methods like GMRES, the preconditioning property of the modified skew-Hermitian triangular splitting iteration is analyzed in detail. Numerical results show that, as both solver and preconditioner, the modified skew-Hermitian triangular splitting iteration method is very effective for solving large sparse positive definite systems of linear equations of strong skew-Hermitian parts. 相似文献
10.
The semi‐iterative method (SIM) is applied to the hyper‐power (HP) iteration, and necessary and sufficient conditions are given for the convergence of the semi‐iterative–hyper‐power (SIM–HP) iteration. The root convergence rate is computed for both the HP and SIM–HP methods, and the quotient convergence rate is given for the HP iteration. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献