How Do You Calculate Orthogonal Projections in Polynomial Subspaces?

  • Thread starter Benny
  • Start date
  • Tags
    Subspaces
In summary, the conversation discusses finding the orthogonal projection and minimizing the integral of a polynomial onto a subspace in a vector space. There is a question about finding an algebraic solution rather than using calculus, but it is suggested that the analytic approach is simple and obvious. The summary also notes that the orthogonal projection of a polynomial onto the subspace is the polynomial itself, and the minimum value of the integral is achieved when the polynomial is 3-5x. The conversation also mentions that q must lie in the subspace spanned by x^2 and x^3.
  • #1
Benny
584
0
Hi, can someone shed some light on the following question. It's been bothering me for a while and I'd like to know where I went wrong. Here is what I can remember of the question.

The following is an inner product for polynomials in P_3(degree <= 3): [tex]\left\langle {f,g} \right\rangle = \int\limits_{ - 1}^1 {f\left( x \right)g\left( x \right)} dx[/tex]

Let W be the subspace of the vector space P_3, spanned by {x^2, x^3}.

Find the orthogonal projection of a polynomial [tex]p\left( x \right) = a_0 + a_1 x + a_2 x^2 + a_3 x^3 \in P_3 [/tex] onto W. Find also the polynomial [tex]q\left( x \right) \in W[/tex] which minimises the integral [tex]\int\limits_{ - 1}^1 {\left( {3 + 5x - q\left( x \right)} \right)^2 } dx[/tex].

I think that q(x) is some kind of projection onto W. I kind of drew an analogy with 'distance' when I did this question. But obviously something's wrong with that approach. Does anyone have suggestions as to how to find q?
 
Physics news on Phys.org
  • #2
The first question is a really basic one, just compute the orthogonal projection of p onto W using the definition of orthogonal projection. The second question looks like it has nothing to do with linear algebra, it's just high school calculus, at least, that's how I solved it.
 
  • #3
I included the first question to provide a context for the second question. I know that it's just using the definition.

Looking at the problem from another perspective - Suppose that U is a subspace of some real vector space V spanned by two unit vectors b and c and d is just some element of V (not necessarily in the span of b and c). Then the projection of d onto U is e = <d,b>b + <d,c>c. The vector orthogonal to that projection is simply d - e. I was thinking that it might have something to do with projections.
 
  • #4
It would be interesting to see if there were an algebraic approach to solving the second question. However, the analytic approach is simple and obvious, albeit inelegant. If you need to just do the problem, you can do it using calculus. If you want to know if there is an algebraic solution, I can't think of one off the top of my head
 
  • #5
AKG said:
It would be interesting to see if there were an algebraic approach to solving the second question. However, the analytic approach is simple and obvious, albeit inelegant. If you need to just do the problem, you can do it using calculus. If you want to know if there is an algebraic solution, I can't think of one off the top of my head

The orthogonal projection of [tex]p\left( x \right) = a_0 + a_1 x + a_2 x^2 + a_3 x^3 \in P_3 [/tex] on W is, of course, [itex]a_2x^2+ a_3x^3[/itex].

3+ 5x- q(x)= 0 when q(x)= 3- 5x. If q(x)= 3+ 5x, the integral is 0. That's the minimum isn't it?
 
  • #6
Halls, q must lie in W = span{x^2, x^3}.
 

FAQ: How Do You Calculate Orthogonal Projections in Polynomial Subspaces?

What is a subspace?

A subspace is a subset of a vector space that satisfies the same properties as the vector space. This means that it is closed under vector addition and scalar multiplication.

How do you determine if a set of vectors forms a subspace?

To determine if a set of vectors forms a subspace, you need to check if the set satisfies the three conditions of a subspace: closure under addition, closure under scalar multiplication, and contains the zero vector.

What is an inner product?

An inner product is a mathematical operation that takes two vectors as input and produces a scalar as output. It is often denoted by <u, v> and is used to measure the angle between two vectors and the length of a vector.

How do you calculate the inner product of two vectors?

To calculate the inner product of two vectors, you need to multiply the corresponding components of the two vectors and then add them together. For example, if u = [u1, u2, u3] and v = [v1, v2, v3], then the inner product <u, v> is equal to u1v1 + u2v2 + u3v3.

How is the inner product related to the concept of orthogonality?

The inner product is closely related to the concept of orthogonality, which is the idea of perpendicularity between two vectors. If the inner product of two vectors is equal to zero, then the vectors are orthogonal. This means that they form a 90-degree angle with each other.

Back
Top