|
|
Algebraic Error in Matrix Computations in the Context of Numerical Solution of Partial Differential Equations
Papež, Jan ; Strakoš, Zdeněk (advisor) ; Ramage, Alison (referee) ; Vejchodský, Tomáš (referee)
Title: Algebraic Error in Matrix Computations in the Context of Numerical Solution of Partial Differential Equations Author: Jan Papež Department: Department of Numerical Mathematics Supervisor: prof. Ing. Zdeněk Strakoš, DrSc., Department of Numerical Mathe- matics Abstract: Solution of algebraic problems is an inseparable and usually the most time-consuming part of numerical solution of PDEs. Algebraic computations are, in general, not exact, and in many cases it is even principally desirable not to perform them to a high accuracy. This has consequences that have to be taken into account in numerical analysis. This thesis investigates in this line some closely related issues. It focuses, in particular, on spatial distribution of the errors of different origin across the solution domain, backward error interpretation of the algebraic error in the context of function approximations, incorporation of algebraic errors to a posteriori error analysis, influence of algebraic errors to adaptivity, and construction of stopping criteria for (preconditioned) iterative algebraic solvers. Progress in these issues requires, in our opinion, understanding the interconnections between the phases of the overall solution process, such as discretization and algebraic computations. Keywords: Numerical solution of partial...
|
|
|
Proceedings of the International Conference Applications of Mathematics 2015 : Prague, November 18-21, 2015
Brandts, J. ; Korotov, S. ; Křížek, Michal ; Segeth, Karel ; Šístek, Jakub ; Vejchodský, Tomáš
Professors Ivo Babuška, Milan Práger, and Emil Vitásek are renowned experts in numerical analysis and computational methods. Their fruitful scientific careers started in Prague, at the Institute of Mathematics of the Czechoslovak Academy of Sciences (now Czech Academy of Sciences). They collaborated there on various projects including the computational analysis of the construction technology for Orlík Dam. In 1966 they published their joint book entitled Numerical Processes in Differential Equations. It is an honor for the Institute of Mathematics to host a conference on the occasion of their birthdays.
|
|
|
Programs and Algorithms of Numerical Mathematics 17 : Dolní Maxov, June 8-13, 2014 : Proceedings of Seminar
Chleboun, J. ; Přikryl, Petr ; Segeth, Karel ; Šístek, Jakub ; Vejchodský, Tomáš
This volume comprises peer-reviewed papers that are based on invited lectures, survey lectures, short communications, and posters presented at the 17th seminar Programs and Algorithms of Numerical Mathematics (PANM) held in Dolní Maxov, Czech Republic, June 8–13, 2014. The seminar was organized by the Institute of Mathematics of the Academy of Sciences of the Czech Republic. It continued the previous seminars on mathematical software and numerical methods held (with only one exception) biannually in\nAlšovice, Bratříkov, Janov nad Nisou, Kořenov, Lázně Libverda, Dolní Maxov, and Prague in the period 1983–2012. The objective of this series of seminars is to provide a forum for presenting and discussing advanced topics in numerical analysis, singleor multi-processor applications of computational methods, and new approaches to mathematical modeling.
|
|
| |
|
|
On the quality of local flux reconstructions for guaranteed error bounds
Vejchodský, Tomáš
In this contribution we consider elliptic problems of a reaction-diffucion type discretized by the finite element method and study the quality of guaranteed upper bounds of the error. In particular, we concentrate on complementary error bounds whose values are determined by suitable flux reconstructions. We present numerical experiments comparing the performance of the local flux reconstruction of Ainsworth and Vejchodský [2] and the reconstruction of Braess and Schröberl [5]. We evaluate the efficiency of these flux reconstructions by their comparison with the optimal flux reconstruction computed as a global minimization problem.
|
|
|
On the number of stationary patterns in reaction-diffusion systems
Rybář, Vojtěch ; Vejchodský, Tomáš
We study systems of two nonlinear reaction-diffusion partial differential equations undergoing diffusion driven instability. Such systems may have spatially inhomogeneous stationary solutions called Turing patterns. These solutions are typically non-unique and it is not clear how many of them exists. Since there are no analytical results available, we look for the number of distinct stationary solutions numerically. As a typical example, we investigate the reaction-diffusion systém designed to model coat patterns in leopard and jaguar.
|
|
|
Irregularity of turing patterns in the Thomas model with a unilateral term
Rybář, Vojtěch ; Vejchodský, Tomáš
In this contribution we add a unilateral term to the Thomas model and investigate the resulting Turing patterns. We show that the unilateral term yields nonsymmetric and irregular patterns. This contrasts with the approximately symmetric and regular patterns of the classical Thomas model. In addition, the unilateral term yields Turing patterns even for smaller ratio of diffusion constants. These conclusions accord with the recent findings about the influence of the unilateral term in a model for mammalian coat patterns. This indicates that the observed effects of the unilateral term are general and apply to a variety of systems.
|
|
| |
|
|
A direct solver for finite element matrices requiring O(N log N) memory places
Vejchodský, Tomáš
We present a method that in certain sense stores the inverse of the stiffness matrix in O(N log N) memory places, where N is the number of degrees of freedom and hence the matrix size. The setup of this storage format requires O(N^(3/2)) arithmetic operations. However, once the setup is done, the multiplication of the inverse matrix and a vector can be performed with O(N log N) operations. This approach applies to the first order finite element discretization of linear elliptic and parabolic problems in triangular domains, but it can be generalized to higher-order elements, variety of problems, and general domains. The method is based on a special hierarchical enumeration of vertices and on a hierarchical elimination of suitable degrees of freedom. Therefore, we call it hierarchical condensation of degrees of freedom.
|
|
|
Guaranteed and fully computable two-sided bounds of Friedrichs' constant
Vejchodský, Tomáš
This contribution presents a general numerical method for computing lower and upper bound of the optimal constant in Friedrichs’ inequality. The standard Rayleigh-Ritz method is used for the lower bound and the method of a priori-a posteriori inequalities is employed for the upper bound. Several numerical experiments show applicability and accuracy of this approach.
|
guest ::
