<p>The linear complementarity problems (LCP) arise from linear or quadratic programming, or from a variety of other particular application problems, like boundary problems, network equilibrium problems,contact problems, market equilibria problems, bimatrix games etc. Recently, many people have focused on the solver of LCP with a matrix having some kind of special property, for example, when this matrix is an H+-matrix, since this property is a sufficient condition for the existence and uniqueness of the soluition of LCP. Generally speaking, solving LCP can be approached from two essentially different perspectives. One of them includes the use of so-called direct methods, in the literature also known under the name pivoting methods. The other, and from our perspective - more interesting one, which we actually focus on in this thesis,<br />is the iterative approach. Among the vast collection of iterative solvers,our choice was one particular class of modulus based iterative methods.Since the subclass of modulus based-methods is again diverse in some sense, it can be specialized even further, by the introduction and the use of matrix splittings. The main goal of this thesis is to use the theory of H -matrices for proving convergence of the modulus-based multisplit-ting methods, and to use this new technique to analyze some important properties of iterative methods once the convergence has been guaranteed.</p> / <p>Problemi linearne komplementarnosti (LCP) se javljaju kod problema linearnog i kvadratnog programiranja i kod mnogih drugih problema iz prakse, kao &scaron;to su, na&nbsp; primer, problemi sa graničnim slojem, problemi mrežnih ekvilibrijuma, kontaktni problemi, problemi određivanja trži&scaron;ne ravnoteže, problemi bimatričnih igara i mnogi drugi. Ne tako davno, veliki broj autora se bavio razvijanjem postupaka za re&scaron;avanje LCP sa matricom koja ispunjava neko specijalno svojstvo, na primer, da pripada klasi H+-matrica, budući da je dobro poznato da je ovaj uslov dovoljan da obezbedi egzistenciju i jedinstvenost re&scaron;enja LCP. Uop&scaron;teno govoreći, re&scaron;avanju LCP moguce&nbsp; je pristupiti dvojako. Prvi pristup podrazumeva upotrebu takozvanih direktnih metoda, koje su u literaturi poznate i pod nazivom metode pivota. Drugoj kategoriji, koja je i sa stanovi&scaron;ta ove teze interesantna, pripadaju iterativni postupci. S obzirom da je ova kategorija izuzetno bogata, mi smo se opredelili za jednu od najznačajnijih varijanti, a&nbsp; to je modulski iterativni postupak. Međutim, ni ova odrednica nije dovoljno adekvatna, budući da modulski postupci obuhvataju nekolicinu različitih pravaca. Zato smo se odlučili da posmatramo postupke koji se zasnivaju na razlaganjima ali i vi&scaron;estrukim razlaganjima matrice. Glavni cilj ove doktorske disertacije jeste upotreba teorije H -matrica u teoremama o konvergenciji modulskih metoda zasnovanih na multisplitinzima matrice i kori&scaron;ćenje ove nove tehnike, sa ciljem analize bitnih osobina, nakon &scaron;to je konvergencija postupka zagarantovana.</p>

Due to the highly-varying wireless channels over time, frequency, and space domains, statistical QoS provisioning, instead of deterministic QoS guarantees, has become a recognized feature in the next-generation wireless networks. In this dissertation, we study the adaptive wireless resource allocation problems for statistical QoS provisioning, such as guaranteeing the specified delay-bound violation probability, upper-bounding the average loss-rate, optimizing the average goodput/throughput, etc., in several typical types of mobile wireless networks. In the first part of this dissertation, we study the statistical QoS provisioning for mobile multicast through the adaptive resource allocations, where different multicast receivers attempt to receive the common messages from a single base-station sender over broadcast fading channels. Because of the heterogeneous fading across different multicast receivers, both instantaneously and statistically, how to design the efficient adaptive rate control and resource allocation for wireless multicast is a widely cited open problem. We first study the time-sharing based goodput-optimization problem for non-realtime multicast services. Then, to more comprehensively characterize the QoS provisioning problems for mobile multicast with diverse QoS requirements, we further integrate the statistical delay-QoS control techniques — effective capacity theory, statistical loss-rate control, and information theory to propose a QoS-driven optimization framework. Applying this framework and solving for the corresponding optimization problem, we identify the optimal tradeoff among statistical delay-QoS requirements, sustainable traffic load, and the average loss rate through the adaptive resource allocations and queue management. Furthermore, we study the adaptive resource allocation problems for multi-layer video multicast to satisfy diverse statistical delay and loss QoS requirements over different video layers. In addition, we derive the efficient adaptive erasure-correction coding scheme for the packet-level multicast, where the erasure-correction code is dynamically constructed based on multicast receivers’ packet-loss statuses, to achieve high error-control efficiency in mobile multicast networks. In the second part of this dissertation, we design the adaptive resource allocation schemes for QoS provisioning in unicast based wireless networks, with emphasis on statistical delay-QoS guarantees. First, we develop the QoS-driven time-slot and power allocation schemes for multi-user downlink transmissions (with independent messages) in cellular networks to maximize the delay-QoS-constrained sum system throughput. Second, we propose the delay-QoS-aware base-station selection schemes in distributed multiple-input-multiple-output systems. Third, we study the queueaware spectrum sensing in cognitive radio networks for statistical delay-QoS provisioning. Analyses and simulations are presented to show the advantages of our proposed schemes and the impact of delay-QoS requirements on adaptive resource allocations in various environments.

