Orthogonal continuous segmentation polynomial

DOI10.1016/S0096-3003(03)00736-7MaRDI QIDQ1883169zbMATH OpenOpenAlexFDO

Authors Fuyong Lin

Publication date 1 October 2004

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0096-3003(03)00736-7

Mathematics Subject Classification ID

Series solutions to PDEs (35C10) Integral representations of solutions to PDEs (35C15) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05)

Recommendations

• A fast algorithm for orthogonalizing polynomials on an arbitrarily shaped region (revised version).
• On interpolation of polynomial operators
• Orthogonal polynomial expansions for finite group transformations
• Fast orthogonalization algorithms for segmented image coding
• Piecewise-polynomial signal segmentation using convex optimization.

Cited in

(5)

• Binary segmentation for multivariate polynomials
• The solution of linear systems equations with circulant-like coefficient matrices
• A new multi-resolution theory based on orthogonal spline
• A numerical kernel solution of beam systems
• The inverse of circulant matrix

This page was built for publication: Orthogonal continuous segmentation polynomial

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