ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    Monographie ausleihbar
    Monographie ausleihbar
    Cambridge : Cambridge Univ. Press
    Signatur: M 95.0035
    Materialart: Monographie ausleihbar
    Seiten: xiii, 654 S.
    ISBN: 0521445248
    Klassifikation:
    C.1.8.
    Sprache: Englisch
    Standort: Kompaktmagazin oben
    Zweigbibliothek: GFZ Bibliothek
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Springer
    BIT 12 (1972), S. 1-4 
    ISSN: 1572-9125
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract Formulae for a class ofA-stable quadrature methods, or equivalently a certain implicit Runge-Kutta scheme, are given. A short proof of the strongA-stability is presented.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Digitale Medien
    Digitale Medien
    Springer
    BIT 4 (1964), S. 69-86 
    ISSN: 1572-9125
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract For the numerical solution of the initial value problemy′=f(x,y), −1≦x≦1;y(−1)=y 0 a global integration method is derived and studied. The method goes as follows. At first the system of nonlinear equations is solved. The matrix (A i,k (n) ) of quadrature coefficients is “nearly” lower left triangular and the pointsx k,n ,k=1,2,...,n are the zeros ofP n −P n−2, whereP n is the Legendre polynomial of degreen. It is showed that the errors From the valuesf(x i,n ,y i,n ),i=1,2,...,n an approximation polynomial is constructed. The approximation is Chebyshevlike and the error at the end of the interval of integration is particularly small.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    Digitale Medien
    Digitale Medien
    Springer
    BIT 9 (1969), S. 185-199 
    ISSN: 1572-9125
    Schlagwort(e): Differential equations ; Quadrature method ; A-stability
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract A class of methods for the numerical solution of systems of ordinary differential equations is given which—for linear systems—gives solutions which conserve the stability property of the differential equation. The methods are of a quadrature type $$y_{i,r} = y_{n,r - 1} + h\sum\limits_{k = 1}^n {a_{ik} f(y_{k,r} ), n = 1,2, \ldots ,n, r = 1,2, \ldots ,} y_{n,0} given$$ wherea ik are quadrature coefficients over the zeros ofP n −P n−1 (v=1) orP n −P n−2 (v=2), whereP n is the Legendre polynomial orthogonal on [0,1] and normalized such thatP m (1)=1. It is shown that $$\left| {y_{n,r} - y(rh) = 0(h^{2n - _v } )} \right|$$ wherey is the solution of $$\frac{{dy}}{{dt}} = f(y), t \mathbin{\lower.3ex\hbox{$\buildrel〉\over{\smash{\scriptstyle=}\vphantom{_x}}$}} 0, y(0) given.$$
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    Digitale Medien
    Digitale Medien
    Springer
    Numerische Mathematik 78 (1997), S. 189-209 
    ISSN: 0945-3245
    Schlagwort(e): Mathematics Subject Classification (1991): 65F10, 65F15, 65F50
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Summary. The paper deals with eigenvalue estimates for block incomplete factorization methods for symmetric matrices. First, some previous results on upper bounds for the maximum eigenvalue of preconditioned matrices are generalized to each eigenvalue. Second, upper bounds for the maximum eigenvalue of the preconditioned matrix are further estimated, which presents a substantial improvement of earlier results. Finally, the results are used to estimate bounds for every eigenvalue of the preconditioned matrices, in particular, for the maximum eigenvalue, when a modified block incomplete factorization is used to solve an elliptic equation with variable coefficients in two dimensions. The analysis yields a new upper bound of type $\gamma h^{-1}$ for the condition number of the preconditioned matrix and shows clearly how the coefficients of the differential equation influence the positive constant $\gamma$ .
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 6
    Digitale Medien
    Digitale Medien
    Springer
    Numerische Mathematik 48 (1986), S. 479-498 
    ISSN: 0945-3245
    Schlagwort(e): AMS(MOS): 65F10 ; CR: G1. 3
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Summary A class of preconditioning methods depending on a relaxation parameter is presented for the solution of large linear systems of equationAx=b, whereA is a symmetric positive definite matrix. The methods are based on an incomplete factorization of the matrixA and include both pointwise and blockwise factorization. We study the dependence of the rate of convergence of the preconditioned conjugate gradient method on the distribution of eigenvalues ofC −1 A, whereC is the preconditioning matrix. We also show graphic representations of the eigenvalues and present numerical tests of the methods.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 7
    Digitale Medien
    Digitale Medien
    Springer
    Numerische Mathematik 28 (1977), S. 1-14 
    ISSN: 0945-3245
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Summary Conditions are given for the validity of long range quasi optimal error estimates of the Galerkin method for quasilinear parabolic equations. If the corresponding nonlinear elliptic operator satisfies a coercivity condition, the stationary problem may be approximated by the numerical solution of the parabolic problem when the time variablet is large enough, starting with an arbitrary initial function. Some practical applications are discussed.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 8
    Digitale Medien
    Digitale Medien
    Springer
    Numerische Mathematik 48 (1986), S. 499-523 
    ISSN: 0945-3245
    Schlagwort(e): AMS(MOS): 65F10 ; CR: G1.3
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Summary We derive new estimates for the rate of convergence of the conjugate gradient method by utilizing isolated eigenvalues of parts of the spectrum. We present a new generalized version of an incomplete factorization method and compare the derived estimates of the number of iterations with the number actually found for some elliptic difference equations and for a similar problem with a model empirical distribution function.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 9
    Digitale Medien
    Digitale Medien
    Springer
    Numerical algorithms 21 (1999), S. 23-47 
    ISSN: 1572-9265
    Schlagwort(e): multilevel method ; stabilization ; finite element method ; additive method
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract There exist two main versions of preconditioners of algebraic multilevel type, the additive and the multiplicative methods. They correspond to preconditioners in block diagonal and block matrix factorized form, respectively. Both can be defined and analysed as recursive two-by-two block methods. Although the analytical framework for such methods is simple, for many finite element approximations it still permits the derivation of the strongest results, such as optimal, or nearly optimal, rate of convergence and optimal, or nearly optimal order of computational complexity, when proper recursive global orderings of node points have been used or when they are applied for hierarchical basis function finite element methods for elliptic self-adjoint equations and stabilized in a certain way. This holds for general elliptic problems of second order, independent of the regularity of the problem, including independence of discontinuities of coefficients between elements and of anisotropy. Important ingredients in the methods are a proper balance of the size of the coarse mesh to the finest mesh and a proper solver on the coarse mesh. This paper presents in a survey form the basic results of such methods and considers in particular additive methods. This method has excellent parallelization properties.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 10
    Digitale Medien
    Digitale Medien
    Springer
    Numerical algorithms 25 (2000), S. 1-22 
    ISSN: 1572-9265
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract The convergence of conjugate gradient methods for solving systems of linear equations with a symmetric positive definite matrix takes typically place in three phases, with a sublinear, linear and superlinear convergence rate, respectively. This behaviour can be explained using various generalized condition numbers which depend on all eigenvalues and on the initial error vector and using annihilating polynomials for the extreme eigenvalues. The analysis also indicates that it can be most efficient to use different preconditioners in different phases.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...