Results 201 to 210 of about 66,000 (256)
A Facile Strategy for 3'-Terminal Functionalization of DNA and RNA via On-Column Conjugation with Integration into Tandem Oligonucleotide Synthesis. [PDF]
Saraya JS, O'Flaherty DK.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
WIREs Computational Statistics, 2001
AbstractThe conjugate gradient (CG) method for optimization and equation solving is described, along with three principal families of algorithms derived from it. In each case, a foundational CG algorithm is formulated mathematically and followed by a brief discussion of refinements and variants within its family.
Saul I. Gass, Carl M. Harris
openaire +2 more sources
AbstractThe conjugate gradient (CG) method for optimization and equation solving is described, along with three principal families of algorithms derived from it. In each case, a foundational CG algorithm is formulated mathematically and followed by a brief discussion of refinements and variants within its family.
Saul I. Gass, Carl M. Harris
openaire +2 more sources
Deconvolution by the conjugate gradient method
ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005Since it is practically difficult to generate and propagate an impulse, often a system is excited by a narrow time domain pulse. The output is recorded and then a numerical deconvolution is often done to extract the impulse response of the object.
Tapan K. Sarkar +3 more
openaire +1 more source
Complex conjugate gradient methods
Numerical Algorithms, 1993The paper is concerned with the solution of linear systems with non- singular complex matrices. A unified framework is presented from which various conjugate gradient-like methods for solving the above described systems are derived. The considered methods include both well-known methods and some new variants of these methods.
Pascal Joly, Gérard Meurant
openaire +2 more sources
Duality in conjugate gradient methods
Numerical Algorithms, 1999The authors present the reverse algorithms of \textit{Cs. J. Hegedüs} [Comput. Math. Appl. 21, No. 1, 71-85 (1991; Zbl 0727.65023)] in a new perspective and show how they are related to the more conventional algorithms if the latter is regarded as solving problems involving the original preconditioning matrices.
Broyden C. G., Foschi P.
openaire +3 more sources
2020
The conjugate gradient method was published by Hestenes and Stiefel in 1952, as a direct method for solving linear systems. Today its main use is as an iterative method for solving large sparse linear systems. On a test problem we show that it performs as well as the SOR method with optimal acceleration parameter, and we do not have to estimate any ...
Tom Lyche, Georg Muntingh, Øyvind Ryan
+4 more sources
The conjugate gradient method was published by Hestenes and Stiefel in 1952, as a direct method for solving linear systems. Today its main use is as an iterative method for solving large sparse linear systems. On a test problem we show that it performs as well as the SOR method with optimal acceleration parameter, and we do not have to estimate any ...
Tom Lyche, Georg Muntingh, Øyvind Ryan
+4 more sources
On Restart Procedures for the Conjugate Gradient Method
Numerical Algorithms, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu-Hong Dai, Li-Zhi Liao, Duan Li 0002
openaire +1 more source

