• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 4
  • Tagged with
  • 4
  • 4
  • 4
  • 4
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 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.
1

Two-point boundary value problems with piecewise constant coefficients: weak solution and exact discretization

Windisch, G. 30 October 1998 (has links) (PDF)
For two-point boundary value problems in weak formulation with piecewise constant coefficients and piecewise continuous right-hand side functions we derive a representation of its weak solution by local Green's functions. Then we use it to generate exact three-point discretizations by Galerkin's method on essentially arbitrary grids. The coarsest possible grid is the set of points at which the piecewise constant coefficients and the right- hand side functions are discontinuous. This grid can be refined to resolve any solution properties like boundary and interior layers much more correctly. The proper basis functions for the Galerkin method are entirely defined by the local Green's functions. The exact discretizations are of completely exponentially fitted type and stable. The system matrices of the resulting tridiagonal systems of linear equations are in any case irreducible M-matrices with a uniformly bounded norm of its inverse.
2

Two-point boundary value problems with piecewise constant coefficients: weak solution and exact discretization

Windisch, G. 30 October 1998 (has links)
For two-point boundary value problems in weak formulation with piecewise constant coefficients and piecewise continuous right-hand side functions we derive a representation of its weak solution by local Green's functions. Then we use it to generate exact three-point discretizations by Galerkin's method on essentially arbitrary grids. The coarsest possible grid is the set of points at which the piecewise constant coefficients and the right- hand side functions are discontinuous. This grid can be refined to resolve any solution properties like boundary and interior layers much more correctly. The proper basis functions for the Galerkin method are entirely defined by the local Green's functions. The exact discretizations are of completely exponentially fitted type and stable. The system matrices of the resulting tridiagonal systems of linear equations are in any case irreducible M-matrices with a uniformly bounded norm of its inverse.
3

Exact discretizations of two-point boundary value problems

Windisch, G. 30 October 1998 (has links) (PDF)
In the paper we construct exact three-point discretizations of linear and nonlinear two-point boundary value problems with boundary conditions of the first kind. The finite element approach uses basis functions defined by the coefficients of the differential equations. All the discretized boundary value problems are of inverse isotone type and so are its exact discretizations which involve tridiagonal M-matrices in the linear case and M-functions in the nonlinear case.
4

Exact discretizations of two-point boundary value problems

Windisch, G. 30 October 1998 (has links)
In the paper we construct exact three-point discretizations of linear and nonlinear two-point boundary value problems with boundary conditions of the first kind. The finite element approach uses basis functions defined by the coefficients of the differential equations. All the discretized boundary value problems are of inverse isotone type and so are its exact discretizations which involve tridiagonal M-matrices in the linear case and M-functions in the nonlinear case.

Page generated in 0.0496 seconds