全文获取类型
收费全文 | 1805篇 |
免费 | 257篇 |
国内免费 | 61篇 |
学科分类
数理化 | 2123篇 |
出版年
2024年 | 3篇 |
2023年 | 17篇 |
2022年 | 29篇 |
2021年 | 27篇 |
2020年 | 43篇 |
2019年 | 33篇 |
2018年 | 40篇 |
2017年 | 61篇 |
2016年 | 75篇 |
2015年 | 62篇 |
2014年 | 86篇 |
2013年 | 109篇 |
2012年 | 102篇 |
2011年 | 92篇 |
2010年 | 74篇 |
2009年 | 68篇 |
2008年 | 81篇 |
2007年 | 98篇 |
2006年 | 85篇 |
2005年 | 90篇 |
2004年 | 91篇 |
2003年 | 90篇 |
2002年 | 84篇 |
2001年 | 77篇 |
2000年 | 47篇 |
1999年 | 60篇 |
1998年 | 66篇 |
1997年 | 66篇 |
1996年 | 40篇 |
1995年 | 50篇 |
1994年 | 34篇 |
1993年 | 36篇 |
1992年 | 34篇 |
1991年 | 17篇 |
1990年 | 5篇 |
1989年 | 11篇 |
1988年 | 15篇 |
1987年 | 5篇 |
1986年 | 4篇 |
1985年 | 4篇 |
1984年 | 6篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1980年 | 2篇 |
1979年 | 1篇 |
排序方式: 共有2123条查询结果,搜索用时 15 毫秒
1.
Jinchao Xu 《应用数学学报(英文版)》2002,18(2):185-200
Abstract Some new local and parallel finite element algorithms are proposed and analyzed in this paper foreigenvalue problems.With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced tothe solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraicsystems on fine grid by using some local and parallel procedure.A theoretical tool for analyzing these algorithmsis some local error estimate that is also obtained in this paper for finite element approximations of eigenvectorson general shape-regular grids. 相似文献
2.
讨论了求解无约束线性最小二乘问题的一种并行单纯形法以及对它的改进算法并行共轭梯度—单纯形法 .算法本身具有很强的并行机制 ,能够充分地发挥并行机快速省时的特点 .本文也对算法做了理论分析 ,对算法的收敛性给予了证明 (在二维情形下 ) .最后做了数值实验 (由于软硬件条件的限制 ,并行算法未能在并行计算机上实现 ,鉴于这种情况 ,我们所做的数值实验均是在串行机上完成的 ) 相似文献
3.
A parallel method for time discretization of parabolic equations based on Laplace transformation and quadrature 总被引:5,自引:0,他引:5
We consider the discretization in time of an inhomogeneous parabolicequation in a Banach space setting, using a representation ofthe solution as an integral along a smooth curve in the complexleft half-plane which, after transformation to a finite interval,is then evaluated to high accuracy by a quadrature rule. Thisreduces the problem to a finite set of elliptic equations withcomplex coefficients, which may be solved in parallel. The paperis a further development of earlier work by the authors, wherewe treated the homogeneous equation in a Hilbert space framework.Special attention is given here to the treatment of the forcingterm. The method is combined with finite-element discretizationin spatial variables. 相似文献
4.
Gowravaram Sabitha G.S.Kiran Kumar ReddyK.Bhaskar Reddy J.S. Yadav 《Tetrahedron letters》2003,44(34):6497-6499
The three component condensation of an aldehyde, a β-keto ester and urea (thiourea) in the presence of a catalytic amount of VCl3 is disclosed for the solution phase synthesis of dihydropyrimidinones. The ease of synthesis and work-up allowed the parallel synthesis of a 48-membered library of dihydropyrimidinones quickly and efficiently in good yields. 相似文献
5.
This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms. 相似文献
6.
In this paper, we introduce a new concept of semi-preemptive scheduling and we show how it can be used to derive a maximum-flow-based lower bound for the P|rj|Lmax which dominates the well-known preemptive lower bound. We show that, in some cases, the proposed bound strictly dominates the preemptive one while having the same complexity. 相似文献
7.
Mixed integer programming (MIP) models are extensively usedto aid strategic and tactical decision making in many businesssectors. Solving MIP models is a computationally intensive processand there is a need to develop solution approaches that enablelarger models to be solved within acceptable timeframes. Inthis paper, we describe the implementation of a two-stage parallelbranch and bound (PB & B) algorithm for MIP. In stage 1of the algorithm, a multiple heuristic search is implementedin which a number of alternative search trees are investigatedusing a forest search in the hope of finding a good solutionquickly. In stage 2, the search is reorganized so that the branchesof a chosen tree are investigated in parallel. A new heuristicis introduced, based on a best projection criterion, which evaluatesalternative B & B trees in order to choose one for investigationin stage 2 of the algorithm. The heuristic also serves as away of implementing a quality load balancing scheme for stage2 of the algorithm. The results of experimental investigationsare reported for a range of models taken from the MIPLIB libraryof benchmark problems. 相似文献
8.
We consider the generalization of the classical P||Cmax problem (assign n jobs to m identical parallel processors by minimizing the makespan) arising when the number of jobs that can be assigned to each processor cannot exceed a given integer k. The problem is strongly NP-hard for any fixed k > 2. We briefly survey lower and upper bounds from the literature. We introduce greedy heuristics, local search and a scatter search approach. The effectiveness of these approaches is evaluated through extensive computational comparison with a depth-first branch-and-bound algorithm that includes new lower bounds and dominance criteria. 相似文献
9.
关于非平行板电容器电容计算的讨论 总被引:4,自引:3,他引:1
用串联方法计算非平行板电容器的电容,简便地得到与其他方法相同的结果。 相似文献
10.
In this paper, we consider a queueing system in which there are two exponential servers, each having his own queue, and arriving
customers will join the shorter queue. Based on the results given in Flatto and McKean, we rewrite the formula for the probability
that there are exactlyk customers in each queue, wherek = 0, 1,…. This enables us to present an algorithm for computing these probabilities and then to find the joint distribution
of the queue lengths in the system. A program and numerical examples are given. 相似文献