Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Vejchodský, T."'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Chleboun, J., Segeth, K.., Vejchodský, T., Programs and algorithms of numerical mathematics May, 28.-31. 2006 ; Prague, Czech Republic)
Publikováno v:
ABA007
AK3608
AK3608
edited by J. Chleboun, K. Segeth, T. Vejchodský.
Externí odkaz:
Digitální knihovna AV ČR
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642004636
NAA
NAA
In this work we discuss weakening requirements on the set of sufficient conditions due to Ph. Ciarlet [4,5] for matrices associated to linear finite element schemes, which is commonly used for proving validity of discrete maximum principles (DMPs) fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07659be67eb5ee7c06dba330d74ae095
https://ora.ox.ac.uk/objects/uuid:eff5ccb0-afbc-4f5b-9dcd-1d3b8591ce68
https://ora.ox.ac.uk/objects/uuid:eff5ccb0-afbc-4f5b-9dcd-1d3b8591ce68
Autor:
Vejchodský, T
The error of the finite element solution of linear elliptic problems can be estimated a posteriori by the classical hypercircle method. This method gives accurate and guaranteed upper bound of the error measured in the energy norm. The disadvantage i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::bc9a73c194624fcbdce716e8e0d26a32
https://ora.ox.ac.uk/objects/uuid:095eb8b7-0263-4082-a3d1-3edf1de940ca
https://ora.ox.ac.uk/objects/uuid:095eb8b7-0263-4082-a3d1-3edf1de940ca
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Proceedings of the International Conference Applications of Mathematics 2013: Prague, May 15-17, 2013: in honor of the 70th birthday of Karel Segeth, 1-12
STARTPAGE=1;ENDPAGE=12;TITLE=Proceedings of the International Conference Applications of Mathematics 2013: Prague, May 15-17, 2013: in honor of the 70th birthday of Karel Segeth
STARTPAGE=1;ENDPAGE=12;TITLE=Proceedings of the International Conference Applications of Mathematics 2013: Prague, May 15-17, 2013: in honor of the 70th birthday of Karel Segeth
This paper is about 0/1-triangles, which are the simplest nontrivial examples of 0/1-polytopes: convex hulls of a subset of vertices of the unit n-cube In. We consider the subclasses of right 0/1-triangles, and acute 0/1-triangles, which only have ac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::9afbdd76ddca71867f9ad96ada2b380d
https://dare.uva.nl/personal/pure/en/publications/counting-triangles-that-share-their-vertices-with-the-unit-ncube(32d94e5f-ce17-437f-9fc4-efaa54d34897).html
https://dare.uva.nl/personal/pure/en/publications/counting-triangles-that-share-their-vertices-with-the-unit-ncube(32d94e5f-ce17-437f-9fc4-efaa54d34897).html
Autor:
Brandts, J., van Hooff, J., Kuiper, C., Steenkamp, R., Chleboun, J., Korotov, S., Segeth, K., Šístek, J., Vejchodský, T.
Publikováno v:
Proceedings of the International Conference Applications of Mathematics 2012: in honor of the 60th birthday of Michal Křížek, 31-42
STARTPAGE=31;ENDPAGE=42;TITLE=Proceedings of the International Conference Applications of Mathematics 2012: in honor of the 60th birthday of Michal Křížek
STARTPAGE=31;ENDPAGE=42;TITLE=Proceedings of the International Conference Applications of Mathematics 2012: in honor of the 60th birthday of Michal Křížek
Cottle's proof that the minimal number of 0=1-simplices needed to triangulate the unit 4-cube equals 16 uses a modest amount of computer generated results. In this paper we remove the need for computer aid, using some lemmas that may be useful also i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::59a4f889b699585bac733a2a8b76bac8
https://dare.uva.nl/personal/pure/en/publications/from-binary-cube-triangulations-to-acute-binary-simplices(c89e2b63-98d5-4e0f-a96f-092688e69f88).html
https://dare.uva.nl/personal/pure/en/publications/from-binary-cube-triangulations-to-acute-binary-simplices(c89e2b63-98d5-4e0f-a96f-092688e69f88).html
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::bcb06342deac9445ab8dc5cfc351b283
https://dare.uva.nl/personal/pure/en/publications/proceedings-of-the-international-conference-applications-of-mathematics-2012-in-honor-of-the-60th-birthday-of-michal-krizek(e379282f-17ad-44fa-a586-47d2b0c180d5).html
https://dare.uva.nl/personal/pure/en/publications/proceedings-of-the-international-conference-applications-of-mathematics-2012-in-honor-of-the-60th-birthday-of-michal-krizek(e379282f-17ad-44fa-a586-47d2b0c180d5).html
Autor:
Vejchodský, T, Šolín, P
Publikováno v:
Advances in Applied Mathematics and Mechanics. 1(2)
We present a proof of the discrete maximum principle (DMP) for the 1D Poisson equation -u″=f equipped with mixed Dirichlet-Neumann boundary conditions. The problem is discretized using finite elements of arbitrary lengths and polynomial degrees (hp