Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 18 of 18 for “"Jacobi method"”.
-
Redundant Asynchronous Jacobi Method for Unreliable Computing Environments
… Our goal is to adapt the asynchronous parallel Jacobi method to fully utilize these environments by incorporating the idea of redundant computations. The redundant asynchronous parallel Jacobi algorithm partitions a linear system among computing elements, e.g., processors, while allowing overlap …
-
Computation of nodes and weights of Gaussian Quadrature rule by using Jacobi method
… and eigenvectors. Thus the need for faster methods to solve these larger eigenvalue problems has become very important. A standard textbook method for finding the eigenvalues of a matrix A is to solve for the roots of \lambda It is quite easy to solve analytically when matrix is small but it …
-
Parallel GPU-Based Fluid Animation
… hardware and as more efficient simulation methods are developed a question arises. Is it possible to have both an accurate and fast fluid animation? In this thesis this will be investigated by looking at how the Jacobi method, which is used in real-time fluid simulation due to its ability …
-
A Hybrid Method for Lattice Basis Reduction and Applications
… In this thesis, we present an O(n^4 logB) hybrid Jacobi method for lattice basis reduction, where n is the dimension of the lattice and B is the maximum length of the input lattice basis vectors. Building upon a generic Jacobi method for lattice basis reduction, we integrate the size reduction …
-
Obtaining High Precision Results from Low Precision Hardware
… are given. Finally an implementation of the Jacobi Method on the EnLight256 is given as an example of the library being used in a real world scenario.</p>
-
Parallel Processing Techniques for the Simulation of MOS VLSI Circuits Using Waveform Relaxation
… considered, based on the Gauss-Seidel and Gauss-Jacobi relaxation methods, in which parallelism is exploited at the individual time point level or at the time window level. The algorithm with the fastest run time depends on the characteristics of the circuit being simulated and on the number of …
-
Poisson solver with Nvidia Gpu for multigrid enhancement
… The solution is computed by numerical methods which solve for Poisson's equation over a domain space. Iterative methods, such as the Jacobi method, are computationally expensive without assumptions about the domain which reduce the complexity. While an increase in computational power by …
-
A systolic VLSI architecture for complex SVD
… arbitrary complex matrices, based on the cyclic Jacobi method with "parallel ordering". As a basic step in the algorithm, a two-step, two-sided unitary transformation scheme is employed to diagonalize a complex 2 $\times$ 2 matrix. The transformations are tailored to the use of CORDIC (COordinate …
-
Constraints on New Physics from Neutrino and Other Particle Experiments
… on physics beyond the Standard Model. We use the Jacobi method to derive a set of simplified expressions for the probabilities of neutrino oscillations in matter. we show the possible constraints that can be placed on various models beyond the Standard Model. In several cases, we find that the …
-
Μελέτη των ιδιοτήτων των τροχιών γύρω από μελανές οπές Kerr με τη χρήση νευτώνειων αναλόγων
… Newtonian gravitational field, by Hamilton-Jacobi method, in order to separate it in appropriate coordinates and construct the three integrals of motion corresponding to this problem. Subsequently, we identified the similarity of the potentials that govern the radial and polar motion of the …
-
Simulation of electromagnetic transients in underground cables with frequency-dependent modal transformation matrics
… been developed. This procedure is based on the Jacobi method, and it produces the desired smooth functions of frequency. This manuscript presents a number of simulations where the performance of the new cable model is compared with exact analytical solutions. These simulations show an excellent …
-
Interactive Medical Image Registration With Multigrid Methods and Bounded Biharmonic Functions
… We consider interactive registration methods that incorporate user-specified local transforms around control handles. The deformation between handles is interpolated by some smooth functions, minimizing some variational energies. Besides smoothness, we expect the impact of a control …
-
DYNAMIC OPTIMIZATION PROBLEMS ON GRAPHS WITH OVERLAPPING VARIABLES: ANALYSIS, ALGORITHMS, AND APPLICATIONS
… shares variables. We show how algorithms as the Jacobi method and ADMM solve these problems fully decentralized. Afterward, we move to graph problems with dynamical topologies that arise in time-varying optimization programs, where we get chain-like graphs. In particular, we are interested in how …
-
Near-wall similarity in three-dimensional turbulent boundary layers
… and without implicit residual averaging, a point Jacobi method, a symmetric point Gauss-Seidel method, and two methods utilizing preconditioned sparse matrix solvers are investigated. For the cell-centered scheme, a Runge-Kutta scheme, an implicit tridiagonal relaxation scheme modeled after line …
-
The development of solution algorithms for compressible flows
… and without implicit residual averaging, a point Jacobi method, a symmetric point Gauss-Seidel method, and two methods utilizing preconditioned sparse matrix solvers are investigated. For the cell-centered scheme, a Runge-Kutta scheme, an implicit tridiagonal relaxation scheme modeled after line …
-
Efficient and Robust Simulation, Modeling and Characterization of IC Power Delivery Circuits
… we first present a novel envelope following method based on a numerically robust time-delayed phase condition to track the envelopes of circuit states under a varying switching frequency. By adopting three fast simulation techniques, our proposed method achieves higher speedup without …
-
Numerical solution of Markov Chains
This project deals with techniques to solve Markov Chains numerically.
-
Numerical solution of Markov Chains
This project deals with techniques to solve Markov Chains numerically.