ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

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
    Advances in computational mathematics 7 (1997), S. 235-259 
    ISSN: 1572-9044
    Keywords: numerical analysis ; nonlinear ; elliptic equations ; finite element ; error estimates ; 35K55 ; 65N15 ; 65N30
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this article a strategy of adaptive finite element for semi-linear problems, based on minimizing a residual-type estimator, is reported. We get an a posteriori error estimate which is asymptotically exact when the mesh size h tends to zero. By considering a model problem, the quality of this estimator is checked. It is numerically shown that without constraint on the mesh size h, the efficiency of the a posteriori error estimate can fail dramatically. This phenomenon is analysed and an algorithm which equidistributes the local estimators under the constraint h ⩽ h max is proposed. This algorithm allows to improve the computed solution for semi-linear convection–diffusion problems, and can be used for stabilizing the Lagrange finite element method for linear convection–diffusion problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Advances in computational mathematics 9 (1998), S. 311-335 
    ISSN: 1572-9044
    Keywords: symmetric variational problems ; additive Schwarz schemes ; multilevel methods ; sparse grids ; approximation spaces ; non-nested finite element spaces ; 65J10 ; 65N12 ; 65N30
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In the present paper we develop a representation of a norm frequently used in the analysis of multilevel methods. This allows us to examine the convergence of additive Schwarz schemes also in the case of non-nested subspaces. We demonstrate the usefulness of the given norm representation by studying in detail the stability of sparse grid splittings due to Griebel and Oswald, which turns out to be a special case of our unified theory. Further applications concerning approximation spaces and non-nested finite element spaces are given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Advances in computational mathematics 1 (1993), S. 259-335 
    ISSN: 1572-9044
    Keywords: Periodic pseudodifferential equations ; pre-wavelets ; biorthogonal wavelets ; generalized Petrov-Galerkin schemes ; wavelet representation ; atomic decomposition ; Calderón-Zygmund operators ; matrix compression ; error analysis ; 65F35 ; 65J10 ; 65N30 ; 65N35 ; 65R20 ; 47A20 ; 47G30 ; 45P05 ; 41A25
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This is the second part of two papers which are concerned with generalized Petrov-Galerkin schemes for elliptic periodic pseudodifferential equations in ℝ n . This setting covers classical Galerkin methods, collocation, and quasi-interpolation. The numerical methods are based on a general framework of multiresolution analysis, i.e. of sequences of nested spaces which are generated by refinable functions. In this part, we analyse compression techniques for the resulting stiffness matrices relative to wavelet-type bases. We will show that, although these stiffness matrices are generally not sparse, the order of the overall computational work which is needed to realize a certain accuracy is of the formO(N(logN) b ), whereN is the number of unknowns andb ≥ 0 is some real number.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Advances in computational mathematics 11 (1999), S. 355-375 
    ISSN: 1572-9044
    Keywords: periodic quasi-wavelet ; integral equation ; multiscale ; 45G10 ; 65F10 ; 65J15 ; 65N30
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In solving integral equations with a logarithmic kernel, we combine the Galerkin approximation with periodic quasi-wavelet (PQW) [4]. We develop an algorithm for solving the integral equations with only O(N log N) arithmetic operations, where N is the number of knots. We also prove that the Galerkin approximation has a polynomial rate of convergence.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Applications of mathematics 42 (1997), S. 147-159 
    ISSN: 1572-9109
    Keywords: magnetic field ; variational formulation ; two-sided existence and uniqueness condition ; finite element method
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A special two-sided condition for the incremental magnetic reluctivity is introduced which guarantees the unique existence of both the weak and the approximate solutions of the nonlinear stationary magnetic field distributed on a region composed of different media, as well as a certain estimate of the error between the two solutions. The condition, being discussed from the physical as well as the mathematical point of view, can be easily verified and is fulfilled for various magnetic reluctivity models used in electrotechnical practice.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    ISSN: 1572-9125
    Keywords: 65F10 ; 65N30
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Standard Galerkin finite element methods or finite difference methods for singular perturbation problems lead to strongly unsymmetric matrices, which furthermore are in general notM-matrices. Accordingly, preconditioned iterative methods such as preconditioned (generalized) conjugate gradient methods, which have turned out to be very successful for symmetric and positive definite problems, can fail to converge or require an excessive number of iterations for singular perturbation problems. This is not so much due to the asymmetry, as it is to the fact that the spectrum can have both eigenvalues with positive and negative real parts, or eigenvalues with arbitrary small positive real parts and nonnegligible imaginary parts. This will be the case for a standard Galerkin method, unless the meshparameterh is chosen excessively small. There exist other discretization methods, however, for which the corresponding bilinear form is coercive, whence its finite element matrix has only eigenvalues with positive real parts; in fact, the real parts are positive uniformly in the singular perturbation parameter. In the present paper we examine the streamline diffusion finite element method in this respect. It is found that incomplete block-matrix factorization methods, both on classical form and on an inverse-free (vectorizable) form, coupled with a general least squares conjugate gradient method, can work exceptionally well on this type of problem. The number of iterations is sometimes significantly smaller than for the corresponding almost symmetric problem where the velocity field is close to zero or the singular perturbation parameter ε=1.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    ISSN: 1572-9125
    Keywords: 65F10 ; 65N30 ; 76R05
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper presents some of the authors' experimental results in applying Preconditioned CG-type methods to nonsymmetric systems of linear equations arising in the numerical solution of the coupled system of fundamental stationary semiconductor equations. For this type of problem it is shown that these iterative methods are efficient both in computation times and in storage requirements. All results have been obtained on an HP 350 computer.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Advances in computational mathematics 6 (1996), S. 309-323 
    ISSN: 1572-9044
    Keywords: finite element method ; discontinuous Galerkin method ; a posteriori error estimates ; adaptivity ; Volterra equations ; viscoelasticity ; 45K05
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We give a brief indication of how elliptic, parabolic and hyperbolic partial differential equations with memory arise when modelling viscoelastic materials. We then point out the urgent need for adaptive solvers for these problems and, employing the methodology of Eriksson, Johnson et al. (e.g., SIAM J. Numer. Anal. 28 (1991)), we given ana posteriori error estimate for a model two-point hereditary boundary value problem. The strengths and weaknesses of the analysis and estimate are discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Advances in computational mathematics 7 (1997), S. 303-335 
    ISSN: 1572-9044
    Keywords: conservation law ; unstructured grid ; finite volume method ; adaptive mesh refinement ; 35L60 ; 35L65 ; 35L67 ; 65C20 ; 65M12 ; 65M60 ; 65N30 ; 76N15
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Many approaches exist to define a cell-centered upwind finite volume scheme of higher order on an unstructured grid of simplices. However, real theoretical motivation in the form of a convergence result does not exist for these approaches. Furthermore, some theoretical results of convergence exist for higher order finite volume methods, where no description of the numerical implementation is given to realize the necessary requirements for the convergence theory. Therefore we present in this paper a new limiter function which is motivated by these requirements and ensures a convergent scheme in the theoretical context: The approximated solution converges to the entropy solution in the case of scalar conservation laws in two space dimensions. This new limiter function is combined with a typical class of reconstruction functions very efficiently, which is illustrated by several test examples for scalar conservation laws as well as systems of such laws. In connection with the requirements to be fulfilled, a proof of a maximum principle of the finite volume scheme applied to simplices and dual cells is given. So for the approach of the higher order upwind finite volume scheme on dual cells, as used in several papers, a missing proof is now given. The ideas in this proof are also applied to the discontinuous Galerkin method, so that an existing maximum principle can be improved considerably. The main advantage comes from the fact that no requirements on the discretization of the domain are necessary: no B-triangulations or Delaunay triangulation are needed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Advances in computational mathematics 8 (1998), S. 97-110 
    ISSN: 1572-9044
    Keywords: numerical methods for PDEs ; finite element approximation ; parallel implementation ; shared‐memory architecture ; speedup ; load‐balance ; 65N30 ; 65Y05
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An implementation of the p‐version of the finite element method for solving two‐dimensional linear elliptic problems on a shared‐memory parallel computer is analyzed. The idea is to partition the problem among the available processors and perform computations corresponding to different elements in parallel. The parallelization is based on a domain decomposition technique using the Lagrange multipliers. The numerical experiments carried out on the Sequent system indicate very high performance of the mixed finite element algorithm in terms of attained speedups.
    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...