Position within the page tree

Home
Institute
Team
Seus, David

David Seus

Dr. rer.nat.

Research assistant
Institute of Applied Analysis and Numerical Simulation
Chair of Applied Mathematics

Contact

+49 711 685 61994
Email

Pfaffenwaldring 57
70569 Stuttgart
Deutschland
Room: 7.162

Publications

2019
1. D. Seus, F. A. Radu, and C. Rohde, “A linear domain decomposition method for two-phase flow in porous media,” Numerical Mathematics and Advanced Applications ENUMATH 2017, pp. 603–614, 2019, doi: https://doi.org/10.1007/978-3-319-96415-7_55.
  - BibTeX
  - Link
  BibTeX
  @article{seus2019linear, abstract = {This article is a follow up of our submitted paper (D. Seus et al, Comput Methods Appl Mech Eng 333:331--355, 2018) in which a decomposition of the Richards equation along two soil layers was discussed. A decomposed problem was formulated and a decoupling and linearisation technique was presented to solve the problem in each time step in a fixed point type iteration. This article extends these ideas to the case of two-phase in porous media and the convergence of the proposed domain decomposition method is rigorously shown."}, author = {Seus, David and Radu, Florin A. and Rohde, Christian}, doi = {https://doi.org/10.1007/978-3-319-96415-7_55}, editor = {Radu, Florin Adrian and Kumar, Kundan and Berre, Inga and Nordbotten, Jan Martin and Pop, Iuliu Sorin}, isbn = {978-3-319-96415-7}, journal = {Numerical Mathematics and Advanced Applications ENUMATH 2017}, pages = {603-614}, publisher = {Springer International Publishing}, title = {A linear domain decomposition method for two-phase flow in porous media}, url = {https://www.springerprofessional.de/a-linear-domain-decomposition-method-for-two-phase-flow-in-porou/16377432}, year = 2019 }
  Link
  https://www.springerprofessional.de/a-linear-domain-decomposition-method-for-two-phase-flow-in-porou/16377432
2018
1. D. Seus, I. S. Pop, C. Rohde, K. Mitra, and F. Radu, “A linear domain decompostition method for partially saturated flow in porous media,” Comput. Methods Appl. Mech. Eng., vol. 333, pp. 331–355, 2018, doi: https://doi.org/10.1016/j.cma.2018.01.029.
  - BibTeX
  - Link
  BibTeX
  @article{seus2018linear, author = {Seus, David and Pop, Iuliu S. and Rohde, Christian and Mitra, K. and Radu, Florin}, doi = {https://doi.org/10.1016/j.cma.2018.01.029}, journal = {Comput. Methods Appl. Mech. Eng.}, pages = {331-355}, title = {A linear domain decompostition method for partially saturated flow in porous media}, url = {https://doi.org/10.1016/j.cma.2018.01.029}, volume = 333, year = 2018 }
  Link
  https://doi.org/10.1016/j.cma.2018.01.029
2016
1. R. Cavoretto, S. De Marchi, A. De Rossi, E. Perracchione, and G. Santin, “Partition of unity interpolation using stable kernel-based techniques,” Applied Numerical Mathematics, 2016, doi: 10.1016/j.apnum.2016.07.005.
  - BibTeX
  - Link
  BibTeX
  @article{cavoretto2016partition, abstract = {In this paper we propose a new stable and accurate approximation technique which is extremely effective for interpolating large scattered data sets. The Partition of Unity (PU) method is performed considering Radial Basis Functions (RBFs) as local approximants and using locally supported weights. In particular, the approach consists in computing, for each \{PU\} subdomain, a stable basis. Such technique, taking advantage of the local scheme, leads to a significant benefit in terms of stability, especially for flat kernels. Furthermore, an optimized searching procedure is applied to build the local stable bases, thus rendering the method more efficient.}, author = {Cavoretto, Roberto and De Marchi, Stefano and De Rossi, Alessandra and Perracchione, Emma and Santin, Gabriele}, doi = {10.1016/j.apnum.2016.07.005}, journal = {Applied Numerical Mathematics}, owner = {santinge}, title = {Partition of unity interpolation using stable kernel-based techniques}, url = {http://dx.doi.org/10.1016/j.apnum.2016.07.005}, year = 2016 }
  Link
  http://dx.doi.org/10.1016/j.apnum.2016.07.005
2013
1. D. Seus, “Spektralasymptotiken auf dem Loopgraphen,” 2013.
  - BibTeX
  BibTeX
  @mastersthesis{seus2013spektralasymptotiken, author = {Seus, David}, owner = {seus}, school = {Universit\"at Stuttgart}, title = {Spektralasymptotiken auf dem Loopgraphen}, year = 2013 }
2. B. Haasdonk, “Convergence Rates of the POD--Greedy Method,” ESAIM: Mathematical Modelling and Numerical Analysis, vol. 47, Art. no. 3, 2013, doi: 10.1051/m2an/2012045.
  - BibTeX
  - Link
  BibTeX
  @article{haasdonk2013convergence, abstract = {Iterative approximation algorithms are successfully applied in parametric approximation tasks. In particular, reduced basis methods make use of the so-called Greedy algorithm for approximating solution sets of parametrized partial differential equations. Recently, a-priori convergence rate statements for this algorithm have been given (Buffa et al 2009, Binev et al. 2010). The goal of the current study is the extension to time-dependent problems, which are typically approximated using the POD-Greedy algorithm (Haasdonk and Ohlberger 2008). In this algorithm, each greedy step is invoking a temporal compression step by performing a proper orthogonal decomposition (POD). Using a suitable coefficient representation of the POD-Greedy algorithm, we show that the existing convergence rate results of the Greedy algorithm can be extended. In particular, exponential or algebraic convergence rates of the Kolmogorov n-widths are maintained by the POD-Greedy algorithm.}, author = {Haasdonk, B.}, doi = {10.1051/m2an/2012045}, file = {:http\://www.mathematik.uni-stuttgart.de/fak8/ians/publications/files/H13_www_preprint_POD_Greedy_Convergence.pdf:PDF}, journal = {{ESAIM}: Mathematical Modelling and Numerical Analysis}, number = 3, owner = {schmidta}, pages = {859--873}, publisher = {{EDP} Sciences}, qualityassured = {qualityAssured}, title = {Convergence Rates of the {POD}--{G}reedy Method}, url = {http://dx.doi.org/10.1051/m2an/2012045}, volume = 47, year = 2013 }
  Link
  http://dx.doi.org/10.1051/m2an/2012045
2005
1. R. H. Nochetto, K. G. Siebert, and A. Veeser, “Fully Localized A Posteriori Error Estimators and Barrier Sets for Contact Problems,” SIAM Journal on Numerical Analysis, vol. 42, Art. no. 5, 2005, doi: 10.1137/S0036142903424404.
  - BibTeX
  - Link
  BibTeX
  @article{nochetto2005fully, abstract = {We derive novel pointwise a posteriori error estimators for elliptic obstacle problems which, except for obstacle resolution, completely vanish within the full-contact set (localization). We then construct a posteriori barrier sets for free boundaries under a natural stability (or nondegeneracy) condition. We illustrate localization properties as well as reliability and efficiency for both solutions and free boundaries via several simulations in 2 and 3 dimensions.}, author = {Nochetto, Ricardo H. and Siebert, Kunibert G. and Veeser, Andreas}, doi = {10.1137/S0036142903424404}, journal = {SIAM Journal on Numerical Analysis}, language = {English}, number = 5, owner = {kohlsk}, pages = {2118-2135}, title = {Fully Localized A Posteriori Error Estimators and Barrier Sets for Contact Problems}, url = {http://dx.doi.org/10.1137/S0036142903424404}, volume = 42, year = 2005 }
  Link
  http://dx.doi.org/10.1137/S0036142903424404
1999
1. A. Schmidt and K. G. Siebert, “Abstract Data Structures for a Finite Element Package: Design Principles of ALBERT,” Journal of Applied Mathematics and Mechanics, vol. 79, Art. no. 1, 1999, [Online]. Available: http://www.alberta-fem.de/design.html
  - BibTeX
  - Link
  BibTeX
  @article{schmidt1999abstract, abstract = {ALBERTA is an Adaptive multiLevel finite element toolbox using Bisectioning refinement and Error control by Residual Techniques for scientific Applications. Its design is based on appropriate data structures holding geometrical, finite element, and algebraic information. Using such data structures, abstract adaptive methods for stationary and time dependent problems, assembly tools for discrete systems, and dimension dependent tasks like mesh modifications can be provided in a library. This allows dimension-independent development and programming of a general class of applications. In ALBERTA, hierarchical 2d and 3d meshes are stored in binary trees. Several sets of finite elements can be used on the same mesh, either using predefined ones, or by adding new sets for special applications. Depending on the currently used finite element spaces, all degrees of freedom are automatically managed during mesh modifications.}, author = {Schmidt, Alfred and Siebert, Kunibert G.}, journal = {Journal of Applied Mathematics and Mechanics}, number = 1, owner = {kohlsk}, pages = {49-52}, title = {Abstract Data Structures for a Finite Element Package: Design Principles of \textsf{ALBERT}}, url = {http://www.alberta-fem.de/design.html}, volume = 79, year = 1999 }
  Link
  http://www.alberta-fem.de/design.html

Team page

David Seus

Contact

Publications

2019

BibTeX

Link

2018

BibTeX

Link

2016

BibTeX

Link

2013

BibTeX

BibTeX

Link

2005

BibTeX

Link

1999

BibTeX

Link

Audience

Formalities

Services

Organization

David Seus

Contact

Publications

2019

BibTeX

Link

2018

BibTeX

Link

2016

BibTeX

Link

2013

BibTeX

BibTeX

Link

2005

BibTeX

Link

1999

BibTeX

Link

Here you can reach us

Audience

Formalities

Services

Organization