Cargando…
A link between the steepest descent method and fixed-point iterations
We will make a link between the steepest descent method for an unconstrained minimisation problem and fixed-point iterations for its Euler–Lagrange equation. In this context, we shall rediscover the preconditioned algebraic conjugate gradient method for the discretised problem. The benefit of the co...
Autor principal: | Heid, Pascal |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Berlin Heidelberg
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9813030/ https://www.ncbi.nlm.nih.gov/pubmed/36619368 http://dx.doi.org/10.1007/s11590-022-01867-9 |
Ejemplares similares
-
Steepest descent method for a class of nonlinear equations
por: Childume, C E, et al.
Publicado: (1998) -
Hadamard expansions and hyperasymptotic evaluation: an extension of the method of steepest descents
por: Paris, R B
Publicado: (2011) -
The q-G method : A q-version of the Steepest Descent method for global optimization
por: Soterroni, Aline C., et al.
Publicado: (2015) -
CASCADE_SCAN: mining signal transduction network from high-throughput data based on steepest descent method
por: Wang, Kai, et al.
Publicado: (2011) -
RASNIK Image Processing with a Steepest Ascent
por: Hashemi, K S, et al.
Publicado: (1995)