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 solución iterativa de sistemas lineales no singulares y antisimétricos, donde la matriz de coeficientes A tiene parte antisimétrica de rango bajo o puede aproximarse bien con una matriz antisimétrica de rango bajo. Sistemas como este surgen de la discretización de PDEs con ciertas condiciones de frontera de Neumann, la discretización de ecuaciones integrales y métodos de puntos interiores, por ejemplo, el problema de Bratu y la ecuación integral de Love. El segundo tipo de sistemas lineales considerados son problemas de mínimos cuadrados (LS) que se resuelven considerando la solución del sistema equivalente de ecuaciones normales. Concretamente, consideramos la solución de problemas LS modificados y de rango incompleto. Por problema LS modificado se entiende que el conjunto de ecuaciones lineales se actualiza con alguna información nueva, se agrega una nueva variable o, por el contrario, se elimina alguna información o variable del conjunto. En los problemas LS de rango deficiente, la matriz de coeficientes no tiene rango completo, lo que dificulta el cálculo de una factorización incompleta de las ecuaciones normales. Los problemas LS surgen en muchas aplicaciones a gran escala de la ciencia y la ingeniería como, por ejemplo, redes neuronales, programación lineal, sismología de exploración o procesamiento de imágenes. Los precondicionadores directos para métodos iterativos usados habitualmente son las factorizaciones incompletas LU, o de Cholesky cuando la matriz es simétrica definida positiva. La principal contribución de esta tesis es el desarrollo de técnicas de actualización de precondicionadores. Básicamente, el método consiste en el cálculo de una descomposición incompleta para un sistema lineal aumentado equivalente, que se utiliza como precondicionador para el problema original. El estudio teórico y los resultados numéricos presentados en esta tesis muestran el rendimiento de la técnica de precondicionamiento propuesta y su competitividad en comparación con otros métodos disponibles en la literatura para calcular precondicionadores para los problemas estudiados. / The main topic of this thesis is updating preconditioners for solving large sparse linear systems Ax=b by using Krylov iterative methods. Two interesting types of problems are considered. In the first one is studied the iterative solution of non-singular, non-symmetric linear systems where the coefficient matrix A has a skew-symmetric part of low-rank or can be well approximated with a skew-symmetric low-rank matrix. Systems like this arise from the discretization of PDEs with certain Neumann boundary conditions, the discretization of integral equations as well as path following methods, for example, the Bratu problem and the Love's integral equation. The second type of linear systems considered are least squares (LS) problems that are solved by considering the solution of the equivalent normal equations system. More precisely, we consider the solution of modified and rank deficient LS problems. By modified LS problem, it is understood that the set of linear relations is updated with some new information, a new variable is added or, contrarily, some information or variable is removed from the set. Rank deficient LS problems are characterized by a coefficient matrix that has not full rank, which makes difficult the computation of an incomplete factorization of the normal equations. LS problems arise in many large-scale applications of the science and engineering as for instance neural networks, linear programming, exploration seismology or image processing. Usually, incomplete LU or incomplete Cholesky factorization are used as preconditioners for iterative methods. The main contribution of this thesis is the development of a technique for updating preconditioners by bordering. It consists in the computation of an approximate decomposition for an equivalent augmented linear system, that is used as preconditioner for the original problem. The theoretical study and the results of the numerical experiments presented in this thesis show the performance of the preconditioner technique proposed and its competitiveness compared with other methods available in the literature for computing preconditioners for the problems studied. / El tema principal d'esta tesi és actualitzar precondicionadors per a resoldre sistemes lineals grans i buits Ax=b per mitjà de l'ús de mètodes iteratius de Krylov. Es consideren dos tipus interessants de problemes. En el primer s'estudia la solució iterativa de sistemes lineals no singulars i antisimètrics, on la matriu de coeficients A té una part antisimètrica de baix rang, o bé pot aproximar-se amb una matriu antisimètrica de baix rang. Sistemes com este sorgixen de la discretització de PDEs amb certes condicions de frontera de Neumann, la discretització d'equacions integrals i mètodes de punts interiors, per exemple, el problema de Bratu i l'equació integral de Love. El segon tipus de sistemes lineals considerats, són problemes de mínims quadrats (LS) que es resolen considerant la solució del sistema equivalent d'equacions normals. Concretament, considerem la solució de problemes de LS modificats i de rang incomplet. Per problema LS modificat, s'entén que el conjunt d'equacions lineals s'actualitza amb alguna informació nova, s'agrega una nova variable o, al contrari, s'elimina alguna informació o variable del conjunt. En els problemes LS de rang deficient, la matriu de coeficients no té rang complet, la qual cosa dificultata el calcul d'una factorització incompleta de les equacions normals. Els problemes LS sorgixen en moltes aplicacions a gran escala de la ciència i l'enginyeria com, per exemple, xarxes neuronals, programació lineal, sismologia d'exploració o processament d'imatges. Els precondicionadors directes per a mètodes iteratius utilitzats més a sovint són les factoritzacions incompletes tipus ILU, o la factorització incompleta de Cholesky quan la matriu és simètrica definida positiva. La principal contribució d'esta tesi és el desenvolupament de tècniques d'actualització de precondicionadors. Bàsicament, el mètode consistix en el càlcul d'una descomposició incompleta per a un sistema lineal augmentat equivalent, que s'utilitza com a precondicionador pel problema original. L'estudi teòric i els resultats numèrics presentats en esta tesi mostren el rendiment de la tècnica de precondicionament proposta i la seua competitivitat en comparació amb altres mètodes disponibles en la literatura per a calcular precondicionadors per als problemes considerats. / Guerrero Flores, DJ. (2018). On Updating Preconditioners for the Iterative Solution of Linear Systems [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/104923 / TESIS

