Carola Kruse
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Carola Kruse has a total of 70 co-authors. Here are the top co-authors by number of shared publications:
- Ulrich Rüde
CERFACS
10 shared publications - Martin Joachim Kühn
Institute of Software Technology, Department of High-Performance Computing, German Aerospace Center, Cologne, Germany
4 shared publications - Andrei Dumitrasc
Chair for Department of Computer Science 10 - System Simulation, Friedrich-Alexander University Erlangen-Nuremberg, 91058, Erlangen, Germany
3 shared publications - Harald Köstler
Friedrich-Alexander-Universität Erlangen-Nürnberg, Erlangen, Germany
3 shared publications Mario Arioli
Libera Universita Mediterranea, Casamassima, Bari, Italy
3 shared publicationsMasha Sosonkina
Department of Electrical and Computer Engineering , Old Dominion University , Norfolk , VA 23529 , USA
3 shared publications
Latest Publications
- Open Access
- 19 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 163-171
The Energy-Oriented Centre of Excellence
EoCoE is a EuroHPC Centre of Excellence contributing to Europe transition to sustainable energy through High Performance Computing. Now in its third phase, the project harnesses exascale technologies, massively parallel simulations, and advanced computational methods to tackle some of the most pressing challenges in renewable energy. At the heart of EoCoE are five lighthouse applications spanning four strategic domains: fusion, photovoltaics, water, and wind energy. By enhancing these applications, making them exascale-ready, and developing and optimising the underlying software tools and mathematical libraries, the project contributes to both the green energy transition and the advancement of scientific computing methodologies in Europe. This paper presents the five lighthouse applications and highlights the key achievements in performance, portability, and productivity. It further describes the development of enabling tools and libraries, and outlines the project broader efforts to maximise scientific, technological, and societal impact.
- 19 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 163-171
Open AccessThe Energy-Oriented Centre of Excellence
EoCoE is a EuroHPC Centre of Excellence contributing to Europe transition to sustainable energy through High Performance Computing. Now in its third phase, the project harnesses exascale technologies, massively parallel simulations, and advanced computational methods to tackle some of the most pressing challenges in renewable energy. At the heart of EoCoE are five lighthouse applications spanning four strategic domains: fusion, photovoltaics, water, and wind energy. By enhancing these applications, making them exascale-ready, and developing and optimising the underlying software tools and mathematical libraries, the project contributes to both the green energy transition and the advancement of scientific computing methodologies in Europe. This paper presents the five lighthouse applications and highlights the key achievements in performance, portability, and productivity. It further describes the development of enabling tools and libraries, and outlines the project broader efforts to maximise scientific, technological, and societal impact.
- Open Access
- 26 December 2025
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 481
Memory - and compute-optimized geometric multigrid GMGPolar for curvilinear coordinate representations – Applications to fusion plasma
- 26 December 2025
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 481
Open AccessMemory - and compute-optimized geometric multigrid GMGPolar for curvilinear coordinate representations – Applications to fusion plasma
- 17 November 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 47 (6) , A3464-A3493
Convergence Analysis of Overlapping Domain Decomposition Preconditioners for Nonlinear Problems
Numerical simulations of nonlinear partial differential equations often involve solving large nonlinear systems, for which Newton’s method is widely employed due to its fast convergence near the solution. However, its performance can deteriorate in the presence of strong nonlinearities or poor initial guesses. Nonlinear overlapping domain decomposition methods, such as RASPEN and substructured RASPEN (SRASPEN), have proven effective in addressing these challenges. Because SRASPEN reduces the problem size by restricting computations to a substructure, it does not update the solution outside the substructure, so that no natural initial guesses for the nonlinear local solution exists that might lead to additional inner subdomain nonlinear iterations or even prevent the local solvers to converge. In this study, we analyze the convergence of RASPEN. We show how domain decomposition improves the convergence rate of the Newton’s method by highlighting the key role of the substructure on the global error contraction. Moreover, our analysis provides insight into an inexpensive modification to SRASPEN that mitigates the lack of iterations outside the substructure. The proposed variant significantly reduces computational cost while improving overall efficiency compared to existing techniques in the literature. Numerical experiments confirm the computational performance and robustness of the improved SRASPEN, establishing it as a reliable approach for solving large-scale nonlinear systems.
- 17 November 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 47 (6) , A3464-A3493
Convergence Analysis of Overlapping Domain Decomposition Preconditioners for Nonlinear Problems
Numerical simulations of nonlinear partial differential equations often involve solving large nonlinear systems, for which Newton’s method is widely employed due to its fast convergence near the solution. However, its performance can deteriorate in the presence of strong nonlinearities or poor initial guesses. Nonlinear overlapping domain decomposition methods, such as RASPEN and substructured RASPEN (SRASPEN), have proven effective in addressing these challenges. Because SRASPEN reduces the problem size by restricting computations to a substructure, it does not update the solution outside the substructure, so that no natural initial guesses for the nonlinear local solution exists that might lead to additional inner subdomain nonlinear iterations or even prevent the local solvers to converge. In this study, we analyze the convergence of RASPEN. We show how domain decomposition improves the convergence rate of the Newton’s method by highlighting the key role of the substructure on the global error contraction. Moreover, our analysis provides insight into an inexpensive modification to SRASPEN that mitigates the lack of iterations outside the substructure. The proposed variant significantly reduces computational cost while improving overall efficiency compared to existing techniques in the literature. Numerical experiments confirm the computational performance and robustness of the improved SRASPEN, establishing it as a reliable approach for solving large-scale nonlinear systems.
- 29 August 2025
- Published by Walter de Gruyter GmbH in Journal of Inverse and Ill-posed Problems
- Vol. 33 (5) , 617-632
Material parameter estimation for a viscoelastic stenosis model using a variational autoencoder inverse mapper
Coronary artery disease, a prevalent condition often leading to heart attacks, may cause abnormal wall shear stresses near stenosed regions generating high frequent acoustic shear waves. In a previous study, a viscoelastic agarose gel was used to model the human tissue and it was shown that two material parameters of the gel could be estimated with a high certainty using a classical inverse problem. This paper explores machine learning (ML) alternatives, particularly a Variational Autoencoder Inverse Mapper (VAIM). VAIM, previously successful in nuclear physics, uses deep neural networks to approximate forward and backward mappings and learn posterior parameter distributions. This paper validates previous research by generating data around ground truth values, demonstrating VAIM’s ability to estimate two material parameters effectively. In addition, it addresses realistic applications by training and testing on noisy data and generalizing findings across different intervals of signal damping.
- 29 August 2025
- Published by Walter de Gruyter GmbH in Journal of Inverse and Ill-posed Problems
- Vol. 33 (5) , 617-632
Material parameter estimation for a viscoelastic stenosis model using a variational autoencoder inverse mapper
Coronary artery disease, a prevalent condition often leading to heart attacks, may cause abnormal wall shear stresses near stenosed regions generating high frequent acoustic shear waves. In a previous study, a viscoelastic agarose gel was used to model the human tissue and it was shown that two material parameters of the gel could be estimated with a high certainty using a classical inverse problem. This paper explores machine learning (ML) alternatives, particularly a Variational Autoencoder Inverse Mapper (VAIM). VAIM, previously successful in nuclear physics, uses deep neural networks to approximate forward and backward mappings and learn posterior parameter distributions. This paper validates previous research by generating data around ground truth values, demonstrating VAIM’s ability to estimate two material parameters effectively. In addition, it addresses realistic applications by training and testing on noisy data and generalizing findings across different intervals of signal damping.
- 1 April 2025
- Published by Springer Nature
- p. 174-189
Comparison of Multigrid and Machine Learning-Based Poisson Solvers
- 1 April 2025
- Published by Springer Nature
- p. 174-189
Comparison of Multigrid and Machine Learning-Based Poisson Solvers
- 13 February 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 46 (1) , 370-392
Generalized Golub–Kahan Bidiagonalization for Nonsymmetric Saddle-Point Systems
The generalized Golub–Kahan bidiagonalization has been used to solve saddle-point systems where the leading block is symmetric and positive definite. We extend this iterative method for the case where the symmetry condition no longer holds. We do so by relying on the known connection the algorithm has with the conjugate gradient method and following the line of reasoning that adapts the latter into the full orthogonalization method. We propose appropriate stopping criteria based on the residual and an estimate of the energy norm for the error associated with the primal variable. Numerical comparison with GMRES highlights the advantages of our proposed strategy regarding its low memory requirements and the associated implications.
- 13 February 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 46 (1) , 370-392
Generalized Golub–Kahan Bidiagonalization for Nonsymmetric Saddle-Point Systems
The generalized Golub–Kahan bidiagonalization has been used to solve saddle-point systems where the leading block is symmetric and positive definite. We extend this iterative method for the case where the symmetry condition no longer holds. We do so by relying on the known connection the algorithm has with the conjugate gradient method and following the line of reasoning that adapts the latter into the full orthogonalization method. We propose appropriate stopping criteria based on the residual and an estimate of the energy norm for the error associated with the primal variable. Numerical comparison with GMRES highlights the advantages of our proposed strategy regarding its low memory requirements and the associated implications.
- 13 December 2024
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 44 (2) , 1-36
Fast linear solvers for incompressible CFD simulations with compatible discrete operator schemes
- 13 December 2024
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 44 (2) , 1-36
Fast linear solvers for incompressible CFD simulations with compatible discrete operator schemes
- Open Access
Comparison of multigrid and machine learning-based Poisson solvers
We present a comprehensive comparison of the multigrid method and the UNet architecture for solving Poisson's equation. Those two methods show a lot of similarity and also have the very interesting characteristic that their solving time should scale linearly with the number of mesh nodes. Nevertheless, for Poisson's equation, an analysis of the number of floating-point operations demonstrates that the multigrid V-Cycle should be faster than the UNet. We have realized a practical comparison of the two methods solving time for different number of mesh nodes on the same computation nodes using GPU.
Open AccessComparison of multigrid and machine learning-based Poisson solvers
We present a comprehensive comparison of the multigrid method and the UNet architecture for solving Poisson's equation. Those two methods show a lot of similarity and also have the very interesting characteristic that their solving time should scale linearly with the number of mesh nodes. Nevertheless, for Poisson's equation, an analysis of the number of floating-point operations demonstrates that the multigrid V-Cycle should be faster than the UNet. We have realized a practical comparison of the two methods solving time for different number of mesh nodes on the same computation nodes using GPU.
- 17 January 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 45 (1) , 203-231
Deflation for the Off-Diagonal Block in Symmetric Saddle Point Systems
Deflation techniques are typically used to shift isolated clusters of small eigenvalues in order to obtain a tighter distribution and a smaller condition number. Such changes induce a positive effect in the convergence behavior of Krylov subspace methods, which are among the most popular iterative solvers for large sparse linear systems. We develop a deflation strategy for symmetric saddle point matrices by taking advantage of their underlying block structure. The vectors used for deflation come from an elliptic singular value decomposition relying on the generalized Golub–Kahan bidiagonalization process. The block targeted by deflation is the off-diagonal one since it features a problematic singular value distribution for certain applications. One example is the Stokes flow in elongated channels, where the off-diagonal block has several small, isolated singular values, depending on the length of the channel. Applying deflation to specific parts of the saddle point system is important when using solvers such as CRAIG, which operates on individual blocks rather than the whole system. The theory is developed by extending the existing framework for deflating square matrices before applying a Krylov subspace method such as MINRES. Numerical experiments confirm the merits of our strategy and lead to interesting questions about using approximate vectors for deflation.
- 17 January 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 45 (1) , 203-231
Deflation for the Off-Diagonal Block in Symmetric Saddle Point Systems
Deflation techniques are typically used to shift isolated clusters of small eigenvalues in order to obtain a tighter distribution and a smaller condition number. Such changes induce a positive effect in the convergence behavior of Krylov subspace methods, which are among the most popular iterative solvers for large sparse linear systems. We develop a deflation strategy for symmetric saddle point matrices by taking advantage of their underlying block structure. The vectors used for deflation come from an elliptic singular value decomposition relying on the generalized Golub–Kahan bidiagonalization process. The block targeted by deflation is the off-diagonal one since it features a problematic singular value distribution for certain applications. One example is the Stokes flow in elongated channels, where the off-diagonal block has several small, isolated singular values, depending on the length of the channel. Applying deflation to specific parts of the saddle point system is important when using solvers such as CRAIG, which operates on individual blocks rather than the whole system. The theory is developed by extending the existing framework for deflating square matrices before applying a Krylov subspace method such as MINRES. Numerical experiments confirm the merits of our strategy and lead to interesting questions about using approximate vectors for deflation.