65N30 Finite elements, Rayleigh-Ritz and Galerkin methods, finite methods
Refine
Year of publication
Document Type
- ZIB-Report (27)
- Doctoral Thesis (1)
- Habilitation (1)
Language
- English (29)
Is part of the Bibliography
- no (29)
Keywords
- finite elements (6)
- Maxwell's equations (4)
- preconditioned conjugate gradient methods (3)
- Helmholtz equation (2)
- adaptive mesh refinement (2)
- discontinuous solution (2)
- edge elements (2)
- embedded interface (2)
- finite element method (2)
- finite volume methods (2)
- generic programming (2)
- hierarchical basis (2)
- optimal control (2)
- partial differential equations (2)
- perfectly matched layer (2)
- transparent boundary conditions (2)
- Adaptive Finite Elements (1)
- Algebraic multigrid (1)
- Currents (1)
- Diffeomorphic Registration (1)
- Domain Decomposition (1)
- Elliptic equations (1)
- Fini (1)
- Finite Elements (1)
- Finite Volumen (1)
- Large Deformation (1)
- Matching (1)
- Multigrid Methods (1)
- N\'{e}d\'{e}lec spaces (1)
- Newton method (1)
- PML (1)
- Pelvic heating (1)
- Poisson equation (1)
- Pole condition (1)
- Rayleigh-Ritz and Galerkin Methods (1)
- Schroedinger equation (1)
- Transparent boundary conditions (1)
- Unbounded domains (1)
- Wide angle one-way equation (1)
- Wiener-Hopf techniques (1)
- adaptive (1)
- adaptive finite elements (1)
- adaptive grid orientation (1)
- adaptive grid refinement (1)
- adaptive methods (1)
- affine conjugate Newton methods (1)
- ariable and discontinuous coefficients (1)
- collocation method (1)
- convection diffusion equation (1)
- countable (1)
- cranio-maxillofacial surgery (1)
- data compression (1)
- differential equations: (1)
- directed refinement (1)
- discontinuous finite element (1)
- diskontinuierliche Lösung (1)
- eigenvalue problem (1)
- eingebettete Ränder (1)
- electromagnetic scattering (1)
- elliptische Gleichungen (1)
- finite element methods: (1)
- floating point compression (1)
- grid generation (1)
- hamiltonian (1)
- hyperthermia (1)
- implant design (1)
- incomplete factorization (1)
- internal and boundary layers (1)
- lossy compression (1)
- medical t (1)
- mesh coarsening (1)
- mesh independence (1)
- multigrid (1)
- multigrid methods (1)
- multilev (1)
- multilevel (1)
- multilevel methods (1)
- neutron transport equation (1)
- non-symmetric linear systems (1)
- nonconvex minimization (1)
- nonlinear elastomechnics (1)
- nonlinear heat transfer (1)
- nonlinear partial differential equations (1)
- nonuniform meshes (1)
- optical chip design (1)
- optimal convergence rates (1)
- ordinary (1)
- partial (1)
- partial differential equation (1)
- perfectly matched layers (1)
- phased array optimization (1)
- pole condition (1)
- polyconvex elasticity (1)
- soft tissue simulation (1)
- sparse secant method (1)
- symmetric Gauss-Seidel (1)
- variable and discontinuous coefficients (1)
- variable und diskontinuierliche Koeffizienten (1)
- waveguide (1)
Institute
In the present paper, the improvement of an incomplete factorization of a non-symmetric matrix A is discussed. Starting from the ideas of sparsity preserving quasi-Newton methods, an algorithm is developed which improves the approximation of A by the incomplete factorization maintaining the sparsity structure of the matrices. No renumbering of the unknowns or the admittance of additional fill-in is necessary. The linear convergence of the algorithm is proved under the assumption, that $ L $ and $ U $* have the same sparsity structure and an incomplete factorization with some reasonable approximation property exits. In combination with this algorithm, the method of incomplete factorization and its several modifications are applicable to a wider class of problems with improved convergence qualities. This is shown by a numerical example. {\bf Key Words:} non-symmetric linear system, sparse secant method, incomplete factorization. AMS(MOS) {\bf Subject Classifications:} 65F10, 65N20, 65N30.
Kaskade 7 is a finite element toolbox for the solution of stationary or transient systems of partial differential equations, aimed at supporting application-oriented research in numerical analysis and scientific computing. The library is written in C++ and is based on the Dune interface. The code is independent of spatial dimension and works with different grid managers. An important feature is the mix-and-match approach to discretizing systems of PDEs with different ansatz and test spaces for all variables.
We describe the mathematical concepts behind the library as well as its structure, illustrating its use at several examples on the way.
Solvers for partial differential equations (PDE) are one of the cornerstones of computational science. For large problems, they involve huge amounts of data that needs to be stored and transmitted on all levels of the memory hierarchy. Often, bandwidth is the limiting factor due to relatively small arithmetic intensity, and increasingly so due to the growing disparity between computing power and bandwidth. Consequently, data compression techniques have been investigated and tailored towards the specific requirements of PDE solvers during the last decades. This paper surveys data compression challenges and corresponding solution approaches for PDE problems, covering all levels of the memory hierarchy from mass storage up to main memory. Exemplarily, we illustrate concepts at particular methods, and give references to alternatives.
We propose an anisotropic refinement strategy which is specially designed for the efficient numerical resolution of internal and boundary layers. This strategy is based on the directed refinement of single triangles together with adaptive multilevel grid orientation. It is demonstrated by several numerical examples that compared to usual methods, the new anisotropic refinement ends up in more stable and more accurate solutions at much less computational cost. {\bf Keywords:} Adaptive finite elements, directed refinement, adaptive grid orientation, convection diffusion equation, internal and boundary layers.
The finite element discretization of many elliptic boundary value problems leads to linear systems with positive definite and symmetric coefficient matrices. Many efficient preconditioners are known for these systems. We show that these preconditioning matrices can be used also for the linear systems arising from boundary value problems which are potentially indefinite due to lower order terms in the partial differential equation. Our main tool is a careful algebraic analysis of the condition numbers and the spectra of perturbed matrices which are preconditioned by the same matrices as in the unperturbed case. {\bf Keywords: }Preconditioned conjugate gradient methods, finite elements. {\bf Subject Classification: } AMS(MOS):65F10, 65N20, 65N30.
This paper presents concepts and implementation of the finite element toolbox Kaskade 7, a flexible C++ code for solving elliptic and parabolic PDE systems. Issues such as problem formulation, assembly and adaptivity are discussed at the example of optimal control problems. Trajectory compression for parabolic optimization problems is considered as a case study.
We derive and analyze the hierarchical basis-multigrid method for solving discretizations of self-adjoint, elliptic boundary value problems using piecewise linear triangular finite elements. The method is analyzed as a block symmetric Gauß- Seidel iteration with inner iterations, but it is strongly related to 2-level methods, to the standard multigrid V-cycle, and to earlier Jacobi-like hierarchical basis methods. The method is very robust, and has a nearly optimal convergence rate and work estimate. It is especially well suited to difficult problems with rough solutions, discretized using highly nonuniform, adaptively refined meshes.
Transparent boundary conditions for Maxwell's equations: Numerical concepts beyond the PML method
(2009)
Optical technologies are ubiquitously used in hi-tech devices. As a common feature of such devices one finds structures with dimensions in the order of the wavelength of the used light. To design and produce such devices, the wave nature of light must be taken into account. Accordingly, robust simulation tools are required which are based on rigorously solving Maxwell's equations, the governing equations of light propagation within macroscopic media. This thesis contributes to the modeling and the numerical computation of light scattering problems: Light scattering problems are typically posed on the entire space. The Perfectly-Matched -Layer method (PML) is widely used to restrict the simulation problem onto a bounded computational domain. We propose an adaptive PML method which exhibits a good convergence even for critical problems where standard PML implementations fail. Besides the computation of the near field, that is the electromagnetic field within the computational domain, it is of major interest to evaluate the electromagnetic field in the exterior domain and to compute the far field. So far, this was numerically only possible for simple geometries such as homogeneous exterior domains or layered media. To deal with more complicated devices, for example with waveguide inhomogeneities, we develop an evaluation formula based on the PML solution which allows for an exterior domain field evaluation in a half space above the device. Finally, we generalize the PML method to problems with multiply structured exterior domains. The term “multiply structured exterior domain” is defined in this thesis and means that the exterior domain exhibits several half-infinite structures. Mathematically, this gives rise to various complications. For example, no analytical solutions to Maxwell's equations for standard light sources are available in the exterior domain, which are needed to describe the incoming field in a light scattering problem. To tackle this we propose a new light scattering problem formulation which fits well into the PML method framework and which may be regarded as an extension of classical contributions by Sommerfeld, Wiener and Hopf. An exterior domain evaluation formula for multiply structured exterior domains with an extended illumination is derived as well.
The hierarchical basis preconditioner and the recent preconditioner of BRAMBLE, PASCIAK and XU are derived and analyzed within a joint framework. This discussion elucidates the close relationship between both methods. Special care is devoted to highly nonuniform meshes; our theory is based exclusively on local properties like the shape regularity of the finite elements.