uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A matrix-less and parallel interpolation–extrapolation algorithm for computing the eigenvalues of preconditioned banded symmetric Toeplitz matrices
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Scientific Computing. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Numerical Analysis.ORCID iD: 0000-0002-7875-7543
2018 (English)In: Numerical Algorithms, ISSN 1017-1398, E-ISSN 1572-9265Article in journal (Refereed) Epub ahead of print
Place, publisher, year, edition, pages
2018.
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:uu:diva-346734DOI: 10.1007/s11075-018-0508-0OAI: oai:DiVA.org:uu-346734DiVA, id: diva2:1192013
Available from: 2018-03-24 Created: 2018-03-21 Last updated: 2018-03-26Bibliographically approved
In thesis
1. Matrix-Less Methods for Computing Eigenvalues of Large Structured Matrices
Open this publication in new window or tab >>Matrix-Less Methods for Computing Eigenvalues of Large Structured Matrices
2018 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

When modeling natural phenomena with linear partial differential equations, the discretized system of equations is in general represented by a matrix. To solve or analyze these systems, we are often interested in the spectral behavior of these matrices. Whenever the matrices of interest are Toeplitz, or Toeplitz-like, we can use the theory of Generalized Locally Toeplitz (GLT) sequences to study the spectrum (eigenvalues). A central concept in the theory of GLT sequences is the so-called symbol, that is, a function associated with a sequence of matrices of increasing size. When sampling the symbol and when the related matrix sequence is Hermitian (or quasi-Hermitian), we obtain an approximation of the spectrum of a matrix of a fixed size and we can therefore see its general behavior. However, the so-computed approximations of the eigenvalues are often affected by errors having magnitude of the reciprocal of the matrix size.

In this thesis we develop novel methods, which we call "matrix-less" since they neither store the matrices of interest nor depend on matrix-vector products, to estimate these errors. Moreover, we exploit the structures of the considered matrices to efficiently and accurately compute the spectrum.

We begin by considering the errors of the approximate eigenvalues computed by sampling the symbol on a uniform grid, and we conjecture the existence of an asymptotic expansion for these errors. We devise an algorithm to approximate the expansion by using a small number of moderately sized matrices, and we show through numerical experiments the effectiveness of the algorithm. We also show that the same algorithm works for preconditioned matrices, a result which is important in practical applications. Then, we explain how to use the approximated expansion on the whole spectrum for large matrices, whereas in earlier works its applicability was restricted only to certain matrix sizes and to a subset of the spectrum. Next, we demonstrate how to use the so-developed techniques to investigate, solve, and improve the accuracy in the eigenvalue computations for various differential problems discretized by the isogeometric analysis (IgA) method. Lastly, we discuss a class of non-monotone symbols for which we construct the sampling grid yielding exact eigenvalues and eigenvectors.

To summarize, we show, both theoretically and numerically, the applicability of the presented matrix-less methods for a wide variety of problems.

Place, publisher, year, edition, pages
Uppsala: Acta Universitatis Upsaliensis, 2018. p. 81
Series
Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology, ISSN 1651-6214 ; 1652
Keywords
Toeplitz matrices, eigenvalues, eigenvalue asymptotics, polynomial interpolation, extrapolation, generating function and spectral symbol
National Category
Computational Mathematics
Research subject
Scientific Computing with specialization in Numerical Analysis
Identifiers
urn:nbn:se:uu:diva-346735 (URN)978-91-513-0288-1 (ISBN)
Public defence
2018-05-18, 2446 ITC, Lägerhyddsvägen 2, hus 2, Uppsala, 10:15 (English)
Opponent
Supervisors
Available from: 2018-04-20 Created: 2018-03-25 Last updated: 2018-10-08

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Ekström, Sven-Erik

Search in DiVA

By author/editor
Ekström, Sven-ErikGaroni, Carlo
By organisation
Division of Scientific ComputingNumerical Analysis
In the same journal
Numerical Algorithms
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 231 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf