<?xml version="1.0" encoding="UTF-8"?>
<ici-import><journal issn="1803-9790"/><issue number="D" volume="18" year="2012" publicationDate="2012-12-21" coverDate="4/2012" numberOfArticles="18"><article externalId="ACC_21527"><type>ORIGINAL_ARTICLE</type><languageVersion externalId="en21527" language="en"><title>Parallel approach to the solution of stationary reaction-diffusion problem</title><abstract>The paper is devoted to the parallel solution of the two-dimensional stationary reaction-diffusion problem. By the usage of parallel approach to the linear algebra representa- tion we create the parallel algorithm for computing a numerical solution of the two-dimensional stationary reaction-diffusion  problem.   We   compare   calculation   times of computing the approximate solution of the system of (linear) difference equations for different sizes of the system matrix by the numerical conjugate gradient method on 1, 2, 3, and 4 processors, respectively.</abstract><pdfFileUrl>https://acc-ern.tul.cz/archiv/PDF/ACC_2012_4_01.pdf</pdfFileUrl><publicationDate>2012-12-21</publicationDate><pageFrom>8</pageFrom><pageTo>14</pageTo><doi/><keywords><keyword>Stationary reaction – diffusion problem</keyword><keyword>parallel linear algebra</keyword><keyword>finite difference
method</keyword><keyword>conjugate gradient method</keyword></keywords></languageVersion><authors><author><name>Daniela</name><surname>Bímová</surname><order>1</order><instituteAffiliation/><role>AUTHOR</role></author></authors><references/></article><article externalId="ACC_21528"><type>ORIGINAL_ARTICLE</type><languageVersion externalId="en21528" language="en"><title>Algorithm for elimination of systems with sparse asymmetric reducible matrices</title><abstract>In the paper, an algorithm for finding an optimal or almost optimal permutation for anordering of elements of a matrix, which is sparse, asymmetric and reducible, is suggested.Using this algorithm we can solve large sparse systems of linear equations more efficiently.The algorithm is a modification of the algorithm presented in [6], therefore the sameindications and symbols are use.</abstract><pdfFileUrl>https://acc-ern.tul.cz/archiv/PDF/ACC_2012_4_02.pdf</pdfFileUrl><publicationDate>2012-12-21</publicationDate><pageFrom>15</pageFrom><pageTo>21</pageTo><doi/><keywords><keyword>Asymmetric reducible sparse matrix</keyword><keyword>algorithm</keyword></keywords></languageVersion><authors><author><name>Daniela</name><surname>Bittnerová</surname><order>1</order><instituteAffiliation/><role>AUTHOR</role></author></authors><references/></article><article externalId="ACC_21529"><type>ORIGINAL_ARTICLE</type><languageVersion externalId="en21529" language="en"><title>Iteration-discretization methods for some variational inequality</title><abstract>Iterative methods for solving variational inequalities in infinite dimensional Hilbert spaces asa rule require some discretization. This leads to variational inequalities over families of spaces.In the present paper this problem is addressed by an iterative method with only a finite numberof steps at each discretization level. First, abstract methods are studied and later an optimalcontrol problem with elliptic state equations and some bound on the controls is considered. Thediscretization technique rests upon a nested family of piecewise linear C0-elements conformingfinite element discretizations.</abstract><pdfFileUrl>https://acc-ern.tul.cz/archiv/PDF/ACC_2012_4_03.pdf</pdfFileUrl><publicationDate>2012-12-21</publicationDate><pageFrom>22</pageFrom><pageTo>31</pageTo><doi/><keywords><keyword>Optimal control</keyword><keyword>iteration-discretization</keyword><keyword>projection algorithm</keyword><keyword>elliptic state equation</keyword><keyword>
finite element discretization</keyword></keywords></languageVersion><authors><author><name>Andrzej</name><surname>Cegielski</surname><order>1</order><instituteAffiliation/><role>AUTHOR</role></author><author><name>Christian</name><surname>Grossmann</surname><order>2</order><instituteAffiliation/><role>AUTHOR</role></author></authors><references/></article><article externalId="ACC_21530"><type>ORIGINAL_ARTICLE</type><languageVersion externalId="en21530" language="en"><title>Adaptive wavelet scheme for convection-diffusion equations</title><abstract>One of the most important part of adaptive wavelet methods is an efficient approximate multi- plication of stiffness matrices with vectors in wavelet coordinates. Although there are known algorithms to perform it in linear complexity, the application of them is relatively time con- suming and its implementation is very difficult. Therefore, it is necessary to develop a well- conditioned wavelet basis with respect to which both the mass and stiffness matrices are sparse in the sense that the number of nonzero elements in any column is bounded by a constant. Then, matrix-vector multiplication can be performed exactly with linear complexity. We present here a wavelet basis on the interval with respect to which both the mass and stiffness matrices corresponding to the one-dimensional Laplacian are sparse. Consequently, the stiffness matrix corresponding to the n-dimensional Laplacian in tensor product wavelet basis is also sparse. Moreover, the constructed basis has an excellent condition number. In this contribution, we shortly review this construction and show several numerical tests.</abstract><pdfFileUrl>https://acc-ern.tul.cz/archiv/PDF/ACC_2012_4_04.pdf</pdfFileUrl><publicationDate>2012-12-21</publicationDate><pageFrom>32</pageFrom><pageTo>39</pageTo><doi/><keywords><keyword>Convection-diffusion equation</keyword><keyword>spline</keyword><keyword>wavelet</keyword><keyword>adaptivity</keyword></keywords></languageVersion><authors><author><name>Dana</name><surname>Černá</surname><order>1</order><instituteAffiliation/><role>AUTHOR</role></author><author><name>Václav</name><surname>Finěk</surname><order>2</order><instituteAffiliation/><role>AUTHOR</role></author></authors><references/></article><article externalId="ACC_21531"><type>ORIGINAL_ARTICLE</type><languageVersion externalId="en21531" language="en"><title>On a sparse representation of laplacian</title><abstract>The paper is concerned with theoretical and computational issues of a numerical resolution of</abstract><pdfFileUrl>https://acc-ern.tul.cz/archiv/PDF/ACC_2012_4_05.pdf</pdfFileUrl><publicationDate>2012-12-21</publicationDate><pageFrom>40</pageFrom><pageTo>45</pageTo><doi/><keywords><keyword>Wavelet</keyword><keyword>Hermite cubic splines</keyword><keyword>sparse representations</keyword></keywords></languageVersion><authors><author><name>Dana</name><surname>Černá</surname><order>1</order><instituteAffiliation/><role>AUTHOR</role></author><author><name>Václav</name><surname>Finěk</surname><order>2</order><instituteAffiliation/><role>AUTHOR</role></author><author><name>Zdena</name><surname>Ondračková.</surname><order>3</order><instituteAffiliation/><role>AUTHOR</role></author></authors><references/></article><article externalId="ACC_21532"><type>ORIGINAL_ARTICLE</type><languageVersion externalId="en21532" language="en"><title>Multiwavelets based on hermite cubic splines</title><abstract>First multiwavelets have appeared around the early 1990s. The basic idea behind multiwavelets is simple: to replace the single scaling function by the multiscaling function 4t to have some additional desired properties. It seems to be an interesting trade off because multiwavelets provide higher order approximation with shorter support than single scaling function. Moreover, it is possible to have both symmetric and orthogonal multiwavelets while this is not possible for single wavelets. In recent years, several simple constructions of wavelet bases based on Hermite cubic splines were proposed. In this contribution, we shortly review these constructions, use these wavelets to solve numerically differential equations, and compare their performance.</abstract><pdfFileUrl>https://acc-ern.tul.cz/archiv/PDF/ACC_2012_4_06.pdf</pdfFileUrl><publicationDate>2012-12-21</publicationDate><pageFrom>46</pageFrom><pageTo>55</pageTo><doi/><keywords><keyword>Wavelet</keyword><keyword>Hermite cubic splines</keyword><keyword>elliptic differential equations</keyword></keywords></languageVersion><authors><author><name>Dana</name><surname>Černá</surname><order>1</order><instituteAffiliation/><role>AUTHOR</role></author><author><name>Václav</name><surname>Finěk</surname><order>2</order><instituteAffiliation/><role>AUTHOR</role></author><author><name>Gerta</name><surname>Plačková</surname><order>3</order><instituteAffiliation/><role>AUTHOR</role></author></authors><references/></article><article externalId="ACC_21533"><type>ORIGINAL_ARTICLE</type><languageVersion externalId="en21533" language="en"><title>HP-discontinuous galerkin method for nonlinear problems</title><abstract>We deal with a numerical solution of nonlinear convection-diffusion problems with the aid of the discontinuous Galerkin finite element (DGFE) method. We propose a new hp-adaptation technique, which is based on a combination of a residuum-nonconformity estimator and a regularity indicator. The residuum-nonconformity estimator consists of two building blocks (the residuum error indicator and the value of the nonconformity). The estimator marks mesh elements for a refinement. The regularity indicator decides if the marked elements will be refined by h- or p-technique. The residuum-nonconformity estimator as well as the regularity indicator are easily computable quantities. Moreover, the same technique estimates an algebraic error arising from an iterative solution of the corresponding nonlinear algebraic system. The performance of the proposed hp-DGFE method is demonstrated by several numerical examples. </abstract><pdfFileUrl>https://acc-ern.tul.cz/archiv/PDF/ACC_2012_4_07.pdf</pdfFileUrl><publicationDate>2012-12-21</publicationDate><pageFrom>56</pageFrom><pageTo>67</pageTo><doi/><keywords><keyword>hp-discontinuous Galerkin finite element method</keyword><keyword>residuum-nonconformity indicator</keyword><keyword>
regularity estimator</keyword><keyword>algebraic error</keyword></keywords></languageVersion><authors><author><name>Vít</name><surname>Dolejší</surname><order>1</order><instituteAffiliation/><role>AUTHOR</role></author></authors><references/></article><article externalId="ACC_21534"><type>ORIGINAL_ARTICLE</type><languageVersion externalId="en21534" language="en"><title>Adaptive inexact newton methods with a posteriori stopping criteria</title><abstract>We consider nonlinear algebraic systems arising from numerical discretizations of nonlinear partial differential equations of diffusion type. In order to solve them, some iterative nonlinear solver, and, on each step of this solver, some iterative linear solver are used. We propose adaptive stopping criteria for both these solvers, based on an a posteriori error estimate which distinguishes the different error components, namely the discretization, linearization, and algebraic ones. Our estimates give a guaranteed error upper bound and also a robust error lower bound. Numerical experiments for the nonlinear Laplace equation, nonconforming finite element discretization, Newton linearization, and conjugate gradients algebraic solver illustrate the theory. </abstract><pdfFileUrl>https://acc-ern.tul.cz/archiv/PDF/ACC_2012_4_08.pdf</pdfFileUrl><publicationDate>2012-12-21</publicationDate><pageFrom>68</pageFrom><pageTo>75</pageTo><doi/><keywords><keyword>Nonlinear algebraic system</keyword><keyword>adaptive linearization</keyword><keyword>adaptive algebraic solution</keyword><keyword>
stopping criterion</keyword><keyword>a posteriori error estimate</keyword></keywords></languageVersion><authors><author><name>Alexandre</name><surname>Ern</surname><order>1</order><instituteAffiliation/><role>AUTHOR</role></author><author><name>Martin</name><surname>Vohralík.</surname><order>2</order><instituteAffiliation/><role>AUTHOR</role></author></authors><references/></article><article externalId="ACC_21535"><type>ORIGINAL_ARTICLE</type><languageVersion externalId="en21535" language="en"><title>On the problem of variability of interval data</title><abstract>a vector which we have recently proposed in [1, 2]. The theoretical advantages of our scheme</abstract><pdfFileUrl>https://acc-ern.tul.cz/archiv/PDF/ACC_2012_4_09.pdf</pdfFileUrl><publicationDate>2012-12-21</publicationDate><pageFrom>76</pageFrom><pageTo>84</pageTo><doi/><keywords><keyword>Interval data</keyword><keyword>computation of variance</keyword><keyword>theoretical analysis</keyword></keywords></languageVersion><authors><author><name>Václav</name><surname>Finěk</surname><order>1</order><instituteAffiliation/><role>AUTHOR</role></author><author><name>Ctirad</name><surname>Matonoha</surname><order>2</order><instituteAffiliation/><role>AUTHOR</role></author></authors><references/></article><article externalId="ACC_21536"><type>ORIGINAL_ARTICLE</type><languageVersion externalId="en21536" language="en"><title>Optimization problems under two-sided (max; min)–linear Inequalities constraints</title><abstract>Systems of so called two-sided (max,min)—linear inequalities with variables on both sides will be studied. Optimization problems, the objective function of which is equal to the maximum of a finite number of continuous functions of one variable are considered. The set of feasible solutions in described by a system of two-sided (max,min)—linear inequalities with variables on both sides. A finite algorithm for finding the optimal solution of the problem is proposed. Keywords: Two-sided (max,min)—linear inequalities system; lower and upper bounds; max-min optimization problems. </abstract><pdfFileUrl>https://acc-ern.tul.cz/archiv/PDF/ACC_2012_4_10.pdf</pdfFileUrl><publicationDate>2012-12-21</publicationDate><pageFrom>85</pageFrom><pageTo>94</pageTo><doi/><keywords><keyword>Two-sided (max</keyword><keyword>min)−linear inequalities system</keyword><keyword>lower and upper bounds</keyword><keyword>maxmin
optimization problems</keyword></keywords></languageVersion><authors><author><name>Mahmoud</name><surname>Gad</surname><order>1</order><instituteAffiliation/><role>AUTHOR</role></author></authors><references/></article><article externalId="ACC_21537"><type>ORIGINAL_ARTICLE</type><languageVersion externalId="en21537" language="en"><title>Finite element and boundary element solution of nuclear waste repository thermal dimensioning problem</title><abstract>We solve the thermal dimensioning problem of the deep geological spent nuclear fuel repository, which means to estimate the maximum temperature in the repository caused by the heat generation of the spent fuel. We use a combination of the boundary element method for the exterior problem of heat discharge to the infinity and finite element method for a near- field thermal problem with a boundary condition expressed by the far-field problem solution. This combination is implemented within the simulation software ANSYS as the “far-field element”. The far-field element solution confirmed to well represent the heat discharge, in comparison with the variant of a standard FEM far-field problem solution and conventional boundary conditions (constant temperature or zero heat flow).</abstract><pdfFileUrl>https://acc-ern.tul.cz/archiv/PDF/ACC_2012_4_11.pdf</pdfFileUrl><publicationDate>2012-12-21</publicationDate><pageFrom>95</pageFrom><pageTo>101</pageTo><doi/><keywords><keyword>heat conduction</keyword><keyword>numerical simulation</keyword><keyword>far-field element</keyword><keyword>multiscale</keyword><keyword>ANSYS</keyword></keywords></languageVersion><authors><author><name>Milan</name><surname>Hokr</surname><order>1</order><instituteAffiliation/><role>AUTHOR</role></author><author><name>Josef</name><surname>Novák</surname><order>2</order><instituteAffiliation/><role>AUTHOR</role></author></authors><references/></article><article externalId="ACC_21538"><type>ORIGINAL_ARTICLE</type><languageVersion externalId="en21538" language="en"><title>Numerical solution of the mew equation by the semi-implicit numerical scheme</title><abstract>In this paper we deal with the development of a numerical method for the solution of the mo- dified equal width wave (MEW) equation – a very important equation with a cubic nonlinearity describing a large number of physical phenomena. The crucial idea of introduced approach is based on the discretization of the MEW equation with the aid of a combination of the discontin- uous Galerkin (DG) method for the space semi-discretization and the backward Euler method for the time discretization. The appended numerical experiments investigate the conservative properties of the MEW equation related to mass, momentum and energy, and illustrate the po- tency of this scheme, consequently.</abstract><pdfFileUrl>https://acc-ern.tul.cz/archiv/PDF/ACC_2012_4_12.pdf</pdfFileUrl><publicationDate>2012-12-21</publicationDate><pageFrom>102</pageFrom><pageTo>110</pageTo><doi/><keywords><keyword>Discontinuous Galerkinmethod</keyword><keyword>modified equal width wave equation</keyword><keyword>semi-implicit
scheme</keyword><keyword>solitary wave</keyword></keywords></languageVersion><authors><author><name>Jiří</name><surname>Hozman</surname><order>1</order><instituteAffiliation/><role>AUTHOR</role></author></authors><references/></article><article externalId="ACC_21539"><type>ORIGINAL_ARTICLE</type><languageVersion externalId="en21539" language="en"><title>Application of reconstruction operators in the discontinuous galerkin method</title><abstract>This paper gives an overview of the main ingredients needed to incorporate reconstruction op- erators, as known from higher order finite volume (FV) and spectral volume (SV) schemes, into the discontinuous Galerkin (DG) method. Such an operator constructs higher order approxima- tions from the lower order DG scheme, increasing the order of convergence, while leading to a more efficient numerical scheme than the corresponding higher order DG scheme itself. We discuss theoretical, as well as implementational aspects and numerical experiments.</abstract><pdfFileUrl>https://acc-ern.tul.cz/archiv/PDF/ACC_2012_4_13.pdf</pdfFileUrl><publicationDate>2012-12-21</publicationDate><pageFrom>111</pageFrom><pageTo>119</pageTo><doi/><keywords><keyword>Higher order reconstruction</keyword><keyword>discontinuous Galerkin</keyword><keyword>finite volumes</keyword></keywords></languageVersion><authors><author><name>Václav</name><surname>Kučera</surname><order>1</order><instituteAffiliation/><role>AUTHOR</role></author></authors><references/></article><article externalId="ACC_21540"><type>ORIGINAL_ARTICLE</type><languageVersion externalId="en21540" language="en"><title>Numerical solution of reaction-diffusion equations</title><abstract>The subject of the presented paper is a mathematical analysis and numerical solution of the sys- tem of nonlinear nonstationary reaction-diffusion equations. Firstly, using the invariant region technique, the proof of both the existence and uniqueness of the solution and problem data con- tinuous dependence is carried out. After time discretization of the problem the Galerkin finite elements method is applied and a priori error estimates of the method are derived. A suitable mesh adaptivity is discussed as well. The method is finally implemented and tested on several examples.</abstract><pdfFileUrl>https://acc-ern.tul.cz/archiv/PDF/ACC_2012_4_14.pdf</pdfFileUrl><publicationDate>2012-12-21</publicationDate><pageFrom>120</pageFrom><pageTo>128</pageTo><doi/><keywords><keyword>Invariant region</keyword><keyword>reaction</keyword><keyword>diffusion</keyword><keyword>finite elements method</keyword><keyword>adaptivity</keyword></keywords></languageVersion><authors><author><name>Jan</name><surname>Lamač</surname><order>1</order><instituteAffiliation/><role>AUTHOR</role></author></authors><references/></article><article externalId="ACC_21541"><type>ORIGINAL_ARTICLE</type><languageVersion externalId="en21541" language="en"><title>Numerical evaluation of rheological experiment</title><abstract>A viscoelastic simply supported rotationally symmetric body, fixed on a base, is considered. The body is loaded by a flat plunger, which moves in the direction of the z axis by a constant velocity v. In this work the reaction force is computed. This allows us to compare numerical results with data from rheological experiment (see [6], [7]).  The variational formulation of  the problem is derived and transformed to cylindrical coordinates. Some results of numerical calculations are presented.</abstract><pdfFileUrl>https://acc-ern.tul.cz/archiv/PDF/ACC_2012_4_15.pdf</pdfFileUrl><publicationDate>2012-12-21</publicationDate><pageFrom>129</pageFrom><pageTo>137</pageTo><doi/><keywords><keyword>Viscoelasticity</keyword><keyword>axisymmetric hyperbolic problems</keyword><keyword>dimensional reduction</keyword></keywords></languageVersion><authors><author><name>Petr</name><surname>Salač</surname><order>1</order><instituteAffiliation/><role>AUTHOR</role></author><author><name>Ivo</name><surname>Matoušek</surname><order>2</order><instituteAffiliation/><role>AUTHOR</role></author></authors><references/></article><article externalId="ACC_21542"><type>ORIGINAL_ARTICLE</type><languageVersion externalId="en21542" language="en"><title>Multiplication by wavelet matrix - effective implementation</title><abstract>Stiffness matrix of the Dirichlet problem (auI)I = f with a homogeneous boundary value condition in a spline wavelet basis has O(n log n) non-zero elements [4]. We  show that for a constant function a it is just O(n) and moreover we show that it can be stored in O(1) elements. This leads to a linear-time algorithm for multiplication by the wavelet matrix.</abstract><pdfFileUrl>https://acc-ern.tul.cz/archiv/PDF/ACC_2012_4_16.pdf</pdfFileUrl><publicationDate>2012-12-21</publicationDate><pageFrom>138</pageFrom><pageTo>146</pageTo><doi/><keywords><keyword>Dirichlet problem</keyword><keyword>efficient implementation</keyword><keyword>Galerkin method</keyword><keyword>spline wavelets</keyword></keywords></languageVersion><authors><author><name>Martina</name><surname>Šimůnková</surname><order>1</order><instituteAffiliation/><role>AUTHOR</role></author></authors><references/></article><article externalId="ACC_21543"><type>ORIGINAL_ARTICLE</type><languageVersion externalId="en21543" language="en"><title>Optimal error estimates for nonstationary singularly perturbed problems for low discretization orders</title><abstract>We consider an unsteady 1D singularly perturbed convection–diffusion problem. We discretize such a problem by the linear finite element method (FEM) on a Shishkin mesh and by a discon- tinuous Galerkin method in time. We present optimal a priori error estimates for low order time discretizations.</abstract><pdfFileUrl>https://acc-ern.tul.cz/archiv/PDF/ACC_2012_4_17.pdf</pdfFileUrl><publicationDate>2012-12-21</publicationDate><pageFrom>147</pageFrom><pageTo>154</pageTo><doi/><keywords><keyword>Convection–diffusion</keyword><keyword>Shishkin mesh</keyword><keyword>time discontinuous Galerkin method</keyword></keywords></languageVersion><authors><author><name>Miloslav</name><surname>Vlasák</surname><order>1</order><instituteAffiliation/><role>AUTHOR</role></author><author><name>Hans–Göerg</name><surname>Roos</surname><order>2</order><instituteAffiliation/><role>AUTHOR</role></author></authors><references/></article><article externalId="ACC_21544"><type>ORIGINAL_ARTICLE</type><languageVersion externalId="en21544" language="en"><title>On two flexible methods of 2-dimensional regression analysis</title><abstract>The paper deals with the problem of non-parametric statistical modeling of 2-dimensional sur- faces from observed data, i.e. the regression analysis. In general, the model is constructed from a set of basal functions, as are the splines, gaussians and others. However, such model- ing means to estimate a large set of parameters (locations of functional units and parameters  of their combination). We shall present two approaches allowing reduction of the number of needed parameters. Namely, a well known method of projection pursuit, and the less known method of Gordon surface. Further, we shall analyze possible serious consequences of sparse data to precision of model and uncertainty of prediction. Methods will be illustrated in artificial examples.</abstract><pdfFileUrl>https://acc-ern.tul.cz/archiv/PDF/ACC_2012_4_18.pdf</pdfFileUrl><publicationDate>2012-12-21</publicationDate><pageFrom>155</pageFrom><pageTo>165</pageTo><doi/><keywords><keyword>Statistics</keyword><keyword>regression analysis</keyword><keyword>splines</keyword><keyword>projection pursuit</keyword><keyword>Gordon surface</keyword><keyword>prediction
error</keyword></keywords></languageVersion><authors><author><name>Petr</name><surname>Volf</surname><order>1</order><instituteAffiliation/><role>AUTHOR</role></author></authors><references/></article></issue></ici-import>
	