# An Algorithm for Generating the Design Matrix for Multivariate Polynomial Least Squares Fitting

## Related Articles

- DISCRETE LEAST SQUARES POLYNOMIAL APPROXIMATION WITH RANDOM EVALUATIONS - APPLICATION TO PARAMETRIC AND STOCHASTIC ELLIPTIC PDES. CHKIFA, ABDELLAH; COHEN, ALBERT; MIGLIORATI, GIOVANNI; NOBILE, FABIO; TEMPONE, RAUL // ESAIM: Mathematical Modelling & Numerical Analysis;May2015, Vol. 49 Issue 3, p815
Motivated by the numerical treatment of parametric and stochastic PDEs, we analyze the least-squares method for polynomial approximation of multivariate functions based on random sampling according to a given probability measure. Recent work has shown that in the univariate case, the...

- A Remark on the Use of a Weight Matrix in the Linear Model of Coregionalization. Oman, Samuel; Vakulenko-Lagun, Bella // Mathematical Geosciences;May2012, Vol. 44 Issue 4, p505
The linear model of coregionalization (LMC) is generally fit to multivariate geostatistical data by minimizing a least-squares criterion. It is commonly believed that weighting the criterion by inverse variances will reduce the influence of those variables with large variance. We point out that...

- Clustering Univariate Observations via Mixtures of Unimodal Normal Mixtures. Bartolucci, Francesco // Journal of Classification;2005, Vol. 22 Issue 2, p203
A mixture model is proposed in which any component is modelled in a flexible way through a unimodal mixture of normal distributions with the same variance and equispaced support points. The main application of the model is for clustering univariate observations where any component identifies a...

- A novel computer-aided multivariate water quality index. Sim, Siong; Ling, Teck; Lau, Seng; Jaafar, Mohd // Environmental Monitoring & Assessment;Apr2015, Vol. 187 Issue 4, p1
A computer-aided multivariate water quality index is developed based on partial least squares (PLS) regression. The index is termed as the partial least squares water quality index (PLS-WQI). Briefly, a training set was computationally generated based on the guideline of National Water Quality...

- Generalized Tschebyscheff of the Second Kind and Bernstein Polynomials Change of Bases. AlQudah, Mohammad A. // European Journal of Pure & Applied Mathematics;2015, Vol. 8 Issue 3, p324
We construct multiple representations relative to different bases of the generalized Tschebyscheff polynomials of second kind. Also, we provide an explicit closed from of The generalized Polynomials of degree r less than or equal n in terms of the Bernstein basis of fixed degree n. In addition,...

- Examining the Least Square Method to Retrieve Sea Surface Salinity from MODIS Satellite Data. Marghany, Maged // European Journal of Scientific Research;Feb2010, Vol. 40 Issue 3, p377
In this study, we investigate the relative ability of least square algorithm to retrieve sea surface salinity (SSS) from MODIS satellite data. We also examine with comprehensive comparison of the root mean square of bias the difference between second polynomial order algorithm and least square...

- Borrowing From Our Neighbors. Deal, Ken // Marketing Research;Spring2003, Vol. 15 Issue 1, p43
Discusses an application called SIMCA-P 10.0 which provides an approach to multivariate analysis. Definition of partial least squares; Data on the variable influence on projection graph.

- A NUMERICALLY STABLE BLOCK MODIFIED GRAM-SCHMIDT ALGORITHM FOR SOLVING STIFF WEIGHTED LEAST SQUARES PROBLEMS. Musheng Wei; Qiaohua Liu // Journal of Computational Mathematics;Sep2007, Vol. 25 Issue 5, p595
Recently, Wei in [18] proved that perturbed stiff weighted pseudoinverses and stiff weighted least squares problems are stable, if and only if the original and perturbed coefficient matrices A and Aï¿½ satisfy several row rank preservation conditions. According to these conditions, in this...

- On Balanced Graphs. Bonomo, Flavia; Durán, Guillermo; Lin, Min Chih; Szwarcfiter, Jayme L // Mathematical Programming;Feb2006, Vol. 105 Issue 2/3, p233
Berge defined a hypergraph to be balanced if its incidence matrix is balanced. We consider this concept applied to graphs, and call a graph to be balanced when its clique matrix is balanced. Characterizations of balanced graphs by forbidden subgraphs and by clique subgraphs are proved in this...