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  (38)
  • CR: 5.13  (38)
  • Springer  (38)
  • Cambridge University Press
  • Frontiers Media
  • National Academy of Sciences
  • 2020-2022
  • 1980-1984  (30)
  • 1975-1979  (8)
  • 1970-1974
  • Mathematics  (38)
Collection
  • Articles  (38)
Publisher
  • Springer  (38)
  • Cambridge University Press
  • Frontiers Media
  • National Academy of Sciences
Years
  • 2020-2022
  • 1980-1984  (30)
  • 1975-1979  (8)
  • 1970-1974
Year
Topic
  • Mathematics  (38)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 42 (1983), S. 107-117 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D05 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary We consider the problem of studying the behaviour of the eigenvalues associated with spline functions with equally spaced knots. We show that they are $$O\left( {\frac{{i^{2m} }}{n}} \right)i = 1, \ldots ,n - m$$ wherem is the order of the spline andn, the number of knots. This result is of particular interest to prove optimality properties of the Generalized Cross-Validation Method and had been conjectured by Craven and Wahba in a recent paper.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 43 (1984), S. 23-39 
    ISSN: 0945-3245
    Keywords: 65 B05 ; 65B10 ; 65E05 ; 30B70 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary We present in this first paper a generalization of Padé approximants which gives us as particular cases Shafer's and Baker'sD-log approximants. First we define these approximants following an old idea of Hermite, then we prove some fundamental properties for their constructions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 43 (1984), S. 141-152 
    ISSN: 0945-3245
    Keywords: AMS (1980) Primary ; 41A29 ; Secondary, 65N15 ; 41A63 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary The variational formulation of multivariate spline functions is generalized to include cases where the function has to satisfy inequality constraints such as positivity and convexity. Condition for existence and uniqueness of a solution is given. Approximation to the solution can be obtained by solving the variational problem in a finite dimensional subspace. Conditions for convergence and error estimates of the approximations are presented, both for interpolation problems and smoothing problems. The general theory is illustrated by specific examples including the “volume-matching” problem and the “one-sided thin plate spline”.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 39 (1982), S. 293-307 
    ISSN: 0945-3245
    Keywords: AMS(MOS):65D15 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Description / Table of Contents: Summary Equivalence constants for the norms on parameter and function space are considered for both polynomials and exponential sums. In the latter case “Chebyshev” exponential sums are introduced as generalizations of the Chebyshev polynomials, providing a practical method for error estimation in parameter space. For theoretical purposes a “Markoff-type” inequality is proved. In the case of polynomials asymptotically optimal constants are derived, thus improving on earlier results of Gautschi. Furthermore, a simple construction of the equivalence constants for the monomial basis is included.
    Notes: Zusammenfassung Für Polynome und Exponentialsummen mit festen Frequenzen werden die Normäquivalenzkonstanten zwischen Parameterraum und Funktionenraum untersucht. Dies führt im Exponentialsummenfall auf “Tschebyscheff-Exponentialsummen” als Verallgemeinerung der Tschebyscheff-Polynome, wenn man nach numerisch praktikablen Strategien zur Fehlerabschätzung im Parameterraum sucht; für theoretische Zwecke wird eine Ungleichung von Markoff-Typ für Exponentialsummen hergeleitet. Im Falle der Polynome ergeben sich asymptotisch optimale Konstanten als Verschärfungen von Resultaten von Gautschi. Ferner wird eine elementare Herleitung der Normäquivalenzkonstanten für den Fall der Monombasis angegeben.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 40 (1982), S. 39-46 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D15 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary In the univariate case the ɛ-algorithm of Wynn is closely related to the Padé-table in the following sense: if we apply the ɛ-algorithm to the partial sums of the power series $$f(x) = \sum\limits_{i = 0}^\infty {c_i x^i } $$ then ε 2m l−m is the (l, m) Padé-approximant tof(x) wherel is the degree of the numerator andm is the degree of the denominator [1 pp. 66–68]. Several generalizations of the ɛ-algorithm exist but without any connection with a theory of Padé-approximants. Also several definitions of the Padé-approximant to a multivariate function exist, but up till now without any connection with the ɛ-algorithm. In this paper, we see that the multivariate Padé-approximants introduced in [3], satisfy the same property as the univariate Padé-approximants: if we apply the ɛ-algorithm to the partial sums of the power series $$f\left( {x_1 ,...,x_n } \right) = \sum\limits_{i_1 + ... + i_n = 0}^\infty {c_{i_1 ...i_n } x_1^{i_1 } ...x_n^{i_n } } $$ then ε 2m (l−m) is the (l, m) multivariate Padé-approximant tof(x 1, ...,x n ).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 40 (1982), S. 71-78 
    ISSN: 0945-3245
    Keywords: AMS (MOS) 65D05 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary In the present paper we study the existence, uniqueness and convergence of discrete cubic spline which interpolate to a given function at one interior point of each mesh interval. Our result in particular, includes the interpolation problems concerning continuous periodic cubic splines and discrete cubic splines with boundary conditions considered respectively in Meir and Sharma (1968) and Lyche (1976) for the case of equidistant knots.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 42 (1983), S. 331-348 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D05 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary It is shown explicitly that the Samelson inverse may be used to define vector-valued Thiele type rational interpolants, and the equivalence with Claessens' ε-algorithm is established. For the special case of vector valued Padé approximants, the general form of McCleod's theorem follows as a corollary.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 29 (1978), S. 345-362 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D15 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary Let 1〈p≦∞, and letH p (U) denote the family of all functionsf that are analytic in the unit discU such that $$\parallel f\parallel _p = \mathop {\lim }\limits_{r \to 1^ - } \left( {\frac{1}{{2\pi }}\int\limits_0^{2\pi } {|f(re^{i\theta } )|} ^p d\theta } \right)^{1/p}〈 \infty .$$ Set $$\sigma _n = \mathop {\inf }\limits_{w_j ,x_j } \mathop {\sup }\limits_{f \in H^p (U),\parallel f\parallel p = 1} \left| {\int\limits_{ - 1}^1 {f(x)dx - \sum\limits_{j = 1}^n {w_j f(x_j )} } } \right|.$$ It is shown that given any ε〉0, there exists an integern(ε)≧0, such that ifn〉n(ε) andq=p/(p−1), then $$\exp \left\{ { - \left( {5^{\tfrac{1}{2}} \pi + \varepsilon } \right)n^{\tfrac{1}{2}} } \right\} \leqq \sigma _n \leqq \exp \left\{ { - \left( {\frac{\pi }{{(2q)^{\tfrac{1}{2}} }} - \varepsilon } \right)n^{\tfrac{1}{2}} } \right\}.$$ LetH p * (U) denote the family of all functionsf such thatg∈H p (U), whereg(z)=f(z)/(1−z 2), and whereH p * (U) is normed by ‖f‖ p * =‖g‖ p ‖,‖g‖ p ‖ being defined as above. Let {T n (f)} n=1 ∞ be an approximation scheme defined by $$T_n (f)(z) = \sum\limits_{j = 1}^n {f(x_j )\phi _{n,j} (z),f \in H_p^* (U),} $$ where φ n,j is analytic inU, and such that ‖T n(f)‖ p * ≦C‖f‖ p * , whereC〉0, but independent ofn. Then given any ε〉0, there exists an integern(ε)≧0, such that whenevern〉n(ε), then $$\begin{gathered} \exp \left\{ { - (5^{\tfrac{1}{2}} \pi + \varepsilon )} \right.n^{\tfrac{1}{2}} \} \leqq \mathop {\inf }\limits_{Tn} \mathop {\sup }\limits_{f \in H_p^* (U),\parallel f\parallel _p^* = 1} \mathop {\sup }\limits_{ - 1〈 x〈 1} |f(x) - T_n (f)(x)| \hfill \\ \leqq \exp \{ - \left. {\left( {\frac{\pi }{{2q^{\tfrac{1}{2}} }} - \varepsilon } \right)n^{\tfrac{1}{2}} } \right\}. \hfill \\ \end{gathered} $$
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 43 (1984), S. 283-292 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D15 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary In this paper, we show that the sequences of Padé-type approximants (k−1/k) and (k/k) converge to exp (−z), uniformly and geometrically on every compact subset of the plane. A numerical study has been done, which discriminates these sequences from the point of view ofA-acceptability.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    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 ...
  • 11
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 44 (1984), S. 407-415 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D15 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary We deal with spline interpolants of odd degree on equidistant grids. The main interest is directed on cardinal and onn-periodic interpolation, wheren is odd. By the aid of an explicit representation of the interpolant by Euler-Frobenius-polynomials, we calculate the minimal constant occuring in the error estimate with the modulus of continuity.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 28 (1977), S. 295-306 
    ISSN: 0945-3245
    Keywords: AMS (MOS): 41 A 25 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Description / Table of Contents: Résumé Soientu∈W k+1,p (Ω),k+1−n/p〉0, Ω ouert ≪régulier≫ de ℝ n admettant une triangulationC et πu une interpolation deu sur Ω par la méthode des éléments finis telle que: $$\left\| {u - \pi u} \right\|_{m,p,\Omega } \leqq C_m h^{k + 1 - m} \left| u \right|_{k + 1,p,\Omega } ,0 \leqq m \leqq k + 1(cf.[3]).$$ En utilisant la théorie des noyaux d'espaces de Banach on fournit des explicitations précises deC m qui permettent d'évaluer cette constante.
    Notes: Summary Let us suppose that Ω is an open “regular” subset ℝ n which canbe triangulated by finite elements. Letu be an element of the Sobolev spaceW k+1,p (Ω),k+1−n/p〉0 and πu an interpolant ofu such that ∥u−π∥ m, p, Ω , ≦C m h k+1-m |u| k+1,p,Ω , 0≦m≦k+1 (cf. [3]). Using the theory of Kernels of Banach spaces we show thatC m can be exactly evaluated.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 13
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 38 (1982), S. 129-139 
    ISSN: 0945-3245
    Keywords: AMS(MOS) 65D15 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary In this paper duality theory is used to derive an algorithm for the solution of the discrete linearL p approximation problem (for 1〈p〈2). This algorithm turns out to be similar to existing iteratively reweighted least squares algorithms, but can be shown to be globally andQ-superlinearly convergent.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 39 (1982), S. 411-420 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D15 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary We transform a complex approximation problem into an equivalent semiinfinite optimization problem whose constraints are described in terms of a quantity ϕ∈[0,2π[=I. We study the effect of disturbing the problem by replacingI by a compact subsetM⊂I which includes as special case the discrete case whereM consists only of finitely many points. We introduce a measure ɛ for the deviation ofM fromI and show that in any complex approximation problem the minimal distance of the disturbed problem converges quadratically with ɛ→0 to the minimal distance of the undisturbed problem which is a generalization of a result by Streit and Nuttall. We also show that in a linear finite dimensional approximation problem the convergence of the coefficients of the disturbed problem is in general at most linear. There are some graphical representations of best complex approximations computed with the described method.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 15
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 40 (1982), S. 229-243 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D15 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary This paper deals with the problem of uniqueness in one-sidedL 1-approximation. The chief purpose is to characterize finite dimensional subspacesG of the space of continuous or differentiable functions which have a unique best one-sidedL 1-approximation. In addition, we study a related problem in moment theory. These considerations have an important application to the uniqueness of quadrature formulae of highest possible degree of precision.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 16
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 41 (1983), S. 117-146 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D15 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary A Remez type algorithm for computing best spline approximations of degreen withk fixed knots is developed. It is shown that the sequence constructed in the algorithm converges to a best approximation, ifk≦n+1, and at least to a nearly best approximation, ifk〉n+1. In contrast to the standard interpolation methods no restriction to the position of the knots is required. This fact may be important to treat approximation problems for splines with free knots.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 17
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 41 (1983), S. 207-221 
    ISSN: 0945-3245
    Keywords: AMS (MOS): 65D14 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary Forf∈C[a, b] the existence and uniqueness of best spline approximationss for which the errorf−s has certain alternation properties are investigated. Such best approximations play an important role to develop a Remez type algorithm for computing best spline approximations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 18
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 42 (1983), S. 195-212 
    ISSN: 0945-3245
    Keywords: AMSC (MOS): 65D05 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary It is well-known that interpolation using polynomial splines is possible if and only if the points of interpolation are appropriately interlaced with the knots. The main result of this paper is a complete characterization of exactly which generalized spline spaces have a similar kind of interlacing property. Some examples of spline spaces which do not have the interlacing property are given. In addition, we identify some important special classes of generalized splines which do have the property.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 19
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 42 (1983), S. 259-269 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D15 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary The quotient-difference (QD) algorithm can be used to construct univariate Padé-approximants [1]. In this paper we see that it can also be used to construct the multivariate Padé-approximants introduced in [3], just by reformulating the quotient-difference algorithm as in Sect. 1. The multivariate Padé-approximants and the multivariate QD-scheme are treated in the Sects. 2 and 3 respectively. Thus for this type of multivariate Padé-approximants a link with the theory of multivariate continued fractions is established.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 20
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 43 (1984), S. 41-57 
    ISSN: 0945-3245
    Keywords: 65B05 ; 65B10 ; 65E05 ; 30B70 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary In this second paper we propose an algorithm for the construction of the Δ-tables and of the Padé-Hermite tables [3]. Then we present some numerical applications.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 21
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 29 (1977), S. 115-122 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D05 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary The Newton interpolation approach is developed for approximation of linear functionals. It is shown that in numerical interpolation and numerical differentiation, the Newton interpolation approach is more efficient than solving the Vandermonde systems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 22
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 33 (1979), S. 225-234 
    ISSN: 0945-3245
    Keywords: AMS(MOS): D05 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary The trigonometric polynomial of minimum degree assuming at the pointsφ k := 2πk/n (k=0, 1, ...,n−1) given valuesf k is forn even andφ ≠φ k represented by (*) $$t(\phi ) = \frac{{\sum\limits_{k = 0}^{n - 1} {( - 1)^k f_k ctg\frac{{\phi - \phi _k }}{2}} }}{{\sum\limits_{k = 0}^{n - 1} {( - 1)^k ctg\frac{{\phi - \phi _k }}{2}} }}.$$ Similar formulas hold forn odd, and for the conjugate polynomialt *(ϕ). A simple recursive algorithm exists forn=2 l . This method of evaluatingt ort * is numerically stable even for every largen, and for values of ϕ arbitrarily close to someφ k . Inasmuch as the evaluation of (*) requires a mereO(n) operations, our formulas are more advantageous than the Fast Fourier Transform ift ort * is to be evaluated only for a small number of values of ϕ.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 23
    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 ...
  • 24
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 43 (1984), S. 293-307 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D15 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary Padé approximants are a frequently used tool for the solution of mathematical problems. One of the main drawbacks of their use for multivariate functions is the calculation of the derivatives off(x 1, ...,x p ). Therefore multivariate Newton-Padé approximants are introduced; their computation will only use the value off at some points. In Sect. 1 we shall repeat the univariate Newton-Padé approximation problem which is a rational Hermite interpolation problem. In Sect. 2 we sketch some problems that can arise when dealing with multivariate interpolation. In Sect. 3 we define multivariate divided differences and prove some lemmas that will be useful tools for the introduction of multivariate Newton-Padé approximants in Sect. 4. A numerical example is given in Sect. 5, together with the proof that forp=1 the classical Newton-Padé approximants for a univariate function are obtained.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 25
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 44 (1984), S. 417-424 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D15 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary For oddm, the error of them-th-degree spline interpolant of power growth on an equidistant grid is estimated. The method is based on a decomposition formula for the spline function, which locally can be represented as an interpolation polynomial of degreem which is corrected by an (m+1)-st.-order difference term.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 26
    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 ...
  • 27
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 37 (1981), S. 339-347 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D05 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary This paper deals with an algorithmic approach to the Hermite-Birkhoff-(HB)interpolation problem. More precisely, we will show that Newton's classical formula for interpolation by algebraic polynomials naturally extends to HB-interpolation. Hence almost all reasons which make Newton's method superior to just solving the system of linear equations associated with the interpolation problem may be repeated. Let us emphasize just two: Newton's formula being a biorthogonal expansion has a well known permanence property when the system of interpolation conditions grows. From Newton's formula by an elementary argument due to Cauchy an important representation of the interpolation error can be derived. All of the above extends to HB-interpolation with respect to canonical complete Čebyšev-systems and naturally associated differential operators [7]. A numerical example is given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 28
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 38 (1982), S. 299-307 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 63B05 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary A special case of a generalization of the Richardson extrapolation process is considered, and its complete solution is given in closed form. Using this, an algorithm for implementing the extrapolation is devised. It is shown that this algorithm needs a very small amount of arithmetic operations and very little storage. Convergence and stability properties for some cases are also considered.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 29
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 39 (1982), S. 65-84 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D15 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary The problem of finding optimal cycles in a doubly weighted directed graph (Problem A) is closely related to the problem of approximating bivariate functions by the sum of two univariate functions with respect to the supremum norm (Problem B). The close relationship between Problem A and Problem B is detected by the characterization (7.4) of the distance dist (f, t) of Problem B. In Part 1 we construct an algorithm for Problem A where the essential role is played by the minimal lengthsy j(k) defined by (2.3). If weight functiont≡1 then the minimum of Problem A is computed by equality (2.4). Ift≡1 then the minimum is obtained by a binary search procedure, Algorithm 3. In Part 2 we construct our algorithms for solving Problem B by following exactly the ideas of Part 1. By Algorithm 4 we compute the minimal pseudolengthsh k(y, M) defined by (7.5). If weight functiont≡1 then the infimum dist(f,t) of Problem B is obtained by equality (7.12) which is closely related to (2.4). Ift≢1 we compute the infimum dist(f,t) by the binary search procedure Algorithm 5. Additionally, Algorithm 4 leads to a constructive proof of the existence of continuous optimal solutions of Problem B (see Theorem 7.1e) which is already known in caset≡1 but unknown in caset≢1. Interesting applications to the steady-state behaviour of industrial processes with interference (Sect. 3) and the solution of integral equations (Problem C) are included.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 30
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 29 (1977), S. 83-91 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D15 ; 41A50 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary In this paper, overdetermined systems ofm linear equations inn unknowns are considered. Withℝ m equipped with a smooth strictly convex norm, ‖·‖, an iterative algorithm for finding the best approximate solution of the linear system which minimizes the ‖·‖-error is given. The convergence of the algorithm is established and numerical results are presented for the case when ‖·‖ is anl p norm, 1〈p〈∞.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 31
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 29 (1978), S. 261-267 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 30A22 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary A priori truncation error bounds are obtained for continued fractions of the formK(1/b n),b n complex. The error bounds are easily applied to the case whenb n→0 asn→∞. A numerical example involving the complex error function is given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 32
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 30 (1978), S. 241-266 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 41A20 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary In this paper, we continue our study of the location of the zeros and poles of general Padé approximants toe z . We state and prove here new results for the asymptotic location of the normalized zeros and poles for sequences of Padé approximants toe z , and for the asymptotic location of the normalized zeros for the associated Padé remainders toe z . In so doing, we obtain new results for nontrivial zeros of Whittaker functions, and also generalize earlier results of Szegö and Olver.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 33
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 30 (1978), S. 207-226 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65B05, 65L15 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary In order to apply extrapolation processes to the numerical solution of eigenvalue problems depending nonlinear on a parameter the existence of asymptotic expansions for eigenvalues and eigenvectors is studied. At the end of the paper some numerical examples are given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 34
    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 ...
  • 35
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 43 (1984), S. 379-388 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D15 ; 41A20 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary We determine the connected components of the set of normal elements of the family ℛ m n [a,b] of rational functions. Numerical difficulties occuring with the computation of the Chebyshev approximation via the Remez algorithm can be caused by its disconnectedness. In order to illustrate this we give numerical examples.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 36
    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 ...
  • 37
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 37 (1981), S. 193-203 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65005 ; CR: 5.13
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary The problem of the numerical approximation of multivariable functions has been solved by the Monte Carlo method when the data points are assumed to be given on discrete lattice points [5, 8, 2]. When the data points are randomly distributed and very numerous there are some results in the literature [3, 6] but if the number of the points is less than 2 k , wherek is the dimension of the space, it is very difficult to develop approximation formulas. This paper gives a solution to this problem by local approximations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 38
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 39 (1982), S. 139-153 
    ISSN: 0945-3245
    Keywords: AMS (MOS): 41A52 ; 65H05 ; CR: 5.13 ; 5.15
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary In this paper the problem is investigated of how to take the (possibly noninteger) multiplicity of zeros into account in the Haar condition for a linear function space on a given interval. Therefore, a distinction is made between regular and singular points of the interval, and a notion of geometric multiplicity, which always is a positive integer, is introduced. It is pointed out that, for regular zeros (i.e., zeros situate at regular points), aq-fold zero (in the sense that its geometric multiplicity equalsq), counts forq distinct zeros in the Haar condition. For singular zeros (i.e., zeros situated at singular points), this geometric multiplicity has to be diminished by some well-determinable integer.
    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...