Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Numer Algor

Search In Journal Title:

Abbravation: Numerical Algorithms

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1002/zamm.19750550303

Search In DOI:

ISSN

1572-9265

Search In ISSN:
Search In Title Of Papers:

On approximated ILU and UGS preconditioning method

Authors: ZhongZhi Bai YuHong Ran Li Yuan
Publish Date: 2013/03/02
Volume: 65, Issue: 1, Pages: 43-68
PDF Link

Abstract

When the artificial compressibility method in conjunction with highorder upwind compact finite difference schemes is employed to discretize the steadystate incompressible NavierStokes equations in each pseudotime step we need to solve a structured system of linear equations approximately by for example a Krylov subspace method such as the preconditioned GMRES In this paper based on the special structure and concrete property of the linear system we construct a structured preconditioner for its coefficient matrix and estimate eigenvalue bounds of the correspondingly preconditioned matrix Numerical examples are given to illustrate the effectiveness of the proposed preconditioning methodsSupported by The Hundred Talent Project of Chinese Academy of Sciences The National Natural Science Foundation for Creative Research Groups No 11021101 The National Natural Science Foundation No 91118001 No 10972230 and No 11021101 and The National Basic Research Program No 2011CB309703 and No 2010CB731505 PR China

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. Correction of eigenvalues estimated by the Legendre–Gauss Tau method
  2. Design with L-splines
  3. Accelerated Landweber methods based on co-dilated orthogonal polynomials
  4. A small note on the scaling of symmetric positive definite semiseparable matrices
  5. Solitary wave solutions of the one-dimensional Boussinesq equations
  6. Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time
  7. Recursive self preconditioning method based on Schur complement for Toeplitz matrices
  8. A subspace conjugate gradient algorithm for large-scale unconstrained optimization
  9. The sparse cardinal sine decomposition and its application for fast numerical convolution
  10. A family of Steffensen type methods with seventh-order convergence
  11. On linearly related orthogonal polynomials in several variables
  12. Orthogonal polynomials—centroid of their zeroes
  13. Numerical methods for computing sensitivities for ODEs and DDEs
  14. The impact of parameter selection on the performance of an automatic adaptive code for solving reaction–diffusion equations in three dimensions
  15. A new subtraction-free formula for lower bounds of the minimal singular value of an upper bidiagonal matrix
  16. Extrapolation algorithms for solving nonlinear boundary integral equations by mechanical quadrature methods
  17. A global convergent derivative-free method for solving a system of non-linear equations
  18. A new constrained total variational deblurring model and its fast algorithm
  19. Numerical solution to generalized Lyapunov/Stein and rational Riccati equations in stochastic control
  20. Tracing the Pareto frontier in bi-objective optimization problems by ODE techniques
  21. A study of accelerated Newton methods for multiple polynomial roots
  22. A binary powering Schur algorithm for computing primary matrix roots
  23. Non-uniform exponential tension splines
  24. Nonmonotone line search methods with variable sample size
  25. Galerkin-Chebyshev spectral method and block boundary value methods for two-dimensional semilinear parabolic equations
  26. Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization
  27. A marching-on in time meshless kernel based solver for full-wave electromagnetic simulation
  28. Algorithms and software for total variation image reconstruction via first-order methods
Search Result: