Find the projection of a machine-precision vector onto another:

Projection of a complex vector onto another:

Projection of an exact vector onto another:

Projection of an arbitrary-precision vector onto another:

The projection of large numerical vectors is computed efficiently:

Project symbolic vectors:

Give an inner product of Dot to assume all expressions are real-valued:

Project vectors that are not lists using an explicit inner product:

Specify the inner product using a pure function:

Project the vector on the line spanned by the vector :

Visualize and its projection onto the line spanned by :

Project the vector on the plane spanned by the vectors and :

First, replace with a vector in the plane perpendicular to :

The projection in the plane is the sum of the projections onto and :

Find the component perpendicular to the plane:

Confirm the result by projecting onto the normal to the plane:

Visualize the plane, the vector and its parallel and perpendicular components:

The Frenet–Serret system encodes every space curve's properties in a vector basis and scalar functions. Consider the following curve:

Construct an orthonormal basis from the first three derivatives by subtracting parallel projections:

Ensure that the basis is right-handed:

Compute the curvature, , and torsion, , which quantify how the curve bends:

Verify the answers using FrenetSerretSystem:

Visualize the curve and the associated moving basis, also called a frame:

Apply the Gram–Schmidt process to construct an orthonormal basis from the following vectors:

The first vector in the orthonormal basis, , is merely the normalized multiple :

For subsequent vectors, components parallel to earlier basis vectors are subtracted prior to normalization:

Confirm the answers using Orthogonalize:

Find an orthonormal basis for the column space of the following matrix , and then use that basis to find a QR factorization of :

Define is the column of :

Define as the element of the corresponding Gram–Schmidt basis:

Define as the matrix whose columns are :

Let :

Confirm that :

Compare with the result given by QRDecomposition; the matrices are the same:

The matrices differ by a transposition because QRDecomposition gives the row-orthonormal result:

For a Hermitian matrix (more generally, any normal matrix), the eigenvectors are orthogonal, and it is conventional to define the projection matrices , where is a normalized eigenvector. Show that the action of the projection matrices on a general vector is the same as projecting the vector onto the eigenspace for the following matrix :

Verify the is Hermitian:

Find the eigenvalues and eigenvectors:

Compute the normalized eigenvectors:

Compute the projection matrices:

Confirm that multiplying a general vector by equals the projection of the vector onto :

Since the form an orthonormal basis, the sum of the must be the identity matrix:

Moreover, the sum of is the original matrix :

If the linear system has no solution, the best approximate solution is the least-squares solution. That is the solution to , where is the orthogonal projection of onto the column space of . Consider the following and :

The linear system is inconsistent:

Find orthogonal vectors that span . First, let be the first column of :

Let be a vector in the column space that is perpendicular to :

Compute the orthogonal projection of onto the spaced spanned by the :

Visualize , its projections onto the and :

Solve :

Confirm the result using LeastSquares:

Projection can be used to find a best-fit curve to data. Consider the following data:

Extract the and coordinates from the data:

Let have the columns and , so that minimizing will be fitting to a line :

The following two orthogonal vectors clearly span the same spaces as the column of :

Get the coefficients and for a linear least‐squares fit:

Verify the coefficients using Fit:

Plot the best-fit curve along with the data:

Find the best-fit parabola to the following data:

Extract the and coordinates from the data:

Let have the columns , and , so that minimizing will be fitting to :

Construct orthonormal vectors that have the same column space as :

Get the coefficients , and for a least‐squares fit:

Verify the coefficients using Fit:

Plot the best-fit curve along with the data:

A positive-definite, real symmetric matrix or metric defines an inner product by :

Being positive-definite means that the associated quadratic form is positive for :

Note that Dot itself is the inner product associated with the identity matrix:

Apply the Gram–Schmidt process to the standard basis to obtain an orthonormal basis:

Confirm that this basis is orthonormal with respect to the inner product :

Fourier series are projections onto a particular basis in the inner product spaces . Define the standard inner product on square-integrable functions:

Let denote for different integer values of :

The are orthogonal to each other, though not orthonormal:

The Fourier series of a function is the projection of onto the space spanned by the :

Confirm the result using FourierSeries:

Moreover, equals the Fourier coefficient corresponding to FourierParameters{-1,1}:

Confirm using FourierCoefficient:

Unnormalized Gram–Schmidt algorithm:

Do Gram–Schmidt on a random set of 3 vectors:

Verify orthogonality; as the the vectors are not normalized, the result is a general diagonal matrix:

Use a positive and real symmetric matrix to define a complex inner product:

Do Gram–Schmidt on a random set of three complex vectors:

Verify orthogonality:

LegendreP defines a family of orthogonal polynomials with respect to the inner product . Apply the unnormalized Gram–Schmidt process to the polynomials for from zero through four to compute scalar multiples of the first five Legendre polynomials:

Compare to the conventional Legendre polynomials:

For each , and differ by a constant multiple:

Compute an orthonormal set:

HermiteH defines a family of orthogonal polynomials with respect to the inner product . Apply the unnormalized Gram–Schmidt process to the polynomials for from zero through four to compute scalar multiples of the first four Hermite polynomials:

Compared to the conventional Hermite polynomials, is smaller by a factor of :

The orthonormal polynomials have some multiple of in the denominator:

In quantum mechanics, states are represented by complex unit vectors and physical quantities by Hermitian linear operators. The eigenvalues represent possible observations and the squared norm of projections onto the eigenvectors the probabilities of those observations. For the spin operator and state given, find the possible observations and their probabilities:

Computing the eigensystem, the possible observations are :

The relative probabilities are for and for :

In quantum mechanics, the energy operator is called the Hamiltonian , and a state with energy evolves according to the Schrödinger equation . Given the Hamiltonian for a spin-1 particle in a constant magnetic field in the direction, find the state at time of a particle that is initially in the state representing :

Computing the eigensystem, the energy levels are and :

The state at time is the sum of each eigenstate evolving according to the Schrödinger equation:

For the Hamiltonian , the eigenvector is a function that is a constant multiple of , and the inner product on vectors is . For a particle in the state , find the probability that it is in one of the first four eigenstates. First, define an inner product:

Confirm that is a unit vector in this inner product:

Project onto the first four states; for and , the projection and hence probability is zero:

The probability is given by the squared norm of the projection. For , it is just under 90%:

For , it is just under 9%: