Video yükleniyor...

Video Yüklenemedi

Bu video yüklenirken bir sorun oluştu. Bu geçici bir ağ sorunundan kaynaklanıyor olabilir veya video kullanılamıyor olabilir.

Ana Sayfaya Dön

Spherical Harmonics 🤝 Fourier Transform I’m modeling the cell surface as a time-varying field u(θ,φ). Budding is energy shifting into higher angular frequencies. Decompose u into spherical harmonics (the Fourier basis on a sphere), evolve the coefficients aₗₘ(t) where growth/smoothing is clean, then inverse-transform back into a breathing, budding... show more

Mathelirium

23,374 subscribers

25,478 görüntüleme • 5 ay önce •via X (Twitter)

Anya Rossi• Live Now

Private livecam show

0 Yorum

Yorum bulunmuyor

Orijinal gönderinin yorumları burada görünecek

Benzer Videolar

Fourier Transform 🤝 Spherical Harmonics = Viral Budding Geometry Viral Budding of an Infected Cell

Fourier Transform 🤝 Spherical Harmonics = Viral Budding Geometry Viral Budding of an Infected Cell

Mathelirium

11,817 görüntüleme • 3 ay önce

This video presents a recent breakthrough called the Sparse Fourier Transform (SFT). This algorithm yields an exponential speed-up over the celebrated Fast Fourier Transform (FFT) when asked to extract a small number of dominant Fourier coefficients.

This video presents a recent breakthrough called the Sparse Fourier Transform (SFT). This algorithm yields an exponential speed-up over the celebrated Fast Fourier Transform (FFT) when asked to extract a small number of dominant Fourier coefficients.

Mathelirium

50,712 görüntüleme • 3 ay önce

Nuclear Vibrations via Spherical Harmonics

Nuclear Vibrations via Spherical Harmonics

Mathelirium

16,274 görüntüleme • 3 ay önce

A lens can perform the Fourier transform! 🔍 This is the 4F system: the first lens converts an image into its frequency components, and the second lens reconstructs it. By adding an aperture at the Fourier plane, we can filter out high frequencies. #Optics #Physics #b3d

A lens can perform the Fourier transform! 🔍 This is the 4F system: the first lens converts an image into its frequency components, and the second lens reconstructs it. By adding an aperture at the Fourier plane, we can filter out high frequencies. #Optics #Physics #b3d

Hans Chiu

220,026 görüntüleme • 1 yıl önce

A Lens Is a Physical Fourier Computer A lens does not only bend light. It computes with the wave. Send several Gaussian beams into the lens, and the field after the glass is no longer just focused. The lens adds a quadratic phase, lets the wave propagate, and converts angle into position at the focal plane. That detector plane is the Fourier plane.

A Lens Is a Physical Fourier Computer A lens does not only bend light. It computes with the wave. Send several Gaussian beams into the lens, and the field after the glass is no longer just focused. The lens adds a quadratic phase, lets the wave propagate, and converts angle into position at the focal plane. That detector plane is the Fourier plane.

Mathelirium

34,626 görüntüleme • 1 ay önce

Have you seen anything more beautiful today? Fourier Modes Breathing Life Into a Torus

Have you seen anything more beautiful today? Fourier Modes Breathing Life Into a Torus

Mathelirium

12,751 görüntüleme • 4 ay önce

The Fast Fourier Transform is the most important numerical algorithm of our lifetime - Gilbert Strang, MIT

The Fast Fourier Transform is the most important numerical algorithm of our lifetime - Gilbert Strang, MIT

Mathelirium

50,420 görüntüleme • 3 ay önce

A Lens That Takes Derivatives US Patent Basis: US8610839B2 - Optical Processing System for Computing Derivatives. In a 4f Optical Processor, the first lens takes the incoming field and forms its Fourier spectrum. At that middle plane, a tiny optical mask multiplies the spectrum by iξ. This is the derivative operator written in Fourier language u(x) -> U(ξ) -> iξU(ξ) -> ∂u/∂x Then the second lens brings the field back to the real space. What comes out is no longer just a focused beam. It is the spatial derivative of the input field, computed by light as it propagates. So, this is the serious promise of optical computing. A physical optical train can perform operations that usually live inside numerical code: differentiation, filtering, convolution, edge detection, correlation, and many other linear transforms.

