arXiv subjects

Tomáš Vejchodský

Publications and source records attributed to Tomáš Vejchodský.

8 recordsLinked to original sources

arXiv2022

Projection error-based guaranteed L2 error bounds for finite element approximations of Laplace eigenfunctions

For conforming finite element approximations of the Laplacian eigenfunctions, a fully computable guaranteed error bound in the $L^2$ norm sense is proposed. The bound is based on the a priori error estimate for the Galerkin projection of the conforming finite element method, and has an optimal speed of convergence for the eigenfunctions with the worst regularity. The resulting error estimate bounds the distance of spaces of exact and approximate eigenfunctions and, hence, is robust even in the case of multiple and tightly clustered eigenvalues. The accuracy of the proposed bound is illustrated by numerical examples. The demonstration code is available at https://ganjin.online/xfliu/EigenfunctionEstimation4FEM .

math.NA↗

arXiv2022

Fully computable a posteriori error bounds for eigenfunctions

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 eigenvalues, under the settings of target eigenvalue problems. Algorithm I is based on the Rayleigh quotient and the min-max principle that characterizes the eigenvalue problems. The formula for the error estimate provided by Algorithm I is easy to compute and applies to problems with limited information of Rayleigh quotients. Algorithm II, as an extension of the Davis--Kahan method, takes advantage of the dual formulation of differential operators along with the Prager--Synge technique and provides greatly improved accuracy of the estimate, especially for the finite element approximations of eigenfunctions. Numerical examples of eigenvalue problems of matrices and the Laplace operators over convex and non-convex domains illustrate the efficiency of the proposed algorithms.

math.NA↗

arXiv2020

Guaranteed a posteriori error bounds for low rank tensor approximate solutions

We propose a guaranteed and fully computable upper bound on the energy norm of the error in low-rank Tensor Train (TT) approximate solutions of (possibly) high dimensional reaction-diffusion problems. The error bound is obtained from Euler-Lagrange equations for a complementary flux reconstruction problem, which are solved in the low-rank TT representation using the block Alternating Linear Scheme. This bound is guaranteed to be above the energy norm of the total error, including the discretization error, the tensor approximation error, and the error in the solver of linear algebraic equations, although quadrature errors, in general, can pollute its evaluation. Numerical examples with the Poisson equation and the Schroedinger equation with the Henon-Heiles potential in up to 40 dimensions are presented to illustrate the efficiency of this approach.

math.NA↗

arXiv2017

New guaranteed lower bounds on eigenvalues by conforming finite elements

We provide two new methods for computing lower bounds of eigenvalues of symmetric elliptic second-order differential operators with mixed boundary conditions of Dirichlet, Neumann, and Robin type. The methods generalize ideas of Weinstein's and Kato's bounds and they are designed for a simple and straightforward implementation in the context of the standard finite element method. These lower bounds are obtained by a posteriori error estimators based on local flux reconstructions, which can be naturally utilized for adaptive mesh refinement. We derive these bounds, prove that they estimate the exact eigenvalues from below, and illustrate their practical performance by a numerical example.

math.NA↗

arXiv2015

Robust error bounds for finite element approximation of reaction-diffusion problems with non-constant reaction coefficient in arbitrary space dimension

We present a fully computable a posteriori error estimator for piecewise linear finite element approximations of reaction-diffusion problems with mixed boundary conditions and piecewise constant reaction coefficient formulated in arbitrary dimension. The estimator provides a guaranteed upper bound on the energy norm of the error and it is robust for all values of the reaction coefficient, including the singularly perturbed case. The approach is based on robustly equilibrated boundary flux functions of Ainsworth and Oden (Wiley 2000) and on subsequent robust and explicit flux reconstruction. This paper simplifies and extends the applicability of the previous result of Ainsworth and Vejchodský (Numer. Math. 119 (2011) 219-243) in three aspects: (i) arbitrary dimension, (ii) mixed boundary conditions, and (iii) non-constant reaction coefficient. It is the first robust upper bound on the error with these properties. An auxiliary result that is of independent interest is the derivation of new explicit constants for two types of trace inequalities on simplices.

math.NA↗

arXiv2014

Reduction of chemical systems by delayed quasi-steady state assumptions

Mathematical analysis of mass action models of large complex chemical systems is typically only possible if the models are reduced. The most common reduction technique is based on quasi-steady state assumptions. To increase the accuracy of this technique we propose delayed quasi-steady state assumptions (D-QSSA) which yield systems of delay differential equations. We define the approximation based on D-QSSA, prove the corresponding error estimate, and show how it approximates the invariant manifold. Then we define a class of well mixed chemical systems and formulate assumptions enabling the application of D-QSSA. We also apply the D-QSSA to a model of Hes1 expression and to a cell-cycle model to illustrate the improved accuracy of the D-QSSA with respect to the standard quasi-steady state assumptions.

math.DS↗

arXiv2013

Accurate reduction of a model of circadian rhythms by delayed quasi steady state assumptions

Quasi steady state assumptions are often used to simplify complex systems of ordinary differential equations in modelling of biochemical processes. The simplified system is designed to have the same qualitative properties as the original system and to have a small number of variables. This enables to use the stability and bifurcation analysis to reveal a deeper structure in the dynamics of the original system. This contribution shows that introducing delays to quasi steady state assumptions yields a simplified system that accurately agrees with the original system not only qualitatively but also quantitatively. We derive the proper size of the delays for a particular model of circadian rhythms and present numerical results showing the accuracy of this approach.

math.DS↗

arXiv2013

Two-sided bounds for eigenvalues of differential operators with applications to Friedrichs', Poincaré, trace, and similar constants

We present a general numerical method for computing guaranteed two-sided bounds for principal eigenvalues of symmetric linear elliptic differential operators. The approach is based on the Galerkin method, on the method of a priori-a posteriori inequalities, and on a complementarity technique. The two-sided bounds are formulated in a general Hilbert space setting and as a byproduct we prove an abstract inequality of Friedrichs'-Poincaré type. The abstract results are then applied to Friedrichs', Poincaré, and trace inequalities and fully computable two-sided bounds on the optimal constants in these inequalities are obtained. Accuracy of the method is illustrated on numerical examples.

math.NA↗