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 13 of 13 for “"Iterative solution methods"”.
-
Iterative Solution Methods for Reduced-Order Models of Parameterized Partial Differential Equations
… it is necessary to compute discrete solutions of the PDEs at many parameter values. Accuracy considerations often lead to algebraic systems with many unknowns whose solution via traditional methods can be expensive. Reduced-order models use a reduced space to approximate the …
-
Preconditioning for standard and two-sided Krylov subspace methods
This thesis is concerned with the solution of large nonsymmetric sparse linear systems. The main focus is on iterative solution methods and preconditioning. Assuming the linear system has a special structure, a minimal residual method called TSMRES, based on a generalization of a Krylov subspace, …
-
Preconditioners for iterative solutions of large-scale linear systems arising from Biot's consolidation equations
The solution of the linear systems of equation is the most time-consuming part in large-scale finite element analysis. The development of fast preconditioned iterative solution methods are therefore of utmost importance to the field of scientific computing. The objective of this thesis was to …
-
Numerical methods for solution of queuing-network problems with applications to models of multiprogrammed computer systems.
… of a Markovian queuing network by numerical solution of a set of linear balance equations are the choice of vector representation of the states, the generation and storage of the states, and generation, storage and solution of the balance equations. Lexicographic sequencing of the vector …
-
Adaptive finite element simulation of incompressible viscous flow
… flows. The formulation is based on a segregated solution method. In this segregated formulation, the velocities and pressures are uncoupled and the equations for each are solved one after the other. This segregated solution method is numerically compared to the penalty method and to previous …
-
Bounding Methods for Facilities Location Problems
<p>Several methods have been proposed and tested for calculating lower bounds on the objective function of facilities problems. These methods contribute to the efficiency of iterative solution methods by allowing the user to terminate the computation process when the objective function comes within …
-
Hardware-based Parallel Computing for Real-time Simulation of Soft-object Deformation
… hardware-based parallel implementation of the iterative Conjugate Gradient (CG) algorithm for solving linear systems of equations is pro- posed. Sparse matrix-vector multiplication (SpMxV) is the main computational kernel in iterative solution methods such as the CG algorithm. Modern micro- …
-
An accurate Navier-Stokes solver with an application to unsteady flows.
… In CFD simulations obtaining grid independent solutions without excessive cost is desirable. Hence, there is a need to evaluate higher order accurate discretization schemes (both spatial and temporal). Moreover, many journals require at least second-order accuracy for publication. Also, there …
-
A Computational Aerodynamic Design Optimization Method Using Sensitivity Analysis
… coefficients; (2) obtaining the flowfield solution either by a computational fluid dynamics (CFD) analysis or, alternatively, by a flowfield extrapolation method which is based on a truncated Taylor's series; (3) defining the aerodynamic shape in such a way that it is not restricted to any …
-
Efficient techniques for handling and sparsification of dense matrices in very large-scale circuit simulation
… we present efficient techniques for the solution of the linear systems arising in transient analysis of large mutually inductive circuits, as well as a methodology for the sparsification of the dense matrices resulting from MOR. The proposed techniques for solving the linear systems in …
-
Preconditioning of Karush--Kuhn--Tucker Systems arising in Optimal Control Problems
… under investigation arise in the numerical solution of quadratic programming problems, for example in the form of Karush--Kuhn--Tucker (KKT) optimality conditions or in interior--point methods. Therefore, the system matrix is referred to as a KKT matrix. It is not the purpose of this thesis …
-
Μοντελοποίηση ενδογενούς οικονομικής ανάπτυξης με βάση τις ενεργειακές καινοτομίες
… mathematical modeling and algorithms for the solution of nonlinear systems. The modeling represents the behavior of each economic agent (households, businesses and the public sector), as a result of the optimization of utility or minimization of cost under technical and economic constraints. …