Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Conjugate gradient solvers

A solution is to use Krylov subspace methods, such as the conjugate gradient (CG) method, the biconjugate gradient (BiCG) [Pg.394]

These matrix multiplications can be avoided using a combination of the CG and BiCG algorithms to bypass construction of K [19]. In the first stage, the BiCG algorithm is used to solve the equation [Pg.395]


In CED, a number of different iterative solvers for linear algebraic systems have been applied. Two of the most successful and most widely used methods are conjugate gradient and multigrid methods. The basic idea of the conjugate gradient method is to transform the linear equation system Eq. (38) into a minimization problem... [Pg.166]

In contrast to the conjugate gradient method, the multigrid method is rather a general framework for iterative solvers than a specific method. The multigrid method exploits the fact that the iteration error... [Pg.167]

P 77] Simulation was done using CFD-ACE+ [55,163], The physical properties of water were assumed. Discretization with structured grids of 15 pm length was used. The first-order upwind scheme and conjugate gradient with preconditioning solver were applied. [Pg.247]

Algebraic equation solvers conjugate gradient Acceleration tools multigrid/block correction Parallelization technology speed-up efficiency... [Pg.234]

In the work of Lindborg et al [119], the resulting linear equation systems were solved with preconditioned Krylov subspace projection methods [166]. The Poisson equation was solved by a conjugate gradient (CG)-solver, while the other transport equations were solved using a bi-conjugate gradient (BCG)-solver which can handle also non-symmetric equations systems. The solvers were preconditioned with a Jacobi preconditioner. [Pg.1074]

The final system of equations is S3munetric, positive definite, hence the solution of such a system can be obtained in an efficient way using standard matrix solvers like conjugate gradient method. [Pg.1092]

The system of N(M + 1) equations is then solved by using standard nonlinear solvers such as the Newton-Raphson method or the conjugate-gradient minimization algorithm, both of which are described in Press et al. (1992). [Pg.64]

In our contribution, we address this aspect and describe numerical methods based on the use of efficient iterative solvers, which exploit the conjugate gradient (CG) method, its generalization and the space decomposition preconditioners. The efficiency of these solvers will be illustrated by the solution of elasticity and thermo-elasticity problems arising from the finite element analysis of selected benchmarks with computations performed on a PC cluster. The introduced ideas could be useful also for the solution of more complicated coupled problems. [Pg.395]

M-Shake This is Newton-iteration-based implementation of SHAKE, using (4.18)-(4.19) to solve Eqs. (4.27)-(4.29). Methods like this were first proposed by Ciccotti and Ryckaert [84] in the context of rigid body molecular dynamics. An extended discussion of such methods with reference to their convergence, implementation, in particular linear system solvers, and variants such as SHAKE-SOR (which uses the successive over-relaxation method) can be found in [25]. A conjugate gradient method can also be used [392]. [Pg.164]

Used as a direct problem solver to work with simplified conjugate-gradient method optimizer to solve for optimal gas channel width fraction, gas channel height, and thickness of gas diffusion layer... [Pg.642]

The Estimates, Derivatives and Search parameters can be changed to optimize the solution process. The Search parameter specifies which gradient search method to use the Newton method requires more memory but fewer iterations, the Conjugate method requires less memory but more iterations. The Derivatives parameter specifies how the gradients for the search are calculated the Central derivatives method requires more calculations but may be helpful if the Solver reports that it is unable to find a solution. The Estimates parameter determines the method by which new estimates of the coefficients are obtained from previous values the Quadratic method may improve results if the system is highly nonlinear. [Pg.232]


See other pages where Conjugate gradient solvers is mentioned: [Pg.988]    [Pg.393]    [Pg.394]    [Pg.1092]    [Pg.280]    [Pg.988]    [Pg.393]    [Pg.394]    [Pg.1092]    [Pg.280]    [Pg.51]    [Pg.101]    [Pg.166]    [Pg.149]    [Pg.296]    [Pg.258]    [Pg.8]    [Pg.93]    [Pg.260]    [Pg.1106]    [Pg.146]    [Pg.381]    [Pg.88]    [Pg.407]    [Pg.109]    [Pg.89]    [Pg.201]    [Pg.137]    [Pg.42]    [Pg.83]    [Pg.171]    [Pg.411]    [Pg.95]    [Pg.1262]    [Pg.1148]    [Pg.395]    [Pg.142]    [Pg.153]    [Pg.197]    [Pg.385]   


SEARCH



Conjugate gradient

Iterative linear solvers Conjugate Gradient

Iterative linear solvers Conjugate Gradient method

Solver

© 2024 chempedia.info