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  (17)
  • domain decomposition  (17)
  • Wiley-Blackwell  (17)
  • American Institute of Physics (AIP)
  • Elsevier
  • MDPI Publishing
  • SpringerOpen
  • Taylor & Francis
  • Mathematics  (17)
  • 1
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 43 (1998), S. 997-1016 
    ISSN: 0029-5981
    Keywords: domain decomposition ; multipoint constraints ; numerical scalability ; Engineering ; Numerical Methods and Modeling
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: We consider the iterative solution by a class of substructuring methods of the large-scale systems of equations arising from the finite element discretization of structural models with an arbitrary set of linear multipoint constraints. We present a methodology for generalizing to such problems numerically scalable substructure based iterative solvers, without interfering with their formulations and their well-established local and global preconditioners. We apply this methodology to the FETI method, and show that the resulting algorithm is numerically scalable with respect to both the substructure and problem sizes. © 1998 John Wiley & Sons, Ltd.
    Additional Material: 5 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Numerical Methods for Partial Differential Equations 14 (1998), S. 407-437 
    ISSN: 0749-159X
    Keywords: Maxwell's equations ; magnetotellurics ; domain decomposition ; Mathematics and Statistics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics
    Notes: A collection of global and domain decomposition mixed finite element schemes for the approximate solution of the harmonic Maxwell's equations on a bounded domain with absorbing boundary conditions at the artificial boundaries are presented. The numerical procedures allow us to solve efficiently the direct problem in magnetotellurics consisting of determining the electromagnetic scattered field in a two-dimensional earth model of arbitrary conductivity properties. Convergence results for the numerical procedures are derived. © 1998 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 14: 407-437, 1998
    Additional Material: 1 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Numerical Methods for Partial Differential Equations 14 (1998), S. 717-737 
    ISSN: 0749-159X
    Keywords: parallel ; domain decomposition ; nonlinear ; elliptic equation ; space decomposition ; Mathematics and Statistics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics
    Notes: This work presents some space decomposition algorithms for a convex minimization problem. The algorithms has linear rate of convergence and the rate of convergence depends only on four constants. The space decomposition could be a multigrid or domain decomposition method. We explain the detailed procedure to implement our algorithms for a two-level overlapping domain decomposition method and estimate the needed constants. Numerical tests are reported for linear as well as nonlinear elliptic problems. © 1998 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 14: 717-737, 1998
    Additional Material: 7 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Numerical Methods for Partial Differential Equations 14 (1998), S. 27-46 
    ISSN: 0749-159X
    Keywords: Parallel ; domain decomposition ; parabolic equation ; space decomposition ; Mathematics and Statistics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics
    Notes: A convergence proof is given for an abstract parabolic equation using general space decomposition techniques. The space decomposition technique may be a domain decomposition method, a multilevel method, or a multigrid method. It is shown that if the Euler or Crank-Nicolson scheme is used for the parabolic equation, then by suitably choosing the space decomposition, only O(| log τ |) steps of iteration at each time level are needed, where τ is the time-step size. Applications to overlapping domain decomposition and to a two-level method are given for a second-order parabolic equation. The analysis shows that only a one-element overlap is needed. Discussions about iterative and noniterative methods for parabolic equations are presented. A method that combines the two approaches and utilizes some of the good properties of the two approaches is tested numerically. © 1998 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 14: 27-46, 1998
    Additional Material: 1 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Numerical Methods for Partial Differential Equations 14 (1998), S. 47-61 
    ISSN: 0749-159X
    Keywords: p-version finite element method ; boundary element method ; interface problem ; preconditioning ; domain decomposition ; additive Schwarz method ; Mathematics and Statistics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics
    Notes: We propose and analyze efficient preconditioners for solving systems of equations arising from the p-version for the finite element/boundary element coupling. The first preconditioner amounts to a block Jacobi method, whereas the second one is partly given by diagonal scaling. We use the generalized minimum residual method for the solution of the linear system. For our first preconditioner, the number of iterations of the GMRES necessary to obtain a given accuracy grows like log2 p, where p is the polynomial degree of the ansatz functions. The second preconditioner, which is more easily implemented, leads to a number of iterations that behave like p log3 p. Computational results are presented to support this theory. © 1998 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 14: 47-61, 1998
    Additional Material: 3 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Chichester : Wiley-Blackwell
    Communications in Numerical Methods in Engineering 13 (1997), S. 61-71 
    ISSN: 1069-8299
    Keywords: domain decomposition ; finite element ; level structure ; genre structure ; Engineering ; Numerical Methods and Modeling
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: An efficient algorithm is developed for automatic partitioning of unstructured meshes for the parallel solution of problems in the finite element method. The algorithm partitions a domain into subdomains with approximately equal loads and good aspect ratios, while the interface nodes are confined to the smallest possible. © 1997 John Wiley & Sons, Ltd.
    Additional Material: 2 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Numerical Linear Algebra with Applications 4 (1997), S. 177-190 
    ISSN: 1070-5325
    Keywords: domain decomposition ; convex minimization ; variational inequality ; elastoplasticity ; plasticity with hardening ; Engineering ; Numerical Methods and Modeling
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics
    Notes: Lions's work on the Schwarz alternating method for convex minimization problems is generalized to a certain non-smooth situation where the non-differentiable part of the functionals is additive and independent with respect to the decomposition. Such functionals arise naturally in plasticity where the material law is a variational inequality formulated in L2(Ω). The application to plasticity with hardening is sketched and gives contraction numbers which are independent of the discretization parameter h and of a possible regularization of the non-smooth material law. © 1997 John Wiley & Sons, Ltd.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Chichester : Wiley-Blackwell
    Communications in Numerical Methods in Engineering 13 (1997), S. 777-783 
    ISSN: 1069-8299
    Keywords: domain decomposition ; conservation law ; time-integration ; spectral element method ; Engineering ; Numerical Methods and Modeling
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A new space-time domain decomposition method (STDDM) is presented. The space-time domain is partitioned in subdomains, and different discretizations are used in each space-time subdomain. Time-integration in space-time variational methods is derived in a different manner from what has been presented so far-it is contained in the time-discontinuous shape functions. This method provides the same rate of convergence as the classical methods, and numerical performance is illustrated on typical one-dimensional linear and non-linear problems, in the particular choice of spectral element type discretization on each subdomain. © 1997 John Wiley & Sons, Ltd.
    Additional Material: 3 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 40 (1997), S. 2717-2737 
    ISSN: 0029-5981
    Keywords: parallel computation ; algebraic partitioning ; domain decomposition ; structural analysis ; finite element method ; iterative solution ; Engineering ; Numerical Methods and Modeling
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: An algebraically partitioned FETI method for the solution of structural engineering problems on parallel computers is presented. The present algorithm consists of three attributes: an explicit generation of the orthogonal null-space matrix associated with the interface nodal forces, the floating subdomain rigid-body modes computed from the subdomain static equilibrium equation of the classical force method and the identification of redundant interface force constraint operator that emanates when the interface force computations are localized. Comparisons of the present method with the previously developed differentially partitioned FETI method are offered in terms of the saddle-point formulations at the end of the paper. A companion paper reports implementation details and numerical performance of the proposed algorithm. © 1997 John Wiley & Sons, Ltd.
    Additional Material: 4 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 40 (1997), S. 1383-1397 
    ISSN: 0029-5981
    Keywords: domain decomposition ; BSSM ; successive over relaxation ; Engineering ; Numerical Methods and Modeling
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: In the present paper a new adaptive successive over relaxation domain decomposition technique is developed for the boundary spectral strip method. The proposed scheme is based on dividing the overall domain of the problem into several subdomains. First each of the subdomains in the BIEM matrices is analysed independently. These matrices together with an arbitrary initial guess of displacements on the interface of each two neighbouring subdomains, enable an iterative and a very efficient solution of the whole problem. An adaptive procedure, based on comparing two norms along the interface of subregions, is carried out to impose successive over relaxation convergence. Numerical results comparing the present scheme with single domain solutions emphasize the capability of the proposed technique regarding accuracy and computational efforts. © 1997 by John Wiley & Sons, Ltd.
    Additional Material: 11 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 11
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 40 (1997), S. 2739-2758 
    ISSN: 0029-5981
    Keywords: parallel computation ; algebraic partitioning ; domain decomposition ; structural analysis ; finite element method ; iterative solution ; Engineering ; Numerical Methods and Modeling
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: This paper presents the algorithmic performance of an algebraically partitioned Finite Element Tearing and Interconnection (FETI) method presented in a companion paper. A simple structural assembly topology is employed to illustrate the implementation steps in a Matlab software environment. Numerical results indicate that the method is scalable, provided the iterative solution preconditioner employs the reduced interface Dirichlet preconditioner. A limited comparison of the present method with the differentially partitioned FETI method with corner modes is also offered. Based on this comparison and a reasonable extrapolation, we conclude the present algebraically partitioned FETI method possesses a similar iteration convergence property of the differentially partitioned FETI method with corner modes. © 1997 John Wiley & Sons, Ltd.
    Additional Material: 13 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Numerical Methods for Partial Differential Equations 13 (1997), S. 699-715 
    ISSN: 0749-159X
    Keywords: parallel algorithm ; domain decomposition ; Local Fourier Basis ; Nonlinear Galerkin Method ; Mathematics and Statistics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics
    Notes: We present a high-order parallel algorithm, which requires only the minimum interprocessor communication dictated by the physical nature of the problem at hand. The parallelization is achieved by domain decomposition. The discretization in space is performed using the Local Fourier Basis method. The continuity conditions on the interfaces are enforced by adding homogeneous solutions. Such solutions often have fast decay properties, which can be utilized to minimize interprocessor communication. In effect, the predominant part of the computation is performed independently in the subdomains (processors) or using only local communication. A novel element of the present parallel algorithm is the incorporation of a Nonlinear Galerkin strategy to accelerate the computation and stabilize the time integration process. The basic idea of this approach consists of decomposition of the variables into large scale and small scale components with different treatment of these large and small scales. The combination of the Multidomain Fourier techniques with the Nonlinear Galerkin (NLG) algorithm is applied here to solve incompressible Navier-Stokes equations. Results are presented on direct numerical simulation of two-dimensional homogeneous turbulence using the NLG method. © 1997 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 13: 699-715, 1997
    Additional Material: 11 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 13
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Numerical Linear Algebra with Applications 3 (1996), S. 91-111 
    ISSN: 1070-5325
    Keywords: boundary integral operators ; domain decomposition ; interface operators ; fast elliptic problem solvers ; parallel algorithms ; preconditioning ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics
    Notes: In this paper a method for fast computations with the inverse to weakly singular, hypersingular and double layer potential boundary integral operators associated with the Laplacian on Lipschitz domains is proposed and analyzed. It is based on the representation formulae suggested for above-mentioned boundary operations in terms of the Poincare-Steklov interface mappings generated by the special decompositions of the interior and exterior domains. Computations with the discrete counterparts of these formulae can be efficiently performed by iterative substructuring algorithms provided some asymptotically optimal techniques for treatment of interface operators on subdomain boundaries. For both two- and three-dimensional cases the computation cost and memory needs are of the order O(N logp N) and O(N log2 N), respectively, with 1 ≤ p ≤ 3, where N is the number of degrees of freedom on the boundary under consideration (some kinds of polygons and polyhedra). The proposed algorithms are well suited for serial and parallel computations.
    Additional Material: 2 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Numerical Linear Algebra with Applications 3 (1996), S. 221-237 
    ISSN: 1070-5325
    Keywords: sparse matrix ; iterative methods ; preconditioning ; graph partitioning ; domain decomposition ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics
    Notes: Domain decomposition methods for finite element problems using a partition based on the underlying finite element mesh have been extensively studied. In this paper, we discuss algebraic extensions of the class of overlapping domain decomposition algorithms for general sparse matrices. The subproblems are created with an overlapping partition of the graph corresponding to the sparsity structure of the matrix. These algebraic domain decomposition methods are especially useful for unstructured mesh problems. We also discuss some difficulties encountered in the algebraic extension, particularly the issues related to the coarse solver.
    Additional Material: 4 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 15
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 38 (1995), S. 667-683 
    ISSN: 0029-5981
    Keywords: Navier-Stokes ; pseudospectral element method ; multi-grid method ; domain decomposition ; Schwarz Alternating Procedure (SAP) ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A new multi-grid (two-grid) pseudospectral element method has been carried out for solution of incompressible flow in terms of primitive variable formulation. The main objective of the proposed method is to apply the multi-grid technique solving the incompressible flow problems associated with three commonly encountered multi-grid environments. In domain decomposition terminology, it includes (I) partially overlapped subdomains, each of which has same types of grids; (II) partially overlapped subdomains, each of which has different types of grids; (III) local adaptive subdomains fully overlapped with the original computational domain (composite grids).The approach for flow problems, complex geometry or not, is to first divide the computational domain into a number of subdomains with the inter-overlapping area (partially or fully overlapped). In categories I and II, the fine-grid or coarse-grid subdomains can be defined by their representation, while in category III the fine-grid or coarse-grid subdomains are defined as usual. Next, implement the Schwarz Alternating Procedure (SAP) to exchange the data among subdomains, where the coarse-grid correction is used to remove the high frequency error that occurs when the data interpolation from the fine-grid subdomain to the coarse-grid subdomain is conducted. The strategy behind the coarse-grid correction is to adopt the operator of the divergence of velocity field, which intrinsically links the pressure equation, into this process. The solution of each subdomain can be efficiently solved by the direct (or iterative) eigenfunction expansion technique or preconditioned method with the least storage requirement, i.e. O(N2) in 2-D.Numerical results of (i) driven cavity flow (Re = 100,400) with Cartesian grids (category I) in each subdomain, (ii) driven cavity flow (Re = 3200) with local adaptive grids (category III) in each subdomain, and (iii) flow over a cylinder (Re = 250) with ‘O’ grids in one subdomain and Cartesian grids in another (category II) will be presented in the paper to account for the versatility of the proposed multi-grid method.
    Additional Material: 11 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 16
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 38 (1995), S. 3831-3853 
    ISSN: 0029-5981
    Keywords: domain decomposition ; dynamics ; nonlinear ; parallel processing ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: We present a new efficient and scalable domain decomposition method for solving implicitly linear and non-linear time-dependent problems in computational mechanics. The method is derived by adding a coarse problem to the recently proposed transient FETI substructuring algorithm in order to propagate the error globally and accelerate convergence. It is proved that in the limit for large time steps, the new method converges toward the FETI algorithm for time-independent problems. Computational results confirm that the optimal convergence properties of the time-independent FETI method are preserved in the time-dependent case. We employ an iterative scheme for solving efficiently the coarse problem on massively parallel processors, and demonstrate the effective scalability of the new transient FETI method with the large-scale finite element dynamic analysis on the Paragon XP/S and IBM SP2 systems of several diffraction grating finite element structural models. We also show that this new domain decomposition method outperforms the popular direct skyline solver. The coarse problem presented herein is applicable and beneficial to a large class of Lagrange multiplier based substructuring algorithms for time-dependent problems, including the fictitious domain decomposition method.
    Additional Material: 3 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 17
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Numerical Linear Algebra with Applications 2 (1995), S. 363-393 
    ISSN: 1070-5325
    Keywords: Peaceman - Rachford procedure ; domain decomposition ; nonconforming finite element spaces ; parallel processing ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics
    Notes: This paper presents a general method to associate the operator splitting for the Peaceman - Rachford procedure with a decomposition of the domain in problems arising from finite element discretization of partial differential equations. The algorithm is provably convergent without any symmetry requirement. Moreover, this method possesses the significant advantage of making the linear systems of the Peaceman - Rachford iteration block diagonal and therefore perfectly appropriate for parallel processing. Not only is sparsity not affected but a reduction of the bandwidth occurs. In fact, for appropriate choices of nonconforming finite element spaces, this method makes directly possible elementwise processing. This option remains available in general for higher-dimensional problems by applying the splitting algorithm recursively. Practical implementation requires nothing more than the standard finite element assembly procedure and some bookkeeping to relate a few different orderings of the nodes. In addition to all these attractive features, the method is rapidly convergent and remains highly competitive even when used on a serial machine.
    Additional Material: 6 Ill.
    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...