514 research outputs found
Multiresolution and Explicit Methods for Vector Field Analysis and Visualization
We first report on our current progress in the area of explicit methods for tangent curve computation. The basic idea of this method is to decompose the domain into a collection of triangles (or tetrahedra) and assume linear variation of the vector field over each cell. With this assumption, the equations which define a tangent curve become a system of linear, constant coefficient ODE's which can be solved explicitly. There are five different representation of the solution depending on the eigenvalues of the Jacobian. The analysis of these five cases is somewhat similar to the phase plane analysis often associate with critical point classification within the context of topological methods, but it is not exactly the same. There are some critical differences. Moving from one cell to the next as a tangent curve is tracked, requires the computation of the exit point which is an intersection of the solution of the constant coefficient ODE and the edge of a triangle. There are two possible approaches to this root computation problem. We can express the tangent curve into parametric form and substitute into an implicit form for the edge or we can express the edge in parametric form and substitute in an implicit form of the tangent curve. Normally the solution of a system of ODE's is given in parametric form and so the first approach is the most accessible and straightforward. The second approach requires the 'implicitization' of these parametric curves. The implicitization of parametric curves can often be rather difficult, but in this case we have been successful and have been able to develop algorithms and subsequent computer programs for both approaches. We will give these details along with some comparisons in a forthcoming research paper on this topic
Recommended from our members
Hierarchical Large-scale Volume Representation with 3rd-root-of-2 Subdivision and Trivariate B-spline Wavelets
Multiresolution methods provide a means for representing data at multiple levels of detail. They are typically based on a hierarchical data organization scheme and update rules needed for data value computation. We use a data organization that is based on what we call subdivision. The main advantage of subdivision, compared to quadtree (n=2) or octree (n=3) organizations, is that the number of vertices is only doubled in each subdivision step instead of multiplied by a factor of four or eight, respectively. To update data values we use n-variate B-spline wavelets, which yield better approximations for each level of detail. We develop a lifting scheme for n=2 and n=3 based on the -subdivision scheme. We obtain narrow masks that provide a basis for out-of-core techniques as well as view-dependent visualization and adaptive, localized refinement
Efficient Low Dissipative High Order Schemes for Multiscale MHD Flows, II: Minimization of ∇·B Numerical Error
An adaptive numerical dissipation control in a class of high order filter methods for compressible MHD equations is systematically discussed. The filter schemes consist of a divergence-free preserving high order spatial base scheme with a filter approach which can be divergence-free preserving depending on the type of filter operator being used, the method of applying the filter step, and the type of flow problem to be considered. Some of these filter variants provide a natural and efficient way for the minimization of the divergence of the magnetic field (∇·B) numerical error in the sense that commonly used divergence cleaning is not required. Numerical experiments presented emphasize the performance of the ∇·B numerical error. Many levels of grid refinement and detailed comparison of the filter methods with several commonly used compressible MHD shock-capturing schemes will be illustrated
Error-driven adaptive resolutions for large scientific data sets
The process of making observations and drawing conclusions from large data sets is an essential part of modern scientific research. However, the size of these data sets can easily exceed the available resources of a typical workstation, making visualization and analysis a formidable challenge. Many solutions, including multiresolution and adaptive resolution representations, have been proposed and implemented to address these problems.
This thesis describes an error model for calculating and representing localized error from data reduction and a process for constructing error-driven adaptive resolutions from this data, allowing fully-renderable error driven adaptive resolutions to be constructed from a single, high-resolution data set. We evaluated the performance of these adaptive resolutions generated with various parameters compared to the original data set. We found that adaptive resolutions generated with reasonable subdomain sizes and error tolerances show improved performance daring visualization
Curvelets and Ridgelets
International audienceDespite the fact that wavelets have had a wide impact in image processing, they fail to efficiently represent objects with highly anisotropic elements such as lines or curvilinear structures (e.g. edges). The reason is that wavelets are non-geometrical and do not exploit the regularity of the edge curve. The Ridgelet and the Curvelet [3, 4] transforms were developed as an answer to the weakness of the separable wavelet transform in sparsely representing what appears to be simple building atoms in an image, that is lines, curves and edges. Curvelets and ridgelets take the form of basis elements which exhibit high directional sensitivity and are highly anisotropic [5, 6, 7, 8]. These very recent geometric image representations are built upon ideas of multiscale analysis and geometry. They have had an important success in a wide range of image processing applications including denoising [8, 9, 10], deconvolution [11, 12], contrast enhancement [13], texture analysis [14, 15], detection [16], watermarking [17], component separation [18], inpainting [19, 20] or blind source separation[21, 22]. Curvelets have also proven useful in diverse fields beyond the traditional image processing application. Let’s cite for example seismic imaging [10, 23, 24], astronomical imaging [25, 26, 27], scientific computing and analysis of partial differential equations [28, 29]. Another reason for the success of ridgelets and curvelets is the availability of fast transform algorithms which are available in non-commercial software packages following the philosophy of reproducible research, see [30, 31]
Space-time adaptive resolution for reactive flows
Multi-scale systems evolve over a wide range of temporal and spatial scales. The extent of time scales makes both theoretical and numerical analysis difficult, mostly because the time scales of interest are typically much slower than the fastest scales occurring in the system. Systems with such characteristics are usually classified as being stiff. An adaptive mesh refinement method based on the wavelet transform and the G-Scheme framework are used to achieve spatial and temporal adaptive model reduction, respectively, of physical problems described by PDEs. The combination of the methods is proposed to solve PDEs describing reaction-diffusion systems with the minimal number of degrees of freedom, for prescribed accuracies in space and time. Different reaction-diffusion systems are studied with the aim to test the performance and the capability of the combined scheme to generate accurate solutions with respect to reference ones. Several strategies are implemented to improve the performance of the scheme, with minimal loss of accuracy
- …