首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   17篇
  免费   0篇
化学   4篇
力学   2篇
数学   10篇
物理学   1篇
  2023年   1篇
  2022年   1篇
  2014年   2篇
  2013年   1篇
  2012年   3篇
  2009年   1篇
  2008年   1篇
  2005年   1篇
  2003年   1篇
  2001年   1篇
  1999年   1篇
  1998年   2篇
  1994年   1篇
排序方式: 共有17条查询结果,搜索用时 203 毫秒
1.
求解非对称线性方程组的QMRGCGS方法   总被引:2,自引:1,他引:1  
1 引言 求解非对称线性方程组Ax=b的双共轭梯度方法(BCG)[3]和它的变形共轭梯度平方方法(CGS)[6]都有典型的不规则收敛行为,后来Freund和Nachtigal提出一种BCG类方法,即拟极小剩余方法(QMR)[7],用来补救BCG方法的收敛性并且产生了光滑的收敛曲线。然而,象BCG方法一样,QMR方法要用到系数矩阵A及其转置A~T与向量的乘积,为了解决这一问题,Freund提出TFQMR方法,此方法具有拟极小剩余性,同时不需用到A~T与向量的乘积。  相似文献   
2.
The Coherent Gradient Sensor (CGS) is extended to the optical differentiation of specular, diffracted wave fronts leading to the combined measurement of in- and out-of-plane displacement field gradients. A derivation of the underlying optical interference principles is presented along with an analysis of the effective instrument sensitivity. In order to demonstrate the capabilities of the technique, experimental measurements of crack-tip deformation fields were conducted under various loading conditions corresponding to mode-I, mode-II, and mixed mode near-tip crack fields. The experimental procedures and results of these tests are presented as validation of the technique.  相似文献   
3.
It is well-known that Bi-CG can be adapted so that the operations withA T can be avoided, and hybrid methods can be constructed in which it is attempted to further improve the convergence behaviour. Examples of this are CGS, Bi-CGSTAB, and the more general BiCGstab(l) method. In this paper it is shown that BiCGstab(l) can be implemented in different ways. Each of the suggested approaches has its own advantages and disadvantages. Our implementations allow for combinations of Bi-CG with arbitrary polynomial methods. The choice for a specific implementation can also be made for reasons of numerical stability. This aspect receives much attention. Various effects have been illustrated by numerical examples.  相似文献   
4.
This article is concerned with solving the high order Stein tensor equation arising in control theory. The conjugate gradient squared (CGS) method and the biconjugate gradient stabilized (BiCGSTAB) method are attractive methods for solving linear systems. Compared with the large-scale matrix equation, the equivalent tensor equation needs less storage space and computational costs. Therefore, we present the tensor formats of CGS and BiCGSTAB methods for solving high order Stein tensor equations. Moreover, a nearest Kronecker product preconditioner is given and the preconditioned tensor format methods are studied. Finally, the feasibility and effectiveness of the new methods are verified by some numerical examples.  相似文献   
5.
The method of Lanczos for solving systems of linear equations is implemented by using recurrence relationships between formal orthogonal polynomials. A drawback is that the computation of the coefficients of these recurrence relationships usually requires the use of the transpose of the matrix of the system. Due to the indirect addressing, this is a costly operation. In this paper, a new procedure for computing these coefficients is proposed. It is based on the recursive computation of the products of polynomials appearing in their expressions and it does not involve the transpose of the matrix. Moreover, our approach allows to implement simultaneously and at a low price a Lanczos-type product method such as the CGS or the BiCGSTAB. This revised version was published online in June 2006 with corrections to the Cover Date.  相似文献   
6.
Multigrid and iterative methods are used to reduce the solution time of the matrix equations which arise from the finite element (FE) discretisation of the time‐independent equations of motion of the incompressible fluid in turbulent motion. Incompressible flow is solved by using the method of reduce interpolation for the pressure to satisfy the Brezzi–Babuska condition. The kl model is used to complete the turbulence closure problem. The non‐symmetric iterative matrix methods examined are the methods of least squares conjugate gradient (LSCG), biconjugate gradient (BCG), conjugate gradient squared (CGS), and the biconjugate gradient squared stabilised (BCGSTAB). The multigrid algorithm applied is based on the FAS algorithm of Brandt, and uses two and three levels of grids with a ‘V‐cycling’ schedule. These methods are all compared to the non‐symmetric frontal solver. Copyright © 1999 John Wiley & Sons, Ltd.  相似文献   
7.
The electrodeposition mechanism of CuGaSe2 (CGS) thin films on ITO substrates has been investigated using cyclic voltammetry technique. The cyclic voltammetric study was performed in unitary Cu, Ga and Se systems, binary Cu–Se, Ga–Se systems and ternary Cu–Ga–Se system. The electrodeposition metallic Ga from Ga unitary electrolytes is impossible due to its low reduction potential. No reduction peak was found for the reduction of Ga3+ to Ga in the cyclic voltammogram of unitary system. However, in the cyclic voltammogram of ternary Cu–Ga–Se system, reduction peak at −0.6 V was observed with addition of GaCl3. Also, current density of the peak was increased with increasing concentration of GaCl3. It is corresponded to the formation of gallium selenides and/or copper–gallium–selenium compounds. The contents of Ga in the films were significantly changed from −0.4 V to −0.6 V. SEM and XRD analysis also showed that surface morphology and crystalline phase of films were significantly changed with increasing Ga content.  相似文献   
8.
We capitalize upon the known relationship between pairs of orthogonal and minimal residual methods (or, biorthogonal and quasi-minimal residual methods) in order to estimate how much smaller the residuals or quasi-residuals of the minimizing methods can be compared to those of the corresponding Galerkin or Petrov–Galerkin method. Examples of such pairs are the conjugate gradient (CG) and the conjugate residual (CR) methods, the full orthogonalization method (FOM) and the generalized minimal residual (GMRES) method, the CGNE and BiCG versions of applying CG to the normal equations, as well as the biconjugate gradient (BiCG) and the quasi-minimal residual (QMR) methods. Also the pairs consisting of the (bi)conjugate gradient squared (CGS) and the transpose-free QMR (TFQMR) methods can be added to this list if the residuals at half-steps are included, and further examples can be created easily.The analysis is more generally applicable to the minimal residual (MR) and quasi-minimal residual (QMR) smoothing processes, which are known to provide the transition from the results of the first method of such a pair to those of the second one. By an interpretation of these smoothing processes in coordinate space we deepen the understanding of some of the underlying relationships and introduce a unifying framework for minimal residual and quasi-minimal residual smoothing. This framework includes the general notion of QMR-type methods.  相似文献   
9.
《Analytical letters》2012,45(21-22):2183-2196
Abstract

