Searcharxiv⌕ Search

arXiv subjects

Nikolaos Rekatsinas

Publications and source records attributed to Nikolaos Rekatsinas.

5 recordsLinked to original sources

Residual Minimisation for Transport-Based Optimal Control

We consider an optimal control problem governed by a stationary linear transport equation in two or three spatial dimensions, motivated by photon transport in radiotherapy treatment planning. The control is an inflow boundary source, and the observation operator may track either the angular flux or its angular integral, the latter serving as a simplified dose surrogate. The associated optimality system consists of a transport--adjoint pair with angular dependence, coupled through a boundary optimality condition. We formulate a residual least-squares functional whose minimisers coincide with solutions of the Karush--Kuhn--Tucker system and show that the functional controls the $L^2$ errors in the state and adjoint and the flux-weighted $L^2$ error in the control. This yields a continuum-level a posteriori estimate without recourse to discretisation. An additional unweighted optimality residual certifies the control in the norm of the objective. The estimate holds for every admissible approximation and accounts for the different boundary measures in the control penalty and transport traces, without a positive lower bound on $|ω\cdot n|$. We then parameterise the state, adjoint and control using neural networks and minimise over a neural network space using appropriate quadrature. The Monte Carlo formulation replaces each residual integral by a weighted sample mean, whose quadrature error enters the a posteriori estimate. We prove convergence under explicit assumptions on approximation, quadrature and optimisation and derive bounds on the total error in terms of approximation, quadrature and optimisation error. Numerical examples in two and three dimensions illustrate the residual--error relation and the flexibility of the residual framework for field- and dose-tracking control problems, including regular manufactured solutions.

math.NA↗

A posteriori certification of PDE approximations with particular application to neural networks

We propose rigorous and efficiently computable lower and upper a posteriori error bounds for given approximations to PDEs on a given domain, which might be geometrically complex. This is done by embedding or enveloping the original domain towards geometrically simpler domains, enabling the use of fast numerical solvers. To this end, we extend and restrict the residual and provide efficient methods to compute those Hahn-Banach extensions. Then, we efficiently compute their Riesz representations on the geometrically simpler domains and obtain the desired a posteriori bounds for which we prove that they are sharp. The resulting bounds control the error in the natural norm induced by a well-posed variational formulation, require only minimal regularity assumptions, and thus remain applicable on complex geometries. The framework is detailed for elliptic as well as parabolic problems. Numerical experiments demonstrate the good quantitative behavior of the derived upper and lower error bounds. A central motivation for this paper comes from physics-informed and related neural-network approximations of PDEs, which are naturally mesh-free and can be evaluated pointwise on complex or parameter-dependent geometries. Nevertheless, the framework applies to any approximation for which the variational residual can be evaluated.

math.NA↗

Deep Uzawa for Kinetic Transport with Lagrange-Enforced Boundaries

We propose a neural network framework for solving stationary linear transport equations with inflow boundary conditions. The method represents the solution using a neural network and imposes the boundary condition via a Lagrange multiplier, based on a saddle-point formulation inspired by the classical Uzawa algorithm. The scheme is mesh-free, compatible with automatic differentiation and extends naturally to problems with scattering and heterogeneous media. We establish convergence of the continuum formulation and analyse the effects of quadrature error, neural approximation and inexact optimisation in the discrete implementation. Numerical experiments show that the method captures anisotropic transport, enforces boundary conditions and resolves scattering dynamics accurately.

math.NA↗

A quadratic finite element wavelet Riesz basis

In this paper, continuous piecewise quadratic finite element wavelets are constructed on general polygons in $\mathbb{R}^2$. The wavelets are stable in $H^s$ for $|s|<\frac{3}{2}$ and have two vanishing moments. Each wavelet is a linear combination of 11 or 13 nodal basis functions. Numerically computed condition numbers for $s \in \{-1,0,1\}$ are provided for the unit square.

math.NA↗

An optimal adaptive wavelet method for First Order System Least Squares

In this paper, it is shown that any well-posed 2nd order PDE can be reformulated as a well-posed first order least squares system. This system will be solved by an adaptive wavelet solver in optimal computational complexity. The applications that are considered are second order elliptic PDEs with general inhomogeneous boundary conditions, and the stationary Navier-Stokes equations.

math.NA↗