Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Subspace-based approximations

Description

This lecture covers the concept of subspaces in symmetric functions over L₂[-1, 1], the basis vectors for subspaces in R³, and the approximation problem of finding the best approximation for a vector x in a subspace. It also delves into the least-squares approximation method, discussing orthogonal projections, minimum-norm error, and the orthogonality of the error to the approximation.

Official source

Related concepts (32)

Least squares

The method of least squares is a standard approach in regression analysis to approximate the solution of overdetermined systems (sets of equations in which there are more equations than unknowns) by minimizing the sum of the squares of the residuals (a residual being the difference between an observed value and the fitted value provided by a model) made in the results of each individual equation. The most important application is in data fitting.

Linear least squares

Linear least squares (LLS) is the least squares approximation of linear functions to data. It is a set of formulations for solving statistical problems involved in linear regression, including variants for ordinary (unweighted), weighted, and generalized (correlated) residuals. Numerical methods for linear least squares include inverting the matrix of the normal equations and orthogonal decomposition methods. The three main linear least squares formulations are: Ordinary least squares (OLS) is the most common estimator.

Ring of symmetric functions

In algebra and in particular in algebraic combinatorics, the ring of symmetric functions is a specific limit of the rings of symmetric polynomials in n indeterminates, as n goes to infinity. This ring serves as universal structure in which relations between symmetric polynomials can be expressed in a way independent of the number n of indeterminates (but its elements are neither polynomials nor functions). Among other things, this ring plays an important role in the representation theory of the symmetric group.

Non-linear least squares

Non-linear least squares is the form of least squares analysis used to fit a set of m observations with a model that is non-linear in n unknown parameters (m ≥ n). It is used in some forms of nonlinear regression. The basis of the method is to approximate the model by a linear one and to refine the parameters by successive iterations. There are many similarities to linear least squares, but also some significant differences.

Stanley symmetric function

In mathematics and especially in algebraic combinatorics, the Stanley symmetric functions are a family of symmetric functions introduced by in his study of the symmetric group of permutations. Formally, the Stanley symmetric function Fw(x1, x2, ...) indexed by a permutation w is defined as a sum of certain fundamental quasisymmetric functions. Each summand corresponds to a reduced decomposition of w, that is, to a way of writing w as a product of a minimal possible number of adjacent transpositions.

Related lectures (33)

Linear Regression Testing

Explores least squares in linear regression, hypothesis testing, outliers, and model assumptions.

Orthogonal Projection on Vector Subspace MOOC: Linear Algebra (Part 3)

Explains orthogonal projection on a vector subspace in Euclidean space.

Linear Algebra: Orthogonal Projection and QR Factorization

Explores Gram-Schmidt process, orthogonal projection, QR factorization, and least squares solutions for linear systems.

QR Factorization: Least Squares System Resolution MOOC: Linear Algebra (Part 3)

Covers the QR factorization method applied to solving a system of linear equations in the least squares sense.

Orthogonal Projection: Vector Decomposition