Efficient Deformations Using Custom Coordinate Systems

Physics-based deformable object simulations have been playing an increasingly important role in 3D computer graphics. They have been adopted for humanoid character animations as well as special effects such as fire and explosion. However, simulations of large, complex systems can consume large amounts of computation and mostly remain offline, which prohibits their use for interactive applications.We present several highly efficient schemes for deformable object simulation using custom spatial coordinate systems. Our choices span the spectrum of subspace to full space and both Lagrangian and Eulerian viewpoints.Subspace methods achieve massive speedups over their “full space” counterparts by drastically reducing the degrees of freedom involved in the simulation. A long standing difficulty in subspace simulation is incorporating various non-linearities. They introduce expensive computational bottlenecks and quite often cause novel deformations that are outside the span of the subspace.We address these issues in articulated deformable body simulations from a Lagrangian viewpoint. We remove the computational bottleneck of articulated self-contact handling by deploying a pose-space cubature scheme, a generalization of the standard “cubature” approximation. To handle novel deformations caused by arbitrary external collisions, we introduce a generic approach called subspace condensation, which activates full space simulation on the fly when an out-of-basis event is encountered. Our proposed frameworkefficiently incorporates various non-linearities and allows subspace methods to be used in cases where they previously would not have been considered.Deformable solids can interact not only with each other, but also with fluids. Wedesign a new full space method that achieves a two-way coupling between deformable solids and an incompressible fluid where the underlying geometric representation is entirely Eulerian. No-slip boundary conditions are automatically satisfied by imposing a global divergence-free condition. We are able to simulate multiple solids undergoing complex, frictional contact while simultaneously interacting with a fluid. The complexity of the scenarios we are able to simulate surpasses those that we have seen from any previous method

On the 3D electromagnetic quantitative inverse scattering problem: algorithms and regularization

In this thesis, 3D quantitative microwave imaging algorithms are developed with emphasis on efficiency of the algorithms and quality of the reconstruction. First, a fast simulation tool has been implemented which makes use of a volume integral equation (VIE) to solve the forward scattering problem. The solution of the resulting linear system is done iteratively. To do this efficiently, two strategies are combined. First, the matrix-vector multiplications needed in every step of the iterative solution are accelerated using a combination of the Fast Fourier Transform (FFT) method and the Multilevel Fast Multipole Algorithm (MLFMA). It is shown that this hybridMLFMA-FFT method is most suited for large, sparse scattering problems. Secondly, the number of iterations is reduced by using an extrapolation technique to determine suitable initial guesses, which are already close to the solution. This technique combines a marching-on-in-source-position scheme with a linear extrapolation over the permittivity under the form of a Born approximation. It is shown that this forward simulator indeed exhibits a better efficiency. The fast forward simulator is incorporated in an optimization technique which minimizes the discrepancy between measured data and simulated data by adjusting the permittivity profile. A Gauss-Newton optimization method with line search is employed in this dissertation to minimize a least squares data fit cost function with additional regularization. Two different regularization methods were developed in this research. The first regularization method penalizes strong fluctuations in the permittivity by imposing a smoothing constraint, which is a widely used approach in inverse scattering. However, in this thesis, this constraint is incorporated in a multiplicative way instead of in the usual additive way, i.e. its weight in the cost function is reduced with an improving data fit. The second regularization method is Value Picking regularization, which is a new method proposed in this dissertation. This regularization is designed to reconstruct piecewise homogeneous permittivity profiles. Such profiles are hard to reconstruct since sharp interfaces between different permittivity regions have to be preserved, while other strong fluctuations need to be suppressed. Instead of operating on the spatial distribution of the permittivity, as certain existing methods for edge preservation do, it imposes the restriction that only a few different permittivity values should appear in the reconstruction. The permittivity values just mentioned do not have to be known in advance, however, and their number is also updated in a stepwise relaxed VP (SRVP) regularization scheme. Both regularization techniques have been incorporated in the Gauss-Newton optimization framework and yield significantly improved reconstruction quality. The efficiency of the minimization algorithm can also be improved. In every step of the iterative optimization, a linear Gauss-Newton update system has to be solved. This typically is a large system and therefore is solved iteratively. However, these systems are ill-conditioned as a result of the ill-posedness of the inverse scattering problem. Fortunately, the aforementioned regularization techniques allow for the use of a subspace preconditioned LSQR method to solve these systems efficiently, as is shown in this thesis. Finally, the incorporation of constraints on the permittivity through a modified line search path, helps to keep the forward problem well-posed and thus the number of forward iterations low. Another contribution of this thesis is the proposal of a new Consistency Inversion (CI) algorithm. It is based on the same principles as another well known reconstruction algorithm, the Contrast Source Inversion (CSI) method, which considers the contrast currents – equivalent currents that generate a field identical to the scattered field – as fundamental unknowns together with the permittivity. In the CI method, however, the permittivity variables are eliminated from the optimization and are only reconstructed in a final step. This avoids alternating updates of permittivity and contrast currents, which may result in a faster convergence. The CI method has also been supplemented with VP regularization, yielding the VPCI method. The quantitative electromagnetic imaging methods developed in this work have been validated on both synthetic and measured data, for both homogeneous and inhomogeneous objects and yield a high reconstruction quality in all these cases. The successful, completely blind reconstruction of an unknown target from measured data, provided by the Institut Fresnel in Marseille, France, demonstrates at once the validity of the forward scattering code, the performance of the reconstruction algorithm and the quality of the measurements. The reconstruction of a numerical MRI based breast phantom is encouraging for the further development of biomedical microwave imaging and of microwave breast cancer screening in particular

