default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKnut Petras
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2006
[j11]Thomas Müller-Gronbach, Erich Novak, Knut Petras:
Special issue. J. Complex. 22(1): 3 (2006)- [j10]Knut Petras, Klaus Ritter:
On the complexity of parabolic initial-value problems with variable drift. J. Complex. 22(1): 118-145 (2006) - 2004
- [j9]Knut Petras:
Numerical Computation of an Integral Representation for Arithmetic-Average Asian Options. Computing 73(1): 25-39 (2004) - 2003
- [j8]Knut Petras:
Smolyak cubature of given polynomial degree with few nodes for increasing dimension. Numerische Mathematik 93(4): 729-753 (2003) - [j7]Franz Peherstorfer, Knut Petras:
Stieltjes Polynomials and Gauss-Kronrod Quadrature for Jacobi Weight Functions. Numerische Mathematik 95(4): 689-706 (2003) - 2001
- [j6]Knut Petras:
Fast calculation of coefficients in the Smolyak algorithm. Numer. Algorithms 26(2): 93-109 (2001) - 2000
- [j5]Knut Petras:
On the Smolyak cubature error for analytic functions. Adv. Comput. Math. 12(1): 71-93 (2000) - [j4]Franz Peherstorfer, Knut Petras:
Ultraspherical Gauss-Kronrod Quadrature Is Not Possible for λ > 3. SIAM J. Numer. Anal. 37(3): 927-948 (2000) - 1998
- [j3]Knut Petras:
On the Complexity of Self-Validating Numerical Integration and Approximation of Functions with Singularities. J. Complex. 14(3): 302-318 (1998) - 1996
- [j2]Carsten Katscher, Erich Novak, Knut Petras:
Quadrature Formulas for Multivariate Convex Functions. J. Complex. 12(1): 5-16 (1996) - 1995
- [j1]Knut Petras:
Gaussian integration of Chebyshev polynomials and analytic functions. Numer. Algorithms 10(1): 187-202 (1995)
Conference and Workshop Papers
- 2003
- [c1]Markus Grimmer, Knut Petras, Nathalie Revol:
Multiple Precision Interval Packages: Comparing Different Approaches. Numerical Software with Result Verification 2003: 64-90
Editorship
- 2005
- [e1]Thomas Müller-Gronbach, Erich Novak, Knut Petras, Joseph F. Traub:
Algorithms and Complexity for Continuous Problems, 26. September - 1. October 2004. Dagstuhl Seminar Proceedings 04401, IBFI, Schloss Dagstuhl, Germany 2005 [contents]
Informal and Other Publications
- 2004
- [i3]Thomas Müller-Gronbach, Erich Novak, Knut Petras, Joseph F. Traub:
04401 Summary - Algorithms and Complexity for Continuous Problems. Algorithms and Complexity for Continuous Problems 2004 - [i2]Thomas Müller-Gronbach, Erich Novak, Knut Petras, Joseph F. Traub:
04401 Abstracts Collection - Algorithms and Complexity for Continuous. Algorithms and Complexity for Continuous Problems 2004 - [i1]Knut Petras, Klaus Ritter:
On the Complexity of Parabolic Initial Value Problems with Variable Drift. Algorithms and Complexity for Continuous Problems 2004
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-25 05:57 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:
