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
Filter
  • Articles  (26)
  • Other Sources
  • 65F10  (26)
  • 1985-1989  (26)
  • 1965-1969
  • 1945-1949
  • Mathematics  (26)
Collection
  • Articles  (26)
  • Other Sources
Publisher
Years
Year
Topic
  • 1
    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 ...
  • 2
    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 ...
  • 3
    ISSN: 1572-9125
    Keywords: 65F10 ; Semiconductors ; simulation ; partial differential equations
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The alternate-block-factorization (ABF) method is a procedure for partially decoupling systems of elliptic partial differential equations by means of a carefully chosen change of variables. By decoupling we mean that the ABF strategy attempts to reduce intra-equation coupling in the system rather than intra-grid coupling for a single elliptic equation in the system. This has the effect of speeding convergence of commonly used iteration schemes, which use the solution of a sequence of linear elliptic PDEs as their main computational step. Algebraically, the change of variables is equivalent to a postconditioning of the original system. The results of using ABF postconditioning on some problems arising from semiconductor device simulation are discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    BIT 26 (1986), S. 369-376 
    ISSN: 1572-9125
    Keywords: 65F10 ; 65F15 ; 65F40 ; CR: G.1.3
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, the behavior of the block Accelerated Overrelaxation (AOR) iterative method, when applied to linear systems with a generalized consistently ordered coefficient matrix, is investigated. An equation, relating the eigenvalues of the block Jacobi iteration matrix to the eigenvalues of its associated block AOR iteration matrix, as well as sufficient conditions for the convergence of the block AOR method, are obtained.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    BIT 26 (1986), S. 493-504 
    ISSN: 1572-9125
    Keywords: 65F10 ; 65N20 ; 15A09 ; Conjugate gradient method ; elliptic partial differential equations ; incomplete factorization ; iterative methods ; preconditioning ; sparse matrices
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The INV(k) and MINV(k) block preconditionings for the conjugate gradient method require generation of selected elements of the inverses of symmetric matrices of bandwidth 2k+1. Generalizing the previously describedk=1 (tridiagonal) case tok=2, explicit expressions for the inverse elements of a symmetric pentadiagonal matrix in terms of Green's matrix of rank two are given. These expressions are found to be seriously ill-conditioned; hence alternative computational algorithms for the inverse elements must be used. Behavior of thek=1 andk=2 preconditionings are compared for some discretized elliptic partial differential equation test problems in two dimensions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    BIT 27 (1987), S. 216-234 
    ISSN: 1572-9125
    Keywords: 65M10 ; 65M15 ; 65M50 ; 65F10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We study the method which is obtained when a multi-grid method (in space) is first applied directly to a parabolic intitial-boundary value problem, and discretization in time is done only afterwards. This approach is expected to be well-suited to parallel computation. Further, time marching can be done using different time step-sizes in different parts of the spatial domain.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    BIT 27 (1987), S. 554-584 
    ISSN: 1572-9125
    Keywords: AMS ; 65L05 ; 65F10 ; dynamic iteration ; waveform relaxation ; multistep methods ; parallel computing ; modularity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper continues the authors' study of the convergence of dynamic iteration methods for large systems of linear initial value problems. We ask for convergence on [0, ∞) and show how the convergence can be reduced to a graphical test relating the splitting of the matrix to the stability properties of the discretization method.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    BIT 28 (1988), S. 163-178 
    ISSN: 1572-9125
    Keywords: 65F10 ; 15A06 ; 65N20 ; 33A65 ; Richardson's method ; iterative solution ; Chebyshev method ; Manteuffel algorithm ; optimum parameters ; least squares ; nonsymmetric matrices ; nonhermitian matrices ; orthogonal polynomials ; eigenvalues
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A method is presented to solveAx=b by computing optimum iteration parameters for Richardson's method. It requires some information on the location of the eigenvalues ofA. The algorithm yields parameters well-suited for matrices for which Chebyshev parameters are not appropriate. It therefore supplements the Manteuffel algorithm, developed for the Chebyshev case. Numerical examples are described.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    BIT 28 (1988), S. 308-322 
    ISSN: 1572-9125
    Keywords: 65F10 ; 65F50
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The conjugate gradient method for the iterative solution of a set of linear equationsAx=b is essentially equivalent to the Lanczos method, which implies that approximations to certain eigen-values ofA can be obtained at low cost. In this paper it is shown how the smallest “active” eigenvalue ofA can be cheaply approximated, and the usefulness of this approximation for a practical termination criterion for the conjugate gradient method is studied. It is proved that this termination criterion is reliable in many relevant situations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    BIT 29 (1989), S. 328-346 
    ISSN: 1572-9125
    Keywords: 65L05 ; 65F10 ; Picard-Lindelöf iteration ; waveform relaxation ; weak coupling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The paper discusses Picard-Lindelöf iteration for systems of autonomous linear equations on finite intervals, as well as its numerical variants. Most of the discussion is under a model assumption which roughly says that the coupling terms are of moderate size compared with the slow time scales in the problem. It is shown that the speed of convergence is quite independent of the step sizes already for very large time steps. This makes it possible to design strategies in which the mesh gets gradually refined during the iteration in such a way that the iteration error stays essentially on the level of discretization error.
    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...