全文获取类型
收费全文 | 270篇 |
免费 | 19篇 |
国内免费 | 15篇 |
专业分类
化学 | 1篇 |
力学 | 37篇 |
综合类 | 3篇 |
数学 | 245篇 |
物理学 | 18篇 |
出版年
2024年 | 1篇 |
2023年 | 8篇 |
2022年 | 3篇 |
2021年 | 4篇 |
2020年 | 8篇 |
2019年 | 10篇 |
2018年 | 10篇 |
2017年 | 11篇 |
2016年 | 6篇 |
2015年 | 11篇 |
2014年 | 14篇 |
2013年 | 14篇 |
2012年 | 18篇 |
2011年 | 17篇 |
2010年 | 17篇 |
2009年 | 14篇 |
2008年 | 19篇 |
2007年 | 13篇 |
2006年 | 10篇 |
2005年 | 11篇 |
2004年 | 6篇 |
2003年 | 12篇 |
2002年 | 17篇 |
2001年 | 4篇 |
2000年 | 8篇 |
1999年 | 8篇 |
1998年 | 3篇 |
1997年 | 8篇 |
1996年 | 4篇 |
1995年 | 3篇 |
1994年 | 2篇 |
1993年 | 3篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1987年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1981年 | 2篇 |
排序方式: 共有304条查询结果,搜索用时 15 毫秒
92.
本文研究Toeplitz+Hankel线性方程组的预处理迭代解法.我们提出了几个新的预条件子,并分析了预处理矩阵的谱性质,当生成函数在Wiener类中时,预处理矩阵的特征值聚集在1附近.数值实验表明该预处理子比文[5]中的预处理子更有效. 相似文献
93.
《Operations Research Letters》2021,49(6):908-913
Configuration integer programs (IP) have been key in the design of algorithms for NP-hard high-multiplicity problems. First, we develop fast exact (exponential-time) algorithms for Configuration IP and matching hardness results. Second, we showcase the implications of these results to bin-packing and facility-location-like problems. 相似文献
94.
Higher order finite element discretizations, although providing higher accuracy, are considered to be computationally expensive and of limited use for large‐scale problems. In this paper, we have developed an efficient iterative solver for solving large‐scale quadratic finite element problems. The proposed approach shares some common features with geometric multigrid methods but does not need structured grids to create the coarse problem. This leads to a robust method applicable to finite element problems discretized by unstructured meshes such as those from adaptive remeshing strategies. The method is based on specific properties of hierarchical quadratic bases. It can be combined with an algebraic multigrid (AMG) preconditioner or with other algebraic multilevel block factorizations. The algorithm can be accelerated by flexible Krylov subspace methods. We present some numerical results on the convection–diffusion and linear elasticity problems to illustrate the efficiency and the robustness of the presented algorithm. In these experiments, the performance of the proposed method is compared with that of an AMG preconditioner and other iterative solvers. Our approach requires less computing time and less memory storage. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
95.
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a Π-graph for Π-graphs being one of the following four classes of graphs: Eulerian graphs, even graphs, odd graphs, and connected odd graphs. We also consider the parameterized complexity of their parametric dual problems.For these sixteen problems, we show that eight of them are fixed parameter tractable and four are W[1]-hard. Our main techniques are the color-coding method of Alon, Yuster and Zwick, and the random separation method of Cai, Chan and Chan. 相似文献
96.
In this work, we consider numerical methods for solving a class of block three‐by‐three saddle‐point problems, which arise from finite element methods for solving time‐dependent Maxwell equations and some other applications. The direct extension of the Uzawa method for solving this block three‐by‐three saddle‐point problem requires the exact solution of a symmetric indefinite system of linear equations at each step. To avoid heavy computations at each step, we propose an inexact Uzawa method, which solves the symmetric indefinite linear system in some inexact way. Under suitable assumptions, we show that the inexact Uzawa method converges to the unique solution of the saddle‐point problem within the approximation level. Two special algorithms are customized for the inexact Uzawa method combining the splitting iteration method and a preconditioning technique, respectively. Numerical experiments are presented, which demonstrated the usefulness of the inexact Uzawa method and the two customized algorithms. 相似文献
97.
Reza BEHZADI 《数学研究及应用》2019,39(1):101-110
Hadjidimos(1978) proposed a classical accelerated overrelaxation(AOR) iterative method to solve the system of linear equations, and discussed its convergence under the conditions that the coefficient matrices are irreducible diagonal dominant, L-matrices, and consistently orders matrices. Several preconditioned AOR methods have been proposed to solve system of linear equations Ax = b, where A ∈ R~(n×n) is an L-matrix. In this work, we introduce a new class preconditioners for solving linear systems and give a comparison result and some convergence result for this class of preconditioners. Numerical results for corresponding preconditioned GMRES methods are given to illustrate the theoretical results. 相似文献
98.
Several fixed point strategies and Uzawa algorithms (for classical and augmented Lagrangian formulations) are presented to solve the unilateral contact problem with Coulomb friction. These methods are analysed, without introducing any regularization, and a theoretical comparison is performed. Thanks to a formalism coming from convex analysis, some new fixed point strategies are presented and compared with known methods. The analysis is first performed on continuous Tresca problem and then on the finite dimensional Coulomb problem derived from an arbitrary finite element method. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
99.
Xiaojun Chen 《Journal of Computational and Applied Mathematics》1998,100(2):369-224
This paper studies convergence analysis of a preconditioned inexact Uzawa method for nondifferentiable saddle-point problems. The SOR-Newton method and the SOR-BFGS method are special cases of this method. We relax the Bramble-Pasciak-Vassilev condition on preconditioners for convergence of the inexact Uzawa method for linear saddle-point problems. The relaxed condition is used to determine the relaxation parameters in the SOR-Newton method and the SOR-BFGS method. Furthermore, we study global convergence of the multistep inexact Uzawa method for nondifferentiable saddle-point problems. 相似文献
100.
Qiya Hu 《Advances in Computational Mathematics》2007,26(4):367-401
In this paper, we are concerned with the nonoverlapping domain decomposition method with Lagrange multiplier for three-dimensional
second-order elliptic problems with no zeroth-order term. It is known that the methods result in a singular subproblem on
each internal (floating) subdomain. To handle the singularity, we propose a regularization technique which transforms the
corresponding singular problems into approximate positive definite problems. For the regularized method, one can build the
interface equation of the multiplier directly. We first derive an optimal error estimate of the regularized approximation,
and then develop a cheap preconditioned iterative method for solving the interface equation. For the new method, the cost
of computation will not be increased comparing the case without any floating subdomain. The effectiveness of the new method
will be confirmed by both theoretical analyzes and numerical experiments.
The work is supported by Natural Science Foundation of China G10371129. 相似文献