COPYRIGHT 2008, PRINCETON UNIVERSITY PRESS

628 appendix eJavaCodes Contents by NameProgram Section DescriptionProgram Section DescriptionABM 9.5.2 Predictor-correctorsolverAdvecLax 19.1 AdvectionArea 1.4.2 First programAreaScanner 1.4 Java 1.5 scannerclassBeam 19.9.3 2-D Navier–StokesfluidBeats 4.6.1 Procedural beatsBessel 2.2.2 Bessel functionrecurrenceBisection 7.9 Bisection rootfindingBound 20.2.3 Bound integralequationBugs 12.5 Bifurcation diagramByteLimit 1.5.4 Precise machineprecisionCatString/Friction 18.4.3 Catenary wavesCellAut 13.9 Cellular automataComplex 4.4 Complex numberobjectsComplexDyn 4.4.4 Dynamic complexobjectsCWT 11.4.2 Continuouswavelet TFDaubCompress G Wavelet compressionDaubMariana G Wavelet imagecompressionDaub4 11.5.2 Generate Daub4waveletsDecay 5.6 Spontaneous decayDFT 10.4.1 Discrete FouriertransformDiff 7.5 NumericaldifferentiationEasyPtPlot 3.2 Simple use of PtPlotEntropy 12.8.1 Shannon logisticentropyEqHeat 17.17.4 Heat equationvia leapfrogEqString 18.2.3 Waves on a stringFilm, FilmDim 13.4.1 Random depositionFilter 10.6 AutocorrelationfilteringFit 8.7.1 Linearleast–squares fitHeatCNTridiag 17.19.1 Crank–Nicolsonheat equationIntegGauss 6.2.5 Gaussian quadratureInt10d 6.6.3 10-D Monte CarlointegralIsing, Ising3D 15.2 Ising modelJamaEigen 8.3.3 JAMA eigenvaluesJamaFit 8.3.3 JAMA Least-squarefitLaplaceFEM 17.14 Finite elementLaplace equationLaplaceLine 17.4.2 Finite differentialLaplace equationLifeGame 13.9 Game of LifeLimits 1.5.4 Machine precisionLyapLog 12.8 Lyapunov exponentsMD 16.3 1-D MD simulationMoon 4.6.2 Procedural moonorbitsNewton_cd 7.10 Newton–RaphsonrootsNewton_fd 7.10 Newton–RaphsonrootsNewton_Jama2 8.2.2 Newton–RaphsonsearchNoise 10.7 FilteringNumerov 9.11 Quantum boundstates−101COPYRIGHT 2008, PRINCET O N UNIVE R S I T Y P R E S SEVALUATION COPY ONLY. NOT FOR USE IN COURSES.ALLpup_06.04 — 2008/2/15 — Page 628