This thesis presents a cross-layer design and optimization for emerging wideband wireless networks supporting multimedia applications, considering the interactions of the wireless channel characteristics, the physical and link layer protocols, and the user-perceived Quality-of-Service (QoS). As wireless channels are error-prone and broadcast in nature, both the error control mechanisms and the Media Access Control (MAC) protocols are critical for resource utilization and QoS provisioning. How to analyze, design and optimize the high-rate wireless networks by considering the characteristics of the propagation channels and wideband communication technologies is an open, challenging issue. In this thesis, we consider two important wideband wireless systems, the Ultra-Wideband (UWB) and the Orthogonal Frequency-Division Multiplexing (OFDM) systems. First, we propose the packet-level channel models based on Finite State Markov Chains (FSMCs) for the two systems, which present the statistical properties of the propagation channels and the transmission systems. Second, by incorporating the proposed packet-level channel models, we develop analytical frameworks for quantifying the performance of the high-rate wireless networks, combining the channel fading, physical- and link-layer error-control mechanisms and MAC protocols. Third, to mitigate the impact of channel fading and impairments, a cross-layer joint error-control mechanism is proposed. In addition, we also investigate the impact of channel fading on the video streaming applications, and propose a simple admission control algorithm to ensure QoS. As considering the physical-layer characteristics is critical for ensuring QoS and efficiency of resource utilization, the packet-level channel models, cross-layer analytical frameworks, networking protocols and simulation methodologies proposed in this dissertation are essential for future proliferation of high-rate wireless networks.

Die FEM-MKS-Kopplung erfordert Modellordnungsreduktions-Verfahren, die mit kleiner reduzierter Systemdimension das Übertragungsverhalten mechanischer Strukturen abbilden. Rationale Krylov-Unterraum-Verfahren, basierend auf dem Arnoldi-Algorithmen, ermöglichen solche Abbildungen in frei wählbaren, breiten Frequenzbereichen. Ziel ist der Entwurf einer fehlerüberwachten Modelreduktion auf Basis von Krylov-Unterraumverfahren und Anwendung auf ein strukturmechanisches Model. Auf Grundlage der Software MORPACK wird eine Arnoldi-Funktion erster Ordnung um interpolativen Startvektor, Eliminierung der Starrkörperbewegung und Reorthogonalisierung erweitert. Diese Operationen beinhaltend, wird ein rationales, interpolatives SOAR-Verfahren entwickelt. Ein rationales Block-SOAR-Verfahren erweist sich im Vergleich als unterlegen. Es wird interpolative Gleichwichtung verwendet. Das Arnoldi-Verfahren zeichnet kleiner Berechnungsaufwand aus. Das rationale, interpolative SOAR liefert kleinere reduzierte Systemdimensionen für gleichen abgebildeten Frequenzbereich. Die Funktionen werden auf Rahmen-, Getriebegehäuse- und Treibsatzwellen-Modelle angewendet. Zur Fehlerbewertung wird eigenfrequenzbasiert ein H2-Integrationsbereich festgelegt und der übertragungsfunktionsbasierte, relative H2-Fehler berechnet. Es werden zur Lösung linearer Gleichungssysteme mit Matlab entsprechende Löser-Funktionen, auf Permutation und Faktorisierung basierend, implementiert. / FEM-MKS-coupling requires model order reduction methods to simulate the frequency response of mechanical structures using a smaller reduced representation of the original system. Most of the rational Krylov-subspace methods are based on Arnoldi-algorithms. They allow to represent the frequency response in freely selectable, wide frequency ranges. Subject of this thesis is the implementation of an error-controlled model order reduction based on Krylov-subspace methods and the application to a mechanical model. Based on the MORPACK software, a first-order-Arnoldi function is extended by an interpolative start vector, the elimination of rigid body motion and a reorthogonalization. Containing these functions, a rational, interpolative Second Order Arnoldi (SOAR) method is designed that works well compared to a rational Block-SOAR-method. Interpolative equal weighting is used. The first-order-Arnoldi method requires less computational effort compared to the rational, interpolative SOAR that is able to compute a smaller reduction size for same frequency range of interest. The methods are applied to the models of a frame, a gear case and a drive shaft. Error-control is realized by eigenfrequency-based H2-integration-limit and relative H2-error based on the frequency response function. For solving linear systems of equations in Matlab, solver functions based on permutation and factorization are implemented.

