Related papers: A computational tool for comparing all linear PDE …
Kernel based methods provide a way to reconstruct potentially high-dimensional functions from meshfree samples, i.e., sampling points and corresponding target values. A crucial ingredient for this to be successful is the distribution of the…
We present a high-performance budgeted multi-level Monte Carlo method for estimates on the entire spatial domain of multi-PDE problems with random input data. The method is designed to operate optimally within memory and CPU-time…
In this contribution, we generalize the concept of \textit{optimally accurate operators} proposed and used in a series of studies on the simulation of seismic wave propagation, particularly based on Geller \& Takeuchi (1995). Although these…
We develop an optimization framework for identifying ideal Mixed Binary Linear Programs (MBLP) which is linear when using known input data and nonconvex quadratic over parametric input data. These techniques are applied to various…
Existing implementations of gradient-based optimisation methods typically assume that the problem is posed in Euclidean space. When solving optimality problems on function spaces, the functional derivative is then inaccurately represented…
Algorithms for solving the linear classification problem have a long history, dating back at least to 1936 with linear discriminant analysis. For linearly separable data, many algorithms can obtain the exact solution to the corresponding…
This paper offers a contemporary and comprehensive perspective on the classical algorithms utilized for the solution of minimum-time problem for linear systems (MTPLS). The use of unified notations supported by visual geometric…
We provide new answers about the placement of mass on spheres so as to minimize energies of pairwise interactions. We find optimal measures for the $p$-frame energies, i.e. energies with the kernel given by the absolute value of the inner…
In this paper we deal with a network of agents seeking to solve in a distributed way Mixed-Integer Linear Programs (MILPs) with a coupling constraint (modeling a limited shared resource) and local constraints. MILPs are NP-hard problems and…
The discontinuous Petrov-Galerkin method is a minimal residual method with broken test spaces and is introduced for a nonlinear model problem in this paper. Its lowest-order version applies to a nonlinear uniformly convex model example and…
We consider adaptive finite element methods for second-order elliptic PDEs, where the arising discrete systems are not solved exactly. For contractive iterative solvers, we formulate an adaptive algorithm which monitors and steers the…
We study the design of polylogarithmic depth algorithms for approximately solving packing and covering semidefinite programs (or positive SDPs for short). This is a natural SDP generalization of the well-studied positive LP problem.…
Calibration refers to the statistical estimation of unknown model parameters in computer experiments, such that computer experiments can match underlying physical systems. This work develops a new calibration method for imperfect computer…
Steady and unsteady Poisson and Stokes equations are solved using mesh dependent Finite Element Method and meshless Radial Basis Function Collocation Method to compare the performances of these two numerical techniques across several…
Accurately solving PDEs with localised features requires refined meshes that adapt to the solution. Traditional numerical methods, such as finite elements, are linear in nature and often ineffective for such problems, as the mesh is not…
The numerical solution of high dimensional partial differential equations (PDEs) is severely constrained by the curse of dimensionality (CoD), rendering classical grid--based methods impractical beyond a few dimensions. In recent years,…
We investigate the iterative methods proposed by Maz'ya and Kozlov (see [KM1], [KM2]) for solving ill-posed inverse problems modeled by partial differential equations. We consider linear evolutionary problems of elliptic, hyperbolic and…
Decentralized optimization is a powerful paradigm that finds applications in engineering and learning design. This work studies decentralized composite optimization problems with non-smooth regularization terms. Most existing gradient-based…
Overdetermined systems of first kind integral equations appear in many applications. When the right-hand side is discretized, the resulting finite-data problem is ill-posed and admits infinitely many solutions. We propose a numerical method…
We give a new computational method to obtain symmetries of ordinary differential equations. The proposed approach appears as an extension of a recent algorithm to compute variational symmetries of optimal control problems [Comput. Methods…