default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergey Korotov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j32]Sergey Korotov, Michal Krízek:
Divergence-free finite element spaces for stress tensors. J. Comput. Appl. Math. 438: 115537 (2024)- 2023
- [j31]Sergey Korotov
, Jon Eivind Vatne:
On Dihedral Angle Sums of Prisms and Hexahedra. Int. J. Comput. Geom. Appl. 33(3&4): 85-95 (2023) - [c8]Sergey Korotov, Michal Krízek:
Mathematical and Computational Modeling of a Nonlinear Elliptic Problem in Divergence Form. LSSC 2023: 343-353 - 2022
- [j30]Sergey Korotov, Michal Krízek, Václav Kucera:
On degenerating finite element tetrahedral partitions. Numerische Mathematik 152(2): 307-329 (2022) - 2021
- [j29]Sergey Korotov, Lars Fredrik Lund, Jon Eivind Vatne:
Improved Maximum Angle Estimate for Longest-Edge Bisection. Int. J. Comput. Geom. Appl. 31(4): 183-192 (2021) - [c7]Sergey Korotov, Michal Krízek:
Degeneracy of Tetrahedral Partitions Produced by Randomly Generated Red Refinements. LSSC 2021: 140-147 - 2020
- [j28]Sergey Korotov, Jon Eivind Vatne:
The minimum angle condition for d-simplices. Comput. Math. Appl. 80(2): 367-370 (2020)
2010 – 2019
- 2019
- [j27]Ali Khademi, Sergey Korotov, Jon Eivind Vatne:
On the generalization of the Synge-Křížek maximum angle condition for d-simplices. J. Comput. Appl. Math. 358: 29-33 (2019) - [c6]Ali Khademi, Sergey Korotov, Jon Eivind Vatne:
On Mesh Regularity Conditions for Simplicial Finite Elements. ENUMATH 2019: 633-640 - 2018
- [j26]Juliana S. Ziebell, Leandro Farina, Sergey Korotov:
Resuspension and transport of fine sediments by waves over a thin layer of viscoelastic mud with erosion. J. Comput. Appl. Math. 340: 745-752 (2018) - 2017
- [j25]Leandro Farina, Rômulo L. da Gama, Sergey Korotov, Juliana S. Ziebell:
Radiation of water waves by a submerged nearly circular plate. J. Comput. Appl. Math. 310: 165-173 (2017) - [j24]István Faragó, János Karátson, Sergey Korotov:
Discrete nonnegativity for nonlinear cooperative parabolic PDE systems with non-monotone coupling. Math. Comput. Simul. 139: 37-53 (2017) - 2016
- [j23]Sergey Korotov, Ángel Plaza, José P. Suárez:
Longest-edge n-section algorithms: Properties and open problems. J. Comput. Appl. Math. 293: 139-146 (2016) - 2015
- [j22]Sergey Korotov, Ángel Plaza, José P. Suárez:
On the maximum angle condition for the conforming longest-edge n-section algorithm for large values of n. Comput. Aided Geom. Des. 32: 69-73 (2015) - [j21]János Karátson, Sergey Korotov:
Some discrete maximum principles arising for nonlinear elliptic finite element problems. Comput. Math. Appl. 70(11): 2732-2741 (2015) - [c5]Sergey Korotov, Talal Rahman:
On Conforming Local Post-refinement of Adjacent Tetrahedral and Hexahedral Meshes. PPAM (2) 2015: 365-370 - 2014
- [j20]Sergey Korotov, Michal Krízek:
Red refinements of simplices into congruent subsimplices. Comput. Math. Appl. 67(12): 2199-2204 (2014) - [j19]Antti Hannukainen, Sergey Korotov, Michal Krízek:
On numerical regularity of the face-to-face longest-edge bisection algorithm for tetrahedral partitions. Sci. Comput. Program. 90: 34-41 (2014) - 2013
- [j18]István Faragó, Sergey Korotov, Tamás Szabó:
On continuous and discrete maximum principles for elliptic problems with the third boundary condition. Appl. Math. Comput. 219(13): 7215-7224 (2013) - [j17]Sergey Korotov, Michal Krízek:
Local nonobtuse tetrahedral refinements around an edge. Appl. Math. Comput. 219(13): 7236-7240 (2013) - 2012
- [j16]Antti Hannukainen, Sergey Korotov, Michal Krízek:
The maximum angle condition is not necessary for convergence of the finite element method. Numerische Mathematik 120(1): 79-88 (2012) - 2011
- [j15]Sergey Korotov, Michal Krízek:
Nonobtuse local tetrahedral refinements towards a polygonal face/interface. Appl. Math. Lett. 24(6): 817-821 (2011) - 2010
- [j14]Antti Hannukainen, Sergey Korotov, Michal Krízek:
On global and local mesh refinements by a generalized conforming bisection algorithm. J. Comput. Appl. Math. 235(2): 419-436 (2010) - [j13]Dmitri Kuzmin, Sergey Korotov:
Goal-oriented a posteriori error estimates for transport problems. Math. Comput. Simul. 80(8): 1674-1683 (2010) - [j12]Tomás Vejchodský, Sergey Korotov, Antti Hannukainen:
Discrete maximum principle for parabolic problems solved by prismatic finite elements. Math. Comput. Simul. 80(8): 1758-1770 (2010)
2000 – 2009
- 2009
- [j11]Jan Brandts, Sergey Korotov, Michal Krízek:
On the equivalence of ball conditions for simplicial finite elements in Rd. Appl. Math. Lett. 22(8): 1210-1212 (2009) - [j10]János Karátson, Sergey Korotov:
An Algebraic Discrete Maximum Principle in Hilbert Space with Applications to Nonlinear Cooperative Elliptic Systems. SIAM J. Numer. Anal. 47(4): 2518-2549 (2009) - [j9]Jan Brandts, Sergey Korotov, Michal Krízek, Jakub Solc:
On Nonobtuse Simplicial Partitions. SIAM Rev. 51(2): 317-335 (2009) - [c4]Antti Hannukainen, Sergey Korotov, Michal Krízek:
On a Bisection Algorithm That Produces Conforming Locally Refined Simplicial Meshes. LSSC 2009: 571-579 - 2008
- [j8]Jan Brandts, Sergey Korotov, Michal Krízek:
On the equivalence of regularity criteria for triangular and tetrahedral finite element partitions. Comput. Math. Appl. 55(10): 2227-2233 (2008) - [c3]Antti Hannukainen, Sergey Korotov, Tomás Vejchodský:
On Weakening Conditions for Discrete Maximum Principles for Linear Finite Element Schemes. NAA 2008: 297-304 - [c2]Sergey Korotov, Michal Krízek, Jakub Solc:
On a Discrete Maximum Principle for Linear FE Solutions of Elliptic Problems with a Nondiagonal Coefficient Matrix. NAA 2008: 384-391 - 2007
- [j7]János Karátson, Sergey Korotov, Michal Krízek:
On discrete maximum principles for nonlinear elliptic problems. Math. Comput. Simul. 76(1-3): 99-108 (2007) - 2005
- [j6]János Karátson, Sergey Korotov:
Discrete maximum principles for finite element solutions of nonlinear elliptic problems with mixed boundary conditions. Numerische Mathematik 99(4): 669-698 (2005) - 2004
- [c1]Jan Brandts, Sergey Korotov, Michal Krízek:
The Strengthened Cauchy-Bunyakowski-Schwarz Inequality for n-Simplicial Linear Finite Elements. NAA 2004: 203-210 - 2003
- [j5]Sergey Korotov, Michal Krízek:
Local nonobtuse tetrahedral refinements of a cube. Appl. Math. Lett. 16(7): 1101-1104 (2003) - [j4]Sergey Korotov, Pekka Neittaanmäki, Sergey I. Repin:
A posteriori error estimation of goal-oriented quantities by the superconvergence patch recovery. J. Num. Math. 11(1): 33-59 (2003) - 2001
- [j3]Sergey Korotov, Michal Krízek, Pekka Neittaanmäki:
Weakened acute type condition for tetrahedral triangulations and the discrete maximum principle. Math. Comput. 70(233): 107-119 (2001) - [j2]Sergey Korotov, Michal Krízek:
Acute Type Refinements of Tetrahedral Partitions of Polyhedral Domains. SIAM J. Numer. Anal. 39(2): 724-733 (2001) - 2000
- [j1]Sergey Korotov, Michal Krízek:
Finite element analysis of varitional crimes for a quasilinear elliptic problem in 3D. Numerische Mathematik 84(4): 549-576 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
