I Adding trig functions with different amplitudes

Mayhem
Messages
406
Reaction score
306
TL;DR Summary
A general rule for adding two trigonometric functions that have unidentical amplitudes
The trig identities for adding trig functions can be seen:
1662661943524.png

But here the amplitudes are identical (i.e. A = 1). However, what do I do if I have two arbitrary, real amplitudes for each term? How would the identity change?

Analysis: If the amplitudes do show up on the RHS, we would expect them to either be a product or sum of these, possibly signed, or simply explicitly states. For A = 1, it may be difficult to see where they appear if explicitly stated, as they disappear as a factor. However, what we do see is that 2 appears in front of all of the RHS identities, which is a hint that for A_1 = A_2 = 1, we simply add them together and place them as a factor in front of the expression. However, this isn't necessarily the case, and simply and intuition, and considering 2 also appears in the denominators of the inner terms, it isn't a given that the number 2 shows up for this reason.

I don't know the derivations of the above identities, so I'm wondering if there is a way to generalize something like Asin(a) + Bsin(b) such that these terms are accounted for on the RHS of an equivalent expression.
 
Mathematics news on Phys.org
There is no general simplification for that situation. You just have to leave them as the multiplied sum of two different trig functions.
 
FactChecker said:
There is no general simplification for that situation. You just have to leave them as the multiplied sum of two different trig functions.
Well that's annoying. The problem is I am trying to program a Fourier transform, which requires me to make a linear combination of trig functions. However, I can probably figure out a workaround.
 
Mayhem said:
Well that's annoying. The problem is I am trying to program a Fourier transform, which requires me to make a linear combination of trig functions. However, I can probably figure out a workaround.
If your program only has to calculate a linear combination of a couple of trig functions, then a computer can easily do the calculation directly.
If you are trying to calculate the Fourier transform of a general function and have enough data points, then you should look into the Fast Fourier Transformation (FFT). There are several implementations of the FFT algorithm. (see https://en.wikipedia.org/wiki/Fast_Fourier_transform)
 
Last edited:
These identities are derived from <br /> \begin{split} \cos(a \pm b) &amp;= \cos a \cos b \mp \sin a \sin b, \\<br /> \sin(a \pm b) &amp;= \sin a \cos b \pm \cos a \sin b. \end{split}<br /> Their purpose in the context of transforms is to turn products into sums. For example <br /> \begin{split}<br /> \left(\sum_{n=0}^N a_n \cos(nx)\right)\left(\sum_{n=0}^N b_n \cos(nx)\right)<br /> &amp;= \sum_{n=0}^N \sum_{m=0}^N a_n b_m \cos (nx) \cos(m x) \\<br /> &amp;= \frac12 \sum_{n=0}^N \sum_{m=0}^N<br /> a_nb_m \left( \cos((n+m)x) + \cos((n-m)x)\right)\end{split} and from there you can work out which values of n and m will contribute to the coefficients c_r in \sum_{r=0}^N c_r \cos(rx).

You can use these identities to do what you were originally attempting, but it is unclear to me why you would want to write (A + B)\sin((a+b)/2)\cos((a-b)/2) + (A - B)\cos((a+b)/2)\sin((a-b)/2) instead of A \sin a + B \sin b.
 
Last edited:
  • Like
Likes PeroK, Mayhem and topsquark
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Replies
17
Views
6K
Replies
5
Views
1K
Replies
9
Views
2K
Replies
7
Views
1K
Replies
2
Views
847
Replies
3
Views
1K
Replies
2
Views
1K
Back
Top