Library

feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 11
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 82 (1999), S. 143-159 
    ISSN: 0945-3245
    Keywords: Mathematics Subject Classification (1991):76N99, 76M25, 65M99
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract. A problem of all particle methods is that they produce large vacuum regions when they are applied to a free gas flow, for example. With the approach recently proposed by the author [Numer. Math. (1997) 76: 111–142], this difficulty can be avoided. One can let the particles adapt their size to the local state of the fluid. How, is described in the present article. The diameter as an additional degree of freedom strongly improves the performance of the numerical methods based on this particle model.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 82 (1999), S. 161-177 
    ISSN: 0945-3245
    Keywords: Mathematics Subject Classification (1991):76N99, 76M25, 65M99
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract. The examination of the particle model of compressible fluids that has been developed by the author [Numer. Math. (1997) 76: 111–142] and that has recently been extended to particles of variable size [Numer. Math. (1999) 82: 143–159], is continued. It is shown that, in the limit of particle sizes tending to zero, both the mass density and the mass flux density and the entropy density and the entropy flux density converge in the weak sense and satisfy the corresponding conservation laws. To incorporate entropy generation in shocks, a new kind of viscous force is introduced.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 13
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 56 (1989), S. 645-666 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65F10 ; 65N20 ; 65N30 ; CR: G 1.8
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary We consider the numerical solution of indefinite systems of linear equations arising in the calculation of saddle points. We are mainly concerned with sparse systems of this type resulting from certain discretizations of partial differential equations. We present an iterative method involving two levels of iteration, similar in some respects to the Uzawa algorithm. We relate the rates of convergence of the outer and inner iterations, proving that, under natural hypotheses, the outer iteration achieves the rate of convergence of the inner iteration. The technique is applied to finite element approximations of the Stokes equations.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Springer
    Zeitschrift für angewandte Mathematik und Physik 38 (1987), S. 659-664 
    ISSN: 1420-9039
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Physics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 15
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 21 (1999), S. 387-392 
    ISSN: 1572-9265
    Keywords: multigrid methods ; domains of complicated shape ; 65N55 ; 65N30
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract It is shown that, with homogeneous Dirichlet boundary conditions, the condition number of finite element discretization matrices remains uniformly bounded independent of the size of the boundary elements provided that the size of the elements increases with their distance to the boundary. This fact allows the construction of simple multigrid methods of optimal complexity for domains of nearly arbitrary shape.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 16
    Title: Funktionen einer Veränderlichen : Analytische und numerische Behandlung
    Author: Niederdrenk, Klaus
    Contributer: Yserentant, Harry
    Publisher: Braunschweig u.a. :Vieweg,
    Year of publication: 1987
    Pages: 447 S.
    Series Statement: Rechnerorientierte Ingenieurmathematik
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 17
    Title: Gewöhnliche Differentialgleichungen : analytische und numerische Behandlung
    Author: Luther, Wolfram
    Contributer: Niederdrenk, Klaus , Reutter, Fritz , Yserentant, Harry
    Publisher: Braunschweig u.a. :Vieweg,
    Year of publication: 1987
    Pages: 422 S.
    Series Statement: Rechnerorientierte Ingenieurmathematik
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 18
    Publication Date: 2014-02-26
    Description: We derive and analyze the hierarchical basis-multigrid method for solving discretizations of self-adjoint, elliptic boundary value problems using piecewise linear triangular finite elements. The method is analyzed as a block symmetric Gauß- Seidel iteration with inner iterations, but it is strongly related to 2-level methods, to the standard multigrid V-cycle, and to earlier Jacobi-like hierarchical basis methods. The method is very robust, and has a nearly optimal convergence rate and work estimate. It is especially well suited to difficult problems with rough solutions, discretized using highly nonuniform, adaptively refined meshes.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 19
    Publication Date: 2014-02-26
    Description: The finite element discretization of many elliptic boundary value problems leads to linear systems with positive definite and symmetric coefficient matrices. Many efficient preconditioners are known for these systems. We show that these preconditioning matrices can be used also for the linear systems arising from boundary value problems which are potentially indefinite due to lower order terms in the partial differential equation. Our main tool is a careful algebraic analysis of the condition numbers and the spectra of perturbed matrices which are preconditioned by the same matrices as in the unperturbed case. {\bf Keywords: }Preconditioned conjugate gradient methods, finite elements. {\bf Subject Classification: } AMS(MOS):65F10, 65N20, 65N30.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 20
    Publication Date: 2014-02-26
    Description: The paper presents the mathematical concepts underlying the new adaptive finite element code KASKADE, which, in its present form, applies to linear scalar second-order 2-D elliptic problems on general domains. Starting point for the new development is the recent work on hierarchical finite element bases due to Yserentant (1986). It is shown that this approach permits a flexible balance between iterative solver, local error estimator, and local mesh refinement device - which are the main components of an adaptive PDE code. Without use of standard multigrid techniques, the same kind of computational complexity is achieved - independent of any uniformity restrictions on the applied meshes. In addition, the method is extremely simple and all computations are purely local - making the method particularly attractive in view of parallel computing. The algorithmic approach is illustrated by a well-known critical test problem. {\bf Keywords:} finite elements, hierarchical basis, adaptive mesh refinement, preconditioned conjugate gradient methods.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...