NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 1 of 1 (0.412 seconds)

Spelling suggestions: "subject:"discretization matrix inverse""

1

An exploration of classical SBP-SAT operators and their minimal size

Nilsson, Jesper January 2021 (has links)
We consider diagonal-norm classical summation-by-parts (SBP) operators us-ing the simultaneous approximation term (SAT) method of imposing boundaryconditions. We derive a formula for the inverse of these SBP-SAT discretizationmatrices. This formula is then used to show that it is possible to construct a secondorder accurate SBP-SAT operator using only seven grid points.
Finite differences
summation by parts
simultaneous approximation term
SBP-SAT
discretization matrix inverses
Computational Mathematics
Beräkningsmatematik

Page generated in 0.4153 seconds