Illustration of iterative linear solver behavior on simple 1D and 2D problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2015

Illustration of iterative linear solver behavior on simple 1D and 2D problems

Nicolas Ray
Dmitry Sokolov

Abstract

In geometry processing, numerical optimization methods often involve solving sparse linear systems of equations. These linear systems have a structure that strongly resembles to adjacency graphs of the underlying mesh. We observe how classic linear solvers behave on this specific type of problems. For the sake of simplicity, we minimise either the squared gradient or the squared Laplacian, evaluated by finite differences on a regular 1D or 2D grid. We observed the evolution of the solution for both energies, in 1D and 2D, and with different solvers: Jacobi, Gauss-Seidel, SSOR (Symmetric successive over-relaxation) and CG (conjugate gradient [She94]). Plotting results at different iterations allows to have an intuition of the behavior of these classic solvers.
Fichier principal
Vignette du fichier
CGbehavior.pdf (4.51 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01211410 , version 1 (05-10-2015)

Licence

Public Domain

Identifiers

Cite

Nicolas Ray, Dmitry Sokolov. Illustration of iterative linear solver behavior on simple 1D and 2D problems. [Research Report] LORIA. 2015. ⟨hal-01211410⟩
101 View
75 Download

Altmetric

Share

Gmail Facebook X LinkedIn More