rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Computational aspects of spline-wavelets
  name:
    name part: Hanisch, Jorg
    name part: 1965-
    role:
      role term: creator
  type of resource: text
  genre: bibliography
  origin info:
    place:
      place term: xx
    date issued: 1997
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: print
    extent: xi, 117 leaves : illustrations ; 28 cm.
  abstract: This dissertation deals with two topics on spline-wavelets
  abstract: with minimal support. Part one. Fast block-realtime
  abstract: algorithms for cardinal spline interpolation and cardinal
  abstract: spline-wavelet decomposition suitable for large data sets are
  abstract: presented. In order to find an interpolating cardinal spline
  abstract: on the real line, the given sequence of input values is
  abstract: partitioned into blocks of finite length. The interpolation
  abstract: algorithm is based on the factorization of the Euler-
  abstract: Frobenius polynomial, and on forward/backward substitution
  abstract: applied to one block at a time. The spline-wavelet
  abstract: decomposition is viewed as a cardinal spline interpolation
  abstract: problem of even order, and the interpolation algorithm is
  abstract: applied. An error analysis demonstrates the stability of the
  abstract: algorithm. The decomposition algorithm has only 2 to 3 times
  abstract: the numerical complexity of the reconstruction, and hence is
  abstract: very efficient. Numerical examples illustrate the
  abstract: algorithms. Part two. Minimally supported spline-wavelets
  abstract: with multiple non-uniform knots on a bounded interval are
  abstract: considered. General knot refinements of arbitrarily many new
  abstract: knots between two old knots are allowed. A spline-wavelet of
  abstract: order in with minimal support is constructed as the 7n-th
  abstract: derivative of a locally supported spline of order 2m
  abstract: satisfying certain Hermite-interpolation conditions, The
  abstract: interpolation problem leads to a system of linear equations
  abstract: with a positive definite, skew-banded coefficient matrix to
  abstract: which LU-factorization can be applied without destroying its
  abstract: zero-entry structure. This provides an efficient method for
  abstract: the construction of a minimally supported spline-wavelet
  abstract: basis. A decomposition algorithm is developed based on
  abstract: Hermite-interpolation. Knot insertion is used for the
  abstract: reconstruction. The algorithms are tested and numerical
  abstract: results are included.
  note: by Jorg Hanisch.
  note: Vita.
  note: "Major Subject: Mathematics".
  note: Issued also on microfiche from University Microfilms Inc.
  note: Includes bibliographical references: pages 114-116.
  note: Ph. D. Texas A&M University 1997.
  subject:
    topic: Major mathematics
  identifier: 98-00731 UMI
  identifier: http://proxy.library.tamu.edu/login
  related item:
    location:
      url: http://proxy.library.tamu.edu/login
  record info:
    record content source: TXA
    record creation date: 980403
    record change date: 20190325093459.0
    record identifier: in00001413323