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 20 of 62 for “"Matrix functions"”.
-
Matrix functions in multiplex network analysis
The fast and accurate approximation of matrix functions and their action on vectors is a core problem in numerical linear algebra. Prominently, the matrix exponential fueled research on matrix functions due to applications in differential equations. Krylov subspace methods are among the most …
-
Lanczos-based methods for matrix functions
… study Lanczos-based methods for tasks involving matrix functions. We begin by resurfacing a range of ideas regarding matrix-free quadrature which, to the best of our knowledge, have not been treated simultaneously. This enables the development of a unified perspective from which a number of …
-
Methods for Estimating The Diagonal of Matrix Functions
… computing the diagonal of a function of a matrix, Diag(f(A)) where A is sparse matrix, and f is some function. Unfortunately, when A is large, this can be computationally prohibitive. Because of this, many applications resort to Monte Carlo methods. However, Monte Carlo methods tend to …
-
Zero-pole interpolation of nonregular rational matrix functions
… structure of a not necessarily regular rational matrix function W is described in terms of pairs of matrices-right and left pole pairs. The concept of orthogonality in R<sup>n</sup> is investigated. Using this concept, the right and left zero structure of a rational matrix function W is described …
-
Estimating Norms of Matrix Functions using Numerical Ranges
… conjecture: for any polynomial p and any square matrix A, the spectral norm of the matrix p(A) is at most double of the supremum norm of the polynomial p on the numerical range of the matrix A.
-
Interpolation by rational matrix functions with minimal McMillan degree
Interpolation conditions on rational matrix functions expressed in terms of residues are studied. As a compact way of expressing tangential interpolation conditions of arbitrarily high multiplicity possibly from both sides simultaneously, interpolation conditions are represented in terms of …
-
Thematic indices and superoptimal singular values of matrix functions
Thesis (Ph. D.)--Michigan State University. Mathematics, 2009
-
Linear transformations on matrices : the invariance of certain matrix functions
Supervisor: Dr. B. N. MOYLS Let Mm,n (F) denote the set of all mxn matrices over the algebraically closed field F of characteristic 0, and let Mn (F) denote Mn,n (F) . Let E₃ (A) denote the third elementary symmetric function of the eigenvalues of A; let Rk = {A € Mm,n (F) : rank of A = k} ; and …
-
The computation of matrix functions in particular, the matrix exponential
Matrix functions in general are an interesting area in matrix analysis and are used in many areas of linear algebra and arise in numerous applications in science and engineering. We consider how to define matrix functions and how to compute matrix functions. To be concrete, we pay particular …
-
A graph theoretic approach to matrix functions and quantum dynamics
… of matrices, and can be solved by computing functions of these matrices. For example, in quantum mechanics, the coherent dynamics of physical systems is described by the matrix exponential of their Hamiltonian. In state of the art experiments, one can now observe such unitary evolution of …
-
Graph diffusions and matrix functions: fast algorithms and localization results
… Whereas many standard graph algorithms rely on matrix-vector operations that require exploring the entire graph, this thesis is concerned with graph algorithms that are local (that explore only the graph region near the nodes of interest) as well as the localized behavior of global algorithms. …
-
Matrices which, under row permutations, give specified values of certain matrix functions
… t = r+2, …, n} and let I denote the identity matrix in Sn. We shall denote the n-lst elementary symmetric function of the eigenvalues of A by [formula omitted]. In this thesis, we pose the following problems: 1. Let H be a subset of Sn and a1, …, ak be k-distinct real numbers. Determine the …
-
Deep Learning Approximation of Matrix Functions: From Feedforward Neural Networks to Transformers
… the use of transformers for approximating matrix functions, which are mappings that extend scalar functions to matrices. These functions are ubiquitous in scientific applications, from continuous-time Markov chains (matrix exponential) to stability analysis of dynamical systems (matrix sign …
-
Rapid Approximation of Bilinear Forms Involving Matrix Functions Through Asymptotic Analysis of Gaussian Node Placement
Technological advancements have allowed computing power to generate high resolution model s. As a result, greater stiffness has been introduced into systems of ordinary differential equations (ODEs) that arise from spatial discreti zation of partial differential equations (PDEs). The components of …
-
A new block Krylov subspace framework with applications to functions of matrices acting on multiple vectors
… block Krylov subspace methods, which hinges on a matrix-valued inner product. We can recast the ``classical" block Krylov methods, such as O'Leary's block conjugate gradients, global methods, and loop-interchange methods, within this framework. Leveraging the generality of the framework, we …
-
Εφαρμογή των αλγοριθμικών διαδικασιών στην εφαρμοσμένη θεωρία μητρών
In this thesis the ring of the matrix functions is being established and studied. Besides the theoretical study and research of the subject, special algorithms are being developed for the calculation of quantities that have to do with the matrix functions. It is obvious that the study and research …
-
Covariance structures of Gaussian and log-Gaussian vector stochastic processes
… discussion about how to construct the covariance matrix functions of multivariate Gaussian time series with long memory, especially ones with power-law and log-law decaying covariance structures. Furthermore, there have been relatively few results about how to determine whether a given matrix …
-
Discrete Hamiltonian systems
… systems and equations equivalent to discrete matrix and vector Hamiltonian systems are discussed. The first involves an initial value problem whose unique matrix solution pair is defined to be the sine and cosine matrix functions. The second section involves asymptotic behavior of solutions to …
-
On The Numerical Computation of Aᵅx=b
… = b. In this thesis, we introduce the notion of matrix functions f(A) and present several methods for computing p-th root matrices A^(1/p). Finally we propose some algorithms for solving fractional linear systems.
Page 1 of 4