Results 261 to 270 of about 819,121 (316)
Some of the next articles are maybe not open access.

A New Conjugate Gradient Method for Moving Force Identification of Vehicle–Bridge System

Journal of Vibration Engineering & Technologies, 2022
Chengsheng Luo   +3 more
semanticscholar   +1 more source

Conjugate Gradient Methods

1994
In the following, A ∈ ℝ I x I and b ∈ ℝ I are real. We consider a system $$ Ax\, = \,b $$ (9.1.1) and assume that $$ A\,is\,positive\,definite. $$ (9.1.2) System (1) is associated with the function $$ F\left( x \right): = \,\frac{1}{2}\left\langle {Ax,\,x} \right\rangle \, - \,\left\langle {b,\,x} \right\rangle . $$ (9.1.3)
openaire   +1 more source

New Hybrid Conjugate Gradient and Broyden–Fletcher–Goldfarb–Shanno Conjugate Gradient Methods

Journal of Optimization Theory and Applications, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stanimirović, Predrag S.   +3 more
openaire   +2 more sources

A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications

Numerical Algorithms, 2021
Jianghua Yin   +4 more
semanticscholar   +1 more source

Conjugate Gradient-Type Methods

1993
This chapter highlights conjugate gradient-type methods. A large number of iterative methods for solving linear systems of equations can be derived as minimization methods. In the context of minimization, the Gauss–Seidel method is sometimes known as the method of univariate relaxation, because at each iteration, only a single variable is changed.
Gene Golub, James M. Ortega
openaire   +1 more source

Block conjugate gradient methods

Optimization Methods and Software, 1993
In this paper a comprehensive theory is attempted of methods of conjugate-gradient type where the matrix of coefficients may be definite, indefinite or nonsymmetric. The theory is based on ‘leveling’ some underlying quadratic function over a linear manifold rather than just a straight line.
openaire   +1 more source

Other Conjugate Gradient Methods

2020
As already seen, the conjugate gradient algorithms presented so far use some principles based on: hybridization or modifications of the standard schemes, the memoryless or the scaled memoryless BFGS preconditioned or the three-term concept. The corresponding conjugate gradient algorithms are defined by the descent condition, the “pure” conjugacy or the
openaire   +1 more source

A conjugate gradient iterative method

Computers & Fluids, 1981
Abstract A strongly implicit pre-conditioned form of the conjugate gradient method is considered. The resulting iterative technique is applicable for sparse systems of difference equations arising from boundary value problems. The method is used to solve two- and three-dimensional potential flows. In addition, it is extended to a 2 x 2 coupled system
P.K. Khosla, S.G. Rubin
openaire   +1 more source

Standard Conjugate Gradient Methods

2020
The purpose of this chapter is to present the standard conjugate gradient algorithms as well as their convergence for solving unconstrained optimization problems.
openaire   +1 more source

Home - About - Disclaimer - Privacy