Computer Engineering Commons^™

Model Based Force Estimation And Stiffness Control For Continuum Robots, Vincent A. Aloi

Doctoral Dissertations

Continuum Robots are bio-inspired structures that mimic the motion of snakes, elephant trunks, octopus tentacles, etc. With good design, these robots can be naturally compliant and miniaturizable, which makes Continuum Robots ideal for traversing narrow complex environments. Their flexible design, however, prevents us from using traditional methods for controlling and estimating loading on rigid link robots.

In the first thrust of this research, we provided a novel stiffness control law that alters the behavior of an end effector during contact. This controller is applicable to any continuum robot where a method for sensing or estimating tip forces and pose exists. …

A Parallel Direct Method For Finite Element Electromagnetic Computations Based On Domain Decomposition, Javad Moshfegh

Doctoral Dissertations

High performance parallel computing and direct (factorization-based) solution methods have been the two main trends in electromagnetic computations in recent years. When time-harmonic (frequency-domain) Maxwell's equation are directly discretized with the Finite Element Method (FEM) or other Partial Differential Equation (PDE) methods, the resulting linear system of equations is sparse and indefinite, thus harder to efficiently factorize serially or in parallel than alternative methods e.g. integral equation solutions, that result in dense linear systems. State-of-the-art sparse matrix direct solvers such as MUMPS and PARDISO don't scale favorably, have low parallel efficiency and high memory footprint. This work introduces a new …

Hard And Soft Error Resilience For One-Sided Dense Linear Algebra Algorithms, Peng Du

Doctoral Dissertations

Dense matrix factorizations, such as LU, Cholesky and QR, are widely used by scientific applications that require solving systems of linear equations, eigenvalues and linear least squares problems. Such computations are normally carried out on supercomputers, whose ever-growing scale induces a fast decline of the Mean Time To Failure (MTTF). This dissertation develops fault tolerance algorithms for one-sided dense matrix factorizations, which handles Both hard and soft errors.

For hard errors, we propose methods based on diskless checkpointing and Algorithm Based Fault Tolerance (ABFT) to provide full matrix protection, including the left and right factor that are normally seen in …