This thesis investigates both theoretical and practical aspects of the design and analysis of modern error-control coding schemes, namely low-density parity-check (LDPC) codes and rateless codes for unequal error protection (UEP). It also studies the application of modern error-control codes in efficient data dissemination in wireless ad-hoc and sensor networks. Two methodologies for the design and analysis of UEP-LDPC codes are proposed. For these proposed ensembles, density evolution formulas over the binary erasure channel are derived and used to optimize the degree distribution of the codes. Furthermore, for the first time, rateless codes that can provide UEP are developed. In addition to providing UEP, the proposed codes can be used in applications for which unequal recovery time is desirable, i.e., when more important parts of data are required to be recovered faster than less important parts. Asymptotic behavior of the UEP-rateless codes under the iterative decoding is investigated. In addition, the performance of the proposed codes is examined under the maximum-likelihood decoding, when the codes have short to moderate lengths. Results show that UEP-rateless codes are able to provide very low error rates for more important bits with only a subtle loss in the performance of less important bits. Moreover, it is shown that given a target bit error rate, different parts of the information symbols can be decoded after receiving different numbers of encoded symbols. This implies that information can be recovered in a progressive manner, which is of interest in many practical applications such as media-on-demand systems. This work also explores fundamental research problems related to applying error-control coding such as rateless coding to the problem of reliable and energy-efficient broadcasting in multihop wireless ad-hoc sensor networks. The proposed research touches on the four very large fields of wireless networking, coding theory, graph theory, and percolation theory. Based on the level of information that each node has about the network topology, several reliable and energy-efficient schemes are proposed, all of which are distributed and have low complexity of implementation. The first protocol does not require any information about the network topology. Another protocol, which is more energy efficient, assumes each node has local information about the network topology. In addition, this work proposes a distributed scheme for finding low-cost broadcast trees in wireless networks. This scheme takes into account various parameters such as distances between nodes and link losses. This protocol is then extended to find low-cost multicast trees. Several schemes are extensively simulated and are compared.

The doctoral thesis deals with design of coding for frequency hopping stations in band with intensive jamming. In digital modulations erroneous determination of the modulation state occurs due to jam at the receiver side. The result is erroneously transferred symbols of the message. Errors created during the transmission can be eliminated by using error control systems. It is also possible to prevent these errors by using algorithms (techniques) of frequency hopping which select the appropriate channel. Appropriate communication channel is a channel with a lower probability of erroneous symbol in the message. The main contribution of this thesis is to design a new frequency hopping technique with collision avoidance (FH/CA). The station with FH/CA technique measures signal levels in the considered several channels before every jump. Based on the measurements the most appropriate channel with the lowest value of measured signal level is selected. Therefore, it is more probable that a jump to an unoccupied channel with a transmission will occur. Using a mathematical model, the performance of the newly proposed FH/CA technique is compared with the currently used techniques FH and AFH. Comparison criteria are the probability of a collision between an FH/CA communication system and a static (device transmitting continuously at a fixed frequency) or dynamic jammer (i.e. other FH or AFH systems). By comparing the values of the probability of jammed transmission, indisputable theoretical advantages of the new FH/CA technique were found, compared to the currently used FH and AFH techniques. The FH/CA technique always has better or equal results compared with the FH technique in the case of interference by static and dynamic jammers. The FH/CA technique in a band with static and dynamic jammers usually has better results than the AFH technique. A significant contribution of the FH/CA technique can be seen in the case of dynamic jammers. On the other hand, in the case of static jammers the FH/CA technique is in certain situations worse than the AFH technique. The accuracy of the mathematical models were successfully verified on a simulation model that was created as a part of this thesis in the MATLAB environment. Based on the obtained data from the model there was designed coding for frequency hopping stations with the new technique of frequency hopping FH/CA which is designed for small-volume data transfer in a band with intensive jamming.