Proceedings of the International Workshop on Medical Ultrasound Tomography: 1.- 3. Nov. 2017, Speyer, Germany

Ultrasound Tomography is an emerging technology for medical imaging that is quickly approaching its clinical utility. Research groups around the globe are engaged in research spanning from theory to practical applications. The International Workshop on Medical Ultrasound Tomography (1.-3. November 2017, Speyer, Germany) brought together scientists to exchange their knowledge and discuss new ideas and results in order to boost the research in Ultrasound Tomography

Software for Exascale Computing - SPPEXA 2016-2019

This open access book summarizes the research done and results obtained in the second funding phase of the Priority Program 1648 "Software for Exascale Computing" (SPPEXA) of the German Research Foundation (DFG) presented at the SPPEXA Symposium in Dresden during October 21-23, 2019. In that respect, it both represents a continuation of Vol. 113 in Springer’s series Lecture Notes in Computational Science and Engineering, the corresponding report of SPPEXA’s first funding phase, and provides an overview of SPPEXA’s contributions towards exascale computing in today's sumpercomputer technology. The individual chapters address one or more of the research directions (1) computational algorithms, (2) system software, (3) application software, (4) data management and exploration, (5) programming, and (6) software tools. The book has an interdisciplinary appeal: scholars from computational sub-fields in computer science, mathematics, physics, or engineering will find it of particular interest

NASA thesaurus. Volume 3: Definitions

Publication of NASA Thesaurus definitions began with Supplement 1 to the 1985 NASA Thesaurus. The definitions given here represent the complete file of over 3,200 definitions, complimented by nearly 1,000 use references. Definitions of more common or general scientific terms are given a NASA slant if one exists. Certain terms are not defined as a matter of policy: common names, chemical elements, specific models of computers, and nontechnical terms. The NASA Thesaurus predates by a number of years the systematic effort to define terms, therefore not all Thesaurus terms have been defined. Nevertheless, definitions of older terms are continually being added. The following data are provided for each entry: term in uppercase/lowercase form, definition, source, and year the term (not the definition) was added to the NASA Thesaurus. The NASA History Office is the authority for capitalization in satellite and spacecraft names. Definitions with no source given were constructed by lexicographers at the NASA Scientific and Technical Information (STI) Facility who rely on the following sources for their information: experts in the field, literature searches from the NASA STI database, and specialized references

Structure-Preserving Model Reduction of Physical Network Systems

This paper considers physical network systems where the energy storage is naturally associated to the nodes of the graph, while the edges of the graph correspond to static couplings. The first sections deal with the linear case, covering examples such as mass-damper and hydraulic systems, which have a structure that is similar to symmetric consensus dynamics. The last section is concerned with a specific class of nonlinear physical network systems; namely detailed-balanced chemical reaction networks governed by mass action kinetics. In both cases, linear and nonlinear, the structure of the dynamics is similar, and is based on a weighted Laplacian matrix, together with an energy function capturing the energy storage at the nodes. We discuss two methods for structure-preserving model reduction. The first one is clustering; aggregating the nodes of the underlying graph to obtain a reduced graph. The second approach is based on neglecting the energy storage at some of the nodes, and subsequently eliminating those nodes (called Kron reduction).</p

A DFT investigation of Al-based atomically precise epitaxy

This thesis is about the growth and placement of dopants in silicon semiconductor devices and specifically acceptor dopants as device dimensions enter the nanoscale. Single-atom donor dopant devices have already been demonstrated in the laboratory. Using density functional theory (DFT) and the aluminium atom we now show how acceptor sites might be fabricated and characterize their electronic behaviour. The thesis opens with a review of the physical basis of statistical doping and the operation of the silicon CMOS transistor which is the most widespread microfabricated device by a wide margin. We show how downscaling requires ever-increasing accuracy in dopant placement and illustrate using some current process techniques. Next, we describe some prototype single-dopant devices and the chapter concludes with a description of a phosphorus nuclear spin qubit and its application. Chapter 2 outlines the theoretical basis of the DFT nanostructure models found in later chapters and chapter 3 presents some elementary calculations intended to validate the local DFT environment. Chapters 4, 5 and 6 are based on published papers produced during this work and listed on page 11. In chapter 4 we introduce patterned atomic layer epitaxy (PALE), an experimental fabrication technique for Si nanostructures. Chapters 5 and 6 describe how PALE could be applied to locate Al dopant atoms in an Si substrate. The final chapter offers some calculations indicating the electronic behaviour of this dopant when embedded in Si nanostructures of various kinds