default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNumerische Mathematik, Volume 1
Volume 1, 1959
- Eduard Stiefel:
Über diskrete und lineare Tschebyscheff-Approximationen. 1-28 - Alston S. Householder, Friedrich L. Bauer:
On certain methods for expanding the characteristic polynomial. 29-37 - Morris Weisfeld:
Orthogonal polynomials in several variables. 38-40 - Alan J. Perlis, Klaus Samelson:
Report on the Algorithmic Language ALGOL the ACM committee on programming languages and the GAMM committee on programming. 41-60 - Lothar Collatz, J. Schröder:
Einschließen der Lösungen von Randwertaufgaben. 61-72 - W. Dück:
Eine Fehlerabschätzung zum Einzelschrittverfahren bei linearen Gleichungssystemen. 73-77 - Erwin Kreyszig, John Todd:
The radius of univalence of the error function. 78-89 - Stig Comét:
Über die Anwendung von Binärmodellen in der Theorie der Charaktere der symmetrischen Gruppen. 90-109 - Alwin Walther, Heinz Schappert:
Numerische Behandlung des Gelenkvierecks. 110-120 - Harvey Cohn:
Numerical study of the representation of a totally positive quadratic integer as the sum of quadratic integral squares. 121-134 - G. Bertram:
Verschärfung einer Fehlerabschätzung zum Ritz-Galerkinschen Verfahren von Kryloff für Randwertaufgaben. 135-141 - Peter Wynn:
On the propagation of error in certain non-linear algorithms. 142-149 - J. H. Wilkinson:
The evaluation of the zeros of ill-conditioned polynomials. Part I. 150-166 - J. H. Wilkinson:
The evaluation of the zeros of ill-conditioned polynomials. Part II. 167-180 - G. Bertram:
Eine Fehlerabschätzung für gewisse selbstadjungierte, gewöhnliche Randwertaufgaben. 181-185 - Heinz-Otto Kreiss:
Über die Differenzapproximation hoher Genauigkeit bei Anfangswertproblemen für partielle Differentialgleichungen. 186-202 - Peter Wynn:
A sufficient condition for the instability of theq-d algorithm. 203-207 - Friedrich L. Bauer, Hans J. Stetter:
Zur numerischen Fourier-Transformation. 208-220 - P. C. Sikkema:
Über den Grad der Approximation mit Bernstein-Polynomen. 221-239 - Seymour V. Parter:
On "two-line" iterative methods for the Laplace and biharmonic difference equations. 240-252 - Elliot Ward Cheney, Allen A. Goldstein:
Newton's method for convex programming and Tchebycheff approximation. 253-268 - Edsger W. Dijkstra:
A note on two problems in connexion with graphs. 269-271 - Peter Wynn:
Converging factors for continued fractions. 272-307 - Peter Wynn:
Converging factors for continued fractions. 308-320
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.
last updated on 2024-12-22 19:01 CET 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:
