Related papers: Fully reliable error control for evolutionary prob…
An efficient Krylov subspace algorithm for computing actions of the $\varphi$ matrix function for large matrices is proposed. This matrix function is widely used in exponential time integration, Markov chains and network analysis and many…
The convergence analysis for least-squares finite element methods led to various adaptive mesh-refinement strategies: Collective marking algorithms driven by the built-in a posteriori error estimator or an alternative explicit…
For compact self-adjoint operators in Hilbert spaces, two algorithms are proposed to provide fully computable a posteriori error estimate for eigenfunction approximation. Both algorithms apply well to the case of tight clusters and multiple…
In this paper, error estimates are presented for a certain class of optimal control problems with elliptic PDE-constraints. It is assumed that in the cost functional the state is measured in terms of the energy norm generated by the state…
This paper is concerned with the derivation of conforming and non-conforming functional a posteriori error estimates for elliptic boundary value problems in exterior domains. These estimates provide computable and guaranteed upper and lower…
The theory of evolutionary computation for discrete search spaces has made significant progress in the last ten years. This survey summarizes some of the most important recent results in this research area. It discusses fine-grained models…
The population-based optimization algorithms have provided promising results in feature selection problems. However, the main challenges are high time complexity. Moreover, the interaction between features is another big challenge in FS…
In this work, we apply multi-goal oriented error estimation to the finite element method. In particular, we use the dual weighted residual method and apply it to a model problem. This model problem consist of locally different coercive…
We provide a posteriori error estimates in the $L^\infty(L^2)-$norm for relaxation time discrete and fully discrete schemes for a class of evolution nonlinear Schr\"odinger equations up to the critical exponent. In particular for the…
We present a new method for proving lower bounds on the expected running time of evolutionary algorithms. It is based on fitness-level partitions and an additional condition on transition probabilities between fitness levels. The method is…
In the first part of this paper we introduced an algorithm that uses reachable set approximation to approximate the minimum time function of linear control problems. To illustrate the error estimates and to demonstrate differences to other…
We derive optimal order a posteriori error estimates for fully discrete approximations of the initial-boundary value problem for the heat equation. For the discretization in time we apply the fractional-step $\vartheta$-scheme and for the…
This work introduces a time-adaptive strategy that uses a refinement estimator based on the first Frenet curvature. In dynamics, a time-adaptive strategy is a mechanism that interactively proposes changes to the time step used in iterative…
Based on the auxiliary subspace techniques, a hierarchical basis a posteriori error estimator is proposed for the Stokes problem in two and three dimensions. For the error estimator, we need to solve only two global diagonal linear systems…
Error control by means of a posteriori error estimators or indica-tors and adaptive discretizations, such as adaptive mesh refinement, have emerged in the late seventies. Since then, numerous theoretical developments and improvements have…
This study presents incremental correction methods for refining neural network parameters or control functions entering into a continuous-time dynamic system to achieve improved solution accuracy in satisfying the interim point constraints…
We consider the unilateral contact problem between an elastic body and a rigid foundation in a description that includes both Tresca and Coulomb friction conditions. For this problem, we present an a posteriori error analysis based on an…
We define an a posteriori verification procedure that enables to control and certify PGD-based model reduction techniques applied to parametrized linear elliptic or parabolic problems. Using the concept of constitutive relation error, it…
We design and analyze a posteriori error estimators for the Stokes system with singular sources in suitable $\mathbf{W}^{1,p}\times \mathrm{L}^p$ spaces. We consider classical low-order inf-sup stable and stabilized finite element…
We analyze an algorithm for assigning weights prior to scalarization in discrete multi-objective problems arising from data analysis. The algorithm evolves weights (interpreted as the relevance of features) by a replicator-type dynamic on…