The thesis deals with methods of identification of dynamic systems in time and frequency domain. Nonparametric and parametric methods of identification are analyzed. Selected methods are implemented in Matlab & Simulink sotware. Finally, the user guide for the created Python application is introduced.

The objective of the thesis is to create software, which implements industrial PID controller enabling smooth switch-over and automatic tuning of parameters. The next objective is to create visualization for this controller. Whole controller have to be implemented into PLC Power Panel (B&R company). At the beginning of the thesis there is theoretical description of all implemented algorithms (discrete control algorithms derived from PID, smooth switch-over, antiwindup, identification algorithms). In the following there is designed program structure, which is state machine-shaped. All algorithms are implemented in ANSI C at first as s-function for Matlab/Simulink program, which enables to simulate and verify the controller. Implementation of controller into PLC Power Panel through the use of Automation Studio program from B&R company is described in the next part. Visualization is created in the same program. Simulations and verifications on mathematical and physical model demonstrates functionality of implemented algorithms, but also points out some problems associated with the use of identification algorithms in real world (noise, quantization in A/D and D/A converter).

Master’s thesis is focused on the adaptive controllers. The first theoretic part mainly describes the parametric identification, which belongs to the most important part of the adaptive controller’s structure. Classical identification methods (the recursive least squares methods) are firstly mentioned and afterwards the identification methods based on the neural network (the Marquardt-Levenberg algorithm and the new identification algorithm NIA inspired by the neural networks) are described. At the conclusion of the theoretic part there are mentioned the algorithm of the adaptive controller’s tuning which uses the identification parameters (the modified Z-N method) and the tested types of adaptive controllers. Particular results, which were found out by verifying of the adaptive controllers on the simulation and real models, are contained in second, the practical, part of the thesis. Finally, achieved results are compared with the classical discrete PID controller and with the adaptive controller of the B&R company.

The aim of this work is to introduce a new type of fuzzy system AnYa. This system, unlike the classical fuzzy systems Takagi-Sugeno and Mamdani, uses a type of antecendent based on real data distribution. As part of the work there will be mentioned system programmed and its functionality will be verified on testing data.

This thesis studies inference to the complier treatment effect denoted LATE. The standard approach is to base the inference on the two-stage least squares (2SLS) estimator and asymptotic Neyman inference, i.e., the t-test. The paper suggests a Fisher Randomization Test based on the t-test statistic as an alternative to the Neyman inference. Based on the setup with a randomized experiment with noncompliance, for which one can identify the LATE, I compare the two approaches in a Monte Carlo (MC) simulations. The results from the MC simulation is that the Fisher randomization test is not a valid alternative to the Neyman’s test as it has too low power.

The topic of force reconstruction has been studied quite extensively but most of the existing research work that has been done are in the domain of structural and civil engineering construction like bridges and beams. Considerable work in force reconstruction has also being done in fabrication of machines and structures like aircrafts, gear boxes etc. The topic of force reconstruction of the cutting forces during a machining process like turning or milling machines is a recent line of research to suffice the requirement of proactive monitoring of forces generated during the operation of the machine tool. The forces causing vibrations while machining if detected and monitored can enhance system productivity and efficiency of the process. The objective of this study was to investigate the algorithms available in literature for inverse force reconstruction and apply for reconstruction of cutting forces while machining on a computer numerically controlled (CNC) machine. This study has applied inverse force reconstruction technique algorithms 1) Deconvolution method, 2) Kalman filter recursive least square and 3) augmented Kalman filter for inverse reconstruction of forces for multi degree of freedom systems. Results from experiments conducted as part of this thesis work shows the effectiveness of the methods of force reconstruction to monitor the forces generated during the machining process on machine tools in real time without employing dynamometers which are expensive and complex to set-up. This study for developing a cost-effective method of force reconstruction will be instrumental in applications for improving machining efficiency and proactive preventive maintenance. / Graduate

The hierarchical (<i>H-</i>) matrix format allows storing a variety of dense matrices from certain applications in a special data-sparse way with linear-polylogarithmic complexity. Many operations from linear algebra like matrix-matrix and matrix-vector products, matrix inversion and LU decomposition can be implemented efficiently using the <i>H</i>-matrix format. Due to its importance in solving many problems in numerical linear algebra like least-squares problems, it is also desirable to have an efficient QR decomposition of <i>H</i>-matrices. In the past, two different approaches for this task have been suggested. We will review the resulting methods and suggest a new algorithm to compute the QR decomposition of an <i>H</i>-matrix. Like other <i>H</i>-arithmetic operations the <i>H</i>QR decomposition is of linear-polylogarithmic complexity. We will compare our new algorithm with the older ones by using two series of test examples and discuss benefits and drawbacks of the new approach.

Magister Legum - LLM / Sugar, bananas, beef and cotton are some of the few products, which are the primary commodities in many African, Caribbean and Pacific countries (ACP).2 Many are highly vulnerable small islands, landlocked and least developed states,' thus rendering the above-mentioned sectors, of great importance to their economies." In these countries, for instance, the sugar producers often provide housing, health care, education and other benefits.i

Pricing American options has always been problematic due to its early exercise characteristic. As no closed-form analytical solution for any of the widely used models exists, many numerical approximation methods have been proposed and studied. In this thesis, we investigate the Least-Square Monte Carlo Simulation (LSMC) method of Longstaff &amp; Schwartz for pricing American options under the two-dimensional Heston model. By conducting extensive numerical experimentation, we put the LSMC to test and investigate four different continuation functions for the LSMC. In addition, we consider investigating seven different combination of Heston model parameters. We analyse the results and select the optimal continuation function according to our criteria. Then we uncover and study the early exercise boundary foran American put option upon changing initial volatility and other parameters of the Heston model.