Implicit surface reconstruction of 3D objects: Preconditioned iterative methods for the CSRBF-type linear systems

2005 ◽  
Vol 89 (4) ◽  
pp. 11-20
Author(s):  
Taku Itoh ◽  
Takashi Kitagawa ◽  
Susumu Nakata
Keyword(s):  
Linear Systems ◽  
Iterative Methods ◽  
Surface Reconstruction ◽  
Implicit Surface ◽  
3D Objects ◽  
Preconditioned Iterative ◽  
Preconditioned Iterative Methods

scholarly journals A Comparison of Two Equivalent Real Formulations for Complex-Valued Linear Systems Part 2: Results

2003 ◽  
Vol 1 (4) ◽  
Author(s):  
Abnita Munankarmy ◽  
Michael Heroux
Keyword(s):  
Linear Systems ◽  
Iterative Methods ◽  
Complex Plane ◽  
Spectral Properties ◽  
Complex Problem ◽  
Linear Solver ◽  
The Real ◽  
Preconditioned Iterative ◽  
Preconditioned Iterative Methods ◽  
Complex Valued

Many iterative linear solver packages focus on real-valued systems and do not deal well with complex-valued systems, even though preconditioned iterative methods typically apply to both real and complex-valued linear systems. Instead, commonly available packages such as PETSc and Aztec tend to focus on the real-valued systems, while complex-valued systems are seen as a late addition. At the same time, by changing the complex problem into an equivalent real formulation (ERF), a real valued solver can be used. In this paper we consider two ERF’s that can be used to solve complex-valued linear systems. We investigate the spectral properties of each and show how each can be preconditioned to move eigenvalues in a cloud around the point (1,0) in the complex plane. Finally, we consider an interleaved formulation, combining each of the previously mentioned approaches, and show that the interleaved form achieves a better outcome than either separate ERF. [This article is the second part of a sequence of reports. See the December 2002 issue for Part 1—Editor.]

Preconditioned Iterative Methods for Two-Dimensional Space-Fractional Diffusion Equations

2015 ◽  
Vol 18 (2) ◽  
pp. 469-488 ◽  
Author(s):  
Xiao-Qing Jin ◽  
Fu-Rong Lin ◽  
Zhi Zhao
Keyword(s):  
Linear Systems ◽  
Iterative Methods ◽  
Dimensional Space ◽  
Fractional Diffusion ◽  
Second Order ◽  
Diffusion Equations ◽  
Two Dimensional ◽  
Fractional Diffusion Equations ◽  
Preconditioned Iterative ◽  
Preconditioned Iterative Methods

AbstractIn this paper, preconditioned iterative methods for solving two-dimensional space-fractional diffusion equations are considered. The fractional diffusion equation is discretized by a second-order finite difference scheme, namely, the Crank-Nicolson weighted and shifted Grünwald difference (CN-WSGD) scheme proposed in [W. Tian, H. Zhou and W. Deng, A class of second order difference approximation for solving space fractional diffusion equations, Math. Comp., 84 (2015) 1703-1727]. For the discretized linear systems, we first propose preconditioned iterative methods to solve them. Then we apply the D’Yakonov ADI scheme to split the linear systems and solve the obtained splitting systems by iterative methods. Two preconditioned iterative methods, the preconditioned generalized minimal residual (preconditioned GMRES) method and the preconditioned conjugate gradient normal residual (preconditioned CGNR) method, are proposed to solve relevant linear systems. By fully exploiting the structure of the coefficient matrix, we design two special kinds of preconditioners, which are easily constructed and are able to accelerate convergence of iterative solvers. Numerical results show the efficiency of our preconditioners.

Convergence Analysis of Preconditioned SSOR Iterative Method for Linear Systems

2014 ◽  
Vol 644-650 ◽  
pp. 1988-1991
Author(s):  
Ting Zhou
Keyword(s):  
Linear System ◽  
Iterative Method ◽  
Convergence Analysis ◽  
Linear Systems ◽  
Iterative Methods ◽  
Convergence Result ◽  
Numerical Example ◽  
Preconditioned Iterative ◽  
Preconditioned Iterative Methods

For solving the linear system, different preconditioned iterative methods have been proposed by many authors. In this paper, we present preconditioned SSOR iterative method for solving the linear systems. Meanwhile, we apply the preconditioner to H-matrix and obtain the convergence result. Finally, a numerical example is also given to illustrate our results.

scholarly journals A modified AOR-type iterative method for L-matrix linear systems

2007 ◽  
Vol 49 (2) ◽  
pp. 281-292 ◽  
Author(s):  
Shiliang Wu ◽  
Tingzhu Huang
Keyword(s):  
Iterative Method ◽  
Linear Systems ◽  
Iterative Methods ◽  
Convergence Rates ◽  
Comparison Theorems ◽  
Iterative Schemes ◽  
Seidel Method ◽  
Comparison Results ◽  
Preconditioned Iterative ◽  
Preconditioned Iterative Methods

AbstractBoth Evans et al. and Li et al. have presented preconditioned methods for linear systems to improve the convergence rates of AOR-type iterative schemes. In this paper, we present a new preconditioner. Some comparison theorems on preconditioned iterative methods for solving L-matrix linear systems are presented. Comparison results and a numerical example show that convergence of the preconditioned Gauss-Seidel method is faster than that of the preconditioned AOR iterative method.

Sign in / Sign up

Export Citation Format

Share Document