ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Approximation and interpolation by convexity-preserving rational splines (1994)
    Springer
    Constructive approximation 10 (1994), S. 275-283 
    Details
    ISSN: 1432-0940
    Keywords: 65D07 ; 41A20 ; 41A29 ; Rational splines ; Data interpolation and approximation ; Convexity-preserving data fitting
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A discussion and algorithm for combined interpolation and approximation by convexity-preserving rational splines is given.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01263067
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Infinite-interval nonlinear approximations (1988)
    Springer
    Constructive approximation 4 (1988), S. 211-221 
    Details
    ISSN: 1432-0940
    Keywords: 41A46 ; Nonlinear uniform approximation ; Uniform approximation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Uniform nonlinear approximation on an infinite interval is studied. This study was motivated by a specific nonlinear approximation problem arising in the construction of a stiff ordinary differential equation system solver. General results include characterization, uniqueness, and discretization theorems, as well as a computational algorithm for this problem.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02075459
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    An ODE-based approach to nonlinearly constrained minimax problems (1995)
    Springer
    Numerical algorithms 9 (1995), S. 25-37 
    Details
    ISSN: 1572-9265
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We consider the following problem: Choosex 1, ...,x n to wherem 1,m 2,m 3 are integers with 0≤m 1≤m 2≤m 3, thef i are given real numbers, and theg i are given smooth functions. Constraints of the formg i (x 1, ...,x n )=0 can also be handled without problem. Each iteration of our algorithm involves approximately solving a certain non-linear system of first-order ordinary differential equations to get a search direction for a line search and using a Newton-like approach to correct back into the feasible region when necessary. The algorithm and our Fortran implementation of it will be discussed along with some examples. Our experience to date has been that the program is more robust than any of the library routines we have tried, although it generally requires more computer time. We have found this program to be an extremely useful tool in diverse areas, including polymer rheology, computer vision, and computation of convexity-preserving rational splines.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02143925
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Uniform rational approximation on large data sets (1982)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 18 (1982), S. 1569-1575 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: We report on a very effective program for uniform approximation of functions (or discrete data) by generalized rational functions of any number of variables over point sets so large that conventional methods are inapplicable. The points need not be arranged in a regular pattern, but if they are, the number of points is normally limited only by the computer time available. The program extends the differential correction algorithm discussed in an earlier article in this journal by combining it with a first Remes-type exchange procedure, while retaining the flexibility and robustness of differential correction. Furthermore, this algorithm is guaranteed to converge in theory. Testing has shown that, even when the point set is small enough for differential correction to be applied directly, this algorithm is usually faster. We discuss the algorithm and program along with several numerical examples, one of which involves more than three million data points. A FORTRAN listing with illustrative output can be obtained from the first author.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620181011
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Uniform rational approximation of functions of several variables (1975)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 9 (1975), S. 297-323 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: We present a program which has given excellent results for uniform approximation of functions by polynomials, rational functions, generalized polynomials, and generalized rational functions. The algorithm is described in detail and several examples are discussed. The approximation is done over a finite point set, which is commonly a set of real numbers or points in the plane (in the latter case we are doing what is often known as surface fitting). Input to and output from the program is in tabular form. The method used is a linear programming approach known as the differential correction algorithm, which has been shown by several authors to always converge in theory (quadratically in some situations). In practice, we have obtained convergence in nearly every case, and quadratic convergence in most cases. The program can also be used for simultaneous approximation of several functions.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620090204
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    facet.materialart.
    Unknown
    An Algorithm and Fortran Program for Multivariate LAD ? (?1 of ?2) Regression (2002)
    Springer
    Details
    Publication Date: 2002-05-01
    Print ISSN: 0010-485X
    Electronic ISSN: 1436-5057
    Topics: Computer Science
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...