Дисертації з теми "Matrix Analysis and Positivity"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Matrix Analysis and Positivity".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Lecharlier, Loïc. "Blind inverse imaging with positivity constraints." Doctoral thesis, Universite Libre de Bruxelles, 2014. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209240.
Повний текст джерелаDoctorat en Sciences
info:eu-repo/semantics/nonPublished
Fortmann, Joshua. "Domestic Violence as a Risk Factor in HIV Positivity: An Analysis of Mozambican Women." Digital Commons @ East Tennessee State University, 2021. https://dc.etsu.edu/asrf/2021/presentations/11.
Повний текст джерелаChang, Xiao-Wen. "Perturbation analysis of some matrix factorizations." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape16/PQDD_0023/NQ29906.pdf.
Повний текст джерелаChang, Xiao-Wen 1963. "Pertubation analysis of some matrix factorizations." Thesis, McGill University, 1997. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=41999.
Повний текст джерелаWe develop a new approach, the so called 'matrix-vector equation' approach, to obtain sharp results and true condition numbers for the above problems. Our perturbation bounds give significant improvements on previous results, and could not be sharper. Also we use the so called 'matrix equation' approach originated by G. W. Stewart to derive perturbation bounds that are usually weaker but easier to interpret. This approach allows efficient computation of satisfactory estimates for the true condition numbers derived by our approach. The combination of these two approaches gives a powerful understanding of these problems. Although first-order perturbation bounds are satisfactory for all but the most delicate work, we also give some rigorous perturbation bounds for some factorizations.
We show that the condition of many such factorizations is significantly improved by the standard pivoting strategies (except the L factor in the LU factorization), and provide firmly based theoretical explanations as to why this is so. This extremely important information is very useful for designing more reliable matrix algorithms.
Our approach is a powerful general tool, and appears to be applicable to the perturbation analysis of any matrix factorization.
El, Zant Samer. "Google matrix analysis of Wikipedia networks." Thesis, Toulouse, INPT, 2018. http://www.theses.fr/2018INPT0046/document.
Повний текст джерелаThis thesis concentrates on the analysis of the large directed network representation of Wikipedia.Wikipedia stores valuable fine-grained dependencies among articles by linking webpages togetherfor diverse types of interactions. Our focus is to capture fine-grained and realistic interactionsbetween a subset of webpages in this Wikipedia network. Therefore, we propose to leverage anovel Google matrix representation of the network called the reduced Google matrix. This reducedGoogle matrix (GR) is derived for the subset of webpages of interest (i.e. the reduced network). Asfor the regular Google matrix, one component of GR captures the probability of two nodes of thereduced network to be directly connected in the full network. But unique to GR, anothercomponent accounts for the probability of having both nodes indirectly connected through allpossible paths in the full network. In this thesis, we demonstrate with several case studies that GRoffers a reliable and meaningful representation of direct and indirect (hidden) links of the reducednetwork. We show that GR analysis is complementary to the well-known PageRank analysis andcan be leveraged to study the influence of a link variation on the rest of the network structure.Case studies are based on Wikipedia networks originating from different language editions.Interactions between several groups of interest are studied in details: painters, countries andterrorist groups. For each study, a reduced network is built, direct and indirect interactions areanalyzed and confronted to historical, geopolitical or scientific facts. A sensitivity analysis isconducted to understand the influence of the ties in each group on other nodes (e.g. countries inour case). From our analysis, we show that it is possible to extract valuable interactions betweenpainters, countries or terrorist groups. Network of painters with GR capture art historical fact sucha painting movement classification. Well-known interactions of countries between major EUcountries or worldwide are underlined as well in our results. Similarly, networks of terrorist groupsshow relevant ties in line with their objective or their historical or geopolitical relationships. Weconclude this study by showing that the reduced Google matrix analysis is a novel powerfulanalysis method for large directed networks. We argue that this approach can find as well usefulapplication for different types of datasets constituted by the exchange of dynamic content. Thisapproach offers new possibilities to analyze effective interactions in a group of nodes embedded ina large directed network
Diar, Fares Sonja. "All is well : An analysis of positivity through adjectives in two contemporary New Age self-help books." Thesis, Mälardalens högskola, Akademin för utbildning, kultur och kommunikation, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-40144.
Повний текст джерелаBarnett, John D. (John Derek) 1970. "Convex matrix factorization for gene expression analysis." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/30098.
Повний текст джерелаIncludes bibliographical references (p. 68-71).
A method is proposed for gene expression analysis relying upon convex matrix factorization (CMF). In CMF, one of the matrix factors has a convexity constraint, that is, each row is nonnegative and sums to one, and hence can be interpreted as a probability distribution. This is motivated biologically by expression data resulting from a mixture of different cell types. This thesis investigates implementing CMF with various constraints applied to the expression matrix, and applies the technique to a problem in analysis of the cell cycle and two problems in cancer classification.
by John D. Barnett.
S.M.
Lee, Shi-Wei. "Analysis of Composite Laminates with Matrix Cracks." Thesis, Virginia Tech, 1987. http://hdl.handle.net/10919/45539.
Повний текст джерелаMaster of Science
Vaandrager, Paul. "Jost-matrix analysis of nuclear scattering data." Thesis, University of Pretoria, 2020. http://hdl.handle.net/2263/75605.
Повний текст джерелаThesis (PhD)--University of Pretoria, 2020.
National Research Foundation (NRF)
Physics
PhD
Unrestricted
Knox, Andrew Ramsay. "Design and analysis of the magnetic matrix display." Connect to electronic version, 2000. http://hdl.handle.net/1905/187.
Повний текст джерелаKnox, Andrew R. "Design and analysis of the magnetic matrix display." Thesis, University of Glasgow, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.325450.
Повний текст джерелаYounes, Imad Sabeh. "Transfer matrix analysis of frame-shear wall systems." Thesis, University of Southampton, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.280922.
Повний текст джерелаRoberts, Jeremy Alyn. "Advanced response matrix methods for full core analysis." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/87490.
Повний текст джерелаCataloged from PDF version of thesis.
Includes bibliographical references (pages 195-200).
Modeling full reactor cores with high fidelity transport methods is a difficult task, requiring the largest computers available today. This thesis presents work on an alternative approach using the eigenvalue response matrix method (ERMM). The basic idea of ERMM is to decompose a reactor spatially into local "nodes." Each node represents an independent fixed source transport problem, and the nodes are linked via approximate boundary conditions to reconstruct the global problem using potentially many fewer explicit unknowns than a direct fine mesh solution. This thesis addresses several outstanding issues related to the ERMM based on deterministic transport. In particular, advanced transport solvers were studied for application to the relatively small and frequently repeated problems characteristic of response function generation. This includes development of preconditioners based on diffusion for use in multigroup Krylov linear solvers. These new solver combinations are up to an order of magnitude faster than competing algorithms. Additionally, orthogonal bases for space, angle, and energy variables were investigated. For the spatial variable, a new basis set that incorporates a shape function characteristic of pin assemblies was found to reduce significantly the error in representing boundary currents. For the angular variable, it was shown that bases that conserve the partial current at a boundary perform very well, particularly for low orders. For the deterministic transport used in this work, such bases require use of specialized angular quadratures. In the energy variable, it was found that an orthogonal basis constructed using a representative energy spectrum provides an accurate alternative to few group calculations. Finally, a parallel ERMM code Serment was developed, incorporating the transport and basis development along with several new algorithms for solving the response matrix equations, including variants of Picard iteration, Steffensen's method, and Newton's method. Based on results from several benchmark models, it was found that an accelerated Picard iteration provides the best performance, but Newton's method may be more robust. Furthermore, initial scoping studies demonstrated good scaling on an [omicron](100) processor machine.
by Jeremy Alyn Roberts.
Ph. D.
Gong, Liyun. "Nonnegative matrix analysis for data clustering and compression." Thesis, University of Liverpool, 2015. http://livrepository.liverpool.ac.uk/2007800/.
Повний текст джерелаPayseur, Scott. "Essays in realized covariance matrix estimation /." Thesis, Connect to this title online; UW restricted, 2008. http://hdl.handle.net/1773/7410.
Повний текст джерелаKardell, Marcus. "Total positivity and oscillatory kernels : An overview, and applications to the spectral theory of the cubic string." Thesis, Linköpings universitet, Tillämpad matematik, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-58005.
Повний текст джерелаCadima, Jorge Filipe Campinos Landerset. "Topics in descriptive Principal Component Analysis." Thesis, University of Kent, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.314686.
Повний текст джерелаNeretin, Yurii A., and neretin@main mccme rssi ru. "Matrix Balls, Radial Analysis of Berezin Kernels, and Hypergeometric." ESI preprints, 2000. ftp://ftp.esi.ac.at/pub/Preprints/esi974.ps.
Повний текст джерелаLi, Yuemeng. "Spectral Analysis of Directed Graphs using Matrix Perturbation Theory." Thesis, The University of North Carolina at Charlotte, 2017. http://pqdtopen.proquest.com/#viewpdf?dispub=10618933.
Повний текст джерелаThe spectral space of the adjacency matrix contains important structural information of a given network (graph), where such information can be leveraged in developing a variety of algorithms in applications such as graph partition, structural hierarchy discovery, and anomaly detection. Although many prominent works have laid the foundation for studying the graph spectra, it is still challenging to analyze the spectral space properties for directed graphs due to possible complex valued decompositions. Matrix factorization techniques such as Laplacian and normalized Laplacian have been widely adopted to study the associated spectral spaces, but network structural properties may not be well preserved in those spectral spaces due to transformations.
In this dissertation work, we explore the adjacency eigenspace of directed graphs using matrix perturbation theory and examine the relationships between graph structures and the spectral projection patterns. We study how to detect dominant structures such as clusters or anomalous nodes by establishing a connection between the connectivity of nodes and the geometric relationships in the adjacency eigenspace. We leverage selected key results from perturbation theory, linear algebra and graph theory as our tools to derive theoretical results that help to elaborate observed graph spectral projection patterns. In order to validate our theoretical results, novel algorithms including spectral clustering for both signed and unsigned networks, asymmetry analysis for network dominance, and anomaly analysis for streaming network data are developed and tested on both synthetic and real datasets. The empirical evaluation results suggest that our algorithms performs better when compared with existing state-of-the-art methods.
Phelan, Thomas Joseph. "GENETIC AND MOLECULAR ANALYSIS OF PLANT NUCLEAR MATRIX PROTEINS." NCSU, 2001. http://www.lib.ncsu.edu/theses/available/etd-20011104-233111.
Повний текст джерелаPHELAN, THOMAS JOSEPH, Genetic and Molecular Analysis of Plant Nuclear Matrix Proteins. (Under the direction of Steven L. Spiker.)The eukaryotic nucleus is composed of DNA, RNA and protein, encapsulated by a nuclear envelope. DNA is compacted up to ten thousand times in order to be packaged into the nucleus. The nucleus must maintain order in the presence of a very high density and variety of protein and RNA. The nuclear matrix is a proteinaceous network thought to provide structure and organization to the nucleus. We believe that relatively stable interactions of nuclear molecules with the nuclear matrix are key to organization of the nucleus. Numerous "Matrix Attachment Region" DNA elements (MARs), have been isolated from plants, animals, and fungi. Evidence suggests that these MARs attach to the nuclear matrix, delimiting loops of chromosomal DNA. In studies of transgenic plants and animals, MARs have been shown to give important advantages to organisms transformed with genes flanked by these elements. Unlike most DNA elements, no specific sequence elements have been identified in MAR DNAs. Partly due to the insolubility of the matrix, and to the heterogeneity of MAR DNA, very few of the protein components of the nuclear matrix have been identified. This work presents analysis the proteins of the plant nuclear matrix. We have characterized a set of related proteins from the model plant Arabidopsis that associate with MAR DNA in vitro. These proteins appear to be similar to the NOP56/NOP58 family of proteins previously identified in several eukaryotic organisms. The NOP56/NOP58 proteins are thought to be involved in modifications of ribosomal RNA. Binding studies presented in this work suggest that these plant proteins may participate in RNA/DNA/protein complexes in the nucleus.
Peterson, Anders. "The Origin-Destination Matrix Estimation Problem : Analysis and Computations." Doctoral thesis, Norrköping : Dept. of Science and Technology, Linköpings universitet, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-8859.
Повний текст джерелаAl-Mutawah, Jameela. "Using matrix isolation FTIR for trace atmospheric gas analysis." Thesis, University of Reading, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.270218.
Повний текст джерелаSchutz, James Branch. "Test methods and analysis for glass-ceramic matrix composites." Thesis, Massachusetts Institute of Technology, 1991. http://hdl.handle.net/1721.1/13711.
Повний текст джерелаSthapit, Akshay R. (Akshay Ratna) 1978. "An object oriented approach to matrix analysis of structures." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/84810.
Повний текст джерелаWakasa, Yuji. "Control System Analysis and Synthesis Based on Matrix Inequalities." 京都大学 (Kyoto University), 2000. http://hdl.handle.net/2433/151475.
Повний текст джерелаKyoto University (京都大学)
0048
新制・論文博士
博士(情報学)
乙第10519号
論情博第6号
新制||情||4(附属図書館)
UT51-2000-P686
(主査)教授 山本 裕, 教授 磯 祐介, 教授 片山 徹
学位規則第4条第2項該当
寛康, 阿部, and Hiroyasu Abe. "Extensions of nonnegative matrix factorization for exploratory data analysis." Thesis, https://doors.doshisha.ac.jp/opac/opac_link/bibid/BB13001149/?lang=0, 2017. https://doors.doshisha.ac.jp/opac/opac_link/bibid/BB13001149/?lang=0.
Повний текст джерелаNonnegative matrix factorization (NMF) is a matrix decomposition technique to analyze nonnegative data matrices, which are matrices of which all elements are nonnegative. In this thesis, we discuss extensions of NMF for exploratory data analysis considering common features of a real nonnegative data matrix and an easy interpretation. In particular, we discuss probability distributions and divergences for zero-inflated data matrix and data matrix with outliers, two-factor vs. three-factor, and orthogonal constraint to factor matrices.
博士(文化情報学)
Doctor of Culture and Information Science
同志社大学
Doshisha University
Caceres, Arsenio. "Local damage analysis of fiber reinforced polymer matrix composites." Morgantown, W. Va. : [West Virginia University Libraries], 1998. http://etd.wvu.edu/templates/showETD.cfm?recnum=328.
Повний текст джерелаTitle from document title page. Document formatted into pages; contains x, 107 p. : ill. (some col.) Includes abstract. Includes bibliographical references (p. 104-107).
Wang, Peng. "IMPEDANCE-TO-SCATTERING MATRIX METHOD FOR LARGE SILENCER ANALYSIS." UKnowledge, 2017. https://uknowledge.uky.edu/me_etds/102.
Повний текст джерелаDong, Kai. "High-dimensional covariance matrix estimation with application to Hotelling's tests." HKBU Institutional Repository, 2015. https://repository.hkbu.edu.hk/etd_oa/191.
Повний текст джерелаIslam, Md Sajedul. "Matrix Dynamic Models for Structured Populations." Digital Commons @ East Tennessee State University, 2019. https://dc.etsu.edu/etd/3645.
Повний текст джерелаShaver, Ryan J. "Analysis of the Tapered Transition Waveguide." Wright State University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=wright1431711280.
Повний текст джерелаAmadeo, Lily. "Large Scale Matrix Completion and Recommender Systems." Digital WPI, 2015. https://digitalcommons.wpi.edu/etd-theses/1021.
Повний текст джерелаGálvez, Sánchez José-Luis. "Analysis of bidirectional switch power modules for matrix converter application." Doctoral thesis, Universitat Autònoma de Barcelona, 2017. http://hdl.handle.net/10803/457719.
Повний текст джерелаThere is a wide and increasing demand in industrial applications which require bidirectional transfer of power between the AC utility and the load, and vice versa such as: rolling mills, elevators, centrifuges, escalators, renewable energies (wind turbines, photo-voltaic, fuel-cells; smart-grids), electric traction, etc. The possibility of performing a direct AC-AC conversion with the absence of a DC link is a fact thanks to the Matrix Converter (MC) topology. The typical configuration of a MC is based on nine bidirectional switches (BDSs) required to directly connect the three input phases of an AC grid with the three output phases of a load (typically, a motor). Controlling the BDSs in a suitable way, a variable amplitude and frequency can be obtained at the output. Consequently, the key element of the MC implementation is the controlled BDS which must be able to conduct current and block voltage in both polarities (four quadrant I-V operation) and to operate at relatively high switching frequencies. The aim of this thesis is the analysis of the commutation processes in BDSs, the prediction of their power dissipation in typical MC operation and the development of a new controlled bidirectional switch module which integrates the power stage functionality with the intelligence in one component to enhance the modularity and feasibility of MC applications First of all it is important to understand how behave the BDSs within a MC. A SPICE simulation work of a simplified two-phase to single-phase MC was performed in order to analyse the commutation phenomena involved between BDSs. Hard and soft commutations are undergone by the different power devices depending on the voltage across the BDS and the direction of the current through it. Understanding the details of the switching processes allow an optimum definition of the commutation strategies within BDSs and modelling of the switching power losses. The static and dynamic characteristics of several power devices of different technologies used in BDS implementations are also analysed. A switching test circuit based on the aforementioned two-phase to single-phase MC was fabricated for this purpose. This MC test circuit allowed testing discrete BDSs as well as integrated power modules sharing the same power stage and control board. Based on the extracted measured data of the BDSs devices, their conduction and their switching losses were accurately modelled. This thesis describes also the implementation of a computational method to evaluate the conduction and switching losses (hard and soft types) of the power devices within the BDS. Based on the conduction and switching losses models, the power losses of the semiconductor devices are calculated depending on different operating condition of the MC such as the modulation algorithm, the output frequency, the output to input voltage ratio, the load power factor and the switching frequency. All these studies resulted in a practical tool to help the converter designer to select the optimum power devices for a given application and to predict in an accurate way the semiconductors power losses in order to size and implement the suitable cooling system. Finally in this work, an integrated bidirectional switch intelligent power module (BDS-IPM) prototype is designed, built and tested in a three-phase to one-phase MC in order to take a step forward in the practical implementation of MCs. The BDS-IPM is itself a complex power electronics system since many disciplines converge in it: power semiconductor devices, thermal power management, device level control (i.e. gate drive circuits) and high level control (i.e. current commutation strategy implementation, active protection issues).
Afsari, Bijan. "Gradient flow based matrix joint diagonalization for independent component analysis." College Park, Md. : University of Maryland, 2004. http://hdl.handle.net/1903/1352.
Повний текст джерелаThesis research directed by: Electrical Engineering. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
Juozapavicius, Ausrius. "Density-Matrix Renormalization-Group Analysis of Kondo and XY models." Doctoral thesis, KTH, Physics, 2001. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-3260.
Повний текст джерелаPeacock, Matthew James McKenzie. "Random Matrix Theory Analysis of Fixed and Adaptive Linear Receivers." University of Sydney, 2006. http://hdl.handle.net/2123/985.
Повний текст джерелаThis thesis considers transmission techniques for current and future wireless and mobile communications systems. Many of the results are quite general, however there is a particular focus on code-division multiple-access (CDMA) and multi-input multi-output (MIMO) systems. The thesis provides analytical techniques and results for finding key performance metrics such as signal-to-interference and noise power ratios (SINR) and capacity. This thesis considers a large-system analysis of a general linear matrix-vector communications channel, in order to determine the asymptotic performance of linear fixed and adaptive receivers. Unlike many previous large-system analyses, these results cannot be derived directly from results in the literature. This thesis considers a first-principles analytical approach. The technique unifies the analysis of both the minimum-mean-squared-error (MMSE) receiver and the adaptive least-squares (ALS) receiver, and also uses a common approach for both random i.i.d. and random orthogonal precoding. The approach is also used to derive the distribution of sums and products of free random matrices. Expressions for the asymptotic SINR of the MMSE receiver are derived, along with the transient and steady-state SINR of the ALS receiver, trained using either i.i.d. data sequences or orthogonal training sequences. The results are in terms of key system parameters, and allow for arbitrary distributions of the power of each of the data streams and the eigenvalues of the channel correlation matrix. In the case of the ALS receiver, we allow a diagonal loading constant and an arbitrary data windowing function. For i.i.d. training sequences and no diagonal loading, we give a fundamental relationship between the transient/steady-state SINR of the ALS and the MMSE receivers. We demonstrate that for a particular ratio of receive to transmit dimensions and window shape, all channels which have the same MMSE SINR have an identical transient ALS SINR response. We demonstrate several applications of the results, including an optimization of information throughput with respect to training sequence length in coded block transmission.
McCutcheon, Michael Warren. "Analysis of a 2-3 exchange symmetric neutrino mass matrix." Thesis, McGill University, 2002. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=79048.
Повний текст джерелаMüller, Axel. "Random Matrix Analysis of Future Multi Cell MU-MIMO Networks." Thesis, Supélec, 2014. http://www.theses.fr/2014SUPL0021/document.
Повний текст джерелаFuture wireless communication systems will need to feature multi cellular heterogeneous architectures consisting of improved macro cells and very dense small cells, in order to support the exponentially rising demand for physical layer throughput. Such structures cause unprecedented levels of inter and intra cell interference, which needs to be mitigated or, ideally, exploited in order to improve overall spectral efficiency of the communication network. Techniques like massive multiple input multiple output (MIMO), cooperation, etc., that also help with interference management, will increase the size of the already large heterogeneous architectures to truly enormous networks, that defy theoretical analysis via traditional statistical methods.Accordingly, in this thesis we will apply and improve the already known framework of large random matrix theory (RMT) to analyse the interference problem and propose solutions centred around new precoding schemes, which rely on large system analysis based insights. First, we will propose and analyse a new family of precoding schemes that reduce the computational precoding complexity of base stations equipped with a large number of antennas, while maintaining most of the interference mitigation capabilities of conventional close-to-optimal regularized zero forcing. Second, we will propose an interference aware linear precoder, based on an intuitive trade-off and recent results on multi cell regularized zero forcing, that allows small cells to effectively mitigate induced interference with minimal cooperation. In order to facilitate utilization of the analytic RMT approach for future generations of interested researchers, we will also provide a comprehensive tutorial on the practical application of RMT in communication problems
Cheng, Yongming 1964. "Dynamic stiffness and transfer matrix analysis of marine riser vibration." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/107859.
Повний текст джерелаMajundar, Pradip. "Analysis of desiccant cooling systems using advanced desiccant matrix structure." access full-text online access from Digital Dissertation Consortium, 1986. http://libweb.cityu.edu.hk/cgi-bin/er/db/ddcdiss.pl?8707884.
Повний текст джерелаPeacock, Matthew James McKenzie. "Random Matrix Theory Analysis of Fixed and Adaptive Linear Receivers." Thesis, The University of Sydney, 2005. http://hdl.handle.net/2123/985.
Повний текст джерелаZHOU, SIYUAN. "Finite Random Matrix Theory Analysis of Multiple Antenna Communication Systems." Doctoral thesis, Politecnico di Torino, 2015. http://hdl.handle.net/11583/2601779.
Повний текст джерелаKuang, Da. "Nonnegative matrix factorization for clustering." Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/52299.
Повний текст джерелаLawrence, David Peter. "Skills analysis aboard ships." Thesis, University of Plymouth, 1988. http://hdl.handle.net/10026.1/1717.
Повний текст джерелаWillison, Peter A. "Transmission line matrix modelling of underwater acoustic propagation." Thesis, University of Essex, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.334426.
Повний текст джерелаKwizera, Petero. "Matrix Singular Value Decomposition." UNF Digital Commons, 2010. http://digitalcommons.unf.edu/etd/381.
Повний текст джерелаZhou, Ke. "Extending low-rank matrix factorizations for emerging applications." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/50230.
Повний текст джерелаMartin, David Royce. "Quadrature Approximation of Matrix Functions, with Applications." Kent State University / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=kent1337658656.
Повний текст джерелаHe, Yihong. "Matrix-dominated constitutive laws for composite materials." Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/34666.
Повний текст джерелаBelton, Alexander C. R. "A matrix formulation of quantum stochastic calculus." Thesis, University of Oxford, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.301800.
Повний текст джерела