Results 41 to 50 of about 888,833 (294)

A New Modified Conjugate Gradient for Nonlinear Minimization Problems

open access: yesScience Journal of University of Zakho, 2022
The conjugate gradient is a highly effective technique to solve the unconstrained nonlinear minimization problems and it is one of the most well-known methods. It has a lot of applications.
Hussein Ageel Khatab, Salah G. Sharef
doaj   +1 more source

A new hybrid conjugate gradient method for dynamic force reconstruction

open access: yesAdvances in Mechanical Engineering, 2019
A new hybrid conjugate gradient method is proposed in this article based on the gradient operator and applied to the structural dynamic load identification problem.
Linjun Wang   +4 more
doaj   +1 more source

Salmonella lipopolysaccharide‐containing supported lipid bilayers as platforms to study bacteriophage interactions

open access: yesFEBS Letters, EarlyView.
We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace   +6 more
wiley   +1 more source

A Novel hybridization of CG-techniques for Solving Unconstrained Optimization Problems

open access: yesWasit Journal for Pure Sciences
Conjugate gradient methods are an extremely helpful way for handling large scale non-linear optimization issues. In this paper, based on the three famous Dai-yuan (DY), Liu–Storey (LS)and Conjugate-Descent (CD) conjugate gradient methods, a new hybrid ...
Hawraz Jabbar
doaj   +1 more source

Generalized Nesterov Accelerated Conjugate Gradient Algorithm for a Compressively Sampled MR Imaging Reconstruction

open access: yesIEEE Access, 2020
To accelerate the scanning speed of magnetic resonance imaging (MRI) and improve the quality of magnetic resonance (MR) image reconstruction, a fast MRI technology based on compressed sensing is proposed.
Xiuhan Li   +4 more
doaj   +1 more source

Spectral CG Algorithm for Solving Fuzzy Non-linear Equations

open access: yesIraqi Journal for Computer Science and Mathematics, 2022
The non-linear conjugate gradient method is a very effective technique for addressing Large-Scale minimization problems, and it has a wide range of applications in Mathematics, Chemistry, Physics, Engineering, and Medicine, etc.
Mezher M. Abed   +2 more
doaj   +1 more source

Predict-and-Recompute Conjugate Gradient Variants [PDF]

open access: yesSIAM Journal on Scientific Computing, 2020
The standard implementation of the conjugate gradient algorithm suffers from communication bottlenecks on parallel architectures, due primarily to the two global reductions required every iteration. In this paper, we study conjugate gradient variants which decrease the runtime per iteration by overlapping global synchronizations, and in the case of ...
Tyler Chen, Erin Carson
openaire   +3 more sources

Investigating transcription factor dynamics in health and disease using FRAP

open access: yesFEBS Letters, EarlyView.
FRAP analysis of GFP‐tagged transcription factors reveals how molecular mobility and target engagement change in response to drug treatment. By combining live‐cell imaging, quantitative model fitting, and statistical analysis, this approach uncovers transcription factor dynamics linked to disease mechanisms, providing a powerful framework for ...
Kannan Govindaraj   +3 more
wiley   +1 more source

An imperfect conjugate gradient algorithm [PDF]

open access: yes, 1952
summary:A new biorthogonalization algorithm is defined which does not depend on the step-size used. The algorithm is suggested so as to minimize the total error after $n$ steps if imperfect steps are used.
Sloboda, Fridrich   +2 more
core   +1 more source

Conjugate Gradient Methods for Toeplitz Systems [PDF]

open access: yesSIAM Review, 1996
The use of preconditioned conjugate gradient methods to solve linear systems of equations with Toeplitz matrices is discussed. Using this iterative method, the complexity is reduced from \(O(n\log^2n)\) operations for fast direct Toeplitz solvers to \(O(n \log n)\).
Raymond H. Chan, Michael K. Ng 0001
openaire   +2 more sources

Home - About - Disclaimer - Privacy