ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (5)
  • Articles: DFG German National Licenses  (5)
  • CR: 5.13  (5)
  • 2010-2014
  • 1980-1984  (5)
  • 1950-1954
  • 1980  (5)
  • Mathematics  (5)
  • History
Collection
  • Articles  (5)
Source
  • Articles: DFG German National Licenses  (5)
Publisher
Years
  • 2010-2014
  • 1980-1984  (5)
  • 1950-1954
Year
Topic
  • Mathematics  (5)
  • History
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 35 (1980), S. 361-368 
    ISSN: 0945-3245
    Keywords: AMS(MOS) 65D15 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary This paper shows that a computational procedure for approximation of random functions can be accomplished using purely linear programming techniques. This contrasts with previous results which use a twostage approach for the computation, one of which requires linear programming techniques. Computational results are given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 34 (1980), S. 439-455 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D15 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary Strong uniqueness has proved to be an important condition in demonstrating the second order convergence of the generalised Gauss-Newton method for discrete nonlinear approximation problems [4]. Here we compare strong uniqueness with the multiplier condition which has also been used for this purpose. We describe strong uniqueness in terms of the local geometry of the unit ball and properties of the problem functions at the minimum point. When the norm is polyhedral we are able to give necessary and sufficient conditions for the second order convergence of the generalised Gauss-Newton algorithm.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 36 (1980), S. 111-128 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D05 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary A modification of the Thacher-Tukey algorithm for rational interpolation is proposed. The method employed demonstrates the reliability of the proposed algorithm as well as the reliability of the Thacher-Tukey algorithm. Furthermore, the proposed algorithm eliminates almost all the array storage space required to implement the Thacher-Tukey algorithm.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 34 (1980), S. 125-141 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 41A15 ; 65R05 ; 68A10 ; CR: 5.13 ; 5.18
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary The purpose of this paper is to present explicit ALGOL procedures for (1) the approximation of a kernel (surface) by tensor products of splines, and (2) the computation of approximate eigenvalues and eigenfunctions for Fredholm integral equations of the second kind.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 36 (1980), S. 99-107 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D05 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary In this paper we consider rational interpolation for an Hermite Problem, i.e. prescribed values of functionf and its derivatives. The algorithm presented here computes a solutionp/q of the linearized equationsp−fq=0 in form of a generalized continued fraction. Numeratorp and denominatorq of the solution attain minimal degree compatible with the linearized problem. The main advantage of this algorithm lies in the fact that accidental zeros of denominator calculated during the algorithm cannot lead to an unexpected stop of the algorithm. Unattainable points are characterized.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...