16.3 Capstone: Reaction–Diffusion Pattern Lab ended with a question: on a periodic square the Laplacian has eigenvectors we know in closed form, the Fourier modes, so the implicit step was a transform, a division and an inverse transform. What happens when the domain is not periodic and not a rectangle? Then there is no formula and no FFT, but the eigenproblem is still there, and it is the one that decides how every drum, bell, wine glass and loudspeaker cone sounds. This capstone builds a drum synthesiser around that eigenproblem. We put the wave equation on a grid with a mask that says which cells belong to the drum, show that the grid operator is a symmetric matrix, find its lowest eigenvectors with a sparse solver we write ourselves, check the circle against the Bessel-function theory of 8.6 Orthogonal Polynomials & Special Functions, and turn the eigenpairs into sound by adding up decaying sinusoids. The showpiece is a lab where you draw a shape, see its modes, strike it where you like, and hear it.
Transcript
- A drum head is a membrane clamped at the rim. On a grid, a mask says which nodes belong to the drum, and every neighbour outside the mask is held at zero: a staircase rim. Minus the five point Laplacian becomes an operator A. The leapfrog step is two u minus the previous u minus nu squared A u, and a strike is a velocity impulse at one node.
- How big a step is safe? Leapfrog is stable when nu squared times the largest eigenvalue is at most four. The grid is bipartite: flip the sign of every other node and A becomes eight I minus A, so the largest eigenvalue is eight minus the smallest. The limit is therefore always a little above one over root two, 0.7071. For a disk of radius 6 the formula gives 0.71359 and running the scheme gives 0.71360.
- Number the inside nodes and A is a symmetric positive definite matrix. Its eigenvectors decouple the wave equation into independent oscillators of angular frequency root lambda, so an eigenvector is a mode, and frequency ratios are square roots of eigenvalue ratios. The lab uses block inverse iteration with a Rayleigh Ritz step on a banded Cholesky factor, in a block because symmetric shapes repeat eigenvalues. On a disk of radius 24, lambda one is 0.009832, matching scipy.
- On the square there is no staircase, and the discrete modes are products of sines, so the solver can be checked exactly: at N equals 20, lambda one is 0.044677 and agrees with the closed form to about 10 to the minus 15. Against the continuum frequency ratios the error is clean second order: 4.724 percent at N equals 10, 1.311 at 20, 0.345 at 40 and 0.0885 at 80.
- The circle is a staircase. Its Bessel ratios are 1, 1.5933, 2.1355, 2.2954 and so on: not integers. Against them the worst ratio error over modes 2 to 12 falls from 10.03 percent at radius 4 to 0.082 percent at radius 64. Better than first order, not a clean second. The absolute eigenvalue is worse: lambda one is low by 11.2 percent, 5.93, 3.48, 1.96 and 1.01, only first order.
- Why is the pitch low? The clamped staircase rim sits about a quarter to a third of a cell outside the nominal radius. The effective radius is 4.2457 at R equals 4 and 64.3258 at R equals 64, an excess that does not shrink. A slightly bigger drum is a lower drum, and since the offset is nearly the same for every mode, dividing by lambda one cancels it. The grid also splits the degenerate 2,1 pair, by 4.77 percent at radius 4 and 0.0483 at radius 64.
- Here are real eigenvectors of the radius 16 disk as heat maps: cyan negative, amber positive, grey the nodal line. The one one mode has one diameter, the two one has two, and zero two has a nodal ring. Their frequency ratios are the Bessel values 1.5933, 2.1355 and 2.2954, then 2.6531 and 2.9173. A pair is two shapes at any rotation, so the solver may return either.
- Now the sound. Strike node p, listen at node r. Each mode contributes its value at the strike times its value at the pickup, over its frequency ratio, times a decaying sine. Frequencies are 110 Hz times root lambda over root lambda one. With a 60 dB time of 1.5 seconds, the 1,1 pair fades in 0.9339 seconds and mode 6 in 0.5654. On a five by five square the sum matches leapfrog to 1.4 times 10 to the minus 13.
- Where you strike decides what you hear. The coefficient phi k at the strike vanishes on a nodal line. On a 15 by 15 square struck at the centre, the 1,1 mode has the value 0.015625 there, but the 2,2 cross has a nodal line through the centre and its sum is below 10 to the minus 22: silent. On the disk, a centre strike excites only the rotationally symmetric modes. Strike off centre and the pairs join in.
- Nothing cared that the drum was round. Paint a shape and the lab rebuilds the matrix and solves again. The L shaped drum is a convergence test: a two by two square with a one by one corner removed. With s cells per unit length, lambda one is 9.6932 at s equals 8, 9.6735 at 16 and 9.6562 at 32, against a reference 9.6397 that I remember. Paint a notch in the circle and its degenerate pairs split.
- Honest limits. A membrane under tension is not a drum: no air loading, no stiffness, no nonlinearity, and the damping law is a choice. The staircase limits the ratios to an order between 1.5 and 1.9, and the pitch to first. The isospectral pair from Kac's question I recall but did not verify, and the sound has never been heard. Next, L-16.5, the orbital transfer planner: an orbit is conservative, nothing damps errors, and the leapfrog you ran here is symplectic. Does that carry over to gravity?
What we are building
A drum head is a membrane under uniform tension, clamped at the rim. Its small vertical displacement obeys the 2D wave equation of 9.8 Higher Dimensions: Membranes & Drums,
Everything in this capstone uses units in which and the grid spacing is cell, so the time step is the Courant number and a frequency is in radians per time step. The sound only needs one more choice, which is the pitch of the lowest mode, and we pick Hz and rescale everything else by it. Nothing here is calibrated to a real drum, and the closing section says how a real one differs.
Every result below states the grid, the resolution, the time step and the tolerance. Each was produced twice: once by the lab’s own functions run under node, and once by a separate numpy and scipy program (a different assembly of the matrix by Kronecker products, a different eigensolver, scipy’s eigsh with shift-invert, and scipy’s jn_zeros for the Bessel zeros). Where the two programs disagreed by more than rounding I would say so; they did not, and the largest disagreement in any eigenvalue was in relative terms. A few claims come from memory and are marked as such. Timings belong to one machine and are not recomputable. The one thing I could not test is the sound: WebAudio does not run in a headless browser, so the audio path is written and checked sample by sample against the formula, but nobody has listened to it while I wrote this.
Five steps build the lab, then the lab itself:
- the wave equation on a masked grid, the leapfrog step and its measured step limit;
- the masked Laplacian as a matrix and the modes as its eigenvectors;
- the circle: staircase against Bessel, and the square, where everything is exact;
- modal synthesis: strike, project, damp, add up;
- draw your own shape.
Step 1: the wave equation on a masked grid
Let the grid nodes be the points , and let a boolean mask say which of them belong to the drum. A node with a neighbour outside the mask treats that neighbour as having , which is the clamped rim, drawn as a staircase through the grid. Define the operator
That is minus the five-point Laplacian of 10.1 Finite Differences: Discretizing Derivatives with the outside neighbours set to zero, so . The wave equation becomes the system , and the leapfrog scheme of 10.5 Wave Equation Numerics & the CFL Condition advances it with
This is the central difference in time, second order, and it needs two time levels. A strike is a velocity impulse at one node: and , a one at the struck node and zeros elsewhere (this is our convention for the initial data).
The step limit, measured
For the empty square the limit on is the familiar . For a general shape it is set by the largest eigenvalue of : leapfrog is stable if and only if , so . We do not need to compute from scratch, because the grid is bipartite. Colour the nodes like a checkerboard and let be the diagonal matrix of by colour. Every neighbour pair has opposite colours, so flips the sign of every off-diagonal entry of and leaves the on the diagonal alone, which means . The two matrices are similar, so their eigenvalues are related by , and
The smallest eigenvalue is positive for any shape, so is a safe step for every drum, and the true limit sits a little above it. The cell below checks this by running the scheme: it bisects on whether random initial data blows up. That is the same method as the explicit-limit measurement in 16.3 Capstone: Reaction–Diffusion Pattern Lab, and it needs no theory.
The lab’s own measurement, bisecting for iterations on random initial data over steps with the blow-up threshold at , and the numpy version of the same experiment, agree with the formula to about (the measured value always sits slightly above the formula, because just beyond the limit the growth per step is so close to that steps are not enough to reach the threshold):
| shape and resolution | nodes | formula | measured, node | measured, numpy | |
|---|---|---|---|---|---|
| square, | |||||
| square, | |||||
| square, | |||||
| square, | |||||
| disk, | |||||
| disk, |
Here is , and scipy’s eigsh with which="LA" returns the same largest eigenvalue to . The square tends to from above as the grid refines, exactly as the formula predicts. The cell above, a disk of radius cells ( nodes), gave , , formula and measured ( bisections, steps, node and numpy alike).
Step 2: the masked Laplacian is a symmetric matrix, and its eigenvectors are the modes
Number the inside nodes row by row. Then is an matrix with on the diagonal and for each pair of neighbouring inside nodes. It is symmetric, and it is positive definite: for any vector on the inside nodes, over neighbouring pairs, plus a term for every missing neighbour, and the sum is zero only for because the rim pins the membrane. By the spectral theorem of 1.6 Change of Basis & Diagonalization, has real positive eigenvalues and orthonormal eigenvectors .
Why eigenvectors are modes: the semi-discrete wave equation is with . Write . The orthonormal basis decouples the system into independent oscillators , and each of those is the harmonic oscillator of 5.3 Mechanical Vibrations: Spring–Mass–Damper with angular frequency
The shape keeps its form while it oscillates, and that is what a mode is. Only the ratios matter for the timbre, and the choice Hz fixes the scale. We cannot get all eigenpairs cheaply for a fine grid, but we do not want all of them: the highest ones are grid noise, and a drum sound is mostly the first twenty or so. We want the lowest eigenpairs.
You will write the matrix first. It is the construction of the cell above, now asked of you, and the tests check it against hand-computable cases.
The sparse eigensolver
A dense np.linalg.eigh of an matrix costs about operations, which is fine for the cell above and hopeless for the lab: a circle on a grid has nodes and I want the answer while you draw. The matrix is sparse (at most five entries per row), and we want only the smallest eigenvalues. The classical remedy is the inverse iteration of 1.5 Eigenvectors & Eigenvalues: repeatedly applying to a vector multiplies the component along by , so the component with the smallest wins. Doing this with a block of vectors at once, re-orthonormalising and diagonalising the small matrix after each solve (the Rayleigh-Ritz step), gives the lowest eigenpairs together.
Two choices matter. First, each solve is with the same matrix, so factor it once: is banded (the bandwidth is the grid width), and a banded Cholesky factorisation costs about with the bandwidth, and each later solve costs . Second, use a block rather than one vector, because shapes with symmetry have repeated eigenvalues. A circle’s modes come in degenerate pairs, one and one for every , and a single-vector iteration finds one vector of an eigenspace and misses the other. The lab asks for vectors so that the we keep are well separated from the unconverged rest. It iterates until the largest residual is below (the tolerance used in the lab; the checks below use and ), and it solves the circle on a grid () for modes in ms and the grid () in ms on my machine (timings, not recomputable). This is the same operation as scipy’s eigsh(A, k, sigma=0), which is the next cell.
You will build it yourself in numpy, with a dense np.linalg.solve in place of the banded factorisation.
For a large sparse matrix you would hand the work to a library, and the next cell does that with scipy.sparse.linalg.eigsh using shift-invert about , on a disk of radius ( unknowns, stored entries). The cell has a dense fallback in case the sparse solver is not available in your browser Python, and prints which route it took. The values it prints, and the twelve ratios, match the lab’s own solver (iterated to on the same mask) to the six digits shown.
Step 3: the circle against Bessel, and the square where everything is exact
For a circular drum of radius the separation of variables of 9.8 Higher Dimensions: Membranes & Drums gives modes and , where is the th positive zero of the Bessel function (8.6 Orthogonal Polynomials & Special Functions). The frequencies are proportional to , and the lowest ones, relative to the fundamental , are
| mode | ratio | multiplicity | |
|---|---|---|---|
(The lab computes the zeros itself, from the Bessel integral evaluated by a -point periodic trapezoid sum, a scan and a bisection, and they match scipy’s jn_zeros to .) These are not integer ratios: a circular drum is not harmonic, and that is one reason a drum has a pitch much less definite than a string.
On the grid the circle is a staircase: the nodes strictly inside a circle of radius cells, centred on a node. We expect error from the jagged rim. The cell below computes the lowest twelve eigenvalues by dense eigh for , forms the ratios , and reports the error against the Bessel ratios.
Here are the numbers of the lab’s solver (disk of radius cells, modes, tolerance ), confirmed by the numpy and scipy program to :
| (cells) | nodes | largest ratio error, modes 2-12 | |||
|---|---|---|---|---|---|
Three things are in this table. The first is the absolute pitch. The staircase circle sounds lower than the true circle: is negative at every resolution. The reason is that the clamped boundary of the staircase sits about a quarter to a third of a cell outside the nominal radius: the effective radius that reproduces the computed exceeds by , , , , cells as doubles from to . A drum that is a fraction of a cell larger is a lower drum, and since does not shrink, the error in falls only like , which is first order (the entries go , , , , : roughly halving per doubling, order about to ).
The second is the ratios. The offset of the rim is nearly the same for every mode, so it cancels when we divide by . The largest ratio error falls from at to at , a factor of over a factor of in radius, which is an observed order of about to for the successive doublings (the exponents per doubling, the base- logarithm of each error ratio, are , , and , noisy because the staircase changes its shape every time changes). It is better than first order but not a clean second, and I would not quote one number for it. At the twelve ratios are , (twice), , , , (twice), (twice), and , against the Bessel values above, and the error on each is under (the per-mode errors in percent are , , , , , , , , , , , ).
The third is the splitting of a degenerate pair. The continuum has the pair exactly degenerate, and the square grid only has a fourfold symmetry, which cannot keep and equal. At the pair splits by in , at by , at by , at by and at by (as ). The pair, which the four-fold symmetry does keep degenerate, stays equal to about , which is rounding. A grid synthesiser therefore plays a slow beat between the two members of a split pair that a real drum would not have (the real drum has its own, from imperfections).
The square, where the discrete modes are exact
On the square drum there is no staircase, only the interior grid, and the discrete modes are products of sines: with eigenvalues . For the solver gives , and the largest relative disagreement with this formula over twelve modes is (node) and (numpy). Against the continuum ratios the discretisation error is a clean second-order effect. The largest error over the first twelve modes:
| largest ratio error | |
|---|---|
Each doubling divides the error by about to , an observed order of about to . Compare that with the staircase circle: a straight rim that lies on the grid gives second order, a curved rim cut into steps gives something worse, and the difference is entirely the boundary. Note that the square’s modes have exact repeats, for several pairs at once, such as and , which both have ; those eigenvalue groups are real degeneracies and the block solver finds all their members.
Step 4: modal synthesis
Strike the drum at node and listen at node . With the velocity-impulse initial data and the orthonormal eigenbasis, mode starts with coefficient and velocity , so it contributes at its own node pattern, and the pickup at node hears times that. In the units of the lab, with pitches scaled by the fundamental,
The factor is the of a velocity impulse, so higher modes are quieter at the start. The damping is where physics goes in. A real membrane loses energy to the air and to internal friction, and higher modes die faster. A simple model that captures this has rising with :
where is the time for the fundamental to fall by dB, which is a factor in amplitude, and tunes how much faster the high modes die. In the lab with s and , for the disk of radius the fundamental decays in s, the pair in s, mode in s, mode in s and mode in s (these follow the formula, which numpy reproduces). This model is a choice and not a derivation, a common one in modal-synthesis work (from memory). Frequency-dependent damping with a quadratic law is easy to defend for viscous damping of a stiff plate and harder to defend for air loading of a membrane.
Which modes a strike excites
The coefficient vanishes if lies on a nodal line of mode , a curve where the mode shape is zero. A mode with a nodal line through the strike point is not excited at all by a strike there. On the square with and the strike at the centre node , the sum of over an eigenspace at the centre is () for the and modes, for the pair (the sum over the pair, which is and is basis-independent), and below for the rest in the solver (exactly zero in the closed form). Every mode with an even or has the centre on a nodal line and is silent. The same drum struck at the centre and off the centre sounds different for exactly this reason, and a drummer who strikes near the rim excites almost everything.
We report each eigenspace, a cluster of degenerate modes, as one line, and sum over the cluster before dividing by . The individual vectors of a degenerate pair are an arbitrary rotation of each other, so the amplitude of a single member is meaningless but the cluster sum is not.
The sound, checked
Two checks make the synthesis trustworthy. The first is exactness: on a tiny square ( nodes) with all modes kept, , steps, the strike at node and the pickup at node , the leapfrog solution and the exact discrete modal formula
agree to (node) and (numpy). So the leapfrog wave you see in the lab view is exactly a sum of modes, with a slightly shifted frequency. The second check is the spectrum: leapfrog’s frequency per step is not but above, and for the disk of radius ( nodes), , steps, the measured spectral peaks (Hann window, four times zero padding, parabolic refinement) match to about relative for the resolved modes. The time-stepped sound therefore plays the modes about (mode ) to (mode ) higher in pitch than the semi-discrete frequencies. The modal synthesiser skips the time stepping altogether and uses the semi-discrete , so the audio and the wave view differ by that dispersion error.
The third check is the sound itself, before WebAudio: synthesise s at Hz for the disk of radius with Hz, s, , and read the peaks of the spectrum. They sit within Hz of for the resolved modes: the fundamental at Hz, the pair at Hz, mode at Hz (measured ). The recomputation in numpy gave the same.
Now you build it. The exercise is the synthesis formula, tested against an explicit sum and against the nodal-line rule on a square struck at its centre.
Step 5: draw your own shape
Nothing in the previous steps cared that the drum was round or square, only that the mask is a mask. Drawing a shape is editing the mask, rebuilding the matrix and re-solving, and the lab does that in about half a second for a mid-size grid. The famous question about this is Mark Kac’s 1966 paper, “Can one hear the shape of a drum?” (from memory: it appeared in the American Mathematical Monthly). Hearing is the spectrum, the set of eigenvalues, and the question is whether the spectrum fixes the shape. Part of the answer is yes: the spectrum determines the area, through Weyl’s law, by which the number of eigenvalues below grows like (from memory), and it determines the perimeter (from memory). The full answer is no. In 1992 Gordon, Webb and Wolpert exhibited two non-congruent planar polygons with identical Laplace spectra (from memory). I tried to reproduce such a pair on the grid by searching small lattice polygons, and I did not find one, so the lab shows no isospectral pair and I make no claim that I verified that theorem here. A grid also would not give an exact test: a staircase discretisation of two isospectral polygons is not isospectral, so at most the grid spectra would be close.
A concrete test that does converge is the L-shaped drum, a square with a corner removed, whose first eigenvalue is a standard benchmark because the re-entrant corner is singular. The cell below uses cells per unit length, with the nodes on the two inner edges of the removed quadrant taken out of the mask (they are the clamped rim, so the rim lies exactly on grid lines), and rescales by to get the continuum value.
The lab’s solver and the numpy and scipy program agree at the three resolutions I ran: ( nodes) gives , ( nodes) gives , and ( nodes) gives (residual about in the lab, the node and scipy values equal to all printed digits). A reference value I remember for the continuum is (from memory, a published high-precision value; I did not recompute it). The differences from it, , and , shrink by a factor of and then : a staircase on a singular corner converges slowly, and the order I can read from three points is between about and , not better. For a circle and a square of the same area the continuum values of are and (arithmetic from and , not a lab output), and the disk is the lowest of all shapes at fixed area, the Faber-Krahn theorem (from memory).
The lab
The sim below holds all of this in one place. The left panel is the drum. Choose a shape (circle, square, rectangle, L, ellipse, triangle) or switch the pointer to paint and erase and draw your own, and the lab recomputes the lowest modes (about half a second at the default grid, a timing). The mode slider selects which mode to show as a diverging heat map (the shape oscillates in time at the mode’s relative frequency, if animation is on), and the right panel is the strike spectrum: one bar per eigenspace, whose height is , so a bar is missing where the strike point lies on a nodal line. Click a bar to select its mode. For the circle, diamonds mark the Bessel ratios so you can see how well the staircase did, and the readout prints the solver’s iterations, time and residual. Switch the view to the leapfrog wave to watch the strike ring; a point strike excites every grid mode up to the checkerboard, so that view looks grainy, and the fine grain is the high modes that the sound (which keeps ) leaves out. Three things to try: strike the circle at its centre and see that only the rotationally symmetric modes sing; strike it near the rim and hear the pairs join in; paint a notch into the rim and watch the degenerate pairs split.
The sim can also be opened on a particular mode. Here it is opened on mode 2 of the square, one member of a degenerate pair: the solver returns an arbitrary basis of the pair’s plane, so the nodal line you see may be a straight cut or a diagonal. Mode 4 is the single cross.
Honest limits
- A membrane under tension is not a drum. A real drumhead is coupled to a shell of air, and the added air mass lowers the low modes more than the high ones and shifts the ratios away from the Bessel values. The lab has no air in it. That is the largest known physical difference, and I cannot give a number for it here (from memory: this air loading is what makes the real fundamental of a timpani sit well below the dry membrane’s).
- No stiffness. A real membrane has some bending stiffness, which adds a term, raises high modes above the pure membrane ratios, and is the main difference between a membrane and a thin plate. The lab omits it.
- No nonlinearity. The wave equation here is linear, so there is no pitch glide after a hard strike, which real drums have, and amplitudes add exactly. The pitch glide of a hard-struck drum is a tension effect (from memory).
- The damping is a choice. The law is a convenient family and not a measurement of anything.
- The staircase limits the accuracy. Ratios converge at an order between and on the circle, absolute pitch only at about first order, and a re-entrant corner converges even more slowly. A finite-element discretisation with a smooth boundary fixes the first two, and is the subject of 10.13 Introduction to Finite Elements.
- The sound is unheard. The synthesis is verified sample by sample against the formula (above), but WebAudio cannot be run in a headless browser, so the playback path, the gain and the click-free envelope have not been checked by ear. If it clips or clicks, that is a bug I could not see.
- Isospectral drums are from memory. I did not verify the Gordon-Webb-Wolpert pair, and the lab does not show one.
Concept checks
Problems
Take the square drum with ( nodes). (a) Find and from . (b) Find the discrete frequency ratio of mode to mode and compare it with the continuum value .
Show worked solution
(a) With , and : and .
(b) The discrete ratio is , and the continuum ratio is , so the discrete drum is low in this ratio. With only three nodes per side the grid is coarse, and the error fell to for the worst of the first twelve modes at and to at in the table above. (Dense eigh of the matrix gives the same and .)
A strip of three nodes in a row (a mask) has with eigenvalues , and . Find the leapfrog limit , and check the bipartite relation .
Show worked solution
Leapfrog is stable for , so . For the bipartite check, , as required. The strip’s limit is above , which is the general lower bound and is only approached by large drums.
For the square drum struck and picked up at the centre node, find which eigenspaces are excited and the amplitudes per eigenspace, with . Use the eigenvalues , (twice), (three modes), (twice) and .
Show worked solution
The mode has the centre value (the normalisation is per direction), so if and are both odd and otherwise. The even-index modes , , , and are silent: their nodal lines pass through the centre. The excited ones are with , the pair and which share , and with . The frequency ratios are , , and . The cluster sums are , and , so the amplitudes are , and . The strongest line is not the fundamental but the pair at times it, because two modes contribute to it. (A numpy check of the matrix gives the same values.)
What comes next
We built a drum from a mask, a matrix and a sparse eigensolver, and the Bessel comparison gave us an honest account of what the staircase costs: a pitch that is off by a fraction of a cell of radius, and ratios that are good to a fraction of a percent at a radius of sixty-four cells. The structure is again that of every grid simulator, a stencil, an analysis step and careful bookkeeping, but the analysis step is new: instead of marching in time we diagonalised, and the physics became a list of frequencies.
The next capstone, L-16.5, the Orbital Transfer Planner, is deliberately a very different problem. A drum is linear and dissipative, so errors in the integrator are damped and a modal sum is exact. An orbit is nonlinear and conservative: nothing damps, errors accumulate for as long as you integrate, and a method that is accurate and stable in this lesson’s sense can still make an orbit spiral out. The question becomes whether a scheme preserves the conserved energy and angular momentum, which is the idea behind symplectic integrators, and the planner has to keep an orbit honest over many revolutions (12.7 Orbital Mechanics and 14.7 N-Body Simulation lay the physics). The leapfrog you ran in step 1 is, in fact, a symplectic scheme for a linear problem; whether that carries over to gravity is the thing to look for.
Key Takeaways
- A drum on a grid is a mask plus the five-point operator (4 on the diagonal, per inside neighbour): symmetric positive definite, with eigenpairs that decouple the wave equation into oscillators of frequency .
- Leapfrog is stable for ; the grid is bipartite, so and is a safe step for every shape. Measured by bisection the limit matches the formula to about ( against for a disk of radius cells).
- The lowest modes come from a block shift-invert subspace iteration with Rayleigh-Ritz on a banded Cholesky factor, equivalent to scipy
eigsh(A, k, sigma=0); a block of vectors is required because symmetric shapes have repeated eigenvalues. - The staircase circle sounds lower than the true circle (the effective radius is to cells too large), with converging at about first order and the frequency ratios at an observed order of about to : the worst ratio error is at and at . A square, with no staircase, converges at second order ( at to at ).
- Modal synthesis sums ; a strike on the nodal line of a mode does not excite it, so striking a square at its centre silences every mode with an even index.
- A degenerate eigenspace is returned in an arbitrary basis, so only the cluster sum has a meaning; the grid splits the circle’s pair by at and at .
- The membrane model leaves out air loading, stiffness and nonlinearity, and the damping law is a choice. Kac’s question has the answer no in general (the Gordon-Webb-Wolpert pair is from memory and was not verified here), and the audio path is unverified by ear.