97 research outputs found

    Author index to volumes 41–60 (1981–1984)

    Get PDF

    The numerical solution of sparse matrix equations by fast methods and associated computational techniques

    Get PDF
    The numerical solution of sparse matrix equations by fast methods and associated computational technique

    The singular values of the GUE (less is more)

    Get PDF
    Some properties that nominally involve the eigenvalues of Gaussian Unitary Ensemble (GUE) can instead be phrased in terms of singular values. By discarding the signs of the eigenvalues, we gain access to a surprising decomposition: the singular values of the GUE are distributed as the union of the singular values of two independent ensembles of Laguerre type. This independence is remarkable given the well known phenomenon of eigenvalue repulsion. The structure of this decomposition reveals that several existing observations about large n limits of the GUE are in fact manifestations of phenomena that are already present for finite random matrices. We relate the semicircle law to the quarter-circle law by connecting Hermite polynomials to generalized Laguerre polynomials with parameter ± 1/2. Similarly, we write the absolute value of the determinant of the n x n GUE as a product n independent random variables to gain new insight into its asymptotic log-normality. The decomposition also provides a description of the distribution of the smallest singular value of the GUE, which in turn permits the study of the leading order behavior of the condition number of GUE matrices. The study is motivated by questions involving the enumeration of orientable maps, and is related to questions involving powers of complex Ginibre matrices. The inescapable conclusion of this work is that the singular values of the GUE play an unpredictably important role that had gone unnoticed for decades even though, in hindsight, so many clues had been around.National Science Foundation (U.S.) (Grant DMS–1035400)National Science Foundation (U.S.) (Grant DMS–1016125

    Rational Krylov subspace methods for phi-functions in exponential integrators

    Get PDF
    Exponential integrators are a class of numerical methods for stiff systems of differential equations which require the computation of products of so-called matrix phi-functions and vectors. In this thesis, we consider the approximation of these matrix functions times some vector by rational and extended Krylov subspace methods. For arbitrary matrices with a field of values in the left complex half-plane, a uniform approximation is obtained that predicts a sublinear convergence

    Schur Averages in Random Matrix Ensembles

    Get PDF
    The main focus of this PhD thesis is the study of minors of Toeplitz, Hankel and Toeplitz±Hankel matrices. These can be expressed as matrix models over the classical Lie groups G(N) = U(N); Sp(2N);O(2N);O(2N + 1), with the insertion of irreducible characters associated to each of the groups. In order to approach this topic, we consider matrices generated by formal power series in terms of symmetric functions. We exploit these connections to obtain several relations between the models over the different groups G(N), and to investigate some of their structural properties. We compute explicitly several objects of interest, including a variety of matrix models, evaluations of certain skew Schur polynomials, partition functions and Wilson loops of G(N) Chern-Simons theory on S3, and fermion quantum models with matrix degrees of freedom. We also explore the connection with orthogonal polynomials, and study the large N behaviour of the average of a characteristic polynomial in the Laguerre Unitary Ensemble by means of the associated Riemann-Hilbert problem. We gratefully acknowledge the support of the Fundação para a Ciência e a Tecnologia through its LisMath scholarship PD/BD/113627/2015, which made this work possible

    Digital Signal Processing (Second Edition)

    Get PDF
    This book provides an account of the mathematical background, computational methods and software engineering associated with digital signal processing. The aim has been to provide the reader with the mathematical methods required for signal analysis which are then used to develop models and algorithms for processing digital signals and finally to encourage the reader to design software solutions for Digital Signal Processing (DSP). In this way, the reader is invited to develop a small DSP library that can then be expanded further with a focus on his/her research interests and applications. There are of course many excellent books and software systems available on this subject area. However, in many of these publications, the relationship between the mathematical methods associated with signal analysis and the software available for processing data is not always clear. Either the publications concentrate on mathematical aspects that are not focused on practical programming solutions or elaborate on the software development of solutions in terms of working ‘black-boxes’ without covering the mathematical background and analysis associated with the design of these software solutions. Thus, this book has been written with the aim of giving the reader a technical overview of the mathematics and software associated with the ‘art’ of developing numerical algorithms and designing software solutions for DSP, all of which is built on firm mathematical foundations. For this reason, the work is, by necessity, rather lengthy and covers a wide range of subjects compounded in four principal parts. Part I provides the mathematical background for the analysis of signals, Part II considers the computational techniques (principally those associated with linear algebra and the linear eigenvalue problem) required for array processing and associated analysis (error analysis for example). Part III introduces the reader to the essential elements of software engineering using the C programming language, tailored to those features that are used for developing C functions or modules for building a DSP library. The material associated with parts I, II and III is then used to build up a DSP system by defining a number of ‘problems’ and then addressing the solutions in terms of presenting an appropriate mathematical model, undertaking the necessary analysis, developing an appropriate algorithm and then coding the solution in C. This material forms the basis for part IV of this work. In most chapters, a series of tutorial problems is given for the reader to attempt with answers provided in Appendix A. These problems include theoretical, computational and programming exercises. Part II of this work is relatively long and arguably contains too much material on the computational methods for linear algebra. However, this material and the complementary material on vector and matrix norms forms the computational basis for many methods of digital signal processing. Moreover, this important and widely researched subject area forms the foundations, not only of digital signal processing and control engineering for example, but also of numerical analysis in general. The material presented in this book is based on the lecture notes and supplementary material developed by the author for an advanced Masters course ‘Digital Signal Processing’ which was first established at Cranfield University, Bedford in 1990 and modified when the author moved to De Montfort University, Leicester in 1994. The programmes are still operating at these universities and the material has been used by some 700++ graduates since its establishment and development in the early 1990s. The material was enhanced and developed further when the author moved to the Department of Electronic and Electrical Engineering at Loughborough University in 2003 and now forms part of the Department’s post-graduate programmes in Communication Systems Engineering. The original Masters programme included a taught component covering a period of six months based on two semesters, each Semester being composed of four modules. The material in this work covers the first Semester and its four parts reflect the four modules delivered. The material delivered in the second Semester is published as a companion volume to this work entitled Digital Image Processing, Horwood Publishing, 2005 which covers the mathematical modelling of imaging systems and the techniques that have been developed to process and analyse the data such systems provide. Since the publication of the first edition of this work in 2003, a number of minor changes and some additions have been made. The material on programming and software engineering in Chapters 11 and 12 has been extended. This includes some additions and further solved and supplementary questions which are included throughout the text. Nevertheless, it is worth pointing out, that while every effort has been made by the author and publisher to provide a work that is error free, it is inevitable that typing errors and various ‘bugs’ will occur. If so, and in particular, if the reader starts to suffer from a lack of comprehension over certain aspects of the material (due to errors or otherwise) then he/she should not assume that there is something wrong with themselves, but with the author
    • …
    corecore