全文获取类型
收费全文 | 838篇 |
免费 | 40篇 |
国内免费 | 32篇 |
专业分类
化学 | 33篇 |
力学 | 79篇 |
综合类 | 6篇 |
数学 | 708篇 |
物理学 | 84篇 |
出版年
2023年 | 4篇 |
2022年 | 7篇 |
2021年 | 8篇 |
2020年 | 17篇 |
2019年 | 16篇 |
2018年 | 22篇 |
2017年 | 14篇 |
2016年 | 25篇 |
2015年 | 23篇 |
2014年 | 36篇 |
2013年 | 51篇 |
2012年 | 48篇 |
2011年 | 38篇 |
2010年 | 39篇 |
2009年 | 57篇 |
2008年 | 53篇 |
2007年 | 51篇 |
2006年 | 43篇 |
2005年 | 27篇 |
2004年 | 37篇 |
2003年 | 41篇 |
2002年 | 48篇 |
2001年 | 21篇 |
2000年 | 36篇 |
1999年 | 19篇 |
1998年 | 22篇 |
1997年 | 23篇 |
1996年 | 9篇 |
1995年 | 9篇 |
1994年 | 7篇 |
1993年 | 12篇 |
1992年 | 10篇 |
1991年 | 1篇 |
1990年 | 10篇 |
1989年 | 3篇 |
1988年 | 4篇 |
1987年 | 3篇 |
1986年 | 3篇 |
1985年 | 2篇 |
1984年 | 4篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1971年 | 1篇 |
排序方式: 共有910条查询结果,搜索用时 31 毫秒
91.
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local convergence results. However, the main contribution of the paper is related to global worst-case complexity bounds for different problem classes including some nonconvex cases. It is shown that the search direction can be computed by standard linear algebra technique. 相似文献
92.
Y. Gao 《Journal of Optimization Theory and Applications》2006,131(3):417-428
The Newton method and the inexact Newton method for solving quasidifferentiable equations via the quasidifferential are investigated. The notion of Q-semismoothness for a quasidifferentiable function is proposed. The superlinear convergence of the Newton method proposed by Zhang and Xia is proved under the Q-semismooth assumption. An inexact Newton method is developed and its linear convergence is shown.Project sponsored by Shanghai Education Committee Grant 04EA01 and by Shanghai Government Grant T0502. 相似文献
93.
Chang-fengMa Pu-yanNie Guo-pingLiang 《计算数学(英文版)》2003,21(6):747-758
The nonlinear complementarity problem can be reformulated as a nonsmooth equation. In this paper we propose a new smoothing Newton algorithm for the solution of the nonlinear complementarity problem by constructing a new smoothing approximation function. Global and local superlinear convergence results of the algorithm are obtained under suitable conditions. Numerical experiments confirm the good theoretical properties of the algorithm. 相似文献
94.
Yunkai Zhou 《Numerical Linear Algebra with Applications》2006,13(8):621-642
We study Davidson‐type subspace eigensolvers. Correction equations of Jacobi–Davidson and several other schemes are reviewed. New correction equations are derived. A general correction equation is constructed, existing correction equations may be considered as special cases of this general equation. The main theme of this study is to identify the essential common ingredient that leads to the efficiency of a diverse form of Davidson‐type methods. We emphasize the importance of the approximate Rayleigh‐quotient‐iteration direction. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
95.
A conic Newton method is attractive because it converges to a local minimizzer rapidly from any sufficiently good initial guess. However, it may be expensive to solve the conic Newton equation at each iterate. In this paper we consider an inexact conic Newton method, which solves the couic Newton equation oldy approximately and in sonm unspecified manner. Furthermore, we show that such method is locally convergent and characterizes the order of convergence in terms of the rate of convergence of the relative residuals. 相似文献
96.
Xiaofeng Ren 《Journal of Differential Equations》2005,209(2):266-301
We find nucleation solutions of N interfaces and K spikes to the one-dimensional FitzhHugh-Nagumo system. Each spike sits asymptotically in the middle between two interfaces. We use the Lyapunov-Schmidt reduction method, in which the problem is split into a finite-dimensional problem related to the translation of the K spikes and an infinite-dimensional complement problem. However the complement problem remains near degenerate due to the translation of the N interfaces. To overcome this difficulty we move the interfaces by a small distance and solve the complement problem with the help of a Newton iteration argument. 相似文献
97.
We consider the problem of finding solutions of systems of monotone equations. The Newton-type algorithm proposed in Ref. 1 has a very nice global convergence property in that the whole sequence of iterates generated by this algorithm converges to a solution, if it exists. Superlinear convergence of this algorithm is obtained under a standard nonsingularity assumption. The nonsingularity condition implies that the problem has a unique solution; thus, for a problem with more than one solution, such a nonsingularity condition cannot hold. In this paper, we show that the superlinear convergence of this algorithm still holds under a local error-bound assumption that is weaker than the standard nonsingularity condition. The local error-bound condition may hold even for problems with nonunique solutions. As an application, we obtain a Newton algorithm with very nice global and superlinear convergence for the minimum norm solution of linear programs.This research was supported by the Singapore-MIT Alliance and the Australian Research Council. 相似文献
98.
倪勤 《高等学校计算数学学报(英文版)》1997,(1)
In this paper we report a sparse truncated Newton algorithm for handling large-scale simple bound nonlinear constrained minimixation problem. The truncated Newton method is used to update the variables with indices outside of the active set, while the projected gradient method is used to update the active variables. At each iterative level, the search direction consists of three parts, one of which is a subspace truncated Newton direction, the other two are subspace gradient and modified gradient directions. The subspace truncated Newton direction is obtained by solving a sparse system of linear equations. The global convergence and quadratic convergence rate of the algorithm are proved and some numerical tests are given. 相似文献
99.
Alexander Yu. Gelfgat 《国际流体数值方法杂志》2007,53(3):485-506
A problem of stability of steady convective flows in rectangular cavities is revisited and studied by a second‐order finite volume method. The study is motivated by further applications of the finite volume‐based stability solver to more complicated applied problems, which needs an estimate of convergence of critical parameters. It is shown that for low‐order methods the quantitatively correct stability results for the problems considered can be obtained only on grids having more than 100 nodes in the shortest direction, and that the results of calculations using uniform grids can be significantly improved by the Richardson's extrapolation. It is shown also that grid stretching can significantly improve the convergence, however sometimes can lead to its slowdown. It is argued that due to the sparseness of the Jacobian matrix and its large dimension it can be effective to combine Arnoldi iteration with direct sparse solvers instead of traditional Krylov‐subspace‐based iteration techniques. The same replacement in the Newton steady‐state solver also yields a robust numerical process, however, it cannot be as effective as modern preconditioned Krylov‐subspace‐based iterative solvers. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
100.
关于有理插值函数存在性的研究 总被引:2,自引:0,他引:2
在本文中 ,我们利用 Newton插值多项式 ,改进了 [1 ]中的方法 ,使其能更简便 ,快速 ,严谨地判别有理插值函数的存在性 ,并在其存在时给出相应的插值有理函数的具体表达式 . 相似文献