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 20 of 72 for “"Gaussian elimination"”.

  1. Rational Arithmetic as a Means of Matrix Inversion

    … of rational arithmetic. This program, using the Gaussian elimination matrix inversion method, is compared to the same method written in Fortran. Gaussian elimination was used by this study because of its simplicity and speed of inversion. The Adjoint method was ruled out because of its complexity …

    utahstate Repository record for Rational Arithmetic as a Means of Matrix Inversion (opens in a new tab)

  2. Modified approaches to linear least squares

    … can be considered as a generalization of the Gaussian elimination method for square, linear systems. It is a combination of the Gaussian elimination and the modified Gram-Schmidt orthogonalization procedures. A computer program implementing this method is developed. Some numerical examples are …

    ut-knoxville Repository record for Modified approaches to linear least squares (opens in a new tab)

  3. A stable method for the LU-decomposition of M-matrices

    … the LU-decomposition of M-matrices based upon Gaussian Elimination applied with a new pivoting strategy. At each step of the elimination, the pivoting strategy selects a column that is the most (column) diagonally dominant in the unreduced subma­trix and exchanges it into the pivotal column …

    uvic Repository record for A stable method for the LU-decomposition of M-matrices (opens in a new tab)

  4. Fast Algorithms on Random Matrices and Structured Matrices

    … matrix having numerical rank r. 2) We prove that Gaussian elimination with no pivoting (GENP) is numerically safe for the average nonsingular and well-conditioned matrix preprocessed with a nonsingular and well-conditioned f-Circulant or another structured multiplier. This can be an attractive …

    cuny-grad Repository record for Fast Algorithms on Random Matrices and Structured Matrices (opens in a new tab)

  5. Numerical solution of skew-symmetric linear systems

    … This leads to a new Crout variant of Gaussian elimination for skew-symmetric matrices. Details on how to implement the algorithms efficiently are provided. A few numerical results are presented for these preconditioners. We also examine a specialized preconditioned minimum residual …

    ubc Repository record for Numerical solution of skew-symmetric linear systems (opens in a new tab) Download PDF for Numerical solution of skew-symmetric linear systems (opens in a new tab)

  6. Preconditioning For Matrix Computation

    … way we support application of GENP, that is, Gaussian elimination with no pivoting, and block Gaussian elimination. We prove that the proposed preconditioning methods are efficient when we apply Gaussian random matrices as preconditioners. We confirm these results with our extensive numerical …

    cuny-grad Repository record for Preconditioning For Matrix Computation (opens in a new tab)

  7. Algorithms and data structures for cache-efficient computation: theory and experimental evaluation

    … domains: graph algorithms, problems in the Gaussian Elimination Paradigm (GEP), and problems with dynamic programming algorithms. Among graph problems we concentrate on shortest path computation, and for the computation-intensive problems in the latter two domains we also present efficient …

    texas Repository record for Algorithms and data structures for cache-efficient computation: theory and experimental evaluation (opens in a new tab)

  8. GPU Implementation of a Novel Approach to Cramer’s Algorithm for Solving Large Scale Linear Systems

    … ages for solving large-scale linear systems use Gaussian elimination methods such as LU- decomposition. An alternative method, recently introduced by K. Habgood and I. Arel, involves an application of Cramer’s Rule and Chio’s condensation to achieve a better per- forming system for solving linear …

    ut-knoxville Repository record for GPU Implementation of a Novel Approach to Cramer’s Algorithm for Solving Large Scale Linear Systems (opens in a new tab)

  9. A hybrid direct-iterative linear solver for chemical process simulation

    … of direct sparse linear methods (e.g., Gaussian elimination) with the efficiency of iterative sparse linear methods (e.g., Krylov subspace methods). The new hybrid solver is implemented in the SEQUEL-II, ASPEN PLUS$\sp{\rm TM}$, and SPEEDUP$\sp{\rm TM}$ programs and evaluated in terms of …

    uiuc Repository record for A hybrid direct-iterative linear solver for chemical process simulation (opens in a new tab)

  10. A technique to calculate complex electromagnetic fields by using the finite element method

    … nodes. All these equations are solved by the Gaussian Elimination Method. For increased accuracy this method requires a high degree of division of the region of interest. This could cause a storage problem on the computer. To alleviate this problem a half-banded scheme is used.

    portland-state Repository record for A technique to calculate complex electromagnetic fields by using the finite element method (opens in a new tab)

  11. Low-Complexity Soliton-like Network Coding for a Resource-Limited Relay

    … a network-coded message, a sink must use a Gaussian elimination decoder, but this high-complexity decoder may not be acceptable in resource-constrained applications like sensor networks. A good alternative to Gaussian elimination is for the sink to apply the well-known belief propagation …

    queens Repository record for Low-Complexity Soliton-like Network Coding for a Resource-Limited Relay (opens in a new tab)

  12. A coalbed methane simulator designed for the independent producers.

    … was used to solve the nonlinear equations and Gaussian elimination was used to solve the Jacobian matrix.

    wvu Repository record for A coalbed methane simulator designed for the independent producers. (opens in a new tab)

  13. Global Optimization in Least Squares Problems in FTIR Spectroscopy and X -Ray Crystallography

    … of linear equations for which we develop a fast Gaussian elimination algorithm. For noncentrosymmetric structures, we reduce the phase problem to a mixed-integer quadratic problem and utilize a branch-and-bound algorithm for its solution."

    uiuc Repository record for Global Optimization in Least Squares Problems in FTIR Spectroscopy and X -Ray Crystallography (opens in a new tab)

  14. Algorithms for reachability problems on stochastic Markov reward models

    … known direct linear algebra algorithms such as Gaussian elimination, and iterative methods such as the power method, Jacobi and Gauss-Seidel. We provide solutions for both discrete-reward sMRMs, where all rewards discrete (lattice) random variables. And also for continuous-reward sMRMs, where …

    birmingham Download PDF for Algorithms for reachability problems on stochastic Markov reward models (opens in a new tab)

  15. Computational Methods for OI-Modules

    … be thought of as a nonlinear generalization of Gaussian elimination. In 2019, Nagel and Römer introduced FI- and OI-modules over FI- and OI-algebras, which provide a framework for studying sequences of related modules defined over sequences of related polynomial rings. In particular, they laid …

    uky-thes Repository record for Computational Methods for OI-Modules (opens in a new tab)

  16. Estruturas tridimensionais com propriedades mecânicas dos materiais representadas matematicamente por séries - aplicação à análise de pontes

    … system of linear equations is obtained by the Gaussian elimination method, employing a block solver. A computer program is presented and applied to some examples.

    brazil-uerj Repository record for Estruturas tridimensionais com propriedades mecânicas dos materiais representadas matematicamente por séries - aplicação à análise de pontes (opens in a new tab)

  17. Improving encoding efficiency in test compression using sequential linear decompressors with retained free variables

    … test cube. The non-pivot free variables used in Gaussian Elimination are wasted when the decompressor is reset before encoding the next test cube which is conventionally done to keep computational complexity manageable. In this thesis, a technique for retaining the non-pivot free variables when …

    texas Repository record for Improving encoding efficiency in test compression using sequential linear decompressors with retained free variables (opens in a new tab)

  18. The development of a three-axis trim program for aerodynamic data

    … with three unknowns (the deflections at trim). Gaussian Elimination is used to solve the equations with the control derivatives being the matrix of coefficients and the residual moments completing the augmented matrix. The solution is iterative with the control derivatives and residual moments …

    ut-knoxville Repository record for The development of a three-axis trim program for aerodynamic data (opens in a new tab)

  19. A Modified Crank-Nicolson Method

    … use a special tridiagonal system solver. If Gaussian elimination is used, the modified Crank-Nicolson approach reduces the amount of work by 87%. Regardless of the linear system solver used, the modified Crank-Nicolson approach reduces by 50% the memory requirement of the standard …

    vcu Repository record for A Modified Crank-Nicolson Method (opens in a new tab)

  20. Skyline technique for least square temporal finite element method

    … elements below the skyline only and manipulates Gaussian elimination process efficiently.</p><p>In recent years, the finite element methods applied to discretize the space domain has been successfully extended to time domain discretization. This new technique, temporal finite elements, makes it …

    njit Repository record for Skyline technique for least square temporal finite element method (opens in a new tab)

Page 1 of 4