全文获取类型
收费全文 | 162篇 |
免费 | 5篇 |
国内免费 | 1篇 |
专业分类
力学 | 39篇 |
数学 | 115篇 |
物理学 | 14篇 |
出版年
2023年 | 1篇 |
2022年 | 2篇 |
2021年 | 1篇 |
2020年 | 3篇 |
2019年 | 4篇 |
2018年 | 2篇 |
2017年 | 1篇 |
2016年 | 5篇 |
2014年 | 8篇 |
2013年 | 8篇 |
2012年 | 5篇 |
2011年 | 6篇 |
2010年 | 9篇 |
2009年 | 11篇 |
2008年 | 4篇 |
2007年 | 9篇 |
2006年 | 6篇 |
2005年 | 12篇 |
2004年 | 10篇 |
2003年 | 6篇 |
2002年 | 9篇 |
2001年 | 8篇 |
2000年 | 6篇 |
1999年 | 7篇 |
1998年 | 7篇 |
1997年 | 3篇 |
1996年 | 8篇 |
1995年 | 2篇 |
1994年 | 3篇 |
1993年 | 1篇 |
1990年 | 1篇 |
排序方式: 共有168条查询结果,搜索用时 15 毫秒
121.
We describe a Krylov subspace technique, based on incomplete orthogonalization of the Krylov vectors, which can be considered as a truncated version of GMRES. Unlike GMRES(m), the restarted version of GMRES, the new method does not require restarting. Like GMRES, it does not break down. Numerical experiments show that DQGMRES(k) often performs as well as the restarted GMRES using a subspace of dimension m=2k. In addition, the algorithm is flexible to variable preconditioning, i.e., it can accommodate variations in the preconditioner at every step. In particular, this feature allows the use of any iterative solver as a right-preconditioner for DQGMRES(k). This inner-outer iterative combination often results in a robust approach for solving indefinite non-Hermitian linear systems. 相似文献
122.
We construct a class of multigrid methods for convection–diffusion problems. The proposed algorithms use first order stable monotone schemes to precondition the second order standard Galerkin finite element discretization. To speed up the solution process of the lower order schemes, cross-wind-block reordering of the unknowns is applied. A V-cycle iteration, based on these algorithms, is then used as a preconditioner in GMRES. The numerical examples show that this method is convergent without imposing any constraint on the coarsest grid and the convergence of the preconditioned method is uniform. 相似文献
123.
124.
In Bai et al. (2013), a preconditioned modified HSS (PMHSS) method was proposed for a class of two-by-two block systems of linear equations. In this paper, the PMHSS method is modified by adding one more parameter in the iteration. Convergence of the modified PMHSS method is guaranteed. Theoretic analysis and numerical experiment show that the modification improves the PMHSS method. 相似文献
125.
The Generalized Minimal Residual Method (GMRES) is one of the significant methods for solving linear algebraic systems with nonsymmetric matrices. It minimizes the norm of the residual on the linear variety determined by the initial residual and then-th Krylov residual subspace and is therefore optimal, with respect to the size of the residual, in the class of Krylov subspace methods. One possible way of computing the GMRES approximations is based on constructing the orthonormal basis of the Krylov subspaces (Arnoldi basis) and then solving the transformed least squares problem. This paper studies the numerical stability of such formulations of GMRES. Our approach is based on the Arnoldi recurrence for the actually, i.e., in finite precision arithmetic, computed quantities. We consider the Householder (HHA), iterated modified Gram-Schmidt (IMGSA), and iterated classical Gram-Schmidt (ICGSA) implementations. Under the obvious assumption on the numerical nonsingularity of the system matrix, the HHA implementation of GMRES is proved backward stable in the normwise sense. That is, the backward error
for the approximation
is proportional to machine precision . Additionally, it is shown that in most cases the norm of the residual computed from the transformed least squares problem (Arnoldi residual) gives a good estimate of the true residual norm, until the true residual norm has reached the level A x.This work was supported by NSF contract Int921824. 相似文献
126.
We study the preconditioned iterative methods for the linear systems arising from the numerical solution of the multi-dimensional space fractional diffusion equations. A sine transform based preconditioning technique is developed according to the symmetric and skew-symmetric splitting of the Toeplitz factor in the resulting coefficient matrix. Theoretical analyses show that the upper bound of relative residual norm of the GMRES method when applied to the preconditioned linear system is mesh-independent which implies the linear convergence. Numerical experiments are carried out to illustrate the correctness of the theoretical results and the effectiveness of the proposed preconditioning technique. 相似文献
127.
Inexact Newton methods are variant of the Newton method in which each step satisfies only approximately the linear system (Ref. 1). The local convergence theory given by the authors of Ref. 1 and most of the results based on it consider the error terms as being provided only by the fact that the linear systems are not solved exactly. The few existing results for the general case (when some perturbed linear systems are considered, which in turn are not solved exactly) do not offer explicit formulas in terms of the perturbations and residuals. We extend this local convergence theory to the general case, characterizing the rate of convergence in terms of the perturbations and residuals.The Newton iterations are then analyzed when, at each step, an approximate solution of the linear system is determined by the following Krylov solvers based on backward error minimization properties: GMRES, GMBACK, MINPERT. We obtain results concerning the following topics: monotone properties of the errors in these Newton–Krylov iterates when the initial guess is taken 0 in the Krylov algorithms; control of the convergence orders of the Newton–Krylov iterations by the magnitude of the backward errors of the approximate steps; similarities of the asymptotical behavior of GMRES and MINPERT when used in a converging Newton method. At the end of the paper, the theoretical results are verified on some numerical examples. 相似文献
128.
一种灵活的混合GMRES算法 总被引:10,自引:1,他引:9
钟宝江 《高等学校计算数学学报》2001,23(3):261-272
1 引 言考虑线性方程组Ax =b (1 .1 )其中 A∈RN× N是非奇异的 .求解方程组 (1 .1 )的很多迭代方法都可归类于多项式法 ,即满足x(n) =x(0 ) +qn- 1 (A) r(0 ) ,degqn- 1 ≤ n -1这里 x(n) ,n≥ 0为第 n步迭代解 ,r(n) =b-Ax(n) 是对应的迭代残量 .等价地 ,r(n) =pn(A) r(0 ) ,degpn≤ n;pn(0 ) =1 (1 .2 )其中 pn(z) =1 -zqn- 1 (z)称为残量多项式 .或有r(n) -r(0 ) ∈ AKn(r(0 ) ,A)其中 Kn(v,A)≡span{ Aiv} n- 1 i=0 是对应于 v,A的 Krylov子空间 .对于非对称问题 ,可以用正交性条件r(n)⊥ AKn(r(0 ) ,A)来确定 (1 .2 )中的… 相似文献
129.
Gerhard Starke 《Numerical Linear Algebra with Applications》1996,3(5):351-367
The subject of this paper is to study the performance of multilevel preconditioning for nonsymmetric elliptic boundary value problems. In particular, a minimal residual method with respect to an appropriately scaled norm, measuring the size of the residual projections on all levels, is studied. This norm, induced by the multilevel splitting, is also the basis for a proper stopping criterion. Our analysis shows that the convergence rate of this minimal residual method using the multilevel preconditioner by Bramble, pasciak and Xu is bounded independently of the mesh-size. However, the convergence rate deteriorates with increasing size of the skew-symmetric part. Our numerical results show that by incorporating this into a multilevel cycle starting on the coarsest level, one can save fine-level-iterations and, therefore, computational work. 相似文献
130.
We introduce a deflation method that takes advantage of the IRA method, by extracting a GMRES solution from the Krylov basis
computed within the Arnoldi process of the IRA method itself. The deflation is well-suited because it is done with eigenvectors
associated to the eigenvalues that are closest to zero, which are approximated by IRA very quickly. By a slight modification,
we adapt it to the FOM algorithm, and then to GMRES enhanced by imposing constraints within the minimization condition. The
use of IRA enables us to reduce the number of matrix-vector products, while keeping a low storage.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献