Constructive Approximation

Paper

01 Dec 1991

Descartes systems from corner cutting

View publication

Abstract

This paper demonstrates that Descartes Systems can be conveniently generated from matrix subdivision algorithms determined by totally positive matrices. © 1991 Springer-Verlag New York Inc.

Paper

Penalized maximum-likelihood estimation, the Baum-Welch algorithm, diagonal balancing of symmetric matrices and applications to training acoustic data

Charles A. Micchelli, Peder Olsen

J. Comput. Appl. Math.

Paper

Total positivity and the exact n-width of certain sets in L¹

Charles A. Micchelli, Allan Pinkus

Pacific Journal of Mathematics

Paper

Knot insertion algorithms for piecewise polynomial spaces determined by connection matrices

Phillip J. Barry, Ronald N. Goldman, et al.

Advances in Computational Mathematics

Paper

Spectral factorization of Laurent polynomials

Tim N. T. Goodman, Charles A. Micchelli, et al.

Advances in Computational Mathematics

View all publications