A Lens That Takes Derivatives US Patent Basis: US8610839B2 - Optical Processing System for Computing Derivatives. In a 4f Optical Processor, the first lens takes the incoming field and forms its Fourier spectrum. At that middle plane, a tiny optical mask multiplies the spectrum by iξ. This is the derivative operator written in Fourier language u(x) -> U(ξ) -> iξU(ξ) -> ∂u/∂x Then the second lens brings the field back to the real space. What comes out is no longer just a focused beam. It is the spatial derivative of the input field, computed by light as it propagates. So, this is the serious promise of optical computing. A physical optical train can perform operations that usually live inside numerical code: differentiation, filtering, convolution, edge detection, correlation, and many other linear transforms.

Mathelirium

137,485 görüntüleme • 1 ay önce

Here's one but with the Fourier transform settings a bit wonky

Here's one but with the Fourier transform settings a bit wonky

Sauers

128,866 görüntüleme • 1 yıl önce

The Fourier series, modeling periodic functions with cosines and sines, and computing Fourier coefficients as projections onto orthogonal bases in Python. source: Steve Brunton

The Fourier series, modeling periodic functions with cosines and sines, and computing Fourier coefficients as projections onto orthogonal bases in Python. source: Steve Brunton

tetsuo

80,704 görüntüleme • 7 ay önce

On Meta Quest you can now transform any flat surface into a virtual keyboard. We truly live in the future.

On Meta Quest you can now transform any flat surface into a virtual keyboard. We truly live in the future.

Nathie 🔜 AWE

55,960 görüntüleme • 4 ay önce

fourier transform

fourier transform

cizikci

31,932 görüntüleme • 1 yıl önce

Fourier transform of a mechanical music box shows up the imprinted pattern 🎶

Fourier transform of a mechanical music box shows up the imprinted pattern 🎶

Jithin B.P., Ph.D.

82,889 görüntüleme • 4 ay önce

MIT engineers have developed an ultralight fabric solar cell that can transform virtually any surface into a power source. Here’s how they work.

MIT engineers have developed an ultralight fabric solar cell that can transform virtually any surface into a power source. Here’s how they work.

Interesting Engineering

54,248 görüntüleme • 1 yıl önce

One of my favorite features on Apple Vision Pro is the ability to transform old photos into 3D memories. It's like creating a window into the past.

One of my favorite features on Apple Vision Pro is the ability to transform old photos into 3D memories. It's like creating a window into the past.

Nathie 🔜 AWE

13,994 görüntüleme • 2 yıl önce

The Trap in Every Mathematics Lecture If you’ve taken a lot of math courses, you start to recognize a pattern. There’s a moment where the lecturer is warming up with the obvious stuff...add matrices entrywise, scale by α, do the row-column product...and you’re thinking, alright… where is this going? Then you relax. You stop resisting. And right there, they slip in one line that changes how you see the whole subject. When Benedict Gross says "matrices represent linear operators,"he’s telling you to stop treating a matrix as a rectangle of numbers and start treating it as an action. A linear operator is a function T: Rⁿ → Rⁿ that respects two rules: T(u+v)=T(u)+T(v) and T(αu)=αT(u). Once you pick a basis, T is completely determined by where it sends the basis vectors e₁,…,eₙ. Put T(e₁),…,T(eₙ) into columns and you get a matrix A. That is what "A represents T" means...A is the coordinate portrait of the transformation. Now the punchline that makes matrix multiplication feel inevitable. If B represents S and A represents T, then doing S first and then T is the composition T∘S. In coordinates that becomes A(Bx)=(AB)x. So multiplying matrices is really composing transformations. That’s why multiplication is usually not commutative: T∘S is generally not the same transformation as S∘T, and the matrices inherit that noncommutativity. This explains half of Linear Algebra because it tells you what the course is really about...functions that move vectors around, not grids of numbers. A matrix is just the written form of that function once you choose coordinates. Then the rules stop feeling random Multiplying matrices means doing one move and then another, an inverse means you can undo the move, eigenvectors are directions that don’t get turned, and changing basis is just describing the same move in a different language. That one idea makes a lot of linear algebra click. #LinearAlgebra #Matrices #GroupTheory #GLn #MathLectures #Mathematics

