Fast compact algorithms and software for spline smoothing

著者

• Weinert, Howard L.

書誌事項

Fast compact algorithms and software for spline smoothing

Howard L. Weinert

（SpringerBriefs in computer science）

Springer, c2013

• : [pbk.]

注記

Includes bibliographical references

内容説明・目次

内容説明

Fast Compact Algorithms and Software for Spline Smoothing investigates algorithmic alternatives for computing cubic smoothing splines when the amount of smoothing is determined automatically by minimizing the generalized cross-validation score. These algorithms are based on Cholesky factorization, QR factorization, or the fast Fourier transform. All algorithms are implemented in MATLAB and are compared based on speed, memory use, and accuracy. An overall best algorithm is identified, which allows very large data sets to be processed quickly on a personal computer.

目次

Introduction.- Cholesky Algorithm.- QR Algorithm.- FFT Algorithm.- Discrete Spline Smoothing.

「Nielsen BookData」 より

詳細情報

• NII書誌ID(NCID): BB16977695
• ISBN:
  • 9781461454953
• LCCN: 2012948342
• 出版国コード: us
• タイトル言語コード: eng
• 本文言語コード: eng
• 出版地: New York
• ページ数/冊数: viii, 45 p.
• 大きさ: 24 cm
• 分類:
  • DC23 : 511.42
• 件名:
  • LCSH : Smoothing (Statistics)
  • LCSH : Smoothing (Numerical analysis)
  • LCSH : Spline theory -- Data processing
• 親書誌ID:
  • BB08797290