Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 2 of 2

Full-Text Articles in Entire DC Network

Nearly Balanced And Resolvable Block Designs, Brian Henry Reck Jul 2002

Nearly Balanced And Resolvable Block Designs, Brian Henry Reck

Mathematics & Statistics Theses & Dissertations

One of the fundamental principles of experimental design is the separation of heterogeneous experimental units into subsets of more homogeneous units or blocks in order to isolate identifiable, unwanted, but unavoidable, variation in measurements made from the units. Given v treatments to compare, and having available b blocks of k experimental units each, the thoughtful statistician asks, “What is the optimal allocation of the treatments to the units?” This is the basic block design problem. Let nij be the number of times treatment i is used in block j and let N be the v x b matrix N …


Geometric Integrators For Hamiltonian Pdes, Dmitry Karpeev Jan 2002

Geometric Integrators For Hamiltonian Pdes, Dmitry Karpeev

Computer Science Theses & Dissertations

We consider methods for systematic construction of algorithms for a class of time-dependent PDEs with Hamiltonian structure. These systems possess phase space geometry and constants of the motion that need to be preserved by the integration algorithm to reflect the qualitative features of the system.

We exploit the structure of Hamiltonian systems, in particular their variational formulation based on a Lagrangian, and the dual covariant formulation, to expose the geometric features of the system that have natural analogs when discretized. We emphasize the local space-time approach to the constructions, making them amenable to parallelization and preconditioning using domain decomposition methods, …