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 19 of 19 for “"Rank reduction"”.
-
Rank Reduction with Convex Constraints
This thesis addresses problems which require low-rank solutions under convex constraints. In particular, the focus lies on model reduction of positive systems, as well as finite dimensional optimization problems that are convex, apart from a low-rank constraint. Traditional model reduction …
-
Rank reduction methods in electronic structure theory
… chemistry is plagued by the presence of high-rank quantities, stemming from the N-body nature of the electronic Schrödinger equation. These high-rank quantities present a significant mathematical and computational barrier to the computation of chemical observables, and also drastically …
-
3D data interpolation and denoising by an adaptive weighting rank-reduction method using singular spectrum analysis
… use of SSA in time series is described. SSA as a rank-reduction method for 2-D and 3-D seismic data interpolation is studied. The rank-reduction step of SSA is improved by proposing an adaptive rank-reduction method. To improve the algorithm in denoising an adaptive weighting rank-reduction …
-
THE SIMILARITY RENORMALIZATION GROUP AND FACTORIZATION TECHNIQUES
… techniques as a means to identify low- rank structures in nuclear interactions and many-body methods, which we aim to leverage in order to reduce computational cost and memory requirements of modern nuclear many-body calculations.Using the Singular Value Decomposition (SVD), we show that …
-
Low-Rank Tensor Approximation in post Hartree-Fock Methods
… (tensor decomposition) and a method for a low rank approximation (rank reduction) of the two-electron integrals in the AO basis are investigated. The decisive quantity for the applicability of the CP format is the scaling of the rank with increasing system and basis set size. The memory …
-
Optimizing computational kernels in quantum chemistry
Density fitting is a rank reduction technique popularly used in quantum chemistry in order to reduce the computational cost of evaluating, transforming, and processing the 4-center electron repulsion integrals (ERIs). By utilizing the resolution of the identity technique, density fitting reduces …
-
Phasor Measurement Unit Data-Based Steady State and Dynamic Model Estimation
… programming. Second, PMU measurements are ranked for oscillation monitoring based on two approaches: oscillation mode observability and Prony analysis. Further, the principles, multi-channel data handling, and noise resilience techniques of three eigenvalue identification methods used in …
-
Beamforming and Direction of Arrival Estimation Based on Vector Sensor Arrays
… problem is proposed. The algorithm applies the rank reduction method to use two 2-D searches instead of a 4-D search to estimate the joint parameters. Moreover, an analysis is given to introduce the difference using crossed-dipole sensor array and tripole sensor array, which indicates that …
-
Computational modeling of the injection molding process: open-source methods and data-driven fiber orientation
… the development of an orientation model based on rank-reduction autoencoders, enabling compact yet expressive representations of the orientation state while reducing computational burden. Overall, this work contributed to the digital transformation of thermoplastics processing by delivering …
-
Layered Space-Time Structure for MIMO-OFDM Systems
… for layered systems. For MIMO-OFDM systems, rank reduction by some linear transform matrix is necessary for channel estimation. In the proposed research, we propose a channel estimation algorithm for MIMO-OFDM systems, which uses the optimum low-rank channel approximation obtained by tracking …
-
Detection and classification of vibrating objects in SAR images
… data is pre-processed with the Hankel rank reduction (HRR) clutter-suppression technique.
-
Sparse and Low-rank Constrained Optimization: Formulations, Theory, and Algorithms
Sparsity and low rank are fundamental concepts in data reduction. Sparse and low-rank constrained optimization has benefited various application areas by effectively managing the rapid growth of big data, including machine learning, finance, cloud computing, and healthcare. Despite its versatility, …
-
Network selection, information filtering and scalable computation
… values. This promotes additional sparsity beyond rank reduction. Computationally, we design methods based on a ``decomposition and combination'' strategy, to break large-scale optimization into many small subproblems to solve in a recursive and parallel manner. On this basis, we implement the …
-
Transmit Beamforming for Multi-User Integrated Sensing and Communication Systems
This thesis investigates the design of beamforming vectors for integrated sensing and communication (ISAC) systems, where a base station transmits a joint signal to communicate information to multiple users while performing a sensing task. The state-of-the-art methods for tackling this problem are …
-
A Novel Approach for Simulation-Based Power Estimation and Joint Modeling of Microbiome Counts
… taxa separately. We propose the Reduced Rank Multivariate Mixed Model (RRMM), which jointly models all taxa while accounting for correlations within subjects (Chapter 5). Due to the high dimensionality of microbiome data, modeling the correlations between taxa through a full …
-
Development of efficient and low-scaling coupled cluster and algebraic diagrammatic construction methods
… application to molecular systems of interest. Rank-reduction techniques for the electron-repulsion integrals (ERIs) paved the way for efficient implementations based on the canonical molecular orbitals (MOs), and their combination with the Laplace transformation technique as well as the …
-
Millimetre Wave for Fifth Generation of Wireless Communications
… angle of arrival at the BS. This could cause rank reduction in some MIMO system. An outdoor to indoor measurement campaign at 24 GHz emulating the satellite to in- door propagation channel was presented. The results are applicable to the satellite/mo- bile co-existence problem as well as …
-
Adaptive detection in ultrawide bandwidth wireless communication systems
… the complexity of the RLS adaptive detector, rank-reduction techniques are introduced. With the aid of reduced-rank techniques, the filter size can be efficiently reduced, which in turn reduces the number of parameters required to be estimated. Consequently, the convergence speed, tracking …
-
Resource allocation and secure communication design in simultaneous wireless information and power transfer systems
… relaxation (SDR) approach. In addition, a rank-one proof presents that the solution generated by the relaxed problem is optimal to the original problem. Second, a security issue about the SWIPT system is investigated in a cooperative network in the presence of potential eavesdroppers. The …