ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

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
Filter
  • Artikel  (130)
  • 65F10  (108)
  • information
  • Springer  (130)
  • Elsevier
  • Mathematik  (115)
  • Philosophie  (15)
  • 1
    Digitale Medien
    Digitale Medien
    Springer
    Computational & mathematical organization theory 6 (2000), S. 381-394 
    ISSN: 1572-9346
    Schlagwort(e): enterprise design ; ontologies ; information
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract Enterprise design knowledge is currently descriptive, ad hoc, or pre-scientific. One reason for this state of affairs in enterprise design is that existing approaches lack an adequate specification of the terminology of the enterprise models, which leads to inconsistent interpretation and uses of knowledge. We use the formal enterprise models being developed as part of the Toronto Virtual Enterprise (TOVE) project to provide a precise specification of enterprise structure, and use this structure to characterize process integration within the enterprise. We then use the constraints within the enterprise model to define a special class of enterprises, and discuss the concepts necessary to characterize process integration within this class. The results of this paper arose out of the successful application of these ontologies to the analysis of the IBM Opportunity Management Process in a joint project with IBM Canada.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Springer
    Advances in computational mathematics 9 (1998), S. 281-310 
    ISSN: 1572-9044
    Schlagwort(e): partial differential equations ; finite elements ; unstructured grids ; parallel solver ; domain decomposition ; additive Schwarz ; MPI ; general purpose software ; 65F10 ; 65N22 ; 65N55
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract This paper describes a parallel iterative solver for finite element discretisations of elliptic partial differential equations on 2D and 3D domains using unstructured grids. The discretisation of the PDE is assumed to be given in the form of element stiffness matrices and the solver is automatic in the sense that it requires minimal additional information about the PDE and the geometry of the domain. The solver parallelises matrix–vector operations required by iterative methods and provides parallel additive Schwarz preconditioners. Parallelisation is implemented through MPI. The paper contains numerical experiments showing almost optimal speedup on unstructured mesh problems on a range of four platforms and in addition gives illustrations of the use of the package to investigate several questions of current interest in the analysis of Schwarz methods. The package is available in public domain from the home page http://www.maths.bath.ac.uk/∼mjh/.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Digitale Medien
    Digitale Medien
    Springer
    Advances in computational mathematics 11 (1999), S. 355-375 
    ISSN: 1572-9044
    Schlagwort(e): periodic quasi-wavelet ; integral equation ; multiscale ; 45G10 ; 65F10 ; 65J15 ; 65N30
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: 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.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    Digitale Medien
    Digitale Medien
    Springer
    BIT 34 (1994), S. 313-317 
    ISSN: 1572-9125
    Schlagwort(e): 65F10 ; 65F15 ; 65F35 ; Toeplitz matrix ; circulant matrix ; best conditioned preconditioner ; preconditioned conjugate gradient method
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract We discuss the solution of Hermitian positive definite systemsAx=b by the preconditioned conjugate gradient method with a preconditionerM. In general, the smaller the condition numberκ(M −1/2 AM −1/2 ) is, the faster the convergence rate will be. For a given unitary matrixQ, letM Q = {Q*Λ N Q | Λ n is ann-by-n complex diagonal matrix} andM Q + ={Q*Λ n Q | Λ n is ann-by-n positive definite diagonal matrix}. The preconditionerM b that minimizesκ(M −1/2 AM −1/2 ) overM Q + is called the best conditioned preconditioner for the matrixA overM Q + . We prove that ifQAQ* has Young's Property A, thenM b is nothing new but the minimizer of ‖M −A‖ F overM Q . Here ‖ · ‖ F denotes the Frobenius norm. Some applications are also given here.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    ISSN: 1572-9125
    Schlagwort(e): 65F10 ; 65N30
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: 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.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 6
    Digitale Medien
    Digitale Medien
    Springer
    BIT 29 (1989), S. 916-937 
    ISSN: 1572-9125
    Schlagwort(e): 65F10 ; 65N30 ; 76R05
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: 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.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 7
    ISSN: 1572-9125
    Schlagwort(e): 65F10 ; Semiconductors ; simulation ; partial differential equations
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: 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.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 8
    Digitale Medien
    Digitale Medien
    Springer
    BIT 22 (1982), S. 73-78 
    ISSN: 1572-9125
    Schlagwort(e): 65F10
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: 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.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 9
    Digitale Medien
    Digitale Medien
    Springer
    BIT 22 (1982), S. 233-251 
    ISSN: 1572-9125
    Schlagwort(e): 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
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: 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.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 10
    Digitale Medien
    Digitale Medien
    Springer
    BIT 32 (1992), S. 442-463 
    ISSN: 1572-9125
    Schlagwort(e): 65F10 ; 76S05 ; Minimum discarded fill (MDF) ; thresholdMDF ; minimum updating matrix ; matrix ordering ; preconditioned conjugate gradient
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract There has been increased interest in the effect of the ordering of the unknowns on Preconditioned Conjugate Gradient (PCG) methods. A recently proposed Minimum Discarded Fill (MDF) ordering technique is effective in finding goodILU(l) preconditioners, especially for problems arising from unstructured finite element grids. This algorithm can identify anisotropy in complicated physical structures and orders the unknowns in an appropriate direction. TheMDF technique may be viewed as an analogue of the minimum deficiency algorithm in sparse matrix technology, and hence is expensive to compute for high levelILU(l) preconditioners. In this work, several less expensive variants of theMDF technique are explored to produce cost-effectiveILU preconditioners. The ThresholdMDF ordering combinesMDF ideas with drop tolerance techniques to identify the sparsity pattern in theILU preconditioners. The Minimum Update Matrix (MUM) ordering technique is a simplification of theMDF ordering and is an analogue of the minimum degree algorithm. TheMUM ordering method is especially effective for large matrices arising from Navier-Stokes problems.
    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...