全文获取类型
收费全文 | 14265篇 |
免费 | 1203篇 |
国内免费 | 426篇 |
专业分类
化学 | 6606篇 |
晶体学 | 29篇 |
力学 | 1205篇 |
综合类 | 58篇 |
数学 | 5395篇 |
物理学 | 2601篇 |
出版年
2024年 | 18篇 |
2023年 | 205篇 |
2022年 | 365篇 |
2021年 | 412篇 |
2020年 | 666篇 |
2019年 | 493篇 |
2018年 | 439篇 |
2017年 | 397篇 |
2016年 | 660篇 |
2015年 | 616篇 |
2014年 | 718篇 |
2013年 | 1079篇 |
2012年 | 723篇 |
2011年 | 749篇 |
2010年 | 507篇 |
2009年 | 779篇 |
2008年 | 723篇 |
2007年 | 788篇 |
2006年 | 665篇 |
2005年 | 531篇 |
2004年 | 505篇 |
2003年 | 468篇 |
2002年 | 406篇 |
2001年 | 386篇 |
2000年 | 337篇 |
1999年 | 283篇 |
1998年 | 293篇 |
1997年 | 225篇 |
1996年 | 230篇 |
1995年 | 160篇 |
1994年 | 123篇 |
1993年 | 116篇 |
1992年 | 78篇 |
1991年 | 75篇 |
1990年 | 60篇 |
1989年 | 53篇 |
1988年 | 52篇 |
1987年 | 39篇 |
1986年 | 80篇 |
1985年 | 34篇 |
1984年 | 47篇 |
1983年 | 16篇 |
1982年 | 27篇 |
1981年 | 29篇 |
1980年 | 20篇 |
1979年 | 36篇 |
1978年 | 41篇 |
1977年 | 41篇 |
1976年 | 40篇 |
1974年 | 15篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
51.
应用物理类专业电磁学课程教学内容改革 总被引:2,自引:0,他引:2
应用物理类专业的培养目标是培养物理学应用型人才,物理学应用型人才是具备实验物理学家和工程师双重素质的复合型人才,物理学应用型人才应着重技术创新和应用能力的培养,应编写区别于物理学专业的、适应应用物理类专业特点的课程教材,应用物理类专业《电磁学》教材遵循电磁理论发展顺序的体系能体现理论发展的规律,符合普通物理的特点、要求和教学目标,文章论述了应用物理类专业课程教学内容改革的指导思想,介绍了我国第一套适应应用物理专业的面向21世纪的《电磁学》教材的特点。 相似文献
52.
Madhu V. Nayakkankuppam 《Mathematical Programming》2007,109(2-3):477-504
We describe an approach to the parallel and distributed solution of large-scale, block structured semidefinite programs using
the spectral bundle method. Various elements of this approach (such as data distribution, an implicitly restarted Lanczos
method tailored to handle block diagonal structure, a mixed polyhedral-semidefinite subdifferential model, and other aspects
related to parallelism) are combined in an implementation called LAMBDA, which delivers faster solution times than previously
possible, and acceptable parallel scalability on sufficiently large problems.
This work was supported in part by NSF grants DMS-0215373 and DMS-0238008. 相似文献
53.
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. 相似文献
54.
Applied Biochemistry and Biotechnology - 相似文献
55.
本文讨论了一类Rosenbrock方法求解比例延迟微分方程,y′(t)=λy(t) μy(qt),λ,μ∈C,0 相似文献
56.
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. 相似文献
57.
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. 相似文献
58.
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 相似文献
59.
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. 相似文献
60.
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 相似文献