Christiaan C. Stolk
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
Christiaan C. Stolk has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
Maarten V. de Hoop
5 shared publicationsWilliam W. Symes
Rice University, Department of Computational and Applied Mathematics, The Rice Inversion Project, Houston, Texas, U.S.A.
4 shared publications- Samir Kumar Bhowmik
Department of Mathematics , University of Dhaka , Dhaka , Bangladesh , du.ac.bd
2 shared publications - William Woodbury Symes
Department of Computational and Applied Mathematics, Rice University, Houston, TX 77251, United States of America
2 shared publications - Alessandro Sbrizzi
Department of Radiotherapy, Computational Imaging Group for MR Therapy and Diagnostics, University Medical Center Utrecht, CX Utrecht, The Netherlands
1 shared publication - Bob van Den Bergen
Department of Radiotherapy, University Medical Center Utrecht, Utrecht, the Netherlands
1 shared publication
Latest Publications
- Open Access
A two-grid method with dispersion matching for finite-element Helmholtz problems
This work is about a new two-level solver for Helmholtz equations discretized by finite elements. The method is inspired by two-grid methods for finite-difference Helmholtz problems as well as by previous work on two-level domain-decomposition methods. For the coarse-level discretization, a compact-stencil finite-difference method is used that minimizes dispersion errors. The smoother involves a domain-decomposition solver applied to a complex-shifted Helmholtz operator. Local Fourier analysis shows the method is convergent if the number of degrees of freedom per wavelength is larger than some lower bound that depends on the order, e.g. more than 8 for order 4. In numerical tests, with problem sizes up to 80 wavelengths, convergence was fast, and almost independent of problem size unlike what is observed for conventional methods. Analysis and comparison with dispersion-error data shows that, for good convergence of a two-grid method for Helmholtz problems, it is essential that fine- and coarse-level dispersion relations closely match.
Open AccessA two-grid method with dispersion matching for finite-element Helmholtz problems
This work is about a new two-level solver for Helmholtz equations discretized by finite elements. The method is inspired by two-grid methods for finite-difference Helmholtz problems as well as by previous work on two-level domain-decomposition methods. For the coarse-level discretization, a compact-stencil finite-difference method is used that minimizes dispersion errors. The smoother involves a domain-decomposition solver applied to a complex-shifted Helmholtz operator. Local Fourier analysis shows the method is convergent if the number of degrees of freedom per wavelength is larger than some lower bound that depends on the order, e.g. more than 8 for order 4. In numerical tests, with problem sizes up to 80 wavelengths, convergence was fast, and almost independent of problem size unlike what is observed for conventional methods. Analysis and comparison with dispersion-error data shows that, for good convergence of a two-grid method for Helmholtz problems, it is essential that fine- and coarse-level dispersion relations closely match.
- Open Access
- 18 September 2025
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 51 (5) , 1-30
A two-grid method with dispersion matching for finite-element Helmholtz problems
This work is about a new two-level solver for Helmholtz equations discretized by finite elements. The method is inspired by two-grid methods for finite-difference Helmholtz problems as well as by previous work on two-level domain-decomposition methods. For the coarse-level discretization, a compact-stencil finite-difference method is used that minimizes dispersion errors. The smoother involves a domain-decomposition solver applied to a complex-shifted Helmholtz operator. Local Fourier analysis shows the method is convergent if the number of degrees of freedom per wavelength is larger than some lower bound that depends on the order, e.g., more than 8 for order 4. In numerical tests, with problem sizes up to 80 wavelenghts, convergence was fast, and almost independent of problem size unlike what is observed for conventional methods. Analysis and comparison with dispersion-error data shows that, for good convergence of a two-grid method for Helmholtz problems, it is essential that fine- and coarse-level dispersion relations closely match.
- 18 September 2025
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 51 (5) , 1-30
Open AccessA two-grid method with dispersion matching for finite-element Helmholtz problems
This work is about a new two-level solver for Helmholtz equations discretized by finite elements. The method is inspired by two-grid methods for finite-difference Helmholtz problems as well as by previous work on two-level domain-decomposition methods. For the coarse-level discretization, a compact-stencil finite-difference method is used that minimizes dispersion errors. The smoother involves a domain-decomposition solver applied to a complex-shifted Helmholtz operator. Local Fourier analysis shows the method is convergent if the number of degrees of freedom per wavelength is larger than some lower bound that depends on the order, e.g., more than 8 for order 4. In numerical tests, with problem sizes up to 80 wavelenghts, convergence was fast, and almost independent of problem size unlike what is observed for conventional methods. Analysis and comparison with dispersion-error data shows that, for good convergence of a two-grid method for Helmholtz problems, it is essential that fine- and coarse-level dispersion relations closely match.
- Open Access
- 15 February 2025
- Published by Springer Nature in Optimization and Engineering
- Vol. 26 (4) , 2373-2400
Inversion of impact-echo data using a shape optimization approach
For the thickness measurement of refractory structures, the impact-echo measurement is one of the methods being used. This method is especially suited for the cases where high frequencies cannot be used due to the high damping and scattering in the materials. The data gathered with this method are often processed using a one-dimensional approach, which works well for simple layered structures. However, when the geometry is more complex, the thickness of the material needs to be estimated, as well as the shape of the interface. In this paper a method for inversion of impact-echo data in a two-dimensional setting is presented using multiple transducers. The algorithm was implemented using Fenics finite element software. The software is used to solve the elastic wave equation and the dolfin-adjoint toolbox is used for efficient computation of the shape gradient. In the paper, the algorithm is tested on two common erosion profiles. These examples show that, under reasonable initial assumptions, the solution converges close to the shape of the true interface. In practice, it is convenient to use a low number of sensors; for the two cases, a numerical experiment is carried out to determine the minimum number of sources required to arrive at a good result. The robustness of the algorithm is tested by adding roughness to the interface and by superimposing noise on the reference signals. The last experiment investigates how the solutions change as the number of samples increases.
- 15 February 2025
- Published by Springer Nature in Optimization and Engineering
- Vol. 26 (4) , 2373-2400
Open AccessInversion of impact-echo data using a shape optimization approach
For the thickness measurement of refractory structures, the impact-echo measurement is one of the methods being used. This method is especially suited for the cases where high frequencies cannot be used due to the high damping and scattering in the materials. The data gathered with this method are often processed using a one-dimensional approach, which works well for simple layered structures. However, when the geometry is more complex, the thickness of the material needs to be estimated, as well as the shape of the interface. In this paper a method for inversion of impact-echo data in a two-dimensional setting is presented using multiple transducers. The algorithm was implemented using Fenics finite element software. The software is used to solve the elastic wave equation and the dolfin-adjoint toolbox is used for efficient computation of the shape gradient. In the paper, the algorithm is tested on two common erosion profiles. These examples show that, under reasonable initial assumptions, the solution converges close to the shape of the true interface. In practice, it is convenient to use a low number of sensors; for the two cases, a numerical experiment is carried out to determine the minimum number of sources required to arrive at a good result. The robustness of the algorithm is tested by adding roughness to the interface and by superimposing noise on the reference signals. The last experiment investigates how the solutions change as the number of samples increases.
- Open Access
A time-domain preconditioner for the Helmholtz equation
Time-harmonic solutions to the wave equation can be computed in the frequency or in the time domain. In the frequency domain, one solves a discretized Helmholtz equation, while in the time domain, the periodic solutions to a discretized wave equation are sought, e.g. by simulating for a long time with a time-harmonic forcing term. Disadvantages of the time-domain method are that the solutions are affected by temporal discretization errors and that the spatial discretization cannot be freely chosen, since it is inherited from the time-domain scheme. In this work we address these issues. Given an indefinite linear system satisfying certain properties, a matrix recurrence relation is constructed, such that in the limit the exact discrete solution is obtained. By iterating a large, finite number of times, an approximate solution is obtained, similarly as in a time-domain method for the Helmholtz equation. To improve the convergence, the process is used as a preconditioner for GMRES, and the time-harmonic forcing term is multiplied by a smooth window function. The construction is applied to a compact-stencil finite-difference discretization of the Helmholtz equation, for which previously no time-domain solver was available. Advantages of the resulting solver are the relative simplicity, small memory requirement and reasonable computation times.
Open AccessA time-domain preconditioner for the Helmholtz equation
Time-harmonic solutions to the wave equation can be computed in the frequency or in the time domain. In the frequency domain, one solves a discretized Helmholtz equation, while in the time domain, the periodic solutions to a discretized wave equation are sought, e.g. by simulating for a long time with a time-harmonic forcing term. Disadvantages of the time-domain method are that the solutions are affected by temporal discretization errors and that the spatial discretization cannot be freely chosen, since it is inherited from the time-domain scheme. In this work we address these issues. Given an indefinite linear system satisfying certain properties, a matrix recurrence relation is constructed, such that in the limit the exact discrete solution is obtained. By iterating a large, finite number of times, an approximate solution is obtained, similarly as in a time-domain method for the Helmholtz equation. To improve the convergence, the process is used as a preconditioner for GMRES, and the time-harmonic forcing term is multiplied by a smooth window function. The construction is applied to a compact-stencil finite-difference discretization of the Helmholtz equation, for which previously no time-domain solver was available. Advantages of the resulting solver are the relative simplicity, small memory requirement and reasonable computation times.
- 1 January 2021
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 43 (5) , A3469-A3502
A Time-Domain Preconditioner for the Helmholtz Equation
Time-harmonic solutions to the wave equation can be computed in the frequency or in the time domain. In the frequency domain, one solves a discretized Helmholtz equation, while in the time domain, ...
- 1 January 2021
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 43 (5) , A3469-A3502
A Time-Domain Preconditioner for the Helmholtz Equation
Time-harmonic solutions to the wave equation can be computed in the frequency or in the time domain. In the frequency domain, one solves a discretized Helmholtz equation, while in the time domain, ...
- Open Access
Understanding the combined effect of $k$-space undersampling and transient states excitation in MR Fingerprinting reconstructions
Magnetic resonance fingerprinting (MRF) is able to estimate multiple quantitative tissue parameters from a relatively short acquisition. The main characteristic of an MRF sequence is the simultaneous application of (a) transient states excitation and (b) highly undersampled $k$-space. Despite the promising empirical results obtained with MRF, no work has appeared that formally describes the combined impact of these two aspects on the reconstruction accuracy. In this paper, a mathematical model is derived that directly relates the time varying RF excitation and the $k$-space sampling to the spatially dependent reconstruction errors. A subsequent in-depth analysis identifies the mechanisms by which MRF sequence properties affect accuracy, providing a formal explanation of several empirically observed or intuitively understood facts. New insights are obtained which show how this analytical framework could be used to improve the MRF protocol.
Open AccessUnderstanding the combined effect of $k$-space undersampling and transient states excitation in MR Fingerprinting reconstructions
Magnetic resonance fingerprinting (MRF) is able to estimate multiple quantitative tissue parameters from a relatively short acquisition. The main characteristic of an MRF sequence is the simultaneous application of (a) transient states excitation and (b) highly undersampled $k$-space. Despite the promising empirical results obtained with MRF, no work has appeared that formally describes the combined impact of these two aspects on the reconstruction accuracy. In this paper, a mathematical model is derived that directly relates the time varying RF excitation and the $k$-space sampling to the spatially dependent reconstruction errors. A subsequent in-depth analysis identifies the mechanisms by which MRF sequence properties affect accuracy, providing a formal explanation of several empirically observed or intuitively understood facts. New insights are obtained which show how this analytical framework could be used to improve the MRF protocol.
- Open Access
- 16 August 2016
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 43 (1) , 45-76
An improved sweeping domain decomposition preconditioner for the Helmholtz equation
- 16 August 2016
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 43 (1) , 45-76
Open AccessAn improved sweeping domain decomposition preconditioner for the Helmholtz equation
- Open Access
An improved sweeping domain decomposition preconditioner for the Helmholtz equation
In this paper we generalize and improve a recently developed domain decomposition preconditioner for the iterative solution of discretized Helmholtz equations. We introduce an improved method for transmission at the internal boundaries using perfectly matched layers. Simultaneous forward and backward sweeps are introduced, thereby improving the possibilities for parallellization. Finally, the method is combined with an outer two-grid iteration. The method is studied theoretically and with numerical examples. It is shown that the modifications lead to substantial decreases in computation time and memory use, so that computation times become comparable to that of the fastests methods currently in the literature for problems with up to 10^8 degrees of freedom.
Open AccessAn improved sweeping domain decomposition preconditioner for the Helmholtz equation
In this paper we generalize and improve a recently developed domain decomposition preconditioner for the iterative solution of discretized Helmholtz equations. We introduce an improved method for transmission at the internal boundaries using perfectly matched layers. Simultaneous forward and backward sweeps are introduced, thereby improving the possibilities for parallellization. Finally, the method is combined with an outer two-grid iteration. The method is studied theoretically and with numerical examples. It is shown that the modifications lead to substantial decreases in computation time and memory use, so that computation times become comparable to that of the fastests methods currently in the literature for problems with up to 10^8 degrees of freedom.
- 1 June 2016
- Published by Elsevier in Journal of Computational Physics
- Vol. 314, 618-646
A dispersion minimizing scheme for the 3-D Helmholtz equation based on ray theory
- 1 June 2016
- Published by Elsevier in Journal of Computational Physics
- Vol. 314, 618-646
A dispersion minimizing scheme for the 3-D Helmholtz equation based on ray theory
- Open Access
A dispersion minimizing scheme for the 3-D Helmholtz equation based on ray theory
We develop a new dispersion minimizing compact finite difference scheme for the Helmholtz equation in 2 and 3 dimensions. The scheme is based on a newly developed ray theory for difference equations. A discrete Helmholtz operator and a discrete operator to be applied to the source and the wavefields are constructed. Their coefficients are piecewise polynomial functions of $hk$, chosen such that phase and amplitude errors are minimal. The phase errors of the scheme are very small, approximately as small as those of the 2-D quasi-stabilized FEM method and substantially smaller than those of alternatives in 3-D, assuming the same number of gridpoints per wavelength is used. In numerical experiments, accurate solutions are obtained in constant and smoothly varying media using meshes with only five to six points per wavelength and wave propagation over hundreds of wavelengths. When used as a coarse level discretization in a multigrid method the scheme can even be used with downto three points per wavelength. Tests on 3-D examples with up to $10^8$ degrees of freedom show that with a recently developed hybrid solver, the use of coarser meshes can lead to corresponding savings in computation time, resulting in good simulation times compared to the literature.Open AccessA dispersion minimizing scheme for the 3-D Helmholtz equation based on ray theory
We develop a new dispersion minimizing compact finite difference scheme for the Helmholtz equation in 2 and 3 dimensions. The scheme is based on a newly developed ray theory for difference equations. A discrete Helmholtz operator and a discrete operator to be applied to the source and the wavefields are constructed. Their coefficients are piecewise polynomial functions of $hk$, chosen such that phase and amplitude errors are minimal. The phase errors of the scheme are very small, approximately as small as those of the 2-D quasi-stabilized FEM method and substantially smaller than those of alternatives in 3-D, assuming the same number of gridpoints per wavelength is used. In numerical experiments, accurate solutions are obtained in constant and smoothly varying media using meshes with only five to six points per wavelength and wave propagation over hundreds of wavelengths. When used as a coarse level discretization in a multigrid method the scheme can even be used with downto three points per wavelength. Tests on 3-D examples with up to $10^8$ degrees of freedom show that with a recently developed hybrid solver, the use of coarser meshes can lead to corresponding savings in computation time, resulting in good simulation times compared to the literature.