A method for the simultaneous determination of CGS 10787B and its major, metabolite (CGS 12094) in plasma is described. The two compounds, and the internal standard (dichlorinated analog), are extracted from acidified plasma with ethyl acetate, taken to dryness, and reconstituted in chromatographic mobile phase. The analytes are determined automatically by high performance liquid chromatography in the reversed-phase mode as paired ions, using [N(Bu)4]+ as the counterion. The separation of the compounds is achieved on a 3u C-8 column, with detection at 254 nm.

Recovery and reproducibility assessments indicate good accuracy and precision over the range of 1.0 to 250 ug/ml for CGS 10787B and 1.0 to 100 ug/ml for CGS 12094.

The method has a limit of detection of 0.2 ug/ml for both compounds, and has been shown to be adequate for studying the disposition kinetics of CGS 10787B.  相似文献   
10.
With the aid of index functions, we re-derive the ML($n$)BiCGStab algorithm in [Yeung and Chan, SIAM J. Sci. Comput., 21 (1999), pp. 1263-1290] systematically. There are $n$ ways to define the ML($n$)BiCGStab residual vector. Each definition leads to a different ML($n$)BiCGStab algorithm. We demonstrate this by presenting a second algorithm which requires less storage. In theory, this second algorithm serves as a bridge that connects the Lanczos-based BiCGStab and the Arnoldi-based FOM while ML($n$)BiCG is a bridge connecting BiCG and FOM. We also analyze the breakdown situation from the probabilistic point of view and summarize some useful properties of ML($n$)BiCGStab. Implementation issues are also addressed.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号