Transactions on Modelling and Simulation vol 19, 1998 WIT Press, ISSN X
|
|
- Aubrey Mills
- 5 years ago
- Views:
Transcription
1 Cost estimation of the panel clustering method applied to 3-D elastostatics Ken Hayami* & Stefan A. Sauter^ * Department of Mathematical Engineering and Information Physics, Graduate School of Engineering, University of Tokyo, Tokyo, Japan, hayami@simplex.t.u-tokyo.ac.jp % Lehrstuhl fur Praktische Mathematik, Mathematisches Seminar Bereich II, Christian-Albrechts-Universitdt zu Kiel, D Kiel, Germany, sas@numerik.uni-kiel.de Abstract We will present an efficient algorithm for the panel clustering method for the three-dimensional elastostatic problem, which reduces the memory and computational work for the boundary element method. In order to make the necessary polynomial expansions for the clustering simple, the fundamental solution for the displacement components are expressed as a linear combination of partial derivatives of the distance r between the observation point and the field point. It is shown that this approach is far more efficient compared to the standard expression by comparing the estimates for the computational work. 1 Introduction Although the Boundary Element Method (BEM) enjoys the advantage of the boundary only discretization, a serious computational difficulty arises due to its dense matrix formulation for large scale three-dimensional problems, since the method requires O(JV^) memory and O(JV^) computational work using the conventional approach, where N is the number of unknowns. The situation is even worse for the three-dimensional elastostatic problem, where the number of unknowns is three times that of the potential problem, since the unknowns at each node is a vector instead of a scalar.
2 34 Boundary Element Research In Europe Hackbusch and Nowak[l] proposed the panel clustering method in order to overcome this difficulty. The main idea is to approximate the farfieldusing polynomial expansions around a centre of a cluster of panels or boundary elements, thus reducing the O(N^) dense matrix vector multiplication to a O(7V(log N)*) sparse matrix vector multiplication for each iteration of the iterative linear solver. The authors previously proposed a formulation of the panel clustering method for the three-dimensional elastostatic problem [2]. In this paper we will present an efficient algorithm for calculating the expansion coefficients for the panel clustering, which is the most time and memory consuming part of the method, and the computational costs will be estimated. 2 The boundary element formulation of 3-D elastostatics The boundary integral equation for the three-dimensional (linear, isotropic) elastostatic problem is given by + c.p. (f= 1,2,3), (1) where we have used Einstein's convention for the summation over the repeated index k = 1,2,3, F is the boundary of the domain under consideration, %,P& are the displacement and traction components, respectively, %(#) = ^6/& when F is smooth at a, and the body force term has been neglected. u*k(x,y) is the fundamental displacement, which is usually given by where /z is the shear modulus, v is the Poisson's ratio, r := \y #, r^ := dr/dykj x = (x\,x^x^ and y = (3/1,2/2,2/3)^- However, it will prove useful [2] to use the alternative expression: 1 f ^ 1 1,gX ^r,mm,6 2(1 _y) ^J'
3 Boundary Element Research In Europe 35 The fundamental traction component is given by P%(%,2/) = <?;%%, = A%%,%6 + /4%j + %W%' (4) where n/ is the component of the unit outward normal vector at y G F Next, the boundary T is discretized into boundary elements or panels TT^, (a = 1,...,n). Although the following discussion is also valid for higher order elements, assume constant elements, and let x" be the point representing 7r<%, to obtain 0=1 (a = l,._,7z; /= 1,2,3), (5) where uf = u(x&) etc. Given the boundary data, equation (5) is a system of linear equations for the unknown boundary displacement and traction components u and p%, where the matrix is dense and nonsymmetric. Hence, if it is solved using LU-decomposition, the computational work is O(N*) &%d memory O(JV^), where N = 3n is the number of unknowns. Alternatively, one could use iterative solvers for nonsymmetric matrices, such as the GMRES method. Since the system of equations arising from boundary integral equations is usually well conditioned, the method should converge within M < N iterations with the use of a suitable preconditioner when necessary. In this method, the dominant part of the computation is the dense matrix-vector multiplication corresponding to equation (5) for the unknown boundary data or iteration vector, which costs O(N^) for each iteration. Hence, the amount of computational work is reduced from O(TV^) to O(MN^), but the memory required is still O(N^), and it is this memory bottle-neck that hinders the solution of large scale problems using the boundary element method. 3 The panel clustering method The reason why the matrix-vector product for the iterative solution of equation (5) is dense is because the observation point x<* on the element I\ is related to all the elements Fp on the boundary through the kernels p*k(x<*,y) and u*k(x *,y).
4 36 Boundary Element Research In Europe The panel clustering method [1] was proposed to reduce the required memory and computational work for computing such matrixvector products. The method makes use of polynomial expansions to approximate the integral kernels for cluster of elements which are sufficiently far from the observation point, thus reducing the amount of computation and required memory. Let 6(%,!/X%)dr(2,) (6) p represent the integrals in equation (1). In the farfield (i.e. when x - y \ is sufficiently large) k(x,y) is approximated by a piecewise polynomial &#% (#,%/) with respect to %/, which may be based on thetaylor expansion around a centre y R^ expressed as global polynomials of y: 66/rn where /m is an index set of size (t/m < Cjm?. The integer m is the order of the expansion. The functions $i(y) must be independent of x and the centre y. Furthermore, integrals of $^(y) over single boundary elements F/? must be easily computable. Usually, $*(t/) is a (piecewise) polynomial over each element F^. The error of the expansion of equation (7) depends on the order m and on the distance y - y \ from the centre, i.e. A(*,2/) - W*,%) < Ci(C27?r 6(a:,y)l &" all y - ^ < 7? % - %, where 0 < rj < 1. Next, "clusters" r, which are unions of several boundary elements 7T0, are introduced. For each observation point %, the boundary F can be represented by a union of certain number of elements and clusters: F = 7riU7r2U...U7TpUriUr2U...Urc (TT^ : elements, TJ : clusters). (8) Since the clusters TJ are unions of many elements, the sum p + c can be considerably smaller (O(logn)) than the number of elements n. The integral of equation (6) can now be expressed as j=l
5 Boundary Element Research In Europe 37 The first term corresponding to the "near field" TI U 7r2 U... U Tip will be evaluated directly. The clusters TJ correspond to the "far field", where the expansion (7) around a centre y = y^ of TJ can be exploited, i.e. we can approximate the integral over TJ by replacing k by km to obtain Since the quantities J' («) = / *»(y)tt(»)dr(»), (j = l.-.c) are independent of a, they will be computed in the first phase for all indices i and clusters r. Then the evaluation of equation (9) can be performed for all element nodes x", 1 < a < n, by = K.K;/)4/4, which has tt/m =0(ro3) terms independent of the size of the cluster TJ, and Jj.(w) can be shared among different %". By taking a hierarchy of clusters, the number of all possible clusters (consisting of more than one element) for all JB«, 1 < a < n can be kept under the number of elements n [1]. The error of approximating the integral /,. k(x,y)u(y}ay(y) can be controlled by keeping the size of the clusters sufficiently small compared to the distance from x. A partition of T by equation (8) is called "admissible" with respect to x when the clusters are sufficiently small in this sense. The admissible covering with the smallest number of members is used. 4 Computation of the expansion coefficients The computation of the expansion coefficients K,(a;;j/ ) in (7) is the most time-consuming part of the panel clustering method. Let km(x,y) be the Taylor expansion of k(x,y) around yr to the m-th order, i.e. where,:= K^f, ", NO, 1 < «No := {0}UN. ~ and z =
6 38 Boundary Element Research In Europe Sauter [3] proposed an efficient algorithm for calculating KV(X, j/r) when k(x,y) = % - J/H"""*, which is given in the following. Let [x] denote the integer part of x 6 R, := x - Algorithm a) Compute s\(yr] for 0 < / < m and u? for 0 < V{ < m, 1 < i < 3 b) Compute for all 1/3, / E NO; */s + / < rn : c) Compute Df'** for r/2,^3,1 E NO; ^2 + ^3 + / < m T-\t/2»^3. JJt. d) Compute D" for all i/ < m : e) Compute the coefficients % (%,%/?) using the following recursion: 1. For v \ m 1,...,0, Compute {n^ U if II k K \u f/ I I y^3.^ j l/ < Aj < TTi where e* is the unit vector such that (e;)j = %. 2. Compute for all v E Njj, i/ < m :
7 Boundary Element Research In Europe 39 The total computational work for computing %,/(%, */T),H < for fixed,j/t is Wn = (5nf + 25m* + 43m + 71) eo + 1 neo, (10) LZi where eo stands for an elementary operation such as ±, X,-f, and neo stands for a non-elementary operation (namely square root). The memory required for K^(x,j/r),H < m is Nm = KM < m} = i(m* + 3m' + 2m). Next, we will make use of the expression (3) and the preceding algorithm to obtain polynomial expansions for the three-dimensional elastostatic kernels. First, consider approximating the fundamental displacement u*k(x,y) for a cluster r of elements by the polynomial expansion obtained by the m-th order Taylor expansion around %/ = %/?, i.e. Then, the integral over the cluster r is approximated by p 0=1 where the last approximation is valid for constant elements, where Pk(y) «pf,l < fc < 3 for y 7T0, and the farfieldcoefficients are given by 31 := / t/"dr(y). (12) J^P Let fp denote the p-th order (Taylor) expansion of /. Then, we have Lemma 1 Here the _ denotes that Einstein's convention for repeated indices do not apply. < can be obtained by Algorithm 1 with 7 = -1.
8 40 Boundary Element Research In Europe Thus, (3) gives for / ^ 6, /A%,2/T) = - i^ ^(^/ +!)(*% + l)<+e,+e/^,%/t) (13) and for / = A;, %=! where an = 1L Note that it is only necessary to compute and store & * for 1 < I < k < 3, due to symmetry, so that the memory required for f/ < m is 6JV = m* + 3m^ + 2m. As for the fundamental traction pj^, ^ is a function not only of spatial derivatives of r but also of the unit outward normal n/(y) to the boundary T, which is generally a piecewise polynomial (cf. (4)), so that it is not possible to obtain a global expansion for p^(x,y). Instead, we will expand parts of p^ by global polynomials, as follows. From (4), we have 4- i/ <m ( ^'X^ /3=1 /5=1 J (15) where the farfieldcoefficients are given by /^ ^ := Jpn%, and constant elements: rij(y) w n?, Uk(y} «wf for y ftp are used. (High order elements can be treated similarly.) The expansion coefficients for u*^ can be computed using Lemma 2
9 Boundary Element Research In Europe 41 5 Estimates of computational costs First, the computational work to obtain the expansion coefficients will be estimated. According to (10), the work to obtain < for \v\ < m + 3 is Wm+3 = (6^ + T# * + IT ' + 2f m + 14o) eo + 1 neo. Next, K$* for 1 < I < k < 3 and i/ < ra+1 is obtained using (13) and 7 " ' '» * (14) with work: l4(? + 6m* + llm + 6)eO. Finally, «""''', 1 < / < 3 and K^'^^\ 1 < / < 3, 1 < k < j < 3; i/ < m are computed using Lemma 2 with work: BIANCO = (f ^ + T^ + 27m) eo. Hence, the total work to compute the necessary expansion coefficients Transactions on Modelling and Simulation vol 19, 1998 WIT Press, ISSN X is / 5 A 415 a 508 o 929, A _, l^n = [ Ji^4 _ _ ^3 _ _ ^2 _ _ yn eo + V / The memory required to store the expansion coefficients for \v\ < m for tijfc, 1 < / < k < 3 is 67V, for A%, 1 < / < 3 is 37V^, and for Mkj + %%,&), 1 < '^ 3, 1 < j <fc < 3 is 18JV^, which gives a total of % = 27JV^, where JV^ = i/ < m - i(m^ + Sm^ + 2m). On the other hand, if we had used the standard expression (2) for u*^, the work estimate would have been /2 «% 79 X % TC = (^ + 8m^ym' + m^ + -^m^-^m+ eo + IneO, which is greater than the W above for m > 2. The reason why the standard expression requires O(ra^) work is because it involves multiplication of polynomials with O(m^) terms each, such as (r,/) and (r,/.)m, which requires O(m^) work if done in the straightforward way. The required memory using the standard expression is the same as above. Since the number of admissible clusters per observation point is O(log n) and the order of expansion m necessary for an approximation consistent with the discretization error is O(logn), where n is the number of boundary elements (observation points) [1], the total work necessary for the computation of the expansion coefficients is O(nlognm^) = O(nlog* n). The memory required is O(n log n m?) = O(nlog^n).
10 42 Boundary Element Research In Europe Next, the work for the computation of the farfieldcoefficients of (12) etc. is O(nm^) =O(nlog*n) [1] and the memory is O(nra^) = O(nlog^n). As for the work for each iteration, assuming that the number of elements in a cluster is p, the work per iteration for computing Ir <&(*,%W%/)drW using (11) is 3{(6p + 3)7V - l}eo and that for computing frp*k(*>y)uk(ywy) using (15) is 3{(24p+10)JV^-l}eO, so that the work for a matrix vector multiplication iso(nra^) O(nlog^ n) and the work and memory for other parts of the iteration such as in GMRES is O(n). Hence, the dominant part of the whole algorithm is the computation of the expansion coefficients, which consumes O(nlog^ n) work and O(nlog^n) memory. 6 Conclusions We presented an algorithm for applying the panel clustering method to the three-dimensional elastostatic problem and estimated its computational complexity. It was shown that the computation of the expansion coefficients is the dominant part of the algorithm and that expressing the fundamental displacement in terms of a linear combination (3) of the second order spatial derivatives of the distance between the observation point and the field point substantially reduces the computational costs. References [1] Hackbusch, W. and Nowak, Z.P., On the fast matrix multiplication in the boundary element method by panel clustering, Numerische Mathematik, Vol. 54, pp , [2] Hayami, K. and Sauter, S., Application of the panel clustering method to the three-dimensional elastostatic problem, Boundary Elements XIX, Computational Mechanics Publications, pp , [3] Sauter, Der Aufwand der Panel-Clustering-Methode fur Integralgleichungen, Bericht Nr. 9115, Institut fur Informatik und Praktische Mathematik, Christian-Albrechts-Universitat Kiel, 1991.
Transactions on Modelling and Simulation vol 18, 1997 WIT Press, ISSN X
Application of the panel clustering method to the three-dimensional elastostatic problem K. Hayami* and S. A. Sauter** ^Department of Mathematical Engineering and Information Physics, School ofengineering,
More informationTransactions on Modelling and Simulation vol 18, 1997 WIT Press, ISSN X
Application of the fast multipole method to the 3-D BEM analysis of electron guns T. Nishida and K. Hayami Department of Mathematical Engineering and Information Physics, School of Engineering, University
More informationFast multipole boundary element method for the analysis of plates with many holes
Arch. Mech., 59, 4 5, pp. 385 401, Warszawa 2007 Fast multipole boundary element method for the analysis of plates with many holes J. PTASZNY, P. FEDELIŃSKI Department of Strength of Materials and Computational
More informationMax-Planck-Institut fur Mathematik in den Naturwissenschaften Leipzig H 2 -matrix approximation of integral operators by interpolation by Wolfgang Hackbusch and Steen Borm Preprint no.: 04 200 H 2 -Matrix
More informationAPPROXIMATING GAUSSIAN PROCESSES
1 / 23 APPROXIMATING GAUSSIAN PROCESSES WITH H 2 -MATRICES Steffen Börm 1 Jochen Garcke 2 1 Christian-Albrechts-Universität zu Kiel 2 Universität Bonn and Fraunhofer SCAI 2 / 23 OUTLINE 1 GAUSSIAN PROCESSES
More informationAn H-LU Based Direct Finite Element Solver Accelerated by Nested Dissection for Large-scale Modeling of ICs and Packages
PIERS ONLINE, VOL. 6, NO. 7, 2010 679 An H-LU Based Direct Finite Element Solver Accelerated by Nested Dissection for Large-scale Modeling of ICs and Packages Haixin Liu and Dan Jiao School of Electrical
More informationSIMULATION OF PLANE STRAIN FIBER COMPOSITE PLATES IN BENDING THROUGH A BEM/ACA/HM FORMULATION
8 th GRACM International Congress on Computational Mechanics Volos, 12 July 15 July 2015 SIMULATION OF PLANE STRAIN FIBER COMPOSITE PLATES IN BENDING THROUGH A BEM/ACA/HM FORMULATION Theodore V. Gortsas
More informationFast Multipole BEM for Structural Acoustics Simulation
Fast Boundary Element Methods in Industrial Applications Fast Multipole BEM for Structural Acoustics Simulation Matthias Fischer and Lothar Gaul Institut A für Mechanik, Universität Stuttgart, Germany
More informationKarhunen-Loève Approximation of Random Fields Using Hierarchical Matrix Techniques
Institut für Numerische Mathematik und Optimierung Karhunen-Loève Approximation of Random Fields Using Hierarchical Matrix Techniques Oliver Ernst Computational Methods with Applications Harrachov, CR,
More informationReduction of Smith Normal Form Transformation Matrices
Reduction of Smith Normal Form Transformation Matrices G. Jäger, Kiel Abstract Smith normal form computations are important in group theory, module theory and number theory. We consider the transformation
More informationH 2 -matrices with adaptive bases
1 H 2 -matrices with adaptive bases Steffen Börm MPI für Mathematik in den Naturwissenschaften Inselstraße 22 26, 04103 Leipzig http://www.mis.mpg.de/ Problem 2 Goal: Treat certain large dense matrices
More informationGeneralized Fibonacci Numbers and Blackwell s Renewal Theorem
Generalized Fibonacci Numbers and Blackwell s Renewal Theorem arxiv:1012.5006v1 [math.pr] 22 Dec 2010 Sören Christensen Christian-Albrechts-Universität, Mathematisches Seminar, Kiel, Germany Abstract:
More informationAn Introduction to Hierachical (H ) Rank and TT Rank of Tensors with Examples
An Introduction to Hierachical (H ) Rank and TT Rank of Tensors with Examples Lars Grasedyck and Wolfgang Hackbusch Bericht Nr. 329 August 2011 Key words: MSC: hierarchical Tucker tensor rank tensor approximation
More informationFast Multipole Methods for Incompressible Flow Simulation
Fast Multipole Methods for Incompressible Flow Simulation Nail A. Gumerov & Ramani Duraiswami Institute for Advanced Computer Studies University of Maryland, College Park Support of NSF awards 0086075
More informationFRIEDRICH-ALEXANDER-UNIVERSITÄT ERLANGEN-NÜRNBERG. Lehrstuhl für Informatik 10 (Systemsimulation)
FRIEDRICH-ALEXANDER-UNIVERSITÄT ERLANGEN-NÜRNBERG INSTITUT FÜR INFORMATIK (MATHEMATISCHE MASCHINEN UND DATENVERARBEITUNG) Lehrstuhl für Informatik 0 (Systemsimulation) On a regularization technique for
More informationPoisson Solvers. William McLean. April 21, Return to Math3301/Math5315 Common Material.
Poisson Solvers William McLean April 21, 2004 Return to Math3301/Math5315 Common Material 1 Introduction Many problems in applied mathematics lead to a partial differential equation of the form a 2 u +
More informationAlgebraic Multigrid Preconditioners for Computing Stationary Distributions of Markov Processes
Algebraic Multigrid Preconditioners for Computing Stationary Distributions of Markov Processes Elena Virnik, TU BERLIN Algebraic Multigrid Preconditioners for Computing Stationary Distributions of Markov
More informationJournal of Inequalities in Pure and Applied Mathematics
Journal of Inequalities in Pure and Applied Mathematics ON A HYBRID FAMILY OF SUMMATION INTEGRAL TYPE OPERATORS VIJAY GUPTA AND ESRA ERKUŞ School of Applied Sciences Netaji Subhas Institute of Technology
More informationOUTLINE ffl CFD: elliptic pde's! Ax = b ffl Basic iterative methods ffl Krylov subspace methods ffl Preconditioning techniques: Iterative methods ILU
Preconditioning Techniques for Solving Large Sparse Linear Systems Arnold Reusken Institut für Geometrie und Praktische Mathematik RWTH-Aachen OUTLINE ffl CFD: elliptic pde's! Ax = b ffl Basic iterative
More informationInterpolation in h-version finite element spaces
Interpolation in h-version finite element spaces Thomas Apel Institut für Mathematik und Bauinformatik Fakultät für Bauingenieur- und Vermessungswesen Universität der Bundeswehr München Chemnitzer Seminar
More informationPractical Tips for Modelling Lot-Sizing and Scheduling Problems. Waldemar Kaczmarczyk
Decision Making in Manufacturing and Services Vol. 3 2009 No. 1 2 pp. 37 48 Practical Tips for Modelling Lot-Sizing and Scheduling Problems Waldemar Kaczmarczyk Abstract. This paper presents some important
More informationHierarchical Matrices. Jon Cockayne April 18, 2017
Hierarchical Matrices Jon Cockayne April 18, 2017 1 Sources Introduction to Hierarchical Matrices with Applications [Börm et al., 2003] 2 Sources Introduction to Hierarchical Matrices with Applications
More informationR ij = 2. Using all of these facts together, you can solve problem number 9.
Help for Homework Problem #9 Let G(V,E) be any undirected graph We want to calculate the travel time across the graph. Think of each edge as one resistor of 1 Ohm. Say we have two nodes: i and j Let the
More informationChapter Two: Numerical Methods for Elliptic PDEs. 1 Finite Difference Methods for Elliptic PDEs
Chapter Two: Numerical Methods for Elliptic PDEs Finite Difference Methods for Elliptic PDEs.. Finite difference scheme. We consider a simple example u := subject to Dirichlet boundary conditions ( ) u
More informationConjecture 4. f 1 (n) = n
26 International Conference on Computational Science and Computational Intelligence Computation in the Enumeration of Integer Matrices Shanzhen Gao, Keh-Hsun Chen Department of Computer Science, College
More informationAMS 529: Finite Element Methods: Fundamentals, Applications, and New Trends
AMS 529: Finite Element Methods: Fundamentals, Applications, and New Trends Lecture 3: Finite Elements in 2-D Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Finite Element Methods 1 / 18 Outline 1 Boundary
More informationTechnical University Hamburg { Harburg, Section of Mathematics, to reduce the number of degrees of freedom to manageable size.
Interior and modal masters in condensation methods for eigenvalue problems Heinrich Voss Technical University Hamburg { Harburg, Section of Mathematics, D { 21071 Hamburg, Germany EMail: voss @ tu-harburg.d400.de
More informationEnumerate all possible assignments and take the An algorithm is a well-defined computational
EMIS 8374 [Algorithm Design and Analysis] 1 EMIS 8374 [Algorithm Design and Analysis] 2 Designing and Evaluating Algorithms A (Bad) Algorithm for the Assignment Problem Enumerate all possible assignments
More informationTechnische Universität Graz
Technische Universität Graz An efficient algebraic multigrid preconditioner for a fast multipole boundary element method G. Of Berichte aus dem Institut für Numerische Mathematik Bericht 2007/8 Technische
More informationIterative coupling in fluid-structure interaction: a BEM-FEM based approach
oundary Elements and Other Mesh Reduction Methods XXV 205 terative coupling in fluid-structure interaction: a EM-EM based approach D. Soares Jr 1,2, W. J. Mansur 1 & O. von Estorff 3 1 Department of Civil
More informationA NOTE ON THE DEGREE OF POLYNOMIAL APPROXIMATION*
1936.] DEGREE OF POLYNOMIAL APPROXIMATION 873 am = #121 = #212= 1 The trilinear form associated with this matrix is x 1 yiz2+xiy2zi+x2yizi, which is equivalent to L under the transformations Xi = xi, X2
More informationDemystification of the Geometric Fourier Transforms
Demystification of the Geometric Fourier Transforms Roxana Buack, Gerik Scheuermann and Eckhard Hitzer Universität Leipzig, Institut für Informatik, Abteilung für Bild- und Signalverarbeitung, Augustuplatz
More informationAn adaptive fast multipole boundary element method for the Helmholtz equation
An adaptive fast multipole boundary element method for the Helmholtz equation Vincenzo Mallardo 1, Claudio Alessandri 1, Ferri M.H. Aliabadi 2 1 Department of Architecture, University of Ferrara, Italy
More informationThe Fast Multipole Method and other Fast Summation Techniques
The Fast Multipole Method and other Fast Summation Techniques Gunnar Martinsson The University of Colorado at Boulder (The factor of 1/2π is suppressed.) Problem definition: Consider the task of evaluation
More informationfür Mathematik in den Naturwissenschaften Leipzig
Max-Planck-Institut für Mathematik in den Naturwissenschaften Leipzig Approximation of integral operators by H 2 -matrices with adaptive bases (revised version: December 2004) by Steffen Börm Preprint
More informationAn Adaptive Hierarchical Matrix on Point Iterative Poisson Solver
Malaysian Journal of Mathematical Sciences 10(3): 369 382 (2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES Journal homepage: http://einspem.upm.edu.my/journal An Adaptive Hierarchical Matrix on Point
More informationOn Surface Meshes Induced by Level Set Functions
On Surface Meshes Induced by Level Set Functions Maxim A. Olshanskii, Arnold Reusken, and Xianmin Xu Bericht Nr. 347 Oktober 01 Key words: surface finite elements, level set function, surface triangulation,
More informationBounding in Multi-Stage. Stochastic Programming. Problems. Olga Fiedler a Andras Prekopa b
R utcor Research R eport Bounding in Multi-Stage Stochastic Programming Problems Olga Fiedler a Andras Prekopa b RRR 24-95, June 1995 RUTCOR Rutgers Center for Operations Research Rutgers University P.O.
More informationAn implementation of the Fast Multipole Method without multipoles
An implementation of the Fast Multipole Method without multipoles Robin Schoemaker Scientific Computing Group Seminar The Fast Multipole Method Theory and Applications Spring 2002 Overview Fast Multipole
More informationBLAS: Basic Linear Algebra Subroutines Analysis of the Matrix-Vector-Product Analysis of Matrix-Matrix Product
Level-1 BLAS: SAXPY BLAS-Notation: S single precision (D for double, C for complex) A α scalar X vector P plus operation Y vector SAXPY: y = αx + y Vectorization of SAXPY (αx + y) by pipelining: page 8
More informationConflict-Free Colorings of Rectangles Ranges
Conflict-Free Colorings of Rectangles Ranges Khaled Elbassioni Nabil H. Mustafa Max-Planck-Institut für Informatik, Saarbrücken, Germany felbassio, nmustafag@mpi-sb.mpg.de Abstract. Given the range space
More informationBin Sort. Sorting integers in Range [1,...,n] Add all elements to table and then
Sorting1 Bin Sort Sorting integers in Range [1,...,n] Add all elements to table and then Retrieve in order 1,2,3,...,n Stable Sorting Method (repeated elements will end up in their original order) Numbers
More informationGeneralized Finite Element Methods for Three Dimensional Structural Mechanics Problems. C. A. Duarte. I. Babuška and J. T. Oden
Generalized Finite Element Methods for Three Dimensional Structural Mechanics Problems C. A. Duarte COMCO, Inc., 7800 Shoal Creek Blvd. Suite 290E Austin, Texas, 78757, USA I. Babuška and J. T. Oden TICAM,
More informationLower Bounds for q-ary Codes with Large Covering Radius
Lower Bounds for q-ary Codes with Large Covering Radius Wolfgang Haas Immanuel Halupczok Jan-Christoph Schlage-Puchta Albert-Ludwigs-Universität Mathematisches Institut Eckerstr. 1 79104 Freiburg, Germany
More informationUND INFORMATIK. Maximal φ-inequalities for Nonnegative Submartingales. G. Alsmeyer und U. Rösler
ANGEWANDTE MATHEMATIK UND INFORMATIK Maximal φ-inequalities for Nonnegative Submartingales G. Alsmeyer und U. Rösler Universität Münster und Universität Kiel e-mail: gerolda@math.uni-muenster.de, roesler@math.uni-kiel.de
More informationOn the maximal density of sum-free sets
ACTA ARITHMETICA XCV.3 (2000) On the maximal density of sum-free sets by Tomasz Luczak (Poznań) and Tomasz Schoen (Kiel and Poznań) 1. Introduction. For a set A N, let A(n) = A {1,..., n} and { } P(A)
More informationA Fast N-Body Solver for the Poisson(-Boltzmann) Equation
A Fast N-Body Solver for the Poisson(-Boltzmann) Equation Robert D. Skeel Departments of Computer Science (and Mathematics) Purdue University http://bionum.cs.purdue.edu/2008december.pdf 1 Thesis Poisson(-Boltzmann)
More informationElementary linear algebra
Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The
More informationBicriterial Delay Management
Universität Konstanz Bicriterial Delay Management Csaba Megyeri Konstanzer Schriften in Mathematik und Informatik Nr. 198, März 2004 ISSN 1430 3558 c Fachbereich Mathematik und Statistik c Fachbereich
More informationarxiv: v2 [math-ph] 24 Feb 2016
ON THE CLASSIFICATION OF MULTIDIMENSIONALLY CONSISTENT 3D MAPS MATTEO PETRERA AND YURI B. SURIS Institut für Mathemat MA 7-2 Technische Universität Berlin Str. des 17. Juni 136 10623 Berlin Germany arxiv:1509.03129v2
More informationMonadic Second Order Logic and Automata on Infinite Words: Büchi s Theorem
Monadic Second Order Logic and Automata on Infinite Words: Büchi s Theorem R. Dustin Wehr December 18, 2007 Büchi s theorem establishes the equivalence of the satisfiability relation for monadic second-order
More informationAlgorithms as multilinear tensor equations
Algorithms as multilinear tensor equations Edgar Solomonik Department of Computer Science ETH Zurich Technische Universität München 18.1.2016 Edgar Solomonik Algorithms as multilinear tensor equations
More informationHybrid Cross Approximation for the Electric Field Integral Equation
Progress In Electromagnetics Research M, Vol. 75, 79 90, 2018 Hybrid Cross Approximation for the Electric Field Integral Equation Priscillia Daquin, Ronan Perrussel, and Jean-René Poirier * Abstract The
More informationPreprint Alexander Heinlein, Axel Klawonn, and Oliver Rheinbach Parallel Two-Level Overlapping Schwarz Methods in Fluid-Structure Interaction
Fakultät für Mathematik und Informatik Preprint 2015-15 Alexander Heinlein, Axel Klawonn, and Oliver Rheinbach Parallel Two-Level Overlapping Schwarz Methods in Fluid-Structure Interaction ISSN 1433-9307
More informationBETI for acoustic and electromagnetic scattering
BETI for acoustic and electromagnetic scattering O. Steinbach, M. Windisch Institut für Numerische Mathematik Technische Universität Graz Oberwolfach 18. Februar 2010 FWF-Project: Data-sparse Boundary
More informationTechnische Universität Graz
Technische Universität Graz Robust boundary element domain decomposition solvers in acoustics O. Steinbach, M. Windisch Berichte aus dem Institut für Numerische Mathematik Bericht 2009/9 Technische Universität
More informationCLASSIFICATION AND PRINCIPLE OF SUPERPOSITION FOR SECOND ORDER LINEAR PDE
CLASSIFICATION AND PRINCIPLE OF SUPERPOSITION FOR SECOND ORDER LINEAR PDE 1. Linear Partial Differential Equations A partial differential equation (PDE) is an equation, for an unknown function u, that
More informationOTTO H. KEGEL. A remark on maximal subrings. Sonderdrucke aus der Albert-Ludwigs-Universität Freiburg
Sonderdrucke aus der Albert-Ludwigs-Universität Freiburg OTTO H. KEGEL A remark on maximal subrings Originalbeitrag erschienen in: Michigan Mathematical Journal 11 (1964), S. 251-255 A REMARK ON MAXIMAL
More informationFractal two-level finite element method for free vibration of cracked beams
61 Fractal two-level finite element method for free vibration of cracked beams A.Y.T. Leung School of Engineering, University of Manchester, Manchester M13 9PL, UK R.K.L. Su Ove Arup & Partners, Hong Kong
More informationBridging the gap between flat and hierarchical low-rank matrix formats: the multilevel BLR format
Bridging the gap between flat and hierarchical low-rank matrix formats: the multilevel BLR format Amestoy, Patrick and Buttari, Alfredo and L Excellent, Jean-Yves and Mary, Theo 2018 MIMS EPrint: 2018.12
More informationRepresentation of Lie Groups and Special Functions
Representation of Lie Groups and Special Functions Recent Advances by N. Ja. Vilenkint formerly of The Correspondence Pedagogical Institute, Moscow, Russia and A.U. Klimyk Institute for Theoretical Physics,
More information1 Solutions to selected problems
Solutions to selected problems Section., #a,c,d. a. p x = n for i = n : 0 p x = xp x + i end b. z = x, y = x for i = : n y = y + x i z = zy end c. y = (t x ), p t = a for i = : n y = y(t x i ) p t = p
More informationIntroduction to the Numerical Solution of IVP for ODE
Introduction to the Numerical Solution of IVP for ODE 45 Introduction to the Numerical Solution of IVP for ODE Consider the IVP: DE x = f(t, x), IC x(a) = x a. For simplicity, we will assume here that
More informationContinuum mechanics V. Constitutive equations. 1. Constitutive equation: definition and basic axioms
Continuum mechanics office Math 0.107 ales.janka@unifr.ch http://perso.unifr.ch/ales.janka/mechanics Mars 16, 2011, Université de Fribourg 1. Constitutive equation: definition and basic axioms Constitutive
More informationLeast-squares data fitting
EE263 Autumn 2015 S. Boyd and S. Lall Least-squares data fitting 1 Least-squares data fitting we are given: functions f 1,..., f n : S R, called regressors or basis functions data or measurements (s i,
More informationAn accelerated predictor-corrector scheme for 3D crack growth simulations
An accelerated predictor-corrector scheme for 3D crack growth simulations W. Weber 1 and G. Kuhn 2 1,2 1 Institute of Applied Mechanics, University of Erlangen-Nuremberg Egerlandstraße 5, 91058 Erlangen,
More informationA Study of Numerical Elimination for the Solution of Multivariate Polynomial Systems
A Study of Numerical Elimination for the Solution of Multivariate Polynomial Systems W Auzinger and H J Stetter Abstract In an earlier paper we had motivated and described am algorithm for the computation
More informationAlgorithm efficiency analysis
Algorithm efficiency analysis Mădălina Răschip, Cristian Gaţu Faculty of Computer Science Alexandru Ioan Cuza University of Iaşi, Romania DS 2017/2018 Content Algorithm efficiency analysis Recursive function
More informationSOLVING SPARSE LINEAR SYSTEMS OF EQUATIONS. Chao Yang Computational Research Division Lawrence Berkeley National Laboratory Berkeley, CA, USA
1 SOLVING SPARSE LINEAR SYSTEMS OF EQUATIONS Chao Yang Computational Research Division Lawrence Berkeley National Laboratory Berkeley, CA, USA 2 OUTLINE Sparse matrix storage format Basic factorization
More informationDeterministic Polynomial Time Equivalence between Factoring and Key-Recovery Attack on Takagi s RSA
Deterministic Polynomial Time Equivalence between Factoring and Key-Recovery Attack on Takagi s RSA Noboru Kunihiro 1 and Kaoru Kurosawa 2 1 The University of Electro-Communications, Japan kunihiro@iceuecacjp
More informationLarge topological cliques in graphs without a 4-cycle
Large topological cliques in graphs without a 4-cycle Daniela Kühn Deryk Osthus Abstract Mader asked whether every C 4 -free graph G contains a subdivision of a complete graph whose order is at least linear
More informationA Reverse Technique for Lumping High Dimensional Model Representation Method
A Reverse Technique for Lumping High Dimensional Model Representation Method M. ALPER TUNGA Bahçeşehir University Department of Software Engineering Beşiktaş, 34349, İstanbul TURKEY TÜRKİYE) alper.tunga@bahcesehir.edu.tr
More informationNumerical Methods. Elena loli Piccolomini. Civil Engeneering. piccolom. Metodi Numerici M p. 1/??
Metodi Numerici M p. 1/?? Numerical Methods Elena loli Piccolomini Civil Engeneering http://www.dm.unibo.it/ piccolom elena.loli@unibo.it Metodi Numerici M p. 2/?? Least Squares Data Fitting Measurement
More informationM.A. Botchev. September 5, 2014
Rome-Moscow school of Matrix Methods and Applied Linear Algebra 2014 A short introduction to Krylov subspaces for linear systems, matrix functions and inexact Newton methods. Plan and exercises. M.A. Botchev
More informationS N. hochdimensionaler Lyapunov- und Sylvestergleichungen. Peter Benner. Mathematik in Industrie und Technik Fakultät für Mathematik TU Chemnitz
Ansätze zur numerischen Lösung hochdimensionaler Lyapunov- und Sylvestergleichungen Peter Benner Mathematik in Industrie und Technik Fakultät für Mathematik TU Chemnitz S N SIMULATION www.tu-chemnitz.de/~benner
More informationON POLYNOMIALS GENERATED BY TRIANGULAR ARRAYS
ON POLYNOMIALS GENERATED BY TRIANGULAR ARRAYS KR1SHWASWAIVJ! ALLADI* Vivekananda College, Madras 600004, India In this paper we study a class of functions which we call Pascal functions, generated by the
More informationComputation of the Bernstein Coecients on Subdivided. are computed directly from the coecients on the subdivided triangle from the
Computation of the Bernstein Coecients on Subdivided riangles Ralf Hungerbuhler Fakultat fur Mathematik und Informatik, Universitat Konstanz, Postfach 5560 D 97, D{78434 Konstanz, Germany Jurgen Garlo
More informationSEPARATION AXIOMS FOR INTERVAL TOPOLOGIES
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 79, Number 2, June 1980 SEPARATION AXIOMS FOR INTERVAL TOPOLOGIES MARCEL ERNE Abstract. In Theorem 1 of this note, results of Kogan [2], Kolibiar
More informationA Recursive Trust-Region Method for Non-Convex Constrained Minimization
A Recursive Trust-Region Method for Non-Convex Constrained Minimization Christian Groß 1 and Rolf Krause 1 Institute for Numerical Simulation, University of Bonn. {gross,krause}@ins.uni-bonn.de 1 Introduction
More information1. How do error estimators for the Galerkin FEM depend on &, ft? 2. Can the classical Galerkin approach be improved towards a linear rule?
Reliability of finite element methods for the numerical computation of waves F. Ihlenburg*, I. Babuska*, S. Sauted "Institute for Physical Science and Technology, University of Maryland at College Park,
More informationSolving an Elliptic PDE Eigenvalue Problem via Automated Multi-Level Substructuring and Hierarchical Matrices
Solving an Elliptic PDE Eigenvalue Problem via Automated Multi-Level Substructuring and Hierarchical Matrices Peter Gerds and Lars Grasedyck Bericht Nr. 30 März 2014 Key words: automated multi-level substructuring,
More informationOptimal multilevel preconditioning of strongly anisotropic problems.part II: non-conforming FEM. p. 1/36
Optimal multilevel preconditioning of strongly anisotropic problems. Part II: non-conforming FEM. Svetozar Margenov margenov@parallel.bas.bg Institute for Parallel Processing, Bulgarian Academy of Sciences,
More informationON THE THEORY OF ASSOCIATIVE DIVISION ALGEBRAS*
ON THE THEORY OF ASSOCIATIVE DIVISION ALGEBRAS* BY OLIVE C. HAZLETT 1. Relation to the literature. There is a famous theorem to the effect that the only linear associative algebras over the field of all
More informationMATH 590: Meshfree Methods
MATH 590: Meshfree Methods Chapter 34: Improving the Condition Number of the Interpolation Matrix Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu
More informationNotes on Numerical Fluid Mechanics
Notes on Numerical Fluid Mechanics Volume 31 Parallel Algorithm,s for Partial Differential Equations Edited by Wolfgang Hackbusch al V1eweg Parallel Algorithms for Partial Differential Equations Proceedings
More informationNumerical Integration for Multivariable. October Abstract. We consider the numerical integration of functions with point singularities over
Numerical Integration for Multivariable Functions with Point Singularities Yaun Yang and Kendall E. Atkinson y October 199 Abstract We consider the numerical integration of functions with point singularities
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences)
AMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences) Lecture 19: Computing the SVD; Sparse Linear Systems Xiangmin Jiao Stony Brook University Xiangmin Jiao Numerical
More informationFunctions associated to scattering amplitudes. Stefan Weinzierl
Functions associated to scattering amplitudes Stefan Weinzierl Institut für Physik, Universität Mainz I: Periodic functions and periods II: III: Differential equations The two-loop sun-rise diagramm in
More informationResearch Reports on Mathematical and Computing Sciences
ISSN 1342-284 Research Reports on Mathematical and Computing Sciences Exploiting Sparsity in Linear and Nonlinear Matrix Inequalities via Positive Semidefinite Matrix Completion Sunyoung Kim, Masakazu
More informationFEM and sparse linear system solving
FEM & sparse linear system solving, Lecture 9, Nov 19, 2017 1/36 Lecture 9, Nov 17, 2017: Krylov space methods http://people.inf.ethz.ch/arbenz/fem17 Peter Arbenz Computer Science Department, ETH Zürich
More informationEffective matrix-free preconditioning for the augmented immersed interface method
Effective matrix-free preconditioning for the augmented immersed interface method Jianlin Xia a, Zhilin Li b, Xin Ye a a Department of Mathematics, Purdue University, West Lafayette, IN 47907, USA. E-mail:
More informationLecture 2: Linear Algebra Review
EE 227A: Convex Optimization and Applications January 19 Lecture 2: Linear Algebra Review Lecturer: Mert Pilanci Reading assignment: Appendix C of BV. Sections 2-6 of the web textbook 1 2.1 Vectors 2.1.1
More informationNumerical Methods I Non-Square and Sparse Linear Systems
Numerical Methods I Non-Square and Sparse Linear Systems Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 September 25th, 2014 A. Donev (Courant
More informationarxiv:math/ v2 [math.qa] 12 Jun 2004
arxiv:math/0401137v2 [math.qa] 12 Jun 2004 DISCRETE MIURA OPERS AND SOLUTIONS OF THE BETHE ANSATZ EQUATIONS EVGENY MUKHIN,1 AND ALEXANDER VARCHENKO,2 Abstract. Solutions of the Bethe ansatz equations associated
More informationQUASINORMAL FAMILIES AND PERIODIC POINTS
QUASINORMAL FAMILIES AND PERIODIC POINTS WALTER BERGWEILER Dedicated to Larry Zalcman on his 60th Birthday Abstract. Let n 2 be an integer and K > 1. By f n we denote the n-th iterate of a function f.
More informationTwo Lectures on the Ellipsoid Method for Solving Linear Programs
Two Lectures on the Ellipsoid Method for Solving Linear Programs Lecture : A polynomial-time algorithm for LP Consider the general linear programming problem: δ = max cx S.T. Ax b, x R n, () where A =
More informationDomain decomposition methods via boundary integral equations
Domain decomposition methods via boundary integral equations G. C. Hsiao a O. Steinbach b W. L. Wendland b a Department of Mathematical Sciences, University of Delaware, Newark, Delaware 19716, USA. E
More informationResidual iterative schemes for largescale linear systems
Universidad Central de Venezuela Facultad de Ciencias Escuela de Computación Lecturas en Ciencias de la Computación ISSN 1316-6239 Residual iterative schemes for largescale linear systems William La Cruz
More informationSolving linear systems (6 lectures)
Chapter 2 Solving linear systems (6 lectures) 2.1 Solving linear systems: LU factorization (1 lectures) Reference: [Trefethen, Bau III] Lecture 20, 21 How do you solve Ax = b? (2.1.1) In numerical linear
More informationNATIONAL BOARD FOR HIGHER MATHEMATICS. Research Scholarships Screening Test. Saturday, February 2, Time Allowed: Two Hours Maximum Marks: 40
NATIONAL BOARD FOR HIGHER MATHEMATICS Research Scholarships Screening Test Saturday, February 2, 2008 Time Allowed: Two Hours Maximum Marks: 40 Please read, carefully, the instructions on the following
More information