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 55 for “"Linear systems of equations"”.
-
Augmented Matrix Solvers for Dynamic Linear Systems of Equations
In this dissertation, the problem of updating in real time the solution to a linear system of equations when a sequence of small changes is made to the data is considered. This problem arises in many computational science and engineering applications, and we consider two of them. The first is …
-
Classification of Linear Systems of Equations for Quantum Computing Implementation
Drawing nearer to an error-corrected era of quantum computing, it is necessary to understand the suitability of certain post-NISQ algorithms for practical problems. One of the most promising, applicable, and yet difficult to implement in practical terms is the Harrow, Hassidim and Lloyd (HHL) …
-
The updated subspaces method in optimization and in solving linear systems of equations
… an modified quasi-Newton method for solving nonlinear unconstrained minimization problems, has flexibility of choosing different quadratic approximation at each iteration and therefore has potential of improving the rate of convergence given by the quasi-Newton method. In this dissertation, the …
-
Quantum algorithm for linear systems of equations for the multi-dimensional Black-Scholes equation
The primary focus of this thesis is the investigation of the quantum algorithm for linear systems of equations (HHL) for the valuation of multi-asset options, a particular type of financial instrument. Quantum computing has the possibility to revolutionize many fields that are computationally …
-
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 …
-
Numerical solution of boundary value problems using a variational formulation
In this thesis unique solutions of certain Boundary Value Problems are approximated by first converting them into their variational formulation and obtaining linear systems of equations by either using finite element method or discretization, then using the Gauss-Seidel iterative method to solve …
-
Técnicas iterativas para a solução de sistemas de equações lineares oriundos do método dos elementos de contorno
… only technique employed so far for solving BEM linear systems of equations. Although trustful mainly when pivoting is employed, Gauss elimination is very expensive. This work aims to investigate the possibility of applying iterative "solvers" to BEM analysis, and to select (or work out) those …
-
Solution of Nonsymmetric Systems of Equations on a Multiprocessor
We consider the iterative solution of large sparse linear systems of equations arising from elliptic and parabolic partial differential equations in two and three space dimensions. Specifically, we focus our attention on non-symmetric systems of equations whose eigenvalues lie on both sides of the …
-
Krylov methods for solving linear systems
Krylov methods are considered as one of the most popular classes of numerical methods to solve large sparse linear systems of equations. One of the reasons for their popularity is that they are relatively simple to implement. Therefore, Krylov methods have been increasingly accepted as efficient …
-
Algoritmo de ponto interior para programação linear baseado no FDIPA
[EN] In this work we use an algorithm of interior points and feasible directions called FDIPA, ”Feasible Direction Interior Point Algorithm”, for solving linear optimization problems. In each iteration FDIPA calculates a feasible descent direction of the problem by a Newton-type iteration to solve …
-
Row Projection Methods for Linear Systems
Row projection (RP) methods for solving linear systems of equations are algorithms that require orthogonal projections onto the set of solutions of subsets of the equations. RP methods are categorized and their convergence properties summarized and extended. An implementation approach is presented …
-
Multigrid methods for elliptic optimal control problems
Linear-quadratic optimal control problems governed by elliptic partial differential equations arise in a, variety of applications. The optimality conditions for these problems lead to large scale, symmetric indefinite linear systems of equations. For many applications these systems cannot be solved …
-
Convergence and Comparison Theorems for Various Splittings of Matrices Based on Generalized Inverses
The convergence of iterative methods for numerically solving the linear systems of equations associated with different types of splittings has been well studied in the literature. In this dissertation, we define new types of splittings based on generalized inverses (Moore-Penrose inverse, Drazin …
-
An introduction to linear algebra: A curricular unit for pre-calculus students
… mathematical tools that facilitate the process of organizing and manipulating data. In this work, the matrix operations of addition, subtraction, scalar multiplication, and matrix multiplication are built logically from the intuition of the students and their knowledge of real numbers. From this …
-
A new general purpose systolic array for matrix computations
… our architecture is able to perform a wide class of matrix computations. And since the architecture is systolic based, it brings massive parallelism to all of its computations. As a result, many matrix operations including addition, multiplication, inversion, LU-decomposition, transpose, and …
-
Continuous Time Approach of Stock-Flow Consistent Macroeconomic Models
The aim of this thesis is to provide tools in order to simplify and extend the analysis of stock-flow consistent macroeconomic models. For models in continuous time, we will focus on stability and steady state solutions, considering constant exogenous parameters. For models in discrete time, we …
-
Domain Decomposition Preconditioners for Hermite Collocation Problems
Accelerating the convergence rate of Krylov subspace methods with parallelizable preconditioners is essential for obtaining effective iterative solvers for very large linear systems of equations. Substructuring provides a framework for constructing robust and parallel preconditioners for linear …
-
High performance computing for multiphase fluid flows
… The flow is characterized by the movement of this interface. Accurate modelling of the interface movement is a fundamental problem in the numerical simulation of these flows. Velocities for the movement are provided by the numerical solution of the Navier-Stokes (N-S) equations. These …
Page 1 of 3