Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • 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
Preconditioners and fundamental solutions
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. (ANLA)
2003 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

New preconditioning techniques for the iterative solution of systems of equations arising from discretizations of partial differential equations are considered. Fundamental solutions, both of differential and difference operators, are used as kernels in discrete, truncated convolution operators. The intention is to approximate inverses of difference operators that arise when discretizing the differential equations. The approximate inverses are used as preconditioners.

The technique using fundamental solutions of differential operators is applied to scalar problems in two dimensions, and grid independent convergence is obtained for a first order differential equation.

The problem of computing fundamental solutions of difference operators is considered, and we propose a new algorithm. It can be used also when the symbol of the difference operator is not invertible everywhere, and it is applicable in two or more dimensions.

Fundamental solutions of difference operators are used to construct preconditioners for non-linear systems of difference equations in two dimensions. Grid independent convergence is observed for two standard finite difference discretizations of the Euler equations in a non-axisymmetric duct.

Place, publisher, year, edition, pages
Uppsala University, 2003.
Series
Information technology licentiate theses: Licentiate theses from the Department of Information Technology, ISSN 1404-5117 ; 2003-001
National Category
Computational Mathematics
Research subject
Numerical Analysis
Identifiers
URN: urn:nbn:se:uu:diva-86132OAI: oai:DiVA.org:uu-86132DiVA, id: diva2:116941
Supervisors
Available from: 2003-03-27 Created: 2006-05-14 Last updated: 2017-08-31Bibliographically approved

Open Access in DiVA

fulltext(283 kB)69 downloads
File information
File name FULLTEXT01.pdfFile size 283 kBChecksum SHA-512
64a68a54d79a4bb175bbf1fc46fc9e1fccb221346cfd3be4d200880e3083bdae8d432614b5973a02573d8d8ff49085645240f69e65aa738c38eed391b9fdbfee
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Sundqvist, Per
By organisation
Division of Scientific ComputingNumerical Analysis
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 69 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 568 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • 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