activity
20172023
most citedConvergence analysis of BDDC preconditioners for composite DG discretizations of the cardiac cell-by-cell model

18 citations · 47 across the 10 of their papers we have counts for

collaborators

10 papers

math.OC2023

Convergence Properties of Newton's Method for Globally Optimal Free Flight Trajectory Optimization

Ralf Borndörfer, Fabian Danecker, Martin Weiser

The algorithmic efficiency of Newton-based methods for Free Flight Trajectory Optimization is heavily influenced by the size of the domain of convergence. We provide numerical evid…

math.NA2023★ 4 cited

Adaptive Gaussian Process Regression for Efficient Building of Surrogate Models in Inverse Problems

Phillip Semler, Martin Weiser

In a task where many similar inverse problems must be solved, evaluating costly simulations is impractical. Therefore, replacing the model with a surrogate model that can…

math.OC2023

Newton's Method for Global Free Flight Trajectory Optimization

Ralf Borndörfer, Fabian Danecker, Martin Weiser

Globally optimal free flight trajectory optimization can be achieved with a combination of discrete and continuous optimization. A key requirement is that Newton's method for conti…

math.NA2022★ 18 cited

Convergence analysis of BDDC preconditioners for composite DG discretizations of the cardiac cell-by-cell model

Ngoc Mai Monica Huynh, Fatemeh Chegini, Luca Franco Pavarino +2

A Balancing Domain Decomposition by Constraints (BDDC) preconditioner is constructed and analyzed for the solution of composite Discontinuous Galerkin discretizations of reaction-d…

math.NA2022★ 2 cited

Fast Floating-Point Filters for Robust Predicates

Tinko Bartels, Vissarion Fisikopoulos, Martin Weiser

Geometric predicates are at the core of many algorithms, such as the construction of Delaunay triangulations, mesh processing and spatial relation tests. These algorithms have appl…

math.OC2022★ 1 cited

Error Bounds for Discrete-Continuous Shortest Path Problems with Application to Free Flight Trajectory Optimization

Ralf Borndörfer, Fabian Danecker, Martin Weiser

Two-stage methods addressing continuous shortest path problems start local minimization from discrete shortest paths in a spatial graph. The convergence of such hybrid methods to g…