A fast algorithm for orthogonalizing polynomials on an arbitrarily shaped region (revised version).
type: Item
instance of: scholarly article
title: A fast algorithm for orthogonalizing polynomials on an arbitrarily shaped region (revised version).
zbMATH Open document ID: 1043.94511
DOI: 10.1023/A:1008208408359
author: Wilfried Philips
published in: Multidimensional Systems and Signal Processing
publication date: 1997-10-27T00:00:00Z
Mathematics Subject Classification ID: 94A08
Mathematics Subject Classification ID: 68U10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 65F25
zbMATH DE Number: 1062718
zbMATH Keywords: Segmented image coding
zbMATH Keywords: orthogonalizing polynomials
zbMATH Keywords: polynomial recursive orthogonalization
zbMATH Keywords: fast algorithm
MaRDI profile type: Publication
full work available at URL: a:1008208408359
OpenAlex ID: W1593871811
Recommended article: Fast algorithms using orthogonal polynomials
Recommended article: A new algorithm for computing orthogonal polynomials
Recommended article: Fast conversion algorithms for orthogonal polynomials
Recommended article: A Fast Algorithm for Rational Interpolation Via Orthogonal Polynomials
Recommended article: Q2724521
Recommended article: Q5427907
Recommended article: Q4421608
Recommended article: Fast approximate computations with Cauchy matrices and polynomials
Recommended article: Q4853665
Recommended article: Fast Solution of Vandermonde-Like Systems Involving Orthogonal Polynomials
description: scientific article; zbMATH DE number 1062718