Die FEM-MKS-Kopplung erfordert Modellordnungsreduktions-Verfahren, die mit kleiner reduzierter Systemdimension das Übertragungsverhalten mechanischer Strukturen abbilden. Rationale Krylov-Unterraum-Verfahren, basierend auf dem Arnoldi-Algorithmen, ermöglichen solche Abbildungen in frei wählbaren, breiten Frequenzbereichen. Ziel ist der Entwurf einer fehlerüberwachten Modelreduktion auf Basis von Krylov-Unterraumverfahren und Anwendung auf ein strukturmechanisches Model. Auf Grundlage der Software MORPACK wird eine Arnoldi-Funktion erster Ordnung um interpolativen Startvektor, Eliminierung der Starrkörperbewegung und Reorthogonalisierung erweitert. Diese Operationen beinhaltend, wird ein rationales, interpolatives SOAR-Verfahren entwickelt. Ein rationales Block-SOAR-Verfahren erweist sich im Vergleich als unterlegen. Es wird interpolative Gleichwichtung verwendet. Das Arnoldi-Verfahren zeichnet kleiner Berechnungsaufwand aus. Das rationale, interpolative SOAR liefert kleinere reduzierte Systemdimensionen für gleichen abgebildeten Frequenzbereich. Die Funktionen werden auf Rahmen-, Getriebegehäuse- und Treibsatzwellen-Modelle angewendet. Zur Fehlerbewertung wird eigenfrequenzbasiert ein H2-Integrationsbereich festgelegt und der übertragungsfunktionsbasierte, relative H2-Fehler berechnet. Es werden zur Lösung linearer Gleichungssysteme mit Matlab entsprechende Löser-Funktionen, auf Permutation und Faktorisierung basierend, implementiert.:1. Einleitung 1.1. Motivation 1.2. Einordnung 1.3. Aufbau der Arbeit 2. Theorie 2.1. Simulationsmethoden 2.1.1. Finite Elemente Methode 2.1.2. Mehrkörpersimulation 2.1.3. Kopplung der Simulationsmethoden 2.2. Zustandsraumdarstellung und Reduktion 2.3. Krylov Unterraum Methoden 2.4. Arnoldi-Algorithmen erster Ordnung 2.5. Arnoldi-Algorithmen zweiter Ordnung 2.6. Korrelationskriterien 2.6.1. Eigenfrequenzbezogene Kriterien 2.6.2. Eigenvektorbezogene Kriterien 2.6.3. Übertragungsfunktionsbezogene Kriterien 2.6.4. Fehlerbewertung 2.6.5. Anwendung auf Systeme sehr großer Dimension 3. Numerik linearer Gleichungssysteme 3.1. Grundlagen 3.2. Singularität der Koeffizientenmatrix 3.2.1. Randbedingungen des Systems 3.2.2. Verwendung einer generellen Diagonalperturbation 3.3. Iterative Lösungsverfahren 3.4. Faktorisierungsverfahren 3.4.1. Cholesky-Faktorisierung 3.4.2. LU-Faktorisierung 3.4.3. Fillin-Reduktion durch Permutation 3.4.4. Fazit 3.5. Direkte Lösungsverfahren 3.6. Verwendung externer Gleichungssystem-Löser 3.7. Zusammenfassung 4. Implementierung 4.1. Aufbau von MORPACK 4.2. Anforderungen an Reduktions-Funktionen 4.3. Eigenschaften und Optionen der KSM-Funktionen 4.3.1. Arnoldi-Funktion erster Ordnung 4.3.2. Rationale SOAR-Funktionen 4.4. Korrelationskriterien 4.4.1. Eigenfrequenzbezogen 4.4.2. Eigenvektorbezogen 4.4.3. Übertragungsfunktionsbezogen 4.5. Lösungsfunktionen linearer Gleichungssysteme 4.5.1. Anforderungen und Aufbau 4.5.2. Verwendung der Gleichungssystem-Löser 4.5.3. Hinweise zur Implementierung von Gleichungssystem-Lösern 5. Anwendung 5.1. Versuchsmodelle 5.1.1. Testmodelle kleiner Dimension 5.1.2. Getriebegehäuse 5.1.3. Treibsatzwelle 5.2. Validierung der Reduktionsmethoden an kleinem Modell 5.2.1. Modifizierte Arnoldi-Funktion erster Ordnung 5.2.2. Rationale SOAR-Funktionen 5.2.3. Zusammenfassung 5.3. Anwendung der KSM auf große Modelle 5.3.1. Getriebegehäuse 5.3.2. Treibsatzwelle 5.4. Auswertung 6. Zusammenfassung und Ausblick 6.1. Zusammenfassung 6.2. Ausblick / FEM-MKS-coupling requires model order reduction methods to simulate the frequency response of mechanical structures using a smaller reduced representation of the original system. Most of the rational Krylov-subspace methods are based on Arnoldi-algorithms. They allow to represent the frequency response in freely selectable, wide frequency ranges. Subject of this thesis is the implementation of an error-controlled model order reduction based on Krylov-subspace methods and the application to a mechanical model. Based on the MORPACK software, a first-order-Arnoldi function is extended by an interpolative start vector, the elimination of rigid body motion and a reorthogonalization. Containing these functions, a rational, interpolative Second Order Arnoldi (SOAR) method is designed that works well compared to a rational Block-SOAR-method. Interpolative equal weighting is used. The first-order-Arnoldi method requires less computational effort compared to the rational, interpolative SOAR that is able to compute a smaller reduction size for same frequency range of interest. The methods are applied to the models of a frame, a gear case and a drive shaft. Error-control is realized by eigenfrequency-based H2-integration-limit and relative H2-error based on the frequency response function. For solving linear systems of equations in Matlab, solver functions based on permutation and factorization are implemented.:1. Einleitung 1.1. Motivation 1.2. Einordnung 1.3. Aufbau der Arbeit 2. Theorie 2.1. Simulationsmethoden 2.1.1. Finite Elemente Methode 2.1.2. Mehrkörpersimulation 2.1.3. Kopplung der Simulationsmethoden 2.2. Zustandsraumdarstellung und Reduktion 2.3. Krylov Unterraum Methoden 2.4. Arnoldi-Algorithmen erster Ordnung 2.5. Arnoldi-Algorithmen zweiter Ordnung 2.6. Korrelationskriterien 2.6.1. Eigenfrequenzbezogene Kriterien 2.6.2. Eigenvektorbezogene Kriterien 2.6.3. Übertragungsfunktionsbezogene Kriterien 2.6.4. Fehlerbewertung 2.6.5. Anwendung auf Systeme sehr großer Dimension 3. Numerik linearer Gleichungssysteme 3.1. Grundlagen 3.2. Singularität der Koeffizientenmatrix 3.2.1. Randbedingungen des Systems 3.2.2. Verwendung einer generellen Diagonalperturbation 3.3. Iterative Lösungsverfahren 3.4. Faktorisierungsverfahren 3.4.1. Cholesky-Faktorisierung 3.4.2. LU-Faktorisierung 3.4.3. Fillin-Reduktion durch Permutation 3.4.4. Fazit 3.5. Direkte Lösungsverfahren 3.6. Verwendung externer Gleichungssystem-Löser 3.7. Zusammenfassung 4. Implementierung 4.1. Aufbau von MORPACK 4.2. Anforderungen an Reduktions-Funktionen 4.3. Eigenschaften und Optionen der KSM-Funktionen 4.3.1. Arnoldi-Funktion erster Ordnung 4.3.2. Rationale SOAR-Funktionen 4.4. Korrelationskriterien 4.4.1. Eigenfrequenzbezogen 4.4.2. Eigenvektorbezogen 4.4.3. Übertragungsfunktionsbezogen 4.5. Lösungsfunktionen linearer Gleichungssysteme 4.5.1. Anforderungen und Aufbau 4.5.2. Verwendung der Gleichungssystem-Löser 4.5.3. Hinweise zur Implementierung von Gleichungssystem-Lösern 5. Anwendung 5.1. Versuchsmodelle 5.1.1. Testmodelle kleiner Dimension 5.1.2. Getriebegehäuse 5.1.3. Treibsatzwelle 5.2. Validierung der Reduktionsmethoden an kleinem Modell 5.2.1. Modifizierte Arnoldi-Funktion erster Ordnung 5.2.2. Rationale SOAR-Funktionen 5.2.3. Zusammenfassung 5.3. Anwendung der KSM auf große Modelle 5.3.1. Getriebegehäuse 5.3.2. Treibsatzwelle 5.4. Auswertung 6. Zusammenfassung und Ausblick 6.1. Zusammenfassung 6.2. Ausblick

Discusses the structure and topology of dynamic memory chips, the impact of the environment on the information storage process, ways to control and correct errors that occur during storage of data; in Matlab / Simulink, a model is constructed of dynamic memory cells in conditions close to the natural background radiation; a comparative analysis of noise immunity in the absence of storage and use of the Hamming code. / Рассматриваются структура и топология микросхем динамической памяти, влияние внешней среды на процесс хранения информации, способы контроля и исправления ошибок, возникающие при хранении данных; в среде Matlab/Simulink построена модель ячейки динамической памяти в условиях приближенных к естественному радиационному фону; проведен сравнительный анализ помехоустойчивости хранения данных при отсутствии и использовании кода Хемминга.