Bibliothek

feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • AMS(MOS): 65N30, 65K10, 49D20  (1)
  • rational interpolation  (1)
  • 1
    Digitale Medien
    Digitale Medien
    Springer
    Numerische Mathematik 36 (1981), S. 375-387 
    ISSN: 0945-3245
    Schlagwort(e): AMS(MOS): 65N30, 65K10, 49D20 ; CR: 5.17, 5.15
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Summary We consider nonlinear variational inequalities corresponding to a locally convex minimization problem with linear constraints of obstacle type. An efficient method for the solution of the discretized problem is obtained by combining a slightly modified projected SOR-Newton method with the projected version of thec g-accelerated relaxation method presented in a preceding paper. The first algorithm is used to approximately reach in relatively few steps the proper subspace of active constraints. In the second phase a Kuhn-Tucker point is found to prescribed accuracy. Global convergence is proved and some numerical results are presented.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Springer
    Numerical algorithms 23 (2000), S. 315-328 
    ISSN: 1572-9265
    Schlagwort(e): interpolation ; rational interpolation ; optimal interpolation ; 65D05 ; 41A05 ; 41A20
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract After recalling some pitfalls of polynomial interpolation (in particular, slopes limited by Markov's inequality) and rational interpolation (e.g., unattainable points, poles in the interpolation interval, erratic behavior of the error for small numbers of nodes), we suggest an alternative for the case when the function to be interpolated is known everywhere, not just at the nodes. The method consists in replacing the interpolating polynomial with a rational interpolant whose poles are all prescribed, written in its barycentric form as in [4], and optimizing the placement of the poles in such a way as to minimize a chosen norm of the error.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...