The Trap in Every Mathematics Lecture If you’ve taken a lot of math courses, you start to recognize a pattern. There’s a moment where the lecturer is warming up with the obvious stuff...add matrices entrywise, scale by α, do the row-column product...and you’re thinking, alright… where is this going? Then you relax. You stop resisting. And right there, they slip in one line that changes how you see the whole subject. When Benedict Gross says "matrices represent linear operators,"he’s telling you to stop treating a matrix as a rectangle of numbers and start treating it as an action. A linear operator is a function T: Rⁿ → Rⁿ that respects two rules: T(u+v)=T(u)+T(v) and T(αu)=αT(u). Once you pick a basis, T is completely determined by where it sends the basis vectors e₁,…,eₙ. Put T(e₁),…,T(eₙ) into columns and you get a matrix A. That is what "A represents T" means...A is the coordinate portrait of the transformation. Now the punchline that makes matrix multiplication feel inevitable. If B represents S and A represents T, then doing S first and then T is the composition T∘S. In coordinates that becomes A(Bx)=(AB)x. So multiplying matrices is really composing transformations. That’s why multiplication is usually not commutative: T∘S is generally not the same transformation as S∘T, and the matrices inherit that noncommutativity. This explains half of Linear Algebra because it tells you what the course is really about...functions that move vectors around, not grids of numbers. A matrix is just the written form of that function once you choose coordinates. Then the rules stop feeling random Multiplying matrices means doing one move and then another, an inverse means you can undo the move, eigenvectors are directions that don’t get turned, and changing basis is just describing the same move in a different language. That one idea makes a lot of linear algebra click. #LinearAlgebra #Matrices #GroupTheory #GLn #MathLectures #Mathematics

Mathelirium

66,204 görüntüleme • 4 ay önce

The only way to safeguard our sovereignty is to accelerate responsible resource development. This is Ontario's plan to transform Canada into a self-reliant clean energy superpower.

The only way to safeguard our sovereignty is to accelerate responsible resource development. This is Ontario's plan to transform Canada into a self-reliant clean energy superpower.

Stephen Lecce

10,388 görüntüleme • 1 yıl önce

This is the BEST way to digitize your math notes. 🤯 Grok 4 converted a Fourier Series approximation for f(x)=x^2 into clean, formatted LaTeX!

This is the BEST way to digitize your math notes. 🤯 Grok 4 converted a Fourier Series approximation for f(x)=x^2 into clean, formatted LaTeX!

tetsuo

115,526 görüntüleme • 7 ay önce

