Results 231 to 240 of about 1,731 (272)

Preconditioned conjugate gradient methods for boundary-domain integral method

Engineering Analysis with Boundary Elements, 1993
Abstract The paper deals with the iterative solution of systems of linear equations arising in viscous flow computation by the boundary-domain integral method (BDIM) with the subdomain technique. Three versions of conjugate gradient method — the bi-conjugate gradient method (bi-CG), conjugate gradients squared (CGS) and its variant bi-CGSTAB - are ...
Matjaž Hriberšek, Polde Škerget, Herbert Mang   +2 more
openaire   +1 more source

Conjugate Gradient Methods Memoryless BFGS Preconditioned

2020
Conjugate gradient methods are widely acknowledged to be among the most efficient and robust methods for solving the large-scale unconstrained nonlinear optimization ...
openaire   +1 more source

Conjugate gradient method with preconditioning by projector

International Journal of Computer Mathematics, 1988
Preconditioning of the conjugate gradient method by a conjugate projector has been suggested. We describe an algorithm and prove its correctness. An estimate of the preconditioning effect in terms of the gap between the invariant subspace of smooth eigenvectors of a matrix of original system and the complement of the range of the preconditioning ...
openaire   +1 more source

Aerodynamic shape optimization using preconditioned conjugate gradient methods

11th Computational Fluid Dynamics Conference, 1993
In an effort to further improve upon the latest advancements made in aerodynamic shape optimization procedures, a systematic study is performed to examine several current solution methodologies as applied to various aspects of the optimization procedure.
Burgreen, Greg W., Baysal, Oktay
openaire   +2 more sources

Efficient Polynomial Preconditioning for the Conjugate Gradient Method

SIAM Journal on Scientific and Statistical Computing, 1990
This paper formulates and compares procedures for reducing computation in carrying out m-step or polynomial preconditioning in the conjugate gradient method. These procedures are based on corresponding ones for one-step preconditioning given by Bank and Douglas [Appl. Numer. Math., 1(1985), pp. 489–492], Conrad and Wallach [Numer. Math., 27 (1979), pp.
S. C. Eisenstat, J. M. Ortega, C. T. Vaughan   +2 more
openaire   +1 more source

A Distributed Normalized Explicit Preconditioned Conjugate Gradient Method

Parallel Algorithms and Applications, 2004
A new parallel normalized explicit preconditioned conjugate gradient method in conjunction with normalized approximate inverse matrix techniques is presented for solving efficiently sparse linear systems on multi-computer systems. Application of the proposed method on a three dimensional boundary value problem is discussed and numerical results are ...
G.A. Gravvanis, K.M. Giannoutakis, N.M. Missirlis †   +2 more
openaire   +1 more source

Preconditioned conjugate gradient methods for solving electromagnetic problems

IEEE Transactions on Antennas and Propagation, 1987
It is shown that appropriately chosen preconditioners can significantly improve the convergence rate of the conjugate gradient (CG) algorithm as applied to electromagnetic problems. Preconditioners are constructed for the problems of scattering from frequency selective surfaces and scattering from infinite cylinders.
A. Kas, E. Yip
openaire   +1 more source

Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method

SIAM Journal on Scientific Computing, 2001
Summary: We describe new algorithms of the locally optimal block preconditioned conjugate gradient (LOBPCG) method for symmetric eigenvalue problems, based on a local optimization of a three-term recurrence, and suggest several other new methods. To be able to compare numerically different methods in the class, with different preconditioners, we ...
openaire   +1 more source

Least‐squares finite element method and preconditioned conjugate gradient solution

International Journal for Numerical Methods in Engineering, 1987
AbstractA least‐squares variational procedure for first‐order systems of differential equations and an approximate formulation based on finite elements are developed. Error estimates, a condition number bound and analysis of weighting factors are given.
Carey, G. F., Jiang, B. N.
openaire   +2 more sources

The preconditioned conjugate gradient method on the hypercube

Proceedings of the third conference on Hypercube concurrent computers and applications -, 1988
A parallel algorithm for solving the elliptic partial differential equation (PDE) is described in this paper through the finite difference method (FDM) The Concurrent Preconditioned Conjugate Gradient method is developed to optimize processor load balancing. This algorithm is evaluated on a hypercube-based concurrent machine, the Intel iPSC.
G. Abe, K. Hane
openaire   +1 more source