Conjugate gradient algorithm and fractals
From MaRDI portal
Summary: This work is an extension of the survey on Cayley's problem in case where the conjugate gradient method is used. We show that for certain values of parameters, this method produces beautiful fractal structures.
Recommendations
Cites work
- A new approach to variable metric algorithms
- A Rapidly Convergent Descent Method for Minimization
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- scientific article; zbMATH DE number 88930 (Why is no real title available?)
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- scientific article; zbMATH DE number 1994007 (Why is no real title available?)
- scientific article; zbMATH DE number 3407464 (Why is no real title available?)
- On the quadratic mapping \(z\rightarrow z^{2}-\mu \) for complex \(\mu \) and \(z\): the fractal structure of its set, and scaling
This page was built for publication: Conjugate gradient algorithm and fractals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2491484)