Quantum mechanics has a reputation for being mystical mainly because people skip the rules and jump to interpretations. In this lecture series, we’re doing the opposite. We start from the rules, follow the algebra, and let the picture be the calculation. Classical Probability Theory combines alternatives by adding their probabilities. Quantum Theory combines them one step earlier…add complex amplitudes first, then square at the end. That swap in order is everything. Expand |a₁ + a₂|² and you don’t just get |a₁|² + |a₂|²…you get a cross-term, 2 Re(a₁ a₂*). Its sign is set by phase, so the same two contributions can reinforce or cancel. Interference is just the algebra of squaring a sum. In the 3D render, the surface height is proportional to |a(x)| (so peaks become bright bands after squaring), while the surface skin is colored by the local phase arg(a(x)). As the phase knob φ(t) is swept on path 2, the cross-term oscillates, and you literally watch the interference ridges slide across the screen. We model a detector screen with coordinates x in R² (think x = (x,y)). A quantum state assigns a complex amplitude a(x). The rule for outcomes is p(x) = |a(x)|² Now the key situation: two coherent alternatives contribute to the same outcome x. Let their amplitudes be a₁(x) and a₂(x). Quantum says a(x) = a₁(x) + a₂(x) So the probability density becomes p(x) = |a₁(x) + a₂(x)|² Expand it (this is the whole episode): p(x) = (a₁ + a₂)(a₁* + a₂*) = |a₁|² + |a₂|² + a₁ a₂* + a₁* a₂ = |a₁|² + |a₂|² + 2 Re(a₁ a₂*) That last term is the interference term. It can be positive or negative. To see phase explicitly, write each contribution in polar form: a₁(x) = r₁(x) exp(i θ₁(x)) a₂(x) = r₂(x) exp(i θ₂(x)) Then a₁ a₂* = r₁ r₂ exp(i(θ₁ − θ₂)) So the cross-term is 2 Re(a₁ a₂*) = 2 r₁ r₂ cos(θ₁(x) − θ₂(x)) That’s the fringe engine: p(x) = r₁² + r₂² + 2 r₁ r₂ cos(Δθ(x)) Now the phase knob we animate: Add a controllable phase shift φ to path 2: a₂(x) → a₂(x) exp(i φ) Then Δθ(x) → Δθ(x) − φ, so p(x; φ) = r₁² + r₂² + 2 r₁ r₂ cos(Δθ(x) − φ) As φ changes smoothly, the bright/dark pattern slides continuously. Same setup, same geometry, same magnitudes r₁,r₂, only phase changed. #QuantumMechanics #WaveInterference #ComplexAmplitudes #DoubleSlit #Physics #Mathematics

Quantum mechanics has a reputation for being mystical mainly because people skip the rules and jump to interpretations. In this lecture series, we’re doing the opposite. We start from the rules, follow the algebra, and let the picture be the calculation. Classical Probability Theory combines alternatives by adding their probabilities. Quantum Theory combines them one step earlier…add complex amplitudes first, then square at the end. That swap in order is everything. Expand |a₁ + a₂|² and you don’t just get |a₁|² + |a₂|²…you get a cross-term, 2 Re(a₁ a₂). Its sign is set by phase, so the same two contributions can reinforce or cancel. Interference is just the algebra of squaring a sum. In the 3D render, the surface height is proportional to |a(x)| (so peaks become bright bands after squaring), while the surface skin is colored by the local phase arg(a(x)). As the phase knob φ(t) is swept on path 2, the cross-term oscillates, and you literally watch the interference ridges slide across the screen. We model a detector screen with coordinates x in R² (think x = (x,y)). A quantum state assigns a complex amplitude a(x). The rule for outcomes is p(x) = |a(x)|² Now the key situation: two coherent alternatives contribute to the same outcome x. Let their amplitudes be a₁(x) and a₂(x). Quantum says a(x) = a₁(x) + a₂(x) So the probability density becomes p(x) = |a₁(x) + a₂(x)|² Expand it (this is the whole episode): p(x) = (a₁ + a₂)(a₁ + a₂) = |a₁|² + |a₂|² + a₁ a₂ + a₁* a₂ = |a₁|² + |a₂|² + 2 Re(a₁ a₂) That last term is the interference term. It can be positive or negative. To see phase explicitly, write each contribution in polar form: a₁(x) = r₁(x) exp(i θ₁(x)) a₂(x) = r₂(x) exp(i θ₂(x)) Then a₁ a₂ = r₁ r₂ exp(i(θ₁ − θ₂)) So the cross-term is 2 Re(a₁ a₂*) = 2 r₁ r₂ cos(θ₁(x) − θ₂(x)) That’s the fringe engine: p(x) = r₁² + r₂² + 2 r₁ r₂ cos(Δθ(x)) Now the phase knob we animate: Add a controllable phase shift φ to path 2: a₂(x) → a₂(x) exp(i φ) Then Δθ(x) → Δθ(x) − φ, so p(x; φ) = r₁² + r₂² + 2 r₁ r₂ cos(Δθ(x) − φ) As φ changes smoothly, the bright/dark pattern slides continuously. Same setup, same geometry, same magnitudes r₁,r₂, only phase changed. #QuantumMechanics #WaveInterference #ComplexAmplitudes #DoubleSlit #Physics #Mathematics

