Nonconforming P1 elements on distorted triangulations: Lower bounds for the discrete energy norm error
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
In: https://doi.org/10.21136/AM.2017.0150-17
In: Bonn : Institut für Numerische Simulation (INS), 2016
- Bibliographic citation
-
INS Preprints ; 1618
- Event
-
Veröffentlichung
- (where)
-
Bonn
- (who)
-
Universitäts- und Landesbibliothek Bonn
- (when)
-
2016
- Creator
-
Oswald, Peter
- Handle
-
20.500.11811/11847
- URN
-
urn:nbn:de:101:1-2408220255191.538585129850
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:42 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Oswald, Peter
- Universitäts- und Landesbibliothek Bonn
Time of origin
- 2016
Other Objects (12)
Network decomposition-based lower and upper bounds for the discrete time-cost tradeoff problem
Error Bounds for Computer Arithmetics
Guaranteed lower bounds for eigenvalues
Lower Bounds for Heuristic Algorithms
Lower bounds for RCPSP-max
Upper and Lower Tight Error Bounds for Feature Omission with an Extension to Context Reduction
Resolution Lower Bounds for Refutation Statements
Bisimulation on Speed: Lower Time Bounds
Lower bounds for Auslander's representation dimension
Guaranteed lower bounds to effective stiffness
Inferring Lower Bounds for Runtime Complexity
Zero Lower Bound on Inflation Expectations
Network decomposition-based lower and upper bounds for the discrete time-cost tradeoff problem
Error Bounds for Computer Arithmetics
Guaranteed lower bounds for eigenvalues
Lower Bounds for Heuristic Algorithms
Lower bounds for RCPSP-max
Upper and Lower Tight Error Bounds for Feature Omission with an Extension to Context Reduction
Resolution Lower Bounds for Refutation Statements
Bisimulation on Speed: Lower Time Bounds
Lower bounds for Auslander's representation dimension
Guaranteed lower bounds to effective stiffness
Inferring Lower Bounds for Runtime Complexity
Zero Lower Bound on Inflation Expectations
Network decomposition-based lower and upper bounds for the discrete time-cost tradeoff problem
Error Bounds for Computer Arithmetics
Guaranteed lower bounds for eigenvalues
Lower Bounds for Heuristic Algorithms
Lower bounds for RCPSP-max
Upper and Lower Tight Error Bounds for Feature Omission with an Extension to Context Reduction
Resolution Lower Bounds for Refutation Statements
Bisimulation on Speed: Lower Time Bounds
Lower bounds for Auslander's representation dimension
Guaranteed lower bounds to effective stiffness
Inferring Lower Bounds for Runtime Complexity