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  (32)
  • Other Sources
  • 65F10
  • 1985-1989  (26)
  • 1980-1984  (6)
  • 1965-1969
  • 1945-1949
  • Mathematics  (32)
Collection
  • Articles  (32)
  • 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 22 (1982), S. 73-78 
    ISSN: 1572-9125
    Keywords: 65F10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract With the definition of generalized diagonal dominant matrices we improve the known results about the intervals of convergence of the (AOR) method for linear systems. We consider this problem for different kinds of matrices and we get some important results forH-matrices.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    BIT 22 (1982), S. 233-251 
    ISSN: 1572-9125
    Keywords: 65G10 ; 65H05 ; 65H10 ; 65H15 ; 65F10 ; 65F15 ; Interval analysis ; interval iteration ; linear and nonlinear systems of equations ; upper and lower bounds for solutions ; eigenvalues ; and eigenvectors
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In actual practice, iteration methods applied to the solution of finite systems of equations yield inconclusive results as to the existence or nonexistence of solutions and the accuracy of any approximate solutions obtained. On the other hand, construction of interval extensions of ordinary iteration operators permits one to carry out interval iteration computationally, with results which can give rigorous guarantees of existence or nonexistence of solutions, and error bounds for approximate solutions. Examples are given of the solution of a nonlinear system of equations and the calculation of eigenvalues and eigenvectors of a matrix by interval iteration. Several ways to obtain lower and upper bounds for eigenvalues are given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    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 ...
  • 7
    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 ...
  • 8
    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 ...
  • 9
    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 ...
  • 10
    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 ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...