Mathelirium

81,394 görüntüleme • 5 ay önce

The Trap in Every Mathematics Lecture If you’ve taken enough math courses, you start noticing the same little move. The lecturer warms up with the obvious stuff, add matrices entrywise, scale by α, do the row-column product, and you’re thinking alright, where is this going. Then you relax. You stop resisting. And right there, they drop one line that quietly rewires the whole subject. When Benedict Gross says matrices represent linear operators, he’s telling you to stop treating a matrix as a rectangle of numbers and start treating it as an action. A linear operator is a function T: ℝⁿ → ℝⁿ that respects two rules: T(u+v) = T(u) + T(v) T(αu) = αT(u) Once you pick a basis, T is completely determined by where it sends the basis vectors e₁,…,eₙ. Put T(e₁),…,T(eₙ) into columns and you get a matrix A. That is what A represents T means. A is the coordinate portrait of the transformation. Now the punchline that makes matrix multiplication feel inevitable. If B represents S and A represents T, then doing S first and then T is the composition T∘S. In coordinates that becomes A(Bx) = (AB)x. So multiplying matrices is really composing transformations. That’s why multiplication is usually not commutative. T∘S is generally not the same transformation as S∘T, and the matrices inherit that noncommutativity. This explains half of linear algebra because it tells you what the course is really about: functions that move vectors around, not grids of numbers. A matrix is just the written form of that function once you choose coordinates. After that, the rules stop feeling random. Multiplying matrices means doing one move and then another. An inverse means you can undo the move. Eigenvectors are directions that don’t get turned. Changing basis is just describing the same move in a different language. One idea, and a lot of linear algebra suddenly clicks. #LinearAlgebra #Matrices #LinearMaps #Eigenvectors #ChangeOfBasis #Mathematics

The Trap in Every Mathematics Lecture If you’ve taken enough math courses, you start noticing the same little move. The lecturer warms up with the obvious stuff, add matrices entrywise, scale by α, do the row-column product, and you’re thinking alright, where is this going. Then you relax. You stop resisting. And right there, they drop one line that quietly rewires the whole subject. When Benedict Gross says matrices represent linear operators, he’s telling you to stop treating a matrix as a rectangle of numbers and start treating it as an action. A linear operator is a function T: ℝⁿ → ℝⁿ that respects two rules: T(u+v) = T(u) + T(v) T(αu) = αT(u) Once you pick a basis, T is completely determined by where it sends the basis vectors e₁,…,eₙ. Put T(e₁),…,T(eₙ) into columns and you get a matrix A. That is what A represents T means. A is the coordinate portrait of the transformation. Now the punchline that makes matrix multiplication feel inevitable. If B represents S and A represents T, then doing S first and then T is the composition T∘S. In coordinates that becomes A(Bx) = (AB)x. So multiplying matrices is really composing transformations. That’s why multiplication is usually not commutative. T∘S is generally not the same transformation as S∘T, and the matrices inherit that noncommutativity. This explains half of linear algebra because it tells you what the course is really about: functions that move vectors around, not grids of numbers. A matrix is just the written form of that function once you choose coordinates. After that, the rules stop feeling random. Multiplying matrices means doing one move and then another. An inverse means you can undo the move. Eigenvectors are directions that don’t get turned. Changing basis is just describing the same move in a different language. One idea, and a lot of linear algebra suddenly clicks. #LinearAlgebra #Matrices #LinearMaps #Eigenvectors #ChangeOfBasis #Mathematics

Mathelirium

133,454 görüntüleme • 3 ay önce