Home > Search Results: Brandts, Jan
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 2 records found  Search took 0.00 seconds. 
A posteriori error estimates for numerical solution of convection-difusion problems
 Šebestová, Ivana ; Dolejší, Vít (advisor) ; Sváček, Petr (referee) ; Brandts, Jan (referee)
This thesis is concerned with several issues of a posteriori error estimates for linear problems. In its first part error estimates for the heat conduction equation discretized by the backward Euler method in time and discontinuous Galerkin method in space are derived. In the second part guaranteed and locally efficient error estimates involving algebraic error for Poisson equation discretized by the discontinuous Galerkin method are derived. The technique is based on the flux reconstruction where meshes with hanging nodes and variable polynomial degree are allowed. An adaptive strategy combining both adaptive mesh refinement and stopping criteria for iterative algebraic solvers is proposed. In the last part a numerical method for computing guaranteed lower and upper bounds of principal eigenvalues of symmetric linear elliptic differential operators is presented. 1
Detailed record
A posteriori error estimates for numerical solution of convection-difusion problems
 Šebestová, Ivana ; Dolejší, Vít (advisor) ; Sváček, Petr (referee) ; Brandts, Jan (referee)
This thesis is concerned with several issues of a posteriori error estimates for linear problems. In its first part error estimates for the heat conduction equation discretized by the backward Euler method in time and discontinuous Galerkin method in space are derived. In the second part guaranteed and locally efficient error estimates involving algebraic error for Poisson equation discretized by the discontinuous Galerkin method are derived. The technique is based on the flux reconstruction where meshes with hanging nodes and variable polynomial degree are allowed. An adaptive strategy combining both adaptive mesh refinement and stopping criteria for iterative algebraic solvers is proposed. In the last part a numerical method for computing guaranteed lower and upper bounds of principal eigenvalues of symmetric linear elliptic differential operators is presented. 1
Detailed record

See also: similar author names
1 Brandts, J.
Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English