   Next: Higher-order correction and normalization Up: Solving for the scaling Previous: Generalized eigenproblem

### The scaling method in action

In Figs. 6.5 and 6.6 I show that the (and tensions ) found coincide with tension minima found by the sweep method of the previous chapter. The agreement is well within the sweep method error due to the finite rounding of the minima. Because the scaling method does not just compute the tension of a single state, it is able to distinguish close eigenvalues that cannot be distinguished using the sweep method (using the same basis set). How far this can be pushed has not yet been investigated. The finite tension minima are highly correlated between the methods, and are therefore a function of the limitation of the RPW basis set chosen.

The remarkable improvement in efficiency over the sweep methods of the previous chapter (or any other known method!) comes from the fact that billiard eigenstates are computed using a single diagonalization. The effort per state therefore scales like compared to for sweep methods. In this gives an improvement in efficiency of at if only moderate accuracy is required. More specifically, the basis set size is , and about usable states are returned per diagonalization (moderate accuracy, ), or about (very high accuracy, ). This assumes that the basis set is adequate for the particular billiard shape. Errors will be further analysed in Section 6.3.

Now I give a practical example. A very high energy state of the stadium billiard (odd-odd symmetry class) is shown in Fig. 6.7, with , and tension . The error in is about in the last digit. At this , corresponding to about the 142000'th odd-odd eigenstate, the basis size is . It takes about 10 seconds to fill and , another 50 seconds for diagonalization, returning about 16-100 usable states (depending on required tension accuracy), and about 2 seconds per state to evaluate the wavefunction and its normal gradient on the perimeter (2000 sample points around the quarter-perimeter of the stadium). It takes a further 300 seconds to generate spatial plots of the type of Fig. 6.7 with resolution 1000*500 samples. Because the plotting algorithm generates plots of the scaling eigenfunctions simultaneously, it does not take much longer to evaluate more than one such plot (in each case sin or cos evaluations are required). This was performed on a Compaq XP1000 workstation, with alpha processor 21264, 667MHz, using C++ and LAPACK . It is clear that obtaining spatial plots is the limiting factor above (due to the number of basis function evaluations required), rather than solving for the eigenstate and coefficients themselves!   Next: Higher-order correction and normalization Up: Solving for the scaling Previous: Generalized eigenproblem
Alex Barnett 2001-10-03