全文获取类型
收费全文 | 1858篇 |
免费 | 144篇 |
国内免费 | 47篇 |
专业分类
化学 | 344篇 |
晶体学 | 4篇 |
力学 | 196篇 |
综合类 | 45篇 |
数学 | 752篇 |
物理学 | 708篇 |
出版年
2024年 | 2篇 |
2023年 | 27篇 |
2022年 | 57篇 |
2021年 | 47篇 |
2020年 | 46篇 |
2019年 | 39篇 |
2018年 | 36篇 |
2017年 | 50篇 |
2016年 | 57篇 |
2015年 | 60篇 |
2014年 | 125篇 |
2013年 | 132篇 |
2012年 | 87篇 |
2011年 | 113篇 |
2010年 | 102篇 |
2009年 | 117篇 |
2008年 | 123篇 |
2007年 | 117篇 |
2006年 | 79篇 |
2005年 | 69篇 |
2004年 | 54篇 |
2003年 | 58篇 |
2002年 | 53篇 |
2001年 | 46篇 |
2000年 | 35篇 |
1999年 | 42篇 |
1998年 | 35篇 |
1997年 | 34篇 |
1996年 | 29篇 |
1995年 | 28篇 |
1994年 | 32篇 |
1993年 | 22篇 |
1992年 | 15篇 |
1991年 | 15篇 |
1990年 | 4篇 |
1989年 | 5篇 |
1988年 | 10篇 |
1987年 | 8篇 |
1986年 | 6篇 |
1985年 | 1篇 |
1984年 | 5篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1980年 | 3篇 |
1979年 | 3篇 |
1978年 | 3篇 |
1977年 | 3篇 |
1976年 | 6篇 |
1975年 | 2篇 |
1974年 | 3篇 |
排序方式: 共有2049条查询结果,搜索用时 233 毫秒
221.
We study a multilevel Schwarz preconditioned Newton-Krylov algorithm to solve the Poisson-Boltzmann equation with applications in multi-particle colloidal simulation. The smoothed aggregation-type coarse mesh space is introduced in collaboration with the one-level Schwarz method as a composite preconditioner for accelerating the convergence of a Krylov subspace method for solving the Jacobian system at each Newton step. The important feature of the proposed solution algorithm is that the geometric mesh information needed for constructing the multilevel preconditioner is the same as the one-level Schwarz method on the fine mesh. Other components, such as the definition of the coarse mesh, all the mesh transfer operators, and the coarse mesh problem, are taken care of by the Trillinos/ML packages of the Sandia National Laboratories in the United States. After algorithmic parameter tuning, we show that the proposed smoothed aggregation multilevel Newton-Krylov-Schwarz (NKS) algorithm numerically outperforms than smoothed aggregation multigrid method and one-level version of the NKS algorithm with satisfactory parallel performances up to a few thousand cores. Besides, we investigate how the electrostatic forces between particles for the separation distance depend on the radius of spherical colloidal particles and valence ratios of cation and anion in a cubic system. 相似文献
222.
In this paper, a conservative parallel difference scheme, which is based on domain decomposition method, for 2-dimension diffusion equation is proposed. In the construction of this scheme, we use the numerical solution on the previous time step to give a weighted approximation of the numerical flux. Then the sub-problems with Neumann boundary are computed by fully implicit scheme. What is more, only local message communication is needed in the program. We use the method of discrete functional analysis to give the proof of the unconditional stability and second-order convergence accuracy. Some numerical tests are given to verify the theory results. 相似文献
223.
J.R. Figueira A. Liefooghe E.-G. Talbi A.P. Wierzbicki 《European Journal of Operational Research》2010
This paper presents a multiple reference point approach for multi-objective optimization problems of discrete and combinatorial nature. When approximating the Pareto Frontier, multiple reference points can be used instead of traditional techniques. These multiple reference points can easily be implemented in a parallel algorithmic framework. The reference points can be uniformly distributed within a region that covers the Pareto Frontier. An evolutionary algorithm is based on an achievement scalarizing function that does not impose any restrictions with respect to the location of the reference points in the objective space. Computational experiments are performed on a bi-objective flow-shop scheduling problem. Results, quality measures as well as a statistical analysis are reported in the paper. 相似文献
224.
Robert Hable 《International Journal of Approximate Reasoning》2010,51(9):1114-1128
The article considers estimating a parameter θ in an imprecise probability model which consists of coherent upper previsions . After the definition of a minimum distance estimator in this setup and a summarization of its main properties, the focus lies on applications. It is shown that approximate minimum distances on the discretized sample space can be calculated by linear programming. After a discussion of some computational aspects, the estimator is applied in a simulation study consisting of two different models. Finally, the estimator is applied on a real data set in a linear regression model. 相似文献
225.
王顺绪 《高等学校计算数学学报》2010,32(2)
<正>1引言陀螺系统特征值问题是转子动力学中的基本问题,是一类特殊的二次特征值问题.假设M和K是n阶对称矩阵,C是n阶反对称矩阵,则二次特征值问题(λ~2M+λC+K)x=0(1) 相似文献
226.
Parallel iterative methods are powerful in solving large systems of linear equations (LEs). The existing parallel computing research results focus mainly on sparse systems or others with particular structure. Most are based on parallel implementation of the classical relaxation methods such as Gauss-Seidel, SOR, and AOR methods which can be efficiently carried out on multiprocessor system. In this paper, we propose a novel parallel splitting operator method in which we divide the coefficient matrix into two or three parts. Then we convert the original problem (LEs) into a monotone (linear) variational inequality problem (VI) with separable structure. Finally, an inexact parallel splitting augmented Lagrangian method is proposed to solve the variational inequality problem (VI). To avoid dealing with the matrix inverse operator, we introduce proper inexact terms in subproblems such that the complexity of each iteration of the proposed method is O(n2). In addition, the proposed method does not require any special structure of system of LEs under consideration. Convergence of the proposed methods in dealing with two and three separable operators respectively, is proved. Numerical computations are provided to show the applicability and robustness of the proposed methods. 相似文献
227.
228.
James D. Whitfield 《Molecular physics》2013,111(5):735-750
Over the last century, a large number of physical and mathematical developments paired with rapidly advancing technology have allowed the field of quantum chemistry to advance dramatically. However, the lack of computationally efficient methods for the exact simulation of quantum systems on classical computers presents a limitation of current computational approaches. We report, in detail, how a set of pre-computed molecular integrals can be used to explicitly create a quantum circuit, i.e. a sequence of elementary quantum operations, that, when run on a quantum computer, obtains the energy of a molecular system with fixed nuclear geometry using the quantum phase estimation algorithm. We extend several known results related to this idea and discuss the adiabatic state preparation procedure for preparing the input states used in the algorithm. With current and near future quantum devices in mind, we provide a complete example using the hydrogen molecule of how a chemical Hamiltonian can be simulated using a quantum computer. 相似文献
229.
John M. Chambers 《Journal of computational and graphical statistics》2013,22(3):404-422
Abstract Statistical software provides essential support for statisticians and others who are analyzing data or doing research on new statistical techniques. Those supported typically regard themselves as “users” of the software, but as soon as they need to express their own ideas computationally, they in fact become “programmers.” Nothing is more important for the success of statistical software than enabling this transition from user to programmer, and on to gradually more ambitious software design. What does the user need? How can the design of statistical software help? This article presents a number of suggestions based on past experience and current research. The evolution of the S system reflects some of these opinions. Work on the Omegahat software provides a promising direction for future systems that reflect similar motivations. 相似文献
230.
《Journal of computational and graphical statistics》2013,22(1):246-261
In recent years, parallel processing has become widely available to researchers. It can be applied in an obvious way in the context of Monte Carlo simulation, but techniques for “parallelizing” Markov chain Monte Carlo (MCMC) algorithms are not so obvious, apart from the natural approach of generating multiple chains in parallel. Although generation of parallel chains is generally the easiest approach, in cases where burn-in is a serious problem, it is often desirable to use parallelization to speed up generation of a single chain. This article briefly discusses some existing methods for parallelization of MCMC algorithms, and proposes a new “pre-fetching” algorithm to parallelize generation of a single chain. 相似文献