![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Dietrich Braess
Person information
- affiliation: Ruhr University Bochum, Germany
Refine list
![note](https://dblp.uni-trier.de./img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j21]Dietrich Braess, Thomas Fraunholz
, R. H. W. Hoppe:
An Equilibrated A Posteriori Error Estimator for the Interior Penalty Discontinuous Galerkin Method. SIAM J. Numer. Anal. 52(4): 2121-2136 (2014) - 2010
- [j20]Dietrich Braess, Pingbing Ming, Zhongci Shi:
Shear Locking in a Plane Elasticity Problem and the Enhanced Assumed Strain Method. SIAM J. Numer. Anal. 47(6): 4473-4491 (2010)
2000 – 2009
- 2008
- [j19]Dietrich Braess, Joachim Schöberl:
Equilibrated residual error estimator for edge elements. Math. Comput. 77(262): 651-672 (2008) - 2007
- [j18]Dietrich Braess, Carsten Carstensen, Ronald H. W. Hoppe:
Convergence analysis of a conforming adaptive finite element method for an obstacle problem. Numerische Mathematik 107(3): 455-471 (2007) - 2006
- [j17]Sven Beuchler, Dietrich Braess:
Improvements for some condition number estimates for preconditioned system in p-FEM. Numer. Linear Algebra Appl. 13(7): 573-588 (2006) - 2005
- [j16]Dietrich Braess, Pingbing Ming:
A finite element method for nearly incompressible elasticity problems. Math. Comput. 74(249): 25-52 (2005) - [j15]Dietrich Braess:
A posteriori error estimators for obstacle problems - another look. Numerische Mathematik 101(3): 415-421 (2005) - [j14]Dietrich Braess, Anna Nagurney, Tina Wakolbinger
:
On a Paradox of Traffic Planning. Transp. Sci. 39(4): 446-450 (2005) - 2004
- [j13]Dietrich Braess, Tomas Sauer:
Bernstein polynomials and learning theory. J. Approx. Theory 128(2): 187-206 (2004) - [j12]Dietrich Braess, Carsten Carstensen, B. Daya Reddy
:
Uniform convergence and a posteriori error estimators for the enhanced strain finite element method. Numerische Mathematik 96(3): 461-479 (2004) - 2002
- [j11]Dietrich Braess, Peter Deuflhard, Konstantin Lipnikov:
A Subspace Cascadic Multigrid Method for Mortar Elements. Computing 69(3): 205-225 (2002) - [c1]Dietrich Braess, Jürgen Forster, Tomas Sauer, Hans Ulrich Simon
:
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution. ALT 2002: 380-394
1990 – 1999
- 1999
- [j10]Dietrich Braess, Maksimillian Dryja, Wolfgang Hackbusch:
A Multigrid Method for Nonconforming FE-Discretisations with Application to Non-Matching Grids. Computing 63(1): 1-25 (1999) - [j9]Dietrich Braess, Wolfgang Dahmen:
A cascadic multigrid algorithm for the Stokes equations. Numerische Mathematik 82(2): 179-191 (1999) - [j8]Dietrich Braess, Wolfgang Dahmen, Christian Wieners:
A Multigrid Algorithm for the Mortar Finite Element Method. SIAM J. Numer. Anal. 37(1): 48-69 (1999) - 1995
- [j7]Dietrich Braess:
Towards Algebraic Multigrid for Elliptic Problems of Second Order. Computing 55(4): 379-393 (1995) - 1992
- [b1]Dietrich Braess:
Finite Elemente - Theorie, schnelle Löser und Anwendungen in der Elastizitätstheorie. Springer 1992, ISBN 978-3-540-54794-5, pp. I-XIV, 1-302
1970 – 1979
- 1975
- [j6]Dietrich Braess:
Anregungen aus dem Schnittebenenverfahren für die Lösung des allgemeinen Transportproblems. Computing 15(2): 157-167 (1975) - 1971
- [j5]Dietrich Braess:
Die Bestimmung kürzester Pfade in Graphen und passende Datenstrukturen. Computing 8(1-2): 171-181 (1971) - 1970
- [j4]Robert Schaback, Dietrich Braess:
Eine Lösungsmethode für die lineare Tschebyscheff-Approximation bei nicht erfüllter Haarscher Bedingung. Computing 6(3-4): 289-294 (1970)
1960 – 1969
- 1968
- [j3]Dietrich Braess:
Über ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung 12(1): 258-268 (1968) - 1967
- [j2]Dietrich Braess:
Approximation mit Exponentialsummen. Computing 2(4): 309-321 (1967) - 1966
- [j1]Dietrich Braess:
Über Dämpfung bei Minimalisierungsverfahren. Computing 1(3): 264-272 (1966)
Coauthor Index
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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-04-24 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint