Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJochen W. Schmidt
Person information
- affiliation: Technical University of Dresden, Dresden, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2001
[j33]Jochen W. Schmidt, Marion Bastian, Bernd Mulansky:
Nonnegative Volume Matching by Cubic C1 Splines on Clough-Tocher Splits. SIAM J. Numer. Anal. 39(2): 566-586 (2001)- 2000
- [j32]Jochen W. Schmidt:
Univariate Strip Interpolations by Nonlinear Parametric Splines. Computing 65(4): 323-337 (2000) - [j31]Bernd Mulansky, Jochen W. Schmidt:
Composition based staircase algorithm and constrained interpolation with boundary conditions. Numerische Mathematik 85(3): 387-408 (2000) - 1999
- [j30]Bernd Mulansky, Jochen W. Schmidt:
Convex interval interpolation using a three-term staircase algorithm. Numerische Mathematik 82(2): 313-337 (1999) - 1998
- [j29]Jochen W. Schmidt, Marion Bastian-Walther:
Algorithm for constructing range restricted histosplines. Numer. Algorithms 17(3-4): 241-260 (1998) - 1997
- [j28]Jochen W. Schmidt:
Interpolation in a Derivative Strip. Computing 58(4): 377-389 (1997) - 1996
- [j27]Bernd Mulansky, Jochen W. Schmidt:
Constructive methods in convexC2 interpolation using quartic splines. Numer. Algorithms 12(1): 111-124 (1996) - 1994
- [j26]Bernd Mulansky, Jochen W. Schmidt:
Powell-Sabin splines in range restricted interpolation of scattered data. Computing 53(2): 137-154 (1994) - 1993
- [j25]Jochen W. Schmidt:
Positive, monotone, and S -convex C 1-histopolation on rectangular grids. Computing 50(1): 19-30 (1993) - 1992
- [j24]Jochen W. Schmidt:
Constrained smoothing of histograms by quadratic splines. Computing 48(1): 97-107 (1992) - [j23]Jochen W. Schmidt:
Positive, monotone, andS-convexC1-interpolation on rectangular grids. Computing 48(3-4): 363-371 (1992) - [j22]Jochen W. Schmidt, Siegfried Dietze:
Unconstrained duals to partially separable constrained programs. Math. Program. 56: 337-341 (1992) - 1991
- [j21]Jochen W. Schmidt:
Rational biquadraicC1-splines inS-convex interpolation. Computing 47(1): 87-96 (1991) - 1990
- [j20]Jochen W. Schmidt, Walter Heß, Th. Nordheim:
Shape preserving histopolation using rational quadratic splines. Computing 44(3): 245-258 (1990) - [j19]Jochen W. Schmidt, Manabu Sakai:
A criterion for the positivity of rational cubicC2-spline interpolants. Computing 44(4): 365-368 (1990) - 1987
- [j18]Jochen W. Schmidt, Walter Heß:
Positive interpolation with rational quadratic splines. Computing 38(3): 261-267 (1987) - [j17]Jochen W. Schmidt:
An unconstrained dual program for computing convex C 1-spline approximants. Computing 39(2): 133-140 (1987) - 1986
- [j16]Walter Heß, Jochen W. Schmidt:
Convexity preserving interpolation with exponential splines. Computing 36(4): 335-342 (1986) - 1985
- [j15]W. Burmeister, Walter Heß, Jochen W. Schmidt:
Convex spline interpolants with minimal curvature. Computing 35(2): 219-229 (1985) - 1984
- [j14]Jochen W. Schmidt, Harald Schneider:
Enclosing methods in perturbed nonlinear operator equations. Computing 32(1): 1-11 (1984) - [j13]Wolfgang Burmeister, Jochen W. Schmidt:
Determination of the cone radius for positive concave operators. Computing 33(1): 37-49 (1984) - 1983
- [j12]W. Burmeister, Jochen W. Schmidt:
On the R-order of coupled sequences III. Computing 30(2): 157-169 (1983) - 1982
- [j11]Wolfgang Burmeister, Jochen W. Schmidt:
On the R-order of coupled sequences II. Computing 29(1): 73-81 (1982) - 1981
- [j10]Jochen W. Schmidt:
On the R-order of coupled sequences. Computing 26(4): 333-342 (1981) - 1978
- [j9]Jochen W. Schmidt, H. Mettke:
Konvergenz von quadratischen Interpolations- und Flächenabgleichssplines. Computing 19(4): 351-363 (1978) - 1977
- [j8]Jochen W. Schmidt:
Ein kubisch konvergentes Einschließungsverfahren zur Inversion positiver Elemente. Computing 19(2): 175-178 (1977) - 1976
- [j7]Jochen W. Schmidt:
Monotone Einschließung von Inversen positiver Elemente durch Verfahren vom Schulz-Typ. Computing 16(3): 211-219 (1976) - [j6]Jochen W. Schmidt, W. Nauber:
Über Verfahren zur zweiseitigen Approximation inverser Elemente. Computing 17(1): 59-67 (1976) - 1971
- [j5]Jochen W. Schmidt:
Eingrenzung von Lösungen nichtlinearer Gleichungen durch Verfahren mit höherer Konvergenzgeschwindigkeit. Computing 8(3-4): 208-215 (1971) - 1970
- [j4]Jochen W. Schmidt, Dieter Leder:
Ableitungsfreie Verfahren ohne Auflösung linearer Gleichungen. Computing 5(1): 71-81 (1970) - [j3]Jochen W. Schmidt, H. Leonhardt:
Eingrenzung von Lösungen mit Hilfe der Regula falsi. Computing 6(3-4): 318-329 (1970) - 1968
- [j2]Jochen W. Schmidt, Hubert Schwetlick:
Ableitungsfreie Verfahren mit höherer Konvergenzgeschwindigkeit. Computing 3(3): 215-226 (1968) - 1966
- [j1]Jochen W. Schmidt, H.-F. Trinkaus:
Extremwertermittlung mit Funktionswerten bei Funktionen von mehreren Veränderlichen. Computing 1(3): 224-232 (1966)
Parts in Books or Collections
- 1996
- [p1]Bernd Mulansky, Jochen W. Schmidt, Marion Walther:
Tensor Product Spline Interpolation subject to Piecewise Bilinear Lower and Upper Bounds. Advanced Course on FAIRSHAPE 1996: 201-216
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-04-30 00:24 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:
