Title
On Preconditioned Iterative Methods for Burgers Equations
Abstract
We study the Newton method and a fixed-point method for solving the system of nonlinear equations arising from the Sinc-Galerkin discretization of the Burgers equations. In each step of the Newton method or the fixed-point method, a structured subsystem of linear equations is obtained and needs to be solved numerically. In this paper, preconditioning techniques are applied to solve such linear subsystems. The bounds for eigenvalues of the preconditioned matrices are derived and numerical examples are given to illustrate the effectiveness of the proposed methods. We also find that a combination of the Newton/fixed-point iteration with the preconditioned GMRES method is quite efficient for the Sinc-Galerkin discretization of the Burgers equations.
Year
DOI
Venue
2007
10.1137/060649124
SIAM J. Scientific Computing
Keywords
Field
DocType
preconditioned iterative methods,preconditioned matrix,burgers equations,preconditioned gmres method,burgers equation,linear subsystems,linear equation,fixed-point method,fixed-point iteration,newton method,sinc-galerkin discretization,preconditioning,iterative method,galerkin method,scientific computation,iteration,numerical analysis,eigenvalue
Discretization,Mathematical optimization,Nonlinear system,Generalized minimal residual method,Mathematical analysis,Iterative method,Burgers' equation,Local convergence,Numerical analysis,Mathematics,Newton's method
Journal
Volume
Issue
ISSN
29
1
1064-8275
Citations 
PageRank 
References 
16
0.71
9
Authors
3
Name
Order
Citations
PageRank
Zhong-Zhi Bai12321148.59
Yu-Mei Huang225811.83
Ng Michael34231311.70