A sequential method for spline approximation with variable knots†

DOI10.1080/00207727808941759zbMATH Open0387.65009OpenAlexW1966007611MaRDI QIDQ4167971FDOQ4167971

Authors: Alberto M. Mier Muth, Alan S. Willsky 

Publication date: 1978

Published in: International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207727808941759

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Filtering in stochastic control theory (93E11) Data smoothing in stochastic control theory (93E14)

Cites Work

• A generalized likelihood ratio approach to the detection and estimation of jumps in linear systems
• Stochastic processes and filtering theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Splines (with optimal knots) are better
• Uniform Approximation by Chebyshev Spline Functions. II: Free Knots
• System identification. A survey
• Chebyshev approximation by spline functions with free knots

Cited In (1)

• Effect of sampling rates on computational complexity of spline interpolation

This page was built for publication: A sequential method for spline approximation with variable knots†

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4167971)