Volker Grimm
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Volker Grimm has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Gilles Reinout Willem Quispel
Department of Mathematics La Trobe University 3086 Bundoora VIC Australia
6 shared publications - Robert I. McLachlan
School of Mathematical and Computational Sciences, Massey University, Palmerston North, New Zealand
3 shared publications Tanja Göckler
3 shared publications- Brynjulf Owren
Department of Mathematical Sciences Institutt for matematiske fag Norwegian University of Science and Technology 7491 Trondheim Norway
2 shared publications - David I. McLaren
Department of Mathematics La Trobe University 3083 Bundoora VIC Australia
2 shared publications Marlis Hochbruck
2 shared publications
Latest Publications
- Open Access
- 6 January 2024
- Published by Springer Nature in Numerical Algorithms
- Vol. 96 (3) , 1189-1220
Discrete gradients in short-range molecular dynamics simulations
Discrete gradients (DG) or more exactly discrete gradient methods are time integration schemes that are custom-built to preserve first integrals or Lyapunov functions of a given ordinary differential equation (ODE). In conservative molecular dynamics (MD) simulations, the energy of the system is constant and therefore a first integral of motion. Hence, discrete gradient methods seem to be a natural choice as an integration scheme in conservative molecular dynamics simulations.
- 6 January 2024
- Published by Springer Nature in Numerical Algorithms
- Vol. 96 (3) , 1189-1220
Open AccessDiscrete gradients in short-range molecular dynamics simulations
Discrete gradients (DG) or more exactly discrete gradient methods are time integration schemes that are custom-built to preserve first integrals or Lyapunov functions of a given ordinary differential equation (ODE). In conservative molecular dynamics (MD) simulations, the energy of the system is constant and therefore a first integral of motion. Hence, discrete gradient methods seem to be a natural choice as an integration scheme in conservative molecular dynamics simulations.
- Open Access
Discrete gradients in short-range molecular dynamics simulations
Discrete gradients (DG) or more exactly discrete gradient methods are time integration schemes that are custom-built to preserve first integrals or Lyapunov functions of a given ordinary differential equation (ODE). In conservative molecular dynamics (MD) simulations, the energy of the system is constant and therefore a first integral of motion. Hence, discrete gradient methods seem to be a natural choice as an integration scheme in conservative molecular dynamics simulations.
Open AccessDiscrete gradients in short-range molecular dynamics simulations
Discrete gradients (DG) or more exactly discrete gradient methods are time integration schemes that are custom-built to preserve first integrals or Lyapunov functions of a given ordinary differential equation (ODE). In conservative molecular dynamics (MD) simulations, the energy of the system is constant and therefore a first integral of motion. Hence, discrete gradient methods seem to be a natural choice as an integration scheme in conservative molecular dynamics simulations.
- Open Access
- 15 November 2019
- Published by IOP Publishing in Inverse Problems
- Vol. 36 (1) , 015008
A conjugate-gradient-type rational Krylov subspace method for ill-posed problems
Conjugated gradients on the normal equation (CGNE) is a popular method to regularise linear inverse problems. The idea of the method can be summarised as minimising the residuum over a suitable Krylov subspace. It is shown that using the same idea for the shift-and-invert rational Krylov subspace yields an order-optimal regularisation scheme.
- 15 November 2019
- Published by IOP Publishing in Inverse Problems
- Vol. 36 (1) , 015008
Open AccessA conjugate-gradient-type rational Krylov subspace method for ill-posed problems
Conjugated gradients on the normal equation (CGNE) is a popular method to regularise linear inverse problems. The idea of the method can be summarised as minimising the residuum over a suitable Krylov subspace. It is shown that using the same idea for the shift-and-invert rational Krylov subspace yields an order-optimal regularisation scheme.
- 28 June 2017
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 50 (29) , 295201
Discrete gradient methods for solving variational image regularisation models
Discrete gradient methods are well-known methods of geometric numerical integration, which preserve the dissipation of gradient systems. In this paper we show that this property of discrete gradient methods can be interesting in the context of variational models for image processing, that is where the processed image is computed as a minimiser of an energy functional. Numerical schemes for computing minimisers of such energies are desired to inherit the dissipative property of the gradient system associated to the energy and consequently guarantee a monotonic decrease of the energy along iterations, avoiding situations in which more computational work might lead to less optimal solutions. Under appropriate smoothness assumptions on the energy functional we prove that discrete gradient methods guarantee a monotonic decrease of the energy towards stationary states, and we promote their use in image processing by exhibiting experiments with convex and non-convex variational models for image deblurring, denoising, and inpainting.
- 28 June 2017
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 50 (29) , 295201
Discrete gradient methods for solving variational image regularisation models
Discrete gradient methods are well-known methods of geometric numerical integration, which preserve the dissipation of gradient systems. In this paper we show that this property of discrete gradient methods can be interesting in the context of variational models for image processing, that is where the processed image is computed as a minimiser of an energy functional. Numerical schemes for computing minimisers of such energies are desired to inherit the dissipative property of the gradient system associated to the energy and consequently guarantee a monotonic decrease of the energy along iterations, avoiding situations in which more computational work might lead to less optimal solutions. Under appropriate smoothness assumptions on the energy functional we prove that discrete gradient methods guarantee a monotonic decrease of the energy towards stationary states, and we promote their use in image processing by exhibiting experiments with convex and non-convex variational models for image deblurring, denoising, and inpainting.
- 1 May 2017
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 316, 133-142
Acceleration of contour integration techniques by rational Krylov subspace methods
- 1 May 2017
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 316, 133-142
Acceleration of contour integration techniques by rational Krylov subspace methods
- 9 March 2017
- Published by Oxford University Press (OUP) in IMA Journal of Numerical Analysis
- Vol. 38 (1) , 57-74
Closing the gap between trigonometric integrators and splitting methods for highly oscillatory differential equations
An error analysis of symmetric trigonometric integrators applied to highly oscillatory linear second-order differential equations is given. Second-order convergence is shown uniformly in the high frequencies under a finite-energy condition on the exact solution. The main novelty is the concept of the proof itself, which is based on the interpretation of trigonometric integrators as splitting methods for averaged differential equations. This allows one to combine techniques for splitting methods with those for trigonometric integrators. For the bound of the global error, cancellations in the error accumulation have to be studied carefully.
- 9 March 2017
- Published by Oxford University Press (OUP) in IMA Journal of Numerical Analysis
- Vol. 38 (1) , 57-74
Closing the gap between trigonometric integrators and splitting methods for highly oscillatory differential equations
An error analysis of symmetric trigonometric integrators applied to highly oscillatory linear second-order differential equations is given. Second-order convergence is shown uniformly in the high frequencies under a finite-energy condition on the exact solution. The main novelty is the concept of the proof itself, which is based on the interpretation of trigonometric integrators as splitting methods for averaged differential equations. This allows one to combine techniques for splitting methods with those for trigonometric integrators. For the bound of the global error, cancellations in the error accumulation have to be studied carefully.
- 1 January 2017
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 55 (3) , 1483-1504
Automatic Smoothness Detection of the Resolvent Krylov Subspace Method for the Approximation of $C_0$-Semigroups
The resolvent Krylov subspace method builds approximations to operator functions $f(A)$ times a vector $v$. For the semigroup and related operator functions, this method is proved to possess the favorable property that the convergence is automatically faster when the vector $v$ is smoother. The user of the method does not need to know the presented theory and alterations of the method are not necessary in order to adapt to the (possibly unknown) smoothness of $v$. The findings are illustrated by numerical experiments.- 1 January 2017
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 55 (3) , 1483-1504
Automatic Smoothness Detection of the Resolvent Krylov Subspace Method for the Approximation of $C_0$-Semigroups
The resolvent Krylov subspace method builds approximations to operator functions $f(A)$ times a vector $v$. For the semigroup and related operator functions, this method is proved to possess the favorable property that the convergence is automatically faster when the vector $v$ is smoother. The user of the method does not need to know the presented theory and alterations of the method are not necessary in order to adapt to the (possibly unknown) smoothness of $v$. The findings are illustrated by numerical experiments.- Open Access
The use of discrete gradient methods for total variation type regularization problems in image processing
Discrete gradient methods are well-known methods of Geometric Numerical Integration, which preserve the dissipation of gradient systems. The preservation of the dissipation of a system is an important feature in numerous image processing tasks. We promote the use of discrete gradient methods in image processing by exhibiting experiments with nonlinear total variation (TV) deblurring, denoising, and inpainting.
Open AccessThe use of discrete gradient methods for total variation type regularization problems in image processing
Discrete gradient methods are well-known methods of Geometric Numerical Integration, which preserve the dissipation of gradient systems. The preservation of the dissipation of a system is an important feature in numerous image processing tasks. We promote the use of discrete gradient methods in image processing by exhibiting experiments with nonlinear total variation (TV) deblurring, denoising, and inpainting.
- 1 January 2014
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 35 (4) , 1467-1489
Uniform Approximation of $\varphi$-Functions in Exponential Integrators by a Rational Krylov Subspace Method with Simple Poles
We consider the approximation of the matrix $\varphi$-functions that appear in exponential integrators for stiff systems of differential equations. For stiff systems, the field-of-values of the occurring matrices is large and lies somewhere in the left complex half-plane. In order to obtain an efficient method uniformly for all matrices with a field-of-values in the left complex half-plane, we consider the approximation by a rational Krylov subspace method with equidistant poles of order one on the line $\mbox{Re}\,z = \gamma > 0$. We present error bounds that predict a faster convergence rate as for the resolvent Krylov subspace approximation using a single repeated pole at $\gamma > 0$. Poles of order one allow moreover for a parallel implementation of the corresponding rational Krylov subspace decomposition. We analyze the convergence of the proposed rational Krylov subspace method and present numerical experiments that illustrate our results.- 1 January 2014
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 35 (4) , 1467-1489
Uniform Approximation of $\varphi$-Functions in Exponential Integrators by a Rational Krylov Subspace Method with Simple Poles
We consider the approximation of the matrix $\varphi$-functions that appear in exponential integrators for stiff systems of differential equations. For stiff systems, the field-of-values of the occurring matrices is large and lies somewhere in the left complex half-plane. In order to obtain an efficient method uniformly for all matrices with a field-of-values in the left complex half-plane, we consider the approximation by a rational Krylov subspace method with equidistant poles of order one on the line $\mbox{Re}\,z = \gamma > 0$. We present error bounds that predict a faster convergence rate as for the resolvent Krylov subspace approximation using a single repeated pole at $\gamma > 0$. Poles of order one allow moreover for a parallel implementation of the corresponding rational Krylov subspace decomposition. We analyze the convergence of the proposed rational Krylov subspace method and present numerical experiments that illustrate our results.- 1 January 2013
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 35 (3) , A1376-A1397
Residual, Restarting, and Richardson Iteration for the Matrix Exponential
A well-known problem in computing some matrix functions iteratively is the lack of a clear, commonly accepted residual notion. An important matrix function for which this is the case is the matrix exponential. Suppose the matrix exponential of a given matrix times a given vector has to be computed. We develop the approach of Druskin, Greenbaum, and Knizhnerman [SIAM J. Sci. Comput., 19 (1998), pp. 38--54] and interpret the sought-after vector as the value of a vector function satisfying the linear system of ordinary differential equations (ODEs) whose coefficients form the given matrix. The residual is then defined with respect to the initial value problem for this ODE system. The residual introduced in this way can be seen as a backward error. We show how the residual can be computed efficiently within several iterative methods for the matrix exponential. This resolves the question of reliable stopping criteria for these methods. Further, we show that the residual concept can be used to construct new residual-based iterative methods. In particular, a variant of the Richardson method for the new residual appears to provide an efficient way to restart Krylov subspace methods for evaluating the matrix exponential.
- 1 January 2013
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 35 (3) , A1376-A1397
Residual, Restarting, and Richardson Iteration for the Matrix Exponential
A well-known problem in computing some matrix functions iteratively is the lack of a clear, commonly accepted residual notion. An important matrix function for which this is the case is the matrix exponential. Suppose the matrix exponential of a given matrix times a given vector has to be computed. We develop the approach of Druskin, Greenbaum, and Knizhnerman [SIAM J. Sci. Comput., 19 (1998), pp. 38--54] and interpret the sought-after vector as the value of a vector function satisfying the linear system of ordinary differential equations (ODEs) whose coefficients form the given matrix. The residual is then defined with respect to the initial value problem for this ODE system. The residual introduced in this way can be seen as a backward error. We show how the residual can be computed efficiently within several iterative methods for the matrix exponential. This resolves the question of reliable stopping criteria for these methods. Further, we show that the residual concept can be used to construct new residual-based iterative methods. In particular, a variant of the Richardson method for the new residual appears to provide an efficient way to restart Krylov subspace methods for evaluating the matrix exponential.