![](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
Christian Grossmann
Person information
- affiliation: Dresden University of Technology
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
- 2017
- [p1]Christian Großmann, Olaf Graeser, Andreas Schreiber:
ClipX: Auf dem Weg zur Industrialisierung des Schaltschrankbaus. Handbuch Industrie 4.0 (2) 2017: 169-187 - 2011
- [j10]Christian Grossmann, Ranjan Kumar Mohanty, Hans-Goerg Roos:
A direct higher order discretization in singular perturbations via domain split - A computational approach. Appl. Math. Comput. 217(22): 9302-9312 (2011) - [j9]Christian Grossmann, Lars Ludwig, Hans-Görg Roos:
Layer-adapted methods for a singularly perturbed singular problem. Comput. Methods Appl. Math. 11(2): 192-205 (2011)
2000 – 2009
- 2007
- [c3]Christian Grossmann, Holger Kunz, Robert Meischner:
Elliptic Control by Penalty Techniques with Control Reduction. System Modelling and Optimization 2007: 251-267 - 2006
- [c2]Christian Großmann:
Differentiable Local Barrier-Penalty Paths. Systems, Control, Modeling and Optimization 2006: 195-204 - 2004
- [j8]Christian Grossmann, Diethard Klatte, Bernd Kummer:
Convergence of primal-dual solutions for the nonconvex log-barrier method without LICQ. Kybernetika 40(5): 571-584 (2004) - 2001
- [c1]Christian Großmann, Antje Noack, Reiner Vanselow:
On Numerical Problems Caused by Discontinuities in Controls. System Modelling and Optimization 2001: 255-270
1990 – 1999
- 1999
- [j7]Christian Grossmann, A. Ismail:
Parameter selection rules for path-following with singular embedding. Numerische Mathematik 82(4): 647-675 (1999) - 1997
- [j6]F. Al-Musallam, Mansour Al-Zanaidi, Christian Großmann:
A Grid Generator for Problems on Unbounded Intervals with Rationally Decaying Solutions. Computing 58(2): 157-172 (1997) - [j5]E. Adams, K. Baumann, Christian Großmann:
Comparison of Direct to Shooting Enclosures for an Inverse-Monotone Boundary Value Problem with Locally Steep Solution. Computing 59(1): 63-84 (1997) - 1990
- [j4]Mansour Al-Zanaidi, Christian Grossmann:
1D-grid generation by monotone iteration discretization. Computing 43(4): 377-390 (1990)
1980 – 1989
- 1989
- [j3]Mansour Al-Zanaidi, Christian Grossmann:
Monotone iteration discretization algorithm for BVP's. Computing 41(1-2): 59-74 (1989) - 1985
- [j2]Christian Grossmann, Aleksander A. Kaplan:
On the solution of discretized obstacle problems by an adapted penalty method. Computing 35(3-4): 295-306 (1985) - 1983
- [j1]Christian Großmann:
An effective method for solving linear programming problems with flexible constraints. Z. Oper. Research 27(1): 107-122 (1983)
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 23:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint