Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Explicit preconditioned conjugate gradient schemes for solving biharmonic equations

Explicit preconditioned conjugate gradient schemes for solving biharmonic equations A new class of explicit preconditioning methods based on the concept of sparse approximate factorization procedures and inverse matrix techniques is introduced for solving biharmonic equations. Isomorphic methods in conunction with explicit preconditioned schemes based on approximate inverse matrix techniques are presented for the efficient solution of biharmonic equations. Application of the proposed method on linear systems is discussed and numerical results are given. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Engineering Computations: International Journal for Computer-Aided Engineering and Software Emerald Publishing

Explicit preconditioned conjugate gradient schemes for solving biharmonic equations

Loading next page...
 
/lp/emerald-publishing/explicit-preconditioned-conjugate-gradient-schemes-for-solving-eOWgLsaLtj

References (31)

Publisher
Emerald Publishing
Copyright
Copyright © 2000 MCB UP Ltd. All rights reserved.
ISSN
0264-4401
DOI
10.1108/02644400010313101
Publisher site
See Article on Publisher Site

Abstract

A new class of explicit preconditioning methods based on the concept of sparse approximate factorization procedures and inverse matrix techniques is introduced for solving biharmonic equations. Isomorphic methods in conunction with explicit preconditioned schemes based on approximate inverse matrix techniques are presented for the efficient solution of biharmonic equations. Application of the proposed method on linear systems is discussed and numerical results are given.

Journal

Engineering Computations: International Journal for Computer-Aided Engineering and SoftwareEmerald Publishing

Published: Mar 1, 2000

Keywords: Engineering; Computational methods

There are no references for this article.