Sherman-Morrison-Woodbury-formula-based algorithms for the surface smoothing problem (Q1369358)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1076379
Language Label Description Also known as
default for all languages
No label defined
    English
    Sherman-Morrison-Woodbury-formula-based algorithms for the surface smoothing problem
    scientific article; zbMATH DE number 1076379

      Statements

      Sherman-Morrison-Woodbury-formula-based algorithms for the surface smoothing problem (English)
      0 references
      0 references
      0 references
      25 May 1998
      0 references
      The purpose of the paper is to present a new and fast algorithm for solving the sparse- and dense-data surface smoothing problems using a membrane, thin-plate, or thin-plate membrane spline for data containing discontinuities. These problems are formulated as solutions to a Lyapunov matrix equation or a cascade of two Lyapunov matrix equations with an appropriate right-hand-side by using the Sherman-Morrison-Woodbury formula of matrix analysis. The efficiency of the algorithm is demonstrated through experiments on sparse-data surface smoothing. The numerical results are compared to the conjugate gradient algorithm and the hierarchical-basis preconditioned conjugate gradient algorithm.
      0 references
      discontinuous data
      0 references
      algorithm
      0 references
      surface smoothing
      0 references
      thin-plate membrane spline
      0 references
      Lyapunov matrix equation
      0 references
      Sherman-Morrison-Woodbury formula
      0 references
      numerical results
      0 references
      hierarchical-basis preconditioned conjugate gradient algorithm
      0 references
      0 references

      Identifiers