全文获取类型
收费全文 | 2252篇 |
免费 | 176篇 |
国内免费 | 174篇 |
专业分类
化学 | 467篇 |
晶体学 | 5篇 |
力学 | 204篇 |
综合类 | 32篇 |
数学 | 1536篇 |
物理学 | 358篇 |
出版年
2024年 | 3篇 |
2023年 | 52篇 |
2022年 | 66篇 |
2021年 | 109篇 |
2020年 | 165篇 |
2019年 | 167篇 |
2018年 | 170篇 |
2017年 | 147篇 |
2016年 | 133篇 |
2015年 | 114篇 |
2014年 | 160篇 |
2013年 | 228篇 |
2012年 | 207篇 |
2011年 | 75篇 |
2010年 | 58篇 |
2009年 | 84篇 |
2008年 | 89篇 |
2007年 | 68篇 |
2006年 | 51篇 |
2005年 | 38篇 |
2004年 | 46篇 |
2003年 | 46篇 |
2002年 | 49篇 |
2001年 | 27篇 |
2000年 | 38篇 |
1999年 | 21篇 |
1998年 | 27篇 |
1997年 | 28篇 |
1996年 | 12篇 |
1995年 | 24篇 |
1994年 | 9篇 |
1993年 | 14篇 |
1992年 | 11篇 |
1991年 | 3篇 |
1990年 | 15篇 |
1989年 | 3篇 |
1988年 | 9篇 |
1987年 | 8篇 |
1986年 | 4篇 |
1985年 | 5篇 |
1984年 | 5篇 |
1983年 | 2篇 |
1982年 | 3篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1971年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有2602条查询结果,搜索用时 31 毫秒
1.
《Indagationes Mathematicae》2021,32(1):55-85
We show that the differential structure of the orbit space of a proper action of a Lie group on a smooth manifold is weakly reflexive. This implies that the orbit space is a differentiable space in the sense of Smith, which ensures that the orbit space has an exterior algebra of differential forms, that satisfies Smith’s version of de Rham’s theorem. Because the orbit space is a locally closed subcartesian space, it has vector fields and their flows. 相似文献
2.
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 . 相似文献
3.
非线性互补问题的一种全局收敛的显式光滑Newton方法 总被引:2,自引:0,他引:2
本针对Po函数非线性互补问题,给出了一种显式光滑Newton方法,该方法将光滑参数μ进行显式迭代而不依赖于Newton方向的搜索过程,并在适当的假设条件下,证明了算法的全局收敛性。 相似文献
4.
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. 相似文献
5.
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. 相似文献
6.
本文主要解决奇异非光滑方程组的解法。应用一种新的次微分的外逆,我们提出了牛顿法和不精确牛顿法,它们的收敛性同时也得到了证明。这种方法能更容易在一引起实际应用中实现。这种方法可以看作是已存在的解非光滑方程组的方法的延伸。 相似文献
7.
8.
In basin modelling the thermodynamics of a multicomponent multiphase fluid flux are computationally too expensive when derived from an equation of state and the Gibbs equality constraints. In this article we present a novel implicit molar mass formulation technique using binary mixture thermodynamics. The two proposed solution methods, with and without cross derivative terms between components, are based on a preconditioned Newton‐GMRES scheme for each time‐step with analytical computation of the derivatives. These new algorithms reduce significantly the numerical effort for the computation of the molar masses, and we illustrate the behavior of these methods with numerical computations. Copyright © 2004 John Wiley & Sons Ltd. 相似文献
9.
Efficient Sequential Quadratic Programming Implementations for Equality-Constrained Discrete-Time Optimal Control 总被引:1,自引:0,他引:1
Efficient sequential quadratic programming (SQP) implementations are presented for equality-constrained, discrete-time, optimal control problems. The algorithm developed calculates the search direction for the equality-based variant of SQP and is applicable to problems with either fixed or free final time. Problem solutions are obtained by solving iteratively a series of constrained quadratic programs. The number of mathematical operations required for each iteration is proportional to the number of discrete times N. This is contrasted by conventional methods in which this number is proportional to N
3. The algorithm results in quadratic convergence of the iterates under the same conditions as those for SQP and simplifies to an existing dynamic programming approach when there are no constraints and the final time is fixed. A simple test problem and two application problems are presented. The application examples include a satellite dynamics problem and a set of brachistochrone problems involving viscous friction. 相似文献
10.
A globally convergent Newton method for solving strongly monotone variational inequalities 总被引:14,自引:0,他引:14
Variational inequality problems have been used to formulate and study equilibrium problems, which arise in many fields including economics, operations research and regional sciences. For solving variational inequality problems, various iterative methods such as projection methods and the nonlinear Jacobi method have been developed. These methods are convergent to a solution under certain conditions, but their rates of convergence are typically linear. In this paper we propose to modify the Newton method for variational inequality problems by using a certain differentiable merit function to determine a suitable step length. The purpose of introducing this merit function is to provide some measure of the discrepancy between the solution and the current iterate. It is then shown that, under the strong monotonicity assumption, the method is globally convergent and, under some additional assumptions, the rate of convergence is quadratic. Limited computational experience indicates the high efficiency of the proposed method. 相似文献