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 24 for “"Solution of linear systems"”.

  1. Reducing Communication in the Solution of Linear Systems

    … latency and bandwidth requirements. Because systems of linear equations are important for numerous scientific and engineering applications, I have studied several approaches for reducing communication in those problems. First, I developed optimizations to dense LU with partial pivoting, which …

    utk-theses Repository record for Reducing Communication in the Solution of Linear Systems (opens in a new tab)

  2. On Updating Preconditioners for the Iterative Solution of Linear Systems

    El tema principal de esta tesis es el desarrollo de técnicas de actualización de precondicionadores para resolver sistemas lineales de gran tamaño y dispersos Ax=b mediante el uso de métodos iterativos de Krylov. Se consideran dos tipos interesantes de problemas. En el primero se estudia la …

    upv Repository record for On Updating Preconditioners for the Iterative Solution of Linear Systems (opens in a new tab)

  3. A method to improve the analog computer solution of linear systems

    … (Ph. D.)--Michigan State University. Department of Electrical Engineering, 1967

    msu Repository record for A method to improve the analog computer solution of linear systems (opens in a new tab)

  4. Error-free computations in solution of linear systems and linear programming problems

    … applications in statistics require computation of a generalized inverse A('-) of given matrix A. Computation of A('-) using floating-point arithmetic on digital computers sometimes produces results which contain substantial amounts of error in some or all of the matrix elements. Error is …

    iastate Repository record for Error-free computations in solution of linear systems and linear programming problems (opens in a new tab)

  5. Algorithmic bombardment for the iterative solution of linear systems : a poly-iteratve approach

    <p>Many algorithms exist for iteratively solving linear systems. Yet when the matrix is nonsymmetric or indefinite, or both, it is difficult to predict which method will perform best, or indeed, converge at all. Attempts have been made to classify the matrix properties for which a particular method …

    ut-knoxville Repository record for Algorithmic bombardment for the iterative solution of linear systems : a poly-iteratve approach (opens in a new tab)

  6. Preconditioning For Matrix Computation

    Preconditioning is a classical subject of numerical solution of linear systems of equations. The goal is to turn a linear system into another one which is easier to solve. The two central subjects of numerical matrix computations are LIN-SOLVE, that is, the solution of linear systems of equations …

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

  7. Fast direct algorithms for elliptic equations via hierarchical matrix compression

    We present a fast direct algorithm for the solution of linear systems arising from elliptic equations. We extend the work of Xia et al. (2009) on combining the multifrontal method with hierarchical matrices. We offer a more geometric interpretation of that approach, extend it in two dimensions to …

    texas Repository record for Fast direct algorithms for elliptic equations via hierarchical matrix compression (opens in a new tab)

  8. ΜΕΛΕΤΗ ΥΠΟΛΟΓΙΣΤΙΚΩΝ ΜΕΘΟΔΩΝ ΓΙΑ ΤΗΝ ΑΡΙΘΜΗΤΙΚΗ ΕΠΙΛΥΣΗ ΕΛΛΕΙΠΤΙΚΩΝ ΚΑΙ ΠΑΡΑΒΟΛΙΚΩΝ ΔΙΑΦΟΡΙΚΩΝ ΕΞΙΣΩΣΕΩΝ ΜΕ ΔΥΟ ΚΑΙ ΤΡΕΙΣ ΧΩΡΟΜΕΤΑΒΛΗΤΕΣ

    … INTRODUCE NEW EXPLICIT METHODS FOR THE NUMERICAL SOLUTION OF SYMMETRIC AND UNSYMMETRIC LINEAR SYSTEMS DERIVED FROM THE DISCRETIZATION OF PARTIAL DIFFERENTIAL EQUATIONS AND FURTHERMORE WE COMMENT ON THE RELATIONSHIPS OF THESE ALGORITHMIC PROCEDURES. IN CHAPTER 1 WE INTRODUCE BASIC KNOWN …

    greece Repository record for ΜΕΛΕΤΗ ΥΠΟΛΟΓΙΣΤΙΚΩΝ ΜΕΘΟΔΩΝ ΓΙΑ ΤΗΝ ΑΡΙΘΜΗΤΙΚΗ ΕΠΙΛΥΣΗ ΕΛΛΕΙΠΤΙΚΩΝ ΚΑΙ ΠΑΡΑΒΟΛΙΚΩΝ ΔΙΑΦΟΡΙΚΩΝ ΕΞΙΣΩΣΕΩΝ ΜΕ ΔΥΟ ΚΑΙ ΤΡΕΙΣ ΧΩΡΟΜΕΤΑΒΛΗΤΕΣ (opens in a new tab)

  9. ΑΝΑΠΤΥΞΗ ΚΑΙ ΑΞΙΟΛΟΓΗΣΗ ΠΑΡΑΛΛΗΛΩΝ ΑΛΓΟΡΙΘΜΩΝ ΓΙΑ ΤΗΝ ΑΡΙΘΜΗΤΙΚΗ ΕΠΙΛΥΣΗ ΓΡΑΜΜΙΚΩΝ ΣΥΣΤΗΜΑΤΩΝ

    THE OBJECTIVE OF THE THESIS IS THE DEVELOPMENT AND COMPARISON OF PARALLEL ALGORITHMS FOR THE SOLUTION OF LINEAR SYSTEMS ON MIMD MACHINES. SPECIFICALLY THE IMPLEMENTATION OF THE CLASSIC DIRECT METHODS GAUSSIAN ELIMINATION (GE), GAUSS-JORDAN (GJ) AND HUARD (HU) AS WELL AS THE FACTORIZATION METHODS LU …

    greece Repository record for ΑΝΑΠΤΥΞΗ ΚΑΙ ΑΞΙΟΛΟΓΗΣΗ ΠΑΡΑΛΛΗΛΩΝ ΑΛΓΟΡΙΘΜΩΝ ΓΙΑ ΤΗΝ ΑΡΙΘΜΗΤΙΚΗ ΕΠΙΛΥΣΗ ΓΡΑΜΜΙΚΩΝ ΣΥΣΤΗΜΑΤΩΝ (opens in a new tab)

  10. Convection heat transfer coefficient estimation in ducts using the reciprocity functional method

    … measurements taken on the external boundary of the duct. The methodology allows the use of both steady-state and transient external wall temperature measurements as input data. To estimate the heat transfer coefficient in a duct, according to the proposed technique, two auxiliary problems are …

    brazil-uerj Repository record for Convection heat transfer coefficient estimation in ducts using the reciprocity functional method (opens in a new tab)

  11. Parallel Gauss-Newton method for CP decomposition

    … decomposition problem can be formulated as a non-linear least squares problem to apply iterative Newton-like methods. Direct solution of linear systems involving an approximated Hessian is an expensive approach, however, recent advancements have shown that use of an implicit representation of the …

    uiuc Repository record for Parallel Gauss-Newton method for CP decomposition (opens in a new tab)

  12. Nodal Reordering Strategies to Improve Preconditioning for Finite Element Systems

    The availability of high performance computing clusters has allowed scientists and engineers to study more challenging problems. However, new algorithms need to be developed to take advantage of the new computer architecture (in particular, distributed memory clusters). Since the solution of linear …

    vt Repository record for Nodal Reordering Strategies to Improve Preconditioning for Finite Element Systems (opens in a new tab)

  13. Inexact Hierarchical Scale Separation for Linear Systems in Modal Discontinuous Galerkin Discretizations

    … scale separation (IHSS) method for the solution of linear systems in modal discontinuous Galerkin (DG) discretizations. Like p-multigrid methods, IHSS alternates between discretizations of different polynomial order to improve the computational performance of solving linear systems. IHSS …

    rice Repository record for Inexact Hierarchical Scale Separation for Linear Systems in Modal Discontinuous Galerkin Discretizations (opens in a new tab)

  14. Iterative Methods and Multiscale Methods for Linear Systems in Modal Discontinuous Galerkin Discretizations

    Iterative methods for the solution of linear systems are a core component of many scientific software packages, especially of numerical simulations in which the discretization of partial differential equations in two or three dimensions and with high spatial resolution often results in large, …

    rice Repository record for Iterative Methods and Multiscale Methods for Linear Systems in Modal Discontinuous Galerkin Discretizations (opens in a new tab)

  15. Characterization of high-speed electronic packages using reduced-order partial element equivalent circuit models

    … Circuit (PEEC) technique, namely University of Arizona Effective Package Inductance Calculator (UAEPIC) and University of Arizona Effective Package Inductance and Capacitance Calculator (UAEPIC²), have been developed. The first one, UAEPIC, is based on the magneto-quasistatic assumption where …

    arizona-thes Repository record for Characterization of high-speed electronic packages using reduced-order partial element equivalent circuit models (opens in a new tab)

  16. Parallel Schur Complement Algorithms for the Solution of Sparse Linear Systems and Eigenvalue Problems

    … in science and engineering, where the solution of a linear system or an eigenvalue problem is needed.While direct methods are still preferable when solving linear systems arising from two-dimensional models, iterative methods are widely used when solving linear systems arising from …

    umn Repository record for Parallel Schur Complement Algorithms for the Solution of Sparse Linear Systems and Eigenvalue Problems (opens in a new tab)

  17. Constraint Preconditioning of Saddle Point Problems

    This thesis is concerned with the fast iterative solution of linear systems of equations of saddle point form. Saddle point problems are a ubiquitous class of matrices that arise in a host of computational science and engineering applications. The focus here is on improving the convergence of …

    temple Repository record for Constraint Preconditioning of Saddle Point Problems (opens in a new tab)

  18. Fast Algorithms for High Frequency Interconnect Modeling in VLSI Circuits and Packages

    … an important role in design and verification of VLSI circuits and packages. For low frequency circuits, great advances for parasitic resistance and capacitance extraction have been achieved and wide varieties of techniques are available. However, for high frequency circuits and packages, …

    tamu Repository record for Fast Algorithms for High Frequency Interconnect Modeling in VLSI Circuits and Packages (opens in a new tab)

  19. Numerical analysis of a fractional step theta-method for fluid flow problems

    The accurate numerical approximation of viscoelastic fluid flow poses two difficulties: the large number of unknowns in the approximating algebraic system (corresponding to velocity, pressure, and stress), and the different mathematical types of the modeling equations. Specifically, the …

    clemson Repository record for Numerical analysis of a fractional step theta-method for fluid flow problems (opens in a new tab)

Page 1 of 2