ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 54 (1989), S. 463-491 
    ISSN: 0945-3245
    Keywords: AMS (MOS): 65R20 ; CR: G1.9
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary The boundary element method (BEM) leads to a system of linear equations with a full matrix, while FEM yields sparse matrices. This fact seems to require much computational work for the definition of the matrix, for the solution of the system, and, in particular, for the matrix-vector multiplication, which always occurs as an elementary. In this paper a method for the approximate matrix-vector multiplication is described which requires much less arithmetical work. In addition, the storage requirements are strongly reduced.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 75 (1997), S. 447-472 
    ISSN: 0945-3245
    Keywords: Mathematics Subject Classification (1991): 65D05, 65N12, 65N15, 65N30, 65N50, 65N55
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary. Usually, the minimal dimension of a finite element space is closely related to the geometry of the physical object of interest. This means that sometimes the resolution of small micro-structures in the domain requires an inadequately fine finite element grid from the viewpoint of the desired accuracy. This fact limits also the application of multi-grid methods to practical situations because the condition that the coarsest grid should resolve the physical object often leads to a huge number of unknowns on the coarsest level. We present here a strategy for coarsening finite element spaces independently of the shape of the object. This technique can be used to resolve complicated domains with only few degrees of freedom and to apply multi-grid methods efficiently to PDEs on domains with complex boundary. In this paper we will prove the approximation property of these generalized FE spaces.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 42 (1983), S. 65-76 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65 N 20 ; CR: 5.17
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary We consider here a general class of algorithms for the numerical solution of variational inequalities. A convergence proof is given and in particular a multi-grid method is described. Numerical results are presented for the finite-difference discretization of an obstacle problem for minimal surfaces
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    ISSN: 0945-3245
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary The proceduresivp presented in this paper calculates an approximate solution of Cauchy's initial value problem for hyperbolic systems of the form (1) (see below). The discretization which proceeds along the characteristics is performed using the midpoint rule started by Euler's method. To provide an algorithm of high accuracy the numerical solution is improved by step size extrapolation. This paper contains anAlgol program completed by examples of the use and test results.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 28 (1977), S. 455-474 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65B05, 65M25, 65M99 ; CR: 5.17
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary The application of extrapolation to the limit requires the existence of an asymptotic expansion in powers of the step size. In this paper one-and multi-step methods for the solution of hyperbolic systems of first order are considered. Conditions are formulated that ensure the asymptotic expansion. Methods of characteristics for quasilinear systems with two independent variables are included in this presentation. If a rectangular grid is used, also non-quasilinear systems are admissible. The main part of this paper deals with initial value problems. But it is shown that in some exceptional cases asymptotic expansions hold for initial-boundary problems, too.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 55 (1989), S. 225-246 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65N20 ; CR: G1.8
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary In this paper, we present a new algorithm that is obtained by introducing a damping parameter in the classical Nonlinear Multilevel Method. We analyse this Damped Nonlinear Multilevel Method. In particular, we prove global convergence and local efficiency for a suitable class of problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 86 (2000), S. 139-172 
    ISSN: 0945-3245
    Keywords: Mathematics Subject Classification (1991):65N38
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary. In this paper we present a new quadrature method for computing Galerkin stiffness matrices arising from the discretisation of 3D boundary integral equations using continuous piecewise linear boundary elements. This rule takes as points some subset of the nodes of the mesh and can be used for computing non-singular Galerkin integrals corresponding to pairs of basis functions with non-intersecting supports. When this new rule is combined with standard methods for the singular Galerkin integrals we obtain a “hybrid” Galerkin method which has the same stability and asymptotic convergence properties as the true Galerkin method but a complexity more akin to that of a collocation or Nyström method. The method can be applied to a wide range of singular and weakly-singular first- and second-kind equations, including many for which the classical Nyström method is not even defined. The results apply to equations on piecewise-smooth Lipschitz boundaries, and to non-quasiuniform (but shape-regular) meshes. A by-product of the analysis is a stability theory for quadrature rules of precision 1 and 2 based on arbitrary points in the plane. Numerical experiments demonstrate that the new method realises the performance expected from the theory.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 86 (2000), S. 103-137 
    ISSN: 0945-3245
    Keywords: Mathematics Subject Classification (1991):65N38
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract. This paper is concerned with the stability and convergence of fully discrete Galerkin methods for boundary integral equations on bounded piecewise smooth surfaces in $\mathbb{R}^3$ . Our theory covers equations with very general operators, provided the associated weak form is bounded and elliptic on $H^\mu$ , for some $\mu \in [-1,1]$ . In contrast to other studies on this topic, we do not assume our meshes to be quasiuniform, and therefore the analysis admits locally refined meshes. To achieve such generality, standard inverse estimates for the quasiuniform case are replaced by appropriate generalised estimates which hold even in the locally refined case. Since the approximation of singular integrals on or near the diagonal of the Galerkin matrix has been well-analysed previously, this paper deals only with errors in the integration of the nearly singular and smooth Galerkin integrals which comprise the dominant part of the matrix. Our results show how accurate the quadrature rules must be in order that the resulting discrete Galerkin method enjoys the same stability properties and convergence rates as the true Galerkin method. Although this study considers only continuous piecewise linear basis functions on triangles, our approach is not restricted in principle to this case. As an example, the theory is applied here to conventional “triangle-based” quadrature rules which are commonly used in practice. A subsequent paper [14] introduces a new and much more efficient “node-based” approach and analyses it using the results of the present paper.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Computing and visualization in science 1 (1997), S. 15-25 
    ISSN: 1433-0369
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract. In this paper, we will present efficient strategies how composite finite elements can be realized for the discretization of PDEs on domains containing small geometric details. In contrast to standard finite elements, the minimal dimension of this new class of finite element spaces is completely independent of the number of geometric details of the physical domains. Hence, it allows coarse level discretization of PDEs which can be used, e.g., preferably for multi-grid methods and homogenization of PDEs in non-periodic situations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Computing 62 (1999), S. 89-108 
    ISSN: 1436-5057
    Keywords: AMS Subject Classifications:65F05, 65F30, 65F50. ; Key words.Hierarchical matrices, hierarchical block partitioning, sparse matrices, matrix inversion.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract. A class of matrices ( $\Cal H$ -matrices) is introduced which have the following properties. (i) They are sparse in the sense that only few data are needed for their representation. (ii) The matrix-vector multiplication is of almost linear complexity. (iii) In general, sums and products of these matrices are no longer in the same set, but their truncations to the $\Cal H$ -matrix format are again of almost linear complexity. (iv) The same statement holds for the inverse of an $\Cal H$ -matrix. This paper is the first of a series and is devoted to the first introduction of the $\Cal H$ -matrix concept. Two concret formats are described. The first one is the simplest possible. Nevertheless, it allows the exact inversion of tridiagonal matrices. The second one is able to approximate discrete integral operators.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...