全文获取类型
收费全文 | 15056篇 |
免费 | 1791篇 |
国内免费 | 821篇 |
专业分类
化学 | 7812篇 |
晶体学 | 64篇 |
力学 | 1487篇 |
综合类 | 71篇 |
数学 | 5354篇 |
物理学 | 2880篇 |
出版年
2024年 | 27篇 |
2023年 | 205篇 |
2022年 | 321篇 |
2021年 | 375篇 |
2020年 | 594篇 |
2019年 | 465篇 |
2018年 | 404篇 |
2017年 | 395篇 |
2016年 | 665篇 |
2015年 | 631篇 |
2014年 | 788篇 |
2013年 | 1244篇 |
2012年 | 884篇 |
2011年 | 910篇 |
2010年 | 663篇 |
2009年 | 927篇 |
2008年 | 865篇 |
2007年 | 906篇 |
2006年 | 790篇 |
2005年 | 629篇 |
2004年 | 599篇 |
2003年 | 593篇 |
2002年 | 460篇 |
2001年 | 427篇 |
2000年 | 387篇 |
1999年 | 317篇 |
1998年 | 326篇 |
1997年 | 268篇 |
1996年 | 251篇 |
1995年 | 192篇 |
1994年 | 146篇 |
1993年 | 129篇 |
1992年 | 90篇 |
1991年 | 89篇 |
1990年 | 74篇 |
1989年 | 61篇 |
1988年 | 63篇 |
1987年 | 45篇 |
1986年 | 58篇 |
1985年 | 37篇 |
1984年 | 51篇 |
1983年 | 21篇 |
1982年 | 29篇 |
1981年 | 31篇 |
1980年 | 21篇 |
1979年 | 27篇 |
1978年 | 42篇 |
1977年 | 42篇 |
1976年 | 40篇 |
1974年 | 15篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
B. V. Pal’tsev I. I. Chechel’ 《Computational Mathematics and Mathematical Physics》2006,46(5):820-847
The convergence rate of a fast-converging second-order accurate iterative method with splitting of boundary conditions constructed by the authors for solving an axisymmetric Dirichlet boundary value problem for the Stokes system in a spherical gap is studied numerically. For R/r exceeding about 30, where r and R are the radii of the inner and outer boundary spheres, it is established that the convergence rate of the method is lower (and considerably lower for large R/r) than the convergence rate of its differential version. For this reason, a really simpler, more slowly converging modification of the original method is constructed on the differential level and a finite-element implementation of this modification is built. Numerical experiments have revealed that this modification has the same convergence rate as its differential counterpart for R/r of up to 5 × 103. When the multigrid method is used to solve the split and auxiliary boundary value problems arising at iterations, the modification is more efficient than the original method starting from R/r ~ 30 and is considerably more efficient for large values of R/r. It is also established that the convergence rates of both methods depend little on the stretching coefficient η of circularly rectangular mesh cells in a range of η that is well sufficient for effective use of the multigrid method for arbitrary values of R/r smaller than ~ 5 × 103. 相似文献
52.
本文讨论了一类Rosenbrock方法求解比例延迟微分方程,y′(t)=λy(t) μy(qt),λ,μ∈C,0 相似文献
53.
Jeannette Van Iseghem 《Numerical Algorithms》2002,29(1-3):267-279
A method for solving a linear system is defined. It is a Lanczos-type method, but it uses formal vector orthogonality instead of scalar orthogonality. Moreover, the dimension of vector orthogonality may vary which gives a large freedom in leading the algorithm, and controlling the numerical problems. The ideas of truncated and restarted methods are revisited. The obtained residuals are exactly orthogonal to a space of increasing dimension. Some experiments are done, the problem of finding automaticaly good directions of projection remains partly open. 相似文献
54.
Ronald H. Nickel Igor Mikolic-Torreira Jon W. Tolle 《Computational Optimization and Applications》2006,35(1):109-126
Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked
on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready
to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the
cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the
Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements
of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear
and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization
viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions
are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives
are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult
to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation
and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this
problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed
version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern
search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned
as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous
computers in an office environment, thus, drastically reducing the time required to find the solution. 相似文献
55.
Zhangxin Chen 《Numerical Methods for Partial Differential Equations》2002,18(2):203-217
In this article we prove uniform convergence estimates for the recently developed Galerkin‐multigrid methods for nonconforming finite elements for second‐order problems with less than full elliptic regularity. These multigrid methods are defined in terms of the “Galerkin approach,” where quadratic forms over coarse grids are constructed using the quadratic form on the finest grid and iterated coarse‐to‐fine intergrid transfer operators. Previously, uniform estimates were obtained for problems with full elliptic regularity, whereas these estimates are derived with less than full elliptic regularity here. Applications to the nonconforming P1, rotated Q1, and Wilson finite elements are analyzed. The result applies to the mixed method based on finite elements that are equivalent to these nonconforming elements. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 203–217, 2002; DOI 10.1002/num.10004 相似文献
56.
Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations 总被引:5,自引:0,他引:5
A. A. Brown M. C. Bartholomew-Biggs 《Journal of Optimization Theory and Applications》1989,62(2):211-224
In this paper, we review briefly some methods for minimizing a functionF(x), which proceed by follwoing the solution curve of a system of ordinary differential equations. Such methods have often been thought to be unacceptably expensive; but we show, by means of extensive numerical tests, using a variety of algorithms, that the ODE approach can in fact be implemented in such a way as to be more than competitive with currently available conventional techniques.This work was supported by a SERC research studentship for the first author. Both authors are indebted to Dr. J. J. McKeown and Dr. K. D. Patel of SCICON Ltd, the collaborating establishment, for their advice and encouragement. 相似文献
57.
Two matrix approximation problems are considered: approximation of a rectangular complex matrix by subunitary matrices with
respect to unitarily invariant norms and a minimal rank approximation with respect to the spectral norm. A characterization
of a subunitary approximant of a square matrix with respect to the Schatten norms, given by Maher, is extended to the case
of rectangular matrices and arbitrary unitarily invariant norms. Iterative methods, based on the family of Gander methods
and on Higham’s scaled method for polar decomposition of a matrix, are proposed for computing subunitary and minimal rank
approximants. Properties of Gander methods are investigated in details.
AMS subject classification (2000) 65F30, 15A18 相似文献
58.
59.
J. I. Ramos 《国际流体数值方法杂志》1991,12(9):881-894
Two domain-adaptive finite difference methods are presented and applied to study the dynamic response of incompressible, inviscid, axisymmetric liquid membranes subject to imposed sinusoidal pressure oscillations. Both finite difference methods map the time-dependent physical domain whose downstream boundary is unknown onto a fixed computational domain. The location of the unknown time-dependent downstream boundary of the physical domain is determined from the continuity equation and results in an integrodifferential equation which is non-linearly coupled with the partial differential equations which govern the conservation of mass and linear momentum and the radius of the liquid membrane. One of the finite difference methods solves the non-conservative form of the governing equations by means of a block implicit iterative method. This method possesses the property that the Jacobian matrix of the convection fluxes has an eigenvalue of algebraic multiplicity equal to four and of geometric multiplicity equal to one. The second finite difference procedure also uses a block implicit iterative method, but the governing equations are written in conservation law form and contain an axial velocity which is the difference between the physical axial velocity and the grid speed. It is shown that these methods yield almost identical results and are more accurate than the non-adaptive techniques presented in Part I. It is also shown that the actual value of the pressure coefficient determined from linear analyses can be exceeded without affecting the stability and convergence of liquid membranes if the liquid membranes are subjected to sinusoidal pressure variations of sufficiently high frequencies. 相似文献
60.
In contrast to stochastic differential equation models used for the calculation of the term structure of interest rates, we
develop an approach based on linear dynamical systems under non-stochastic uncertainty with perturbations. The uncertainty
is described in terms of known feasible sets of varying parameters. Observations are used in order to estimate these parameters
by minimizing the maximum of the absolute value of measurement errors, which leads to a linear or nonlinear semi-infinite
programming problem. A regularized logarithmic barrier method for solving (ill-posed) convex semi-infinite programming problems
is suggested. In this method a multi-step proximal regularization is coupled with an adaptive discretization strategy in the
framework of an interior point approach. A special deleting rule permits one to use only a part of the constraints of the
discretized problems. Convergence of the method and its stability with respect to data perturbations in the cone of convexC
1-functions are studied. On the basis of the solutions of the semi-infinite programming problems a technical trading system
for future contracts of the German DAX is suggested and developed.
Supported by the Stiftung Rheinland/Pfalz für Innovation, No. 8312-386261/307. 相似文献